Colorization-based compression using optimization

Sukho Lee, Sang Wook Park, Paul Oh, Moon Gi Kang

Research output: Contribution to journalArticle

27 Citations (Scopus)

Abstract

In this paper, we formulate the colorization-based coding problem 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. We also propose a method to construct the colorization matrix that colorizes the image in a multiscale manner. This, combined with the proposed RP extraction method, allows us to choose a very small set of RP. It is shown experimentally that the proposed method outperforms conventional colorization-based coding methods as well as the JPEG standard and is comparable with the JPEG2000 compression standard, both in terms of the compression rate and the quality of the reconstructed color image.

Original languageEnglish
Article number6482621
Pages (from-to)2627-2636
Number of pages10
JournalIEEE Transactions on Image Processing
Volume22
Issue number7
DOIs
Publication statusPublished - 2013 May 23

Fingerprint

Pixels
Color

All Science Journal Classification (ASJC) codes

  • Software
  • Medicine(all)
  • Computer Graphics and Computer-Aided Design

Cite this

Lee, Sukho ; Park, Sang Wook ; Oh, Paul ; Kang, Moon Gi. / Colorization-based compression using optimization. In: IEEE Transactions on Image Processing. 2013 ; Vol. 22, No. 7. pp. 2627-2636.
@article{1bf8034edcd64495bbc3b774f0b33aad,
title = "Colorization-based compression using optimization",
abstract = "In this paper, we formulate the colorization-based coding problem 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. We also propose a method to construct the colorization matrix that colorizes the image in a multiscale manner. This, combined with the proposed RP extraction method, allows us to choose a very small set of RP. It is shown experimentally that the proposed method outperforms conventional colorization-based coding methods as well as the JPEG standard and is comparable with the JPEG2000 compression standard, both in terms of the compression rate and the quality of the reconstructed color image.",
author = "Sukho Lee and Park, {Sang Wook} and Paul Oh and Kang, {Moon Gi}",
year = "2013",
month = "5",
day = "23",
doi = "10.1109/TIP.2013.2253486",
language = "English",
volume = "22",
pages = "2627--2636",
journal = "IEEE Transactions on Image Processing",
issn = "1057-7149",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "7",

}

Colorization-based compression using optimization. / Lee, Sukho; Park, Sang Wook; Oh, Paul; Kang, Moon Gi.

In: IEEE Transactions on Image Processing, Vol. 22, No. 7, 6482621, 23.05.2013, p. 2627-2636.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Colorization-based compression using optimization

AU - Lee, Sukho

AU - Park, Sang Wook

AU - Oh, Paul

AU - Kang, Moon Gi

PY - 2013/5/23

Y1 - 2013/5/23

N2 - In this paper, we formulate the colorization-based coding problem 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. We also propose a method to construct the colorization matrix that colorizes the image in a multiscale manner. This, combined with the proposed RP extraction method, allows us to choose a very small set of RP. It is shown experimentally that the proposed method outperforms conventional colorization-based coding methods as well as the JPEG standard and is comparable with the JPEG2000 compression standard, both in terms of the compression rate and the quality of the reconstructed color image.

AB - In this paper, we formulate the colorization-based coding problem 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. We also propose a method to construct the colorization matrix that colorizes the image in a multiscale manner. This, combined with the proposed RP extraction method, allows us to choose a very small set of RP. It is shown experimentally that the proposed method outperforms conventional colorization-based coding methods as well as the JPEG standard and is comparable with the JPEG2000 compression standard, both in terms of the compression rate and the quality of the reconstructed color image.

UR - http://www.scopus.com/inward/record.url?scp=84877881603&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84877881603&partnerID=8YFLogxK

U2 - 10.1109/TIP.2013.2253486

DO - 10.1109/TIP.2013.2253486

M3 - Article

VL - 22

SP - 2627

EP - 2636

JO - IEEE Transactions on Image Processing

JF - IEEE Transactions on Image Processing

SN - 1057-7149

IS - 7

M1 - 6482621

ER -