Texture Segmentation Using Fractal Dimension
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
Normalized Cuts and Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Data mining: concepts and techniques
Data mining: concepts and techniques
Path Based Pairwise Data Clustering with Application to Texture Segmentation
EMMCVPR '01 Proceedings of the Third International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition
Gestalt-based feature similarity measure in trademark database
Pattern Recognition
The Bayes Decision Rule Induced Similarity Measures
IEEE Transactions on Pattern Analysis and Machine Intelligence
A survey of kernel and spectral methods for clustering
Pattern Recognition
An Algorithm for Finding Intrinsic Dimensionality of Data
IEEE Transactions on Computers
Intrinsic dimension estimation of manifolds by incising balls
Pattern Recognition
On local intrinsic dimension estimation and its applications
IEEE Transactions on Signal Processing
Data clustering: 50 years beyond K-means
Pattern Recognition Letters
PRICAI'10 Proceedings of the 11th Pacific Rim international conference on Trends in artificial intelligence
An Intrinsic Dimensionality Estimator from Near-Neighbor Information
IEEE Transactions on Pattern Analysis and Machine Intelligence
Geodesic entropic graphs for dimension and entropy estimation in manifold learning
IEEE Transactions on Signal Processing
A survey of fuzzy clustering algorithms for pattern recognition. I
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Hi-index | 0.00 |
The goal of clustering is to partition the data points into clusters, such that the data points in the same cluster are similar. Therefore, similarity measure is one of the most critical issues for clustering. In this paper, we present a novel similarity measure based on intrinsic dimension, where the local intrinsic dimension of each data point is considered as a new feature to describe the data points, leading to a new type of similarity measure combining the new feature and original features. The main idea is that the data points in the same cluster are expected to have the same intrinsic dimension while they have similar values of the traditional features. The proposed method is evaluated on some artificial data sets and the experiment results illustrate the effectiveness of the proposed similarity measure. Moreover, the segmentation results of natural images based on the proposed similarity measure show that the intrinsic dimension is worthy of being considered as a new feature of the data points in more applications.