Name
Abstract | ||
|---|---|---|
Presents a new automatic circular decomposition algorithm, which proceeds the separation of connected circular particles, in order to locate their center coordinates and estimate their radii. This new algorithm is based on the following supposition "if you are looking for circles you must assume that all objects in an image are circles, until you can prove they are not". In this work the authors compare this heuristic algorithm with the polygonal approximation based algorithm proposed by Kubo (1988) in their methods and results. Both of them are able to decompose connected blood cells with some differences: the proposed algorithm is implemented in 2 steps, while the polygonal approximation based method is divided in 4 steps and its input parameters present high sensitivity to noise. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1109/BIBE.2000.889618 | BIBE |
Keywords | Field | DocType |
biological techniques,blood,cellular biophysics,image processing,automatic circular decomposition algorithm,blood cells image,connected circular particles separation,heuristic algorithm,input parameters,noise sensitivity,polygonal approximation based algorithm,polygonal approximation based method | Cellular biophysics,Polygon,Noise sensitivity,Computer science,Heuristic (computer science),Algorithm,Image processing,Radius | Conference |
ISBN | Citations | PageRank |
0-7695-0862-6 | 2 | 0.42 |
References | Authors | |
3 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| L. V. Guimaraes | 1 | 2 | 0.42 |
| A. A. Suzim | 2 | 2 | 1.10 |
| J. Maeda | 3 | 290 | 21.43 |