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

Authors:
Godfried T Toussaint
Affiliations:
School of Computer Science, McGill University, Montreal, Quebec, Canada H3A 2K6
Venue:
Pattern Recognition Letters
Year:
1983

Citing 3
Cited 0

Measuring Concavity on a Rectangular Mosaic

IEEE Transactions on Computers
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

Quantified Score

Hi-index	0.10

Visualization

Abstract

A recently proposed algorithm for computing the convex hull of a grey-level histogram in image segmentation is shown to be inefficient due to the fact that it does not exploit the histogram's structure. It is pointed out that a histogram is a weakly externally visible polygon and thus a very simple linear convex hull algorithm will work for such applications.