Image Smoothing and Segmentation by Multiresolution Pixel Linking: Further Experiments and Extensions
- 1 January 1982
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics
- Vol. 12 (5), 611-622
- https://doi.org/10.1109/tsmc.1982.4308880
Abstract
A recently developed method of image smoothing and segmentation makes use of a "pyramid" of images at successively lower resolutions. It establishes links between pixels at successive levels of the pyramid; the subtrees of the pyramid defined by these links yield a segmentation of the image into regions over which the smoothing takes place. This paper investigates several variations on the basic linking process with regard to such factors as initialization, criteria for linking, and iteration scheme used. It also studies generalizations in which the links are weighted rather than forced, and in which interactions among the pixels at a given level are also allowed. Finally, it extends the approach to links based on more than one feature of a pixel, e.g., on color components or local property values.Keywords
This publication has 7 references indexed in Scilit:
- Split-and-link algorithms for image segmentationPattern Recognition, 1982
- Image Smoothing Based on Neighbor LinkingIEEE Transactions on Pattern Analysis and Machine Intelligence, 1981
- Fast filter transform for image processingComputer Graphics and Image Processing, 1981
- A facet model for image dataComputer Graphics and Image Processing, 1981
- Segmentation and Estimation of Image Region Properties through Cooperative Hierarchial ComputationIEEE Transactions on Systems, Man, and Cybernetics, 1981
- Edge preserving smoothingComputer Graphics and Image Processing, 1979
- Structural Pattern RecognitionPublished by Springer Nature ,1977