• Proceedings of the IEEK Conference
• /
• 2009.05a
• /
• pp.408-410
• /
• 2009

We present an efficient and robust measurement model for visual tracking. This approach builds on and extends work on subspace representations of measurement model. Subspace-based tracking algorithms have been introduced to visual tracking literature for a decade and show considerable tracking performance due to its robustness in matching. However the measures used in their measurement models are often restricted to few approaches. We propose a novel measure of object matching using Angle In Feature Space, which aims to improve the discriminability of matching in subspace. Therefore, our tracking algorithm can distinguish target from similar background clutters which often cause erroneous drift by conventional Distance From Feature Space measure. Experiments demonstrate the effectiveness of the proposed tracking algorithm under severe cluttered background.

• MALSORI
• /
• no.59
• /
• pp.13-25
• /
• 2006

In previous study, the linlog(linear log) RASTA(J-RASTA) approach based on PLP was proposed to deal with both the channel effect and the additive noise. The extraction of PLP required generally more steps and computation than the extraction of widely used MFCC. Thus, in this paper, we apply the linlog function to the MFCC for investigating the possibility of simple compensation method that removes both distortion. With the experimental results, the proposed method shows the similar tendency to the linlog RASTA-PLP_ When the J value is set to le-6, the best ERR(Error Reduction Rate) of 33% is obtained. For applying the linlog function to the feature extraction process, the J value plays a very important role in compensating the corruption. Thus, the study for the adaptive J or noise dependent J estimation is further required.

• International Journal of Internet, Broadcasting and Communication
• /
• v.9 no.1
• /
• pp.9-17
• /
• 2017

This paper describes a process of developing commercial real time image recognition system with company. In this paper we will make a system that is combining an empirical kernel map method and conjugate least squares support vector machine in order to represent images in a low-dimensional subspace for real time image recognition. In the traditional approach calculating these eigenspace models, known as traditional PCA method, model must capture all the images needed to build the internal representation. Updating of the existing eigenspace is only possible when all the images must be kept in order to update the eigenspace, requiring a lot of storage capability. Proposed method allows discarding the acquired images immediately after the update. By experimental results we can show that empirical kernel map has similar accuracy compare to traditional batch way eigenspace method and more efficient in memory requirement than traditional one. This experimental result shows that proposed model is suitable for commercial real time image recognition system.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.8
• /
• pp.749-753
• /
• 2007

In this paper, a generalized version of the Motion Silhouette Image(MSI) called the Generic Motion Silhouette Image (GMSI) is proposed for gait recognition. The GMSI is a gray-level image and involves the spatiotemporal information of individual motion. The GMSI not only generalizes the MSI but also reflects a flexible feature of a gait sequence. Along with the GMSI, we use the Principal Component Analysis(PCA) to reduce the dimensionality of the GMSI and the Nearest Neighbor(NN) for classification. We apply the proposed feature to NLPR database and compare it with the conventional MSI. Experimental results show the effectiveness of the GMSI.

• Computers and Concrete
• /
• v.26 no.5
• /
• pp.411-420
• /
• 2020

Deep Convolution neural network (DCNN) has been widely used in the healthy maintenance of civil infrastructure. Using DCNN to improve crack detection performance has attracted many researchers' attention. In this paper, a light-weight spatial attention network module is proposed to strengthen the representation capability of ResNet and improve the crack detection performance. It utilizes attention mechanism to strengthen the interested objects in global receptive field of ResNet convolution layers. Global average spatial information over all channels are used to construct an attention scalar. The scalar is combined with adaptive weighted sigmoid function to activate the output of each channel's feature maps. Salient objects in feature maps are refined by the attention scalar. The proposed spatial attention module is stacked in ResNet50 to detect crack. Experiments results show that the proposed module can got significant performance improvement in crack detection.

• Journal of Korea Multimedia Society
• /
• v.21 no.4
• /
• pp.478-484
• /
• 2018

The choice of the motion features influences the result of the human action recognition method directly. Many factors often influence the single feature differently, such as appearance of the human body, environment and video camera. So the accuracy of action recognition is restricted. On the bases of studying the representation and recognition of human actions, and giving fully consideration to the advantages and disadvantages of different features, the Dense Trajectories(DT) algorithm is a very classic algorithm in the field of behavior recognition feature extraction, but there are some defects in the use of optical flow images. In this paper, we will use the improved Dense Trajectories(iDT) algorithm to optimize and extract the optical flow features in the movement of human action, then we will combined with Support Vector Machine methods to identify human behavior, and use the image in the KTH database for training and testing.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.3 no.2
• /
• pp.178-186
• /
• 2003

Recently, many researchers have been interested in biometric systems such as fingerprint, handwriting, key-stroke patterns and human iris. From the viewpoint of reliability and robustness, iris recognition is the most attractive biometric system. Moreover, the iris recognition system is a comfortable biometric system, since the video image of an eye can be taken at a distance. In this paper, we discuss human iris recognition, which is based on accurate iris localization, robust feature extraction, and Neural Network classification. The iris region is accurately localized in the eye image using a multiresolution active snake model. For the feature representation, the localized iris image is decomposed using wavelet transform based on dyadic Haar wavelet. Experimental results show the usefulness of wavelet transform in comparison to conventional Gabor transform. In addition, we present a new method for setting initial weight vectors in competitive learning. The proposed initialization method yields better accuracy than the conventional method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.10C
• /
• pp.942-947
• /
• 2006

In this paper, a new feature representation technique called Improved 2-directional 2-dimensional direct linear discriminant analysis (Improved $(2D)^2$ DLDA) is proposed. In the case of face recognition, thesmall sample size problem and need for many coefficients are often encountered. In order to solve these problems, the proposed method uses the direct LDA and 2-directional image scatter matrix. Moreover the selection method of feature vector and the method of similarity measure are proposed. The ORL face database is used to evaluate the performance of the proposed method. The experimental results show that the proposed method obtains better recognition rate and requires lesser memory than the direct LDA.

• Journal of Integrative Natural Science
• /
• v.1 no.2
• /
• pp.133-139
• /
• 2008

Face recognition technologies using PCA(principal component analysis) recognize faces by deciding representative features of faces in the model image, extracting feature vectors from faces in a image and measuring the distance between them and face representation. Given frequent recognition problems associated with the use of point-to-point distance approach, this study adopted the K-nearest neighbor technique(class-to-class) in which a group of face models of the same class is used as recognition unit for the images inputted on a continual input image. This paper proposes a new PCA recognition in which database of faces.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.3
• /
• pp.122-130
• /
• 2009

The paper presents an algorithm which uses code vectors to represent comer geometry information for searching the similar images from a database. The comers have been extracted by finding the intersections of the detected lines found using Hough transform. Taking the comer as the center coordinate, the angles of the intersecting lines are determined and are represented using code vectors. A code book has been used to code each comer geometry information and indexes to the code book are generated. For similarity measurement, the histogram of the code book indexes is used. This result in a significant small size feature matrix compared to the algorithms using color features. Experimental results show that use of code vectors is computationally efficient in similarity measurement and the comers being noise invariant produce good results in noisy environments.