DocumentCode
2803841
Title
An Algorithm for Turning Points´ Row Permutation of Image Boundary into Sequence Permutation
Author
Fu, Mengyin ; Zhang, Xiaochen ; Zhou, Peide
Author_Institution
Sch. of Autom., Beijing Inst. of Technol., Beijing, China
fYear
2009
fDate
19-20 Dec. 2009
Firstpage
1
Lastpage
4
Abstract
Image output by computer is done row by row, with which we cannot know the topological relations between points at image boundary. To obtain the closed boundary of the target from an image and turn points´ row permutation of boundary into sequence permutation, an algorithm based on 4-connection relation of pixel points is proposed and analysis of correctness and complexity is given. Compared with classical operators and literature method, the single pixel boundary extracted from an image by this algorithm is more whole and more distinct. Moreover, it has lower time complexity. The obtained sequence permutation of points is also conducive to follow-up image processing.
Keywords
computational complexity; feature extraction; graph theory; 4-connection relation algorithm; image boundary; image extraction; sequence permutation; time complexity; turning point row permutation; Algorithm design and analysis; Arithmetic; Automation; Clocks; Image analysis; Image processing; Image sequence analysis; Logic; Pixel; Turning;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Engineering and Computer Science, 2009. ICIECS 2009. International Conference on
Conference_Location
Wuhan
Print_ISBN
978-1-4244-4994-1
Type
conf
DOI
10.1109/ICIECS.2009.5362593
Filename
5362593
Link To Document