- Journal Home
- Volume 21 - 2024
- Volume 20 - 2023
- Volume 19 - 2022
- Volume 18 - 2021
- Volume 17 - 2020
- Volume 16 - 2019
- Volume 15 - 2018
- Volume 14 - 2017
- Volume 13 - 2016
- Volume 12 - 2015
- Volume 11 - 2014
- Volume 10 - 2013
- Volume 9 - 2012
- Volume 8 - 2011
- Volume 7 - 2010
- Volume 6 - 2009
- Volume 5 - 2008
- Volume 4 - 2007
- Volume 3 - 2006
- Volume 2 - 2005
- Volume 1 - 2004
Cited by
- BibTex
- RIS
- TXT
This paper aims to present a decolorization strategy based on perceptual consistency and dark channel prior. The proposed model consists of effective fidelity terms and a prior term. We use the $\mathcal{l}$0-norm to control the sparsity of the dark channel prior. To solve the non-convex minimization problem, we employ the split and penalty technique to simplify the minimization problem and then solve it by the carefully designed iteration scheme. Besides, we show the convergence of the algorithm using Kurdyka-Lojasiewicz property. The numerical evaluation in comparison with other state-of-the-art methods demonstrates the effectiveness of the proposed method.
}, issn = {2617-8710}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/ijnam/13020.html} }This paper aims to present a decolorization strategy based on perceptual consistency and dark channel prior. The proposed model consists of effective fidelity terms and a prior term. We use the $\mathcal{l}$0-norm to control the sparsity of the dark channel prior. To solve the non-convex minimization problem, we employ the split and penalty technique to simplify the minimization problem and then solve it by the carefully designed iteration scheme. Besides, we show the convergence of the algorithm using Kurdyka-Lojasiewicz property. The numerical evaluation in comparison with other state-of-the-art methods demonstrates the effectiveness of the proposed method.