Using orientation code matching for robust landmark definition and verification

Hidenori Takauji; Shun'ichi Kaneko; Takayuki Tanaka

doi:10.1117/12.571263

25 October 2004 Using orientation code matching for robust landmark definition and verification

Hidenori Takauji, Shun'ichi Kaneko, Takayuki Tanaka

Proceedings Volume 5603, Machine Vision and its Optomechatronic Applications; (2004) https://doi.org/10.1117/12.571263
Event: Optics East, 2004, Philadelphia, Pennsylvania, United States

Abstract

This paper aims to propose a new scheme for robust tagging for landmark definition in unknown circumstance using some qualitative evaluations based on Orientation Code representation and matching which has been proposed for robust image registration even in the presence of change in illumination and occlusion. Necessary characteristics for effective tags: richness, similarity, and uniqueness, are considered in order to design an algorithm for tag extraction. These qualitative considerations can be utilized to design simple and robust algorithm for tag definition in combination with the robust image registration algorithm.

Citation Download Citation

Hidenori Takauji, Shun'ichi Kaneko, and Takayuki Tanaka "Using orientation code matching for robust landmark definition and verification", Proc. SPIE 5603, Machine Vision and its Optomechatronic Applications, (25 October 2004); https://doi.org/10.1117/12.571263

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available