INTERNATIONAL JOURNAL OF RESEARCH IN TECHNOLOGY (IJRT)
2394-9007
Vol. V, No. II, April 2018
A Noble Approach of Image De-Noising through
Graph Gaussian Regularization based on Feature
Descriptor
Nawal Singh Patel, Pushpraj Singh Chauhan
Abstract— Image processing model has wide variety of
relevance area such as still imaging, space imaging, medical
resonance imaging and face identification. These application
areas should involve image de-noising concept on primary level.
The general problem with source images, they introduce some
blurring and artifacts factor. Image de-noising methods are used
the concept for elimination of blurring and noisy feature from an
image. Traditional methods are based on image region of
interest. It is well de-noising ability but implementation of such
methods is complex. The Graph Gaussian Regularization with
Feature Descriptor (GGRFD) is a proposed image de-noising
method which successively removes and reduced the noise and
blur from an image. It has easier to implement using novel noise
estimation and deterministic analysis approach. It is suitable for
the still artificial images i.e. satellite generated images or medical
images.
This dissertation employment presents relatively results and
study with Optimal Graph Laplacian Regularization (OGLR)
and additional methods for both satellite generated images or
medical images infected with dissimilar levels of noise. This
approach is proposed for image de-noising, which is proficiently
incorporated with a well trade-off by using the earlier of region
of interest. The restored image is finally prepared with the de-
noised region of interest of all image categories. Experimental
results express that, by using the proposed outline, the algorithm
is insensible to the distinction of the attributes of images, and can
strongly renovate images with an outstanding de-noising
performance.
Keywords: Graph Gaussian Regularization with Feature
Descriptor, Optimal Graph Laplacian Regularization, Block
Matching and 3D Filtering, Robust Noise Estimation, Deterministic
Annealing.
I. INTRODUCTION
Pictures are tainted with different sorts of clamors. So it is
exceptionally hard to get helpful data from boisterous pictures.
That is the reason de-noising systems are imperative subject
these days, For instance, medicinal pictures acquired by X-
beam or figured tomography CT in antagonistic conditions, or
Manuscript received on April, 2018.
Nawal Singh Patel, Research Scholar, Department of Computer Science &
Engineering, Bansal Institute of Research & Technology, Bhopal, M.P., India.
Prof. Pushpraj Singh Chauhan, Asst. Professor, Department of Computer
Science & Engineering, Bansal Institute of Research & Technology, Bhopal,
M.P., India.
Impact Factor: 4.012
Published under
Asian Research & Training Publication
ISO 9001:2015 Certified
ISSN No.
www.ijrtonline.org
a mammographic picture which might be polluted with
commotion that can influence the recognition of ailments or
the question of intrigue. The point of this work is to give the
review of different de-noising systems. A portion of these
systems give palatable outcomes in expelling clamor from
pictures and furthermore save edges with other fine points of
interest show in pictures. Distinctive techniques have been
proposed for picture reclamation relying upon the sort of
clamor show in picture. A portion of these calculations give
better come about to smoothing level Regions like spatial area
approaches. One of the greatest focal points of these strategies
is a Speed yet these systems don't protect the fine subtle
elements in the picture.
A vast segment of advanced picture handling is dedicated
to picture reclamation. This incorporates look into in
calculation improvement and routine objective arranged picture
handling. Picture rebuilding is the evacuation or diminishment
of debasements that are acquired while the picture is being
gotten. Corruption originates from obscuring and also
commotion because of electronic and photometric sources.
Obscuring is a type of data transfer capacity decrease of the
picture caused by the defective picture development process,
for example, relative movement between the camera and the
first scene or by an optical framework that is out of center [10].
At the point when ethereal photos are created for remote
detecting purposes, obscures are presented by environmental
turbulence, deviations in the optical framework and relative
movement amongst camera and ground. Notwithstanding these
obscuring impacts, the recorded picture is adulterated by
commotions as well.
II. RELATED WORK
Reverse imaging issues are naturally under-determined, and
henceforth it is essential to utilize suitable picture priors for
regularization. One late well known earlier the diagram
Laplacian regularizer expects that the objective pixel fix is
smooth as for a properly picked chart. Be that as it may, the
components and ramifications of forcing the chart Laplacian
regularizer on the first converse issue are not surely knew.
(Jiahao Pang, Gene Cheung; 2017).
77
INTERNATIONAL JOURNAL OF RESEARCH IN TECHNOLOGY (IJRT) ISSN No. 2394-9007
Vol. V, No. II, April 2018 www.ijrtonline.org
The de-noising impact is great, however is inclined to Step 4: for each noise patch Z0 in x, go to next step otherwise
misfortune the picture structure and surface data. In view of go to step 9.
the insufficiency of the conventional de-noising technique, Step 5: Perform mean filter on noise patch Z0 and obtain as
this paper set forward a strategy that depends on Z01.
morphological part investigation (MCA) to deteriorate a Step 6: Perform clustering on similar patches of Z01 in I.
picture into surface and structure. (Yifeng Cheng, Zengli Liu; Step 7: Computation of Gaussian function from similar
2016) patches.
Picture processing applications like in protest following, Step 8: De-noising of Z01 with constrained optimization.
restorative imaging, satellite imaging, confront Step 9: if next patch Z1 exist in x then go to step 3.
acknowledgment and division requires picture de-noising as Step 10: Aggregation of the de-noise image DIk
the preprocessing step. Issue with current picture de-noising Step 11: if (noise_var of de-noise image DIk)>=Threshold
techniques is blurring and antiquities presents after expulsion value of noise variance and k!= p(total pixel in DIk) then
of clamor from picture. (B. K. Thote, K. C. Jondhale; 2016) k=k+1,
A half and half structure is proposed for picture de- Now Estimation of noise variance for k
noising, in which a few best in class de-noising strategies are else
productively joined with a well exchange off by utilizing the return (DIk+1) and exit //Obtain De-Noised Image
earlier of patches. In detail, dissimilar to displaying patches end if
with the earlier in existed de-noising strategies, the earlier Step 12: go to step 3.
estimation here is exhibited just to identify the qualities of The flowchart of proposed methodology is as follows:
patches. (Ying Chen, Yibin Tangt, Lin Zhou, Aimin Jiangt,
Ning Xut; 2016)
Basic issue in the picture reclamation is the issue of de-
noising pictures while keeping the honesty of significant
picture data. Countless de-noising systems are proposed to
evacuate clamor. Fundamentally these systems are relies on
the kind of clamor exhibit in pictures. So picture de-noising
still remains an imperative test for scientists since de-noising
systems expel clamor from pictures yet in addition present a
few antiques and cause obscuring. (Sarbjit Kaur, Er. Smash
Singh; 2015).
III. METHODOLOGY Fig. 1: Flowchart of Methodology (GGRFD)
The basic procedure of propose methodology can be explain
through following point IV. RESULT & ANALYSIS
Input: Noisy_ Image I, Noise_Variance The exploratory works begin with MATLAB R2013a form.
Output: De-noise image Right off the bat, accept unique grayscale picture. For this
Algorithm: GGRFD reason imread() work has been utilized, at that point
Step 1: Initialize x = total amount of noisy patches in an effort demonstrate the picture in figure window with figure summon.
noisy images. For indicating picture in figure window, we need to utilize
Step 2: Initialize counter factor k=0 imshow() work, at that point following yield has been
Step 3: Basic guess for each picture region. produced.
A. Block-wise assessments: For each piece in the uproarious
figure, do the accompanying.
1. Grouping: Find hinders that are like by handled one and
after that heap up them together in a 3-D exhibit
(gathering).
2. Collaborative hard-thresholding: Apply a 3-D change to
the framed gathering, fulfill the commotion by hard-
thresholding of the change coefficients, upset the 3-D
change to deliver appraisals of every single assembled
square, and restore the assessments of the pieces to their
unique positions.
B. Aggregation: figure the fundamental guess of the genuine Fig. 2: Load Barbara image
picture by subjective averaging the greater part of the got Above figure demonstrate that the how recover the source
square insightful assessments that are covering. pictures from required way. After discover the source picture,

