• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.23 no.3
• /
• pp.395-404
• /
• 2013

A pattern matching algorithm plays an important role in traffic identification and classification based on predefined patterns for intrusion detection and prevention. As attacks become prevalent and complex, current patterns are written using regular expressions, called regexes, which are expressed into the deterministic finite automata(DFA) due to the guaranteed worst-case performance in pattern matching process. Currently, because of the increased complexity of regex patterns and their large number, memory-efficient DFA from states reduction have become the mainstay of pattern matching process. However, most of the previous works have focused on reducing only the number of states on a single automaton, and thus there still exists a state blowup problem under the large number of patterns. To solve the above problem, we propose a new state compression algorithm that merges states on multiple automata. We show that by merging states with the same input character on multiple automata, the proposed algorithm can lead to a significant reduction of the number of states in the original DFA by as much as 40.0% on average.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.10
• /
• pp.6839-6845
• /
• 2015

The optimization design method for the broadband operation of the sleeve monopole was proposed to unify the multiple antennas essential to the multi-functional broadband wireless communication systems into one antenna. The structure of the sleeve part was optimized to enhance the impedance matching characteristics based on the theoretical analysis that sleeve part can works as the open stub. The thick monopole was used for the broadband operation. The radius of the sleeve and the permittivity of the dielectric inside the sleeve was optimized to enhance the impedance matching characteristics for the broadband operation. The optimized sleeve monopole having thick monopole shows broadband characteristics over 3:1 bandwidth, from 0.8 to 2.43 GHz, which is suitable for the commercial wireless communication system. The proposed broadband sleeve monopole can reduce multiple antennas essential to the multi-functional broadband systems to one antenna.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.10
• /
• pp.851-856
• /
• 2005

The DNA and protein data of diverse species have been daily discovered and deposited in the public archives according to each established format. Database systems in the public archives provide not only an easy-to-use, flexible interface to the public, but also in silico analysis tools of unidentified sequence data. Of such in silico analysis tools, multiple sequence alignment [1] methods relying on pairwise alignment and Smith-Waterman algorithm [2] enable us to identify unknown DNA, protein sequences or phylogenetic relation among several species. However, in the existing multiple alignment method as the number of sequences increases, the runtime increases exponentially. In order to remedy this problem, we adopted a parallel processing suffix tree algorithm that is able to search for common subsequences at one time without pairwise alignment. Also, the cross-matching subsequences triggering inexact-matching among the searched common subsequences might be produced. So, the cross-matching masking process was suggested in this paper. To identify the function of the clusters generated by suffix tree clustering, BLAST was combined with a clustering tool. Our clustering and annotating tool is summarized as the following steps: (1) construction of suffix tree; (2) masking of cross-matching pairs; (3) clustering of gene sequences and (4) annotating gene clusters by BLAST search. The system was successfully evaluated with 22 gene sequences in the pyrubate pathway of bacteria, clustering 7 clusters and finding out representative common subsequences of each cluster

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.7
• /
• pp.104-115
• /
• 1999

This paper proposes an efficient method for 3D modeling of a human face from trinocular images by reconstructing face surface using range data. By using a trinocular camera system, we mitigated the tradeoff between the occlusion problem and the range resolution limitation which is the critical limitation in binocular camera system. We also propose an MPC_MBS (Matching Pixel Count Multiple Baseline Stereo) area-based matching method to reduce boundary overreach phenomenon and to improve both of accuracy and precision in matching. In this method, the computing time can be reduced significantly by removing the redundancies. In the model generation sub-pixel accurate surface data are achieved by 2D interpolation of disparity values, and are sampled to make regular triangular meshes. The data size of the triangular mesh model can be controlled by merging the vertices that lie on the same plane within user defined error threshold.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.05a
• /
• pp.521-524
• /
• 2005

This paper proposes a fusion algorithm which merges multiple vein pattern images into a single image, larger than those images. As a preprocessing step of template matching, during the verification of biometric data such as fingerprint image, vein pattern image of hand, etc., the fusion technique is used to make reference image larger than the candidate images in order to enhance the matching performance. In this paper, a new algorithm, called BSA (Boundary Stitching Algorithm) is proposed, in which the boundary rectilinear parts extracted from the candidate images are stitched to the reference image in order to enlarge its matching space. By applying BSA to practical vein pattern verification system, its verification rate was increased by about 10%.

