Title :
Using implicit polynomials for image compression
Author :
Helzer, Amir ; Barzohar, Meir ; Malah, David
Abstract :
Implicit polynomials (IF) are being used to represent 2D curves and 3D surfaces. The zero-set of a 2D implicit polynomial of the form of p(x,y)=a1xN+a2xN-1y+...+ a r=0 can be used to describe data points making up a 2D curve. A similar 3D polynomial-p(x,y,z)=0 describes data points on a 3D surface. We describe a way to restrict the zero-set of the fitted polynomial so that correct restoration of the data from the polynomial´s coefficients will be achieved
Keywords :
data compression; image coding; image representation; image restoration; least squares approximations; polynomials; 2D curves representation; 2D implicit polynomial; 3D polynomial; 3D surfaces representation; constrained least squares solution; data points; data restoration; image compression; implicit polynomials; polynomial coefficients; zero-set; Computer vision; Image coding; Image processing; Image restoration; Object recognition; Polynomials; Quantization; Rate distortion theory; Robustness; Shape;
Conference_Titel :
Electrical and electronic engineers in israel, 2000. the 21st ieee convention of the
Conference_Location :
Tel-Aviv
Print_ISBN :
0-7803-5842-2
DOI :
10.1109/EEEI.2000.924441