Proceedings of the 2011 SIGGRAPH Asia Conference on - SA '11 2011
DOI: 10.1145/2070752.2024208
|View full text |Cite
|
Sign up to set email alerts
|

Image smoothing viaL0gradient minimization

et al.

Abstract: We present a new image editing method, particularly effective for sharpening major edges by increasing the steepness of transition while eliminating a manageable degree of low-amplitude structures. The seemingly contradictive effect is achieved in an optimization framework making use of L 0 gradient minimization, which can globally control how many non-zero gradients are resulted in to approximate prominent structure in a sparsity-control manner. Unlike other edge-preserving smoothing approaches, our method do… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
18
0

Year Published

2012
2012
2024
2024

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 15 publications
(18 citation statements)
references
References 0 publications
0
18
0
Order By: Relevance
“…In contrast, results of the L 0 -Smoothing always have smooth variations, which can only be avoided at considerable increase of run time. Also, [21] approximates (1) worse and worse when increasing the edge set penalization . This leads to artifacts such failing to get rid of small scale structures (grass) despite an overall smooth solution.…”
Section: Real-time Unsupervised Image Segmentationmentioning
confidence: 95%
See 4 more Smart Citations
“…In contrast, results of the L 0 -Smoothing always have smooth variations, which can only be avoided at considerable increase of run time. Also, [21] approximates (1) worse and worse when increasing the edge set penalization . This leads to artifacts such failing to get rid of small scale structures (grass) despite an overall smooth solution.…”
Section: Real-time Unsupervised Image Segmentationmentioning
confidence: 95%
“…The L 0 -Smoothing Approach of Xu et al For the piecewise constant case, Xu et al [21] recently proposed a fast approximating method. Assuming the image domain has been discretized into a finite rectangular grid, again denoted by ⌦, the piecewise constant Mumford-Shah limit corresponds to L 0 penalization of the gradient:…”
Section: Related Workmentioning
confidence: 99%
See 3 more Smart Citations