Undersea localization requires a computationally expensive partial differential equation simulation to test each candidate hypothesis location via matched filter. We propose a method of batch testing that effectively yields a test sequence output of random combinations of location-specific matched filter correlations, such that the computational run time varies with the number of tests instead of the number of locations. We show that by finding the most likely location that could have accounted for these batch test outputs, we are able to perform almost as well as if we had computed each location's matched filter. In particular, we show that we can reliably resolve the target's location up to the resolution of incoherence using only logarithmically many measurements when the number of candidate locations is less than the dimension of the matched filter. In this way, our random mask pattern not only performs substantially the same as cleverly designed deterministic masks in c...
William Mantzel, Justin K. Romberg, Karim Sabra