s'authentifier
version française rss feed
Fiche concise
Fast Poisson Noise Removal by Biorthogonal Haar Domain Hypothesis Testing
Zhang B., Fadili J., Starck J. L., Digel S. W.
http://hal.archives-ouvertes.fr/hal-00089890
Versions disponibles :
Informatique/Traitement des images
Statistiques/Théorie
Mathématiques/Statistiques
Fast Poisson Noise Removal by Biorthogonal Haar Domain Hypothesis Testing
Bo Zhang1, Jalal Fadili2, Jean Luc Starck3, Seth Digel4
1 :  AIQ - Analyse d'Images Quantitative
CNRS : URA2582 – Institut Pasteur de Paris
25-28 rue du Docteur Roux F-75724 Paris Cedex 15
France
2 :  GREYC - Groupe de Recherche en Informatique, Image, Automatique et Instrumentation de Caen
http://www.greyc.fr
CNRS : UMR6072 – Université de Caen Basse-Normandie – Ecole Nationale Supérieure d'Ingénieurs de Caen
Boulevard du Maréchal Juin - 14050 CAEN Cedex
France
3 :  SEDI - Service d'Electronique, des Détecteurs et d'Informatique
CEA : DSM/IRFU
France
4 :  SLAC - Stanford Linear Accelerator Center
http://www.slac.stanford.edu
Stanford University
SLAC Stanford University 2575 Sand Hill Rd Menlo Park, CA 94039
États-Unis
image
Methods based on hypothesis tests (HTs) in the Haar domain are widely used to denoise Poisson count data. Facing large datasets or real-time applications, Haar-based denoisers have to use the decimated transform to meet limited-memory or computation-time constraints. Unfortunately, for regular underlying intensities, decimation yields discontinuous estimates and strong "staircase" artifacts. In this paper, we propose to combine the HT framework with the decimated biorthogonal Haar (Bi-Haar) transform instead of the classical Haar. The Bi-Haar filter bank is normalized such that the p-values of Bi-Haar coefficients (pBH) provide good approximation to those of Haar (pH) for high-intensity settings or large scales; for low-intensity settings and small scales, we show that pBH are essentially upper-bounded by pH. Thus, we may apply the Haar-based HTs to Bi-Haar coefficients to control a prefixed false positive rate. By doing so, we benefit from the regular Bi-Haar filter bank to gain a smooth estimate while always maintaining a low computational complexity. A Fisher-approximation-based threshold imple- menting the HTs is also established. The efficiency of this method is illustrated on an example of hyperspectral-source-flux estimation.
Anglais
27/10/2007

Poisson intensity estimation – biorthogonal Haar wavelets – wavelet hypothesis testing – Fisher approximation

Liste des fichiers attachés à ce document : 
TEX
ADAIV_talk_SethDigel_1_Fig1a.eps(29.6 KB)
ADAIV_talk_SethDigel_1_Fig1b.eps(13.9 KB)
ADAIV_talk_SethDigel_1_Fig2a.eps(10.1 KB)
ADAIV_talk_SethDigel_1_Fig2b.eps(9.9 KB)
ADAIV_talk_SethDigel_1_Fig2c.eps(10.5 KB)
ADAIV_talk_SethDigel_1_Fig2d.eps(10.4 KB)
ADAIV_talk_SethDigel_1_Fig2e.eps(10.4 KB)
ADAIV_talk_SethDigel_1_Fig2f.eps(10.9 KB)
ADAIV_talk_SethDigel_1_rev.tex(38.5 KB)
elsart.cls(55.1 KB)
elsart1p.cls(13.3 KB)
ADAIV_talk_SethDigel_1_rev.aux(5.5 KB)
caption.sty(17 KB)
caption3.sty(16.8 KB)
threeparttable.sty(13.2 KB)
caption2.sty(15.7 KB)
PDF
ADAIV_talk_SethDigel_1_rev.pdf(221.1 KB)
PS
ADAIV_talk_SethDigel_1_rev.ps(240.7 KB)