• Journal of Multimedia Information System
• /
• v.9 no.1
• /
• pp.69-72
• /
• 2022

Extraction of a salient chromagram is utmost important for cover song identification. Cover song refers to a live performance, a remix, or a new recording of a previously recorded track. This paper utilizes the Savitzky-Golay filters in chromagram extraction for suppressing timber-related components of a music signal, which is not preserved while generating cover songs. By removing the timber-related components, the discriminative tonal components, which are conducive for cover song identification, are emphasized in chromagram. Experiments on cover song identification over two datasets show that the Savitzky-Golay filters are more effective in reducing timber effects in chromagram than other types of filters.

• The Journal of the Acoustical Society of Korea
• /
• v.38 no.3
• /
• pp.314-319
• /
• 2019

Computing chromagram similarity is indispensable in constructing cover song identification system. This paper proposes a code-based chromagram similarity to reduce the computational and the storage costs for cover song identification. By learning a song-specific codebook, a chromagram sequence is converted into a code sequence, which results in the reduction of the feature storage cost. We build a lookup table over the learned codebooks to compute chromagram similarity efficiently. Experiments on two music datasets were performed to compare the proposed code-based similarity with the conventional one in terms of cover song search accuracy, feature storage, and computational cost.

• The Journal of the Acoustical Society of Korea
• /
• v.43 no.2
• /
• pp.200-206
• /
• 2024

Computing music similarity is an indispensable component in developing music search service. This paper proposes a relevance weight of each chromagram vector for cover song identification in computing a music similarity function in order to boost identification accuracy. We derive a music similarity function using the relevance weight based on the probabilistic relevance model, where higher relevance weights are assigned to less frequently-occurring discriminant chromagram vectors while lower weights to more frequently-occurring ones. Experimental results performed on two cover music datasets show that the proposed music similarity improves the cover song identification performance.

• The Journal of the Acoustical Society of Korea
• /
• v.41 no.6
• /
• pp.662-667
• /
• 2022

Computing music similarity is an indispensable component in developing music search service. This paper focuses on learning a music similarity function in order to boost cover song identification performance. By using the probabilistic linear discriminant analysis, we construct a latent music space where the distances between cover song pairs reduces while the distances between the non-cover song pairs increases. We derive a music similarity function by testing hypothesis, whether two songs share the same latent variable or not, using the probabilistic models with the assumption that observed music features are generated from the learned latent music space. Experimental results performed on two cover music datasets show that the proposed music similarity improves the cover song identification performance.

• International journal of advanced smart convergence
• /
• v.4 no.2
• /
• pp.84-93
• /
• 2015

This study is for the development of Cover Glass Grinding Processing System. This system is developed for manufacturing a mass product system grinding cover glasses with highly precise mechanism, and we improved resulted quality. In the development process, we developed a complete process technology through mechanical design, image processing technology, spindle control, mark identification algorithm etc. With this cover glass grinding development, we could developed process technology, image processing technology, organization mechanisms and control algorithms.

• 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.

• The Journal of the Acoustical Society of Korea
• /
• v.36 no.6
• /
• pp.436-441
• /
• 2017

Computing music similarity is indispensable in constructing music retrieval system. This paper focuses on the cover song search among various music-retrieval tasks. We investigate the cover song search method based on the chroma n-gram to reduce storage for feature DB and enhance search accuracy. Specifically we propose t-tab n-gram, n-gram selection method, and n-gram set comparison method. Experiments on the widely used music dataset confirmed that the proposed method improves cover song search accuracy as well as reduces feature storage.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.07a
• /
• pp.258-260
• /
• 2011

