<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Viktor Varjas</style></author><author><style face="normal" font="default" size="100%">Attila Tanacs</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Giovanni Ramponi</style></author><author><style face="normal" font="default" size="100%">Sven Lončarić</style></author><author><style face="normal" font="default" size="100%">Alberto Carini</style></author><author><style face="normal" font="default" size="100%">Karen Egiazarian</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Car Recognition from Frontal Images in Mobile Environment</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of ISPA 2013 8th International Symposium on Image and Signal Processing and Analysis</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Sep 2013</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">University of Zagreb; University of Trieste</style></publisher><pub-location><style face="normal" font="default" size="100%">Trieste</style></pub-location><pages><style face="normal" font="default" size="100%">812 - 816</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">Conference paper</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Endre Juhász</style></author><author><style face="normal" font="default" size="100%">Attila Tanacs</style></author><author><style face="normal" font="default" size="100%">Zoltan Kato</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Giovanni Ramponi</style></author><author><style face="normal" font="default" size="100%">Sven Lončarić</style></author><author><style face="normal" font="default" size="100%">Alberto Carini</style></author><author><style face="normal" font="default" size="100%">Karen Egiazarian</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Evaluation of Point Matching Methods for Wide-baseline Stereo Correspondence on Mobile Platforms</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the International Symposium on Image and Signal Processing and Analysis (ISPA)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Sep 2013</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">IEEE</style></publisher><pub-location><style face="normal" font="default" size="100%">Trieste</style></pub-location><pages><style face="normal" font="default" size="100%">806 - 811</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;div class=&quot;article&quot;&gt;&lt;p&gt;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.&lt;/p&gt;&lt;/div&gt;&lt;p&gt;&amp;nbsp;&lt;/p&gt;</style></abstract><work-type><style face="normal" font="default" size="100%">Conference paper</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Péter Kardos</style></author><author><style face="normal" font="default" size="100%">Kálmán Palágyi</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Giovanni Ramponi</style></author><author><style face="normal" font="default" size="100%">Sven Lončarić</style></author><author><style face="normal" font="default" size="100%">Alberto Carini</style></author><author><style face="normal" font="default" size="100%">Karen Egiazarian</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">On Topology Preservation in Triangular, Square, and Hexagonal Grids</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of International Symposium on Image and Signal Processing and Analysis (ISPA)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Sep 2013</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">IEEE</style></publisher><pub-location><style face="normal" font="default" size="100%">Trieste</style></pub-location><pages><style face="normal" font="default" size="100%">782 - 787</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;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.&lt;/p&gt;</style></abstract><work-type><style face="normal" font="default" size="100%">Conference paper</style></work-type><accession-num><style face="normal" font="default" size="100%">14027933 </style></accession-num></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Norbert Hantos</style></author><author><style face="normal" font="default" size="100%">Péter Balázs</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Giovanni Ramponi</style></author><author><style face="normal" font="default" size="100%">Sven Lončarić</style></author><author><style face="normal" font="default" size="100%">Alberto Carini</style></author><author><style face="normal" font="default" size="100%">Karen Egiazarian</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">A uniqueness result for reconstructing hv-convex polyominoes from horizontal and vertical projections and morphological skeleton</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of International Symposium on Image and Signal Processing and Analysis (ISPA)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Sep 2013</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">IEEE</style></publisher><pub-location><style face="normal" font="default" size="100%">Trieste</style></pub-location><pages><style face="normal" font="default" size="100%">788 - 793</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;div class=&quot;article&quot;&gt;&lt;p&gt;In this article we study the &lt;span class=&quot;snippet&quot;&gt;uniqueness&lt;/span&gt; of the reconstruction in a special class of 4-connected &lt;span class=&quot;snippet&quot;&gt;hv&lt;/span&gt;-&lt;span class=&quot;snippet&quot;&gt;convex&lt;/span&gt; images, using two &lt;span class=&quot;snippet&quot;&gt;projections&lt;/span&gt; and the so-called &lt;span class=&quot;snippet&quot;&gt;morphological&lt;/span&gt; &lt;span class=&quot;snippet&quot;&gt;skeleton&lt;/span&gt;. Generally, if just the two &lt;span class=&quot;snippet&quot;&gt;projections&lt;/span&gt; are given, there can be exponentially many &lt;span class=&quot;snippet&quot;&gt;hv&lt;/span&gt;-&lt;span class=&quot;snippet&quot;&gt;convex&lt;/span&gt; 4-connected images satisfying them. Knowing the &lt;span class=&quot;snippet&quot;&gt;morphological&lt;/span&gt; &lt;span class=&quot;snippet&quot;&gt;skeleton&lt;/span&gt; in addition, we can reduce the number of solutions. In the studied class, the images are defined by two parameters. We show that the &lt;span class=&quot;snippet&quot;&gt;uniqueness&lt;/span&gt; of their reconstruction depends only on the values of those parameters.&lt;/p&gt;&lt;/div&gt;&lt;p&gt;&amp;nbsp;&lt;/p&gt;</style></abstract><work-type><style face="normal" font="default" size="100%">Conference paper</style></work-type><accession-num><style face="normal" font="default" size="100%">14027951 </style></accession-num></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Gábor Németh</style></author><author><style face="normal" font="default" size="100%">Kálmán Palágyi</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Sven Lončarić</style></author><author><style face="normal" font="default" size="100%">Giovanni Ramponi</style></author><author><style face="normal" font="default" size="100%">D. Sersic</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">2D Parallel Thinning Algorithms Based on Isthmus-Preservation</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the International Symposium on Image and Signal Processing and Analysis (ISPA)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Sep 2011 </style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">IEEE</style></publisher><pub-location><style face="normal" font="default" size="100%">Dubrovnik, Croatia</style></pub-location><pages><style face="normal" font="default" size="100%">585 - 590</style></pages><isbn><style face="normal" font="default" size="100%">978-1-4577-0841-1 </style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;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.&lt;/p&gt;</style></abstract><work-type><style face="normal" font="default" size="100%">Conference paper</style></work-type><accession-num><style face="normal" font="default" size="100%">12307467 </style></accession-num><notes><style face="normal" font="default" size="100%">ScopusID: 83455172782</style></notes></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">András Hajdú</style></author><author><style face="normal" font="default" size="100%">Péter Veres</style></author><author><style face="normal" font="default" size="100%">Attila Tanacs</style></author><author><style face="normal" font="default" size="100%">Rorland Harangozó</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">P Zinterhof</style></author><author><style face="normal" font="default" size="100%">Sven Lončarić</style></author><author><style face="normal" font="default" size="100%">A Uhl</style></author><author><style face="normal" font="default" size="100%">Alberto Carini</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Object subsampling strategies to improve computational performance</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the 6th International Symposium on Image and Signal Processing and Analysis</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Sep 2009</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">IEEE Press</style></publisher><pub-location><style face="normal" font="default" size="100%">Salzburg</style></pub-location><pages><style face="normal" font="default" size="100%">448 - 453</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;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.&lt;/p&gt;</style></abstract><work-type><style face="normal" font="default" size="100%">Conference paper</style></work-type><notes><style face="normal" font="default" size="100%">ScopusID: 70450253246</style></notes></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Péter Balázs</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">M Petrou</style></author><author><style face="normal" font="default" size="100%">T Saramaki</style></author><author><style face="normal" font="default" size="100%">Aytul Ercil</style></author><author><style face="normal" font="default" size="100%">Sven Lončarić</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Reconstructing some hv-convex binary images from three or four projections</style></title><secondary-title><style face="normal" font="default" size="100%">Proccedings of the 5th International Symposium on Image and Signal Processing and Analysis</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2007</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Sep 2007</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">IEEE</style></publisher><pub-location><style face="normal" font="default" size="100%">Istanbul, Turkey</style></pub-location><pages><style face="normal" font="default" size="100%">136 - 140</style></pages><isbn><style face="normal" font="default" size="100%">978-953-184-116-0 </style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;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.&lt;/p&gt;</style></abstract><work-type><style face="normal" font="default" size="100%">Conference paper</style></work-type><notes><style face="normal" font="default" size="100%">UT: 000253387900025ScopusID: 7949129892doi: 10.1109/ISPA.2007.4383678</style></notes></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Erich Sorantin</style></author><author><style face="normal" font="default" size="100%">Emese Balogh</style></author><author><style face="normal" font="default" size="100%">Anna Vilanova Bartroli</style></author><author><style face="normal" font="default" size="100%">Kálmán Palágyi</style></author><author><style face="normal" font="default" size="100%">László Gábor Nyúl</style></author><author><style face="normal" font="default" size="100%">Sven Lončarić</style></author><author><style face="normal" font="default" size="100%">Marco Subasic</style></author><author><style face="normal" font="default" size="100%">Domagoj Kovacevic</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Davide Caramella</style></author><author><style face="normal" font="default" size="100%">Carlo Bartolozzi</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Virtual Dissection of the Colon</style></title><secondary-title><style face="normal" font="default" size="100%">3D Image Processing</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2002</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2002///</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Springer-Verlag</style></publisher><pub-location><style face="normal" font="default" size="100%">New York</style></pub-location><pages><style face="normal" font="default" size="100%">197 - 209</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">doi: 10.1007/978-3-642-59438-0_18</style></notes></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Erich Sorantin</style></author><author><style face="normal" font="default" size="100%">Emese Balogh</style></author><author><style face="normal" font="default" size="100%">Anna Vilanova Bartroli</style></author><author><style face="normal" font="default" size="100%">Kálmán Palágyi</style></author><author><style face="normal" font="default" size="100%">László Gábor Nyúl</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Sven Lončarić</style></author><author><style face="normal" font="default" size="100%">Hrvoje Babic</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Virtual Dissection of the Colon Based on Helical CT Data - Can It Be Done?</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the 2nd International Symposium on Image and Signal Processing and Analysis, ISPA 2001, Pula, Croatia</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2001</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2001///</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">University of Zagreb</style></publisher><pub-location><style face="normal" font="default" size="100%">Zagreb</style></pub-location><pages><style face="normal" font="default" size="100%">224 - 229</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">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.
</style></abstract><notes><style face="normal" font="default" size="100%">doi: 10.1109/ISPA.2001.938632</style></notes></record></records></xml>