• The Journal of the Korea Contents Association
• /
• v.14 no.2
• /
• pp.28-38
• /
• 2014

For western music there has been a volume of researches on music information analysis for automatic transcription or content-based music retrieval. But it is hard to find the similar research on Korean traditional music. In this paper we propose several algorithms to automatically analyze the structure of Korean traditional music 'Pansori'. The proposed algorithm automatically distinguishes between the 'sound' part and 'speech' part which are named 'sori' and 'aniri', respectively, using the ratio of phonetic and pause time intervals. For rhythm called 'jangdan' classification the algorithm makes the robust decision using the majority voting process based on template matching. Also an algorithm is suggested to detect the bar positions in the 'sori' part based on Kalman filter. Every proposed algorithm in the paper works so well enough for the sample music sources of 'Pansori' that the results may be used to automatically transcribe the 'Pansori'.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.9 no.6
• /
• pp.735-745
• /
• 1998

The method of moments has been widely used in the analysis of TM scattering problems. Recently, significant advances in the development of fast and efficient techniques for solving large problems have been reported. In such methods, iterative matrix solvers are preferred by virtue of their speed and low memory requirements. But for near resonant and strong multiple scattering problems, e.g., involving an aircraft engine inlet, a large number of iterations is required for convergence. In this paper, an efficient approximate inverse based preconditioner is used to reduce this number of iterations. By using the matrix partitioning method, the computational is used to reduce this number of iterations. By using the matrix partitioning method, the computational cost for obtaining the approximate inverse is reduced to O(N). We apply this preconditioner to an O(NlogN) algorithm, the multilevel fast multipole algorithm, for the aircraft engine inlet problem. The numerical results show the efficiency of this preconditioner.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.5
• /
• pp.509-517
• /
• 2001

Full-search algorithm requires large amount of computation which causes time delay or very complex hardware architecture for real time implementation. In this paper, we propose a fast motion estimator based on bit-plane matching, which reduce the computational complexity and the hardware cost. In the proposed motion estimator, the conventional motion estimation algorithms are applied to the binary images directly extracted from the video sequence. Furthermore, in the proposed VLSI motion estimator, we employ a Pair of processing cores that calculate the motion vector continuously By controlling the data flow in a systolic fashion using the internal shift registers in the processing cores, we avoid using SRAM (local memory) so that we remove the time overhead for accessing the local memory and adopt lower-cost fabrication technology. We modeled and tested the proposed motion estimator in VHDL, and then synthesized the whole system which has been integrated in a 0.6-$\mu$m triple-metal CMOS chip of size 8.15 X 10.84$\textrm{mm}^2$.

• The Journal of the Acoustical Society of Korea
• /
• v.22 no.8
• /
• pp.703-710
• /
• 2003

Because of their human-like synthesized speech quality, recently Corpus-Based Text-To-Speech(CB-TTS) have been actively studied worldwide. However, due to their large size speech database (DB), their application is very restricted. In this paper we propose and evaluate three DB reduction algorithms to which are designed to solve the above drawback. The first method is based on a K-means clustering approach, which selects k-representatives among multiple instances. The second method is keeping only those unit instances that are selected during synthesis, using a domain-restricted text as input to the synthesizer. The third method is a kind of hybrid approach of the above two methods and is using a large text as input in the system. After synthesizing the given sentences, the used unit instances and their occurrence information is extracted. As next step a modified K-means clustering is applied, which takes into account also the occurrence information of the selected unit instances, Finally we compare three pruning methods by evaluating the synthesized speech quality for the similar DB reduction rate, Based on perceptual listening tests, we concluded that the last method shows the best performance among three algorithms. More than this, the results show that the last method is able to reduce DB size without speech quality looses.

• 한국지구물리탐사학회:학술대회논문집
• /
• 2005.05a
• /
• pp.281-286
• /
• 2005

This paper presents sensitivity analysis of generalized rapid relaxation inversion (GRRI) algorithm for inverting controlled-source audio-frequency magnetotelluric (CSAMT) data. The algorithm was originally developed by modifying the RRI algorithm to recover a two-dimensional (2-D) conductivity structure of the Earth from MT data, but can be extended to include CSAMT data if it is combined with 2.5-D forward modeling. These GRRI approximate sensitivities are validated by comparison with exact 1-D and 2.5-D sensitivities. The comparison shows that the GRRI sensitivity is a good approximation to the exact sensitivity and has about half magnitude of the RRI sensitivity. Although the magnitude of the GRRI sensitivity is still slightly larger than that of the 2.5-D sensitivity, both sensitivities are broadly similar in shape when source-receiver offsets are greater than one skin depth on the Earth.

