• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.750-755
• /
• 1998

Due to the temporal spatial correlation of the image sequence, the motion vector of a block is highly related to the motion vectors of its adjacent blocks in the same image frame. If we can obtain useful and enough information from the adjacent motion vectors, the total number of search points used to find the motion vector of the block may be reduced significantly. Using that idea, an efficient fuzzy prediction search (FPS) algorithm for block motion estimation is proposed in this paper. Based on the fuzzy inference process, the FPS can determine the motion vectors of image blocks quickly and correctly.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.9
• /
• pp.77-83
• /
• 1997

We present a fast adaptive block matching algorithm using variable search area and subsampling to estimate motion vector more exactly. In the presented method, the block is classified into one of three motion categories: zero motion vector block, medium-motion bolck or high-motion block according to mean absolute difference of the block. By the simulation, the computation amount of the presented methoe comparable to three step search algorithm and new three step search algorithm. In the fast image sequence, the PSNR of our algorithm increased more than TSS and NTSS, because our algorithm estimated motion vector more accurately.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.419-420
• /
• 2006

In the new video coding standard H.264/AVC, motion estimation (ME) is allowed to search multiple reference frames for improve the rate-distortion performance. The complexity of multi-frame motion estimation increases linearly with the number of used reference frame. However, the distortion gain given by each reference frame varies with the video sequence, and it is not efficient to search through all the candidate frames. In this paper, we propose a fast mult-frame selection method using all zero coefficient block (AZCB) prediction and sum of difference (SAD) of neighbor block. Simulation results show that the speed of the proposed algorithm is up to two times faster than exhaustive search of multiple reference frames with similar quality and bit-rate.

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.3
• /
• pp.360-368
• /
• 1999

We consider the problem of scheduling n jobs with sequence-dependent processing times on a set of parallel-identical machines. The processing time of each job consists of a pure processing time and a sequence-dependent setup time. The objective is to maximize the total remaining machine available time which can be used for other tasks. For the problem, a hybrid genetic algorithm is proposed. The algorithm combines a genetic algorithm for global search and a heuristic for local optimization to improve the speed of evolution convergence. The genetic operators are developed such that parallel machines can be handled in an efficient and effective way. For local optimization, the adjacent pairwise interchange method is used. The proposed hybrid genetic algorithm is compared with two heuristics, the nearest setup time method and the maximum penalty method. Computational results for a series of randomly generated problems demonstrate that the proposed algorithm outperforms the two heuristics.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.10a
• /
• pp.157-160
• /
• 2000

This study is concerned with how to optimize the Input sequence of product models with sequence -dependent setup time in Mixed-Model Assembly Line (MMAL) using conveyor system. Usually MMAL consists of a number of stations linked by conveyor belt and each station has a work zone limited by upstream and downstream boundaries. To avoid improper interference between operators in the adjacent stations and excess of machine moving range, operators are forced to complete their operations within their predetermined work zone. In this study, our goal is to determine sequence of models for minimizing the total work unfinished within their work zone. A generalized formulation of the product sequencing problem in MMAL is presented and we developed an optimal procedure using Branch & Bound. Also we developed a heuristic procedure using local search.

• Industrial Engineering and Management Systems
• /
• v.3 no.2
• /
• pp.100-115
• /
• 2004

The network representation and branch and bound algorithm with efficient lower and upper bounding procedures are developed to determine a global optimal production schedule on a machine that minimizes sequence-dependent setup cost and earliness/tardiness penalties. Lower bounds are obtained based on heuristic and Lagrangian relaxation. Priority dispatching rule with local improvement procedure is used to derive an initial upper bound. Two dominance criteria are incorporated in a branch and bound procedure to reduce the search space and enhance computational efficiency. The computational results indicate that the proposed procedure could optimally solve the problem with up to 40 jobs in a reasonable time using a personal computer.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 1995.10a
• /
• pp.30-36
• /
• 1995

Conventionally design for multi-stage cold forging depends on the designer's experience and decision-making. Due to such non-deterministic nature of the process sequence design, a flexible inference engine is needed for process design expert system. In this study, A* searching algorithm was introduced to arrive at the vetter process sequence design considering the number of forming stages and levels of effective strain, effective stress, and forming load during the porcess. In order to optimize the process sequence in producing the final part, cost function was defined and minimized using the proposed A* searching algorithm. For verification of the designed forming sequences, forming experiments and finite element analyses were carried out in the present investigation. The developed expert system using A* searching algorithm can produce a flexible design system based on changes in the number of forming stages and weights.

• Food Science of Animal Resources
• /
• v.35 no.1
• /
• pp.86-90
• /
• 2015

In this study, we reported the morphogenetic analysis and genome sequence by genomic analysis of the newly isolated staphylococcal phage SMSAP5 from soil of slaughterhouses for cattle. Based on transmission electron microscopy evident morphology, phage SMSAP5 belonged to the Siphoviridae family. Phage SMSAP5 had a double-stranded DNA genome with a length of 45,552 bp and 33 % G+C content. Bioinformatics analysis of the phage genome revealed 43 open reading frames. A blastn search revealed that its nucleotide sequence shared a high degree of similarity with that of the Staphylococcus phage tp310-2. In conclusion, this study is the first report to show the morphological features and the complete genome sequence of the phage SMSAP5 from soil of slaughterhouses for cattle.

• Food Science of Animal Resources
• /
• v.37 no.6
• /
• pp.884-888
• /
• 2017

In this study, we report the morphogenetic analysis and genome sequence of a new WCP30 phage of Weissella cibaria, isolated from a fermented food. Based on its morphology, as observed by transmission electron microscopy, WCP30 phage belongs to the family Siphoviridae. Genomic analysis of WCP30 phage showed that it had a 33,697-bp double-stranded DNA genome with 41.2% G+C content. Bioinformatics analysis of the genome revealed 35 open reading frames. A BLASTN search showed that WCP30 phage had low sequence similarity compared to other phages infecting lactic acid bacteria. This is the first report of the morphological features and complete genome sequence of WCP30 phage, which may be useful for controlling the fermentation of dairy foods.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.52 no.2
• /
• pp.114-120
• /
• 2003

According to the use of distribution automation systems, the function to find or to search a fault phase is necessary for automatic switches in a distribution substation. In this paper, two algorithms are developed to fine the fault circuit and the fault phase for the automatic switches in substation with ungrounded power system. One is the fault circuit searching method using the zero sequence voltage at the bus and zero sequence current of circuit current and the other is to find the fault phase using the line voltage and zero sequence current. The developed algorithms are tested in the case study simulations. An ungrounded power system is modeled by EMTP as a case study system. The developed algorithms are tested in the case study simulations and each shows correct results.