This Article 
 Bibliographic References 
 Add to: 
Bayesian Clustering for Unsupervised Estimation of Surface and Texture Models
July 1988 (vol. 10 no. 4)
pp. 482-495

A method of calculating the maximum-likelihood clustering for the unsupervised estimation of polynomial models for the data in images of smooth surfaces or for range data for such surfaces is presented. An image or a depth map of a region of smooth 3-D surface is modeled as a polynomial plus white noise. A region of physically meaningful textured-image such as the image of foliage, grass, or road in outdoor scenes or conductor or lintburn on a thick-film substrate is modeled as a colored Gaussian-Markov random field (MRF) with a polynomial mean-value function. Unsupervised-model parameter-estimation is accomplished by determining the segmentation and model parameter values that maximize the likelihood of the data or a more general Bayesian performance functional. Agglomerative clustering is used for this purpose.

[1] J. Besag, "Spatial interaction and the statistical analysis of lattice systems,"J. Roy. Statist. Soc., ser. B, vol. 36, pp. 192-236, 1974.
[2] R. M. Bolle and D. B. Cooper, "Bayesian recognition by approximating image intensity functions with quadric polynomials,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-6, pp. 418-429, July 1984.
[3] R. M. Bolle and D.B. Cooper, "On optimally combining pieces of information, with application to estimating 3-D complex-object position from range data,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-8, pp. 619-638, Sept. 1986.
[4] B. Cernuschi-Frias, P. N. Belhumeur, and D. B. Cooper, "Estimating and recognizing parameterized 3-D objects using a moving camera," inProc. IEEE Conf. Comput. Vision Pattern Recognition, San Francisco, CA, June 1985, pp. 167-171.
[5] P. C. Chen and T. Pavlidis, "Image segmentation as an estimation problem,"Comput. Graphics Image Processing, vol. 12, pp. 153- 172, 1980.
[6] F. S. Cohen, D. B. Cooper, J. F. Silverman, and E. B. Hinkle, "Simple parallel hierarchical and relaxation algorithms for segmenting textured images based on noncausal Markovian random field models," inProc. IEEE 7th Int. Conf. Pattern Recognition, Montreal, Canada, July 1984, pp. 1104-1107.
[7] F. S. Cohen and D. B. Cooper, "Simple parallel hierarchical and relaxation algorithms for segmenting noncausal Markovian fields,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-9, pp. 195-219, March 1987.
[8] F. S. Cohen and Z. Fan, "Unsupervised textured image segmentation," under review for journal publication; also, Dep. Elec. Eng., Univ. Rhode Island, Kingston, Tech. Rep., June 1986.
[9] D. B. Cooper and F. Sung, "Multiple-window parallel adaptive boundary finding in computer vision,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-5, pp. 299-316, May 1983.
[10] M. H. DeGroot,Optimal Statistical Decisions. New York: Mc-Graw-Hill, 1970, ch. 10.
[11] H. Derin and H. Elliott, "Modeling and segmentation of noisy and textured images using Gibbs random fields,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-9, pp. 39-55, Jan. 1987.
[12] E. Diday and J. C. Simon, "Clustering analysis," inCommunication and Cybernetics 10 Digital Pattern Recognition, K. S. Fu, Ed. Berlin: Springer-Verlag, 1980, pp. 47-94.
[13] R. O. Duda and P. E. Hart,Pattern Classification and Scene Analysis. New York: Wiley, 1973, pp. 328-331.
[14] A. Gagalowicz, "Hierarchical segmentation algorithm," inProc. SPIE Conf. Comput. Vision for Robots, Cannes, France, Dec. 1985, pp. 56-65.
[15] B. Gidas, "A renormalization group approach to image processing problems," Div. Math., Brown Univ., Providence, RI, Rep.
[16] A. R. Hanson and E. M. Riseman, "Segmentation of natural scenes," inComputer Vision Systems, A. R. Hanson and E. M. Riseman, Eds. New York: Academic, 1978, pp. 129-164.
[17] J. F. Silverman, "Smooth surface parameter estimation and image segmentation using linear and quadric polynomial approximations for applications in robot vision," M.S. project, Brown Univ., Providence, RI, May 1985.
[18] J. F. Silverman and D. B. Cooper, "Unsupervised estimation of polynomial approximations to smooth surfaces in images or range data," inProc. 1986 IEEE Int. Conf. Robotics Automation, San Francisco, CA, Apr. 1986, pp. 299-304.
[19] C. W. Therrien, "An estimation-theoretic approach to terrain image segmentation,"Comput. Vision, Graphics, Image Processing, vol. 22, pp. 313-326, 1983.
[20] S. S. Wilks,Mathematical Statistics. New York: Wiley, 1962, pp. 419-422.

Index Terms:
surface models; agglomerative clustering; computerised picture processing; computerised pattern recognition; unsupervised parameter estimation; Bayesian clustering; texture models; maximum-likelihood clustering; polynomial models; depth map; Gaussian-Markov random field; segmentation; Bayes methods; computerised pattern recognition; computerised picture processing; Markov processes; polynomials
J.F. Silverman, D.B. Cooper, "Bayesian Clustering for Unsupervised Estimation of Surface and Texture Models," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 10, no. 4, pp. 482-495, July 1988, doi:10.1109/34.3912
Usage of this product signifies your acceptance of the Terms of Use.