Impact Factor: 4.012 78

Published under
Asian Research & Training Publication
ISO 9001:2015 Certified
INTERNATIONAL JOURNAL OF RESEARCH IN TECHNOLOGY (IJRT) ISSN No. 2394-9007
Vol. V, No. II, April 2018 www.ijrtonline.org
apply (Additive White Gaussian Noise) AWGN with suitable
standard deviation.

Fig. 5: Comparison of PSNR for different methods with  = 10.

Fig. 3: Noisy image through AWGN

Fig. 6: Comparison of PSNR for different methods with  = 20.

Fig. 4: De-Noise Image Using GGRFD (Proposed Method)
Source picture and de-noised picture are use for figure the
PSNR and SSIM. These execution parameters is use for
analyze the assess an incentive from source pictures and de-
noised picture. These qualities are assesses for source picture
and de-noised picture.
In the event that pictures are taken from MATLAB
picture handling archive then the examination of the current
works Block Matching 3-D (BM3D)[16], Optimal Graph
Laplacian Regularizer (OGLR)[1] and the proposed work
Graph Gaussian Regularization with Feature Descriptor
(GGRFD) based on various quality parameters are given in
Table 1 and Table 2. Fig. 7: Comparison of PSNR for different methods with  = 30.
TABLE I: ANALYSIS OF COMPARISONS THE VALUE OF PSNR IN
BETWEEN OF BM3D[16], OGLR[1] AND PROPOSED METHOD
GGRFD (GRAPH GAUSSIAN REGULARIZATION WITH FEATURE
DESCRIPTOR) WITH DIFFERENT IMAGES AND STANDARD
DEVIATION.

