IRMA-International.org: Creator of Knowledge
Information Resources Management Association
Advancing the Concepts & Practices of Information Resources Management in Modern Organizations

Certain and Uncertain Triangulation in Multiple Camera Vision Systems via LMIs

Certain and Uncertain Triangulation in Multiple Camera Vision Systems via LMIs
View Sample PDF
Author(s): Graziano Chesi (University of Hong Kong, Hong Kong)and Yeung Sam Hung (University of Hong Kong, Hong Kong)
Copyright: 2013
Pages: 13
Source title: Image Processing: Concepts, Methodologies, Tools, and Applications
Source Author(s)/Editor(s): Information Resources Management Association (USA)
DOI: 10.4018/978-1-4666-3994-2.ch007

Purchase

View Certain and Uncertain Triangulation in Multiple Camera Vision Systems via LMIs on the publisher's website for pricing and purchasing information.

Abstract

Triangulation is a fundamental problem in computer vision that consists of estimating the 3D position of a point of the scene from the estimates of its image projections on some cameras and from the estimates of the projection matrices of these cameras. This chapter addresses multiple view L2 triangulation, i.e. triangulation for vision systems with a generic number of cameras where the sought 3D point is searched by minimizing the L2 norm of the image reprojection error. The authors consider the standard case where estimates of all the image points are available (referring to such a case as certain triangulation), and consider also the case where some of such estimates are not available for example due to occlusions (referring to such a case as uncertain triangulation). In the latter case, it is supposed that the unknown image points belong to known regions such as line segments or ellipses. For these problems, the authors propose a unified methodology that exploits the fundamental matrices among the views and provides a candidate 3D point through the solution of a convex optimization problem based on linear matrix inequalities (LMIs). Moreover, the chapter provides a simple condition that allows one to immediately establish whether the found 3D point is optimal. Various examples with synthetic and real data illustrate the proposed technique, showing in particular that the obtained 3D point is almost always optimal in practice, and that its computational time is indeed small.

Related Content

Aswathy Ravikumar, Harini Sriraman. © 2023. 18 pages.
Ezhilarasie R., Aishwarya N., Subramani V., Umamakeswari A.. © 2023. 10 pages.
Sangeetha J.. © 2023. 13 pages.
Manivannan Doraipandian, Sriram J., Yathishan D., Palanivel S.. © 2023. 14 pages.
T. Kavitha, Malini S., Senbagavalli G.. © 2023. 36 pages.
Uma K. V., Aakash V., Deisy C.. © 2023. 23 pages.
Alageswaran Ramaiah, Arun K. S., Yathishan D., Sriram J., Palanivel S.. © 2023. 17 pages.
Body Bottom