ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Real-Time Imaging
Volume 8, Issue 1, February 2002, Pages 23-33
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (1308 K)

Article Toolbox
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1006/rtim.2001.0256    
How to Cite or Link Using DOI (Opens New Window)

Copyright © 2002 Elsevier Science Ltd. All rights reserved.

Regular Article

A Hybrid Image Alignment System for Fast and Precise Pattern Localization

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Shang-Hong Laia and Ming Fangb

a Department of Computer Science, National Tsing-Hua University, Hsinchu, Taiwan, 30043, R.O.C.

b Imaging & Visualization Department, Siemens Corporate Research, College Road East, Princeton, NJ, 08540


Available online 25 March 2002.

Abstract

The need for accurate and efficient pattern localization prevails in many industrial applications, such as automated visual inspection and factory automation. The image reference approach is very popular in automatic visual inspection due to its general application to a variety of inspection tasks. However, it requires precise alignment of the inspection pattern in the image. To achieve precise pattern alignment, traditional template matching is extremely time-consuming when the search space is large. In this paper, we present a new hybrid image alignment system for fast and accurate pattern localization in a large search space. This pattern localization algorithm is very useful for applications in automated visual inspection and pick-and-place applications. The proposed hybrid alignment algorithm comprises a hierarchical nearest-neighbor search process and an optical-flow based energy minimization method. The hierarchical nearest-neighbor search, which is based on the learning-from-examples principle, produces rough estimates of the transformation parameters for the initial guesses of the optical-flow based energy minimization method. The energy minimization process iteratively refines the estimation results and provides associated confidence measures. Experimental results are shown to demonstrate the accuracy and efficiency of the proposed algorithm.


Real-Time Imaging
Volume 8, Issue 1, February 2002, Pages 23-33
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.