Optimizing Random Patterns for Invariants-Based Identi cation

This paper addresses the optimization of pseudo-random planar point patterns for invariant-based identiication or indexing. This is a novel problem and is formulated here as the maximization of the spacing of all the invariants when considered as points in a space. The task is of formidable complexity and a stochastic approximation strategy is proposed that yields interesting results.