The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Content-Based Video Indexing and Retrieval
IEEE MultiMedia
Query by humming: musical information retrieval in an audio database
Proceedings of the third ACM international conference on Multimedia
Efficient repeating pattern finding in music databases
Proceedings of the seventh international conference on Information and knowledge management
Content-based retrieval of MP3 music objects
Proceedings of the tenth international conference on Information and knowledge management
A New Indexing Scheme for Content-Based Image Retrieval
Multimedia Tools and Applications
Dynamic maintenance of data distribution for selectivity estimation
The VLDB Journal — The International Journal on Very Large Data Bases
OVID: Design and Implementation of a Video-Object Database System
IEEE Transactions on Knowledge and Data Engineering
An Object-Oriented Conceptual Modeling of Video Data
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
Modelling and Querying Video Data
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Hi-index | 0.00 |
This paper addresses the development of a system that detects plagiarism based on similar melody searching. Similar melody searching is to find the melodies similar to a given query melody from a music database. For this purpose, we propose a novel similarity model that supports alignment as well as shifting. Also, we suggest a method for indexing the features extracted from every melody, and a method for processing plagiarism detection by using the index. With our plagiarism detection system, composers can easily search for the melodies similar to their ones from music databases. Through performance evaluation via a series of experiments, we show the effectiveness of our approach. The results reveal that our approach outperforms the sequential-scan-based one in speed up to around 31 times.