Finding correspondences between images is a crucial activity in many overlapping fields of research, such as Image Retrieval and Pattern Recognition. Many existing techniques address this problem using local invariant image features, instead of color, shape and texture, that to some degree loose the large scale structure of the image. In this thesis, in order to account for spatial relations among the local invariant features and to improve the image representation, first a graph data structure is introduced, where local features are represented by nodes and spatial relations by edges; second an algorithm able to find matches between local invariant features, organized in graph structures, is built; third a mapping procedure from graph to vector space is proposed, in order to speed up the classification process. Effectiveness of the proposed framework is demonstrated through applications in image-based localization and art painting. The literature shows many approximate algorithms to solve these problems, so a comparison with the state of the art is performed in each step of the process. By using both local and spatial information, the proposed framework outperforms its competitors for the image correspondence problems.
ATTRIBUTED RELATIONAL SIFT-BASED REGIONS GRAPH (ARSRG):DESCRIPTION, MATCHING AND APPLICATIONS / M. Manzo ; tutor: A. Petrosino ; coordinatore: E. Damiani. DIPARTIMENTO DI INFORMATICA, 2014 Mar 18. 25. ciclo, Anno Accademico 2012. [10.13130/manzo-mario_phd2014-03-18].
ATTRIBUTED RELATIONAL SIFT-BASED REGIONS GRAPH (ARSRG):DESCRIPTION, MATCHING AND APPLICATIONS
M. Manzo
2014
Abstract
Finding correspondences between images is a crucial activity in many overlapping fields of research, such as Image Retrieval and Pattern Recognition. Many existing techniques address this problem using local invariant image features, instead of color, shape and texture, that to some degree loose the large scale structure of the image. In this thesis, in order to account for spatial relations among the local invariant features and to improve the image representation, first a graph data structure is introduced, where local features are represented by nodes and spatial relations by edges; second an algorithm able to find matches between local invariant features, organized in graph structures, is built; third a mapping procedure from graph to vector space is proposed, in order to speed up the classification process. Effectiveness of the proposed framework is demonstrated through applications in image-based localization and art painting. The literature shows many approximate algorithms to solve these problems, so a comparison with the state of the art is performed in each step of the process. By using both local and spatial information, the proposed framework outperforms its competitors for the image correspondence problems.File | Dimensione | Formato | |
---|---|---|---|
phd_unimi_R08661.pdf
accesso aperto
Tipologia:
Tesi di dottorato completa
Dimensione
5.14 MB
Formato
Adobe PDF
|
5.14 MB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.