2012
DOI: 10.1111/j.1467-8659.2012.03137.x
|View full text |Cite
|
Sign up to set email alerts
|

Intrinsic Images by Clustering

Abstract: Decomposing an input image into its intrinsic shading and reflectance components is a long-standing ill-posed problem. We present a novel algorithm that requires no user strokes and works on a single image. Based on simple assumptions about its reflectance and luminance, we first find clusters of similar reflectance in the image, and build a linear system describing the connections and relations between them. Our assumptions are less restrictive than widely-adopted Retinex-based approaches, and can be further … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
101
0

Year Published

2012
2012
2023
2023

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 126 publications
(102 citation statements)
references
References 26 publications
1
101
0
Order By: Relevance
“…Nonetheless, significant progress has been made on this problem recently, and usable decompositions of real-world scenes have been obtained by incorporating additional data such as depth maps [Lee et al 2012;Barron and Malik 2013;Chen and Koltun 2013], multiple images of the same scene [Weiss 2001;Laffont et al 2012], or sophisticated priors such as reflectance sparsity [Gehler et al 2011] and non-local texture cues [Shen et al 2008;Garces et al 2012;Laffont et al 2012;Zhao et al 2012]. Incorporating these additional terms typically result in sophisticated algorithms which take minutes to solve for a single image.…”
Section: Introductionmentioning
confidence: 99%
“…Nonetheless, significant progress has been made on this problem recently, and usable decompositions of real-world scenes have been obtained by incorporating additional data such as depth maps [Lee et al 2012;Barron and Malik 2013;Chen and Koltun 2013], multiple images of the same scene [Weiss 2001;Laffont et al 2012], or sophisticated priors such as reflectance sparsity [Gehler et al 2011] and non-local texture cues [Shen et al 2008;Garces et al 2012;Laffont et al 2012;Zhao et al 2012]. Incorporating these additional terms typically result in sophisticated algorithms which take minutes to solve for a single image.…”
Section: Introductionmentioning
confidence: 99%
“…where ch(I p ) denotes the chromaticity of p. The left term expresses the well-established assumption that pixels that have similar chromaticity are likely to have similar albedo [14,12,36,15,21]. The right term is the geometric mean of the luminance values of p and q and attenuates the strength of the regularizer for darker pixels, for which the chromaticity is ill-conditioned.…”
Section: Regularizationmentioning
confidence: 99%
“…5 provides a visual comparison of our method against ground truth, as well as state-of-the-art automatic and user-assisted methods, all kindly provided by the authors of the previous work. In supplemental materials, we provide more images and comparisons to additional methods, including [Garces et al 2012] and our implementation of [Weiss 2001] extended to multiview, which is inspired by [Liu et al 2008]. In Fig.…”
Section: Intrinsic Decompositionsmentioning
confidence: 99%