• Title/Summary/Keyword: Feature extraction algorithm

Search Result 877, Processing Time 0.03 seconds

Feature selection for text data via sparse principal component analysis (희소주성분분석을 이용한 텍스트데이터의 단어선택)

  • Won Son
    • The Korean Journal of Applied Statistics
    • /
    • v.36 no.6
    • /
    • pp.501-514
    • /
    • 2023
  • When analyzing high dimensional data such as text data, if we input all the variables as explanatory variables, statistical learning procedures may suffer from over-fitting problems. Furthermore, computational efficiency can deteriorate with a large number of variables. Dimensionality reduction techniques such as feature selection or feature extraction are useful for dealing with these problems. The sparse principal component analysis (SPCA) is one of the regularized least squares methods which employs an elastic net-type objective function. The SPCA can be used to remove insignificant principal components and identify important variables from noisy observations. In this study, we propose a dimension reduction procedure for text data based on the SPCA. Applying the proposed procedure to real data, we find that the reduced feature set maintains sufficient information in text data while the size of the feature set is reduced by removing redundant variables. As a result, the proposed procedure can improve classification accuracy and computational efficiency, especially for some classifiers such as the k-nearest neighbors algorithm.

Multi-view Image Generation from Stereoscopic Image Features and the Occlusion Region Extraction (가려짐 영역 검출 및 스테레오 영상 내의 특징들을 이용한 다시점 영상 생성)

  • Lee, Wang-Ro;Ko, Min-Soo;Um, Gi-Mun;Cheong, Won-Sik;Hur, Nam-Ho;Yoo, Ji-Sang
    • Journal of Broadcast Engineering
    • /
    • v.17 no.5
    • /
    • pp.838-850
    • /
    • 2012
  • In this paper, we propose a novel algorithm that generates multi-view images by using various image features obtained from the given stereoscopic images. In the proposed algorithm, we first create an intensity gradient saliency map from the given stereo images. And then we calculate a block-based optical flow that represents the relative movement(disparity) of each block with certain size between left and right images. And we also obtain the disparities of feature points that are extracted by SIFT(scale-invariant We then create a disparity saliency map by combining these extracted disparity features. Disparity saliency map is refined through the occlusion detection and removal of false disparities. Thirdly, we extract straight line segments in order to minimize the distortion of straight lines during the image warping. Finally, we generate multi-view images by grid mesh-based image warping algorithm. Extracted image features are used as constraints during grid mesh-based image warping. The experimental results show that the proposed algorithm performs better than the conventional DIBR algorithm in terms of visual quality.

Gait Recognition Using Multiple Feature detection (다중 특징점 검출을 이용한 보행인식)

  • Cho, Woon;Kim, Dong-Hyeon;Paik, Joon-Ki
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.44 no.6
    • /
    • pp.84-92
    • /
    • 2007
  • The gait recognition is presented for human identification from a sequence of noisy silhouettes segmented from video by capturing at a distance. The proposed gait recognition algorithm gives better performance than the baseline algorithm because of segmentation of the object by using multiple modules; i) motion detection, ii) object region detection, iii) head detection, and iv) active shape models, which solve the baseline algorithm#s problems to make background, to remove shadow, and to be better recognition rates. For the experiment, we used the HumanID Gait Challenge data set, which is the largest gait benchmarking data set with 122 objects, For realistic simulation we use various values for the following parameters; i) viewpoint, ii) shoe, iii) surface, iv) carrying condition, and v) time.

