Seung Gu Kang, Jeff Weber, et al.
ACS Fall 2023
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.
Seung Gu Kang, Jeff Weber, et al.
ACS Fall 2023
Conrad Albrecht, Jannik Schneider, et al.
CVPR 2025
Guojing Cong, David A. Bader
Journal of Parallel and Distributed Computing
Jihun Yun, Peng Zheng, et al.
ICML 2019