METHODS FOR IMAGE RESTORATION - PowerPoint PPT Presentation

1 / 32
About This Presentation
Title:

METHODS FOR IMAGE RESTORATION

Description:

The problem of determining the optimal value of the ... solar chromosphere. A big amount of electromagnetic radiation is emitted in ... – PowerPoint PPT presentation

Number of Views:140
Avg rating:3.0/5.0
Slides: 33
Provided by: Pia50
Category:

less

Transcript and Presenter's Notes

Title: METHODS FOR IMAGE RESTORATION


1
METHODS FOR IMAGE RESTORATION
  • Michele Piana
  • Dipartimento di Informatica
  • Universita di Verona

2
REGULARIZATION ALGORITHM
3
REGULARIZATION ALGORITHMS
A regularization algorith satisfies the
semiconvergence property
4
HEURISTICS
  • There are plenty of choice criterions there is
    no reliable
  • choice criterion
  • Some choice recipe is valid for all
    regularization methods
  • but there are recipes specifically built up for
    a specific
  • regularization method
  • Simulation is the basis for the adoption of a
    selection
  • criterion semiconvergence allows the
    determination of
  • the typical size of the optimal regularization
    parameter
  • for a specific problem

5
SELECTION CRITERIONS
  • Discrepancy principle all regularization
    methods (and
  • even non-linear problems) generalization to
    the case
  • of noisy models general trend oversmoothing
  • Generalized Cross Validation (GCV) typically
    for
  • Tikhonov method generalization to problems
    different
  • than inverse problems general trend
    undersmoothing
  • L-curve typically for Tikhonov method weak
    theoretical
  • basis
  • Semi-heuristic approach analysis of the
    cumulative residuals

6
DISCREPANCY PRINCIPLE
Remarks
generalization to non-linear problems is
straightforward
7
DISCREPANCY PRINCIPLE
8
GENERALIZED CROSS VALIDATION (GCV)
9
GENERALIZED CROSS VALIDATION
Some linear algebra some rotations
GCV find the minimizer of
10
L-CURVE
Warning use the log-log scale!!
Choice criterion the optimal regularization
parameter is the value for which the L-curve has
its corner
11
L-CURVE
Remarks
this is a very heuristic recipe there are cases
where the L-curve is not L-shaped
12
WIENER PROCESSES
is the discretization of a Wiener process
13
REGULARIZATION
Tikhonov regularization and Discrepancy Principle
  • find the one-parameter family of solutions of
    the minimum problem

Heuristic remark the Discrepancy Principle is
oversmoothing
Cumulative residuals
Optimality criterion
14
  • Tikhonov method for the analysis of satellite data

15
MICROSCOPIC VIEW
Bremsstrahlung
  • Accelerated electrons collide against heavy ions
    in the
  • solar chromosphere.
  • The scattered electrons decrease their velocity.
  • A big amount of electromagnetic radiation is
    emitted in
  • the hard X-ray range

16
A BIT OF PHYSICS - I
Collisional bremsstrahlung
The relation between the measured photon spectrum
g(e) and the mean electron flux spectrum F(E) is
described by a Volterra integral equation of the
first kind
17
A BIT OF PHYSICS - II
Advantages
  • Electrons carry more physics than photons
  • Electron flux maps reach energies higher than
    photon maps
  • (thanks to bremsstrahlung)

18
A BIT OF PHYSICS - III
19
A BIT OF PHYSICS - IV
20
THE ALGORITHM - I
  • For each detector and each (u,v) point
  • construct the count visibility spectrum
  • (count visibility vs count energy)

21
THE ALGORITHM - II
(Detector 9 u0.00105 arcsec-1, v0.00252
arcsec-1)
22
THE ALGORITHM - III
  • For each detector and each (u,v) point
  • construct the count visibility spectrum
  • (count visibility vs count energy)
  • apply regularized inversion to obtain an
    electron
  • visibility spectrum (electron visibility vs
    count energy)

23
THE ALGORITHM - IV
  • The regularized solution is computed by means of
    the SVD of A
  • The regularization parameter is fixed by
    analyzing the cumulative
  • residuals
  • The error on the regularized solution is
    assessed by means of
  • the confidence strip

24
THE ALGORITHM - V
  • For each detector and each (u,v) point
  • construct the count visibility spectrum
  • (count visibility vs count energy)
  • apply regularized inversion to obtain an
    electron
  • visibility spectrum (electron visibility vs
    count energy)
  • For each detector and each electron energy
  • construct the electron visibilities

25
THE ALGORITHM - VI
26
THE ALGORITHM - VII
  • For each detector and each (u,v) point
  • construct the count visibility spectrum
  • (count visibility vs count energy)
  • apply regularized inversion to obtain an
    electron
  • visibility spectrum (electron visibility vs
    count energy)
  • For each detector and each electron energy
  • construct the electron visibilities
  • For each electron energy
  • apply some Fourier-based imaging method
  • to construct the electron flux map

27
10-14 keV
14-18 keV
18-22 keV
22-26 keV
28
26-30 keV
30-34 keV
34-38 keV
38-42 keV
29
42-46 keV
46-50 keV
50-54 keV
54-58 keV
30
58-62 keV
62-66 keV
66-70 keV
70-74 keV
31
74-78 keV
78-82 keV
32
POWER OF THE METHOD
  • Spatially integrated electron spectroscopy
  • Spatially resolved electron spectroscopy
Write a Comment
User Comments (0)
About PowerShow.com