Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.

com Volume 2, Issue 1, January February 2013 ISSN 2278-6856

VIDEO INFORMATION RETERIVAL USING: CHEMELEON CLUSTERING

D.Saravanan1, Dr.S.Srininvasan2
1

Research Scholor, Sathyabama Univeristy Chennai, Tamil Nadu India. Professor and Head, Department of CSE Anna University Regional Centre Madurai, Tamil Nadu, India

ABSTRACT: Data mining technique can apply to various

documents. In this paper concentration on the application of vides data called video data mining using clustering approach. The amount of information produced every year increased many factors among all video is particular contain audio, text. Motion, image and visual. Among this extract the needed information is a challenging task. A Cluster is a collection of data objects that used for partitions large data sets into groups according their similarity. Existing clustering algorithms fails to find cluster properly base on users need. The proposed method provide facilitating discovery of natural and homogeneous clusters. CHAMELEON can discover natural clusters of different shapes and sizes because its merging decision dynamically adapts to the different clustering model characterized by the clusters in consideration. Experimental results on several data sets with varying characteristics show that CHAMELEON can discover natural clusters that many existing clustering algorithms fail to find.

Key words: Data mining, Clustering, Video information Retrieval, Image Mining, Chameleon.

1. INTRODUCTION
Nowadays we have many applications with massive amount of data which are caused limitation in data storage capacity and processing time. Traditional data mining is not suitable for this kind of applications so they should be tuned and changed or designed with new algorithms. Besides of speed and storage capacity, reallife concepts tend to change over time: Telecommunication and network area: calling records, Network monitoring and traffic engineering, Sensor monitoring & surveillance, Security monitoring, Web logs and Web page click streams Business: credit card transaction flows, stock exchange, power supply & manufacturing. Discovering the evolution of the spread of illnesses. As new cases are reported, finding out how clusters evolve can prove crucial in identifying sources responsible for the spread of illness. Discovering the evolution of workload in an e-commerce server, which can help in dynamically fine tune the server to obtain better performance. Discovering meteorological data, such as temperatures registered throughout a region, by observing How clusters of spatial-meteorological points evolve in time. The Volume 2, Issue 1 January - February 2013

growth of volume of existing data and insufficiency of data storage capacity lead us to the dynamic processing data and extracting knowledge. In this way data have been considered as a stream of data which come in from one side and exit from another side so we arent able to visit data for second time. This main property of data stream arise some difficulties. Two main problems in this area which are related to this property include: 1) One scan is possible for processing data, 2) Data is included evolutionary stream and concepts are changed during the time. It can be gradual or abrupt. Many techniques are used in data mining area but they should be tuned and changed to work in data stream mining. We can categorize data stream mining in three main techniques: classification, clustering and association rules extraction. Many studies have been executed to support data stream mining especially for concept drift. Many researchers interest is to apply some techniques for increasing compactness of representation, fast and incremental processing of new data points, clear and fast identification of outliers. Scalability and robustness should be studied for data stream mining. Generally it is possible to enumerate two main problems in data stream clustering, concept change and visiting data once. First of all, How to detect a change in the concepts? Have to: Detect the changes as soon as it is occur Detect equally well both type of changes abrupt and gradual Distinguish between real drift and noise 1.1 Existing Systems The growth of volume of existing data and insufficiency of data storage capacity lead us to the dynamic processing data and extracting knowledge. In this way data have been considered as a stream of data which come in from one side and exit from another side so we arent able to visit data for second time. This main property of data stream arise some difficulties 1.2 Issues in the Existing Work Existing clustering algorithms may break down when Choice of parameters is incorrect Model is not adequate to capture the characteristics Of clusters Page 166

Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com Volume 2, Issue 1, January February 2013 ISSN 2278-6856
Diverse shapes, densities, and sizes K-means and PAM Algorithm assigns K-representational points to the clusters and tries to form clusters based on the distance measure Partition-based Techniques Such as K-means CLARANS Centroid-based Medoid-based Techniques Find clusters which are hyper-ellipsoidal and of similar sizes, hence, have some drawbacks Density-based Techniques DB Scan Resistant to Noise Can handle clusters of different shapes and sizes Doesnt work well with varying densities or Highdimensional data (Sensitive to user defined parameters) Hierarchical Techniques Some method use centroid/ medoid-based similarity, fail the same with partitioned techniques Single-link method can find clusters of arbitrary shape and different sizes. However, this method is highly susceptible to noise or outliers. CURE - Clustering Using Representatives Uses a user-specified number of points to represent a cluster Representative points are found by selecting a constant number of points from a cluster and then shrinking them toward the center of the cluster Cluster similarity is the similarity of the closest pair of representative points from different clusters CURE is better able to handle clusters of arbitrary shapes and sizes Only consider minimum distances representative points of clusters between the Facilitating discovery of natural and homogeneous clusters Being applicable to all types of data Two-phase approach 1. Phase -I Uses a graph partitioning algorithm to divide the data set into a set of individual clusters. 2. Phase -II Uses an agglomerative hierarchical mining algorithm to merge the clusters. Chameleon(Phase-II) takes into account Inter Connectivity Relative closeness Hence, chameleon takes into account features intrinsic to a cluster. 1.4 Advantages of Proposed Work CHAMELEON can discover natural clusters of different shapes and sizes because its merging decision dynamically adapts to the different clustering model characterized by the clusters in consideration. Experimental results on several data sets with varying characteristics show that CHAMELEON can discover natural clusters that many existing clustering algorithms fail to find. It is possible to use other algorithms instead of k-nearest neighbor graph Different domains may require different models for capturing closeness and inter-connectivity It is noteworthy that our scheme outperforms them, even though it does not make use of the metric-space/spatial nature of the data. The methodology of dynamic modeling of clusters in agglomerative hierarchical methods is applicable to all types of data as long as a similarity matrix is available or can be constructed.

2. ISSUES OF IMAGE MINING

The fundamental challenge in image mining is to determine how low-level pixel representation contained in a raw image or image sequence can be efficiently and effectively processed to identify high-level spatial objects and relationships. In other words, image mining deals with the extraction of implicit knowledge, image data relationship, or other patterns not explicitly stored in the image databases. Image retrieval is based on the availability of a representation scheme of image content. build semantic image retrieval systems for various application domains such as consumer photographs, medical images etc, it is important to have a structured framework to represent and index images with respect to domain-specific visual semantics. To reduce the human effort in annotating images with visual semantics, a systematic and modular approach to construct visual semantics detectors from statistical learning is essential. Image retrieval is based on the availability of a representation scheme of image content. Image content Page 167

Fail to take into account special characteristics of individual clusters Make incorrect merging decisions when the underlying data does not follow the assumed model When noise is present Cannot Handle Differing Densities CURE takes representatives into account distance between

ROCK takes into account inter-cluster aggregate connectivity. 1.3 P1.3 Proposed System Presenting a novel hierarchical clustering algorithm CHAMELEON Volume 2, Issue 1 January - February 2013

Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com Volume 2, Issue 1, January February 2013 ISSN 2278-6856
descriptors may be visual features such as color, texture, shape, and spatial relationships, or semantic primitives 2.1 Content-independent Information Data that is not directly concerned with image content, but related to it. Examples are image format, authors name, date, and location. 2.2 Content-based Information Non-information-bearing metadata: data referring to low-level or intermediate-level features, such as color, texture, shape, spatial relationships, and their various combinations. This information can easily be computed from the raw data. 2.3Information-Relation Data Data referring to content semantics, concerned with relationships of image entities to real-world entities. This type of information, such as that a particular building appearing in an image is the Empire State Building , cannot usually be derived from the raw data, and must then be supplied by other means, perhaps by inheriting this semantic label from another image, where a similarappearing building has already been identified. algorithms. This algorithm can compute partitioning that has a very small edge-cut. 4.4. Merging Sub-Clusters After the Partition Graph we can do Merging SubClusters by using Hierarchical clustering algorithm. It can that combines together these small sub-clusters. Hierarchical clustering algorithm utilizes the dynamic modeling framework. It can perform Relative InterConnectivity and Relative Closeness. Finally they are combining by Merge Partitions.

3. HIERARCHICAL TECHNIQUES
Current Video data mining techniques emphasize on pattern discovery. We require content-adaptive pattern discovery techniques that would adapt to variations in content, and make the event-search tractable. Clustering in data mining is a discovery process that groups a set of data. Out of the four clustering approaches, Hierarchical algorithms are best suited for video data mining due to its simplicity and efficiency. They produce a nested sequence of clusters, with a single all-inclusive cluster at the top an single point clusters at the bottom. Hierarchical clustering algorithms are classified as agglomerative or divisive. The agglomerative (bottom up) approach repeatedly merges two clusters, while the divisive (top down) approach repeatedly splits a cluster into two.

Figure 1: Data flow diagram

5. CONCLUSION
In this paper we present CHAMELEON, a new clustering algorithm that overcomes the limitations of existing agglomerative hierarchical clustering algorithms discussed. Results show the facilitating discovery of natural and homogeneous clusters being applicable to all types of data sets. Experiment data prove this clearly.

6. FUTURE ENHANCEMENT
In this section we present CHAMELEON, a new clustering algorithm that overcomes the imitations of existing agglomerative hierarchical clustering algorithms discussed. CHAMELEON operates on a sparse graph in which nodes represent data items, and weighted edges represent similarities among the data items. This sparse graph representation of the data set allows CHAMELEON to scale to large data sets and to operate successfully on data sets that are available only in similarity space and not in metric spaces. CHAMELEON finds the clusters in the data set by using a two phase algorithm. During the first phase, CHAMELEON uses a graph partitioning algorithm to cluster the data items into a large number of relatively small sub-clusters. During the second phase, it uses an agglomerative hierarchical clustering algorithm to find the genuine clusters by repeatedly combining together these sub-clusters. The key feature of CHAMELEONs agglomerative hierarchical clustering algorithm is that it determines the pair of most Page 168

4. EXPERIMENTAL SETUP
4.1. Initial Sub-Cluster 4.2. Identify the Neighbor Graph 4.3. Compute Partition Graph 4.4. Merging Sub-Clusters 4.1. Initial Sub-Clusters Here we finding Initial Sub-clusters It can get the input dataset and apply the spare graph. It can produce the edge cut of the dataset. 4.2. Identify Neighbor Graph After the Initial Sub-clusters we can perform the Knearest Neighbor Graph. It can produce Similarity among data points 4.3. Compute Partition Graph After the Neighbor Graph we can to perform the Partition Graph. It can do by the multilevel graph partitioning Volume 2, Issue 1 January - February 2013

Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com Volume 2, Issue 1, January February 2013 ISSN 2278-6856
similar sub-clusters by taking into account both the interconnectivity as well as the closeness of the clusters; and thus it overcomes the limitations discussed in Section 3 that result from using only one of them. Furthermore, CHAMELEON uses a novel approach to model the degree of inter-connectivity and closeness between each pair of clusters that takes into account the internal characteristics of the clusters themselves. Thus, it does not depend on a static user supplied model, and can automatically adapt to the internal characteristics of the clusters being merged. In the rest of this section we provide details on how to model the data set, how to dynamically model the similarity between the clusters by computing their relative inter-connectivity and relative closeness, how graph partitioning is used to obtain the initial fine-grain clustering solution, and how the relative inter-connectivity and relative closeness are used to repeatedly combine together the sub-clusters in a hierarchical fashion.

Figure 5 Time Taken

7. EXPERIMENTAL SCREEN SHOTS

Figure 6 Cluter Formation Video Data File : Graphics

Figure 7 Cluster Formation Video DataFile : News Figure 2 Open a File

Figure 8 Cluster Formation Video DataFile:Movie

Figure 3 Clustering

Figure 9.Cluster Formation Video Data File:Natural

Figure 4 Comparing

Volume 2, Issue 1 January - February 2013

Page 169

Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com Volume 2, Issue 1, January February 2013 ISSN 2278-6856
large databases. In Proceedings of the ACM SIGMOD Conference on Management of Data, pages 103-114,Montreal, Canada, June 1996. [4] N. Beckmann, H.-P. Kriegei, R. Schneider, and B. Seeger, The R*-tree: an efficient and robust access method for points and rectangles. In Proc. Of ACM SIGMOD, pages 322-331, Atlantic City, NJ, May 1990. [5] D.Saravanan, Dr.S.Srinivasan, Indexing ad Accessing Video Frames by Histogram Approach , In the Proc. Of International Conference on RSTSCC 2010, Pages 196-199, Dec-2010. [6] . D.Saravanan, Dr.S.Srinivasan, A Study of Hierarchical Clustering Algorithms suitable for video data mining, In the Proc. Of the 2 nd National Conference on Imaging Computing object and mining ICOM-2011, Pages 71-74, Apr-2011. [7] D.Saravanan, Dr.S.Srinivasan, A proposed New Algorithm For Hierearcical Clustering Suitable for Video Data mining . CIIT-2011. [8] JngHwan Oh, Babitha Bandi Multimedia Data Mining Framework for Raw Video sequence in proc MDM/KDD 2002:International workshop on multimedia data mining (with ACM SIGKDD 2002) [9] Ian Davindson and S.S. Ravi Agglomerative Hierarchical clustering with constraints: Theoretical and Empirical Results 4 th siam data mining. [10] George Karypis Eui-Hong (Sam) Han Vipin Kumar CHAMELEON: A Hierarchical Clustering Algorithm Using Dynamic Modeling. IEEE. AUTHOR D.Saravanan Working Presently as Sr.Lecturer
in Dept of MCA, Sathyabama University, Chennai, TamilNadu.He has 14 Years of Teaching Experience in Engineering College. Area of interest is Data Mining, Image Prcoessing; DBMS.He has guided 15 M.Phil Research in various platforms. Dr.S.Srinivasan, currently working as Professor & Head, Department of Computer Scinece and Engg. Anna University Regional Office Madurai. .He has published various research articles and guiding PhD Students in the area of CSE and also member of various Bodies.

Figure 10.Cluster Formatin Video Data File: Cartoon

Figure 11. Result of Different Video File

Figure 12 Result of Comparison Video File Blue cartoon Red graphics Rosy brown- movie Brown news Cyan natural

REFERENCES
[1] Martin Ester, Hans-Peter Kriegel, Jorg Sander, and Xiaowei Xu, A density-based algorithm for discovering clusters in large spatial database with noise. In I&1 Conference on Knowledge Discovery in Databases and Data Mining (KDD-96), Portland, Oregon, August 1996. [2] Martin Ester, Hans-Peter Kriegel, and Xiaowei Xu, A database interface for clustering in large spatial databases. In Intl Conference on Knowledge Discovery in Databases and Data Mining (KDD-95), Montreal, Canada, August 1995. [3] Tian Zhang, Raghu Ramakrishnan, and Miron Livny, Birch: An efficient data clustering method for very Volume 2, Issue 1 January - February 2013

Page 170