Journal article
Efficient blind search: Optimal power of detection under computational cost constraints
- Abstract:
-
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 int...
Expand abstract
- Publication status:
- Published
Actions
Authors
Bibliographic Details
- Journal:
- Annals of Applied Statistics
- Volume:
- 3
- Issue:
- 1
- Pages:
- 38-60
- Publication date:
- 2007-12-11
- DOI:
- EISSN:
-
1941-7330
- ISSN:
-
1932-6157
- Source identifiers:
-
97832
Item Description
Terms of use
- Copyright date:
- 2007
- Notes:
-
Published in at http://dx.doi.org/10.1214/08-AOAS180 the Annals of
Applied Statistics (http://www.imstat.org/aoas/) by the Institute of
Mathematical Statistics (http://www.imstat.org)
If you are the owner of this record, you can report an update to it here: Report update to this record