A quick search method for multimedia signals using global pruning

The authors propose a new method for quickly searching for a specific audio or video signal to be detected within a long, stored audio or video stream to determine segments that contain signals that are nearly identical to the given signal. The Time-series Active Search (TAS) method is one of the quick search methods that have been proposed previously. This signal searching technique based on histograms extracted from the signals had implemented quick searching by local pruning, that is, omitting comparisons of segments for which searching was unnecessary based on similarities in the vicinity of the matching window. In contrast, the proposed technique implements significantly quicker searching by introducing global pruning, which looks at the entire signal time-series according to histogram classifications based on similarities of the entire signal to eliminate segments that need not be searched, in addition to local pruning. In this paper, the authors present a detailed discussion of the relationship between the degree of global pruning and the accuracy that is guaranteed. For example, the authors showed through experiments that when 128-dimension histograms were classified to 1024 clusters, the proposed technique achieved a search speed approximately 9 times that of TAS while preserving the same degree of accuracy. The preprocessing calculation time increased by approximately 1% of the time for playing the signal. © 2003 Wiley Periodicals, Inc. Syst Comp Jpn, 34(13): 47–58, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.10472

[1]  Howard D. Wactlar,et al.  Informedia - Search and Summarization in the Video Medium , 2000 .

[2]  Hiroshi Murase,et al.  Focused color intersection with efficient searching for object extraction , 1997, Pattern Recognit..

[3]  Rakesh Mohan,et al.  Video sequence matching , 1998, Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181).

[4]  Steve J. Young,et al.  A fast lattice-based approach to vocabulary independent wordspotting , 1994, Proceedings of ICASSP '94. IEEE International Conference on Acoustics, Speech and Signal Processing.

[5]  Trumpington Street,et al.  A FAST LATTICE-BASED APPROACH TO VOCABULARY INDEPENDENT WORDSPOTTING , 1994 .

[6]  Shin'ichi Satoh,et al.  The SR-tree: an index structure for high-dimensional nearest neighbor queries , 1997, SIGMOD '97.

[7]  Salim Roukos,et al.  A fast vocabulary independent algorithm for spotting words in speech , 1998, Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181).

[8]  Hans-Peter Kriegel,et al.  The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.

[9]  Ramesh C. Jain,et al.  Similarity indexing with the SS-tree , 1996, Proceedings of the Twelfth International Conference on Data Engineering.

[10]  Allen Gersho,et al.  Vector quantization and signal compression , 1991, The Kluwer international series in engineering and computer science.

[11]  Kunio Kashino,et al.  Time-series active search for quick retrieval of audio and video , 1999, 1999 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings. ICASSP99 (Cat. No.99CH36258).