Name
Abstract | ||
|---|---|---|
Image and video (multimedia) databases are very large in size. It becomes very difficult to search the images from these databases by the application of conventional exhaustive searching because it will require unreasonable amount of time. For this purpose an automatic graph based clustering algorithm is developed and proposed through this paper. It reduces the searching time for the images from large databases. The proposed algorithm works on the concept of minimum spanning tree, which removes the inconsistent edges from tree, based on the dynamic threshold provided to the algorithm. The proposed algorithm reduces the search time for the retrieval with an acceptable loss in the accuracy. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/AMS.2007.4 | Asia International Conference on Modelling and Simulation |
Keywords | Field | DocType |
proposed algorithm work,automatic graph,large databases,modified framework,unreasonable amount,acceptable loss,search time,clustering algorithm,dynamic threshold,proposed algorithm,inconsistent edge,minimum spanning tree,clustering algorithms,image processing,data engineering,exhaustive search,taxonomy,graph theory,tree graphs,data mining | Graph,Canopy clustering algorithm,Data mining,CURE data clustering algorithm,Multimedia database,Search algorithm,Computer science,Image processing,Cluster analysis,Minimum spanning tree | Conference |
ISBN | Citations | PageRank |
0-7695-2845-7 | 1 | 0.39 |
References | Authors | |
4 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Satish Kumar Singh | 1 | 224 | 17.23 |
| Shishir Kumar | 2 | 78 | 17.06 |
| G. S. Tomar | 3 | 25 | 6.71 |
| K. Ravi Kumar | 4 | 34 | 6.76 |
| G. K. Santhalia | 5 | 2 | 1.45 |