3D OBJECT RECOGNITION USING OCTREE MODEL AND FAST SEARCH ALGORITHM

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F10%3A86075421" target="_blank" >RIV/61989100:27240/10:86075421 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

3D OBJECT RECOGNITION USING OCTREE MODEL AND FAST SEARCH ALGORITHM

Popis výsledku v původním jazyce

This paper presents a new approach to 3D object recognition by using an Octree model library (OML) I, II and fast search algorithm. The fast search algorithm is used for finding the 4 pairs of feature points to estimate the viewing direction uses on effective two level database. The method is based on matching the object contour to the reference occluded shapes of 49, 118 viewing directions. The initially bestmatched viewing direction is calibrated by searching for the 4 pairs of feature points betweenthe input image and the image projected along the estimated viewing direction. At this point, the input shape is recognized by matching it to the projected shape. The computational complexity of the proposed method is shown to be O(n(2)) in the worst case, and that of the simple combinatorial method of O(m(4), n(2)) where n and m denote the number of feature points of the 3D model object and the 2D object, respectively.

Název v anglickém jazyce

3D OBJECT RECOGNITION USING OCTREE MODEL AND FAST SEARCH ALGORITHM

Popis výsledku anglicky

This paper presents a new approach to 3D object recognition by using an Octree model library (OML) I, II and fast search algorithm. The fast search algorithm is used for finding the 4 pairs of feature points to estimate the viewing direction uses on effective two level database. The method is based on matching the object contour to the reference occluded shapes of 49, 118 viewing directions. The initially bestmatched viewing direction is calibrated by searching for the 4 pairs of feature points betweenthe input image and the image projected along the estimated viewing direction. At this point, the input shape is recognized by matching it to the projected shape. The computational complexity of the proposed method is shown to be O(n(2)) in the worst case, and that of the simple combinatorial method of O(m(4), n(2)) where n and m denote the number of feature points of the 3D model object and the 2D object, respectively.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2010

Kód důvěrnosti údajů

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

Název periodika

NEURAL NETWORK WORLD

ISSN

1210-0552

e-ISSN

—

Svazek periodika

20

Číslo periodika v rámci svazku

3

Stát vydavatele periodika

CZ - Česká republika

Počet stran výsledku

11

Strana od-do

—

Kód UT WoS článku

000280426100007

EID výsledku v databázi Scopus

—