Wedgelets: nearly minimax estimation of edges

Donoho, David L.

Ann. Statist., Tome 27 (1999) no. 4, p. 859-897 / Harvested from Project Euclid

Résumé

We study a simple “horizon model” for the problem of recovering an image from noisy data; in this model the image has an edge with $\alpha$-Hölder regularity. Adopting the viewpoint of computational harmonic analysis, we develop an overcomplete collection of atoms called wedgelets, dyadically organized indicator functions with a variety of locations, scales and orientations. The wedgelet representation provides nearly optimal representations of objects in the horizon model, as measured by minimax description length. We show how to rapidly compute a wedgelet approximation to noisy data by finding a special edgelet-decorated recursive partition which minimizes a complexity-penalized sum of squares. This estimate, using sufficient subpixel resolution, achieves nearly the minimax mean-squared error in the horizon model. In fact, the method is adaptive in the sense that it achieves nearly the minimax risk for any value of the unknown degree of regularity of the horizon, $1 \leq \alpha \leq 2$. Wedgelet analysis and denoising may be used successfully outside the horizon model. We study images modelled as indicators of star-shaped sets with smooth boundaries and show that complexity-penalized wedgelet partitioning achieves nearly the minimax risk in that setting also.

Détail

Publié le : 1999-06-14
Classification:  Minimax estimation,  edges,  edgels,  edgelets,  fast algorithms,  complexity penalized estimates,  recursive partitioning,  subpixel resolution,  oracle inequalities,  62G07,  62C20,  62G20,  41A30,  41A63