Edge-preserving image reconstruction can be performed by minimizing appropriate cost functionals in which image intensity and discontinuities are explicitly referred. Equivalent and less expensive reconstructions can be obtained by using a class of functionals that only depend on the image intensity and have been shown to implicitly refer to an underlying discontinuity process. We analyze the performances of two of these functionals and show that Graduated Non-Convexity (GNC) algorithms permit a further reduction of the computational costs if compared with Simulated Annealing algorithms, commonly used in non-convex optimization.
Non-convex optimization for image reconstruction with implicitly referred discontinuities
Salerno E;Tonazzini A
1993
Abstract
Edge-preserving image reconstruction can be performed by minimizing appropriate cost functionals in which image intensity and discontinuities are explicitly referred. Equivalent and less expensive reconstructions can be obtained by using a class of functionals that only depend on the image intensity and have been shown to implicitly refer to an underlying discontinuity process. We analyze the performances of two of these functionals and show that Graduated Non-Convexity (GNC) algorithms permit a further reduction of the computational costs if compared with Simulated Annealing algorithms, commonly used in non-convex optimization.| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_413413-doc_145541.pdf
solo utenti autorizzati
Descrizione: Non-convex optimization for image reconstruction with implicitly referred discontinuities
Tipologia:
Versione Editoriale (PDF)
Dimensione
579.85 kB
Formato
Adobe PDF
|
579.85 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.


