A new approach to local nonlinear image restoration is described, based on approximating functions using a regular grid of points in a many-dimensional space. Symmetry reductions and compression of the sparse grid make it feasible to work with twelve-dimensional grids as large as 22<sup>12</sup>. Unlike polynomials and neural networks whose filtering complexity per pixel is linear in the number of filter co-efficients, grid filters have O(1) complexity per pixel. Grid filters require only a single presentation of the training samples, are numerically stable, leave unusual image features unchanged, and are a superset of order statistic filters. Results are presented for additive noise, blurring, and superresolution.
| Identifer | oai:union.ndltd.org:WATERLOO/oai:uwspace.uwaterloo.ca:10012/943 |
| Date | January 1998 |
| Creators | Veldhuizen, Todd |
| Publisher | University of Waterloo |
| Source Sets | University of Waterloo Electronic Theses Repository |
| Language | English |
| Detected Language | English |
| Type | Thesis or Dissertation |
| Format | application/pdf, 11869646 bytes, application/pdf |
| Rights | Copyright: 1998, Veldhuizen, Todd . All rights reserved. |
Page generated in 0.0021 seconds