Using Dynamic Programming to Segment Planar Star Shape Based on Human Perception and Optimization Formulation
Date Issued
2006
Date
2006
Author(s)
Kao, Hai-Feng
DOI
en-US
Abstract
There are many objects which are composed of several primitive parts. It’s always beneficial to find the inherent structure of objects when dealing with the recognition, searching or indexing issues of the objects. This thesis aims to recover the intuitive and natural parts from the 2D shapes of objects. This thesis is different from the previous approaches via characterizing the traditional shape decomposition problem as an optimization problem. Building on the foundation of visual salience, our work shows that, the optimal solution of shape decomposition can be solved efficiently by dynamic programming when a set of pre-defined constraints is satisfied.
Subjects
形狀分割
形狀分解
動態規劃
物件檢索
shape segmentation
shape decomposition
dynamic programming
object retrieval
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-95-R93922043-1.pdf
Size
23.31 KB
Format
Adobe PDF
Checksum
(MD5):49b1fa35f81f4862801dd756596a5851