• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제10권4호
• /
• pp.263-268
• /
• 2010

The premature convergence of genetic algorithms (GAs) is the most major factor of slow evolution of GAs. In this paper we propose a novel method to solve this problem through competition of multiple offspring of in dividuals. Unlike existing methods, each parents in our method generates multiple offspring and then generated multiple offspring compete each other, finally winner offspring become to real offspring. From this multiple offspring competition, our GA rarel falls into the premature convergence and easily gets out of the local optimum areas without negative effects. This makes our GA fast evolve to the global optimum. Experimental results with four function optimization problems showed that our method was superior to the original GA and had similar performances to the best ones of queen-bee GA with best parameters.

• 한국항해항만학회:학술대회논문집
• /
• 한국항해항만학회 2006년도 International Symposium on GPS/GNSS Vol.2
• /
• pp.395-398
• /
• 2006

In this paper, for implementing a real-time software GNSS receiver we propose the highly efficient and fast algorithms such as partial down-conversion, phase rotator, composite I&Q accumulation, Virtual DCO technique, and parallel acquisition using FFT. When the proposed algorithms are used, more 30 tracking channels with 3 tracking arm(early-prompt-late) is operated real-time on Intel 2.8GHz personal computer. Also, the partial down-conversion reduces the FFT size, for parallel acquisition, to 1/8 of conventional FFT-size and the program size includes map is not exceed 1Mbyte. Finally, the proposed real-time software GNSS receiver using the proposed algorithms provides the navigation solution with below 10 meter rms error.

• 대한전기학회논문지
• /
• 제40권4호
• /
• pp.331-341
• /
• 1991

The discrete cosine transform (DCT) is widely used in many signal processing areas, including image and speech data compression. In this paper, we investigate a fixed-point error analysis for fast DCT algorithms, namely, Lee [6], Hou [7] and Vetterli [8]. A statistical model for fixed-point error is analyzed to predict the output noise due to the fixed-point implementation. This paper deals with two's complement fixed-point data representation with truncation and rounding. For a comparison purpose, we also investigate the direct form DCT algorithm. We also propose a suitable scaling model for the fixed-point implementation to avoid an overflow occurring in the addition operation. Computer simulation results reveal that there is a close agreement between the theoretical and the experimental results. The result shows that Vetterli's algorithm is better than the other algorithms in terms of SNR.

• 한국산업융합학회 논문집
• /
• 제25권3호
• /
• pp.341-347
• /
• 2022

This paper presents a comparison result of two simultaneous localization and mapping (SLAM) algorithms for navigation that have been proposed in literature. The performances of Extended Kalman Filter (EKF) SLAM under Gaussian condition, FastSLAM algorithms using Rao-Blackwellised method for particle filtering are compared in terms of accuracy of state estimations for localization of a robot and mapping of its environment. The algorithms were run using the same type of robot on indoor environment. The results show that the Particle filter based FastSLAM has the better performance in terms of accuracy of localization and mapping. The experimental results are discussed and compared.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 하계종합학술대회 논문집(4)
• /
• pp.43-46
• /
• 2000

In this paper, we propose a fast adaptive diamond search algorithm(FADS) for block matching motion estimation. Fast motion estimation algorithms reduce the computational complexity by using the UESA (Unimodal Error Search Assumption) that the matching error monotonically increases as the search moves away from the global minimum error. Recently many fast BMAs(Block Matching Algorithms) make use of the fact that the global minimum points in real world video sequences are centered at the position of zero motion. But these BMAs, especially in large motion, are easily trapped into the local minima and result in poor matching accuracy. So, we propose a new motion estimation algorithm using the spatial correlation among the adjacent blocks. We change the origin of search window according to the spatially adjacent motion vectors and their MAE(Mean Absolute Error). The computer simulation shows that the proposed algorithm has almost the same computational complexity with UCBDS(Unrestricted Center-Biased Diamond Search)〔1〕, but enhance PSNR. Moreover, the proposed algorithm gives almost the same PSNR as that of FS(Full Search), even for the large motion case, with half the computational load.

• 제어로봇시스템학회논문지
• /
• 제9권8호
• /
• pp.640-646
• /
• 2003

