This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Image Approximation by Variable Knot Bicubic Splines
March 1981 (vol. 3 no. 3)
pp. 299-310
Dennis G. Mccaughey, MEMBER, IEEE, Department of Systems Engineering, University of Arizona, Tucson, AZ; The Analytic Sciences Corporation, McLean, VA 22102.
Harry C. Andrews, SENIOR MEMBER, IEEE, Image Processing Institute, Departments of Electrical Engineering and Computer Science, University of Southern California, Los Angeles, CA; Comtal Corporation,
This paper presents a degree of freedom or information content analysis of images in the context of digital image processing. As such it represents an attempt to quantify the number of truly independent samples one gathers with imaging devices. The degrees of freedom of a sampled image itself are developed as an approximation problem. Here, bicubic splines with variable knots are employed in an attempt to answer the question as to what extent images are finitely representable in the context of digital sensors and computers. Relatively simple algorithms for good knot placement are given and result in spline approximations that achieve significant parameter reductions at acceptable error levels. The knots themselves are shown to be useful as an indicator of image activity and have potential as an image segmentation device, as well as easy implementation in CCD signal processing and focal plane smart sensor arrays. Both mathematical and experimental results are presented.
Citation:
Dennis G. Mccaughey, Harry C. Andrews, "Image Approximation by Variable Knot Bicubic Splines," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 3, no. 3, pp. 299-310, March 1981, doi:10.1109/TPAMI.1981.4767103
Usage of this product signifies your acceptance of the Terms of Use.