Figure 2.

Illustration of the diamond search procedure: starting from the previous target position (bold circle), successive LDSP iterations (1–3) are computed with the best match of each shaded gray. Once the center location remains the best match (shaded “2” remained best match on iteration 3), the SDSP locations (4) are tested and the best match is the new estimate of the target's position (bold square).