3D brain surface matching based on geodesics and local geometry

Yongmei Wang, Bradley S. Peterson, Lawrence H. Staib

Research output: Contribution to journalArticle

Abstract

The non-rigid registration of surfaces is a complex and difficult task for which there are many important applications, such as comparing shape between deformable objects and comparing associated function. This paper presents a new approach for brain surface matching by determining the correspondence of 3D point sets between pairs of surfaces. The algorithm is based on shape using a combination of geodesic distance and surface curvature. There are two major procedures involved. An initial sparse set of corresponding points is first generated by matching local geometrical features. Geodesic distance interpolation is then employed hierarchically in order to capture the complex surface. By this scheme, surface correspondence and triangulation are computed simultaneously. Experiments applied to human cerebral cortical surfaces are shown to evaluate the approach. It is shown that the proposed method performs well for both surface matching and surface shape recovery.

Original languageEnglish (US)
Pages (from-to)252-271
Number of pages20
JournalComputer Vision and Image Understanding
Volume89
Issue number2-3
DOIs
StatePublished - Jan 1 2003

Fingerprint

Brain
Geometry
Triangulation
Interpolation
Recovery

Keywords

  • Correspondence
  • Corresponding points
  • Geodesics
  • Geometrical features
  • Shape
  • Shortest paths
  • Surface matching
  • Triangulation

ASJC Scopus subject areas

  • Computer Vision and Pattern Recognition
  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

3D brain surface matching based on geodesics and local geometry. / Wang, Yongmei; Peterson, Bradley S.; Staib, Lawrence H.

In: Computer Vision and Image Understanding, Vol. 89, No. 2-3, 01.01.2003, p. 252-271.

Research output: Contribution to journalArticle

Wang, Yongmei ; Peterson, Bradley S. ; Staib, Lawrence H. / 3D brain surface matching based on geodesics and local geometry. In: Computer Vision and Image Understanding. 2003 ; Vol. 89, No. 2-3. pp. 252-271.
@article{6880593ac2c0411a8b60ab28a565bc0d,
title = "3D brain surface matching based on geodesics and local geometry",
abstract = "The non-rigid registration of surfaces is a complex and difficult task for which there are many important applications, such as comparing shape between deformable objects and comparing associated function. This paper presents a new approach for brain surface matching by determining the correspondence of 3D point sets between pairs of surfaces. The algorithm is based on shape using a combination of geodesic distance and surface curvature. There are two major procedures involved. An initial sparse set of corresponding points is first generated by matching local geometrical features. Geodesic distance interpolation is then employed hierarchically in order to capture the complex surface. By this scheme, surface correspondence and triangulation are computed simultaneously. Experiments applied to human cerebral cortical surfaces are shown to evaluate the approach. It is shown that the proposed method performs well for both surface matching and surface shape recovery.",
keywords = "Correspondence, Corresponding points, Geodesics, Geometrical features, Shape, Shortest paths, Surface matching, Triangulation",
author = "Yongmei Wang and Peterson, {Bradley S.} and Staib, {Lawrence H.}",
year = "2003",
month = "1",
day = "1",
doi = "10.1016/S1077-3142(03)00015-8",
language = "English (US)",
volume = "89",
pages = "252--271",
journal = "Computer Vision and Image Understanding",
issn = "1077-3142",
publisher = "Academic Press Inc.",
number = "2-3",

}

TY - JOUR

T1 - 3D brain surface matching based on geodesics and local geometry

AU - Wang, Yongmei

AU - Peterson, Bradley S.

AU - Staib, Lawrence H.

PY - 2003/1/1

Y1 - 2003/1/1

N2 - The non-rigid registration of surfaces is a complex and difficult task for which there are many important applications, such as comparing shape between deformable objects and comparing associated function. This paper presents a new approach for brain surface matching by determining the correspondence of 3D point sets between pairs of surfaces. The algorithm is based on shape using a combination of geodesic distance and surface curvature. There are two major procedures involved. An initial sparse set of corresponding points is first generated by matching local geometrical features. Geodesic distance interpolation is then employed hierarchically in order to capture the complex surface. By this scheme, surface correspondence and triangulation are computed simultaneously. Experiments applied to human cerebral cortical surfaces are shown to evaluate the approach. It is shown that the proposed method performs well for both surface matching and surface shape recovery.

AB - The non-rigid registration of surfaces is a complex and difficult task for which there are many important applications, such as comparing shape between deformable objects and comparing associated function. This paper presents a new approach for brain surface matching by determining the correspondence of 3D point sets between pairs of surfaces. The algorithm is based on shape using a combination of geodesic distance and surface curvature. There are two major procedures involved. An initial sparse set of corresponding points is first generated by matching local geometrical features. Geodesic distance interpolation is then employed hierarchically in order to capture the complex surface. By this scheme, surface correspondence and triangulation are computed simultaneously. Experiments applied to human cerebral cortical surfaces are shown to evaluate the approach. It is shown that the proposed method performs well for both surface matching and surface shape recovery.

KW - Correspondence

KW - Corresponding points

KW - Geodesics

KW - Geometrical features

KW - Shape

KW - Shortest paths

KW - Surface matching

KW - Triangulation

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

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

U2 - 10.1016/S1077-3142(03)00015-8

DO - 10.1016/S1077-3142(03)00015-8

M3 - Article

AN - SCOPUS:0042529186

VL - 89

SP - 252

EP - 271

JO - Computer Vision and Image Understanding

JF - Computer Vision and Image Understanding

SN - 1077-3142

IS - 2-3

ER -