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.
Original language | English (US) |
---|---|
Pages (from-to) | 75-77 |
Number of pages | 3 |
Journal | Pattern Recognition Letters |
Volume | 2 |
Issue number | 2 |
DOIs | |
State | Published - Dec 1983 |
Keywords
- Convex hull
- grey-level histogram
ASJC Scopus subject areas
- Software
- Signal Processing
- Computer Vision and Pattern Recognition
- Artificial Intelligence