A Model-Based Active Landmarks Tracking Method
スポンサーリンク
概要
- 論文の詳細を見る
Unlike the time-consuming contour tracking method of snakes [5] which requires a considerable number of iterated computations before contours are successfully tracked down, we present a faster and accurate model-based "landmarks" tracking method where a single iteration of the dynamic programming is sufficient to obtain a local minimum to an integral measure of the elastic and the image energy functionals. The key lies in choosing a relatively small number of salient "land-marks", or features of objects, rather than their contours as a target of tracking within the image structure. The landmarks comprising singular points along the model contours are tracked down within the image structure all inside restricted search areas of 41x41 pixels whose respective locations in image structure are dictated by their locations in the model. A Manhattan distance and a template corner detection function of Singh and Shneier [7] are used as elastic energy and image energy respectively in the algorithm. A first approximation to the image contour is obtained in our method by applying the thin-plate spline transformation of Bookstein [2] using these landmarks as fixed points of the transformation which is capable of preserving a global shape information of the model including the relative configuration of landmarks and consequently surrounding contours of the model in the image structure. The actual image contours are further tracked down by applying an active edge tracked using now simplified line search segments so that individual differences persisting between the mapped model contour are substantially eliminated. We have applied our method tentatively to portraits of a class album to demonstrate the effectiveness of the method. Our experiments convincingly show that using only about 11 feature points our method provides not only a much improved computational complexity requiring only 0.94sec. in CPU time by SGI's indigo 2 but also more accurate shape representations than those obtained by the snakes methods. The method is powerful in a problem domain where the model-based approach is applicable, possibly allowing real time processing because a most time consuming algorithm of corner template evaluation can be easily implemented by parallel processing firmware.
- 社団法人電子情報通信学会の論文
- 1996-10-25
著者
-
TOKUDA Naoyuki
SunFlare Research and Development Center
-
Tokuda N
Sunflare Research And Development Center
-
Tokuda Naoyuki
Computer Science Department Utsunomiya University Utsunomiya Japan
-
Tokuda Naoyuki
Faculty Of General Education Utsunomiya University
-
MIYAMICHI Juichi
Computer Science Department, Faculty of Engineering, Utsunomiya University
-
YAN Ronghua
Computer Science Department, Faculty of Engineering, Utsunomiya University
-
Miyamichi J
Faculty Of Engineering Utsunomiya University
-
Yan Ronghua
Computer Science Department Faculty Of Engineering Utsunomiya Univesity
関連論文
- Instantaneously Reversible Golomb-Rice Codes for Robust Image Coding
- Compound Image Compression Using Adaptive Wavelet Transform
- A Shrinking Method for Dithered Images
- Capacity analysis for a two-level decoupled Hamming network for associative memory under a noisy environment
- Probabilistic Information Retrieval Method Based on Differential Latent Semantic Index Space
- A Constructive Compound Neural Networks. II Application to Artificial Life in a Competitive Environment
- A New Constructive Compound Neural Networks Using Fuzzy Logic and Genetic Algorithm 1 Application to Artificial Life
- A Model-Based Active Landmarks Tracking Method
- Image Morphing by Spatial Thin-Plate Spline Transformation
- A Finite-Difference Solution of a Crystal Growth Stefan Problem
- Stokes Solutions for Flow Near Corners in Three-Dimensions
- A Syntactical Approach to Diagnosing Multiple Bugs in an Intelligent Tutoring System
- A Convection Stefan Problem by Lagrange-Burmann Expansions.I.Small Time Solution