✦ LIBER ✦

Finding the Closest Lattice Point by Iterative Slicing

✍ Scribed by Sommer, Naftali; Feder, Meir; Shalvi, Ofir

Book ID: 118196974
Publisher: Society for Industrial and Applied Mathematics
Year: 2009
Tongue: English
Weight: 546 KB
Volume: 23
Category: Article
ISSN: 0895-4801
DOI: 10.1137/060676362

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding the closest extreme vertex to a

Finding the closest extreme vertex to a fixed point

✍ Gerhard J. Woeginger 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 471 KB

Finding the Point of a Polyhedron Closes

Finding the Point of a Polyhedron Closest to the Origin

✍ Mitchell, B. F.; Dem’yanov, V. F.; Malozemov, V. N. 📂 Article 📅 1974 🏛 Society for Industrial and Applied Mathematics ⚖ 517 KB

An orientation reliability matrix for th

An orientation reliability matrix for the iterative closest point algorithm

✍ Byung-Uk Lee; Chul-Min Kim; Rae-Hong Park 📂 Article 📅 2000 🏛 IEEE 🌐 English ⚖ 181 KB

Robust affine iterative closest point al

Robust affine iterative closest point algorithm with bidirectional distance

✍ Zhu, J.; Du, S.; Yuan, Z.; Liu, Y.; Ma, L. 📂 Article 📅 2012 🏛 The Institution of Engineering and Technology 🌐 English ⚖ 829 KB

On maximum-likelihood detection and the

On maximum-likelihood detection and the search for the closest lattice point

✍ Damen, M.O.; El Gamal, H.; Caire, G. 📂 Article 📅 2003 🏛 IEEE 🌐 English ⚖ 766 KB

Robust matching of 3D contours using ite

Robust matching of 3D contours using iterative closest point algorithm improved by M-estimation

✍ Shun'ichi Kaneko; Tomonori Kondo; Atsushi Miyamoto 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 333 KB

An extension of the iterative closest point matching by M-estimation is proposed for realization of robustness to non-overlapping data or outlying data in two sets of contour data or depth images for rigid bodies. An objective function which includes independent residual components for each of x, y