• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.6
• /
• pp.1583-1591
• /
• 1998

In this paper, we consider the quasi maximum likelihood(quasi-ML) detector which uses antenna arrays in asynchronous time-varing channels. It is shown that the proposed quasi-ml detector can be regarded as a beamformer followed by a decorrelator: a method based on the eigendecomposition of the correlation matrix of the inverse-filtered signal is proposed to estimate the channel vectors. We also show that the proposed algorithm estimates the channel vector within small mismatch loss in severe propagation environment through computer simulations.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.23-30
• /
• 2002

본 연구는 추가제약이 있는 최소 신장나무 문제(Constrained Minimum Spanning Tree : CMST문제)에 대한 유사다항시간 알고리듬 및 근사 해법 개발에 관한 것이다. CMST문제는 NP-hard문제임이 이미 증명되었으며, 이후 이 문제에 대해서는 근사해법 개발이 주된 관심이 되어왔다 [Ravi and Goemans 96]는 다항시간 근사 해법(PTAS)을 이미 개발하였고, [Marathe et at 98]은 가능해(feasible solution)는 아니지만, 앞으로 서술할 $(1+1/\varepsilon,\;+\epsilon)$사해를 구하는 완전다항시간 근사해법 (FPTAS)을 제시하였다. 이와는 달리 [Papa. and Yan, 00]는 파레토 근사 최적해를 구하는 FPTAS를 제시하였는데, 본 연구는 이들의 연구에서 주로 의존하고 있는 행렬-나무 정리(Tree-Matrix Theorem)를 보다 일반화하여, CMST문제에 대한 유사다항시간 알고리듬과 $(1+\varepsilon,\;1+\epsilon)$근사해를 구하는 FPTAS를 제시할 것이다.

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

• Journal of Broadcast Engineering
• /
• v.21 no.6
• /
• pp.920-928
• /
• 2016

Recently high dynamic range imaging technique is hot issue in computer graphic area. We present a progressive tone mapping algorithm, which is based on weighted least squares optimization framework. Our approach combines weighted least squares filtering with iCAM06 model. To show more perceptual high dynamic range images in conventional display, we decompose high dynamic range image into base layers and detail layers. The base layers are obtained by using weighted least squares filter. Then, we adopt chromatic adaption function and non-linear compression function to deal with base layers. Only the base layers reduce contrast, and preserving detail. The image quality assessment shows that our tone mapped image is more similar to original high dynamic range image. Moreover, the subjective result shows our algorithm produces more reliable and pleasing image.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2005.11a
• /
• pp.106-109
• /
• 2005

산업화와 더불어 자동화의 요구에 따라 여러 분야에서 유도전동기의 응용 사례가 늘어나고 있다. 본 연구는 인버터단의 전류센서에서 실시간 얻어진 전류신호로 부터 대표적인 전기, 기계적인 4가지 고장(Bearing Fault, Broken Rotor bar, Misalignment, Unbalance)을 검출하여 예기치 못한 고장에 대비할 수 있는 실시간 진단 알고리듬을 제시한다. 실시간 진단의 핵심요소인 동기화 방법으로서 Hilbert Transform을 응용하였다. 총 40세트의 정상 모터 데이터를 임의로 선택하여 두 데이터의 차를 이용하여 0에 근사한 정상 모터 뎀플릿 값을 설정하였다. 이를 이용하여 진단 대상 전동기의 고장 유무를 미리 판단하게 된다. 만약 기준치 이상의 오차가 나타나게 되면, 이와 비교하기 위한 미리 수집된 각4가지 고장 전동기의 미소신호 템플릿 데이터와의 유사성을 비교하여 고장의 종류를 표시하며, 고장의 종류가 진단되지 않은 대상은 고장 유무만 표시된다.

• Journal of KIISE:Software and Applications
• /
• v.35 no.7
• /
• pp.417-423
• /
• 2008

In this paper we present a probabilistic method for source separation in the case here each source has a certain temporal structure. We tackle the problem of source separation by maximum pseudo-likelihood estimation, representing the latent function which characterizes the temporal structure of each source by a random process with a Gaussian prior. The resulting pseudo-likelihood of the data is Gaussian, determined by a mixing matrix as well as by the predictive mean and covariance matrix that can easily be computed by Gaussian process (GP) regression. Gradient-based optimization is applied to estimate the demixing matrix through maximizing the log-pseudo-likelihood of the data. umerical experiments confirm the useful behavior of our method, compared to existing source separation methods.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.12
• /
• pp.3762-3774
• /
• 2000

