About: Geometric Hashing with Local Affine Frames     Goto   Sponge   Distinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • Není k dispozici (cs)
  • 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 a combinatorial 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
  • 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 a combinatorial 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 (en)
Title
  • Geometric Hashing with Local Affine Frames
  • Není k dispozici (cs)
  • Geometric Hashing with Local Affine Frames (en)
skos:prefLabel
  • Geometric Hashing with Local Affine Frames
  • Není k dispozici (cs)
  • Geometric Hashing with Local Affine Frames (en)
skos:notation
  • RIV/68407700:21230/06:03124625!RIV07-MSM-21230___
http://linked.open.../vavai/riv/strany
  • 879 ; 884
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(1M0567)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 477006
http://linked.open...ai/riv/idVysledku
  • RIV/68407700:21230/06:03124625
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • MSER; hashing; two-view matching; wide-baseline stereo (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [ACB6370E142F]
http://linked.open...v/mistoKonaniAkce
  • New York
http://linked.open...i/riv/mistoVydani
  • Los Alamitos
http://linked.open...i/riv/nazevZdroje
  • Proceedings of Conference on Computer Vision and Pattern Recognition (CVPR)
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Matas, Jiří
  • Chum, Ondřej
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
number of pages
http://purl.org/ne...btex#hasPublisher
  • IEEE Computer Society Press
https://schema.org/isbn
  • 0-7695-2597-0
http://localhost/t...ganizacniJednotka
  • 21230
is http://linked.open...avai/riv/vysledek of
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 112 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software