• Korean Journal of Computational Design and Engineering
• /
• v.11 no.3
• /
• pp.183-196
• /
• 2006

A new operation strategy. which can guarantee the data consistency of engineering information among the various intelligent information systems, is presented for engineering information of bridges, and construction methodology of integrated database is developed to support the strategy. The two core standard techniques are adopted to construct the integrated database. One is the Standard for the Exchange of Product Model Data (STEP) for CAD/CAE information and the other is the Extensible Markup Language(XML) for engineering document information. The former enabler structural engineers to handle the structural details with three-dimensional geometry-based information of bridges, and ACIS solid modeling kernel is employed to develop AutoCAD based application modules. The latter can make document files into data type for web-based application modules which assist end-users to search and retrieve engineering document data. In addition, relaying algorithm is developed to integrate the two different information, e.g. CAD/CAE information and engineering document information. The pilot application modules are also developed, and a case study subjected to the Han-Nam bridge is presented at the end of the paper to illustrate the use of the developed application modules.

• Journal of Broadcast Engineering
• /
• v.13 no.6
• /
• pp.875-882
• /
• 2008

Ear detection in an image processing is the one of the important area in biometrics. In this paper we propose a human ear detection algorithm with side face images. First, we search a face candidate area in an input image by using skin-color model and try to find an ear area based on Haar-like feature. Then, to verity whether it is the ear area or not, we use the template which is excellent object classification compare to recognize the characters in the plate. In this experiment, the proposed method showed that the processing speed is improved by 60% than previous works and the detection success rate is 92%.

• Journal of Broadcast Engineering
• /
• v.18 no.4
• /
• pp.535-542
• /
• 2013

In this paper, we proposed a advanced hardware engine architecture for high speed and high detection rate image recognitions. We adopted the HOG-LBP feature extraction algorithm and more parallelized architecture in order to achieve higher detection rate and high throughput. As a simulation result, the designed engine which can search about 90 frames per second detects 97.7% of pedestrians when false positive per window is $10^{-4}$.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.13 no.4
• /
• pp.209-215
• /
• 1993

A stability analysis program(CSLOP) which can obtain the factor of safety and the critical failure surface at the same time is developed from this study. In order to improve existing slice methods, the general slice method of Gussmann is applied to compute the factor of safety, and the constrained simplex algorithm proposed by Box is applied to systematically locate the critical failure surface in slopes. The proposed method is applied to two examples of circular and noncircular slope stability and the results are compared to previously published solutions. Constrained simplex method is recommended to improve slope stability programs which provide for an automatic search of the critical failure mechanisms.

• Journal of IKEEE
• /
• v.22 no.3
• /
• pp.532-538
• /
• 2018

This paper proposes an algorithm for signal processing which is used in pulse induction metal mine detectors. The detection power can be obtained from magnetic variation on the search coil. The calibration data should be made when there is no target because the detection power is difference between with and without a target. And it is also updated periodically because of surrounding various noises. Lastly, we keep a watch on the signal slope to identify exact position and signal power of mine detection.

• Journal of Korea Multimedia Society
• /
• v.7 no.11
• /
• pp.1556-1563
• /
• 2004

In this paper, we propose an efficient full mesh topology aggregation method in PNNI networks. The proposed scheme can search multi-links efficiently using the depth priority method based on hop count instead of searching the all links. To do this, we propose a modified line segment algorithm using two line segment method that represents two points which consist of delay-bandwidth pair to reduce topology information and provide a flexibility to the multiple-links aggregation. And we apply it to current full mesh topology aggregation. To evaluate performance of the proposed scheme, we compare/analyze the current method with the proposed scheme with respect to call success rate, access time and crank back rate. The result is that the proposed scheme is better than the current scheme in performance.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.05a
• /
• pp.265-268
• /
• 2001

In this paper, we designed one-dimensional VLSI array with high speed processing in Fractal image compression. fractal image compression algorithm partitions the original image into domain blocks and range blocks then compresses data using the self similarity of blocks. The image is partitioned into domain block with 50% overlapping. Domain block is reduced by averaging the original image to size of range block. VLSI array is trying to search the best matching between a range block and a large amount of domain blocks. Adjacent domain blocks are overlapped, so we can improve of each block's processing speed using the reuse of the overlapped data. In our experiment, proposed VLSI array has about 25% speed up by adding the least register, MUX, and DEMUX to the PE.

• Journal of the Korean Society for information Management
• /
• v.21 no.3
• /
• pp.289-303
• /
• 2004

This experimental study proposes a multi-document summarization method that produces optimal summaries in which users can find answers to their queries. In order to identify the most effective method for this purpose, the performance of the three summarization methods were compared. The investigated methods are sentence clustering, passage extraction through spreading activation, and clustering-passage extraction hybrid methods. The effectiveness of each summarizing method was evaluated by two criteria used to measure the accuracy and the redundancy of a summary. The passage extraction method using the sequential bnb search algorithm proved to be most effective in summarizing multiple documents with regard to summarization precision. This study proposes the passage extraction method as the optimal multi-document summarization method.

• Journal of Biosystems Engineering
• /
• v.38 no.2
• /
• pp.149-162
• /
• 2013

Purpose: In image segmentation via thresholding, Otsu and Kapur methods have been widely used because of their effectiveness and robustness. However, computational complexity of these methods grows exponentially as the number of thresholds increases due to the exhaustive search characteristics. Methods: Particle swarm optimization (PSO) and genetic algorithms (GAs) can accelerate the computation. Both methods, however, also have some drawbacks including slow convergence and ease of being trapped in a local optimum instead of a global optimum. To overcome these difficulties, we proposed two new multi-level thresholding methods based on Bacteria Foraging PSO (BFPSO) and real-coded GA algorithms for fast segmentation. Results: The results from BFPSO and real-coded GA methods were compared with each other and also compared with the results obtained from the Otsu and Kapur methods. Conclusions: The proposed methods were computationally efficient and showed the excellent accuracy and stability. Results of the proposed methods were demonstrated using four real images.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.4
• /
• pp.1442-1462
• /
• 2014

Packet classification is a key technology of the Internet for routers to classify the arriving packets into different flows according to the predefined rulesets. Previous packet classification algorithms have mainly focused on search speed and memory usage, while overlooking update performance. In this paper, we propose PreCuts, which can drastically improve the update speed. According to the characteristics of IP field, we implement three heuristics to build a 3-layer decision tree. In the first layer, we group the rules with the same highest byte of source and destination IP addresses. For the second layer, we cluster the rules which share the same IP prefix length. Finally, we use the heuristic of information entropy-based bit partition to choose some specific bits of IP prefix to split the ruleset into subsets. The heuristics of PreCuts will not introduce rule duplication and incremental update will not reduce the time and space performance. Using ClassBench, it is shown that compared with BRPS and EffiCuts, the proposed algorithm not only improves the time and space performance, but also greatly increases the update speed.