Markerless Image-to-Patient Registration Using Stereo Vision : Comparison of Registration Accuracy by Feature Selection Method and Location of Stereo Bision System (스테레오 비전을 이용한 마커리스 정합 : 특징점 추출 방법과 스테레오 비전의 위치에 따른 정합 정확도 평가)

  • Joo, Subin;Mun, Joung-Hwan;Shin, Ki-Young
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.53 no.1
    • /
    • pp.118-125
    • /
    • 2016
  • This study evaluates the performance of image to patient registration algorithm by using stereo vision and CT image for facial region surgical navigation. For the process of image to patient registration, feature extraction and 3D coordinate calculation are conducted, and then 3D CT image to 3D coordinate registration is conducted. Of the five combinations that can be generated by using three facial feature extraction methods and three registration methods on stereo vision image, this study evaluates the one with the highest registration accuracy. In addition, image to patient registration accuracy was compared by changing the facial rotation angle. As a result of the experiment, it turned out that when the facial rotation angle is within 20 degrees, registration using Active Appearance Model and Pseudo Inverse Matching has the highest accuracy, and when the facial rotation angle is over 20 degrees, registration using Speeded Up Robust Features and Iterative Closest Point has the highest accuracy. These results indicate that, Active Appearance Model and Pseudo Inverse Matching methods should be used in order to reduce registration error when the facial rotation angle is within 20 degrees, and Speeded Up Robust Features and Iterative Closest Point methods should be used when the facial rotation angle is over 20 degrees.

Feature Extraction Algorithm for Distant Unmmaned Aerial Vehicle Detection (원거리 무인기 신호 식별을 위한 특징추출 알고리즘)

  • Kim, Juho;Lee, Kibae;Bae, Jinho;Lee, Chong Hyun
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.53 no.3
    • /
    • pp.114-123
    • /
    • 2016
  • The effective feature extraction method for unmanned aerial vehicle (UAV) detection is proposed and verified in this paper. The UAV engine sound is harmonic complex tone whose frequency ratio is integer and its variation is continuous in time. Using these characteristic, we propose the feature vector composed of a mean and standard deviation of difference value between fundamental frequency with 1st overtone as well as mean variation of their frequency. It was revealed by simulation that the suggested feature vector has excellent discrimination in target signal identification from various interfering signals including frequency variation with time. By comparing Fisher scores, three features based on frequency show outstanding discrimination of measured UAV signals with low signal to noise ratio (SNR). Detection performance with simulated interference signal is compared by MFCC by using ELM classifier and the suggested feature vector shows 37.6% of performance improvement As the SNR increases with time, the proposed feature can detect the target signal ahead of MFCC that needs 4.5 dB higher signal power to detect the target.

Video retrieval method using non-parametric based motion classification (비-파라미터 기반의 움직임 분류를 통한 비디오 검색 기법)

  • Kim Nac-Woo;Choi Jong-Soo
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.43 no.2 s.308
    • /
    • pp.1-11
    • /
    • 2006
  • In this paper, we propose the novel video retrieval algorithm using non-parametric based motion classification in the shot-based video indexing structure. The proposed system firstly gets the key frame and motion information from each shot segmented by scene change detection method, and then extracts visual features and non-parametric based motion information from them. Finally, we construct real-time retrieval system supporting similarity comparison of these spatio-temporal features. After the normalized motion vector fields is created from MPEG compressed stream, the extraction of non-parametric based motion feature is effectively achieved by discretizing each normalized motion vectors into various angle bins, and considering a mean, a variance, and a direction of these bins. We use the edge-based spatial descriptor to extract the visual feature in key frames. Experimental evidence shows that our algorithm outperforms other video retrieval methods for image indexing and retrieval. To index the feature vectors, we use R*-tree structures.

