Wide-baseline stereo matching is a common problem of computer vision. By the explosion of smartphones equipped with camera modules, many classical computer vision solutions have been adapted to such platforms. Considering the widespread use of various networking options for mobile phones, one can consider a set of smart phones as an ad-hoc camera network, where each camera is equipped with a more and more powerful computing engine in addition to a limited bandwidth communication with other devices. Therefore the performance of classical vision algorithms in a collaborative mobile environment is of particular interest. In such a scenario we expect that the images are taken almost simultaneously but from different viewpoints, implying that the camera poses are significantly different but lighting conditions are the same. In this work, we provide quantitative comparison of the most important keypoint detectors and descriptors in the context of wide baseline stereo matching. We found that for resolution of 2 megapixels images the current mobile hardware is capable of providing results efficiently.

JF - Proceedings of the International Symposium on Image and Signal Processing and Analysis (ISPA) PB - IEEE CY - Trieste ER - TY - CHAP T1 - On Topology Preservation in Triangular, Square, and Hexagonal Grids T2 - Proceedings of International Symposium on Image and Signal Processing and Analysis (ISPA) Y1 - 2013 A1 - Péter Kardos A1 - Kálmán Palágyi ED - Giovanni Ramponi ED - Sven Lončarić ED - Alberto Carini ED - Karen Egiazarian AB -

There are three possible partitionings of the continuous plane into regular polygons that leads to triangular, square, and hexagonal grids. The topology of the square grid is fairly well-understood, but it cannot be said of the remaining two regular sampling schemes. This paper presents a general characterization of simple pixels and some simplified sufficient conditions for topology-preserving operators in all the three types of regular grids.

JF - Proceedings of International Symposium on Image and Signal Processing and Analysis (ISPA) PB - IEEE CY - Trieste ER - TY - CONF T1 - A uniqueness result for reconstructing hv-convex polyominoes from horizontal and vertical projections and morphological skeleton T2 - Proceedings of International Symposium on Image and Signal Processing and Analysis (ISPA) Y1 - 2013 A1 - Norbert Hantos A1 - Péter Balázs ED - Giovanni Ramponi ED - Sven Lončarić ED - Alberto Carini ED - Karen Egiazarian AB -In this article we study the uniqueness of the reconstruction in a special class of 4-connected hv-convex images, using two projections and the so-called morphological skeleton. Generally, if just the two projections are given, there can be exponentially many hv-convex 4-connected images satisfying them. Knowing the morphological skeleton in addition, we can reduce the number of solutions. In the studied class, the images are defined by two parameters. We show that the uniqueness of their reconstruction depends only on the values of those parameters.

JF - Proceedings of International Symposium on Image and Signal Processing and Analysis (ISPA) PB - IEEE CY - Trieste ER - TY - CONF T1 - 2D Parallel Thinning Algorithms Based on Isthmus-Preservation T2 - Proceedings of the International Symposium on Image and Signal Processing and Analysis (ISPA) Y1 - 2011 A1 - Gábor Németh A1 - Kálmán Palágyi ED - Sven Lončarić ED - Giovanni Ramponi ED - D. Sersic AB -

Skeletons are widely used shape descriptors which summarize the general form of binary objects. A technique to obtain skeletons is the thinning, that is an iterative layer-by-layer erosion in a topology-preserving way. Conventional thinning algorithms preserve line endpoints to provide important geometric information relative to the object to be represented. Bertrand and Couprie proposed an alternative strategy by accumulating isthmus points that are line interior points. In this paper we present six new 2D parallel thinning algorithms that are derived from some sufficient conditions for topology preserving reductions and based on isthmus-preservation.

JF - Proceedings of the International Symposium on Image and Signal Processing and Analysis (ISPA) PB - IEEE CY - Dubrovnik, Croatia SN - 978-1-4577-0841-1 N1 - ScopusID: 83455172782 ER - TY - CHAP T1 - Object subsampling strategies to improve computational performance T2 - Proceedings of the 6th International Symposium on Image and Signal Processing and Analysis Y1 - 2009 A1 - András Hajdú A1 - Péter Veres A1 - Attila Tanacs A1 - Rorland Harangozó ED - P Zinterhof ED - Sven Lončarić ED - A Uhl ED - Alberto Carini AB -We investigate object simplification methods based on Centroidal Voronoi Tesselation (CVT) that share the possibility of great speed-ups in various scenarios. We propose Constrained CVT to sample points from the object boundary and the Region-based CVT to be able to subsample lower dimensional objects, as well. Moreover we introduce custom weight functions based on object properties. Thus, wecan be more specific on what are the important parts of the subsampled object. We also list several novel applications corresponding to the theoretical achivements presented. The advantages of applying the subsampling strategies are presented for registration, human detection, and the segmentation of the retinal vascular system, respectively. Quantitative results are shown to check the deterioration of the accuracy with the level of subsampling, and the computational gain. We also make comparisons with other naive (e.g. random) subsampling methods.

JF - Proceedings of the 6th International Symposium on Image and Signal Processing and Analysis PB - IEEE Press CY - Salzburg N1 - ScopusID: 70450253246 ER - TY - CHAP T1 - Reconstructing some hv-convex binary images from three or four projections T2 - Proccedings of the 5th International Symposium on Image and Signal Processing and Analysis Y1 - 2007 A1 - Péter Balázs ED - M Petrou ED - T Saramaki ED - Aytul Ercil ED - Sven Lončarić AB -The reconstruction of binary images from their projections is animportant problem in discrete tomography. The main challenge in this task is that in certain cases the projections do not uniquely determine the binary image. This can yield an extremely large number of (sometimes very different) solutions. Moreover, under certain circumstances the reconstruction becomes NP-hard. A commonly used technique to reduce ambiguity and to avoid intractability is to suppose that the image to be reconstructed arises from a certain class of images having some geometrical properties. This paper studies the reconstruction problem in the class of hv-convex images having their components in so-called decomposable configurations. First, we give a negative result showing that there can be exponentially many images of the above class having the same three projections. Then, we present a heuristic that uses four projections to reconstruct an hv-convex image with decomposable configuration. We also analyze the performance of our heuristic from the viewpoints of accuracy and running time.

JF - Proccedings of the 5th International Symposium on Image and Signal Processing and Analysis PB - IEEE CY - Istanbul, Turkey SN - 978-953-184-116-0 N1 - UT: 000253387900025ScopusID: 7949129892doi: 10.1109/ISPA.2007.4383678 ER - TY - CHAP T1 - Virtual Dissection of the Colon T2 - 3D Image Processing Y1 - 2002 A1 - Erich Sorantin A1 - Emese Balogh A1 - Anna Vilanova Bartroli A1 - Kálmán Palágyi A1 - László Gábor Nyúl A1 - Sven Lončarić A1 - Marco Subasic A1 - Domagoj Kovacevic ED - Davide Caramella ED - Carlo Bartolozzi JF - 3D Image Processing PB - Springer-Verlag CY - New York N1 - doi: 10.1007/978-3-642-59438-0_18 ER - TY - CHAP T1 - Virtual Dissection of the Colon Based on Helical CT Data - Can It Be Done? T2 - Proceedings of the 2nd International Symposium on Image and Signal Processing and Analysis, ISPA 2001, Pula, Croatia Y1 - 2001 A1 - Erich Sorantin A1 - Emese Balogh A1 - Anna Vilanova Bartroli A1 - Kálmán Palágyi A1 - László Gábor Nyúl ED - Sven Lončarić ED - Hrvoje Babic AB - Colorectal cancer is the third most commonly diagnosed cancer;and colonic polyps are known precursors of that particular cancer. Virtual dissection refers to a display technique for polyp detection based on helical CT data, where the colon is dissected and flattened as on the pathologist's table. The approach and image processing as well as the early experience are described in this paper. JF - Proceedings of the 2nd International Symposium on Image and Signal Processing and Analysis, ISPA 2001, Pula, Croatia PB - University of Zagreb CY - Zagreb N1 - doi: 10.1109/ISPA.2001.938632 ER -