Fig. 8: Comparison of PSNR for different methods with  = 40.

Impact Factor: 4.012 79

Published under
Asian Research & Training Publication
ISO 9001:2015 Certified
INTERNATIONAL JOURNAL OF RESEARCH IN TECHNOLOGY (IJRT)
Vol. V, No. II, April 2018
Fig. 9: Comparison of PSNR for different methods with
TABLE II: ANALYSIS OF COMPARISONS THE VALUE OF SSIM IN
BETWEEN OF BM3D[16], OGLR[1] AND PROPOSED METHOD
GGRFD (GRAPH GAUSSIAN REGULARIZATION WITH FEATURE
DESCRIPTOR) WITH DIFFERENT IMAGES AND STANDARD
DEVIATION.
Fig. 10: Comparison of SSIM for different methods with
Fig. 11: Comparison of SSIM for different methods with
Impact Factor: 4.012
Published under
Asian Research & Training Publication
ISO 9001:2015 Certified
ISSN No. 2394-9007
www.ijrtonline.org
 = 50
Fig. 12: Comparison of SSIM for different methods with  = 30.
Fig. 13: Comparison of SSIM for different methods with  = 40.
Fig. 14: Comparison of SSIM for different methods with  = 50.
 = 10.
Here the comparisons result tested on the basis of different
images and measure the various result parameters shown in
the comparisons tables. The de-noised image is compares in
between of BM3D, OGLR and GGRFD for different image.
The value of PSNR (for GGRFD) is more than value of PSNR
(for BM3D and OGLR). The value of SSIM (for GGRFD) is
more than value of SSIM (for BM3D and OGLR). Hence the
performance of the proposed work (GGRFD) is better as
compared to the existing techniques.
V. CONCLUSION
The Optimal Graph Laplacian Regularizer is a popular recent
prior to regularize inverse imaging problems. In this work, to
study in-depth the mechanism and implication of Optimal
 = 20. Graph Laplacian Regularization. We then derive the Graph
