Applying the Independent Component Analysis for the estimation of an upper bound of the expressiveness of basic audio features commonly used in algorithms for computing music similarity Research Proposal
ثبت نشده
چکیده
Many different methods for automatic retrieval of music similarity have been proposed. There are a number of low-level descriptors that are widely used as a basis for comparison algorithms. Although the different authors usually have different sets of songs to evaluate the algorithms and there usually is no exhaustive user evaluation, which makes the comparison between the different algorithms difficult, it seems that the expressiveness of the algorithms is somehow limited. The question that arises is, if this upper bound exists, or if the set of basic descriptors are sufficient to describe music exhaustively for computing similarity between different pieces of music.
منابع مشابه
Implementation of the direction of arrival estimation algorithms by means of GPU-parallel processing in the Kuda environment (Research Article)
Direction-of-arrival (DOA) estimation of audio signals is critical in different areas, including electronic war, sonar, etc. The beamforming methods like Minimum Variance Distortionless Response (MVDR), Delay-and-Sum (DAS), and subspace-based Multiple Signal Classification (MUSIC) are the most known DOA estimation techniques. The mentioned methods have high computational complexity. Hence using...
متن کاملClassification of Iranian Traditional Music Dastgahs Using Features Based on Pitch Frequency
The Iranian traditional music is composed of seven majors Dastgahs: Chahargah, Homayoun, Mahour, Segah, Shour, Nava, and Rast-Panjgah. In this paper, a new algorithm for the classification of the Iranian traditional music Dastgahs based on pitch frequency is proposed. In this algorithm, the features of Lagrange coefficients of pitch logarithm (LCPL), Fuzzy similarity sets type 2 (FSST2), and th...
متن کاملAsymptotic algorithm for computing the sample variance of interval data
The problem of the sample variance computation for epistemic inter-val-valued data is, in general, NP-hard. Therefore, known efficient algorithms for computing variance require strong restrictions on admissible intervals like the no-subset property or heavy limitations on the number of possible intersections between intervals. A new asymptotic algorithm for computing the upper bound of the samp...
متن کاملPLASTIC ANALYSIS OF PLANAR FRAMES USING CBO AND ECBO ALGORITHMS
In rigid plastic analysis one of the most widely applicable methods that is based on the minimum principle, is the combination of elementary mechanisms which uses the upper bound theorem. In this method a mechanism is searched which corresponds to the smallest load factor. Mathematical programming can be used to optimize this search process for simple fra...
متن کاملIndependent Component Analysis for Music Similarity Computation
In the recent years, a number of publications have appeared that deal with automatically calculating the similarity of music tracks. Most of them are based on features that are not intuitively understandable to humans, as they do not have a musically meaningful counterpart, but are merely measures of basic physical properties of the audio signal. Furthermore, most of these algorithms do not tak...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004