Edge-preserving smoothing by convex minimization

S. Z. Li, Y. H. Huang, J. S. Fu, K. L. Chan

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

This work presents a new approach for analyzing the problem of edge-preserving image smoothing using convex minimization and for selecting smoothing parameters. The close-form (global) solution is derived as the response of a convex smoothing model to the ideal step edge. Insights into how the minimal solution responds to edges in the data and how the parameter values affect resultant edges in the solution are drawn from the analytic expression of the close-form solution. Based on this, a scheme is proposed for selecting parameters to achieve desirable response at edges.

Original languageEnglish
Title of host publicationComputer Vision - ACCV 1998 - 3rd Asian Conference on Computer Vision, Proceedings
EditorsRoland Chin, Ting-Chuen Pong
PublisherSpringer Verlag
Pages746-753
Number of pages8
ISBN (Print)3540639306, 9783540639305
DOIs
StatePublished - 1997
Externally publishedYes
Event3rd Asian Conference on Computer Vision, ACCV 1998 - Hong Kong, China
Duration: 08 01 199810 01 1998

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1351
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference3rd Asian Conference on Computer Vision, ACCV 1998
Country/TerritoryChina
CityHong Kong
Period08/01/9810/01/98

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1997.

Fingerprint

Dive into the research topics of 'Edge-preserving smoothing by convex minimization'. Together they form a unique fingerprint.

Cite this