Comparison Of Modified Dual Ternary Indexing And Multi-Key Hashing Algorithms For Music Information Retrieval
Rajeswari Sridhar, A. Amudha, S. Karthiga, Geetha T V (Anna, University-Chennai, India)

TL;DR
This paper compares modified dual ternary indexing and multi-key hashing algorithms for music retrieval, focusing on Carnatic music, and finds multi-key hashing offers faster retrieval and better recall.
Contribution
It introduces a modified dual ternary algorithm for Carnatic music and compares it with a novel multi-key hashing approach for indexing and retrieval.
Findings
Multi-key hashing has lower time complexity.
Multi-key hashing achieves higher recall.
Modified dual ternary performs segmentation for Carnatic music.
Abstract
In this work we have compared two indexing algorithms that have been used to index and retrieve Carnatic music songs. We have compared a modified algorithm of the Dual ternary indexing algorithm for music indexing and retrieval with the multi-key hashing indexing algorithm proposed by us. The modification in the dual ternary algorithm was essential to handle variable length query phrase and to accommodate features specific to Carnatic music. The dual ternary indexing algorithm is adapted for Carnatic music by segmenting using the segmentation technique for Carnatic music. The dual ternary algorithm is compared with the multi-key hashing algorithm designed by us for indexing and retrieval in which features like MFCC, spectral flux, melody string and spectral centroid are used as features for indexing data into a hash table. The way in which collision resolution was handled by this hash…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
