Straightening and Partitioning Shapes

Authors:
Paul L. Rosin
Affiliations:
-
Venue:
IWVF-4 Proceedings of the 4th International Workshop on Visual Form
Year:
2001

Citing 8
Cited 0

Distance transformations in digital images

Computer Vision, Graphics, and Image Processing
Color indexing

International Journal of Computer Vision
Parts of Visual Form: Computational Aspects

IEEE Transactions on Pattern Analysis and Machine Intelligence
Wavelets for computer graphics: theory and applications

Wavelets for computer graphics: theory and applications
A fast parallel algorithm for thinning digital patterns

Communications of the ACM
Query by Image and Video Content: The QBIC System

Computer
Permanence-Based Shape Decomposition in Binary Pyramids

ICIAP '99 Proceedings of the 10th International Conference on Image Analysis and Processing
Shape partitioning by convexity

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

Quantified Score

Hi-index	0.00

Visualization

Abstract

A method for partitioning shapes is described based on a global convexity measure. Its advantages are that its global nature makes it robust to noise, and apart from the number of partitioning cuts no parameters are required. In order to ensure that the method operates correctly on bent or undulating shapes a process is developed that identifies the underlying bending and removes it, straightening out the shape. Results are shown on a large range of shapes.