A Study on Design Parameters for Ready-made Ear Shell of Hearing Aids (보청기용 범용 이어쉘을 위한 설계 파라미터에 관한 연구)

  • Urtnasan, Erdenebayar;Jeon, Yu-Yong;Park, Gyu-Seok;Song, Young-Rok;Lee, Sang-Min
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.60 no.5
    • /
    • pp.1055-1061
    • /
    • 2011
  • In this study, main parameters: aperture, first bend and second bend which express a structure of ear canal are extracted in order to modeling and manufacture the ready-made ear shells of hearing aids. The proposed parameter extraction method consists of 2 important algorithms, aperture detection and feature detection. In the aperture detection algorithm, aperture of 3-D scanned virtual ear impression and parameters relating to ear shell of hearing aid are determined. The feature detection algorithm detects first bend, second bend, and related parameters. Through these two algorithms, parameters for aperture, first bend, and second bend are extracted to model the ready-made ear shell of hearing aid. The values of these extracted parameters from 36 people's right ear impression are analyzed and measured statistically. As a result of the analysis, it has been found that it is possible to classify ready-made ear shell parameters by age and size. The ready-made ear shell parameters are classified 3-size for 20 years old and 2-size for 60 years olde. Using 3D rhino program, virtual ready-made ear shell is reconstructed by parameters of every type, and simulated to model it. A final product was produced by transferring simulation result with rapid prototyping system. The modeled ready-made ear shell is evaluated with the objective and subjective method. Objective method is the comparison volume ratio and overlapped volume ratio of ear impression from randomly chosen 18 people and ready-made ear shell. And subjective method is that the final product of ready-made ear shell is used by users and the satisfaction number drawn from well fitting and comfortable testing was evaluated. In the result of the evaluation, it has been found that volume ration is 70%, big and middle size ready-made ear shell products are possible, and the satisfaction number is high.

Study on R-peak Detection Algorithm of Arrhythmia Patients in ECG (심전도 신호에서 부정맥 환자의 R파 검출 알고리즘 연구)

  • Ahn, Se-Jong;Lim, Chang-Joo;Kim, Yong-Gwon;Chung, Sung-Taek
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.12 no.10
    • /
    • pp.4443-4449
    • /
    • 2011
  • ECG consists of various types of electrical signal on the heart, and feature point of these signals can be detected by analyzing the arrhythmia. So far, feature points extraction method for the detection of arrhythmia done in the many studies. However, it is not suitable for portable device using real time operation due to complicated operation. In this paper, R-peak were extracted using R-R interval and QRS width informations on patients. First, noise of low frequency bands eliminated using butterworth filter, and the R-peak was extracted by R-R interval moving average and QRS width moving average. In order to verify, it was experimented to compare the R-peak of data in MIT-BIH arrhythmia database and the R-peak of suggested algorithm. As a results, it showed an excellent detection for feature point of R-peak, even during the process of operation could be efficient way to confirm.

Deblurring of the Blurred Image Caused by the Vibration of the Interlaced Scan Type Digital Camera (인터레이스드 스캔방식 디지털 카메라의 떨림에 의한 영상블러 제거)

  • Chon Jcechoon
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.23 no.2
    • /
    • pp.165-175
    • /
    • 2005
  • If the interlaced scan type camera moves while an image is filming from the camera, blur is often created from the misalignment of the two images of even and odd lines. This paper proposed an algorithm which removes the misalignment of the even and odd line images cased by the vibration of the interlaced scan type camera. The blurred original image is separated into the even and the odd line images as half size. Based on these two images, two full sized images are generated using interpolation technique. If a big difference between these two interpolated images is generated, the original image is taken while the camera is moving. In this case, a deblurred image is obtained with the alignment of these separated two images through feature point extraction, feature point matching, sub-pixel matching, outlier detection, and image mosaicking processes. This paper demonstrated that the proposed algorithm can create clear images from blurred images caused by various camera motions.

Image Segmentation Based on the Fuzzy Clustering Algorithm using Average Intracluster Distance (평균내부거리를 적용한 퍼지 클러스터링 알고리즘에 의한 영상분할)

  • You, Hyu-Jai;Ahn, Kang-Sik;Cho, Seok-Je
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.9
    • /
    • pp.3029-3036
    • /
    • 2000
  • Image segmentation is one of the important processes in the image information extraction for computer vision systems. The fuzzy clustering methods have been extensively used in the image segmentation because it extracts feature information of the region. Most of fuzzy clustering methods have used the Fuzzy C-means(FCM) algorithm. This algorithm can be misclassified about the different size of cluster because the degree of membership depends on highly the distance between data and the centroids of the clusters. This paper proposes a fuzzy clustering algorithm using the Average Intracluster Distance that classifies data uniformly without regard to the size of data sets. The Average Intracluster Distance takes an average of the vector set belong to each cluster and increases in exact proportion to its size and density. The experimental results demonstrate that the proposed approach has the g

  • PDF