nedelja, 16. maj 2021 Polygonization of connected areas in binary image
Jutri, v ponedeljek, 17. maja 2021, bosta ob 16.00 uri prek spletnih orodij na daljavo izvedeni
dve predavanji v okviru PONEDELJKOVEGA SEMINARJA RAČUNALNIŠTVA IN INFORMATIKE
Oddelkov za Informacijske znanosti in tehnologije UP FAMNIT in UP IAM.
ČAS/PROSTOR: 17. maj 2021 ob 16.00 na daljavo
1. predstavitev:
-------------------------------------
PREDAVATELJ: Nedim ŠIŠIĆ
-------------------------------------
Nedim Šišić is a first year student of the master programme in Computer Science at UP FAMNIT. He will be presenting his Research seminar topic that he completed under the supervision of prof. Martin Milanič.
---------------------------------------------------------------------------------
NASLOV: Polygonization of connected areas in binary image
---------------------------------------------------------------------------------
POVZETEK:
In image processing, vectorization is the conversion of raster images to vector images. A special kind of vectorization is polygonization, which deals with finding polygonal approximations. Most existing vectorization methods process entire images, which is unnecessary if we are only interested in a single part of an image. We investigate approaches to polygonizing connected areas in binary images. By restricting the scope of vectorization, we reduce its time and memory requirements.
---------------------------------------------------------------------------------------------------
Predavanje bo potekalo v angleškem jeziku prek spletnega orodja Zoom.
Do predavanja dostopate tako, da se povežete prek sledeče povezave:
https://upr-si.zoom.us/j/297328207
Vabljeni!
2. predstavitev:
----------------------------------------------
PREDAVATELJ: Albert KHAIDAROV
----------------------------------------------
Albert Khaidarov is a first year student of the master programme in Computer Science at UP FAMNIT. He will be presenting his Research seminar topic that he completed under the supervision of assist. prof. Dávid Balázs.
-------------------------------------------------------------------------------------------------------------------------------------------
NASLOV: A Hybrid Clustering Algorithm for solving the Vehicle Routing Problem in Waste Management
-------------------------------------------------------------------------------------------------------------------------------------------
POVZETEK:
Proper collection of waste is important for building sustainable and livable cities, but it remains a great challenge for us. The purpose of my research is to find an effective solution approach for the Vehicle Routing Problem in waste management. My work involves the usage of the best known clustering algorithm K-Means.This method performs a single clustering of the vertex set and then determines a vehicle route on each cluster. For optimization, solutions of the clustering algorithm can be extended with different heuristic and metaheuristic methods.
---------------------------------------------------------------------------------------------------
Predavanje bo potekalo v angleškem jeziku prek spletnega orodja Zoom.
Do predavanja dostopate tako, da se povežete prek sledeče povezave:
https://upr-si.zoom.us/j/297328207
Vabljeni!