mine detection, dynamic programming, convex set, global optimization, coarse-to-fine
We demonstrate a three stage procedure for mine detection. The first phase locates plausible candidates through a series of hypothesis tests. The second state finds the globally optimal convex set containing each candidate using "coarse-to-fine" dynamic programming. The third stage refines the mine shape estimates using the knowledge contained in a mine-shape library.
Detection and Remediation Technologies for Mines and Minelike Targets II, SPIE Vol. 3079, Proceedings of SPIE. A.C. Dubey and R.L. Barnard, Editors