Arthur Alaniz, Tina Mantaring: Difference between revisions

From Psych 221 Image Systems Engineering
Jump to navigation Jump to search
imported>Cmgmant
No edit summary
imported>Cmgmant
Line 19: Line 19:
: <math>\tilde{g}_{s,\theta} = (1 - \alpha) g_{0,s,\theta}^{(0)} + \alpha g_{1,s,\theta}^{(0)} + \beta g_{1,s,\theta}^{(1)}</math>
: <math>\tilde{g}_{s,\theta} = (1 - \alpha) g_{0,s,\theta}^{(0)} + \alpha g_{1,s,\theta}^{(0)} + \beta g_{1,s,\theta}^{(1)}</math>


Note that the structures for the interpolation and denoising kernels are very similar. Indeed, the only difference between them is that their component filters operate on different support channels.


=== Intersection of Confidence Intervals ===
=== Intersection of Confidence Intervals ===

Revision as of 07:59, 18 March 2011

Introduction

As the use of digital cameras becomes more and more widespread, the imaging algorithms that go into these cameras have also become more sophisticated. The typical digital camera uses a processing pipeline to convert raw sensor values to a final image, and the different parts of the pipeline may involve correcting for hardware defects, interpolating color filter array values, removing noise, and performing color space transformations. As more and more focus is being given to this field, the pipeline algorithms are also becoming more and more complex. However, one must ask the question: do these complex algorithms really outperform their simpler, more straightforward counterparts?

Methods

Denoising and Demosaicking

For our project, the primary algorithm we chose for our imaging pipeline was the one presented in the paper “Denoising and Interpolation of Noisy Bayer Data with Adaptive Cross-Color Filters”, by D. Paliy, A. Foi, R. Bilcu, and V. Katkovnik. Their technique performs simultaneous denoising and demosaicking using directional adaptive filters that are based on the concepts of local polynomial approximation (LPA) and intersection of confidence intervals (ICI).

Local Polynomial Approximation

Local polynomial approximation, or LPA, works on the assumption that the data in some local region can be fitted to a polynomial function. The cross-color filters used in the algorithm are linear combinations of LPA smoothing and difference filters that operate on complimentary color channels.

The above figure shows an example of an LPA smoothing filter (left) and an LPA difference filter (right). The combined LPA cross-color filter is shown below, where the differing colors illustrate that the smoothing and difference components work on different color channels.

File:LPAcombined.png

If we let gm,s,θ(k) denote a directional 1D convolution kernel, where m is the polynomial order, k is the order of the derivative, and θ is the direction, then we can write the interpolation kernels g¯s,θ and the denoising kernels g~s,θ as follows:

g¯s,θ=(1α)g0,s,θ(0)+αg1,s,θ(0)+βg1,s,θ(1)
g~s,θ=(1α)g0,s,θ(0)+αg1,s,θ(0)+βg1,s,θ(1)

Note that the structures for the interpolation and denoising kernels are very similar. Indeed, the only difference between them is that their component filters operate on different support channels.

Intersection of Confidence Intervals

Anisotropic Denoising and Interpolation

Noise Estimation

Post-Filtering

Color Correction

Results

Conclusions

References

Appendix

Sources and Results

Work Breakdown