Bound and Conquer : Improving Triangulation by Enforcing Consistency

We study the accuracy of triangulation in multi-camera systems with respect to the number of cameras. We show that, under certain conditions, the optimal achievable reconstruction error decays quadratically as more cameras are added to the system. Furthermore, we analyze the error decay-rate of majo...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on pattern analysis and machine intelligence. - 1979. - 42(2020), 9 vom: 19. Sept., Seite 2321-2326
1. Verfasser: Scholefield, Adam (VerfasserIn)
Weitere Verfasser: Ghasemi, Alireza, Vetterli, Martin
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2020
Zugriff auf das übergeordnete Werk:IEEE transactions on pattern analysis and machine intelligence
Schlagworte:Journal Article
LEADER 01000naa a22002652 4500
001 NLM301441871
003 DE-627
005 20231225104630.0
007 cr uuu---uuuuu
008 231225s2020 xx |||||o 00| ||eng c
024 7 |a 10.1109/TPAMI.2019.2939530  |2 doi 
028 5 2 |a pubmed24n1004.xml 
035 |a (DE-627)NLM301441871 
035 |a (NLM)31535981 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Scholefield, Adam  |e verfasserin  |4 aut 
245 1 0 |a Bound and Conquer  |b Improving Triangulation by Enforcing Consistency 
264 1 |c 2020 
336 |a Text  |b txt  |2 rdacontent 
337 |a ƒaComputermedien  |b c  |2 rdamedia 
338 |a ƒa Online-Ressource  |b cr  |2 rdacarrier 
500 |a Date Revised 11.08.2020 
500 |a published: Print-Electronic 
500 |a Citation Status PubMed-not-MEDLINE 
520 |a We study the accuracy of triangulation in multi-camera systems with respect to the number of cameras. We show that, under certain conditions, the optimal achievable reconstruction error decays quadratically as more cameras are added to the system. Furthermore, we analyze the error decay-rate of major state-of-the-art algorithms with respect to the number of cameras. To this end, we introduce the notion of consistency for triangulation, and show that consistent reconstruction algorithms achieve the optimal quadratic decay, which is asymptotically faster than some other methods. Finally, we present simulations results supporting our findings. Our simulations have been implemented in MATLAB and the resulting code is available in the supplementary material, which can be found on the Computer Society Digital Library at http://doi.ieeecomputersociety.org/10.1109/TPAMI.2019.2939530 
650 4 |a Journal Article 
700 1 |a Ghasemi, Alireza  |e verfasserin  |4 aut 
700 1 |a Vetterli, Martin  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on pattern analysis and machine intelligence  |d 1979  |g 42(2020), 9 vom: 19. Sept., Seite 2321-2326  |w (DE-627)NLM098212257  |x 1939-3539  |7 nnns 
773 1 8 |g volume:42  |g year:2020  |g number:9  |g day:19  |g month:09  |g pages:2321-2326 
856 4 0 |u http://dx.doi.org/10.1109/TPAMI.2019.2939530  |3 Volltext 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 42  |j 2020  |e 9  |b 19  |c 09  |h 2321-2326