Dynamic Visual Search Using Inner-Scene Similarity: Algorithms and Inherent Limitations

Abstract. A dynamic visual search framework based mainly on innerscene similarity is proposed. Algorithms as well as measures quantifying the difficulty of search tasks are suggested. Given a number of candidates (e.g. sub-images), our basic hypothesis is that more visually similar candidates are more likely to have the same identity. Both deterministic and stochastic approaches, relying on this hypothesis, are used to quantify this intuition. Under the deterministic approach, we suggest a measure similar to Kolmogorov's -covering that quantifies the difficulty of a search task and bounds the performance of all search algorithms. We also suggest a simple algorithm that meets this bound. Under the stochastic approach, we model the identities of the candidates as correlated random variables and characterize the task using its second order statistics. We derive a search procedure based on minimum MSE linear estimation. Simple extensions enable the algorithm to use top-down and/or bot...

• Type: Conference
• Year: 2004
• Where: ECCV
• Authors: Tamar Avraham, Michael Lindenbaum
• Keywords: Computer Vision, Correlated Random Variables, ECCV 2004, MSE Linear Estimation, Search Task, Similar Candidates, Visual Search Framework