Abstract
Concerning the high the computational complexity and huge calculation of the three-dimensional Otsu,a fast three-dimensional Otsu image segmentation algorithm based on decomposition was presented in this paper.Firstly,the original three-dimensional Otsu algorithm was decomposed into three one-dimensional Otsu algorithms.Then,based on the one-dimensional Otsu algorithm,a new algorithm with a new threshold recognition function was proposed,which combined between-class distance with within-class distance,and the fast realization method was also presented.The experimental results show that the proposed algorithm does not only get satisfactory segmentation result,but also improves the calculation speed,about 1 400 times the recursive algorithm for the three-dimensional Otsu method.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
