A brute-force algorithm for reconstructing a scene from two projections

Is the real problem in finding the relative orientation of two viewpoints the correspondence problem? We argue that this is only one difficulty. Even with known correspondences, popular methods like the eight point algorithm and minimal solvers may break down due to planar scenes or small relative m...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:CVPR 2011 s. 2961 - 2968
Hlavní autori: Enqvist, O., Fangyuan Jiang, Kahl, F.
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.01.2011
Predmet:
Approximation methods
Computer vision
Cost function
Motion segmentation
Three dimensional displays
Tracking
Upper bound
ISBN:1457703947, 9781457703942
ISSN:1063-6919, 1063-6919
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract Is the real problem in finding the relative orientation of two viewpoints the correspondence problem? We argue that this is only one difficulty. Even with known correspondences, popular methods like the eight point algorithm and minimal solvers may break down due to planar scenes or small relative motions. In this paper, we derive a simple, brute-force algorithm which is both robust to outliers and has no such algorithmic degeneracies. Several cost functions are explored including maximizing the consensus set and robust norms like truncated least-squares. Our method is based on parameter search in a four-dimensional space using a new epipolar parametrization. In principle, we do an exhaustive search of parameter space, but the computations are very simple and easily parallelizable, resulting in an efficient method. Further speed-ups can be obtained by restricting the domain of possible motions to, for example, planar motions or small rotations. Experimental results are given for a variety of scenarios including scenes with a large portion of outliers. Further, we apply our algorithm to 3D motion segmentation where we outperform state-of-the-art on the well-known Hopkins-155 benchmark database.
AbstractList Is the real problem in finding the relative orientation of two viewpoints the correspondence problem? We argue that this is only one difficulty. Even with known correspondences, popular methods like the eight point algorithm and minimal solvers may break down due to planar scenes or small relative motions. In this paper, we derive a simple, brute-force algorithm which is both robust to outliers and has no such algorithmic degeneracies. Several cost functions are explored including maximizing the consensus set and robust norms like truncated least-squares. Our method is based on parameter search in a four-dimensional space using a new epipolar parametrization. In principle, we do an exhaustive search of parameter space, but the computations are very simple and easily parallelizable, resulting in an efficient method. Further speed-ups can be obtained by restricting the domain of possible motions to, for example, planar motions or small rotations. Experimental results are given for a variety of scenarios including scenes with a large portion of outliers. Further, we apply our algorithm to 3D motion segmentation where we outperform state-of-the-art on the well-known Hopkins-155 benchmark database.
Author Kahl, F.
Enqvist, O.
Fangyuan Jiang
Author_xml – sequence: 1
  givenname: O.
  surname: Enqvist
  fullname: Enqvist, O.
  email: olofe@maths.ith.se
  organization: Centre for Math. Sci., Lund Univ., Lund, Sweden
– sequence: 2
  surname: Fangyuan Jiang
  fullname: Fangyuan Jiang
  email: fangyuan@maths.ith.se
  organization: Centre for Math. Sci., Lund Univ., Lund, Sweden
– sequence: 3
  givenname: F.
  surname: Kahl
  fullname: Kahl, F.
  email: fredrik@maths.ith.se
  organization: Centre for Math. Sci., Lund Univ., Lund, Sweden
BookMark eNpNkM9Kw0AYxFetYFv7AOJlXyBx_2U337EErUJBEfVaNrtfakqTLZst4tsbsKBzGYbfMIeZkUkfeiTkhrOccwZ31cfLay4Y53kBUGgNZ2TGVWEMkyDhnEw50zLTwOHiDygz-QeuyGIYdmyU1iUUZkpWS1rHY8KsCdEhtfttiG367OiYaUQX-iHFo0ttv6WWDg57pE0MHU1fgR5i2OHIxtI1uWzsfsDFyefk_eH-rXrM1s-rp2q5zlopecqsEcp59GCcNr4swem69K6uC85YU6rCo_VlY620QnEhuBQNKAlaSIOaOTknt7-7LSJuDrHtbPzenA6RP2V7Uo0
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/CVPR.2011.5995669
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE/IET Electronic Library (IEL) (UW System Shared)
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Applied Sciences
Computer Science
EISBN 1457703939
1457703955
9781457703959
9781457703935
EISSN 1063-6919
EndPage 2968
ExternalDocumentID 5995669
Genre orig-research
GroupedDBID 23M
29F
29O
6IE
6IH
6IK
ABDPE
ACGFS
ALMA_UNASSIGNED_HOLDINGS
CBEJK
IPLJI
M43
RIE
RIO
RNS
ID FETCH-LOGICAL-i331t-a724cded97c67d889c6b8dcbb5100f845dead8faa3a24122132f94396237e60c3
IEDL.DBID RIE
ISBN 1457703947
9781457703942
ISICitedReferencesCount 5
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000295615803031&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1063-6919
IngestDate Wed Aug 27 03:27:48 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i331t-a724cded97c67d889c6b8dcbb5100f845dead8faa3a24122132f94396237e60c3
PageCount 8
ParticipantIDs ieee_primary_5995669
PublicationCentury 2000
PublicationDate 2011-01-01
PublicationDateYYYYMMDD 2011-01-01
PublicationDate_xml – month: 01
  year: 2011
  text: 2011-01-01
  day: 01
