✦ LIBER ✦

Development and evaluation of fast branch-and-bound algorithm for feature matching based on line segments

✍ Scribed by Lik-Kwan Shark; Andrey A. Kurekin; Bogdan J. Matuszewski

Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 807 KB
Volume: 40
Category: Article
ISSN: 0031-3203
DOI: 10.1016/j.patcog.2006.10.022

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Evaluation of the branch and bound algor

Evaluation of the branch and bound algorithm for feature selection

✍ Yoshihiko Hamamoto; Shunji Uchimura; Yutaka Matsuura; Taiho Kanaoka; Shingo Tomi 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 207 KB

A fast algorithm for a k-NN classifier b

A fast algorithm for a k-NN classifier based on the branch and bound method and computational quantity estimation

✍ Shin'ichiro Omachi; Hirotomo Aso 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 173 KB 👁 3 views

The nearest neighbor rule or k-nearest neighbor rule is a technique of nonparametric pattern recognition. Its algorithm is simple and the error is smaller than twice the Bayes error if there are enough training samples. However, it requires an enormous amount of computation, proportional to the numb

Development and evaluation of a hierarch

Development and evaluation of a hierarchical clustering and pattern averaging method applicable to on-line handwritten character recognition based on feature point approximation

✍ Toshimi Yokota; Soushiro Kuzunuki; Keiko Gunji; Nagaharu Hamada; Koyo Katsura 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 772 KB