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

DOI10.1016/J.TCS.2010.11.039zbMath1207.68430OpenAlexW2041952594MaRDI QIDQ630612

Yin Zhu, Jiu-Lun Fan, Xie Xie

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

partial sumimage segmentationthresholding methodpiling algorithmstraight-line program computation model

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• A thresholding method based on two-dimensional Renyi's entropy
• On the computational power of pushdown automata
• THE COMPLEXITY OF COMPUTING PARTIAL SUMS OFF-LINE
• On the Complexity of Maintaining Partial Sums
• The Complexity of Maintaining an Array and Computing Its Partial Sums

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