• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1993년도 하계학술대회 논문집 A
• /
• pp.414-417
• /
• 1993

The methods for stereo matching are divided into two techniques: area-based matching and feature-based matching. To find corresponding points by area-based method, it takes a lot of time because there are many points to be matched. Feature-based matching algorithm is often used because with this method it matches only some feature points so that the processing time is fast even though it requires interpolation after matching. In this paper, we propose the smart technique by which we makes features simpler than conventional methods to match an image pair by feature-based matching algorithm.

• 한국통신학회논문지
• /
• 제34권6A호
• /
• pp.494-499
• /
• 2009

본 논문에서는 하향링크 다중 사용자 Multiple Input Multiple Output (MIMO) 채널 환경에서 시스템 용량을 최대화시키기 위한 효과적인 사용자 선택 기법에 대해서 논의한다. 본 논문에서 제안하는 방법은 사용자 채널 파워와 채널 간의 각도를 이용하여 최적의 사용자 집단을 선택하는 새로운 방법이다. 이 방법은 SUS 방법에 비해 허용 상관도 값을 별도로 생각하지 않아도 되기 때문에 간단한 방법이며, 시스템 성능을 최대화시키는 사용자들을 찾는 방법이기 때문에 향상된 성능을 보인다.

• 대한설비공학회:학술대회논문집
• /
• 대한설비공학회 2006년도 하계학술발표대회 논문집
• /
• pp.454-459
• /
• 2006

There are two main streams for pattern classification technology One is the method using PCA (Principal Component Analysis) and the other is the method using Neural network. Both of them have merits and demerits. In general, using PCA is so simple while using neural network can improve algorithm continually. Algorithm using neural network needs so many calculations rendering very slow response. In this work, an attempt is made to develop algorithms adopting both PCA and neural network merits for simpler, but faster and smarter.

• 천문학회보
• /
• 제45권1호
• /
• pp.51.3-52
• /
• 2020

We present the status of the development of a Markov Chain Monte Carlo (MCMC) parameter estimation (PE) pipeline for compact binary coalescences (CBCs) with the Japanese KAGRA gravitational-wave (GW) detector. The pipeline is included in the KAGRA Algorithm Library (KAGALI). Basic functionalities are benchmarked from the LIGO Algorithm Library (LALSuite) but the KAGRA MCMC PE pipeline will provide a simpler, memory-efficient pipeline to estimate physical parameters from gravitational waves emitted from compact binaries consisting of black holes or neutron stars. Applying inspiral-merge-ringdown and inspiral waveforms, we performed simulations of various black hole binaries, we performed the code sanity check and performance test. In this talk, we present the situation of GW observation with the Covid-19 pandemic. In addition to preliminary PE results with the KAGALI MCMC PE pipeline, we discuss how we can optimize a CBC PE pipeline toward the next observation run.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제51권2호
• /
• pp.78-85
• /
• 2002

We introduce a rotational decision-directed joint algorithm of blind equalization coupled with carrier recovery for 32-QAM demodulation with high symbol rate. The proposed carrier recovery, which we call a rotational decision-directed carrier recovery(RDDCR), removes the residual phase difference by rotating the decision boundary for the kth received symbol by the frequency detector output of the (k-1)th received symbol. Since the RDDCR includes the function of PLL loop filter by rotating the decision boundary, it gives a simpler demodulator structure. The rotational decision-directed blind equalization(RDDBE) with the rotated decision boundary based on the Stop-and-Go Algorithm(SGA) operated during tracking the frequency offset by the RDDCR and removes intersymbol interference due to multipaths and channel noise. Test results show that symbol error rate of $10^{-3}$ is obtained before the forward error correction when SNR equals 15dB with 150KHz of carrier frequency offset and two multipaths, which is the channel condition for 32-QAM receiver.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권12호
• /
• pp.3166-3179
• /
• 2013

