• The Journal of the Acoustical Society of Korea
• /
• v.38 no.6
• /
• pp.716-723
• /
• 2019

Fingerprint matching accuracy is essential in deploying a music search service. This paper deals with a method to improve fingerprint matching accuracy by utilizing an auxiliary information which is called power weight. Power weight is an expected robustness of each hash bit. While the previous power mask binarizes the expected robustness into strong and weak bits, the proposed method utilizes a real-valued function of the expected robustness as weights for fingerprint matching. As a countermeasure to the increased storage cost, we propose a compression method for the power weight which has strong temporal correlation. Experiments on the publicly-available music datasets confirmed that the proposed power weight is effective in improving fingerprint matching performance.

• Journal of Information Processing Systems
• /
• v.14 no.5
• /
• pp.1237-1253
• /
• 2018

Harmony search algorithm is an emerging meta-heuristic optimization algorithm, which is inspired by the music improvisation process and can solve different optimization problems. In order to further improve the performance of the algorithm, this paper proposes an improved harmony search algorithm. Key parameters including harmonic memory consideration (HMCR), pitch adjustment rate (PAR), and bandwidth (BW) are optimized as the number of iterations increases. Meanwhile, referring to the genetic algorithm, an improved method to generate a new crossover solutions rather than the traditional mechanism of improvisation. Four complex function optimization and pressure vessel optimization problems were simulated using the optimization algorithm of standard harmony search algorithm, improved harmony search algorithm and exploratory harmony search algorithm. The simulation results show that the algorithm improves the ability to find global search and evolutionary speed. Optimization effect simulation results are satisfactory.

• Proceedings of the KOSOMBE Conference
• /
• v.1997 no.11
• /
• pp.75-78
• /
• 1997

In this paper we present new sound spectral analysis methods or prosthetic heart valve sounds. Phonocardiograms(PCG) of prosthetic heart valve were analyzed in order to derive frequency domain feature suitable or the classification of the valve state. The fast orthogonal search method and MUSIC (MUltiple SIgnal Classification) method are described or finding the significant frequencies in PCG. The fast orthogonal search method is effective with short data records and cope with noisy, missing and unequally-spaced data. MUSIC method's key to the performance is the division of the information in the autocorrelation matrix or the data matrix into two vector subspaces, one a signal subspace and the other a noise subspace.

• Structural Engineering and Mechanics
• /
• v.29 no.4
• /
• pp.391-410
• /
• 2008

In this article, a harmony search algorithm is presented for optimum design of steel frame structures. Harmony search is a meta-heuristic search method which has been developed recently. It is based on the analogy between the performance process of natural music and searching for solutions of optimization problems. The design algorithms obtain minimum weight frames by selecting suitable sections from a standard set of steel sections such as American Institute of Steel Construction (AISC) wide-flange (W) shapes. Stress constraints of AISC Load and Resistance Factor Design (LRFD) and AISC Allowable Stress Design (ASD) specifications, maximum (lateral displacement) and interstorey drift constraints, and also size constraint for columns were imposed on frames. The results of harmony search algorithm were compared to those of the other optimization algorithms such as genetic algorithm, optimality criterion and simulated annealing for two planar and two space frame structures taken from the literature. The comparisons showed that the harmony search algorithm yielded lighter designs for the design examples presented.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.5
• /
• pp.637-644
• /
• 2011

Being digitalized, the music can be easily purchased and delivered to the users. However, there is still some difficulty to find the music which fits to someone's taste using traditional music information search based on musician, genre, tittle, album title and so on. In order to reduce the difficulty, the contents-based or the emotion-based music retrieval has been proposed and developed. In this paper, we propose new method to determine the importance of MPEG-7 low-level audio descriptors which are multi-dimensional vectors for the emotion-based music retrieval. We measured the mutual similarities of musics which represent a pair of emotions expressed by opposite meaning in terms of each multi-dimensional descriptor. Then rough approximation, and inter- and intra similarity ratio from the similarity relation are used for determining the importance of a descriptor, respectively. The set of weights based on the importance decides the aggregated similarity measure, by which emotion-based music retrieval can be achieved. The proposed method shows better result than previous method in terms of the average number of satisfactory musics in the experiment emotion-based retrieval based on content-based search.

