Abstract
This paper describes two-dimensional, non-separable, piecewise polynomial convolution for image reconstruction. We investigate a two-parameter kernel with support [-2,2]×[-2,2] and constrained for smooth reconstruction. Performance reconstructing a sampled random Markov field is superior to the traditional one-dimensional cubic convolution algorithm.
Original language | English (US) |
---|---|
Pages (from-to) | 3237-3240 |
Number of pages | 4 |
Journal | ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings |
Volume | 6 |
State | Published - 1999 |
Event | Proceedings of the 1999 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP-99) - Phoenix, AZ, USA Duration: Mar 15 1999 → Mar 19 1999 |
ASJC Scopus subject areas
- Software
- Signal Processing
- Electrical and Electronic Engineering