The advances of computer hardware and information processing technologies raise the needs of multimedia information retrieval systems. Up to date. multimedia information systems have been developed for text information and image information. Nowadays. the multimedia information systems for video and audio information. especially for musical information have been grown up more and more. In recent music information retrieval systems. not only the information retrieval based on meta-information such like composer and title but also the content-based information retrieval is supported. The content-based information retrieval in music information retrieval systems utilize the similarity value between the user query and the music information stored in music database. In tbis paper. hence. we developed a similarity computation algorithm in which the pitches and lengths of each corresponding pair of notes are used as the fundamental factors for similarity computation between musical information. We also make an experiment of the proposed algorithm to validate its appropriateness. From the experimental results. the proposed similarity computation algorithm is shown to be able to correctly check whether two music files are analogous to each other or not based on melodies.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.6
• /
• pp.681-691
• /
• 2017

In the clutter environment, it is necessary to update the target tracking filter by detecting the target signal among many measured value data obtained via the radar system, the track does not diverge, and tracking performance is maintained. The method of associating the measurement most relevant to the target track among numerous measurement values is referred to as data association. PSNF and PSNF-m are data association methods of SN-series. In this paper, we provide an IPSNF-m(Integrated Probabilistic Strongest Neighbor Filter-m) algorithm with a track management method based on the track existence probability in PSNF-m algorithm. This algorithm considers not only the presence of the target but also the case where the target is present but not detected. Calculating the probability of each caseenables efficient management. In order to verify the performance of the proposed IPSNF-m, the track existence probability of the IPSNF algorithm applying the track management technique to PSNF, which is known to have similar performance to PSNF-m, is derived. Through simulation in the same environment, we compare and analyze the proposed algorithm with RMSE, Confirmed True Track, and Track Existence Probability that show better performance in terms of track retention and estimation than the existing PSNF-m and IPSNF algorithms.

• Geophysics and Geophysical Exploration
• /
• v.18 no.2
• /
• pp.74-84
• /
• 2015

To yield physically meaningful images through elastic reverse-time migration, the wavefield separation which extracts P- and S-waves from reconstructed vector wavefields by using elastic wave equation is prerequisite. For expanding the application of the elastic reverse-time migration to anisotropic media, not only the anisotropic modelling algorithm but also the anisotropic wavefield separation is essential. The anisotropic wavefield separation which uses pseudo-derivative filters determined according to vertical velocities and anisotropic parameters of elastic media differs from the Helmholtz decomposition which is conventionally used for the isotropic wavefield separation. Since applying these pseudo-derivative filter consumes high computational costs, we have developed the efficient anisotropic wavefield separation algorithm which has capability of parallel computing by using GPUs (Graphic Processing Units). In addition, the highly efficient anisotropic elastic reverse-time migration algorithm using MPI (Message-Passing Interface) and incorporating the developed anisotropic wavefield separation algorithm with GPUs has been developed. To verify the efficiency and the validity of the developed anisotropic elastic reverse-time migration algorithm, a VTI elastic model based on Marmousi-II was built. A synthetic multicomponent seismic data set was created using this VTI elastic model. The computational speed of migration was dramatically enhanced by using GPUs and MPI and the accuracy of image was also improved because of the adoption of the anisotropic wavefield separation.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.28 no.2
• /
• pp.125-132
• /
• 2004

In this paper, we propose a new two-stage segmentation method for the effective object recognition which uses region-growing algorithm and k-means clustering method. At first, an image is segmented into many small regions via region growing algorithm. And then the segmented small regions are merged in several regions so that the regions of an object may be included in the same region using typical k-means clustering method. This paper also establishes similarity measurement which is useful for object recognition in an image. Similarity is measured by fuzzy system whose input variables are compactness, magnitude of biasness and orientation of biasness of the object image, which are geometrical features of the object. To verify the effectiveness of the proposed two-stage segmentation method and similarity measurement, experiments for object recognition were made and the results show that they are applicable to object recognition under normal circumstance as well as under abnormal circumstance of being.