✦ LIBER ✦

In defense of the eight-point algorithm

✍ Scribed by Hartley, R.I.

Book ID: 117873359
Publisher: IEEE
Year: 1997
Tongue: English
Weight: 712 KB
Volume: 19
Category: Article
ISSN: 0162-8828
DOI: 10.1109/34.601246

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Consistency of the Normalized Eig

On the Consistency of the Normalized Eight-Point Algorithm

✍ Wojciech Chojnacki; Michael J. Brooks 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 347 KB

On the complexity of point-in-polygon al

On the complexity of point-in-polygon algorithms

✍ Chong-Wei Huang; Tian-Yuan Shih 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 718 KB

Finite termination of the proximal point

Finite termination of the proximal point algorithm

✍ Michael C. Ferris 📂 Article 📅 1991 🏛 Springer-Verlag 🌐 English ⚖ 316 KB

A Generalization of the Proximal Point A

A Generalization of the Proximal Point Algorithm

✍ Ha, Cu D. 📂 Article 📅 1990 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 843 KB

An algorithm for projective point matchi

An algorithm for projective point matching in the presence of spurious points

✍ Jason A. Denton; J. Ross Beveridge 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 513 KB

Point matching is the task of finding correspondences between two sets of points such that the two sets of points are aligned with each other. Pure point matching uses only the location of the points to constrain the problem. This is a problem with broad practical applications, but it has only been

Finite termination of the proximal point

Finite termination of the proximal point algorithm in Banach spaces

✍ Shin-ya Matsushita; Li Xu 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 125 KB