Abstract | ||
---|---|---|
We construct an algorithm to split an image into a sum u + v of a bounded variation component and a component containing the textures and the noise. This decomposition is inspired from arecent work of Y. Meyer. We find this decomposition by minimizing a convex functional which depends on the two variables u and v, alternatively in each variable. Each minimization is based on a projection algorithm to minimize the total variation. We carry out the mathematical study of our method. We present some numerical results. In particular, we show how the u component can be used in nontextured SAR image restoration. |
Year | DOI | Venue |
---|---|---|
2003 | 10.1007/3-540-44935-3_21 | Scale-Space |
Keywords | Field | DocType |
arecent work,image decomposition application,projection algorithm,total variation,y. meyer,variables u,nontextured sar image restoration,sum u,mathematical study,bounded variation component,u component,convex function,speckle,texture,classification,bounded variation | Synthetic aperture radar,Minification,Minimisation (psychology),Artificial intelligence,Image restoration,Bounded variation,Discrete mathematics,Computer vision,Dykstra's projection algorithm,Algorithm,Regular polygon,Numerical analysis,Mathematics | Conference |
Volume | ISSN | ISBN |
2695 | 0302-9743 | 3-540-40368-X |
Citations | PageRank | References |
18 | 2.48 | 5 |
Authors | ||
4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Jean-François Aujol | 1 | 1176 | 82.39 |
Gilles Aubert | 2 | 1275 | 108.17 |
Laure Blanc-Féraud | 3 | 536 | 63.97 |
Antonin Chambolle | 4 | 2842 | 184.45 |