• Journal of Broadcast Engineering
• /
• v.4 no.1
• /
• pp.76-85
• /
• 1999

The degradation of image quality by block loss is more serious in fractal coded images with the error propagation due to mapping from the lost blocks than in DCT coded images. Therefore. a new algorithm is presented for recovering the blocks lost in the transmission through the lossy network as A TM network of the images coded by Jacquins fractal coding. Jacquins fractal code is divided into two layers of header code and main code according to its importance. The key technique of the proposed BLRA (block loss recovery algorithm) is a fractal extrapolation that estimates the lost pixels by using the contractive mapping parameters of the neighboring range blocks whose characteristics are similar to a lost block. The proposed BLRA is applied to the lost blocks in the iteration of decoding. Some experimental results show the proposed BLRA yields excellent performance in PSNR as well as subjective quality.

• The Journal of the Acoustical Society of Korea
• /
• v.23 no.8
• /
• pp.570-575
• /
• 2004

In the underwater acoustic systems. we can receive signals and retrieve information about a target by using a beamforming method. The most important thing in the beamforming is finding the way to optimize the mainlobe beamwidth and the sidelobe level to the desired value. One of the prominent results of beamforming method. which has been studied. is Philip's weighting function method(1) . Philip's method adaptively adjusts its weights of array to meet the desired mainlobe beamwidth and sidelobe level. It is very similar to the design method in adaptive filter. However. this method cannot easily bring us to the desired sidelobe level due to complementary relation between mainlobe beamwidth and sidelobe level. In this paper, we propose a new algorithm using partial constrained adaptation. This method makes us circumvent the above problem and meet the specification of design easily. The proposed algorithm presents a Pattern synthesis that designer can easily control the mainlobe beamwidth and the sidelobe level to the desired value while calculation time to converge is decreasing.

• The Journal of Engineering Geology
• /
• v.18 no.3
• /
• pp.245-255
• /
• 2008

The variation of the electrical property of embankment material was analyzed from laboratory experiments and the result of field survey, in order to enhance the interpretation of electrical resistivity survey frequently used for safety assessment of embankment. At first, the kaolinite, showing similar physical property with core material of embankment, was used to examine the variation of the resistivity value according to degree of consolidation. The test showed that a drop of shear strength induces increase of resistivity value regardless of degree of water content. This result means that porous zones of weak core material in embankment may be appeared as highly resistive part in the electrical resistivity survey. This observation implies that it may fail to detect weak core material by electrical method, if we only try to and zones showing low resistivity value. And, we performed Standard Penetration Test (SPT) to analyze the correlation between electrical property and ground stiffness. Finally, a mechanism to describe the variation of electrical resistivity due to grouting effect was proposed and real field data were analyzed.

• Journal of Intelligence and Information Systems
• /
• v.22 no.4
• /
• pp.1-18
• /
• 2016

Collaborative Filtering (CF) predicts the focal user's preference for particular item based on user's preference rating data and recommends items for the similar users by using them. It is a popular technique for the personalization in e-commerce to reduce information overload. However, it has some limitations including sparsity and scalability problems. In this paper, we use a method to integrate social network information into collaborative filtering in order to mitigate the sparsity and scalability problems which are major limitations of typical collaborative filtering and reflect the user's qualitative and emotional information in recommendation process. In this paper, we use a novel recommendation algorithm which is integrated with collaborative filtering by using Social SVD++ algorithm which considers social network information in SVD++, an extension algorithm that can reflect implicit information in singular value decomposition (SVD). In particular, this study will evaluate the performance of the model by reflecting the real-world user's social network information in the recommendation process.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.11A
• /
• pp.1872-1879
• /
• 2001

As multiview video applications become more popular, correspondence problem for stereo image matching plays an important role in expanding view points. Thus, we propose an efficient dense disparity estimation algorithm considering features of each image pair of multiview image sets. Main concepts of the proposed algorithm are based on the region-dividing-bidirectional-pixel-matching method. This algorithm makes matching process efficient and keeps the reliability of the estimated disparities. Other improvement have obtained by proposed cost function, matching window expanding technique, disparity regularization, and disparity assignment in ambiguous region. These techniques make disparities more stable by removing false disparities and ambiguous regions. The estimated disparities are used to synthesize intermediate views of multiview images. Computer simulation demonstrates the excellence of the proposed algorithm in both subjective and objective evaluations. In addition, processing time is reduced as well.