Efficient blind search: Optimal power of detection under computational cost constraints

Details Efficient blind search: Optimal power of detection under computational cost constraints Efficient blind search: Optimal power of detection under computational cost constraints

2007-12-11

arxiv.org/abs/0712.1663v4

Annals of Applied Statistics 2009, Vol. 3, No. 1, 38-60

Statistics

Methodology

Published in at http://dx.doi.org/10.1214/08-AOAS180 the Annals of Applied Statistics (http://www.imstat.org/aoas/) by the Ins

Scientific paper

10.1214/08-AOAS180

Some astronomy projects require a blind search through a vast number of hypotheses to detect objects of interest. The number of hypotheses to test can be in the billions. A naive blind search over every single hypothesis would be far too costly computationally. We propose a hierarchical scheme for blind search, using various "resolution" levels. At lower resolution levels, "regions" of interest in the search space are singled out with a low computational cost. These regions are refined at intermediate resolution levels and only the most promising candidates are finally tested at the original fine resolution. The optimal search strategy is found by dynamic programming. We demonstrate the procedure for pulsar search from satellite gamma-ray observations and show that the power of the naive blind search can almost be matched with the hierarchical scheme while reducing the computational burden by more than three orders of magnitude.

Affiliated with

Also associated with

No associations

Rating

Efficient blind search: Optimal power of detection under computational cost constraints does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Efficient blind search: Optimal power of detection under computational cost constraints, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient blind search: Optimal power of detection under computational cost constraints will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-474213