status of the hough cw search code - plans for s2 -
DESCRIPTION
Status of the Hough CW search code - Plans for S2 -. A.M. Sintes, B. Krishnan, M.A. Papa Universitat de les Illes Balears, Spain Albert Einstein Institut, Germany. LSC Meeting Hannover, August 2003 LIGO-G030517-00-Z. Outline. The hierarchical Hough search. Pipeline for S2 - PowerPoint PPT PresentationTRANSCRIPT
Status of the Hough CW search code- Plans for S2 -
A.M. Sintes, B. Krishnan, M.A. Papa
Universitat de les Illes Balears, Spain
Albert Einstein Institut, Germany
LSC Meeting
Hannover, August 2003
LIGO-G030517-00-Z
LSC Meeting, August‘03, A.M. Sintes
Outline
The hierarchical Hough search. Pipeline for S2
Statistics of the Hough maps. Frequentist analysis
Code statusResults on simulated & H1 data
LSC Meeting, August‘03, A.M. Sintes
The concept of the Hough transform
– The idea is to perform a search over the total observation time using an incoherent (sub-optimal) method:
We propose to search for evidence of a signal whose frequency is changing over time in precisely the pattern expected for some one of the parameter sets
– The method used is the Hough transform
t
f
{,,f0,fi}
LSC Meeting, August‘03, A.M. Sintes
Hierarchical Hough transform strategy
Set upper-limit
Pre-processing
Divide the data set in N chunks
raw data GEO/LIGO
Construct set of short FT (tSFT)
Coherent search (,fi)
in a frequency band
Template placing
Incoherent search
Hough transform(f0, fi)
Peak selection in t-f plane
Candidates
selection
Candidates
selection
LSC Meeting, August‘03, A.M. Sintes
The time-frequency pattern
• SFT data
• Demodulated data
Time at the SSB for a given sky position
) ˆ ˆ ( ) ( ) ( ) (0N n t t F t f
kk
Nk tTfftF )()( ˆ00
c
NtxttT
N
ˆ)()(ˆ
kkk Fff N̂
n̂
kF
kf
c
txtTkF
c
tvtTFtFt
k
kNk
k
kNk
)()(
)()()()(
1
ˆˆ0
nc
t vt f t f t fˆ
) () ( ) ( ) (0 0
LSC Meeting, August‘03, A.M. Sintes
Incoherent Hough search:Pipeline for S2
Set upper-limit
Pre-processing
Divide the data set in N chunksraw data
GEO/LIGO
Construct set of short FT (tSFT<1800s)
Incoherent search
Hough transform(f0, fi)
Peak selection in t-f plane
Candidates
selection
LSC Meeting, August‘03, A.M. Sintes
Peak selection in the t-f plane
Input data: Short Fourier Transforms (SFT) of time series (Time baseline: 1800 sec, calibrated)
For every SFT, select frequency bins i such
exceeds some threshold
time-frequency plane of zeros and ones
p(|h, Sn) follows a 2 distribution with 2 degrees of freedom:
The false alarm and detection probabilities for a threshold are
SFTin
i
i
ii )T(fS
)(fx
)(fn
)(fx 2
2
2 |~|
|~|
|~|
SFTin
i
SFTin
ii )T(fS
)(fh
)T(fS
)(fh 22
2 |~
|21
|~
|1
d),|(),|(,d),0|()|(0
0
0
00 nnnn ShpSheSpS
(f)h(f)n(f)x~~~
LSC Meeting, August‘03, A.M. Sintes
Hough statistics
• After performing the HT using N SFTs, the probability that the pixel {,,f0,fi} has a number count n is given by a binomial distribution:
• The Hough false alarm and false dismissal probabilities for a threshold n0
Candidates selection
)1(,
)1(),|(
2 pNpNpn
ppn
NNpnP
n
nNn
presentsignal
absentsignal
p
1
00
0
0
0
)1(),,(
)1(),,(
n
n
nNnH
N
nn
nNnH
n
NNn
n
NNn
LSC Meeting, August‘03, A.M. Sintes
Frequentist Analysis
• Perform the Hough transform for a set of points in parameter space ={,,f0,fi} S , given the data:
HT: S N n(
• Determine the maximum number count n*n* = max (n( S
• Determine the probability distribution p(n|h0) for a range of h0
30% 90%
LSC Meeting, August‘03, A.M. Sintes
Frequentist Analysis
• Perform the Hough transform for a set of points in parameter space ={,,f0,fi} S , given the data:
HT: S N n(
• Determine the maximum number count n*n* = max (n( S
• Determine the probability distribution p(n|h0) for a range of h0
• The 95% frequentist upper limit h095% is the value such that for repeated trials with a signal
h0 h095%, we would obtain n n* more than 95% of the time
N
nn
%
n|hp*
95
00.95
•Compute p(n|h0) via Monte Carlo signal injection, using S , and 0
[0,2], [-/4,/4], cos [-1,1].
LSC Meeting, August‘03, A.M. Sintes
Code Status
Stand-alone search code in final phase Test and validation codes (under CVS at AEI) Hough routines are part of the LAL library:
LSC Meeting, August‘03, A.M. Sintes
Code Status II
Auxiliary functions C-LAL compliant (under CVS at AEI to be incorporated into LAL or LALApps):– Read SFT data– Peak Selection (in white & color noise)– Statistical analysis of the Hough maps– Compute <v(t)>
Under development:– Implementation of an automatic handling of noise features.
Robust PSD estimator. – Monte Carlo signal injection analysis code.– Condor submission job.– Input search parameter files
LSC Meeting, August‘03, A.M. Sintes
Validation code-Signal only case- (f0=500 Hz)
• bla
LSC Meeting, August‘03, A.M. Sintes
Validation code-Signal only case- (f0=500 Hz)
LSC Meeting, August‘03, A.M. Sintes
Signal only case II
LSC Meeting, August‘03, A.M. Sintes
Signal only case II
LSC Meeting, August‘03, A.M. Sintes
Results on simulated data
Statistics of the Hough maps
f0~300Hz
tobs=60days
N=1440 SFTs
tSFT=1800s =0.2231
<n> = N=321.3074
n=(N(1-))=15.7992
LSC Meeting, August‘03, A.M. Sintes
Noise only case
LSC Meeting, August‘03, A.M. Sintes
Number count probability distribution
1440 SFTs
1991 maps
58x58 pixels
LSC Meeting, August‘03, A.M. Sintes
Comparison with a binomial distribution
LSC Meeting, August‘03, A.M. Sintes
Set of upper limit. Frequentist approach.
95 %
N
nn
%
n|hp*
95
00.95
n*=395 =0.295
h095%
LSC Meeting, August‘03, A.M. Sintes
1887 Calibrated SFT’s H1
TSFT = 1800s, Band : 263-268 Hz
H1 Analysis – the SFTs
26 SFT, 0.95 or 1.05
LSC Meeting, August‘03, A.M. Sintes
H1 Results 264-265 Hz
Input: 1861 SFT
0.5x0.5 srad
Output: 19811 maps
(51x51 sky locations)
N=1861 SFTs =0.2019
Mean number count=373.8130
<n> = N=375.7294
n=(N(1-))=17.3168
LSC Meeting, August‘03, A.M. Sintes
H1 Results 264-265 Hz“upper limit estimate”
Loudest event n*=473
95%
n*
95 % upper limit
n*=473 =0.2715
220
2
22
50
3|
~|4
/105.5
SFTi
Hzin
Th)(fh
)(fS
22
)46.0(|
~|
SFTin
i
)T(fS
)(fh
h095% ~ 5x10-23 ?
Very preliminary