We presents an edge-based point correlation algorithm for fast and stable visual inspection system. Conventional algorithms based on NGC(normalized gray-level correlation) have to overcome some difficulties in applying automated inspection systems to real factory environment. First of all, NGC algorithms involve highly complex computation and thus require high performance hardware for realtime process. In addition, lighting condition in realistic factory environments is not stable and therefore intensity variation from uncontrolled lights gives many troubles for applying NGC directly as pattern matching algorithm. We propose an algorithm to solve these problems, using thinned and binarized edge data, which are obtained from the original image. A point correlation algorithm with the thinned edges is introduced with image pyramid technique to reduce the computational complexity. Matching edges instead of using original gray-level image pixels overcomes problems in NGC method and pyramid of edges also provides fast and stable processing. All proposed methods are proved by the experiments using real images.

• 정보처리학회논문지D
• /
• 제14D권2호
• /
• pp.145-156
• /
• 2007

최근 웹 문서의 변조의 탐지, 버전 관리 등을 위한 XML/HTML 문서들에 대한 효과적인 실시간 변화탐지 알고리즘의 필요성이 증대하고 있다. 특히 대용량의 XML/HTML 문서들에 대한 실시간 변화탐지 응용들은 최소비용의 편집스크립트를 계산하는 알고리즘 보다는 실시간 처리가 가능한 빠른 휴리스틱 알고리즘들을 필요로 한다. 기존의 휴리스틱 알고리즘들은 실행속도는 빠르나 생성되는 편집스크립트의 질이 만족스럽지 못하다. 본 논문에서는 기존의 알고리즘 XyDiff와 X-tree Diff를 소개하고 이들 알고리즘들의 문제점들을 분석하고 문제점들을 개선한 알고리즘 X-tree Diff+를 제안한다. X-tree Diff+는 실행시간 측면에서 기존 알고리즘들과 유사하나 대응효율성에 기반한 대응과정의 개선을 통해 두 문서 간의 노트들의 대응률을 향상시킨 알고리즘이다.

• 인터넷정보학회논문지
• /
• 제9권1호
• /
• pp.1-8
• /
• 2008

Fost Hondovers for Mobile IPv6 (FMIPv6) 는 Mobile IPv6의 끊김 없는 핸드오버를 위해 제안된 프로토콜이다. 하지만 FMIPv6 의 보안의 취약점을 보완할 수 있는 메커니즘은 현재 미비한 상태이다. FMIPv6의 인증을 위한 현재까지의 대부분의 연구는 Authentication Authorization Accounting (AAA) (5) 또는 공인인증서와 (6) 같은 비대칭 암호알고리즘을 활용하는 Public Key Infrastructure (PKI)와 같은 기술들에 집중 되어있다. 이러한 기술들은 한정된 서비스 도메인만 적용할 수 있거나 복잡한 암호 수식을 처리하지 못하는 단말기에는 적용할 수 없다는 한계점을 가지고 있다. 따라서 본 논문은 Mobile IPv6의 기본 프로토콜인 Return Routability 만을 사용하여 인증에 필요한 별도의 인프라스트럭처나 많은 처리비용이 필요한 암호 알고리즘 없이 FMIPv6의 인증 메커니즘을 제공하는 방법을 제안한다.

• The Journal of the Acoustical Society of Korea
• /
• 제16권2E호
• /
• pp.38-46
• /
• 1997

The objective of the paper is to compare the computational complexity of five algorithms for computing time-domain second-order Volterra filter outputs in terms of number of real multiplication and addition operations required for implementation. This study shows that if the filter memory length is greater that or equal to 16, the fast algorithm using the overlap-save method and the frequency-domain symmetry properties of the quadratic coefficients is the most efficient among the algorithms investigated in this paper, When the filter memory length is less than 16, the algorithm using the time-domain symmetry properties is better than any other algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권10호
• /
• pp.4814-4834
• /
• 2018

This paper presents an architecture for wireless sensor networks (WSNs) with blind source separation (BSS) applied to retrieve the received mixing signals of the sink nodes first. The little-to-no need of prior knowledge about the source signals of the sink nodes in the BSS method is obviously advantageous for WSNs. The optimization problem of the BSS of multiple independent source signals with complex and noncircular distributions from observed sensor nodes is considered and addressed. This paper applies Castella's reference-based scheme to Novey's negentropy-based algorithms, and then proposes a novel fast fixed-point (FastICA) algorithm, defined as the reference-signal negentropy complex FastICA (RSNT-cFastICA) for complex-valued noncircular-distribution source signals. The proposed method for the sink nodes is substantially more efficient than Novey's quasi-Newton algorithm in terms of computational speed under large numbers of samples, can effectively improve the power consumption effeciency of the sink nodes, and is significantly beneficial for WSNs and wireless communication networks (WCNs). The effectiveness and performance of the proposed method are validated and compared with three related BSS algorithms through theoretical analysis and simulations.