• ETRI Journal
• /
• v.35 no.2
• /
• pp.281-291
• /
• 2013

A video signature is a set of feature vectors that compactly represents and uniquely characterizes one video clip from another for fast matching. To find a short duplicated region, the video signature must be robust against common video modifications and have a high discriminability. The matching method must be fast and be successful at finding locations. In this paper, a frame-based video signature that uses the spatial information and a two-stage matching method is presented. The proposed method is pair-wise independent and is robust against common video modifications. The proposed two-stage matching method is fast and works very well in finding locations. In addition, the proposed matching structure and strategy can distinguish a case in which a part of the query video matches a part of the target video. The proposed method is verified using video modified by the VCE7 experimental conditions found in MPEG-7. The proposed video signature method achieves a robustness of 88.7% under an independence condition of 5 parts per million with over 1,000 clips being matched per second.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.10a
• /
• pp.434-437
• /
• 2010

NIPS(Network Intrusion Prevention System) is in line at the end of the external and internal networks which performed two kinds of action: Signature-based filtering and anomaly detection and prevention-based on self-learning. Among them, a signature-based filtering is well known to defend against attacks. By using signature-based filtering, intrusion prevention system passing a payload of packets is compared with attack patterns which are signature. If match, the packet is discard. However, when there is packet delay, it will increase the required pattern matching time as the number of signature is increasing whenever there is delay occur. Therefore, to ensure the performance of IPS, we needed more efficient pattern matching algorithm for high-performance ISP. To improve the performance of pattern matching the most important part is to reduce the number of comparisons signature rules and the packet whenever the packets arrive. In this paper, we propose an improve signature hashing-based pattern matching method. We use tuple pruning algorithm with Bloom filters, which effectively remove unnecessary tuples. Unlike other existing signature hashing-based IPS, our proposed method to improve the performance of IPS.

• Journal of Korea Multimedia Society
• /
• v.12 no.6
• /
• pp.785-793
• /
• 2009

This paper proposes a signature using dominant singular values for video sequence matching. By considering the input image as matrix A, a partition procedure is first performed to separate the matrix into non-overlapping sub-images of a fixed size. The SVD(Singular Value Decomposition) process decomposes matrix A into a singular value-singular vector factorization. As a result, singular values are obtained for each sub-image, then k dominant singular values which are sufficient to discriminate between different images and are robust to image size variation, are chosen and normalized as the signature for each block in an image frame for matching between the reference video clip and the query one. Experimental results show that the proposed video signature has a better performance than ordinal signature in ROC curve.

• Journal of KIISE:Software and Applications
• /
• v.34 no.12
• /
• pp.1065-1074
• /
• 2007

Among various methods to compare reference signatures with an input signature, the segment-to-segment matching method has more advantages than global and point-to-point methods. However, the segment-to-segment matching method has the problem of having lower recognition rate according to the variation of partitioning points. To resolve this drawback, this paper proposes a signature verification method by considering linear discriminant analysis as well as segment-to-segment matching method. For the final decision step, we adopt statistical based Bayesian classifier technique to effectively combine two individual systems. Under the various experiments, the proposed method shows better performance than segment-to-segment based matching method.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2005.04a
• /
• pp.419-423
• /
• 2005

This paper is a research on feature extraction and comparison method of dynamic (on-line) signature verification. We suggest desirable feature information and modified DTW(Dynamic Time Warping) and describe the performance results of our enhanced dynamic signature verification system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.3
• /
• pp.575-585
• /
• 2015

The traffic classification is a preliminary and essential step for stable network service provision and efficient network resource management. However, the payload signature-based method has significant drawbacks in high-speed network environment that the processing speed is much slower than other methods such as header-based and statistical methods. In addition, as signature numbers are increasing, traffic analysis speed also declines because of signature matching method that does not consider analytic efficiency of each signature and traffic occurrence feature. In this paper, we propose a signature list reordering method in order by analytic value of each signature. When we reordered the signature list by the proposed method, we achieved about 30% improvement in speed of the traffic analysis compared with random signature list.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.1
• /
• pp.12-17
• /
• 2005

The segment matching method shows better performance than the global and points-based methods to compare reference signature with an input signature. However, the segment-to-segment matching method has the problem of decreasing recognition rate according to the variation of partitioning points. This paper proposes a fusion model based on the segment matching and HMM to construct a more reliable authentic system. First, a segment matching classifier is designed by conventional technique to calculate matching values lot dynamic information of signatures. And also, a novel HMM classifier is constructed by using the principal component analysis to calculate matching values for static information of signatures. Finally, SVM classifier is adopted to effectively combine two independent classifiers. From the various experiments, we find that the proposed method shows better performance than the conventional segment matching method.

• Journal of Korea Multimedia Society
• /
• v.10 no.9
• /
• pp.1220-1228
• /
• 2007

This paper presents a new system for online signature verification, approaching for finding gaps between a point-to-point matching and a segment-to-segment matching. Each matching algorithm has been separately used in previous studies. Various features with respect to each matching algorithm have been extracted for solving two-class classification problem. We combined advantages of the two algorithms to implement an efficient system for online signature verification. In the proposed method, extreme feints are used to extract writer-dependent features. In addition, using the writer-dependent features proves to be more adaptive than using writer-independent features in terms of efficiency of classification and verification in this paper.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.7
• /
• pp.1339-1346
• /
• 2015

The traffic identification is a preliminary and essential step for stable network service provision and efficient network resource management. While a number of identification methods have been introduced in literature, the payload signature-based identification method shows the highest performance in terms of accuracy, completeness, and practicality. However, the payload signature-based method's processing speed is much slower than other identification method such as header-based and statistical methods. In this paper, we first classifies signatures by matching type based on range, order, and direction of packet in a flow which was automatically extracted. By using this classification, we suggest a novel method to improve processing speed of payload signature-based identification by reducing searching space.

• Transactions of the Korean Society of Machine Tool Engineers
• /
• v.15 no.5
• /
• pp.37-43
• /
• 2006

The target of this study is development of web based mold discrimination system by matching vision information with CAD database. The use of 2D vision image makes possible speedy mold discrimination from many databases. The image processing such as preprocessing, cleaning is done for obtaining vivid image with object information. The web-based system is a program which runs to exchange messages between a server and a client by making of ActiveX control and the result of mold discrimination is shown on web-browser. For effective feature classification and extraction, signature method is used to make sensible information from 2D data. As a result, the possibility of proposed system is shown as matching feature information from vision image with CAD database samples.