Image reconstruction by convolution with symmetrical piecewise nth-order polynomial kernels
DOI10.1109/83.743854zbMATH Open1098.94508OpenAlexW2160506249WikidataQ51893292 ScholiaQ51893292MaRDI QIDQ4503263FDOQ4503263
Erik (Hendrik Willem) Meijering, Karel J. Zuiderveld, Max A. Viergever
Publication date: 6 September 2000
Published in: IEEE Transactions on Image Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/83.743854
Recommendations
- Design of low-artifact interpolation kernels by means of computer algebra
- Two-dimensional cubic convolution
- Isotropic kernels for two-dimensional image interpolation
- The fast sinc transform and image reconstruction from nonuniform samples in \(k\)-space
- A comparison between the sampling Kantorovich algorithm for digital image processing with some interpolation and quasi-interpolation methods
Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Algorithms for approximation of functions (65D15)
Cited In (6)
- Oscillation-free advection of interfaces with high order semi-Lagrangian schemes
- A high-order norm-product regularized multiple kernel learning framework for kernel optimization
- Continuous time domain properties of causal cubic splines
- Two-dimensional cubic convolution
- Title not available (Why is that?)
- Reversible symmetric nonexpansive convolution: an effective image boundary processing for <inline-formula> <tex-math notation="tex">$\mbi{m}$ </tex-math></inline-formula>-channel lifting-based linear-phase filter banks
This page was built for publication: Image reconstruction by convolution with symmetrical piecewise nth-order polynomial kernels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4503263)
