Title: Multiscale Analysis for Intensity and Density Estimation
1Multiscale Analysis for Intensity and Density
Estimation
- Rebecca Willetts MS Defense
- Thanks to Rob Nowak, Mike Orchard,
- Don Johnson, and Rich Baraniuk
- Eric Kolaczyk and Tycho Hoogland
2Poisson and Multinomial Processes
3Why study Poisson Processes?
Network analysis
Medical Imaging
4Multiresolution Analysis
Examining data at different resolutions (e.g.,
seeing the forest, the trees, the leaves, or the
dew)
yields different information about the structure
of the data.
Multiresolution analysis is effective because it
sees the forest (the overall structure of the
data)
without losing sight of the trees (data
singularities)
5Beyond Wavelets
- Multiresolution analysis is a powerful tool, but
what about - Edges?
- Nongaussian noise?
- Inverse problems?
- Piecewise polynomial- and platelet- based methods
address these issues.
Non-Gaussian problems? Image Edges? Inverse
problems?
6Computational Harmonic Analysis
- Define Class of Functions to Model Signal
- Piecewise Polynomials
- Platelets
- Derive basis or other representation
- Threshold or prune small coefficients
- Demonstrate near-optimality
7Approximating Besov Functions with Piecewise
Polynomials
8Approximation with Platelets
Consider approximating this image
9E.g. Haar analysis
10Wedgelets
Haar Wavelet Partition
Original Image
Wedgelet Partition
11E.g. Haar analysis with wedgelets
Terms 1164, Params 1164
12E.g. Platelets
Terms 510, Params 774
13Error Decay
14Platelet Approximation Theory
- Error decay rates
- Fourier O(m-1/2)
- Wavelets O(m-1)
- Wedgelets O(m-1)
- Platelets O(m-min(a,b))
15(No Transcript)
16A Piecewise Constant Tree
17A Piecewise Linear Tree
18Maximum Penalized Likelihood Estimation
Goal Maximize the penalized likelihood
So the MPLE is
19The Algorithm
Data
20Algorithm in Action
21Penalty Parameter
Penalty parameter balances between fidelity to
the data (likelihood) and complexity
(penalty). g 0 ? Estimate is MLE g
?? ? Estimate is a constant
22Penalization
23Density Estimation - Blocks
24Density Estimation - Heavisine
25Density Estimation - Bumps
26Density Estimation Simulation
27Medical Imaging Results
28Inverse Problems
- Goal estimate m from observations
- x Poisson(Pm)
- EM algorithm
- (Nowak and Kolaczyk, 00)
29Confocal Microscopy An Inverse Problem
30Platelet Performance
31Confocal Microscopy Real Data
32Hellinger Loss
- Upper bound for affinity
- (like squared error)
- Relates expected error to Lp approximation bounds
33Bound on Hellinger Risk
(follows from Li Barron 99)
34Bounding the KL
- We can show
- Recall approximation result
- Choose optimal d
35Near-optimal Risk
- Maximum risk within logarithmic factor of minimum
risk - Penalty structure effective
36Conclusions
- CHA with Piecewise
- Polynomials or Platelets
- Effectively describe Poisson or multinomial data
- Strong approximation capabilites
- Fast MPLE algorithms for estimation and
reconstruction - Near-optimal characteristics
37Future Work
Major Contributions
- Risk analysis for piecewise polynomials
- Platelet representations and approximation theory
- Shift-invariant methods
- Fast algorithms for wedgelets and platelets
- Risk Analysis for platelets
38Approximation Theory Results
39Why dont we just find the MLE?
40MPLE Algorithm (1D)
41Multiscale Likelihood Factorization
- Probabilistic analogue to orthonormal wavelet
decomposition - Parameters ? ? wavelet coefficients
- Allow MPLE framework, where penalization based on
complexity of underlying partition
42Poisson Processes
- Goal Estimate spatially varying function,
l(i,j), from observations of Poisson random
variables x(i,j) with intensities l(i,j) - MLE of l would simply equal x. We will use
complexity regularization to yield smoother
estimate.
43Complexity Regularization
Penalty for each constant region ? results in
fewer splits Bigger penalty for each polynomial
or platelet region ? more degrees of freedom, so
more efficient to store constant if likely
44Astronomical Imaging