CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
Reseach Article

Analytics of Unconstrained Convex Problems in Sparse and Redundant Representations: A Case Study on Image Processing Applications

by Pooja Patil, Subhash S. Kulkarni
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 178 - Number 34
Year of Publication: 2019
Authors: Pooja Patil, Subhash S. Kulkarni
10.5120/ijca2019919223

Pooja Patil, Subhash S. Kulkarni . Analytics of Unconstrained Convex Problems in Sparse and Redundant Representations: A Case Study on Image Processing Applications. International Journal of Computer Applications. 178, 34 ( Jul 2019), 35-42. DOI=10.5120/ijca2019919223

@article{ 10.5120/ijca2019919223,
author = { Pooja Patil, Subhash S. Kulkarni },
title = { Analytics of Unconstrained Convex Problems in Sparse and Redundant Representations: A Case Study on Image Processing Applications },
journal = { International Journal of Computer Applications },
issue_date = { Jul 2019 },
volume = { 178 },
number = { 34 },
month = { Jul },
year = { 2019 },
issn = { 0975-8887 },
pages = { 35-42 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume178/number34/30762-2019919223/ },
doi = { 10.5120/ijca2019919223 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T00:52:14.539950+05:30
%A Pooja Patil
%A Subhash S. Kulkarni
%T Analytics of Unconstrained Convex Problems in Sparse and Redundant Representations: A Case Study on Image Processing Applications
%J International Journal of Computer Applications
%@ 0975-8887
%V 178
%N 34
%P 35-42
%D 2019
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The key objective of sparse and redundant representations is all about the introduction of a highly elegant data model with well-defined mathematical foundations. The structure of this model has been emerged from the conventional transforms represented in redundant unitary form. This draws out a new flavor of treatment to data. The appeal of this model is attributed to compact representation it facilitates. A lot of freedom persists in model adaptation to fit the data depending on the application. Many models are available aiming to serve the data of interest. Models can be given as mathematical descriptions or the conditions that the underlying signal of interest are believed to obey. Models that are available in image processing are Discrete Cosine Transform (DCT), Principal Component Analysis (PCA), wiener filtering, anisotropic diffusion, etc. Posing a new model requires a delicate attention to attain the simplest possible and reliable model while justifying the actual content of the data. To this Sparseland model emerges out as a new universal data model serving many applications in image processing. A class of applications in image processing demand the recovery of clean image from the naturally available perturbed images, which are treated as inverse problems. Some examples of such problems are image deblurring, image inpainting, etc. This paper discusses sparse approach to an inverse problem with image deblurring as a case study. The comparison of various shrinkage algorithms supporting sparse approach, used to serve this application is discussed along with the key constraints involved in these algorithms.

References
  1. Christopher M Bishop. Pattern recognition and machine learning. Springer, 2006.
  2. Stephen Boyd and Lieven Vandenberghe. Convex optimization. Cambridge university press, 2004.
  3. Emmanuel J Cand`es and David L Donoho. New tight frames of curvelets and optimal representations of objects with piecewise c2 singularities. Communications on Pure and Applied Mathematics: A Journal Issued by the Courant Institute of Mathematical Sciences, 57(2):219–266, 2004.
  4. Chunhong Cao, Jie Yu, Chengyao Zhou, Kai Hu, Fen Xiao, and Xieping Gao. Hyperspectral image denoising via subspace-based nonlocal low-rank and sparse factorization. IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, 2019.
  5. Cuthbert Daniel and Fred S Wood. Fitting equations to data: computer analysis of multifactor data. John Wiley & Sons, Inc., 1980.
  6. Ingrid Daubechies, Michel Defrise, and Christine De Mol. An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Communications on Pure and Applied Mathematics: A Journal Issued by the Courant Institute of Mathematical Sciences, 57(11):1413–1457, 2004.
  7. Ronald A DeVore. Nonlinear approximation. Acta numerica, 7:51–150, 1998.
  8. Minh N Do and Martin Vetterli. The contourlet transform: an efficient directional multiresolution image representation. IEEE Transactions on image processing, 14(12):2091–2106, 2005.
  9. Weisheng Dong, Lei Zhang, Guangming Shi, and Xin Li. Nonlocally centralized sparse representation for image restoration. IEEE transactions on Image Processing, 22(4):1620–1630, 2012.
  10. Michael Elad. Sparse and redundant representations: from theory to applications in signal and image processing. Springer Science & Business Media, 2010.
  11. Ramin Eslami and Hayder Radha. The contourlet transform for image denoising using cycle spinning. In The Thrity-Seventh Asilomar Conference on Signals, Systems & Computers, 2003, volume 2, pages 1982–1986. IEEE, 2003.
  12. Ramin Eslami and Hayder Radha. Translation-invariant contourlet transform and its application to image denoising. IEEE Transactions on Image Processing, 15(11):3362–3374, 2006.
  13. Rafael C Gonzalez, Richard E Woods, et al. Digital image processing [m]. Publishing house of electronics industry, 141(7), 2002.
  14. H-M Gutmann. A radial basis function method for global optimization. Journal of global optimization, 19(3):201–227, 2001.
  15. Roger A Horn and Charles R Johnson. Matrix analysis. Cambridge university press, 2012.
  16. Marvin Marcus and Henryk Minc. A survey of matrix theory and matrix inequalities, volume 14. Courier Corporation, 1992.
  17. Jesus Pineda, Jhacson Meza, Erik M Barrios, Lenny A Romero, and Andres G Marrugo. Noise-robust processing of phase dislocations using combined unwrapping and sparse inpainting with dictionary learning. In 2019 XXII Symposium on Image, Signal Processing and Artificial Vision (STSIVA), pages 1–5. IEEE, 2019.
  18. Jean-Luc Starck, Emmanuel J Cand`es, and David L Donoho. The curvelet transform for image denoising. IEEE Transactions on image processing, 11(6):670–684, 2002.
  19. Jean-Luc Starck, Fionn Murtagh, and Jalal M Fadili. Sparse image and signal processing: wavelets, curvelets, morphological diversity. Cambridge university press, 2010.
  20. Rachael Tappenden, Martin Tak´aˇc, and Peter Richt´arik. On the complexity of parallel coordinate descent. Optimization Methods and Software, 33(2):372–395, 2018.
  21. Albert Tarantola. Inverse problem theory and methods for model parameter estimation, volume 89. siam, 2005.
  22. Robert Tibshirani. Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society: Series B (Methodological), 58(1):267–288, 1996.
  23. Aaron Tropp. Topics in sparse approximation. Joel PhD thesis, 2004.
  24. Zhou Wang, Alan C Bovik, Hamid R Sheikh, Eero P Simoncelli, et al. Image quality assessment: from error visibility to structural similarity. IEEE transactions on image processing, 13(4):600–612, 2004.
  25. Joaquin Zepeda, Christine Guillemot, and Ewa Kijak. Image compression using sparse representations and the iteration tuned and aligned dictionary. IEEE Journal of Selected Topics in Signal Processing, 5(5):1061–1073, 2011.
Index Terms

Computer Science
Information Sciences

Keywords

Unconstrained convex problems Sparse solutions Inverse problems Optimization Regularization Shrinkage algorithms