Abstract
We describe a novel algorithm for the detection of clusters of points embedded in background noise in the plane. The algorithm is based on the percolation phenomena found in random graphs obtained from a planar Poisson process. We estimate the time complexity of the algorithm and its expected performance.
Original language | English (US) |
---|---|
Pages (from-to) | 199-202 |
Number of pages | 4 |
Journal | Pattern Recognition Letters |
Volume | 12 |
Issue number | 4 |
DOIs | |
State | Published - Jan 1 1991 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Computer Vision and Pattern Recognition
- Signal Processing
- Electrical and Electronic Engineering