Optimal radial contour tracking by dynamic programming

Y. Chen, Thomas S Huang, R. Rui

Research output: Contribution to conferencePaperpeer-review

Abstract

A common problem in most active contour methods is that the recursive searching scheme can only return a local optimal solution. Furthermore, the internal energy of the snake is not strong enough to control the shape of the contour. To overcome these difficulties, in this paper, we develop a causal internal energy term based on a radial contour representation to encode the smooth constraint of the contour, and develop a global shape priori to control contour's shape and develop a global shape priori to control contour's shape and position based on object's dynamics. The causality nature of the representation allows us to efficiently find global optimal solution using dynamic programming. To validate the efficacy and robustness of the proposed approach, we apply this approach to track people in bad illumination and cluttered environments. We report promising results in the paper.

Original languageEnglish (US)
Pages626-629
Number of pages4
StatePublished - 2001
EventIEEE International Conference on Image Processing (ICIP) 2001 - Thessaloniki, Greece
Duration: Oct 7 2001Oct 10 2001

Other

OtherIEEE International Conference on Image Processing (ICIP) 2001
Country/TerritoryGreece
CityThessaloniki
Period10/7/0110/10/01

ASJC Scopus subject areas

  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Optimal radial contour tracking by dynamic programming'. Together they form a unique fingerprint.

Cite this