Documentos de Académico
Documentos de Profesional
Documentos de Cultura
By : Sutanshu S. Raj,
Divij Babbar (USIT)
&
Palak Jain (IGIT)
GGS-IP Univ.
AIM / PURPOSE :
1. A Novel Spatially Selective Noise Filtration Technique
based on Relational Context Spatial Domain Analysis is
introduced, for the removal of Additive, Multiplicative
and Uncorrelated Noise – Frobenius Norm Filter (FNF).
2. In extension, the Filter is applied to various polluted
Images – Medical, SAR, etc – and the results are found to
be comparable with those of existing Filtering methods.
3. Also, the Filter is employed upon a Class of Noises
having varied Probability Density Functions (PDF’s) to
show the versatility of the FN Filter.
4. Mathematically Prove the existence of a Minimizer, and
its Convergence, for the Frobenius Norm Filter.
INSPIRATION :
1. Measure Theory: a measure on a set is a systematic way to assign to
each suitable subset a number, intuitively interpreted as the size of
the subset. In this sense, a measure is a generalization of the
concepts of length, area, volume, etc.
2. Euclidean axioms leave no freedom, they determine uniquely all
geometric properties of the Space. Every Euclidean space is also a
Topological Space, which are of analytic nature.
3. Topological Spaces, by definition, have Open Sets leading to notions
of continuous functions, paths, maps, convergent sequences, limits,
interior, boundary.
4. Open Set provides a fundamental way to speak of nearness of points
in a Topological Space, without explicitly having a concept of
distance defined – done on a neighborhood basis.
INSPIRATION (CONTD.):
1. Frobenius Norm: A Vector Norm treats an m×n Matrix as
a Vector of size mn, and using mapping function p = 2 gives
-
where, μ = mean.
Proposed Algorithm.
If denote the dynamic range of , the gray level of a M×N
Image, then we have y as a Noisy Image and as a window of size w×w
centered at (i, j). The algorithm identifies the noisy pixels and then
adaptively replaces them with the Frobenius Norm of the pixels in .
1. For each pixel location (i, j), initialize w = 3.
2. Compute , which are the minimum, Frobenius
Norm, maximum of the pixel values in , respectively.
3. Compute .
4. If , then proceed to step [5], else set i = i+1.
5. If , then is not a noisy candidate, else we
replace the pixel with .
The neighborhood may include coefficients from other subbands,
corresponding to basis functions at nearby scales and orientations.
EXPERIMENTAL RESULTS (Gaussian Noise)…
Image corrupted with varying Noise Density (d) and thereafter filtered with FNF.
Image Corrupted with d = 0.1 Frobenius Norm Filtered Image. Median Filtered Image.
Image Corrupted with d = 0.5 Frobenius Norm Filtered Image. Median Filtered Image.
EXPERIMENTAL RESULTS…
Comparative Performance Study of various Denoising Algorithms (d=0.05)
GRAPHS & HISTOGRAMS…
The Experimental Evaluation reveals that the proposed Frobenius Norm Filter
shows better results than the conventional Median Filter & Adaptive Median Filter
when the Images are highly corrupted and having Noise Density d ∊[0.4, 1).
Graphical Plots (PSNR vs. Noise Density) of ADP and FNF at different values of d for bior6.8 and db2, both at n=2.
Images for a Class of Noises (Poisson, Rayleigh & Speckle)…
13
DENOISING RESULTS (PSNR - DB) FOR VARIOUS NOISE MODELS…
Parameter Settings (Mean and Variance) for the Simulations were Constant.
Compatibility, in terms of De-noising, with Noise Models having PDF’s measurable
in the L2 (Rn) space is evident from the results. The Noise is considered to be stationary.
FNF depicts edge & feature sensitive selectivity in passing High Frequency Data.
RESULTS FOR DENOISING OF A CLASS OF IMAGES (MRI, SAR)…
Bottom – Down: MRI Images corrupted with Rician, AWGN and Gaussian Noise, resp.
PSNR Values for Denoising of a Class of Images (MRI, SAR)…
16
DISCUSSION – THE 5 C’S…
1. Complexity: Sorting N pixel values in a neighbourhood in to Numerical
Order requires a Temporal Complexity of O(N log(N)). Median Filters, and its
variants, are a 2-phase process which are difficult to treat analytically, are
expensive and complex to compute. The Frobenius Norm calculations do not
exceed O(N) and it is hence, computationally (read time) more efficient.
2. Connectivity: It is observed that Median Filter’s Connectivity tends to break-
down when the Image is highly corrupted. Whereas, the Frobenius Norm
works on Eigenvalues and Eigenvectors, which are unique to a given system
and when applied to a neighborhood of pixels, the Connectivity is preserved.
3. Compatibility: Most set of Noises are compatible with the FNF as they are
measured either in the L1 (Ω) or L2 (Ω) space.
4. Correspondence: a one-to-one correspondence exists between the Banach
Space, when the Frobenius Norm is measured, and the Euclidean Hilbert
Space, where the Image is represented w.r.t the Image Intensity Function Ω.
5. Coupling: we use a Neighborhood of Coefficients drawn from two sub-bands
at adjacent scales, thus taking advantage of the strong statistical coupling
observed in Multi-resolution Analysis innate to Wavelet Analysis.
RESULTS, APPLICATION and FUTURE WORK…
1. Paper titled ‘Analysis of Wavelet Family with Frobenius Norm for the
Removal of Impulse Noise’ has been accepted for publication at the
IEEE – IET International Conference on Audio, Language and
Image Processing ’10, Shanghai, China.
2. Paper titled ‘Image De-noising for a Class of Noises using the
Frobenius Norm Filter’ has been accepted in the International
Journal of Computer Applications (IJCA).
3. Paper titled ‘Enhancement of Medical & SAR Images Using a Novel
Frobenius Norm Filtering Method’ has been submitted to IEEE
International Conference on Communication and Signal
Processing ’11, Calicut, India.
20