A pre-processing system for adaptive noise removal is proposed based on the principle of identifying and filtering object regions and background regions. Human perception of images depends on bright, well-focused object regions; these regions can be treated with the best filters, while simpler filters can be applied to other regions to reduce overall computational complexity. In the proposed method, bright region segmentation is performed, followed by segmentation of object and background regions. Noise in dark, background, and object regions is then removed by the median, fast bilateral, and bilateral filters, respectively. Simulations show that the proposed algorithm is much faster than and performs nearly as well as the bilateral filter (which is considered a powerful noise removal algorithm); it reduces computation time by 19.4 % while reducing PSNR by only 1.57 % relative to bilateral filtering. Thus, the proposed algorithm remarkably reduces computation while maintaining accuracy.

• 한국화재소방학회논문지
• /
• 제13권1호
• /
• pp.21-30
• /
• 1999

본 연구는 세 가지 유형의 아트리움 공간에 대해서 Zone 모델과 Field 모델을 비교하였으며, Zone 모델로는 FIRST, CFAST, NIST에서 개발된 CCFM.VENTS 그리고 CSIRO에서 개발된 NBTC 1-room 모델을 사용하였고 Field 모델로는 Chow에 의해 개발된 화재모델과 본 연구에서 개발된 SMEP을 사용하였다. 두 모델들에 대한 비교는 서로 유사한 결과를 보였으며, 특히 PISO 알고리즘을 사용한 SMEP의 경우가 SIMPLER 알고리즘이 적용된 field 모델에 비해 더 빠른 계산시간을 보여 주었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권4호
• /
• pp.1128-1139
• /
• 2012

With the development of three-dimensional display and related technologies, depth video coding becomes a new topic and attracts great attention from industries and research institutes. Because (1) the depth video is not a sequence of images for final viewing by end users but an aid for rendering, and (2) depth video is simpler than the corresponding color video, fast algorithm for depth video is necessary and possible to reduce the computational burden of the encoder. This paper proposes a fast mode decision algorithm for depth video coding based on depth segmentation. Firstly, based on depth perception, the depth video is segmented into three regions: edge, foreground and background. Then, different mode candidates are searched to decide the encoding macroblock mode. Finally, encoding time, bit rate and video quality of virtual view of the proposed algorithm are tested. Experimental results show that the proposed algorithm save encoding time ranging from 82.49% to 93.21% with negligible quality degradation of rendered virtual view image and bit rate increment.

• 전기학회논문지
• /
• 제60권2호
• /
• pp.407-415
• /
• 2011

In this study, we propose the design of optimized fuzzy controller for the rotary inverted pendulum system by using differential evolution algorithm. The structure of the differential evolution algorithm has a simple structure and its convergence to optimal values is superb in comparison to other optimization algorithms. Also the differential evolution algorithm is easier to use because it have simpler mathematical operators and have much less computational time when compared with other optimization algorithms. The rotary inverted pendulum system is nonlinear and has a unstable motion. The objective is to control the position of the rotating arm and to make the pendulum to maintain the unstable equilibrium point at vertical position. The output performance of the proposed fuzzy controller is considered from the viewpoint of performance criteria such as overshoot, steady-state error, and settling time through simulation and practical experiment. From the result of both simulation and practical experiment, we evaluate and analyze the performance of the proposed optimal fuzzy controller from the comparison between PGAs and differential evolution algorithms. Also we show the superiority of the output performance as well as the characteristic of differential evolution algorithm.

• Industrial Engineering and Management Systems
• /
• 제10권4호
• /
• pp.272-278
• /
• 2011

Decision tree as a classification tool is being used successfully in many areas such as medical diagnosis, customer churn prediction, signal detection and so on. The main advantage of decision tree classifiers is their capability to break down a complex structure into a collection of simpler structures, thus providing a solution that is easy to interpret. Since decision tree is a top-down algorithm using a divide and conquer induction process, there is a risk of reaching a local optimal solution. This paper proposes a procedure of optimally determining thresholds of the chosen variables for a decision tree using an adaptive particle swarm optimization (APSO). The proposed algorithm consists of two phases. First, we construct a decision tree and choose the relevant variables. Second, we find the optimum thresholds simultaneously using an APSO for those selected variables. To validate the proposed algorithm, several artificial and real datasets are used. We compare our results with the original CART results and show that the proposed algorithm is promising for improving prediction accuracy.