• Journal of Electrical Engineering and Technology
• /
• 제8권4호
• /
• pp.889-898
• /
• 2013

The shortest-path searching algorithm must not only find a global solution to the destination, but also solve a turn penalty problem (TPP) in an urban road transportation network (URTN). Although the Dijkstra algorithm (DA) as a representative node-based algorithm secures a global solution to the shortest path search (SPS) in the URTN by visiting all the possible paths to the destination, the DA does not solve the TPP and the slow execution speed problem (SEP) because it must search for the temporary minimum cost node. Potts and Oliver solved the TPP by modifying the visiting unit from a node to the link type of a tree-building algorithm like the DA. The Multi Tree Building Algorithm (MTBA), classified as a representative Link Based Algorithm (LBA), does not extricate the SEP because the MTBA must search many of the origin and destination links as well as the candidate links in order to find the SPS. In this paper, we propose a new Link-Based Single Tree Building Algorithm in order to reduce the SEP of the MTBA by applying the breaking rule to the LBA and also prove its usefulness by comparing the proposed with other algorithms such as the node-based DA and the link-based MTBA for the error rates and execution speeds.

• ETRI Journal
• /
• 제26권5호
• /
• pp.432-436
• /
• 2004

In this paper, we propose the modified uniformly most powerful (UMP) belief-propagation (BP)-based decoding algorithm which utilizes multiplicative and additive factors to diminish the errors introduced by the approximation of the soft values given by a previously proposed UMP BP-based algorithm. This modified UMP BP-based algorithm shows better performance than that of the normalized UMP BP-based algorithm, i.e., it has an error performance closer to BP than that of the normalized UMP BP-based algorithm on the additive white Gaussian noise channel for low density parity check codes. Also, this algorithm has the same complexity in its implementation as the normalized UMP BP-based algorithm.

• 한국측량학회지
• /
• 제35권5호
• /
• pp.339-348
• /
• 2017

Due to recent improvements in computer processing speed and image processing technology, researches are being actively carried out to combine information from a camera with existing GNSS (Global Navigation Satellite System) and dead reckoning. In this study, the mathematical model based on SPR (Single Photo Resection) is derived for image-based assistant algorithm for vehicle positioning. Simulation test is performed to analyze factors affecting SPR. In addition, GNSS/on-board vehicle sensor/image based positioning algorithm is developed by combining image-based positioning algorithm with existing positioning algorithm. The performance of the integrated algorithm is evaluated by the actual driving test and landmark's position data, which is required to perform SPR, based on simulation. The precision of the horizontal position error is 1.79m in the case of the existing positioning algorithm, and that of the integrated positioning algorithm is 0.12m at the points where SPR is performed. In future research, it is necessary to develop an optimized algorithm based on the actual landmark's position data.

• 조명전기설비학회논문지
• /
• 제20권9호
• /
• pp.32-39
• /
• 2006

In this paper, an iterative subspace-based calibration algorithm for a CDMA-based antenna array in the presence of unknown gain and phase error is presented. The algorithm does not depend on the array geometry and does not require a prior knowledge of the Directions Of Arrival (DOA) of the signals. The method requires the code sequence of a reference user only. The proposed algorithm is based on the subspace method and root finding approach, and it provides estimates of the calibration vector, the DOA and the channel impulse response, by using the code sequence of a reference user. The performance of the proposed algorithm was investigated by means of computer simulations and was verified using field data measured through a custom-built W-CDMA test-bed. The data show that experimental results match well with the theoretical calibration algorithm. Also, teh study propose an efficient algorithm using the simulated annealing technique. This algorithm overcomes the requirement of initial guessing in the subspace-based approach.

• 방송공학회논문지
• /
• 제1권1호
• /
• pp.44-54
• /
• 1996

