• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2013.06a
• /
• pp.60-63
• /
• 2013

In this research, a mono-to-stereo upmixing algorithm based on music source separation is proposed. For the upmixing, a harmonic and percussive separation for jazz music is implemented. Then, the sources are re-panned by equalizing the loudness of left and right sides of listeners in the one proposed approach. In the other approach, the harmonic sources are spread by a decorrelator while the percussive sources are panned to the center. In the experiments, the re-panning algorithm showed advanced performance in terms of localization and timbral quality.

• Journal of Positioning, Navigation, and Timing
• /
• v.10 no.2
• /
• pp.131-137
• /
• 2021

The Angle-of-Arrival (AOA) estimation in real time is one of core technologies for the real-time tracking system, such as a radar or a satellite. Although AOA estimation algorithms for various antenna types have been studied, most of them are for the single-shaped array antenna suitable to the specific frequency. In this paper, we propose the cascade AOA estimation algorithm for the combined array antenna with Uniform Rectangular Frame Array (URFA) and Uniform Circular Array (UCA), with the excellent performance for various frequencies. The proposed technique is consisted of Capon for roughly finding AOA groups with multiple signal AOAs and Beamspace Multiple Signal Classification (MUSIC) for estimating the detailed signal AOA in the AOA group, for the combined array antenna. In addition, we provide computer simulation results for verifying the estimation performance of the proposed algorithm.

• Journal of Korea Multimedia Society
• /
• v.11 no.10
• /
• pp.1338-1346
• /
• 2008

In this paper, we propose a new P2P-based music recommendation system. In comparison with previous system in client-server environment, the proposed system shows higher quality of music recommendation through real-time sharing of music preference information between peers. A collaborative filtering is implemented as a recommendation algorithm. As a user preference profile, we use the inherit KID music genre index contained in all legitimate music file instead of music feature vectors as in previous research so that the proposed system can mitigate the performance degradation and high computational load caused by feature inaccuracy and feature extraction. The performance of the proposed system is evaluated in various ways with real 16-weeks transaction data provided by Korean music portal, 5 company and it shows comparative quality of recommendation with only small amount of computational load.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.6 no.1
• /
• pp.84-89
• /
• 2011

Musical sheet recognition is an emerging area as the role of computers in music increases. Although there are several well-known programs for composition, they have a limitation in that they cannot edit or play music generated from other programs. In this paper, we propose an algorithm that can read, recognize, and play music using printed sheets. The proposed algorithm first removes lines using horizontal histogram and extracts symbols. The symbols belong to one of the three categories; notes, rests, and other signs. Notes are recognized using the context information and rests and signs are recognized using a fuzzy ART algorithm. The proposed algorithm were applied to 50 pages of musical sheets and the experimental results showed that it is effective in automatic recognition of musical sheets.

• Journal of KIISE
• /
• v.43 no.2
• /
• pp.204-211
• /
• 2016

In this paper, we propose an automatic melody composition system that can generate a sophisticated melody by adding non-harmony tone in the given chord progression. An overall procedure consists of two steps, which are the rhythm generation and melody generation parts. In the rhythm generation part, we designed new fitness functions for rhythm that can be controlled by a user setting parameters. In the melody generation part, we designed new fitness functions for melody based on harmony theory. We also designed evolutionary operators that are conducted by considering a musical context to improve computational efficiency. In the experiments, we compared four metaheuristics to optimize the rhythm fitness functions: Simple Genetic Algorithm (SGA), Elitism Genetic Algorithm (EGA), Differential Evolution (DE), and Particle Swarm Optimization (PSO). Furthermore, we compared proposed genetic algorithm for melody with the four algorithms for verifying performance. In addition, composition results are introduced and analyzed with respect to musical correctness.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.44 no.11
• /
• pp.137-141
• /
• 2007

This paper proposes a cost-effective architecture design of an angle-of-arrival (AOA) estimator based on the multiple signal identification and classification (MUSIC) algerian in UWB systems adapting Multi-band OFDM (MB-OFDM) techniques with two-receive antennas. In the proposed method, by modifying the equations of algorithm in order to remove the high computational functions, the computation power can be significantly reduced without significant performance degradation. The proposed architecture is designed and verified by Verilog HDL, and implemented into 0.13um CMOS standard cell and Xilinx FPGA circuits for the estimation of hardware complexity and computation power. From the results of the implementations, we can find that the proposed circuits reduces the hardware complexity by about 43% and the estimated computation power by about 23%, respectively, compared to the architecture employing the original MUSIC algorithm.

