Open Access   Article Go Back

An Optimal Patch Size based Sporadic Decomposition of Hankel Structured Matrix in Gradient Transform Domain for Impulse Noise Denoising

L. Baby Victoria1 , S. Sathappan2

Section:Research Paper, Product Type: Journal Paper
Volume-6 , Issue-9 , Page no. 246-250, Sep-2018

CrossRef-DOI:   https://doi.org/10.26438/ijcse/v6i9.246250

Online published on Sep 30, 2018

Copyright © L. Baby Victoria, S. Sathappan . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: L. Baby Victoria, S. Sathappan, “An Optimal Patch Size based Sporadic Decomposition of Hankel Structured Matrix in Gradient Transform Domain for Impulse Noise Denoising,” International Journal of Computer Sciences and Engineering, Vol.6, Issue.9, pp.246-250, 2018.

MLA Style Citation: L. Baby Victoria, S. Sathappan "An Optimal Patch Size based Sporadic Decomposition of Hankel Structured Matrix in Gradient Transform Domain for Impulse Noise Denoising." International Journal of Computer Sciences and Engineering 6.9 (2018): 246-250.

APA Style Citation: L. Baby Victoria, S. Sathappan, (2018). An Optimal Patch Size based Sporadic Decomposition of Hankel Structured Matrix in Gradient Transform Domain for Impulse Noise Denoising. International Journal of Computer Sciences and Engineering, 6(9), 246-250.

BibTex Style Citation:
@article{Victoria_2018,
author = {L. Baby Victoria, S. Sathappan},
title = {An Optimal Patch Size based Sporadic Decomposition of Hankel Structured Matrix in Gradient Transform Domain for Impulse Noise Denoising},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {9 2018},
volume = {6},
Issue = {9},
month = {9},
year = {2018},
issn = {2347-2693},
pages = {246-250},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=2852},
doi = {https://doi.org/10.26438/ijcse/v6i9.246250}
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v6i9.246250}
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=2852
TI - An Optimal Patch Size based Sporadic Decomposition of Hankel Structured Matrix in Gradient Transform Domain for Impulse Noise Denoising
T2 - International Journal of Computer Sciences and Engineering
AU - L. Baby Victoria, S. Sathappan
PY - 2018
DA - 2018/09/30
PB - IJCSE, Indore, INDIA
SP - 246-250
IS - 9
VL - 6
SN - 2347-2693
ER -

VIEWS PDF XML
456 341 downloads 193 downloads
  
  
           

Abstract

Noise removal refers to the most vital process in image processing to remove the noise from a given image and reconstruct the original image. Among many denoising techniques, four types of extended versions of robust Annihilating filter-based Low-rank Hankel Matrix (r-ALOHA) approaches have been proposed in the previous researches. In those approaches, different kinds of transform domains like log-exponential, wavelet, generalized Hough, and gradient were considered separately in which that the image patch was considered as it was sparse in the considered transform domains independently to denoise the corrupted image. Even if gradient transform based denoising called e4-ALOHA achieves better performance than the other transform domains, it requires an automatic selection of Optimal Patch Size (OPS) to further improve the denoising performance. Hence in this article, an automatic selection of OPS is proposed with e4-ALOHA that searches similar image patches and selects an optimal patch size. In this technique, a Flower Pollination optimization Algorithm (FPA) is proposed to search similar patches and choose an optimal patch size adaptively according to the variance of similar patch groups. Once an optimal patch size is selected, e4-ALOHA is applied to perform the denoising process. Finally, the effectiveness of the proposed technique is evaluated through the experimental results.

Key-Words / Index Term

Noise removal, r-ALOHA, e4-ALOHA, Optimal patch size, Flower pollination algorithm Formatting

References

[1] P. Kamboj, V. Rani, “A brief study on various noise model and filtering techniques”, Journal of Global Research in Computer Science, Vol.4, Issue.4, pp.166-171, 2013.
[2] A. Suganthi, M. Senthilmurugan, “Comparative study of various impulse noise reduction techniques”, International Journal of Engineering Research and Applications, Vol.3, Issue.5, pp.1302-1306, 2013.
[3] K. Pritamdas, Kh. M. Singh, L. L. Singh, “A summary on various impulse noise removal techniques”, International Journal of Science and Research, Vol.6, Issue.3, pp.941-954, 2017.
[4] K. H. Jin, J. C. Ye, “Sparse and low-rank decomposition of a hankel structured matrix for impulse noise removal”, IEEE Transactions on Image Processing, Vol.27, Issue.3, pp.1448-1461, 2018.
[5] L. B. Victoria, S. Sathappan, “A sporadic decomposition of hankel structured matrix in logarithmic and wavelet domain for impulse noise removal”, International Journal of Engineering & Technology, 2018.
[6] L. B. Victoria, S. Sathappan, “A sporadic decomposition of hankel structured matrix in generalized Hough and gradient transform domain for impulse noise removal”, In International Conference on Research Trends in Computing Technologies (ICRTCT18), 2018.
[7] C. A. Deledalle, J. Salmon, A. S. Dalalyan, “Image denoising with patch based PCA: local versus global”, In BMVC, Vol.81, pp.425-455, 2011.
[8] X. Zhang, X. Feng, W. Wang, “Two-direction nonlocal model for image denoising”, IEEE Transactions on Image Processing, Vol.22, Issue.1, pp.408-412, 2013.
[9] X. Chen, S. Bing Kang, J. Yang, J. Yu, “Fast patch-based denoising using approximated patch geodesic paths”, In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp.1211-1218, 2013.
[10] C. Kervrann, “PEWA: Patch-based exponentially weighted aggregation for image denoising”, In Advances in Neural Information Processing Systems, pp.2150-2158, 2014.
[11] K. Kundu, “Image Denoising using Patch based Processing with Fuzzy Gaussian Membership Function”, International Journal of Computer Applications, Vol.118, Issue.12, pp.35-40, 2015.
[12] X. Liu, Z. Yang, J. Wang, J. Liu, K. Zhang, W. Hu, “Patch-based denoising method using low-rank technique and targeted database for optical coherence tomography image”, Journal of Medical Imaging, Vol.4, Issue.1, pp.014002(1-12), 2017.
[13] M. Kaur, B. Jindal, “Improved sparse matrix denoising technqiues using affinity matrix for geographical images”, International Journal of Scientific Research in Computer Science and Engineering, Vol.5, Issue.5, pp.51-57, 2017.