Ken C.L. Wong, Satyananda Kashyap, et al.
Pattern Recognition Letters
This paper introduces and focuses on two problems. First is the representation power of closed implicit polynomials of modest degree for curves in 2-D images and surfaces in 3-D 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. © 1994, IEEE.
Ken C.L. Wong, Satyananda Kashyap, et al.
Pattern Recognition Letters
Amy Lin, Sujit Roy, et al.
AGU 2024
Victor Akinwande, Megan Macgregor, et al.
IJCAI 2024
Harsha Kokel, Aamod Khatiwada, et al.
VLDB 2025