Measuring Concavity on a Rectangular Mosaic

Authors:
J. Sklansky
Affiliations:
School of Engineering, University of California
Venue:
IEEE Transactions on Computers
Year:
1972

Citing 5
Cited 20

Connectivity in Digital Pictures

Journal of the ACM (JACM)
On Limit Properties in Digitization Schemes

Journal of the ACM (JACM)
A note on minimal length polygonal approximation to a digitized contour

Communications of the ACM
Experiments in the recognition of hand-printed text, part I: character recognition

AFIPS '68 (Fall, part II) Proceedings of the December 9-11, 1968, fall joint computer conference, part II
Minimum-Perimeter Polygons of Digitized Silhouettes

IEEE Transactions on Computers

Hierarchical representation of 2-D shapes using convex polygons: A morphological approach

Pattern Recognition Letters
Hierarchical representation of 2-D shapes using convex polygons: a contour-based approach

Pattern Recognition Letters
Approximate convex decomposition of polyhedra and its applications

Computer Aided Geometric Design
Parallel Detection of Concavities in Cellular Blobs

IEEE Transactions on Computers
Approximate convex decomposition of polygons

Computational Geometry: Theory and Applications
Image based visual servoing using bitangent points applied to planar shape alignment

RA '07 Proceedings of the 13th IASTED International Conference on Robotics and Applications
Short communication: VLSI systems for some problems of computational geometry

Parallel Computing
Construction of isothetic covers of a digital object: A combinatorial approach

Journal of Visual Communication and Image Representation
Robust lip segmentation method based on level set model

PCM'10 Proceedings of the 11th Pacific Rim conference on Advances in multimedia information processing: Part I
Recursive calculation of relative convex hulls

DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
Compressing 2-d shapes using concavity trees

ICIAR'05 Proceedings of the Second international conference on Image Analysis and Recognition
Finding the convex hull of a simple polygon

Pattern Recognition Letters
A counterexample to an algorithm for computing monotone hulls of simple polygons

Pattern Recognition Letters
A historical note on convex hull finding algorithms

Pattern Recognition Letters
On the application of the convex hull to histogram analysis in threshold selection

Pattern Recognition Letters
Qualitative Spatial Representation and Reasoning: An Overview

Fundamenta Informaticae - Qualitative Spatial Reasoning
From Binary to Grey Scale Convex Hulls

Fundamenta Informaticae
Recursive computation of minimum-length polygons

Computer Vision and Image Understanding
Optimal covering of a straight line applied to discrete convexity

DGCI'13 Proceedings of the 17th IAPR international conference on Discrete Geometry for Computer Imagery
Human action recognition using hull convexity defect features with multi-modality setups

Pattern Recognition Letters

Quantified Score

Hi-index	14.98

Visualization

Abstract

A theory for describing and measuring the concavities of cellular complexes (digitized silhouettes) is developed. This theory involves the use of the minimum-perimeter polygon and its convex hull.