A Clustering Heuristic for Line-Drawing Analysis

Authors:
Azriel Rosenfeld;Yung H. Lee
Affiliations:
Computer Science Center, University of Maryland, College Park, Md. 20742.;Computer Science Center, University of Maryland, College Park, Md. 20742.
Venue:
IEEE Transactions on Computers
Year:
1972

Citing 5
Cited 1

An Analysis of Some Graph Theoretical Cluster Techniques

Journal of the ACM (JACM)
Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters

IEEE Transactions on Computers
Edge and Curve Detection for Visual Scene Analysis

IEEE Transactions on Computers
Decomposition of a visual scene into three-dimensional bodies

AFIPS '68 (Fall, part I) Proceedings of the December 9-11, 1968, fall joint computer conference, part I
Computer perception of complex patterns

IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence

Isolating and identifying objects in line drawings

IJCAI'75 Proceedings of the 4th international joint conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	14.98

Visualization

Abstract

Certain arrangements of local features in a scene tend to group together and to be seen as units. It is suggested that, in some instances, this phenomenon might be interpretable as a process of cluster detection in a graph-structured space derived from the scene. This idea is illustrated using a class of line-drawing ``scenes'' that contain only horizontal and vertical line segments.