• The KIPS Transactions:PartD
• /
• v.11D no.3
• /
• pp.495-508
• /
• 2004

Recently, in content-based music information retrieval systems, to enhance the response time of retrieving music data from large music database, some researches have adopted the indexing mechanism that extracts and indexes the representative melodies. The representative melody of music data must stand for the music itself and have strong possibility to use as users' input queries. However, since the previous researches have not considered the musical composition forms, they are not able to correctly catch the contrast, repetition and variation of motif in musical forms. In this paper, we use an index automatically constructed from representative melodies such like first melody, climax melodies and similarly repeated theme melodies. At first, we expand the clustering algorithm in order to extract similarly repeated theme melodies based on the musical composition forms. If the first melody and climax melodies are not included into the representative melodies of music by the clustering algorithm, we add them into representative melodies. We implemented a prototype system and did experiments on comparison the representative melody index with other melody indexes. Since, we are able to construct the representative melody index with the lower storage by 34％ than whole melody index, the response time can be decreased. Also, since we include first melody and climax melody which have the strong possibility to use as users' input query into representative melodies, we are able to get the more correct results against the various users' input queries than theme melody index with the cost of storage overhead of 20％.

• The Journal of Korean Association of Computer Education
• /
• v.8 no.5
• /
• pp.109-118
• /
• 2005

In this paper, we present a music retrieval system that compares the geometric structure of a melody specified by a user with those in a music database. The system finds matches between a query melody and melodies in the database by analyzing both structural and contextual features. The retrieval method is based on the geometric hashing algorithm which consists of two steps; the preprocessing step and the recognition step. During the preprocessing step, we divide a melody into several fragments and analyze the pitch and duration of each note of the fragments to find a structural feature. To find a contextual feature, we find a main chord for each fragment. During the recognition step, we divide the query melody specified by a user into several fragments and search through all fragments in the database that are structurally and contextually similar to the melody. A vote is cast for each of the fragments and the music whose total votes are the maximum is the music that contains a matching melody against the query melody. Using our approach, we can find similar melodies in a music database quickly. We can also apply the method to detect plagiarism in music.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.6
• /
• pp.1167-1173
• /
• 2005

In this paper, the use of an antenna array is considered for code timing acquisition of DS-CDMA signals. The probabilities of acquisition are evaluated by applying multiple narrow fixed-beams to the conventional MUSIC acquisition approach in the multiuser environment on the time-varying Rayleigh fading channel. Each fixed-beam for spatial filtering is dedicated to an individual angular sector that is formed by dividing the entire angular domain by the number of antenna elements. The fixed-beams with a capability of interference suppression provide the additional degrees of freedom,. Hence, the multibeam-based MUSIC estimator can be used to synchronize to more users than the conventional MUSIC algorithm for one antenna. The multibeam-based subspace method is evaluated to significantly improve the performance of a single antenna based MUSIC technique in multiuser scenarios.

• Journal of Internet Computing and Services
• /
• v.16 no.1
• /
• pp.29-37
• /
• 2015

In this paper, we propose a robust pre-processing module for camera-based Optical Music Score Recognition (OMR) on mobile device. The captured images likely suffer for recognition from many distortions such as illumination, blur, low resolution, etc. Especially, the complex background music sheets recognition are difficult. Through any symbol recognition system, the staff line height and staff line space are used many times and have a big impact on recognition module. A robust and accurate staff line height and staff line space are essential. Some staff line height and staff line space are proposed for binary image. But in case of complex background music sheet image, the binarization results from common binarization algorithm are not satisfactory. It can cause incorrect staff line height and staff line space estimation. We propose a robust staff line height and staff line space estimation by using run-length encoding technique on edge image. Proposed method is composed of two steps, first step, we conducted the staff line height and staff line space estimation based on edge image using by Sobel operator on image blocks. Each column of edge image is encoded by run-length encoding algorithm Second step, we detect the staff line using by Stable Path algorithm and removal the staff line using by adaptive Line Track Height algorithm which is to track the staff lines positions. The result has shown that robust and accurate estimation is possible even in complex background cases.