• DocumentCode
    137208
  • Title

    A modified rough longest common subsequence algorithm for motif spotting in an Alapana of Carnatic Music

  • Author

    Dutta, Suparna ; Murthy, Hema A.

  • Author_Institution
    Comput. Sci. & Eng. Dept., Indian Inst. of Technol. Madras, Chennai, India
  • fYear
    2014
  • fDate
    Feb. 28 2014-March 2 2014
  • Firstpage
    1
  • Lastpage
    6
  • Abstract
    Melody in Carnatic Music is based on the concept of a raga. Characteristic motif is a signature melodic phrase that determines the identity of a raga. This paper addresses locating these motifs in an alapana, given a query motif. A two-step approach approach is employed. The first is to identify the location of snippets of phrases that exists in the Alapana. Next the conventional approach to the rough longest common subsequence algorithm to spot motifs is modified. In the modified algorithm a more appropriate measure of match is proposed. The algorithm is particularly relevant for short but good matches. The modification enables logical choices of empirical parameters. In this paper, the motifs that are chosen are also long compared to our earlier work. The modified RLCS algorithm reduces the number of false alarms from 130 to 94 and also performs better localization of motifs.
  • Keywords
    music; query processing; Alapana; Carnatic Music; RLCS algorithm; modified rough longest common subsequence algorithm; motif spotting; query motif; raga concept; signature melodic phrase; Computer science; Dynamic programming; Equations; Feature extraction; Heuristic algorithms; Rhythm;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communications (NCC), 2014 Twentieth National Conference on
  • Conference_Location
    Kanpur
  • Type

    conf

  • DOI
    10.1109/NCC.2014.6811363
  • Filename
    6811363