The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Adaptive fuzzy c-shells clustering and detection of ellipses
Abstract
Several generalizations of the fuzzy c-shells (FCS) algorithm are presented for characterizing and detecting clusters that are hyperellipsoidal shells. An earlier generalization, the adaptive fuzzy c-shells (AFCS) algorithm, is examined in detail and is found to have global convergence problems when the shapes to be detected are partial. New formulations are considered wherein the norm inducing matrix in the distance metric is unconstrained in contrast to the AFCS algorithm. The resulting algorithm, called the AFCS-U algorithm, performs better for partial shapes. Another formulation based on the second-order quadrics equation is considered. These algorithms can detect ellipses and circles in 2D data. They are compared with the Hough transform (HT)-based methods for ellipse detection. Existing HT-based methods for ellipse detection are evaluated, and a multistage method incorporating the good features of all the methods is used for comparison. Numerical examples of real image data show that the AFCS algorithm requires less memory than the HT-based methods, and it is at least an order of magnitude faster than the HT approach.
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
A Computational Approach to Edge Detection
Canny, J. (1986) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1986.4767851 · Cited by 30,004
Quantitative design and evaluation of enhancement/thresholding edge detectors
Abdou, I. E., & Pratt, W. K. (1979) · Proceedings of the IEEE · doi:10.1109/proc.1979.11325 · Cited by 778
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
A possibilistic approach to clustering
Krishnapuram, R., & Keller, J. M. (1993) · IEEE Transactions on Fuzzy Systems · doi:10.1109/91.227387 · Cited by 2,496
A Comprehensive Survey of Clustering Algorithms
Xu, D., & Tian, Y. (2015) · Annals of Data Science · doi:10.1007/s40745-015-0040-1 · Cited by 1,939
“1) Time complexity (Table 8): 2) The time complexity of FCS is high for the kernel involved in the algorithm; 3) Advantages: more realistic to give the probability of belonging, relatively high accuracy of clustering; 4) Disadvantages: relatively low scalability in general, easily drawn into local opti- mal, the clust…”
A possibilistic fuzzy c-means clustering algorithm
Pal, N. R., Pal, K., Keller, J. M., & Bezdek, J. C. (2005) · IEEE Transactions on Fuzzy Systems · doi:10.1109/tfuzz.2004.840099 · Cited by 1,279
Robust clustering methods: a unified view
Dave, R. N., & Krishnapuram, R. (1997) · IEEE Transactions on Fuzzy Systems · doi:10.1109/91.580801 · Cited by 711
Self-citationOn fuzzy cluster validity indices
Wang, W., & Zhang, Y. (2007) · Fuzzy Sets and Systems · doi:10.1016/j.fss.2007.03.004 · Cited by 529
Yang, M.-S. (1993) · Mathematical and Computer Modelling · doi:10.1016/0895-7177(93)90202-a · Cited by 506
A robust competitive clustering algorithm with applications in computer vision
Frigui, H., & Krishnapuram, R. (1999) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.765656 · Cited by 487
Shi, C., Wei, B., Wei, S., Wang, W., Liu, H., & Liu, J. (2021) · EURASIP Journal on Wireless Communications and Networking · doi:10.1186/s13638-021-01910-w · Cited by 441
A new cluster validity measure and its application to image compression
Chou, C.-H., Su, M.-C., & Lai, E. (2004) · Pattern Analysis and Applications · doi:10.1007/s10044-004-0218-1 · Cited by 326
Automatic segmentation of non-enhancing brain tumors in magnetic resonance images
Fletcher-Heath, L. M., Hall, L. O., Goldgof, D. B., & Murtagh, F. R. (2001) · Artificial Intelligence in Medicine · doi:10.1016/s0933-3657(00)00073-7 · Cited by 293
Metadata
- Authors
- Dave, R. N., & Bhaswan, K.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 1992
- Volume
- 3
- Issue
- 5
- Pages
- 643-662
- ISSN
- 1045-9227 (ISSN-L)
- OpenAlex
- W2114510694
- Cited by
- 201
- References
- 2
- FWCI
- 8.50
- 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.