Registrace obrazových korespondencí získaných z více zdrojů
In the present work we study use of graph matching algorithms for registration of important image points obtained from di erent sources. We especially focus on acquiring more precise data for nal 3D model reconstruction from a large set of images with already known corresponding points. We give a sh...
Main Author: | |
---|---|
Other Authors: | |
Format: | Dissertation |
Language: | English |
Published: |
2008
|
Online Access: | http://www.nusl.cz/ntk/nusl-293851 |
id |
ndltd-nusl.cz-oai-invenio.nusl.cz-293851 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-nusl.cz-oai-invenio.nusl.cz-2938512017-06-27T04:42:02Z Registrace obrazových korespondencí získaných z více zdrojů Registrace obrazových korespondencí získaných z více zdrojů Pelikán, Josef Cáha, Matěj Buriánek, Jan In the present work we study use of graph matching algorithms for registration of important image points obtained from di erent sources. We especially focus on acquiring more precise data for nal 3D model reconstruction from a large set of images with already known corresponding points. We give a short overview of graph matching problem including de nitions, computational complexity and various approaches and examples of using graph matching algorithms for solving various problems in many elds. Then we propose our algorithm for approximation of attributed relational minimum cost sub{graph isomorphism problem that is able to match a large number of huge graphs in reasonable time. We also give a short overview of point correspondence problem and we implement suitable edge and vertex metrics for matching partial 2D and 3D model geometry and we test proposed algorithm on both real and synthetic data. We restrict our work to weak point correspondences supposing the nal reconstructed 3D model is built-up from faces. 2008 info:eu-repo/semantics/masterThesis http://www.nusl.cz/ntk/nusl-293851 eng info:eu-repo/semantics/restrictedAccess |
collection |
NDLTD |
language |
English |
format |
Dissertation |
sources |
NDLTD |
description |
In the present work we study use of graph matching algorithms for registration of important image points obtained from di erent sources. We especially focus on acquiring more precise data for nal 3D model reconstruction from a large set of images with already known corresponding points. We give a short overview of graph matching problem including de nitions, computational complexity and various approaches and examples of using graph matching algorithms for solving various problems in many elds. Then we propose our algorithm for approximation of attributed relational minimum cost sub{graph isomorphism problem that is able to match a large number of huge graphs in reasonable time. We also give a short overview of point correspondence problem and we implement suitable edge and vertex metrics for matching partial 2D and 3D model geometry and we test proposed algorithm on both real and synthetic data. We restrict our work to weak point correspondences supposing the nal reconstructed 3D model is built-up from faces. |
author2 |
Pelikán, Josef |
author_facet |
Pelikán, Josef Cáha, Matěj |
author |
Cáha, Matěj |
spellingShingle |
Cáha, Matěj Registrace obrazových korespondencí získaných z více zdrojů |
author_sort |
Cáha, Matěj |
title |
Registrace obrazových korespondencí získaných z více zdrojů |
title_short |
Registrace obrazových korespondencí získaných z více zdrojů |
title_full |
Registrace obrazových korespondencí získaných z více zdrojů |
title_fullStr |
Registrace obrazových korespondencí získaných z více zdrojů |
title_full_unstemmed |
Registrace obrazových korespondencí získaných z více zdrojů |
title_sort |
registrace obrazových korespondencí získaných z více zdrojů |
publishDate |
2008 |
url |
http://www.nusl.cz/ntk/nusl-293851 |
work_keys_str_mv |
AT cahamatej registraceobrazovychkorespondenciziskanychzvicezdroju |
_version_ |
1718470472904998912 |