Gaussian Regularization with Feature Descriptor for image
80
INTERNATIONAL JOURNAL OF RESEARCH IN TECHNOLOGY (IJRT)
Vol. V, No. II, April 2018
de-noising, assuming non-local self-similarity. To explain the
behavior of optimal graph Laplacian regularization, our
developed de-noising algorithm, Graph Gaussian
Regularization with Feature Descriptor (GGRFD) for de-
noising, produces competitive results for natural images
compared to state-of-the-art methods, and out-performs them
for piecewise smooth images. After analyzing BM3D, OGLR
and GGRFD for various AWGN noise levels, come to a
conclusion that GGRFD gives visual and theoretical excellent
results for both synthetic and natural images. From tables (1
and 2) the SSIM for GGRFD is more but the results for
synthetic images at high noise level(  = 50) smooth and
artifact free compare to BM3D and OGLR . OGLR has less
low-frequency noise than BM3D.
VI. SCOPE OF FUTURE WORK
In future GGRFD can be improved by reducing the execution
time and improve PSNR for algorithm compare to GGRFD.
For this purpose, threshold value has been set in machine
learning. Through machine learning and different optimization
scheme like Particle of Swarm Optimization and Genetic
algorithm can be efficiently de-noise image.
REFERENCES
1. Jiahao Pang and Gene Cheung, Graph Laplacian Regularization
for Image De-noising: Analysis in the Continuous Domain”,
IEEE Transactions on Image Processing, 2017.
2. Yifeng Cheng and Zengli Liu, “Image De-noising Algorithm
Based on Structure and Texture Part”, ICCIS, 2016.
3. B.K.Thote and K. C. Jondhale, “Improved De-noising
Technique for Natural and Synthetic Images”, ICCIT, 2016.
4. Ying Chen, Yibin Tangt, Lin Zhou, Aimin Jiangt and Ning Xut ,
“Hybrid Framework for Image De-noising with Patch Prior
Estimation”, IEEE Conf. on Image Processing, 2016.
5. Sarbjit Kaur and Er. Ram Singh, “Image De-Noising
Techniques: A Review Paper”, International Journal For
Technological Research In Engineering Volume 2, Issue 8,
April-2015.
6. Jiachao Zhang, Student Member and Keigo Hirakawa,
“Improved De-noising via Poisson Mixture Modeling of Image
Sensor Noise”, IEEE Transactions on Image Processing, Sep,
2015.
7. Kalpana and Harjinder Singh, “Review Paper: To Study The
Image De-noising Techniques”, International Research Journal
of Engineering and Technology (IRJET), Volume: 02 Issue: 08,
Nov-2015.
8. Yali Liu, “Image De-noising Method based on Threshold,
Wavelet Transform and Genetic Algorithm”, International
Journal of Signal Processing, Image Processing and Pattern
Recognition Vol. 8, No. 2, 2015.
9. Mukesh C. Motwani, Mukesh C. Gadiya and Rakhi C. Motwani,
“Survey of Image De-noising Techniques”, ICCRT, 2015.
10. Rajni and Anutam, “Image De-noising Techniques-An
Overview”, International Journal of Computer Applications
(0975 – 8887) Volume 86 – No 16, January 2014.
Impact Factor: 4.012
Published under
Asian Research & Training Publication
ISO 9001:2015 Certified
ISSN No. 2394-9007
www.ijrtonline.org
11. Sandeep Kaur and Navdeep Singh “Image De-noising
Techniques: A Review”, International Journal of Innovative
Research in Computer and Communication Engineering, Vol. 2,
Issue 6, June 2014.
12. Jyotsna Patil1, Sunita Jadhav, “A Comparative Study of Image
De-noising Techniques”, International Journal of Innovative
Research in Science, Engineering and Technology, Vol. 2, Issue
3, March 2013.
13. Prof.R.Gayathri and Dr.R.S.Sabeenian, “A Survey on Image De-
noising Algorithms (IDA)”, International Journal of Advanced
Research in Electrical, Electronics and Instrumentation
Engineering Vol. 1, Issue 5, November 2012.
14. Tanzila Saba, Amjad Rehman and Ghazali Sulong, “An
Intelligent Approach To Image De-noising”, Journal Of
Theoretical And Applied Information Technology, 2010.
15. Jiang Taoa and Zhao Xinb, “Research And Application Of
Image De-noising Method Based On Curve-let Transform”, The
International Archives Of The Photogrammetry, Remote
Sensing And Spatial Information Sciences. Vol. Xxxvii. Part
B2. Beijing 2008.
16. Kostadin Dabov, Alessandro Foi, Vladimir Katkovnik, and
Karen Egiazarian, “Image de-noising with block-matching and
3D filtering”, Image Processing: Algorithms and Systems,
Neural Networks, and Machine Learning, 2006.
17. L. I. Rudin, S. Osher, and E. Fatemi, “Nonlinear total variation
based noise removal algorithms,” Physica D: Nonlinear
Phenomena, vol. 60,no. 1, pp. 259–268, Nov. 1992.
18. M. Elad and M. Aharon, “Image denoising via sparse and
redundant representations over learned dictionaries,” IEEE
Trans. Image Process., vol. 15, no. 12, pp. 3736–3745, Dec.
2006.
19. X. Zhang and X. Wu, “Image interpolation by adaptive 2-D
autoregressive modeling and soft-decision estimation,” IEEE
Trans. Image Process., vol. 17, no. 6, pp. 887–896, Jun. 2008.
20. D. I. Shuman, S. K. Narang, P. Frossard, A. Ortega, and P.
Vandergheynst, “The emerging field of signal processing on
graphs: Extending high-dimensional data analysis to networks
and other irregular domains,” IEEE Signal Process. Mag., vol.
30, no. 3, pp. 83–98, May 2013.
21. A. Sandryhaila and J. M. Moura, “Discrete signal processing on
graphs,”IEEE Trans. Signal Process., vol. 61, no. 7, pp. 1644–
1656, Apr. 2013.
22. A. Kheradmand and P. Milanfar, “A general framework for
kernel similarity-based image denoising,” in IEEE Glob. Conf.
on Signal and Information Processing, 2013, pp. 415–418.
23. W. Hu, X. Li, G. Cheung, and O. C. Au, “Depth map denoising
using graph-based transform and group sparsity,” in IEEE Int’l
Workshop on Multimedia Signal Processing, Sep. 2013, pp.
001–006.
24. X. Liu, D. Zhai, D. Zhao, G. Zhai, and W. Gao, “Progressive
image denoising through hybrid graph Laplacian regularization:
A unified framework,” IEEE Trans. Image Process., vol. 23, no.
4, pp. 1491–1503, Apr. 2014.
81
INTERNATIONAL JOURNAL OF RESEARCH IN TECHNOLOGY (IJRT)
Vol. V, No. II, April 2018
25. W. Hu, G. Cheung, X. Li, and O. C. Au, “Graph-based joint
denoising and super-resolution of generalized piecewise smooth
images,” in IEEE Int’l Conf. Imag. Process, Oct. 2014, pp.
2056–2060.
26. Y. Wang, A. Ortega, D. Tian, and A. Vetro, “A graph-based
joint bilateral approach for depth enhancement,” in IEEE Int’l
Conf. Acoustics, Speech and Signal Processing, May 2014, pp.
885–889.
27. A. Kheradmand and P. Milanfar, “A general framework for
regularized, similarity-based image restoration,” IEEE Trans.
Image Process., vol. 23, no. 12, pp. 5136–5151, Dec. 2014.
28. X. Liu, G. Cheung, X. Wu, and D. Zhao, “Inter-block soft
decoding of JPEG images with sparsity and graph-signal
smoothness priors,” in IEEE Int’l Conf. Imag. Process., Sep.
2015, pp. 1628–1632.
Impact Factor: 4.012
Published under
Asian Research & Training Publication
ISO 9001:2015 Certified
ISSN No. 2394-9007
www.ijrtonline.org
29. W. Hu, G. Cheung, and M. Kazui, “Graph-based dequantization
of block-compressed piecewise smooth images,” in IEEE Signal
Process. Lett., vol. 23, no. 2, Feb. 2016, pp. 242–246.
30. X. Liu, G. Cheung, X. Wu, and D. Zhao, “Random walk graph
Laplacian based smoothness prior for soft decoding of JPEG
images,” IEEE Trans. Image Process., vol. 26, no. 2, pp. 509–
524, Feb. 2017.
31. P. Wan, G. Cheung, D. Florencio, C. Zhang, and O. C. Au,
“Image bit depth enhancement via maximum-a-posteriori
estimation of graph AC component,” in IEEE Int’l Conf. Imag.
Process, Oct. 2014, pp. 4052–4056.
32. P. Wan, G. Cheung, D. Florencio, C. Zhang, and O. Au, “Image
bit depth enhancement via maximum-a-posteriori estimation of
AC signal, ”IEEE Trans. Image Process., vol. 25, no. 6, pp.
2896–2909, Jun. 2016.
82