Recognition of Shapes by Editing Shock Graphs编辑冲击图的形状识别.pptVIP

Recognition of Shapes by Editing Shock Graphs Outline Shock Graph Key ideas Partitioning the Shape Space Deformation Path Edit Distance Algorithm Results Shock Graph Medial axis: locus of centers of maximal circles that are bitangent to shape boundary. Shock Graph-- A variant of the medial axis-- With direction of flow-- Shock segment:  medial axis segment with monotonic flow;  a more refined partition of medial axis. Shock Graph Shock Transitions Key Ideas All shapes with the same shock graph topology are equivalent --- shape space partitioned All deformations with the same sequence of shock graph transitions are equivalent. The globally optimal transition sequence can be found in polynomial time. Partitioning the shape space Shape space is collection of all shapes.-- Shape is a point-- Shape deformation sequence is a path.-- Cost of optimal deformation sequence is distance from A to B. Partitioned based on the shock graph topology. Deformation Path Sequence of shock graph transitions. Shock graph transitions are formally classified and the complete list is known: Deformation Path A shape deformation bundle is the set of deformation paths passing through the same set of shape cells. --- Discretization. Deformation Path Avoid complexity-increasing deformation paths. Edit Distance Algorithm Apply the edit distance approach to find the optimal path among all possibilities. – polynomial time. Four Groups of Edit Operations Slice: deletes a shock branch and merges the remaining two. Contract: deletes a shock branch between degree-three nodes. Merge: combines two branches at a degree-two node. Deform: relates two shapes in the same shape cell. Assigning costs to edit operations Derive the cost of the deform edit:Sum over local shape differences – differences between matching shock segment attributes. Other edit costs are considered to be limiting cases of a deform cost. Deform cost between shock segments Length differences of t