The optimal all-partial-sums algorithm in commutative semigroups and its applications for image thresholding segmentation

DOI10.1016/J.TCS.2010.11.039MaRDI QIDQ630612zbMATH OpenOpenAlexFDO

Authors Xie Xie, Jiu Lun Fan, Yin Zhu

Publication date 17 March 2011

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2010.11.039

zbMATH Keywords

image segmentationpartial sumpiling algorithmstraight-line program computation modelthresholding method

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Symbolic computation and algebraic computation (68W30) Analysis of algorithms (68W40)

Recommendations

• Image thresholding using restricted equivalence functions and maximizing the measures of similarity
• An efficient iterative thresholding method for image segmentation
• A fast iterative scheme for multilevel thresholding methods
• EFFICIENT ALGORITHMS FOR OPTIMIZATION-BASED IMAGE SEGMENTATION
• An Efficient Iterative Optimization Algorithm for Image Thresholding

Cites work

• A thresholding method based on two-dimensional Renyi's entropy
• scientific article; zbMATH DE number 976329 (Why is no real title available?)
• On the Complexity of Maintaining Partial Sums
• On the computational power of pushdown automata
• THE COMPLEXITY OF COMPUTING PARTIAL SUMS OFF-LINE
• The Complexity of Maintaining an Array and Computing Its Partial Sums
• Tight bounds for the partial-sums problem

This page was built for publication: The optimal all-partial-sums algorithm in commutative semigroups and its applications for image thresholding segmentation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q630612)