Minimum error thresholding segmentation algorithm based on 3D grayscale histogram
Summary: Threshold segmentation is a very important technique. The existing threshold algorithms do not work efficiently for noisy grayscale images. This paper proposes a novel algorithm called three-dimensional minimum error thresholding (3D-MET), which is used to solve the problem. The proposed approach is implemented by an optimal threshold discriminant based on the relative entropy theory and the 3D histogram. The histogram is comprised of gray distribution information of pixels and relevant information of neighboring pixels in an image. Moreover, a fast recursive method is proposed to reduce the time complexity of 3D-MET from \(O(L^6)\) to \(O(L^3)\), where \(L\) stands for gray levels. Experimental results demonstrate that the proposed approach can provide superior segmentation performance compared to other methods for gray image segmentation.
- scientific article; zbMATH DE number 5732263
- Histogram thresholding by minimizing graylevel fuzziness
- A fast color image segmentation algorithm that combines pixel space information and 3D histograms
- A `no-threshold' histogram-based image segmentation method
- An approach to three-dimensional image segmentation
- A New Iterative Triclass Thresholding Technique in Image Segmentation
- A top-down region dividing approach for image segmentation
- scientific article; zbMATH DE number 5732263 (Why is no real title available?)
- Image Thresholding by Maximizing the Index of Nonfuzziness of the 2-D Grayscale Histogram
- Optimized high speed pixel sorting and its application in watershed based image segmentation
This page was built for publication: Minimum error thresholding segmentation algorithm based on 3D grayscale histogram
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1719419)
