A 2D Moving Grid Geometric Deformable Model
Abstract
Geometric deformable models based on the level set method have become very popular. To overcome an inherent limitation in accuracy while maintaining computational efficiency, adaptive grid techniques using local grid refinement have been developed for use with these models. However, this strategy requires a very complex data structure, yields large numbers of contour points, and is inconsistent with our previously presented topology-preserving geometric deformable model (TGDM). In this paper, we incorporate an alternative adaptive grid technique called the moving grid method into the geometric deformable model framework. We find that it is simpler to implement than grid refinement, requiring no large, complex, hierarchical data structures. It also limits the number of contour vertices in the final contour and supports the incorporation of the topology-preserving constraint of TGDM. After presenting the algorithm, we demonstrate its performance using both simulated and real images.
Cite
Text
Han et al. "A 2D Moving Grid Geometric Deformable Model." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2003. doi:10.1109/CVPR.2003.1211349Markdown
[Han et al. "A 2D Moving Grid Geometric Deformable Model." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2003.](https://mlanthology.org/cvpr/2003/han2003cvpr-d/) doi:10.1109/CVPR.2003.1211349BibTeX
@inproceedings{han2003cvpr-d,
title = {{A 2D Moving Grid Geometric Deformable Model}},
author = {Han, Xiao and Xu, Chenyang and Prince, Jerry L.},
booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
year = {2003},
pages = {153-160},
doi = {10.1109/CVPR.2003.1211349},
url = {https://mlanthology.org/cvpr/2003/han2003cvpr-d/}
}