Sinisa Tomic

Sinisa Tomic

Auto-generated profile, based on publicly available information

Sinisa Tomic

Information Support Centre, Faculty of Electrical Engineering and Computing, University of Zagreb, 10000 Zagreb, Croatia

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
15 May 2023 in Applied Sciences
Verified
Journal Article
Open access
PDF file
Branimir PervanBranimir Pervan
Branimir Pervan
STSinisa Tomic
Sinisa Tomic
Hana IvandicHana Ivandic
Hana Ivandic
JKJosip Knezovic
Josip Knezovic
Despite the existing medical infrastructure being limited in terms of interoperability, the amount of medical multimedia transferred over the network and shared through various channels increases rapidly. In search of consultations with colleagues, medical professionals with the consent of their patients, usually exchange medical multimedia, mainly in the form of images, by using standard instant messaging services which utilize lossy compression algorithms. That consultation paradigm can easily lead to losses in image representation that can be misinterpreted and lead to the wrong diagnosis. This paper presents MIDOM—Medical Imaging and Diagnostics on the Move, a DICOM-based medical image communication system enhanced with a couple of variants of our previously developed custom lossless Classification and Blending Predictor Coder (CBPC) compression method. The system generally exploits the idea that end devices used by the general population and medical professionals alike are satisfactorily performant and energy-efficient, up to a point to support custom and complex compression methods successfully. The system has been implemented and appropriately integrated with Orthanc, a lightweight DICOM server, and a medical images storing PACS server. We benchmarked the system thoroughly with five real-world anonymized medical image sets in terms of compression ratios and latency reduction, aiming to simulate scenarios in which the availability of the medical services might be hardly reachable or in other ways limited. The results clearly show that our system enhanced with the compression methods in the question pays off in nearly every testing scenario by lowering the network latency to at least 60% of the latency required to send raw and uncompressed image sets and 25% in the best-case, while maintaining the perfect reconstruction of medical images and, thus, providing a more suitable environment for healthcare applications.

16 September 2019 in IEEE Access
Verified
Journal Article
Open access
VPV. Paunovic
V. Paunovic
STS. Tomic
S. Tomic
IBI. Bosnic
I. Bosnic
MZM. Zagar
M. Zagar
This paper presents a novel algorithm for solving a Student-Project Allocation problem, a variation of a two-sided matching algorithm, where a large number of students are allocated to numerous projects with limited available allocation places. Several new or improved algorithms are proposed, inspired by recommender systems and combined into a genetic algorithm. The main two algorithms are (i) variating the master list of student average grade ranking inspired by a fuzzy approach and (ii) extending the incomplete project preference lists by exploring the similarities of student choices, thus minimizing the number of randomly allocated students. The algorithm was implemented for allocating more than 500 students to more than 200 projects, in a course at the University of Zagreb, Faculty of Electrical Engineering and Computing. We compared our algorithm with the Deferred Acceptance (DA) Algorithm to check its validity. Using the fuzzy approach, the number of unallocated students decreased by 10% with almost no effect to the top-ranked students. The combined usage of all proposed algorithms increased the number of successfully allocated students by more than 25%.

1 May 2019
Verified
Conference Paper
Closed access
VPV. Paunovic
V. Paunovic
STS. Tomic
S. Tomic
IBI. Bosnic
I. Bosnic
MZM. Zagar
M. Zagar