A coarse‐to‐fine shape decomposition based on critical points

No abstract is available for this paper.

• Publication year

  2017

• Venue

  Concurrency and Computation

• Publication date

  2017-09-10

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1002/cpe.4088
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Approximate convex decomposition for 2D shapes based on visibility range

  2016cited by this paper
• Efficient Globally Optimal 2D-to-3D Deformable Shape Matching

  2016cited by this paper
• Shape decomposition and classification by searching optimal part pruning sequence

  2016cited by this paper
• The Indexing based on Multiple Visual Dictionaries for Object Based Image Retrieval

  2015cited by this paper
• Dual-Space Decomposition of 2D Complex Shapes

  2014cited by this paper
• A Computational Model of the Short-Cut Rule for 2D Shape Decomposition

  2014influential reference
• Perceptually friendly shape decomposition by resolving segmentation points with minimum cost

  2013cited by this paper
• Fast approximate convex decomposition using relative concavity

  2013cited by this paper
• A Method of Perceptual-Based Shape Decomposition

  2013cited by this paper
• a-Decomposition of polygons $

  2012cited by this paper
• Object-based image retrieval with kernel on adjacency matrix and local combined features

  2012cited by this paper
• Bone graphs: Medial shape parsing and abstraction

  2011cited by this paper
• Convex shape decomposition

  2010cited by this paper
• An effective solution for trademark image retrieval by combining shape description and feature matching

  2010cited by this paper
• 2D Shape Decomposition Based on Combined Skeleton-Boundary Features

  2008cited by this paper
• Separating Parts from 2D Shapes using Relatability

  2007cited by this paper
• Approximate convex decomposition of polygons

  2004cited by this paper
• Shape partitioning by convexity

  2000cited by this paper
• Shape descriptors for non-rigid shapes with a single closed contour

  2000cited by this paper
• Parsing silhouettes: The short-cut rule

  1999cited by this paper
• Ligature instabilities in the perceptual organization of shape

  1999cited by this paper
• Perceptual sensitivity maps within globally defined visual shapes

  1994cited by this paper
• Hierarchical decomposition and axial shape description

  1992cited by this paper
• Recognition-by-components: a theory of human image understanding.

  1987cited by this paper
• Parts of recognition

  1984cited by this paper
• Shape description using weighted symmetric axis features

  1978cited by this paper
• Ieee Transactions on Pattern Analysis and Machine Intelligence 1 Minimum Near-convex Shape Decomposition

  year unknowncited by this paper

• Linear building pattern recognition in topographical maps combining convex polygon decomposition

  2022cites this paper
• Foreword to the special issue on parallel and distributed computing with its applications

  2017cites this paper