Marin Oršić

Dr. Marin Oršić

Microblink, Zagreb, Zagreb, Grad, Croatia

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
1 February 2021 in Pattern Recognition
Verified
Journal Article
Closed access
MOMarin Oršić
Marin Oršić
SŠSiniša Šegvić
Siniša Šegvić

13 January 2023 in Sensors
Verified
Journal Article
Open access
PDF file
IGIvan Grubišić
Ivan Grubišić
MOMarin Oršić
Marin Oršić
SŠSiniša Šegvić
Siniša Šegvić
Semi-supervised learning is an attractive technique in practical deployments of deep models since it relaxes the dependence on labeled data. It is especially important in the scope of dense prediction because pixel-level annotation requires substantial effort. This paper considers semi-supervised algorithms that enforce consistent predictions over perturbed unlabeled inputs. We study the advantages of perturbing only one of the two model instances and preventing the backward pass through the unperturbed instance. We also propose a competitive perturbation model as a composition of geometric warp and photometric jittering. We experiment with efficient models due to their importance for real-time and low-power applications. Our experiments show clear advantages of (1) one-way consistency, (2) perturbing only the student branch, and (3) strong photometric and geometric perturbations. Our perturbation model outperforms recent work and most of the contribution comes from the photometric component. Experiments with additional data from the large coarsely annotated subset of Cityscapes suggest that semi-supervised training can outperform supervised training with coarse labels. Our source code is available at https://github.com/Ivan1248/semisup-seg-efficient.

7 April 2023 in Remote Sensing
Verified
Journal Article
Open access
PDF file
JŠJosip Šarić
Josip Šarić
MOMarin Oršić
Marin Oršić
SŠSiniša Šegvić
Siniša Šegvić
Dense panoptic prediction is a key ingredient in many existing applications such as autonomous driving, automated warehouses, or remote sensing. Many of these applications require fast inference over large input resolutions on affordable or even embedded hardware. We proposed to achieve this goal by trading off backbone capacity for multi-scale feature extraction. In comparison with contemporaneous approaches to panoptic segmentation, the main novelties of our method are efficient scale-equivariant feature extraction, cross-scale upsampling through pyramidal fusion and boundary-aware learning of pixel-to-instance assignment. The proposed method is very well suited for remote sensing imagery due to the huge number of pixels in typical city-wide and region-wide datasets. We present panoptic experiments on Cityscapes, Vistas, COCO, and the BSB-Aerial dataset. Our models outperformed the state-of-the-art on the BSB-Aerial dataset while being able to process more than a hundred 1MPx images per second on an RTX3090 GPU with FP16 precision and TensorRT optimization.

30 January 2024 in International Journal of Computer Vision
Verified
Journal Article
Closed access
PDF file
Petra BevandićPetra Bevandić
Petra Bevandić
MOMarin Oršić
Marin Oršić
JŠJosip Šarić
Josip Šarić
IGIvan Grubišić
Ivan Grubišić
SŠSiniša Šegvić
Siniša Šegvić

20 January 2023 in arXiv
Verified
Preprint
Open access
PDF file
IGIvan Grubišić
Ivan Grubišić
MOMarin Oršić
Marin Oršić
SŠSiniša Šegvić
Siniša Šegvić
Semi-supervised learning an attractive technique in practical deployments of deep models since it relaxes the dependence on labeled data. It is especially important in the scope of dense prediction because pixel-level annotation requires significant effort. This paper considers semi-supervised algorithms that enforce consistent predictions over perturbed unlabeled inputs. We study the advantages of perturbing only one of the two model instances and preventing the backward pass through the unperturbed instance. We also propose a competitive perturbation model as a composition of geometric warp and photometric jittering. We experiment with efficient models due to their importance for real-time and low-power applications. Our experiments show clear advantages of (1) one-way consistency, (2) perturbing only the student branch, and (3) strong photometric and geometric perturbations. Our perturbation model outperforms recent work and most of the contribution comes from photometric component. Experiments with additional data from the large coarsely annotated subset of Cityscapes suggest that semi-supervised training can outperform supervised training with the coarse labels.

7 October 2021 in arXiv
Verified
Preprint
Open access
PDF file
Petra BevandićPetra Bevandić
Petra Bevandić
MOMarin Oršić
Marin Oršić
IGIvan Grubišić
Ivan Grubišić
JŠJosip Šarić
Josip Šarić
SŠSiniša Šegvić
Siniša Šegvić
We present our submission to the semantic segmentation contest of the Robust Vision Challenge held at ECCV 2020. The contest requires submitting the same model to seven benchmarks from three different domains. Our approach is based on the SwiftNet architecture with pyramidal fusion. We address inconsistent taxonomies with a single-level 193-dimensional softmax output. We strive to train with large batches in order to stabilize optimization of a hard recognition problem, and to favour smooth evolution of batchnorm statistics. We achieve this by implementing a custom backward step through log-sum-prob loss, and by using small crops before freezing the population statistics. Our model ranks first on the RVC semantic segmentation challenge as well as on the WildDash 2 leaderboard. This suggests that pyramidal fusion is competitive not only for efficient inference with lightweight backbones, but also in large-scale setups for multi-domain application.