Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Manhattan Distance Based Affinity Propagation Technique for Clustering in Remote Sensing Images
D. Napoleon
Assistant Professor, Department of Computer Science, School of Computer Science and Engineering, Bharathiar University, India, Coimbatore-641046
M.Praneesh
Research Scholar, Department ofComputerScience School of Computer Science and Engineering Bharathiar University,India,Coimbatore-641046 raja.praneesh@gmail.com S.Sathya Resaerch Scholar, Department ofComputerScience School of Computer Science and Engineering Bharathiar University,India,Coimbatore-641046
M.Siva Subramanian
Resaerch Scholar, Department ofComputerScience School of Computer Science and Engineering Bharathiar University,India,Coimbatore-641046
Abstract: Cluster analysis partitions a dataset into a reasonable number of disjoint groups, where each group
contains similar patterns. Due to a high number of spectral channels hyper Remote Sensing are difficult to classify with high accuracy and efficiency. In this paper we propose a new image clustering method MD-AP( Manhattan Distance Based Affinity Propagation) for extract the Land cover Classification with High Accuracy and Less Computation Time for Comparing the convention methods like K-Means Clustering Algorithm. Keywords: Clustering, Remote Sensing images, Classification, Affinity Propagation
I.
INTRODUCTION
according to their spectral properties, which vary with the imagery system. II. STUDY AREA
In Remote Sensing, classification is one of the processes for grouping the homogeneous pixels into meaningful categories. Classification algorithms are based on the assumption that the image to be processed contains one or more features such as spectral regions in the case remote sensing images. Each of these features belongs to one of the distinct classes. In this paper, classification of satellite images is an essential process to identify different land classes. Different land classes have different properties based on which they may be identified and hence classified.eg- water, agricultural area, urban area, forest etc.[3] all these classes can be identified
A system is developed for Image classification based on Manhattan Distance Based Affinity Propagation MD-AP. The dataset used in our experiment is a portion of remote sensing image of Quick bird images, which covers a small area of the south part of the city of Trento, italy acquired on july 17, 2006. This site mainly contains seven land-cover classes, which are vegetation and exposed land. In this dataset, green areas represent road, red areas represent agricultural, slightly darker green areas represents roof, yellow areas are represent soil and
www.ijarcsse.com
blue areas are represent tree field. We can see that the degree of class mixture in the vegetation area is high. A brown area mainly represents exposed land; III. OBJECTIVES The main objective of the present paper is to analyze and classify the land cover information based on Manhattan Distance Based Affinity Propagation.
slightly brown areas mainly represent dry salt flats which are blocked by forest land.
..
{ a ( k , k) + s ( k ,
IV.
METHODOLOGY
Affinity propagation (AP) is a clustering algorithm proposed has several advantages: speed, general applicability, and suitable for large number of clusters. AP has two limitations: it is hard to know what value of parameter preference can yield optimal clustering solutions and oscillations cannot be eliminated automatically if occur. Affinity propagation takes input measures as similarity between pairs of data points. Affinity propagation operates by simultaneously considering all data points as potential exemplars and iteratively exchanging messages between data points until a good set of exemplars and cluster emerges. For this work we have compared the K-Means Clustering with proposed [MD-AP] Algorithm is consider for all data points. The Affinity Propagation algorithm is simple to implement and customize; it is also computationally efficient, scaling linearly in the number of similarities or quadratically in the number of data points, if all possible pair wise similarities (Manhattan Distance Measures) are used. The general algorithm for this approach is listed given below. Affinity Propagation algorithm Initialization: r( i , k) = s (i ,k) max { s(i , k) }, a ( i , k) = 0 k k
a ( i , k) = min ( 0, r (k, k) + I s.t.ie {I ,k} max { 0, r ( i , k)}) a (k ,k) = I s.t.ie {I ,k} max { 0, r ( i , k)}) Making assignments C*i arg max1< k < n r(i , k) + a(i ,k).
In this processing, two kinds of messages are exchanged among data points, and each takes into account a different kind of competition. V. RESULTS AND DISCUSSION
The land use categories such as build up land, Agricultural, road, tree, soil, roof, shadow, grass have been identified and mapped from the color composite (RGB = bands 1, 2,3) of the Quick bird data of the south part of the city of Trento, Italy ( Figure-1)
Fig-1 Quick bird data of the south part of the city of Trento, Italy To assess the accuracy of the proposed technique, the error matrices of the classification maps and producer accuracy and user accuracy for Manhattan Distance Based Affinity Propagation is given in Table-1. The classification results are shown in the Figure-2.
{ a ( i , k) + s ( i ,
Page | 327
www.ijarcsse.com
Based on all the experimental results presented, we conclude that the Proposed MD-AP produces better CLASS AGRI. FIELD AGRI. FIELD 135 0 1 7 ROAD TREE
Distance based Affinity Propagation Technique is 74% and K-Means Clustering algorithm accuracy is SOIL ROOF SHADOW GRASS ROW TOTAL
145
ROAD
101
18
130
TREE
30
19
52
SOIL
54
74
ROOF
18
82
SHADOW
13
13
96
133
GRASS
33
53
COLUMN TOTAL
150
107
45
86
134
111
37
527
60.33
95.33
78.56
85.88
60.96
72.68
86.49
77.26
79.44
66.67
54.89
79.29
75.08
66.31
clustering accuracy than the K-means clustering algorithm. The overall accuracy of the Manhattan
68%
Page | 328
www.ijarcsse.com
Table-1 Error Matrices Quick bird data of the south part of the city of Trento, Italy
Fig-2 Classification Results for Manhattan Distance Based Affinity Propagation System. Chapman & Hall/CRC, Taylor & Francis Group. VI. CONCLUSION [2] Zhenjie Zhang, Bing Tian Dai, Anthony K.H. Tung On the Lower Bound of Local Optimums in KMeans Algorithm2006 [3]L.Yu, L.Jonathan, D.Haibiri and G.Xiangqian, A Fuzzy relation based algorithm for segmenting colour aerial images of urban environment proc. ISPRS Technical Commission II Midterm Symposium on intergrated system for spatial data production, custodian and decision support, Xian PR,China,pp 271-274,2002. [4] Ka-Man Wong, Chun-Ho Chey, tak-Shing Liu, Lai-Man Po, Dominant color image retrieval using merged histogram, Circuits and Systems,ISCAS03 Proceedings of 2003 International Symposium, Vol. 2, 2003 [5] Ratika Pradhan, M.K Ghose , A.Jeyaram," Land cover classification of remotely sensed satellite data
In this work a fast and efficient Remote Sensing classification system based on land cover information was proposed to classify the images. The Manhattan Distance Based Affinity Propagation method was proposed and analyzed. The results were compared with ground truth information physically. This work illustrate ans concluded that the system performance for land cover classification is efficient and effective VII. REFERENCES
[1] Mirkin, Boris Review of "clustering for data mining: a data recovery approach "Clustering for Data Mining: A Data Recovery Approach". Mirkin, Boris; Dynamics of the Vascular
Page | 329
www.ijarcsse.com
baysiean and hybrid classifier , International journal of computer Applications,vol-7 no-11.october 2010. [6] E.P Nobi, R.uma maheswari, " Land use and land cover assessment along pondicherry and its suuroundings using indian remote sensing sateliite andGIS., American-Eurasian Journal of Scientific Research 4(2) : 54-58,2009.
Page | 330