Detecting and tracking the left and right heart ventricles via dynamic programming

Davi Geiger, Alok Gupta

Research output: Contribution to journalConference article

Abstract

Computation of ventricular volume and the diagnostic quantities like ejection-fraction ratio, heart output, mass, etc. requires detection of myocardial boundaries. The problem of segmenting an image into separate regions is one of the most significant problems in vision. Terzopoulos et al., have proposed an approach to detect the contour regions of complex shapes, assuming a user selected an initial contour not very far from the desired solution. We propose an optimal dynamic programming (DP) based method to detect contours. It is exact and not iterative. We first consider a list of uncertainty for each point selected by the user, wherein the point is allowed to move. Then, a search window is created from two consecutive lists. We then apply a dynamic programming (DP) algorithm to obtain the optinmi contour passing through these lists of uncertainty, optimally utilizing the given information. For tracking, the final contour obtained at one frame is sampled and used as initial points for the next frame. Then, the same DP process is applied. We have demonstrated the algorithms on natural objects in a large spectrum of applications, including interactive segmentation of the regions of interest in medical images.

Original languageEnglish (US)
Pages (from-to)391-402
Number of pages12
JournalProceedings of SPIE - The International Society for Optical Engineering
Volume2167
DOIs
StatePublished - May 11 1994
EventMedical Imaging 1994: Image Processing - Newport Beach, United States
Duration: Feb 13 1994Feb 18 1994

Fingerprint

dynamic programming
Dynamic programming
Dynamic Programming
lists
Uncertainty
Medical Image
Region of Interest
ejection
Consecutive
Diagnostics
Segmentation
Heart
output
Output

ASJC Scopus subject areas

  • Electronic, Optical and Magnetic Materials
  • Condensed Matter Physics
  • Computer Science Applications
  • Applied Mathematics
  • Electrical and Electronic Engineering

Cite this

Detecting and tracking the left and right heart ventricles via dynamic programming. / Geiger, Davi; Gupta, Alok.

In: Proceedings of SPIE - The International Society for Optical Engineering, Vol. 2167, 11.05.1994, p. 391-402.

Research output: Contribution to journalConference article

@article{82ca985f59884ab99fabee0f12355c31,
title = "Detecting and tracking the left and right heart ventricles via dynamic programming",
abstract = "Computation of ventricular volume and the diagnostic quantities like ejection-fraction ratio, heart output, mass, etc. requires detection of myocardial boundaries. The problem of segmenting an image into separate regions is one of the most significant problems in vision. Terzopoulos et al., have proposed an approach to detect the contour regions of complex shapes, assuming a user selected an initial contour not very far from the desired solution. We propose an optimal dynamic programming (DP) based method to detect contours. It is exact and not iterative. We first consider a list of uncertainty for each point selected by the user, wherein the point is allowed to move. Then, a search window is created from two consecutive lists. We then apply a dynamic programming (DP) algorithm to obtain the optinmi contour passing through these lists of uncertainty, optimally utilizing the given information. For tracking, the final contour obtained at one frame is sampled and used as initial points for the next frame. Then, the same DP process is applied. We have demonstrated the algorithms on natural objects in a large spectrum of applications, including interactive segmentation of the regions of interest in medical images.",
author = "Davi Geiger and Alok Gupta",
year = "1994",
month = "5",
day = "11",
doi = "10.1117/12.175072",
language = "English (US)",
volume = "2167",
pages = "391--402",
journal = "Proceedings of SPIE - The International Society for Optical Engineering",
issn = "0277-786X",
publisher = "SPIE",

}

TY - JOUR

T1 - Detecting and tracking the left and right heart ventricles via dynamic programming

AU - Geiger, Davi

AU - Gupta, Alok

PY - 1994/5/11

Y1 - 1994/5/11

N2 - Computation of ventricular volume and the diagnostic quantities like ejection-fraction ratio, heart output, mass, etc. requires detection of myocardial boundaries. The problem of segmenting an image into separate regions is one of the most significant problems in vision. Terzopoulos et al., have proposed an approach to detect the contour regions of complex shapes, assuming a user selected an initial contour not very far from the desired solution. We propose an optimal dynamic programming (DP) based method to detect contours. It is exact and not iterative. We first consider a list of uncertainty for each point selected by the user, wherein the point is allowed to move. Then, a search window is created from two consecutive lists. We then apply a dynamic programming (DP) algorithm to obtain the optinmi contour passing through these lists of uncertainty, optimally utilizing the given information. For tracking, the final contour obtained at one frame is sampled and used as initial points for the next frame. Then, the same DP process is applied. We have demonstrated the algorithms on natural objects in a large spectrum of applications, including interactive segmentation of the regions of interest in medical images.

AB - Computation of ventricular volume and the diagnostic quantities like ejection-fraction ratio, heart output, mass, etc. requires detection of myocardial boundaries. The problem of segmenting an image into separate regions is one of the most significant problems in vision. Terzopoulos et al., have proposed an approach to detect the contour regions of complex shapes, assuming a user selected an initial contour not very far from the desired solution. We propose an optimal dynamic programming (DP) based method to detect contours. It is exact and not iterative. We first consider a list of uncertainty for each point selected by the user, wherein the point is allowed to move. Then, a search window is created from two consecutive lists. We then apply a dynamic programming (DP) algorithm to obtain the optinmi contour passing through these lists of uncertainty, optimally utilizing the given information. For tracking, the final contour obtained at one frame is sampled and used as initial points for the next frame. Then, the same DP process is applied. We have demonstrated the algorithms on natural objects in a large spectrum of applications, including interactive segmentation of the regions of interest in medical images.

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

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

U2 - 10.1117/12.175072

DO - 10.1117/12.175072

M3 - Conference article

AN - SCOPUS:33747962083

VL - 2167

SP - 391

EP - 402

JO - Proceedings of SPIE - The International Society for Optical Engineering

JF - Proceedings of SPIE - The International Society for Optical Engineering

SN - 0277-786X

ER -