Detection of streaks of faint space objects_Berenkov

Слайд 2

Introduction

A problem of joint detection and estimation of parameters of faint space

Introduction A problem of joint detection and estimation of parameters of faint
object streaks in digital images (frames) is considered.
Approaches implementing signal thresholding and further grouping of detections in “hot” pixels gives unsatisfactory results due to a considerable increase in the number of false detections.
Generalized Likelihood Ratio Hypothesis Test (GLRT) requires testing of a huge number of hypotheses associated with an unknown number of objects and parameters of their streaks, which is problematic for frames of large sizes even with a supercomputer.
Аn effective two-stage algorithm for detecting faint streaks is proposed.
First stage: a sequential change detection method is used to detect abrupt changes and localize the object position.
Second stage: maximal likelihood test is used to estimate more precisely the position of the streak in the selected direction.

Слайд 3

Models of signals

Streak of the space object
is determined by the vector

Models of signals Streak of the space object is determined by the

Streak motion model

- signal from one object in pixel of the frame

- exposure time

- signal “amplitude”

- position in the frame (for a unit of length for each coordinate, the pixel size in the corresponding direction is taken)

- Point Spread Function (PSF)

- Gaussian noise with zero mean and known (estimated empirically) local variance (after preprocessing)

Background clutter will be suppressed after preprocessing. Discuss it later.

Слайд 4

- no streaks in the search area

- the streak exists in the

- no streaks in the search area - the streak exists in
search area with certain position and amplitude

The problem (joint detection & estimation)

The problem is to make a decision which of two hypotheses is valid and estimate unknown position

Hypotheses

Слайд 5

– model profile values (calculated in advance)

Sliding window rule (Moving average

– model profile values (calculated in advance) Sliding window rule (Moving average
test)

),

Algorithm: Stage 1 – Localization

– length and width (depends on

The following maximin problem statement is the most suitable for streak detection:

in class

The solution of this optimality problem is open.

CONJECTURE: The proposed test is asymptotically nearly optimal for goes to 0.

Слайд 6

Maximal likelihood method

Find:

for minimization

(New search area after stage 1)

Algorithm: Stage

Maximal likelihood method Find: for minimization (New search area after stage 1)
2 – Position estimation

After the stage 2 position of streak will be estimated up to 1-2 pixels

Слайд 7

Simulation

Algorithm was tested in solving the real problem of detecting streaks in

Simulation Algorithm was tested in solving the real problem of detecting streaks
digital frames taken with a telescope, situated at the equator.
The search area is bounded by a rectangle with a width of several tens of pixels and located in the middle of the frame.
The first stage of the algorithm solves the problem of finding the most suitable directions and the approximate location of the streak on each of them inside the search area.
The second stage of the algorithm makes a decision about the right direction and estimation of the streak position.
Using simulated frames 1000x500 in size with white Gaussian noise and streaks (length = 50px), the dependence of the standard deviation on SNR was obtained.
Probability of detection (PD) = 0.9 – 0.95 when FA = 0.001 (down to SNR = 1)

Слайд 8

Simulation: real frames

When operating with real frames it is crucial to get

Simulation: real frames When operating with real frames it is crucial to
rid of strong discrete clutter generated by stars and background.
The simplest method of clutter suppression is subtraction of two sequential frames, which however leads to an increase in noise variance.

– input image model

– background estimation as a linear combination

Input frame

Frame after regression

L – space memory
T – number of frames

Spatiotemporal regression is proposed as a proper method for image whitening:

Слайд 9

Simulation: spatiotemporal regression:

Detection probability (PD) as function of probability of false

Simulation: spatiotemporal regression: Detection probability (PD) as function of probability of false
alarm (PFA), SNR = 0.5.

50 ms

300 ms

When FA = 0.005, SD = 7-10 px (length = 60px)

Слайд 10

Conclusion and future work

We proposed an effective two-stage algorithm which significantly reduces

Conclusion and future work We proposed an effective two-stage algorithm which significantly
the number of hypotheses that have to be tested and the time of processing compared to the popular GLRT.
Testing showed that the algorithm is capable of detecting streaks of space objects and accurately estimating their parameters with a signal-to-noise ratio near 1 both on simulated frames and on real data.
The algorithm also showed good results in detection of faint streaks (down to SNR = 0.5) on real frames after background clutter suppression using spatiotemporal regression approach.
In the future, it is planned to test the algorithm using other clutter filtering methods, as well as compare our trace detection approach with, for instance, Radon transform.

Слайд 11

Acknowledgements

I am grateful to Alexey E. Kolessa and Alexander G. Tartakovsky for

Acknowledgements I am grateful to Alexey E. Kolessa and Alexander G. Tartakovsky
setting the problem, useful discussions and support.
Имя файла: Detection-of-streaks-of-faint-space-objects_Berenkov.pptx
Количество просмотров: 37
Количество скачиваний: 0