A moving grid framework for geometric deformable models

Xiao Han, Chenyang Xu, Jerry Ladd Prince

Research output: Contribution to journalArticle

Abstract

Geometric deformable models based on the level set method have become very popular in the last decade. 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. This strategy, however, requires a very complex data structure, yields large numbers of contour points, and is inconsistent with the implementation of topology-preserving geometric deformable models (TGDMs). In this paper, we investigate the use of an alternative adaptive grid technique called the moving grid method with geometric deformable models. In addition to the development of a consistent moving grid geometric deformable model framework, our main contributions include the introduction of a new grid nondegeneracy constraint, the design of a new grid adaptation criterion, and the development of novel numerical methods and an efficient implementation scheme. The overall method is simpler to implement than using grid refinement, requiring no large, complex, hierarchical data structures. It also offers an extra benefit of automatically reducing the number of contour vertices in the final results. After presenting the algorithm, we demonstrate its performance using both simulated and real images.

Original languageEnglish (US)
Pages (from-to)63-79
Number of pages17
JournalInternational Journal of Computer Vision
Volume84
Issue number1
DOIs
StatePublished - Aug 2009

Fingerprint

Data structures
Computational efficiency
Numerical methods
Topology

Keywords

  • Adaptive grid method
  • Deformation moving grid
  • Geometric deformable model
  • Level set method
  • Topology preservation

ASJC Scopus subject areas

  • Software
  • Artificial Intelligence
  • Computer Vision and Pattern Recognition

Cite this

A moving grid framework for geometric deformable models. / Han, Xiao; Xu, Chenyang; Prince, Jerry Ladd.

In: International Journal of Computer Vision, Vol. 84, No. 1, 08.2009, p. 63-79.

Research output: Contribution to journalArticle

@article{80b5570dbf984868b6bb9163812a4d3d,
title = "A moving grid framework for geometric deformable models",
abstract = "Geometric deformable models based on the level set method have become very popular in the last decade. 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. This strategy, however, requires a very complex data structure, yields large numbers of contour points, and is inconsistent with the implementation of topology-preserving geometric deformable models (TGDMs). In this paper, we investigate the use of an alternative adaptive grid technique called the moving grid method with geometric deformable models. In addition to the development of a consistent moving grid geometric deformable model framework, our main contributions include the introduction of a new grid nondegeneracy constraint, the design of a new grid adaptation criterion, and the development of novel numerical methods and an efficient implementation scheme. The overall method is simpler to implement than using grid refinement, requiring no large, complex, hierarchical data structures. It also offers an extra benefit of automatically reducing the number of contour vertices in the final results. After presenting the algorithm, we demonstrate its performance using both simulated and real images.",
keywords = "Adaptive grid method, Deformation moving grid, Geometric deformable model, Level set method, Topology preservation",
author = "Xiao Han and Chenyang Xu and Prince, {Jerry Ladd}",
year = "2009",
month = "8",
doi = "10.1007/s11263-009-0231-3",
language = "English (US)",
volume = "84",
pages = "63--79",
journal = "International Journal of Computer Vision",
issn = "0920-5691",
publisher = "Springer Netherlands",
number = "1",

}

TY - JOUR

T1 - A moving grid framework for geometric deformable models

AU - Han, Xiao

AU - Xu, Chenyang

AU - Prince, Jerry Ladd

PY - 2009/8

Y1 - 2009/8

N2 - Geometric deformable models based on the level set method have become very popular in the last decade. 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. This strategy, however, requires a very complex data structure, yields large numbers of contour points, and is inconsistent with the implementation of topology-preserving geometric deformable models (TGDMs). In this paper, we investigate the use of an alternative adaptive grid technique called the moving grid method with geometric deformable models. In addition to the development of a consistent moving grid geometric deformable model framework, our main contributions include the introduction of a new grid nondegeneracy constraint, the design of a new grid adaptation criterion, and the development of novel numerical methods and an efficient implementation scheme. The overall method is simpler to implement than using grid refinement, requiring no large, complex, hierarchical data structures. It also offers an extra benefit of automatically reducing the number of contour vertices in the final results. After presenting the algorithm, we demonstrate its performance using both simulated and real images.

AB - Geometric deformable models based on the level set method have become very popular in the last decade. 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. This strategy, however, requires a very complex data structure, yields large numbers of contour points, and is inconsistent with the implementation of topology-preserving geometric deformable models (TGDMs). In this paper, we investigate the use of an alternative adaptive grid technique called the moving grid method with geometric deformable models. In addition to the development of a consistent moving grid geometric deformable model framework, our main contributions include the introduction of a new grid nondegeneracy constraint, the design of a new grid adaptation criterion, and the development of novel numerical methods and an efficient implementation scheme. The overall method is simpler to implement than using grid refinement, requiring no large, complex, hierarchical data structures. It also offers an extra benefit of automatically reducing the number of contour vertices in the final results. After presenting the algorithm, we demonstrate its performance using both simulated and real images.

KW - Adaptive grid method

KW - Deformation moving grid

KW - Geometric deformable model

KW - Level set method

KW - Topology preservation

UR - http://www.scopus.com/inward/record.url?scp=67349113423&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=67349113423&partnerID=8YFLogxK

U2 - 10.1007/s11263-009-0231-3

DO - 10.1007/s11263-009-0231-3

M3 - Article

C2 - 19946381

AN - SCOPUS:67349113423

VL - 84

SP - 63

EP - 79

JO - International Journal of Computer Vision

JF - International Journal of Computer Vision

SN - 0920-5691

IS - 1

ER -