2004
DOI: 10.1145/1015706.1015780
|View full text |Cite
|
Sign up to set email alerts
|

Colorization using optimization

Abstract: Figure 1: Given a grayscale image marked with some color scribbles by the user (left), our algorithm produces a colorized image (middle). For reference, the original color image is shown on the right.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

7
929
0

Year Published

2009
2009
2024
2024

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 1,252 publications
(936 citation statements)
references
References 5 publications
7
929
0
Order By: Relevance
“…Levin et al formulated an optimization problem [1] based on an assumption that neighboring pixels of similar intensity should have similar color values under the limitation that the colors indicated in the scribbles remain the same. Yatziv and Sapiro proposed a method [2] for determining propagation paths in the image by minimizing geodesic distances from every scribble.…”
Section: Related Workmentioning
confidence: 99%
See 4 more Smart Citations
“…Levin et al formulated an optimization problem [1] based on an assumption that neighboring pixels of similar intensity should have similar color values under the limitation that the colors indicated in the scribbles remain the same. Yatziv and Sapiro proposed a method [2] for determining propagation paths in the image by minimizing geodesic distances from every scribble.…”
Section: Related Workmentioning
confidence: 99%
“…Here, the image is transformed into a 49-dimensional DCT feature space, which is further reduced to 10 dimensions using linear discriminant analysis (LDA). The textural features are only used to determine location of transferred microscribbles which are subsequently propagated using Levin's method [1].…”
Section: Texture Analysismentioning
confidence: 99%
See 3 more Smart Citations