The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Multiscale morphological segmentation of gray-scale images
Abstract
In this paper, the authors have proposed a method of segmenting gray level images using multiscale morphology. The approach resembles the watershed algorithm in the sense that the dark (respectively bright) features which are basically canyons (respectively mountains) on the surface topography of the gray level image are gradually filled (respectively clipped) using multiscale morphological closing (respectively opening) by reconstruction with isotropic structuring element. The algorithm detects valid segments at each scale using three criteria namely growing, merging and saturation. Segments extracted at various scales are integrated in the final result. The algorithm is composed of two passes preceded by a preprocessing step for simplifying small scale details of the image that might cause over-segmentation. In the first pass feature images at various scales are extracted and kept in respective level of morphological towers. In the second pass, potential features contributing to the formation of segments at various scales are detected. Finally the algorithm traces the contours of all such contributing features at various scales. The scheme after its implementation is executed on a set of test images (synthetic as well as real) and the results are compared with those of few other standard methods. A quantitative measure of performance is also formulated for comparing the methods.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Marr, D., & Hildreth, E. (1980) · Proceedings of the Royal Society of London. Series B. Biological Sciences · doi:10.1098/rspb.1980.0020 · Cited by 6,510
Cited by
Analysis of new top-hat transformation and the application for infrared dim small target detection
Bai, X., & Zhou, F. (2010) · Pattern Recognition · doi:10.1016/j.patcog.2009.12.023 · Cited by 766
Miri, M. S., & Mahloojifar, A. (2011) · IEEE Transactions on Biomedical Engineering · doi:10.1109/tbme.2010.2097599 · Cited by 309
Metadata
- Authors
- Mukhopadhyay, S., & Chanda, B.
- Venue
- IEEE Transactions on Image Processing
- Published
- 2003-05
- Volume
- 12
- Issue
- 5
- Pages
- 533-549
- ISSN
- 1057-7149 (ISSN-L)
- OpenAlex
- W2139038335
- Cited by
- 160
- References
- 2
- FWCI
- 8.38
- 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.