• Journal of KIISE:Information Networking
• /
• v.37 no.2
• /
• pp.162-165
• /
• 2010

In the paper, we propose an algorithm that significantly reduces unnecessary computations, while keeping prediction quality almost similar to that of the full search. In the proposed algorithm, we can reduces only unnecessary computations efficiently by taking different search patterns and error criteria of block matching according to distribution probability of motion vectors. Our algorithm takes only 20~30% in computational amount and has decreased prediction quality about 0~0.02dB compared with the fast full search of the H.264 reference software. Our algorithm will be useful to real-time video coding applications using MPEG-2/4 AVC standards.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.3
• /
• pp.654-662
• /
• 2016

As the number of gates and basic events in fault trees increases, it becomes difficult to calculate the exact probability of the top event. In order to overcome this difficulty the BDD methodology can be used to calculate the exact top event probability for small and medium size fault trees in short time. Fault trees are converted to BDD by using CUDD library functions and a failure path search algorithm is proposed to calculate the exact top event probability. The backward search algorithm is more efficient than the forward one in finding failure paths and in the calculation of the top event probability. This backward search algorithm can reduce searching time in the identification of disjoint failure paths from BDD and can be considered as an effective tool to find the cut sets and the minimal cut sets for the given fault trees.

• Structural Engineering and Mechanics
• /
• v.58 no.1
• /
• pp.163-179
• /
• 2016

The Cuckoo search (CS) algorithm is a simple and efficient global optimization algorithm and it has been applied to figure out large range of real-world optimization problem. In this paper, a new formula is introduced to the discovering probability process to improve the convergence rate and the Tournament Selection Strategy is adopted to enhance global search ability of the certain algorithm. Then an approach for structural damage identification based on modified Cuckoo search (MCS) is presented. Meanwhile, we take frequency residual error and the modal assurance criterion (MAC) as indexes of damage detection in view of the crack damage, and the MCS algorithm is utilized to identifying the structural damage. A simply supported beam and a 31-bar truss are studied as numerical example to illustrate the correctness and efficiency of the propose method. Besides, a laboratory work is also conducted to further verification. Studies show that, the proposed method can judge the damage location and degree of structures more accurately than its counterpart even under measurement noise, which demonstrates the MCS algorithm has a higher damage diagnosis precision.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.20 no.3
• /
• pp.328-336
• /
• 2017

The goal of this study is simulation of optimal search pattern of ships based on performance surface which are reflected underwater environmental. The process is as follows. First, temporal and spatial environmental database are extracted in complex environment and input hull mounted SONAR system parameters. The environmental database and SONAR system parameters are substituted to SONAR equations, and calculate signal excess, detection probability, detection range. And then, the performance surface, which can be used to provide operational insight of SONAR detection performance, are pictorialized. Finally, optimal search pattern of ships are simulated using genetic algorithm based on performance surface. And then, we certify optimal search pattern in various ways.

• Journal of Ocean Engineering and Technology
• /
• v.8 no.1
• /
• pp.62-70
• /
• 1994

In order to estimate the detection range of a active SONAR system, the SONAR equation is commonly used. In this paper, an algorithm to calculate detection range in active SONAR system as function of SONAR depth and target depth is presented. For given SONAR parameters and environment, the transmission loss and background level are found, signal excess is computed. Using log-normal distribution, signal excess is converted to detection probability at each range. Then, the detection range is obtained by integrating the detection probability as function of range for each depth. The proposed algorithm have been applied to the case of omni-directional source with center frequency 30Hz for summer and winter sound profiles. It is found that the optimal search depth is the source depth since the detection range increase at source depth where the signal excess is maximized.

• ETRI Journal
• /
• v.27 no.4
• /
• pp.461-464
• /
• 2005

Recently, a variety of confidence measures for utterance verification has been studied to improve speech recognition performance by rejecting out-of-vocabulary inputs. Most of the conventional confidence measures for utterance verification are based primarily on hypothesis testing or an approximated posterior probability, and their performances depend on the robustness of an alternative hypothesis or the prior probability. We introduce a novel confidence measure called a search confusion rate (SCR), which does not require an alternative hypothesis or the approximation of posterior probability. Our confusion-based approach shows better performance in additive noise-corrupted speech as well as in clean speech.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.1
• /
• pp.201-206
• /
• 1994

The linear search problem is concerned with finding a hiden target on the real line R. The position of the target governed by some probability distribution. It is desired to find the target in the least expected search time. This problem has been formulated as an optimization problem by a number of authors without making use of Markov Decision Process (MDP) theory. It is the aim of the paper to give a (MDP) formulation to the search problem which we feel is both natural and easy to follow.

• Journal of Communications and Networks
• /
• v.12 no.5
• /
• pp.475-479
• /
• 2010

The clipping value, defined as the log-likelihood ratio (LLR) in the case wherein all the list of candidates have the same binary value, is investigated, and an effective method to estimate it is presented for iterative tree search detection. The basic principle behind the method is that the clipping value of a channel bit is equal to the LLR of the maximum probability of correct decision of the bit to the corresponding probability of erroneous decision. In conjunction with multilevel bit mappings, the clipping value can be calculated with the parameters of the number of transmit antennas, $N_t$; number of bits per constellation point, $M_c$; and variance of the channel noise, $\sigma^2$, per real dimension in the Rayleigh fading channel. Analyses and simulations show that the bit error performance of the proposed method is better than that of the conventional fixed-value method.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.71.1-71
• /
• 2001

In this paper, an improved method of environment map building and a region search algorithm for mobile robot are presented. For the environment map building of mobile robot, measurement data of ultrasonic sensors and certainty grid representation is usually used. In this case, inaccuracies due to the uncertainty of ultrasonic data are included in the map. In order to solve this problem, an environment map building method using a Bayesian model was proposed previously[5]. In this study, we present an improved method of probability map building that uses infrared sensors and shift division Gaussian probability distribution with the existing Bayesian update method using ultrasonic sensors. Also, a region search algorithm for ...

• ETRI Journal
• /
• v.34 no.3
• /
• pp.369-378
• /
• 2012

In this paper, we propose new adaptive search range motion estimation methods where the search ranges are constrained by the probabilities of motion vector differences and a search point sampling technique is applied to the constrained search ranges. Our new methods are based on our previous work, in which the search ranges were analytically determined by the probabilities. Since the proposed adaptive search range motion estimation methods effectively restrict the search ranges instead of search point sampling patterns, they provide a very flexible and hardware-friendly approach in motion estimation. The proposed methods were evaluated and tested with JM16.2 of the H.264/AVC video coding standard. Experiment results exhibit that with negligible degradation in PSNR, the proposed methods considerably reduce the computational complexity in comparison with the conventional methods. In particular, the combined method provides performance similar to that of the hybrid unsymmetrical-cross multi-hexagon-grid search method and outstanding merits in hardware implementation.