Abstract
PurposeAdvanced image segmentation techniques like the Chan-Vese (CV) models transform the segmentation problem into a minimization problem which is then solved using the gradient descent (GD) optimization algorithm. This study explores whether the computational efficiency of CV can be improved when GD is replaced by a different optimization method. MethodsTwo GD variants from the literature (Nesterov accelerated, Barzilai-Borwein) and a newly developed hybrid variant of GD were used to improve the computational efficiency of CV by making GD insensitive to local minima. One more variant of GD from the literature (projected GD) was used to address the issue of maintaining the constraint on boundary evolution in CV which also increases computational cost. A novel modified projected GD (Barzilai-Borwein projected GD) was also used to overcome both problems at the same time. The effect of optimization method selection on processing time and the quality of the output was assessed for 25 musculoskeletal ultrasound images (five anatomical areas). ResultsThe Barzilai-Borwein projected GD method was able to significantly reduce computational time (average(±std.dev.) reduction 95.82 % (±3.60 %)) with the least structural distortion in the delineated output relative to the conventional GD (average(±std.dev.) structural similarity index: 0.91(±0.06)). ConclusionThe use of an appropriate optimization method can substantially improve the computational efficiency of CV models. This can open the way for real-time delimitation of anatomical structures to aid the interpretation of clinical ultrasound. Further research on the effect of the optimization method on the accuracy of segmentation is needed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.