• The Journal of the Acoustical Society of Korea
• /
• v.37 no.6
• /
• pp.518-524
• /
• 2018

The cover song refers to live recordings or reproduced albums. This paper studies two-dimensional Fourier transform as a feature-dimension reduction method to search cover song fast. The two-dimensional Fourier transform is conducive in feature-dimension reduction for cover song search due to musical-key invariance. This paper extends the previous work, which only utilize the magnitude of the Fourier transform, by introducing an invariant from phase based on the assumption that adjacent frames have the same musical-key change. We compare the cover song retrieval accuracy of the Fourier-transform based methods over two datasets. The experimental results show that the addition of the invariant from phase improves the cover song retrieval accuracy over the previous magnitude-only method.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.2
• /
• pp.218-223
• /
• 2011

Various research studies are underway to explore music classification by genre. Because sound professionals define the criterion of music to categorize differently each other, those classification is not easy to come up clear result. When a new genre is appeared, there is onerousness to renew the criterion of music to categorize. Therefore, music is classified by emotional adjectives, not genre. We classified music by light and shade in precedent study. In this paper, we propose the music classification system that is based on emotional adjectives to suitable search for atmosphere, and the classification criteria is three kinds; light and shade in precedent study, intense and placid, and grandeur and trivial. Variance Considered Machines that is an improved algorithm for Support Vector Machine was used as classification algorithm, and it represented 85% classification accuracy with the result that we tried to classify 525 songs.

• Journal of Korea Water Resources Association
• /
• v.33 no.S1
• /
• pp.3-10
• /
• 2000

A newly developed heuristic algorithm, Harmony Search, is applied to the parameter calibration problem of the nonlinear Muskingum model. The Harmony Search could, mimicking the improvisation of music player, find better parameter values for in the nonlinear Muskingum model than five other methods including another heuristic method, genetic algorithm, in the aspect of SSQ(the sum of the square of the deviations between the observed and routed outflows) as well as in the aspects of SAD(the sum of the absolute value of the deviations), DPO(deviations of peak of routed and actual flows) and DPOT(deviatios of peak time of routed and actual outflow). Harmony Search also has the advantage that it does not require the process of asuming the initial values of desing parameters. The sensitivity analysis of Harmony Memory Considering Rate showed that relatively large values of Harmony Memory Considering Rate makes the Harmony Search converge to a better solution.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2000.05a
• /
• pp.3-10
• /
• 2000

A newly developed heuristic algorithm, Harmony Search, is applied to the parameter calibration problem of the nonlinear Muskingum model. The Harmony Search could, mimicking the improvisation of music players, find better parameter values for in the nonlinear Muskingum model than five other methods including another heuristic method, genetic algorithm, in the aspect of SSQ (the sum of the square of the deviations between the observed and routed outflows) as well as in the aspects of SAD (the sum of the absolute value of the deviations), DPO (deviations of peak of routed and actual flows) and DPOT (deviations of peak time of rented and actual outflow). Harmony Search also has the advantage that it does not require the process of assuming the initial values of design parameters. The sensitivity analysis of Harmony Memory Considering Rate showed that relatively large values of Harmony Memory Considering Rate makes the Harmony Search converse to a better solution.

• The Journal of the Acoustical Society of Korea
• /
• v.36 no.2
• /
• pp.144-150
• /
• 2017

Musical genre is indispensible in constructing music information retrieval system, such as music search and classification. In general, the spectral characteristics of a music signal are obtained based on a subband decomposition to represent the relative distribution of the harmonic and the non-harmonic components. In this paper, we investigate the subband decomposition parameters in extracting features, which improves musical genre classification accuracy. In addition, the linear projection methods are studied to reduce the resulting feature dimension. Experiments on the widely used music datasets confirmed that the subband decomposition finer than the widely-adopted octave scale is conducive in improving genre-classification accuracy and showed that the feature-dimension reduction is effective reducing a classifier's computational complexity.