• 한국산업융합학회 논문집
• /
• 제8권4호
• /
• pp.221-226
• /
• 2005

This paper presents a hybrid method for recognizing the faces by using zero mean and principal component analysis. Zero mean is applied to reduce the 1st order statistics to data nonlinearities. PCA is also used to derive an orthonormal basis which directly leads to dimensionality reduction, and possibly to feature extraction of face image. The proposed method has been applied to the problems for recognizing the 20 face images(10 persons * 2 scenes) of 324*243 pixels from Yale face database. The 3 distances such as city-block, Euclidean, negative angle are used as measures when match the probe images to the nearest gallery images. The experimental results show that the proposed method has a superior recognition performances(speed, rate). The negative angle has been relatively achieved more an accurate similarity than city-block or Euclidean.

• International Journal of Contents
• /
• 제4권2호
• /
• pp.24-28
• /
• 2008

In this paper, we propose a new approach for content-based video retrieval using non-parametric based motion classification in the shot-based video indexing structure. Our system proposed in this paper has supported the real-time video retrieval using spatio-temporal feature comparison by measuring the similarity between visual features and between motion features, respectively, after extracting representative frame and non-parametric motion information from shot-based video clips segmented by scene change detection method. The extraction of non-parametric based motion features, after the normalized motion vectors are created from an MPEG-compressed stream, is effectively fulfilled by discretizing each normalized motion vector into various angle bins, and by considering the mean, variance, and direction of motion vectors in these bins. To obtain visual feature in representative frame, we use the edge-based spatial descriptor. Experimental results show that our approach is superior to conventional methods with regard to the performance for video indexing and retrieval.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2008년도 하계종합학술대회
• /
• pp.909-910
• /
• 2008

For evaluating the performance of some codecs, many researchers have study and develop new objective video quality assessments. However, it's not sufficient for evaluating the temporal feature of video data yet, which is a distinguishable and representative characteristic when compared with other multimedia. This paper propose the method to apply the weight to SSIM (Structural SIMilarity) according to the cognitive psychological feature. And, we presented that the performance of objective video quality assessment applied the weight to SSIM by using the proposed method is superior to one of original SSIM.

• 산업기술연구
• /
• 제21권A호
• /
• pp.155-166
• /
• 2001

This paper deals with the subsequence searching problem under time-warping. Our work is motivated by the observation that subsequence searches slow down quadratically as the average length of data sequences increases. To resolve this problem, the Segment-Based Approach for Subsequence Searches (SBASS) is proposed. The SBASS divides data and query sequences into a series of segments, and retrieves all data subsequences. Our segmentation scheme allows segments to have different lengths; thus we employ the time warping distance as a similarity measure for each segment pair. For efficient retrieval of similar subsequences, we extract feature vectors from all data segments exploiting their monotonically changing properties, and build a spatial index using feature vectors. The effectiveness of our approach is verified through extensive experiments.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 하계종합학술대회 논문집(3)
• /
• pp.227-230
• /
• 2002

In this paper we concentrate on overall direction of the gaze based on a head pose for human computer interaction. To decide a gaze direction of user in a image, it is important to pick up facial feature exactly. For this, we binarize the input image and search two eyes and the mouth through the similarity of each block ( aspect ratio, size, and average gray value ) and geometric information of face at the binarized image. We create a imaginary plane on the line made by features of the real face and the pin hole of the camera to decide the head orientation. We call it the virtual facial plane. The position of a virtual facial plane is estimated through projected facial feature on the image plane. We find a gaze direction using the surface normal vector of the virtual facial plane. This study using popular PC camera will contribute practical usage of gaze tracking technology.

• 한국통신학회논문지
• /
• 제31권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.

• 한국염색가공학회지
• /
• 제21권1호
• /
• pp.53-58
• /
• 2009

A real-time inspection system has been developed by combining CCD based image processing algorithm and a standard lighting equipment. The system was tested for defective fabrics showing nozzle contact scratch marks, which were one of the frequently occurring defects. Multi-resolution analysis(MRA) algorithm were used and evaluated according to both their processing time and detection rate. Standard value for defective inspection was the mean of the non-defect image feature. Similarity was decided via comparing standard value with sample image feature value. Totally, we achieved defective inspection accuracy above 95%.

• Journal of Information Processing Systems
• /
• 제8권1호
• /
• pp.85-100
• /
• 2012

The Hartley transform based feature extraction method is proposed for fingerprint matching. Hartley transform is applied on a smaller region that has been cropped around the core point. The performance of this proposed method is evaluated based on the standard database of Bologna University and the database of the FVC2002. We used the city block distance to compute the similarity between the test fingerprint and database fingerprint image. The results obtained are compared with the discrete wavelet transform (DWT) based method. The experimental results show that, the proposed method reduces the false acceptance rate (FAR) from 21.48% to 16.74 % based on the database of Bologna University and from 31.29% to 28.69% based on the FVC2002 database.

• International Journal of Internet, Broadcasting and Communication
• /
• 제7권1호
• /
• pp.36-41
• /
• 2015

This paper is proposed a wavelet-based MCDT(Mask Coefficient Differential and Threshold) method of image registration of Multi-images contaminated with visible image and infrared image. The method for ensure reliability of the image registration is to the increase statistical corelation as getting the common feature points between two images. The method of threshold the wavelet coefficients using derivatives of the wavelet coefficients of the detail subbands was proposed to effectively registration images with distortion. And it can define that the edge map. Particularly, in order to increase statistical corelation the method of the normalized mutual information. as similarity measure common feature between two images was selected. The proposed method is totally verified by comparing with the several other multi-image and the proposed image registration.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2006년도 추계학술대회 학술발표 논문집 제16권 제2호
• /
• pp.285-288
• /
• 2006

Most previous studies on improving the effectiveness of CBR have focused on the similarity function aspect or optimization of case features and their weights. However, according to some of the prior research, finding the optimal k parameter for the k-nearest neighbor (k-NN) is also crucial for improving the performance of the CBR system. Nonetheless, there have been few attempts to optimize the number of neighbors, especially using artificial intelligence (AI) techniques. In this study, we introduce a genetic algorithm (GA) to optimize the number of neighbors that combine, as well as the weight of each feature. The new model is applied to the real-world case of a major telecommunication company in Korea in order to build the prediction model for the customer profitability level. Experimental results show that our GA-optimized CBR approach outperforms other AI techniques for this mulriclass classification problem.