Laplacian-guided image decolorization

Author(s):  
Cosmin Ancuti ◽  
Codruta O. Ancuti
Keyword(s):  

2019 ◽  
Vol 21 (10) ◽  
pp. 2461-2472 ◽  
Author(s):  
Shiguang Liu ◽  
Xiaoli Zhang


2018 ◽  
Vol 70 ◽  
pp. 251-260 ◽  
Author(s):  
Hanli Zhao ◽  
Haining Zhang ◽  
Xiaogang Jin
Keyword(s):  


2021 ◽  
Author(s):  
Fang Li ◽  
Yuanming Zhu

In this paper, we propose a new image decolorization method based on image clustering and weight optimization. First, we smooth the color image and cluster it into several classes and get the class centers. Each center can represent a distinctive color in the image. Then the class centers are sorted according to their brightness measured by Euclidean norm. By assuming that the decolorized grayscale image is a linear combination of the three channels of the color image, we propose an optimization problem by forcing the sorted class centers to correspond to specified grayscale values satisfying uniform distribution. Numerically, the problem is solved by quadratic programming. Experiments on two popular data sets demonstrate that the proposed method is competitive with the state-of-the-art decolorization method.





Author(s):  
Rui Zhao ◽  
Tianshan Liu ◽  
Jun Xiao ◽  
Daniel P.K. Lun ◽  
Kin-Man Lam
Keyword(s):  


2014 ◽  
Vol 7 (2) ◽  
pp. 944-968 ◽  
Author(s):  
Zhengmeng Jin ◽  
Fang Li ◽  
Michael K. Ng


2018 ◽  
Vol 34 (6-8) ◽  
pp. 1099-1108 ◽  
Author(s):  
Xiaoli Zhang ◽  
Shiguang Liu


2020 ◽  
Vol 29 ◽  
pp. 1776-1787 ◽  
Author(s):  
Wei Wang ◽  
Zhengguo Li ◽  
Shiqian Wu ◽  
Liangcai Zeng


Sign in / Sign up

Export Citation Format

Share Document