Automatic counting of illuminated spheres in a random Boolean model

Artyom M. Grigoryan; Edward R. Dougherty

doi:10.1117/12.467979

Translator Disclaimer

22 May 2002 Automatic counting of illuminated spheres in a random Boolean model

Artyom M. Grigoryan, Edward R. Dougherty

Author Affiliations +

Proceedings Volume 4667, Image Processing: Algorithms and Systems; (2002) https://doi.org/10.1117/12.467979
Event: Electronic Imaging, 2002, San Jose, California, United States

Abstract

This paper presents results of the automatic counting of illuminated spheres, where the random Boolean model depends on certain distributions of parameters. The problem is to estimate the number of randomly sized spheres in a region of 3D space by taking a set of parallel slices and using the slice intersections with the spheres to form the estimate. The simulation software is developed in the framework of the MATLAB-based Graphical User Interface, which generates spheres and allows visualization of spheres as well as their 2 D projections onto slices, which themselves appear as ordinary images. The dynamic interface provides manipulation of all parameters of the model, including the sampling rate (number of slices), sphere-size, location and intensity distributions, overlapping of spheres, and parameters of noise. That allows us to analyze the illuminated sphere counting along different ranges of various model parameters with respect to the sampling rate, specially for cases when random spheres may intersect and noise may exist.

Citation Download Citation

Artyom M. Grigoryan and Edward R. Dougherty "Automatic counting of illuminated spheres in a random Boolean model", Proc. SPIE 4667, Image Processing: Algorithms and Systems, (22 May 2002); https://doi.org/10.1117/12.467979

ACCESS THE FULL ARTICLE