Graph-based Range Image Registration Combining Geometric and Photometric Features

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F07%3A03134579" target="_blank" >RIV/68407700:21230/07:03134579 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Graph-based Range Image Registration Combining Geometric and Photometric Features

Original language description

We propose a coarse registration method of range images using both geometric and photometric features. The framework of existing methods using multiple features first defines a single similarity distance summing up each feature based evaluations, and then minimizes the distance between range images for registration. In contrast, we formulate registration as a graph-based optimization problem, where we independently evaluate geometric feature and photometric feature and consider only the order of point-to-point matching quality. We then find as large consistent matching as possible in the sense of the matchingquality order. This is solved as one global combinatorial optimization problem. Our method thus does not require any good initial estimation and,at the same time, guarantees that the global solution is achieved.

Czech name

Graph-based Range Image Registration Combining Geometric and Photometric Features

Czech description

We propose a coarse registration method of range images using both geometric and photometric features. The framework of existing methods using multiple features first defines a single similarity distance summing up each feature based evaluations, and then minimizes the distance between range images for registration. In contrast, we formulate registration as a graph-based optimization problem, where we independently evaluate geometric feature and photometric feature and consider only the order of point-to-point matching quality. We then find as large consistent matching as possible in the sense of the matchingquality order. This is solved as one global combinatorial optimization problem. Our method thus does not require any good initial estimation and,at the same time, guarantees that the global solution is achieved.

Type

D - Article in proceedings

CEP classification

JD - Use of computers, robotics and its application

OECD FORD branch

—

Project

<a href="/en/project/1ET101210406" target="_blank" >1ET101210406: Automatic 3D Virtual Model Builder from Photographs</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2007

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

SCIA 2007: Proceedings of 15th Scandinavian Conference on Image Analysis

ISBN

978-3-540-73039-2

ISSN

—

e-ISSN

—

Number of pages

11

Pages from-to

542-552

Publisher name

Springer

Place of publication

Heidelberg

Event location

Aalborg

Event date

Jun 10, 2007

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—