DocumentCode
1890737
Title
K-Means Sobel Algorithm in Edge Extracting of Mural Diseases
Author
Hou, Miao-le ; Tian, Song ; Guo, Hong ; Cheng, Qian
Author_Institution
Inst. of Geometries & urban Planning, Beijing Univ. of Civil Eng. & Archit., Beijing, China
fYear
2010
fDate
25-26 Dec. 2010
Firstpage
1
Lastpage
4
Abstract
Currently, it is an effective means of collecting diseases information from mural collections by using edge detection and manual interpretation. But it is hard to extract better edges of mural diseases with existing edge detection algorithms. Therefore, a new K-Means Sobel algorithm is proposed. Firstly, we process a gray orthophoto map with K-means clustering algorithm to obtain a gray value matrix and then convolve this matrix with Sobel formula. Converting the processed matrix to a graph, we can finally get what information we want- a black-white binary edge image that contains edges of mural diseases. Considering the practical significance of research on mural collections, we give two evaluation factors to judge the effect of edge detection. Experimental results demonstrate that we can get a better effect by using new method than traditional algorithms.
Keywords
art; edge detection; feature extraction; graphs; image segmentation; matrix algebra; K-mean Sobel algorithm; K-mean clustering algorithm; black-white binary edge image; diseases information; edge extraction; gray orthophoto map; gray value matrix; manual interpretation; mural disease; processed matrix; Clustering algorithms; Diseases; Gray-scale; Image edge detection; Painting; Paints; Pixel;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Engineering and Computer Science (ICIECS), 2010 2nd International Conference on
Conference_Location
Wuhan
ISSN
2156-7379
Print_ISBN
978-1-4244-7939-9
Electronic_ISBN
2156-7379
Type
conf
DOI
10.1109/ICIECS.2010.5677896
Filename
5677896
Link To Document