PublicationDecade 2010
PublicationTitle CVPR 2011
PublicationTitleAbbrev CVPR
PublicationYear 2011
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0000668957
ssj0023720
ssj0003211698
Score 1.808771
Snippet Is the real problem in finding the relative orientation of two viewpoints the correspondence problem? We argue that this is only one difficulty. Even with...
SourceID ieee
SourceType Publisher
StartPage 2961
SubjectTerms Approximation methods
Computer vision
Cost function
Motion segmentation
Three dimensional displays
Tracking
Upper bound
Title A brute-force algorithm for reconstructing a scene from two projections
URI https://ieeexplore.ieee.org/document/5995669
WOSCitedRecordID wos000295615803031&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwELbaioGpQIt4ywMjpkmc-DGiiseAqgoB6lY5tlMqQYLaAH-fs-MGIbEgZbBvyMO60313l_sOoXNlqYkzbUjGtSAphDoEQrCESJlKmhewVp5d_55PJmI2k9MOumh7Yay1_ucze-mWvpZvKv3hUmUjR47FmOyiLues6dVq8yngOoUMFTy3pxDZMNlWFBI3jcVXPhklTMbSN3llHBRepnzD_RT2SSh_xpEcjZ-nDw3TZ3j6rzEs3gvd9P_3_jto-NPOh6eto9pFHVvuoX7AnzhY9xpEmxEPG9kA3V7hfAUiAtgW7qJeF9VqWb-8YdhjH0wHAtpygRV2zFAWu44VXH9VOGR5nGIP0dPN9eP4joTZC2RJaVwTxZNUG2sk14wbIaRmuTA6z8GGo0KkmQEVFIVSVAEGSBIIagsJ4AbQFLcs0nQf9cqqtAcIx5kwtBBGOIOMsjwvHOe7SHQeK4BvxSEauKOavzf0GvNwSkd_i4_RdpPWddcJ6sFH2lO0pT_r5Xp15nXiGznGrgI
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT8MwDI7GQILTgA3xJgeOBNqkj-SIJsYQY5rQQLtNaZKOSdCircDfx2mzIiQuSD0kPrRKZMuf7fozQufSMO2HSpMwVpwEEOoQCMEoESIQLElhLUt2_UE8HPLJRIwa6KLuhTHGlD-fmUu7LGv5OlcfNlV2ZcmxokisofUwCKhXdWvVGRVwnly4Gp7dM4htIlHXFKidx1LWPiNGIuGLss0rjEHlRRCv2J_cnroCqO-Jq-7z6LHi-nTf_zWIpfRDvdb_TrCNOj8NfXhUu6od1DDZLmo5BIqdfS9BtBrysJK10e01ThYgIoBu4S3ydZYv5sXLG4Y9LsNpR0GbzbDElhvKYNuzgouvHLs8j1XtDnrq3Yy7feKmL5A5Y35BZEwDpY0WsYpizblQUcK1ShKwYi_lQahBCXkqJZOAAiiFsDYVAG8AT8Um8hTbQ80sz8w-wn7INUu55tYkvTBJUsv6zqlKfAkALj1AbXtV0_eKYGPqbunwb_EZ2uyPHwbTwd3w_ghtVUle-xyjJhzYnKAN9VnMl4vTUj--AX1nsUk
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=CVPR+2011&rft.atitle=A+brute-force+algorithm+for+reconstructing+a+scene+from+two+projections&rft.au=Enqvist%2C+O.&rft.au=Fangyuan+Jiang&rft.au=Kahl%2C+F.&rft.date=2011-01-01&rft.pub=IEEE&rft.isbn=9781457703942&rft.issn=1063-6919&rft.eissn=1063-6919&rft.spage=2961&rft.epage=2968&rft_id=info:doi/10.1109%2FCVPR.2011.5995669&rft.externalDocID=5995669
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1063-6919&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1063-6919&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1063-6919&client=summon