About: Graph-based Range Image Registration Combining Geometric and Photometric Features     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
  • 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.
  • 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. (en)
  • 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. (cs)
Title
  • Graph-based Range Image Registration Combining Geometric and Photometric Features
  • Graph-based Range Image Registration Combining Geometric and Photometric Features (en)
  • Graph-based Range Image Registration Combining Geometric and Photometric Features (cs)
skos:prefLabel
  • Graph-based Range Image Registration Combining Geometric and Photometric Features
  • Graph-based Range Image Registration Combining Geometric and Photometric Features (en)
  • Graph-based Range Image Registration Combining Geometric and Photometric Features (cs)
skos:notation
  • RIV/68407700:21230/07:03134579!RIV08-AV0-21230___
http://linked.open.../vavai/riv/strany
  • 542;552
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(1ET101210406)
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
  • 423618
http://linked.open...ai/riv/idVysledku
  • RIV/68407700:21230/07:03134579
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • graph kernel; matching; range image; registration (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [C9D3972EC7AF]
http://linked.open...v/mistoKonaniAkce
  • Aalborg
http://linked.open...i/riv/mistoVydani
  • Heidelberg
http://linked.open...i/riv/nazevZdroje
  • SCIA 2007: Proceedings of 15th Scandinavian Conference on Image Analysis
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
  • Šára, Radim
  • Sugimoto, A.
  • Shimizu, I.
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
number of pages
http://purl.org/ne...btex#hasPublisher
  • Springer-Verlag
https://schema.org/isbn
  • 978-3-540-73039-2
http://localhost/t...ganizacniJednotka
  • 21230
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