DocumentCode
3311583
Title
A Fast Subpixel Locating Algorithm with Shielding Case
Author
Peng, Yuan ; Haiming, Liu ; Yueming, Hu
Author_Institution
Coll. of Autom. Sci. & Eng., China Univ. of Technol., Guangzhou, China
fYear
2009
fDate
8-11 Aug. 2009
Firstpage
330
Lastpage
333
Abstract
Aimed at the image locating problem with shielding case, this paper analysis the shortage of general pattern match algorithm then present a fast subpixel locating algorithm based on characteristic edges detect of shielding case. First, it uses binarization and blob analysis method to remove the small particles; Next, it performs a Laplacian transform to get the edge image; And then finds the line segment sets and filter with the size information of the case to get the characteristic edges, And then use Zernike orthogonal moment to get subpixel edges; Finally deduces the center and rotate angle with the characteristic edges. The result shows the locating speed and the accuracy of the algorithm is well and meets the practical application. The algorithm also has strong robust.
Keywords
Laplace transforms; edge detection; filtering theory; image matching; image segmentation; Laplacian transform; Zernike orthogonal moment; binarization method; blob analysis method; edge detection; fast subpixel locating algorithm; filter; general pattern match algorithm; image locating problem; line segment sets; shielding case; size information; Algorithm design and analysis; Image analysis; Image edge detection; Image segmentation; Information analysis; Information filtering; Laplace equations; Pattern analysis; Pattern matching; Performance analysis;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Science and Information Technology, 2009. ICCSIT 2009. 2nd IEEE International Conference on
Conference_Location
Beijing
Print_ISBN
978-1-4244-4519-6
Electronic_ISBN
978-1-4244-4520-2
Type
conf
DOI
10.1109/ICCSIT.2009.5234551
Filename
5234551
Link To Document