
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
D. Keren, D. Cooper, J. Subrahmonia, "Describing Complicated Objects by Implicit Polynomials," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 16, no. 1, pp. 3853, January, 1994.  
BibTex  x  
@article{ 10.1109/34.273718, author = {D. Keren and D. Cooper and J. Subrahmonia}, title = {Describing Complicated Objects by Implicit Polynomials}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {16}, number = {1}, issn = {01628828}, year = {1994}, pages = {3853}, doi = {http://doi.ieeecomputersociety.org/10.1109/34.273718}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Pattern Analysis and Machine Intelligence TI  Describing Complicated Objects by Implicit Polynomials IS  1 SN  01628828 SP38 EP53 EPD  3853 A1  D. Keren, A1  D. Cooper, A1  J. Subrahmonia, PY  1994 KW  polynomials; computer vision; image segmentation; image processing; curve fitting; complicated objects; implicit polynomials; representation power; closed implicit polynomials; 2D images; surfaces; 3D range data; super quadrics; object boundaries; noisy data; vision VL  16 JA  IEEE Transactions on Pattern Analysis and Machine Intelligence ER   
This paper introduces and focuses on two problems. First is the representation power of closed implicit polynomials of modest degree for curves in 2D images and surfaces in 3D range data. Super quadrics are a small subset of object boundaries that are well fitted by these polynomials. The second problem is the stable computationally efficient fitting of noisy data by closed implicit polynomial curves and surfaces. The attractive features of these polynomials for Vision is discussed.
[1] S. S. Abhyankar,Algebraic Geometry for Scientists and Engineers. Providence, RI: American Mathematical Society, 1990.
[2] A. Albert,Regression and The MoorePenrose Pseudoinverse. New York: Academic, 1972.
[3] R. Bajcsy and F. Solina, "Threedimensional object representation revisited," inProc. Int. Conf. Computer Vision, London, May 1987, pp. 231240.
[4] R. M. Bolle and D. B. Cooper, "Bayesian recognition of local 3D shape by approximating image intensity functions with quadric polynomials,"IEEE Trans. Pattern Analy. Mach. Intell., vol. PAMI6, July 1984.
[5] R. M. Belle and B. C. Vemuri, "Three dimensional surface reconstruction methods,"IEEE Trans. Pattern Anal. Mach. Intell., vol. 13, pp. 114, Jan. 1991.
[6] F. L. Bookstein, "Fitting conic sections to scattered data,"Computer Vision, Graphics, and Image Processing, vol. 9, pp. 5671, 1979.
[7] T. E. Boult and A. D. Gross, "On therecovery of superellipsoids," inProc. DARPA Image Understanding Workshop, 1988, pp. 10521063.
[8] B. CernuschiFrias, "Orientation and location parameter estimation of quadric surfaces in 3D from a sequence of images," Ph.D. dissertation, Brown Univ., Providence, RI, 1984.
[9] D. B. Cooper and N. Yalabik, "On the computational cost of approximating and recognizing noiseperturbed straight lines and quadratic arcs in the plane,"IEEE Trans. Comput., vol. C25, no. 10, pp. 10201032, Oct. 1976.
[10] O. D. Faugeras and M. Hebert, "Segmentation of range data into planar and quadric patches," inProc. CVPR, 1983.
[11] D. Forsythet al., "Invariant descriptors for 3D object recognition and pose,"IEEE Trans. Pattern Anal. Mach. Intell., vol. 13, pp. 971992, Oct. 1991.
[12] D. A. Forsyth, J. L. Mundy, A. Zisserman, and C. M. Brown, "Projectively invariant representations using implicit algebraic curves," inProc. European Conf. Computer Vision, June 1990.
[13] A. D. Gross and T. E. Boult, "Error of fit measures for recovering parametric solids," inProc. 2nd Int. Conf. Comput. vision, Dec. 1988, pp. 690694.
[14] D. J. Kriegman and J. Ponce, "On recognizing and positioning curved 3D objects from image contours,"IEEE Trans. Pattern Anal. Mach. Intell., vol. 12, pp. 11271138, Dec. 1990.
[15] O. D. Faugeras, M. Hebert, and E. Pauchon, "Segmentation of range data into planar and quadratic patches, " inProc. IEEE Conf. Computer Vision and Pattern Recognition, Washington, DC, June 1983, pp. 813.
[16] V. Pratt, "Direct least squares fitting of algebraic surfaces,Comput. Graphics, vol. 21, no. 4, pp. 145152, July 1987.
[17] W. H. Press, B. P. Flannery, S. A. Teukolsky and W. T. Vetterling,Numerical Receipes. Cambridge, England: Cambridge University Press, 1986.
[18] P. D. Sampson, "Fitting conic sections to very scattered data: An iterative improvement of the bookstein algorithm,"Computer Vision, Graphics, Image Processing, vol. 18, pp. 97108, 1982.
[19] J. Subrahmonia, D. Cooper, and D. Keren, "Reliable object recognition using high dimensional implicit polynomials for 2D curves and 3D surfaces," Brown Univ., Providence, RI, Tech. Rep. LEMS94, 1991.
[20] G. Taubin, "Estimation of planar curves, surfaces and nonplanar space curves defined by implicit equations, with applications to edge and range image segmentation," Brown Univ., Providence, RI, Tech, Rep. LEMS 66, Jan. 1990; also inIEEE Trans. Pattern Analy. Mach. Intell., vol. 13, pp. 11151138, Nov. 1991.
[21] G. Taubin and D. B. Cooper, "2D and 3D object recognition and positioning system based on moment invariants," inProc. DARPAESPIRIT Workshop Geometric Invariants, Rikjavik, Iceland, May 1991.
[22] G. Taubin, F. Cukierman, S. Sullivan, J. Ponce, and D. J. Kriegman, "Parameterizing and fitting bounded algebraic curves and surfaces," inProc. CVPR, 1992, pp. 103109.
[23] G. Taubin, "Recognition and positioning of rigid objects using algebraic and moment invariants," Ph.D. dissertation, Brown Univ., Providence, RI, 1990.
[24] P. Whaite and F. P. Ferrie, "From unncertainty to visual exploration,"IEEE Trans. Pattern Anal. Mach. Intell., vol. 13, pp. 10381049, 1991.