scispace - formally typeset
Search or ask a question
Topic

Stairstep interpolation

About: Stairstep interpolation is a research topic. Over the lifetime, 3987 publications have been published within this topic receiving 76797 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: It can be shown that the order of accuracy of the cubic convolution method is between that of linear interpolation and that of cubic splines.
Abstract: Cubic convolution interpolation is a new technique for resampling discrete data. It has a number of desirable features which make it useful for image processing. The technique can be performed efficiently on a digital computer. The cubic convolution interpolation function converges uniformly to the function being interpolated as the sampling increment approaches zero. With the appropriate boundary conditions and constraints on the interpolation kernel, it can be shown that the order of accuracy of the cubic convolution method is between that of linear interpolation and that of cubic splines. A one-dimensional interpolation function is derived in this paper. A separable extension of this algorithm to two dimensions is applied to image data.

3,280 citations

Book
01 Jan 1972
TL;DR: In this paper, a monograph describes and analyzes some practical methods for finding approximate zeros and minima of functions, and some of these methods can be used to find approximate minima as well.
Abstract: This monograph describes and analyzes some practical methods for finding approximate zeros and minima of functions.

2,477 citations

Journal ArticleDOI
TL;DR: Simulation results demonstrate that the new interpolation algorithm substantially improves the subjective quality of the interpolated images over conventional linear interpolation.
Abstract: This paper proposes an edge-directed interpolation algorithm for natural images. The basic idea is to first estimate local covariance coefficients from a low-resolution image and then use these covariance estimates to adapt the interpolation at a higher resolution based on the geometric duality between the low-resolution covariance and the high-resolution covariance. The edge-directed property of covariance-based adaptation attributes to its capability of tuning the interpolation coefficients to match an arbitrarily oriented step edge. A hybrid approach of switching between bilinear interpolation and covariance-based adaptive interpolation is proposed to reduce the overall computational complexity. Two important applications of the new interpolation algorithm are studied: resolution enhancement of grayscale images and reconstruction of color images from CCD samples. Simulation results demonstrate that our new interpolation algorithm substantially improves the subjective quality of the interpolated images over conventional linear interpolation.

1,933 citations

Book ChapterDOI
Charles A. Micchelli1
TL;DR: In this paper, it was shown that multiquadric surface interpolation is always solvable, thereby settling a conjecture of R Franke, which is a conjecture that was later proved in the present paper.
Abstract: Among other things, we prove that multiquadric surface interpolation is always solvable, thereby settling a conjecture of R Franke

1,476 citations


Network Information
Related Topics (5)
Image segmentation
79.6K papers, 1.8M citations
82% related
Feature extraction
111.8K papers, 2.1M citations
81% related
Feature (computer vision)
128.2K papers, 1.7M citations
80% related
Image processing
229.9K papers, 3.5M citations
80% related
Robustness (computer science)
94.7K papers, 1.6M citations
78% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20239
202240
20211
20202
20192
201815