Bernoulli trials based feature selection for crater detection
Liu, Siyi and Cohen, Joseph Paul and Ding, Wei and Simovici, Dan and Stepinski, Tomasz

bernoullitrial.pdf 2.38MB
Type: Paper
Tags:

Bibtex:
@inproceedings{liu2011bernoulli,
  title={Bernoulli trials based feature selection for crater detection},
  author={Liu, Siyi and Ding, Wei and Cohen, Joseph Paul and Simovici, Dan and Stepinski, Tomasz},
  booktitle={Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems},
  pages={461--464},
  year={2011},
  organization={ACM},
	abstract = {Counting craters is a fundamental task of planetary sci-ence because it provides the only tool for measuring relativeages of planetary surfaces. However, advances in surveyingcraters present in data gathered by planetary probes havenot kept up with advances in data collection. One chal-lenge of auto-detecting craters in images is to identify an images features that discriminate it between craters andother surface objects. The problem of optimal feature se-lection is known to be NP-hard and the search is compu-tationally intractable. In this paper we propose a wrapperbased randomized feature selection method to efficiently se-lect relevant features for crater detection. We design andimplement a dynamic programming algorithm to search fora relevant feature subset by removing irrelevant features andminimizing a cost objective function simultaneously. In or-der to only remove irrelevant features we use Bernoulli Tri-als to calculate the probability of such a case using the costfunction. Our proposed algorithms are empirically evaluatedon a large high-resolution Martian image exhibiting a heav-ily cratered Martian terrain characterized by heterogeneoussurface morphology. The experimental results demonstratethat the proposed approach achieves a higher accuracy thanother existing randomized approaches to a large extent withless runtime.}
}
Hosted by users
10 day statistics (1 downloads)
Average Time 38 mins, 35 secs
Average Speed 1.03kB/s
Best Time 38 mins, 35 secs
Best Speed 1.03kB/s
Worst Time 38 mins, 35 secs
Worst Speed 1.03kB/s

Send Feedback Start
   0.000007
DB Connect
   0.000368
Lookup hash in DB
   0.000349
Get torrent details
   0.000121
Get torrent details, finished
   0.000200
Get authors
   0.000001
Select authors
   0.000196
Parse bibtex
   0.000062
Write header
   0.000180
get stars
   0.000095
home tab
   0.000104
render right panel
   0.000005
render ads
   0.000313
fetch current hosters
   0.000222
Start get stats
   0.000404
End get stats
   0.000001
related datasets
   0.000889
Done