Search audio data with the wavelet pyramidal algorithm

Authors:
Ying Li;Yibin Hou
Affiliations:
Computer and Information Institute, Xi'an Jiaotong University, Xi'an, 710049, PR China and School of Information Science and Technology, Fuzhou University, Fuzhou, 350002, PR China;School of Information Science and Technology, Fuzhou University, Fuzhou, 350002, PR China
Venue:
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
Year:
2004

Citing 7
Cited 0

A Theory for Multiresolution Signal Decomposition: The Wavelet Representation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Classification of general audio data for content-based retrieval

Pattern Recognition Letters - Special issue on image/video indexing and retrieval
Content-Based Classification, Search, and Retrieval of Audio

IEEE MultiMedia
Indexing and searching schemes for audio data in audio/multimedia databases

Indexing and searching schemes for audio data in audio/multimedia databases
Hierarchical classification of audio data for archiving and retrieving

ICASSP '99 Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06
Multimedia search and retrieval: new concepts, system implementation, and application

IEEE Transactions on Circuits and Systems for Video Technology
Overview of MPEG-7 audio

IEEE Transactions on Circuits and Systems for Video Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

To solve the problem of query-by-example in multimedia audio data, we analyze the characteristics of wavelet multiresolution, and propose a method for searching audio data using wavelet multiresolution pyramidal algorithm. First, we preprocess 100 audio data files by transforming them into wavelet coefficient files with audio data and query data. And then we search these wavelet coefficient files using the different hierarchy pyramidal algorithms. By comparing our method with the method using wavelet approximate coefficient algorithms, we found that our method is highly efficient and reduces the search time without influencing the retrieval precision.