A survey of thresholding techniques
Computer Vision, Graphics, and Image Processing
Automatic thresholding of gray-level pictures using two-dimensional entropy
Computer Vision, Graphics, and Image Processing
Performance study of several global thresholding techniques for segmentation
Computer Vision, Graphics, and Image Processing
The Complexity of Maintaining an Array and Computing Its Partial Sums
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Tight bounds for the partial-sums problem
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Image thresholding using Tsallis entropy
Pattern Recognition Letters
Image thresholding using two-dimensional Tsallis-Havrda-Charvát entropy
Pattern Recognition Letters
Fast three-dimensional Otsu thresholding with shuffled frog-leaping algorithm
Pattern Recognition Letters
Tsallis entropy and the long-range correlation in image thresholding
Signal Processing
Hi-index | 5.23 |
The design and analysis of multidimensional All-Partial-Sums (APS) algorithms are considered. We employ the sequence length as the performance measurement criterion for APS algorithms and corresponding thresholding methods, which is more sophisticated than asymptotic time complexity under the straight-line program computation model. With this criterion, we propose the piling algorithm to minimize the sequence length, then we show this algorithm is an optimal APS algorithm in commutative semigroups in the worst case. The experimental results also show the algorithmic efficiency of the piling algorithm. Furthermore, the theoretical works of APS algorithm will help to construct the higher dimensional thresholding methods.