| P. Charbonnier, L. Blanc-Feraud, G. Aubert and M. Barlaud: Deterministic edge-preserving regularization in computed imaging. In IEEE Transaction on Image Processing, vol. 6 (2): 298-311,1997. |
....not exist, since the penalty function could be non convex for fl 1. In practice, iterative algorithms are often used to solve this problem. Examples of such algorithms are the stochastic [13] and deterministic annealing (mean field annealing) 20] graduated nonconvexity [19] ARTUR algorithm [21] or its generalization [22] However, it should be noted that for the particular case of fl = 1, a closed form solution in wavelet domain exists: it is known as soft shrinkage ( 23] 14] Of course, it is preferable to obtain the closed form solution for the analysis of the obtained estimate. To ....
P.Charbonnier, L.Blanc-Feraud, G.Aubert, M.Barlaud: Deterministic EdgePreserving Regularization in Computed Images, IEEE Trans. on Image Processing, 1997, Vol.6, No.2, pp.298-311.
No context found.
P. Charbonnier, L. Blanc-Feraud, G. Aubert and M. Barlaud: Deterministic edge-preserving regularization in computed imaging. In IEEE Transaction on Image Processing, vol. 6 (2): 298-311,1997.
No context found.
P. Charbonnier, L. Blanc-Feraud, G. Aubert and M. Barlaud: Deterministic edge-preserving regularization in computed imaging. In IEEE Transaction on Image Processing, vol. 6 (2): 298-311,1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC