Není k dispozici

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F06%3A03124625" target="_blank" >RIV/68407700:21230/06:03124625 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Geometric Hashing with Local Affine Frames

Popis výsledku v původním jazyce

We propose a novel representation of local image structure and a matching scheme that are insensitive to a wide range of appearance changes. The representation is a collection of local affine frames that are constructed on outer boundaries of maximally stable extremal regions (MSERs) in an affine-covariant way. Each local affine frame is de- scribed by a relative location of other local affine frames in its neighborhood. The image is thus represented by quan- tities that depend only on the location of the boundaries of MSERs. Inter-image correspondences between local affine frames are formed in constant time by geometric hashing. Direct detection of local affine frames removes the require- ment of point-based hashing to establish reference frames in acombinatorial way, which has in the case of affine trans- form complexity that is cubic in the number of points. Local affine frames, which are also the quantities represented in the hash table, occupy a 6D space and hence data collisions

Název v anglickém jazyce

Geometric Hashing with Local Affine Frames

Popis výsledku anglicky

We propose a novel representation of local image structure and a matching scheme that are insensitive to a wide range of appearance changes. The representation is a collection of local affine frames that are constructed on outer boundaries of maximally stable extremal regions (MSERs) in an affine-covariant way. Each local affine frame is de- scribed by a relative location of other local affine frames in its neighborhood. The image is thus represented by quan- tities that depend only on the location of the boundaries of MSERs. Inter-image correspondences between local affine frames are formed in constant time by geometric hashing. Direct detection of local affine frames removes the require- ment of point-based hashing to establish reference frames in acombinatorial way, which has in the case of affine trans- form complexity that is cubic in the number of points. Local affine frames, which are also the quantities represented in the hash table, occupy a 6D space and hence data collisions

Druh

D - Stať ve sborníku

CEP obor

JD - Využití počítačů, robotika a její aplikace

OECD FORD obor

—

Projekt

<a href="/cs/project/1M0567" target="_blank" >1M0567: Centrum aplikované kybernetiky</a><br>

Návaznosti

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

Rok uplatnění

2006

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 statě ve sborníku

Proceedings of Conference on Computer Vision and Pattern Recognition (CVPR)

ISBN

0-7695-2597-0

ISSN

—

e-ISSN

—

Počet stran výsledku

6

Strana od-do

879-884

Název nakladatele

IEEE Computer Society Press

Místo vydání

Los Alamitos

Místo konání akce

New York

Datum konání akce

17. 6. 2006

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—