Query by humming: musical information retrieval in an audio database
Proceedings of the third ACM international conference on Multimedia
Data structures and algorithms for nearest neighbor search in general metric spaces
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Hierarchical filtering method for content-based music retrieval via acoustic input
MULTIMEDIA '01 Proceedings of the ninth ACM international conference on Multimedia
A comparison of melodic database retrieval techniques using sung queries
Proceedings of the 2nd ACM/IEEE-CS joint conference on Digital libraries
Query by Tapping: A New Paradigm for Content-Based Music Retrieval from Acoustic Input
PCM '01 Proceedings of the Second IEEE Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing
Exact indexing of dynamic time warping
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
A Branch and Bound Algorithm for Computing k-Nearest Neighbors
IEEE Transactions on Computers
| Hi-index | 0.01 |
This paper presents the concept of progressive filtering (PF) and its efficient design based on dynamic programming. The proposed PF is scalable for large music retrieval systems and is data-driven for performance optimization. Moreover, its concept and design are general in nature and can be applied to any multimedia retrieval systems. The application of the proposed PF to a 5-stage query-by-singing/humming (QBSH) system is reported, and the experimental results demonstrate the feasibility of the proposed approach.