Conference paper
Counterexample to theorems of Cox and Fine
Joseph Y. Halpern
aaai 1996
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.
Joseph Y. Halpern
aaai 1996
Arthur Nádas
IEEE Transactions on Neural Networks
Ismail Akhalwaya, Shashanka Ubaru, et al.
ICLR 2024
Rangachari Anand, Kishan Mehrotra, et al.
IEEE Transactions on Neural Networks