Journal article icon

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


Access Document


Publisher copy:
10.1214/08-AOAS180

Authors


More by this author
Institution:
University of Oxford
Department:
Oxford, MPLS, Statistics
Role:
Author
Journal:
Annals of Applied Statistics
Volume:
3
Issue:
1
Pages:
38-60
Publication date:
2007-12-11
DOI:
EISSN:
1941-7330
ISSN:
1932-6157
URN:
uuid:b47a5913-3758-49da-a792-03d323d5b634
Source identifiers:
97832
Local pid:
pubs:97832
Keywords:

Terms of use


Metrics


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP