• Journal of the Korean Society of Industry Convergence
• /
• v.24 no.6_1
• /
• pp.693-698
• /
• 2021

As technology advances, there is increasing need for research in different fields where this technology is applied. On of the most researched topic in computer vision is Human activity recognition (HAR), which has widely been implemented in various fields which include healthcare, video surveillance and education. We therefore present in this paper a human activity recognition system based on scale and rotation while employing the Kinect depth sensors to obtain the human skeleton joints. In contrast to previous approaches that use joint angles, in this paper we propose that each limb has an angle with the X, Y, Z axes which we employ as feature vectors. The use of the joint angles makes our system scale invariant. We further calculate the body relative direction in the egocentric coordinates in order to provide the rotation invariance. For the system parameters, we employ 8 limbs with their corresponding angles each having the X, Y, Z axes from the coordinate system as feature vectors. The extracted features are finally trained and tested with the Long short term memory (LSTM) Network which gives us an average accuracy of 98.3%.

• Journal of the HCI Society of Korea
• /
• v.2 no.2
• /
• pp.35-43
• /
• 2007

This paper presents a system for image matching and recognition based on image feature detection and description techniques from artificial satellite photographs. We propose some kind of parameters from the varied environmental elements happen by image handling process. The essential point of this experiment is analyzes that affects match rate and recognition accuracy when to change of state of each parameter. The proposed system is basically inspired by Lowe's SIFT(Scale-Invariant Transform Feature) algorithm. The descriptors extracted from local affine invariant regions are saved into database, which are defined by k-means performed on the 128-dimensional descriptor vectors on an artificial satellite photographs from Google earth. And then, a label is attached to each cluster of the feature database and acts as guidance for an appeared building's information in the scene from camera. This experiment shows the various parameters and compares the affected results by changing parameters for the process of image matching and recognition. Finally, the implementation and the experimental results for several requests are shown.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.7 no.2
• /
• pp.34-42
• /
• 1997

This paper deals with the recognition of closed planar shape using a three dimensional spectral feature vector which is derived from the FFT(Fast Fourier Transform) spectrum of contour sequence and fuzzy ARTMAP neural network classifier. Contour sequences obtained from 2-D planar images represent the Euclidean distance between the centroid and all boundary pixels of the shape, and are related to the overall shape of the images. The Fourier transform of contour sequence and spectrum analyzer are used as a means of feature selection and data reduction. The three dimensional spectral feature vectors are extracted by spectrum analyzer from the FFT spectrum. These spectral feature vectors are invariant to shape translation, rotation and scale transformation. The fuzzy ARTMAP neural network which is combined with two fuzzy ART modules is trained and tested with these feature vectors. The experiments including 4 aircrafts and 4 industrial parts recognition process are presented to illustrate the high performance of this proposed method in the recognition problems of noisy shapes.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.73-76
• /
• 2001

It is well-known that the convergence rate gets worse when an input signal to an adaptive filter is correlated. In this paper we propose a new adaptive filtering algorithm that makes the convergence rate highly improved even for highly correlated input signals. By introducing an orthogonal constraint between successive input signal vectors, we overcome the slow convergence problem caused by the correlated input signal. Simulation results show that the proposed algorithm yields highly improved convergence speed and excellent tracking capability under both time-invariant and time varying environments, while keeping both computation and implementation simple.

• Proceedings of the IEEK Conference
• /
• 2000.09a
• /
• pp.375-378
• /
• 2000

In this paper, we propose a novo] content-based image retrieval system using both Hidden Markov Model(HMM) and an improved chain code. The Gaussian Mixture Model(GMM) is applied to statistically model a color information of the image, and Deterministic Annealing EM(DAEM) algorithm is employed to estimate the parameters of GMM. This result is used to segment the given image. We use an improved chain code, which is invariant to rotation, translation and scale, to extract the feature vectors of the shape for each image in the database. These are stored together in the database with each HMM whose parameters (A, B, $\pi$) are estimated by Baum-Welch algorithm. With respect to feature vector obtained in the same way from the query image, a occurring probability of each image is computed by using the forward algorithm of HMM. We use these probabilities for the image retrieval and present the highest similarity images based on these probabilities.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2009.01a
• /
• pp.49-54
• /
• 2009

A fuzzy weighted mean method on a 2D shape recognition system is introduced in this paper. The bispectrum based on third order cumulant is applied to the contour sequence of each image for the extraction of a feature vector. This bispectral feature vector, which is invariant to shape translation, rotation and scale, represents a 2D planar image. However, to obtain the best performance, it should be considered certain criterion on the calculation of weights for the fuzzy weighted mean method. Therefore, a new method to calculate weights using means by differences of feature values and their variances with the maximum distance from differences of feature values. is developed. In the experiments, the recognition results with fifteen dimensional bispectral feature vectors, which are extracted from 11.808 aircraft images based on eight different styles of reference images, are compared and analyzed.

• ETRI Journal
• /
• v.38 no.3
• /
• pp.502-509
• /
• 2016

Feature detection and description are key ingredients of common image processing and computer vision applications. Most existing algorithms focus on robust feature matching under challenging conditions, such as inplane rotations and scale changes. Consequently, they usually fail when the scene is blurred by camera shake or an object's motion. To solve this problem, we propose a new feature description algorithm that is robust to image blur and significantly improves the feature matching performance. The proposed algorithm builds a feature descriptor by considering the integral projection along four angular directions ($0^{\circ}$, $45^{\circ}$, $90^{\circ}$, and $135^{\circ}$) and by combining four projection vectors into a single highdimensional vector. Intensive experiment shows that the proposed descriptor outperforms existing descriptors for different types of blur caused by linear motion, nonlinear motion, and defocus. Furthermore, the proposed descriptor is robust to intensity changes and image rotation.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.45 no.2
• /
• pp.90-94
• /
• 2008

It is well-blown that the convergence rate gets worse when an input signal to an adaptive filter is correlated. In this paper we propose a new adaptive filtering algorithm that makes the convergence rate much improved even for highly correlated input signals. By introducing an orthogonal constraint between successive input signal vectors we overcome the slow convergence problem of the LMS algorithm with the correlated input signal. Simulation results show that the proposed algerian yields fast convergence speed and excellent tracking capability under both time-invariant and time-varying environments, while keeping both computation and implementation simple.

• Journal of the Korean Society for Precision Engineering
• /
• v.16 no.10
• /
• pp.194-202
• /
• 1999

A method for pattern recognition based on wavelet transform is proposed in this paper. The boundary of the object to be recognized includes shape information for object of machine parts. The contour is first represented using a one-dimensional signal and normalized about translation, rotation and scale, then is used to build the wavelet transform representation of the object. Wavelets allow us to decompose a function into multi-resolution hierarchy of localized frequency bands. The recognition of 2-dimensional object based on the wavelet is described to analyze the shape of analysis technique; the discrete wavelet transform(DWT). The feature vectors obtained using wavelet analysis is classified using a multi-layer neural network. The results show that, compared with the use of fourier descriptors, recognition using wavelet is more stable and efficient representation. And particularly the performance for objects corrupted with noise is better than that of other method.

• Proceedings of the KIEE Conference
• /
• 2000.07d
• /
• pp.2930-2932
• /
• 2000

In this paper. a robust gesture recognition system is designed and implemented to explore the communication methods between human and computer. Hand gestures in the proposed approach are used to communicate with a computer for actions of a high degree of freedom. The user does not need to wear any cumbersome devices like cyber-gloves. No assumption is made on whether the user is wearing any ornaments and whether the user is using the left or right hand gestures. Image segmentation based upon the skin-color and a shape analysis based upon the invariant moments are combined. The features are extracted and used for input vectors to a radial basis function networks(RBFN). Our "Puppy" robot is employed as a testbed. Preliminary results on a set of gestures show recognition rates of about 87% on the a real-time implementation.