About: Efficient Sequential Correspondence Selection by Cosegmentation     Goto   Sponge   NotDistinct   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
rdfs:seeAlso
Description
  • Object recognition and wide baseline stereo methods, correspondences of interest points (distinguished regions) are commonly established by matching compact descriptors such as SIFTs. We show that a subsequent cosegmentation process coupled with a quasi-optimal sequential decision process leads to a correspondence verification procedure that (i) has high precision (ii) has good recall and (iii) is fast. The sequential decision on the correctness of a correspondence is based on simple statistics of a modified dense stereo matching algorithm. The statistics are projected on a prominent discriminative direction by SVM. Wald's sequential probability ratio test is performed on the SVM projection computed on progressively larger cosegmented regions.We show experimentally that the proposed Sequential Correspondence Verification (SCV) algorithm significantly outperforms the correspondence selection method based on SIFT distance ratios.
  • Object recognition and wide baseline stereo methods, correspondences of interest points (distinguished regions) are commonly established by matching compact descriptors such as SIFTs. We show that a subsequent cosegmentation process coupled with a quasi-optimal sequential decision process leads to a correspondence verification procedure that (i) has high precision (ii) has good recall and (iii) is fast. The sequential decision on the correctness of a correspondence is based on simple statistics of a modified dense stereo matching algorithm. The statistics are projected on a prominent discriminative direction by SVM. Wald's sequential probability ratio test is performed on the SVM projection computed on progressively larger cosegmented regions.We show experimentally that the proposed Sequential Correspondence Verification (SCV) algorithm significantly outperforms the correspondence selection method based on SIFT distance ratios. (en)
Title
  • Efficient Sequential Correspondence Selection by Cosegmentation
  • Efficient Sequential Correspondence Selection by Cosegmentation (en)
skos:prefLabel
  • Efficient Sequential Correspondence Selection by Cosegmentation
  • Efficient Sequential Correspondence Selection by Cosegmentation (en)
skos:notation
  • RIV/68407700:21230/10:00168986!RIV14-MSM-21230___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(1ET101210406), P(7E08031), Z(MSM6840770038)
http://linked.open...iv/cisloPeriodika
  • 9
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
  • 256404
http://linked.open...ai/riv/idVysledku
  • RIV/68407700:21230/10:00168986
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • correspondence; verification; dense stereo; growing; sequential decison; learning; SVM; wide-baseline stereo; image retrieval; SIFT; RANSAC (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • US - Spojené státy americké
http://linked.open...ontrolniKodProRIV
  • [EFE1F455910D]
http://linked.open...i/riv/nazevZdroje
  • IEEE Transactions on Pattern Analysis and Machine Intelligence
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...v/svazekPeriodika
  • 32
http://linked.open...iv/tvurceVysledku
  • Matas, Jiří
  • Čech, Jan
  • Perďoch, Michal
http://linked.open...ain/vavai/riv/wos
  • 000279969000003
http://linked.open...n/vavai/riv/zamer
issn
  • 0162-8828
number of pages
http://bibframe.org/vocab/doi
  • 10.1109/TPAMI.2009.176
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, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software