The DOI matches its Crossref record; 40 of the 40 references it cites were found in a registry or an index.
Clustering by scale-space filtering
Abstract
In pattern recognition and image processing, the major application areas of cluster analysis, human eyes seem to possess a singular aptitude to group objects and find important structures in an efficient and effective way. Thus, a clustering algorithm simulating a visual system may solve some basic problems in these areas of research. From this point of view, we propose a new approach to data clustering by modeling the blurring effect of lateral retinal interconnections based on scale space theory. In this approach, a data set is considered as an image with each light point located at a datum position. As we blur this image, smaller light blobs merge into larger ones until the whole image becomes one light blob at a low enough level of resolution. By identifying each blob with a cluster, the blurring process generates a family of clustering along the hierarchy. The advantages of the proposed approach are: 1) The derived algorithms are computationally stable and insensitive to initialization and they are totally free from solving difficult global optimization problems. 2) It facilitates the construction of new checks on cluster validity and provides the final clustering a significant degree of robustness to noise in data and change in scale. 3) It is more robust in cases where hyperellipsoidal partitions may not be assumed. 4) it is suitable for the task of preserving the structure and integrity of the outliers in the clustering process. 5) The clustering is highly consistent with that perceived by human eyes. 6) The new approach provides a unified framework for scale-related clustering algorithms derived from many different fields such as estimation theory, recurrent signal processing on self-organization feature maps, information theory and statistical mechanics, and radial basis function neural networks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
Everitt, B. J., Landau, S., & Leese, M. (1974) · Cited by 9,358
Algorithms for Clustering Data
Sarle, W. S. (1990) · Technometrics · doi:10.1080/00401706.1990.10484648 · Cited by 7,865
Algorithms for clustering data
Flury, B. (1989) · Journal of Statistical Planning and Inference · doi:10.1016/0378-3758(89)90033-5 · Cited by 6,432
Marr, D. (1982) · Cumulative Index of Computer Aided Architectural Design · Cited by 5,733
Cluster Analysis for Applications
(1973) · Elsevier eBooks · doi:10.1016/c2013-0-06161-0 · Cited by 5,080
Hierarchical Clustering Schemes
Johnson, S. C. (1967) · Psychometrika · doi:10.1007/bf02289588 · Cited by 4,897
Nadaraya, E. A. (1964) · Theory of Probability & Its Applications · doi:10.1137/1109020 · Cited by 3,462
Pattern Classification and Scene Analysis.
Clarke, M. R. B., Duda, R. O., & Hart, P. E. (1974) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2344977 · Cited by 3,222
Cited by
Survey of Clustering Algorithms
Xu, R., & WunschII, D. (2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2005.845141 · Cited by 6,197
Automatic Clustering Using an Improved Differential Evolution Algorithm
Das, S., Abraham, A., & Konar, A. (2008) · IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans · doi:10.1109/tsmca.2007.909595 · Cited by 726
A survey on nature inspired metaheuristic algorithms for partitional clustering
Nanda, S. J., & Panda, G. (2014) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2013.11.003 · Cited by 574
Clustering using firefly algorithm: Performance study
Senthilnath, J., Omkar, S. N., & Mani, V. (2011) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2011.06.003 · Cited by 474
An overview of clustering methods
Omran, M. G. H., Engelbrecht, A. P., & Salman, A. (2007) · Intelligent Data Analysis · doi:10.3233/ida-2007-11602 · Cited by 424
Determination of the spread parameter in the Gaussian kernel for classification and regression
Wang, W., Xu, Z., Lu, W., & Zhang, X. (2003) · Neurocomputing · doi:10.1016/s0925-2312(02)00632-x · Cited by 390
Self-citationPintilie, G. D., Zhang, J., Goddard, T. D., Chiu, W., & Gossard, D. C. (2010) · Journal of Structural Biology · doi:10.1016/j.jsb.2010.03.007 · Cited by 388
Self-citationAn algorithm for data-driven bandwidth selection
Comaniciu, D. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1177159 · Cited by 336
A whale optimization algorithm (WOA) approach for clustering
Nasiri, J., & Khiyabani, F. M. (2018) · Cogent Mathematics & Statistics · doi:10.1080/25742558.2018.1483565 · Cited by 295
Dynamic clustering using particle swarm optimization with application in image segmentation
Omran, M. G. H., Salman, A., & Engelbrecht, A. P. (2006) · Pattern Analysis and Applications · doi:10.1007/s10044-005-0015-5 · Cited by 292
PARTICLE SWARM OPTIMIZATION METHOD FOR IMAGE CLUSTERING
OMRAN, M., ENGELBRECHT, A. P., & SALMAN, A. (2005) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001405004083 · Cited by 288
Metadata
- Authors
- Leung, Y., Zhang, J.-S., & Xu, Z.-B.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2000
- Volume
- 22
- Issue
- 12
- Pages
- 1396-1410
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2158184062
- Cited by
- 293
- References
- 40
- FWCI
- 7.08
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.