이 논문에서는 쿼리-바이-싱잉/허밍 (Query-by-singing/humming, QbSH) 시스템 또는 커버 노래 인식 (cover song identification) 시스템에서 사용 가능한 멜로디 유사도를 제안한다. QbSH 또는 커버 노래 인식은 디지털 음악의 사용이 보편화되면서 음악 검색의 방법으로 많은 연구가 진행되어 오고 있다. 멜로디 유사도는 이런 시스템을 구현하는데 필수적인 요소이며, 두 개의 음악에서 멜로디가 추출되었다고 가정하고, 추출된 멜로디 사이의 유사한 정도를 수치로 표현한다. QbSh 시스템이나 커버 노래 인식 시스템은 멜로디 유사도에 기반하여 입력 노래와 유사한 노래를 데이터베이스에서 검색하는 작업을 수행한다. 이 논문에서 제안하는 멜로디 유사도 방식은 기존의 많이 연구되던 동적 시간 왜곡 (dynamic time warping, DTW) 방법과 크로마 표현 방법 (chroma representation)을 사용하였다. DTW방법은 비대칭적으로 사용하고 미디 노트 영역에서 표현된 멜로디 특징은 0이상 12 미만의 크로마 레벨로 표현하였다. 기존의 방법에서는 정수값을 많이 사용하였으나 이 논문에서는 실수값을 사용한다. DTW 에 사용하는 거리 함수를 기존에 사용하던 차이의 절대값 대신 꺾인 함수 형태를 사용함으로써 성능을 높였다. QbSH 시스템에서의 실험을 통해서 성능을 검증하였다. 본 논문에서는 10-12초 길이의 1000번의 쿼리(Query)에 대해서 28시간 정도의 데이터베이스에서 실험한 결과, 순위 역의 평균 (Mean reciprocal rank, MRR) 값이 0.713을 보였다.

• Journal of the Korean Society of Environmental Restoration Technology
• /
• v.25 no.4
• /
• pp.33-47
• /
• 2022

Wild boars(Sus scrofa) are expanding their range of behavior as their habitats change. Appearing in urban centers and private houses, it caused various social problems, including damage to crops. In order to prevent damage and effectively manage wild boars, there is a need for ecological research considering the characteristics and movement characteristics of wild boars. The purpose of this study is to analyze home range and identify land cover types in key areas through tracking wild boars, and to predict the movement connectivity of wild boars in consideration of previous studies and their preferred land use characteristics. In this study, from January to June 2021, four wild boars were captured and tracked in Jinju city, Gyeongsangnam-do, and the preferred land cover type of wild boars was identified based on the MCP 100%, KDE 95%, and KDE 50% results. As a result of the analysis of the home range for each individual, it was found that 100% of MCP was about 0.68km², 2.77km², 2.42km², and 0.16km², and the three individuals overlapped the home range, refraining from habitat movement and staying in the preferred area. The core areas were analyzed as about 0.55km², 2.05km², 0.82km², and 0.14km² with KDE 95%., and about 0.011km², 0.033km², 0.004km², and 0.003km² with KDE 50%. When the preferred land cover type of wild boar was confirmed based on the results of analysis of the total home range area and core area that combined all individuals, forests were 55.49% (MCP 100%), 54.00% (KDE 95%), 77.69% (KDE 50%), respectively, with the highest ratio, and the urbanization area, grassland, and agricultural area were relatively high. A connectivity scenario was constructed in which the ratio of the land cover type preferred by the analyzed wild boar was reflected as a weight for the resistance value of the connectivity analysis, and this was compared with the connectivity evaluation results analyzed based on previous studies and wild boar characteristics. When the current density values for the wild boar movement data were compared, the average value of the existing scenario was 2.76, the minimum 1.12, and the maximum 4.36, and the weighted scenario had an average value of 2.84, the minimum 0.96, and the maximum 4.65. It was confirmed that, on average, the probability of movement predictability was about 2.90% better even though the weighted scenario had movement restrictions due to large resistance values. It is expected that the identification of the movement route through the movement connectivity analysis of wild boars can be suggested as an alternative to prevent damage by predicting the point of appearance. In the future, when analyzing the connectivity of species including wild boar, it is judged that it will be effective to use movement data on actual species.

• The KIPS Transactions:PartA
• /
• v.18A no.4
• /
• pp.151-158
• /
• 2011

For the purpose of cost saving and sales promotion, various industry companies have introduced logistics management techniques in their field. However, enterprises faced to damages because proper products can not be provided to customers in basic logistics 3S1L(speedy, safely, surely, and low) principles for environments changing rapidly and inflexible business processes. So, we need the ability in coping with risk to handle this phenomenon. In particular, the shipper of key decisions of supply chain risk management requires continuous exchange and collection of logistics information in the third-party logistics. However the current SCRMS(Supply Chain Risk Management System) is not sufficient to cover the shipper's various needs and to recognize and respond to emergency situations. Therefore, this paper proposes an active SCRMS framework through the reconsideration about the previous research on SCRM and rearrangement of risk factors for coping with those problems. in addition, it verifies an efficiency through a stability comparison with the current system.