• Journal of Korea Multimedia Society
• /
• v.13 no.7
• /
• pp.991-999
• /
• 2010

In this paper, we propose a fast motion estimation algorithm for video encoding. Conventional fast motion estimation algorithms have a serious problem of low prediction quality in some frames. However, full search based fast algorithms have low computational reduction ratio. In the paper, we propose an algorithm that significantly reduces unnecessary computations, while keeping prediction quality almost similar to that of the full search. The proposed algorithm uses distribution probability of motion vectors and adaptive search patterns and block matching criteria. By taking different search patterns and error criteria of block matching according to distribution probability of motion vectors, we can reduces only unnecessary computations efficiently. 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 or MPEG-4 AVC standards.

• Proceedings of the KSME Conference
• /
• 2008.11a
• /
• pp.865-869
• /
• 2008

Juryeonggu is a Cuboctahedral die that had used in ancient Korea. This Cuboctahedral is consisted of different two penal servitudes of 14 facepieces, but the probability distribution can appear equally so it can be usable as a die. In this paper, achieved research study about probability of a Cuboctahedral die that have quadrilateral and triangle preferentially to search Juryeonggu's probability calculation method. First, confirmed probability distribution through Multibody-dynamics analysis and verified probability distribution through several experiments. Finally, with this simulation data, achieved theoretical analysis about Cuboctahedral die occurrence probability by using the residual momentum energy.

• Journal of the Korea Society of Computer and Information
• /
• v.1 no.1
• /
• pp.25-36
• /
• 1996

We have analyzed the reliability of failure models In grid topology circuit switched networks. These models are grid topology circuit_ switched networks. and each node transmits packets to object node using flooding search routing method. We hypothesized that the failure of each link Is Independent. We have analyzed for the performance estimation of failure models It using joint probability method to the reliability of a small grid topology circuit switched network. and compared analytic output with simulated output. Also. We have evaluated the reliability of networks using call blocking Probability occurred in circuit switched networks.

• Structural Engineering and Mechanics
• /
• v.81 no.4
• /
• pp.429-441
• /
• 2022

A probabilistic assessment of the seismic-excited buildings with a multiple-tuned-mass-damper (MTMD) system is carried out in the presence of uncertainties of the structural model, MTMD system, and the stochastic model of the seismic excitations. A free search optimization procedure of the individual mass, stiffness and, damping parameters of the MTMD system based on the snap-drift cuckoo search (SDCS) optimization algorithm is proposed for the optimal design of the MTMD system. Considering a 10-story structure in three cases equipped with single tuned mass damper (STMS), 5-TMD and 10-TMD, sensitivity analyses are carried out using Sobol' indices based on the Monte Carlo simulation (MCS) method. Considering different seismic performance levels, the reliability analyses are done using MCS and kriging-based MCS methods. The results show the maximum structural responses are more affected by changes in the PGA and the stiffness coefficients of the structural floors and TMDs. The results indicate the kriging-based MCS method can estimate the accurate amount of failure probability by spending less time than the MCS. The results also show the MTMD gives a significant reduction in the structural failure probability. The effect of the MTMD on the reduction of the failure probability is remarkable in the performance levels of life safety and collapse prevention. The maximum drift of floors may be reduced for the nominal structural system by increasing the TMDs, however, the complexity of the MTMD model and increasing its corresponding uncertainty sources can be caused a slight increase in the failure probability of the structure.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.10 no.1
• /
• pp.11-16
• /
• 1985

The performance analysis of serial search spread spectrum synchronization system is carried out. To evaluate the synchronization probabilities, two chi-square densities for signal plus noise and noise only are derived. Then Neyman-Pearson scheme is applied to determine the threshold of the synchronization system. The synchronization probability curves are shown as a function of threshold and signal to noise ratios.

• Journal of Korean Institute of Industrial Engineers
• /
• v.29 no.2
• /
• pp.165-171
• /
• 2003

Visual search in an unstructured search field is a fruitful research area for computational modeling. Search models that describe relationship between search time and probability of target detection have been used for prediction of human search performance and provision of ideal goals for search training. Until recently, however, most of models were focused on detecting a single target in a search field, although, in practice, a search field includes multiple targets and search models for multiple targets may differ from search models for a single target. This study proposed a random search model for multiple targets, generalizing a random search model for a single target which is the most typical search model. To test this model, human search data were collected and compared with the model. This model well predicted human performance in visual search for multiple targets. This paper also proposed how to determine optimal stopping time in multiple-target search.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.33 no.3
• /
• pp.114-122
• /
• 2010

The Probabilistic Traveling Salesman Problem (PTSP) is an important topic in the study of traveling salesman problem and stochastic routing problem. The goal of PTSP is to find a priori tour visiting all customers with a minimum expected length, which simply skips customers not requiring a visit in the tour. There are many existing researches for the homogeneous version of the problem, where all customers have an identical visiting probability. Otherwise, the researches for the heterogeneous version of the problem are insufficient and most of them have focused on search base algorithms. In this paper, we propose a simple construction algorithm to solve the heterogeneous PTSP. The Minimum Expected Length Insertion (MELI) algorithm is a construction algorithm and consists of processes to decide a sequence of visiting customers by inserting the one, with the minimum expected length between two customers already in the sequence. Compared with optimal solutions, the MELI algorithm generates better solutions when the average probability is low and the customers have different visiting probabilities. We also suggest a local search method which improves the initial solution generated by the MELI algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.6
• /
• pp.711-718
• /
• 2019

BDD is a well-known alternative to the conventional Boolean logic method in fault tree analysis. As the size of fault tree increases, the calculation time and computer resources for BDD dramatically increase. A new failure path search and path restructure method is proposed for efficient calculation of CS and MCS from BDD. Failure path grouping and bottom-up path search is proved to be efficient in failure path search in BDD and path restructure is also proved to be used in order to reduce the number of CS comparisons for MCS extraction. With these newly proposed methods, the top event probability can be calculated using the probability by ASDMP(Approximate Sum of Disjoint MCS Products), which is shown to be equivalent to the result by the conventional MCUB(Minimal Cut Upper Bound) probability.

• Proceedings of the IEEK Conference
• /
• 2000.06a
• /
• pp.189-192
• /
• 2000

In this paper, we consider a code acquisition of W-CDMA signals over multipath Rayleigh fading channel when double-dwell serial search code acquisition is used for initial synchronization. We derive the detection and false alarm probability, and mean acquisition time mathematically by taking into account of multiple H$\_$l/ cells and double-dwell serial search. It is noteworthy that the more the number of the post-detection integration, the shorter the mean acquisition time in low SNR.

• Journal of information and communication convergence engineering
• /
• v.16 no.2
• /
• pp.78-83
• /
• 2018

Rapidity and accuracy are important considerations when a drone is employed in a wide surveillance area to detect a target. They are more important when the scope of application is a search and rescue operation or the monitoring of natural disasters, which may require prompt warnings and response. During the actual operation of a drone, rapidity and accuracy are associated with the change in the altitude of the drone. The aim of this study is to analyze the characteristics of drones at varying altitudes and prove that altitude is a relevant factor in the performance of drones. Herein, the characteristics of the drone at varying altitudes were analyzed through several search simulations. The results suggest that a high-altitude drone is relatively advantageous compared to a low-altitude drone in a probability-based target search, and that the search altitude is also a very important and fundamental factor in target search by drones.