On approximate nearest neighbour field algorithms in template matching for surface quality inspection

1Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Surface quality inspection is applied in the process of manufacturing products where the appearance is crucial for the product quality and customer acceptance, like for woven fabrics. The predominating approaches to detect defects are feature-based. Recently we investigated an alternative approach utilizing template matching in the context of regular or near-regular textured surface inspection. This paper reveals that the template matching approach belongs to the class of approximate nearest neighbour field (ANNF) algorithms which are common in a different field of image processing, namely structural image editing. By modifying a state-of-the-art ANNF algorithm the advantage of template matching algorithms for defect detection can be shown. Furthermore the importance of the chosen distance function is demonstrated in an explorative study and a concept to determine if the template matching approach is suitable for a given texture and defect type is demonstrated on a set of defect classes and texture types. © 2013 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Stübl, G., Moser, B., & Scharinger, J. (2013). On approximate nearest neighbour field algorithms in template matching for surface quality inspection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8112 LNCS, pp. 79–86). Springer Verlag. https://doi.org/10.1007/978-3-642-53862-9_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free