00641nas a2200169 4500008004100000245006200041210006200103260006700165300001400232100001900246700001900265700002200284700002100306700002000327700002200347856010200369 2013 eng d00aCar Recognition from Frontal Images in Mobile Environment0 aCar Recognition from Frontal Images in Mobile Environment aTriestebUniversity of Zagreb; University of TriestecSep 2013 a812 - 8161 aVarjas, Viktor1 aTanacs, Attila1 aRamponi, Giovanni1 aLončarić, Sven1 aCarini, Alberto1 aEgiazarian, Karen uhttps://www.inf.u-szeged.hu/publication/car-recognition-from-frontal-images-in-mobile-environment01890nas a2200193 4500008004100000245010100041210006900142260002800211300001400239520116200253100001901415700001901434700001701453700002201470700002101492700002001513700002201533856014101555 2013 eng d00aEvaluation of Point Matching Methods for Wide-baseline Stereo Correspondence on Mobile Platforms0 aEvaluation of Point Matching Methods for Widebaseline Stereo Cor aTriestebIEEEcSep 2013 a806 - 8113 a
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.
1 aJuhász, Endre1 aTanacs, Attila1 aKato, Zoltan1 aRamponi, Giovanni1 aLončarić, Sven1 aCarini, Alberto1 aEgiazarian, Karen uhttps://www.inf.u-szeged.hu/publication/evaluation-of-point-matching-methods-for-wide-baseline-stereo-correspondence-on-mobile-platforms01101nas a2200181 4500008004100000245007200041210006700113260002800180300001400208520046000222100001900682700002300701700002200724700002100746700002000767700002200787856011000809 2013 eng d00aOn Topology Preservation in Triangular, Square, and Hexagonal Grids0 aTopology Preservation in Triangular Square and Hexagonal Grids aTriestebIEEEcSep 2013 a782 - 7873 a
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.
1 aKardos, Péter1 aPalágyi, Kálmán1 aRamponi, Giovanni1 aLončarić, Sven1 aCarini, Alberto1 aEgiazarian, Karen uhttps://www.inf.u-szeged.hu/publication/on-topology-preservation-in-triangular-square-and-hexagonal-grids01721nas a2200181 4500008004100000245013300041210006900174260002800243300001400271520095600285100002001241700002001261700002201281700002101303700002001324700002201344856017301366 2013 eng d00aA uniqueness result for reconstructing hv-convex polyominoes from horizontal and vertical projections and morphological skeleton0 auniqueness result for reconstructing hvconvex polyominoes from h aTriestebIEEEcSep 2013 a788 - 7933 aIn 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.
1 aHantos, Norbert1 aBalázs, Péter1 aRamponi, Giovanni1 aLončarić, Sven1 aCarini, Alberto1 aEgiazarian, Karen uhttps://www.inf.u-szeged.hu/publication/a-uniqueness-result-for-reconstructing-hv-convex-polyominoes-from-horizontal-and-vertical-projections-and-morphological-skeleton01310nas a2200181 4500008004100000020002300041245006600064210006500130260004000195300001400235520067200249100002000921700002300941700002100964700002200985700001501007856010601022 2011 eng d a978-1-4577-0841-1 00a2D Parallel Thinning Algorithms Based on Isthmus-Preservation0 a2D Parallel Thinning Algorithms Based on IsthmusPreservation aDubrovnik, CroatiabIEEEcSep 2011 a585 - 5903 a
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.
1 aNémeth, Gábor1 aPalágyi, Kálmán1 aLončarić, Sven1 aRamponi, Giovanni1 aSersic, D. uhttps://www.inf.u-szeged.hu/publication/2d-parallel-thinning-algorithms-based-on-isthmus-preservation