Optimization using L1 Minimization Method in Image Processing |
Author(s): |
Tanu R , Jawaharlal Nehru National college of engineering,shivamogga,Karnataka; Dr. Jagadeesha S.N, Jawaharlal Nehru National college of engineering,shivamogga,Karnataka |
Keywords: |
Colorization, Compressive Sensing, Image Compression, Image Filtering, Reconstruction |
Abstract |
In this proposal, the colorization-based coding problem is formulated into an optimization problem, i.e., an L1 minimization problem. In colorization-based coding, the encoder chooses a few representative pixels (RP) for which the chrominance values and the positions are sent to the decoder, whereas in the decoder, the chrominance values for all the pixels are reconstructed by colorization methods. The main issue in colorization-based coding is how to extract the RP well therefore the compression rate and the quality of the reconstructed color image becomes good. By formulating the colorization-based coding into an L1 minimization problem, it is guaranteed that, given the colorization matrix, the chosen set of RP becomes the optimal set in the sense that it minimizes the error between the original and the reconstructed color image. In other words, for a fixed error value and a given colorization matrix, the chosen set of RP is the smallest set possible. |
Other Details |
Paper ID: IJSRDV3I31329 Published in: Volume : 3, Issue : 3 Publication Date: 01/06/2015 Page(s): 2624-2627 |
Article Preview |
|
|