• Journal of the Optical Society of Korea
• /
• v.8 no.3
• /
• pp.108-114
• /
• 2004

To allow multiple viewers to see the correct perspective and to provide a singh1 viewer with motion parallax cues during head movement, more than two views arc needed. Since it is prohibitive to acquire, process, and transmit a continuum of views, it. would preferable to acquire only a minimal set of views and to synthesize intermediate images. This paper presents how to synthesize the intermediate images using irregular quadtree decomposition and compares the proposed methods with full-search block matching. The image at the middle viewpoint between both viewpoints is synthesized and yields a 32.8 ㏈ peak-signal-to-noise ratio (PSNR) which is 2.8 ㏈ high and has a running time 30% of that for conventional full-search block matching.

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.2
• /
• pp.82-87
• /
• 2003

In this paper, the color matching algorithm is Proposed for stitching machine. The matched embroidery color threads are selected by using the proposed algorithm from a computer files which is designed on the computer or scanned from the drawings designed by an artist. The proposed algorithm finds the best matching nearest colors from the given embroidery color threads . The multiple candidates owing to have the equal distance in the CIE color space are further processed to find nearest dominant color. The color dithering method will be useful for reproducing original design with high fidelity.

• ETRI Journal
• /
• v.28 no.2
• /
• pp.162-174
• /
• 2006

Several photogrammetric and geographic information system applications such as surface matching, object recognition, city modeling, environmental monitoring, and change detection deal with multiple versions of the same surface that have been derived from different sources and/or at different times. Surface registration is a necessary procedure prior to the manipulation of these 3D datasets. This need is also applicable in the field of medical imaging, where imaging modalities such as magnetic resonance imaging (MRI) can provide temporal 3D imagery for monitoring disease progression. This paper will present a general automated surface registration procedure that can establish correspondences between conjugate surface elements. Experimental results using light detection and ranging (LIDAR) and MRI data will verify the feasibility, robustness, and accuracy of this approach.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.6
• /
• pp.100-110
• /
• 2007

When compressed video data is transmitted over error-prone network such as wireless channel, data is likely to be lost, so the quality of reconstructed picture is severely decreased. It is specially so in case that important information such as motion vector or macroblock mode is lost. H.264/AVC standard includes DP as error resilient technique for protecting important information from error in which data is labeled according to its relative importance. But DP technique requires a network that supports different reliabilities of transmitted data. In general, the benefits of UEP is sought by sending multiple times of same packets corresponding to important information. In this paper, we propose MDC technique based on data partitioning technique. The proposed method encodes motion vector of H.264/AVC standard into multiple parts using MDC and transmits each part as independent packet. Even if partial packet is lost, the proposed scheme can decode the compressed bitstream by using estimated motion vector with partial packets correctly transmitted, so that achieving improved performance of error concealment with minimal effect of channel error. Also in decoding process, the proposed multiple description matching increases the accuracy of estimated lost motion vector and quality of reconstructed video.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.1
• /
• pp.343-364
• /
• 2021

In the 5G era, the communication networks tend to be ultra-densified, which will improve the accuracy of indoor positioning and further improve the quality of positioning service. In this study, we propose an indoor three-dimensional (3D) dynamic reconstruction fingerprint matching algorithm (DSR-FP) in a 5G ultra-dense network. The first step of the algorithm is to construct a local fingerprint matrix having low-rank characteristics using partial fingerprint data, and then reconstruct the local matrix as a complete fingerprint library using the FPCA reconstruction algorithm. In the second step of the algorithm, a dynamic base station matching strategy is used to screen out the best quality service base stations and multiple sub-optimal service base stations. Then, the fingerprints of the other base station numbers are eliminated from the fingerprint database to simplify the fingerprint database. Finally, the 3D estimated coordinates of the point to be located are obtained through the K-nearest neighbor matching algorithm. The analysis of the simulation results demonstrates that the average relative error between the reconstructed fingerprint database by the DSR-FP algorithm and the original fingerprint database is 1.21%, indicating that the accuracy of the reconstruction fingerprint database is high, and the influence of the location error can be ignored. The positioning error of the DSR-FP algorithm is less than 0.31 m. Furthermore, at the same signal-to-noise ratio, the positioning error of the DSR-FP algorithm is lesser than that of the traditional fingerprint matching algorithm, while its positioning accuracy is higher.