Taut-String Algorithm and Regularization Programs with G-Norm Data Fit

In this paper we derive a unified framework for the taut-string algorithm and regularization with G-norm data fit. The G-norm data fit criterion (popularized in image processing by Y. Meyer) has been paid considerable interest in regularization models for pattern recognition. The first numerical wor...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of mathematical imaging and vision Ročník 23; číslo 2; s. 135 - 143
Hlavní autor: Scherzer, Otmar
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer Nature B.V 01.09.2005
Témata:
Algorithms
Image processing
Pattern recognition
Regularization
Strings
ISSN:0924-9907, 1573-7683
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this paper we derive a unified framework for the taut-string algorithm and regularization with G-norm data fit. The G-norm data fit criterion (popularized in image processing by Y. Meyer) has been paid considerable interest in regularization models for pattern recognition. The first numerical work based on G-norm data fit has been proposed by Osher and Vese. The taut-string algorithm has been developed in statistics (Mammen and van de Geer and Davies and Kovac) for denoising of one dimensional sample data of a discontinuous function. Recently Hinterberger et al. proposed an extension of the taut-string algorithm to higher dimensional data by introducing the concept of tube methods. Here we highlight common features between regularization programs with a G-norm data fit term and taut-string algorithms (respectively tube methods). This links the areas of statistics, regularization theory, and image processing.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0924-9907
1573-7683
DOI:10.1007/s10851-005-6462-1