In this paper, we propose a new 3-D deinterlacing algorithm based on wide sparse vector correlations and a vertical edge based motion detection algorithm. which is an extension of the deinterlacing algorithm proposed in [10. llJ by the authors. The prooised algorithm is developed mainly for the format conversion problem encountered in current HDTV system, but can also be aplicable to the double scan conversion problesm frequently encountered in ths NTSC systems. By exploiting the edge oriented spatial interpolation based on the wide vector correlations, visually annoying artifiacts caused by interlacing such as a serrate line. line crawling, a line flicker, and a large area flicker can be remarkably reduced since the use of the wide vectors increases the range of the edge orientations that can be detected, and by exploiting sparse vectors correlations the HjW complexity for realizing the algorithm in applications cam be significantly simplified. Simulations are provided indicating thet the proposed algorithm results in a high performance comparable to the performance of the deinterlacing algorithm. based on the wide vector correlations.

• Nuclear Engineering and Technology
• /
• 제52권3호
• /
• pp.544-551
• /
• 2020

Reactor control is a standout amongst the most vital issues in the nuclear power plant. In this paper, the optimal design of variable structure controller (VSC) based on the lightning search algorithm (LSA) is proposed for a nuclear reactor power system. The LSA is a new optimization algorithm. It is used to find the optimal parameters of the VSC instead of the trial and error method or experts of the designer. The proposed algorithm is used for the tuning of the feedback gains and the sliding equation gains of the VSC to prove a good performance. Furthermore, the parameters of the VSC are tuned by the genetic algorithm (GA). Simulation tests are carried out to verify the performance and robustness of the proposed LSA-based VSC compared with GA-based VSC. The results prove the high performance and the superiority of VSC based on LSA compared with VSC based on GA.

• 디지털콘텐츠학회 논문지
• /
• 제14권4호
• /
• pp.463-469
• /
• 2013

집합 기반 POI 검색 기법은 부정확한 질의어 입력 시 검색결과의 재현율과 정확도가 현저히 떨어지는 기존 하드매칭 기법에 비해 우수한 성능을 보인다. 하지만 집합 개념을 바탕으로 했기 때문에 한 POI 레코드 내에 중복으로 포함된 동일 글자들을 구분하지 못하는 문제점이 있다. 본 논문에서는 이러한 문제를 해결하여 한 POI 내에 동일 글자가 여러 개 등장해도 동작하는 개선된 집합 기반 POI 검색 기법을 제시하고 구현하였다. 또한 개선된 집합 기반 POI 검색 기법의 검색결과와 기존 집합 기반 POI 검색 기법의 검색결과를 비교하는 실험을 통해 레코드 내에 중복으로 포함된 동일 글자가 있는 레코드에 대한 검색 성능이 향상되었음을 확인하였다.

• Structural Engineering and Mechanics
• /
• 제47권4호
• /
• pp.495-511
• /
• 2013

In this paper, a new efficient optimization algorithm called Teaching-Learning-Based Optimization (TLBO) is used for the least weight design of trusses with continuous design variables. The TLBO algorithm is based on the effect of the influence of a teacher on the output of learners in a class. Several truss structures are analyzed to show the efficiency of the TLBO algorithm and the results are compared with those reported in the literature. It is concluded that the TLBO algorithm presented in this study can be effectively used in the weight minimization of truss structures.

• 제어로봇시스템학회논문지
• /
• 제12권8호
• /
• pp.746-751
• /
• 2006

In this paper, we present tracking algorithm for the indoor moving object. We research passive method using a camera and image processing. It had been researched to use dynamic based estimators, such as Kalman Filter, Extended Kalman Filter and Particle Filter for tracking moving object. These algorithm have a good performance on real-time tracking, but they have a limit. If the shape of object is changed or object is located on complex background, they will fail to track them. This problem will need the complicated image processing algorithm. Finally, a large algorithm is made from integration of dynamic based estimator and image processing algorithm. For eliminating this inefficiency problem, image based estimator, Mean-shift Algorithm is suggested. This algorithm is implemented by color histogram. In other words, it decide coordinate of object's center from using probability density of histogram in image. Although shape is changed, this is not disturbed by complex background and can track object. This paper shows the results in real camera system, and decides 3D coordinate using the data from mean-shift algorithm and relationship of real frame and camera frame.

• 한국지반공학회:학술대회논문집
• /
• 한국지반공학회 1999년도 가을 학술발표회 논문집
• /
• pp.415-422
• /
• 1999

This paper describes a new optimum design approach for piled raft foundations using the genetic algorithm. The objective function considered is the cost-based total weight of raft and piles. The genetic algorithm is a search or optimization technique based on nature selection. Successive generation evolves more fit individuals on the basis of the Darwinism survival of the fittest. In formulating the genetic algorithm-based optimum design procedure, the analysis of piled raft foundations is peformed based on the 'hybrid'approach developed by Clancy(1993), and also the simple genetic algorithm proposed by the Goldberg(1989) is used. To evaluate a validity of the optimum design procedure proposed based on the genetic algorithm, comparisons regarding optimal pile placement for minimizing differential settlements by Kim et at.(1999) are made. In addition using proposed design procedure, design examples are presented.