• Title/Summary/Keyword: Feature extraction algorithm

Search Result 877, Processing Time 0.039 seconds

Implementation of Image Processing System for the Defect Inspection of Color Polyethylene (칼라팔레트의 불량 식별을 위한 영상처리 시스템 구현)

  • 김경민;박중조;송명현
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.5 no.6
    • /
    • pp.1157-1162
    • /
    • 2001
  • This paper deals with inspect algorithm using visual system. One of the major problems that arise during polymer production is the estimation of the noise of the color product.(bad pallets) An erroneous output can cause a lot of losses (production and financial losses). Therefore new methods for real-time inspection of the noise are demanded. For this reason, we have presented a development of vision system algorithm for the defect inspection of PE color pallets. First of all, in order to detect the edge of object, the differential filter is used. And we apply to the labelling algorithm for feature extraction. This algorithm is designed for the defect inspection of pallets. The labelling algorithm permits to separate all of the connected components appearing on the pallets. Labelling the connected regions of a image is a fundamental computation in image analysis and machine vision, with a large number of application. Also, we suggested vision processing program in window environment. Simulations and experimental results demonstrate the performance of the proposal algorithm.

  • PDF

Feature Selection Using Submodular Approach for Financial Big Data

  • Attigeri, Girija;Manohara Pai, M.M.;Pai, Radhika M.
    • Journal of Information Processing Systems
    • /
    • v.15 no.6
    • /
    • pp.1306-1325
    • /
    • 2019
  • As the world is moving towards digitization, data is generated from various sources at a faster rate. It is getting humungous and is termed as big data. The financial sector is one domain which needs to leverage the big data being generated to identify financial risks, fraudulent activities, and so on. The design of predictive models for such financial big data is imperative for maintaining the health of the country's economics. Financial data has many features such as transaction history, repayment data, purchase data, investment data, and so on. The main problem in predictive algorithm is finding the right subset of representative features from which the predictive model can be constructed for a particular task. This paper proposes a correlation-based method using submodular optimization for selecting the optimum number of features and thereby, reducing the dimensions of the data for faster and better prediction. The important proposition is that the optimal feature subset should contain features having high correlation with the class label, but should not correlate with each other in the subset. Experiments are conducted to understand the effect of the various subsets on different classification algorithms for loan data. The IBM Bluemix BigData platform is used for experimentation along with the Spark notebook. The results indicate that the proposed approach achieves considerable accuracy with optimal subsets in significantly less execution time. The algorithm is also compared with the existing feature selection and extraction algorithms.

Text Extraction Algorithm in Natural Image using LoG Operator and Coiflet Wavelet (Coiflet Wavelet과 LoG 연산자를 이용한 자연이미지에서의 텍스트 검출 알고리즘)

  • Shin, Seong;Baek, Young-Hyun;Moon, Sung-Ryong;Shin, Hong-Kyu
    • Proceedings of the IEEK Conference
    • /
    • 2005.11a
    • /
    • pp.979-982
    • /
    • 2005
  • This paper is to be pre-processing that decides the text recognizability and quality contained in natural image. Differentiated with the existing studies, In this paper, it suggests the application of partially unified color models, Coiflet Wavelet and text extraction algorithm that uses the closed curve edge features of LoG (laplacian of gaussian)operator. The text image included in natural image such as signboard has the same hue, saturation and value, and there is a certain thickness as for their feature. Each color element is restructured into closed area by LoG operator, the 2nd differential operator. The text area is contracted by Hough Transform, logical AND-OR operator of each color model and Minimum-Distance classifier. This paper targets natural image into which text area is added regardless of the size and resolution of the image, and it is confirmed to have more excellent performance than other algorithms with many restrictions.

  • PDF

Road Centerline Tracking From High Resolution Satellite Imagery By Least Squares Templates Matching

  • Park, Seung-Ran;Kim, Tae-Jung;Jeong, Soo;Kim, Kyung-Ok
    • Proceedings of the KSRS Conference
    • /
    • 2002.10a
    • /
    • pp.34-39
    • /
    • 2002
  • Road information is very important for topographic mapping, transportation application, urban planning and other related application fields. Therefore, automatic detection of road networks from spatial imagery, such as aerial photos and satellite imagery can play a central role in road information acquisition. In this paper, we use least squares correlation matching alone for road center tracking and show that it works. We assumed that (bright) road centerlines would be visible in the image. We further assumed that within a same road segment, there would be only small differences in brightness values. This algorithm works by defining a template around a user-given input point, which shall lie on a road centerline, and then by matching the template against the image along the orientation of the road under consideration. Once matching succeeds, new match proceeds by shifting a matched target window further along road orientation at the target window. By repeating the process above, we obtain a series of points, which lie on a road centerline successively. A 1m resolution IKONOS images over Seoul and Daejeon were used for tests. The results showed that this algorithm could extract road centerlines in any orientation and help in fast and exact he ad-up digitization/vectorization of cartographic images.

  • PDF

A Gaussian Mixture Model Based Pattern Classification Algorithm of Forearm Electromyogram (Gaussian Mixture Model 기반 전완 근전도 패턴 분류 알고리즘)

  • Song, Y.R.;Kim, S.J.;Jeong, E.C.;Lee, S.M.
    • Journal of rehabilitation welfare engineering & assistive technology
    • /
    • v.5 no.1
    • /
    • pp.95-101
    • /
    • 2011
  • In this paper, we propose the gaussian mixture model based pattern classification algorithm of forearm electromyogram. We define the motion of 1-degree of freedom as holding and unfolding hand considering a daily life for patient with prosthetic hand. For the extraction of precise features from the EMG signals, we use the difference absolute mean value(DAMV) and the mean absolute value(MAV) to consider amplitude characteristic of EMG signals. We also propose the D_DAMV and D_MAV in order to classify the amplitude characteristic of EMG signals more precisely. In this paper, we implemented a test targeting four adult male and identified the accuracy of EMG pattern classification of two motions which are holding and unfolding hand.

Face region detection algorithm of natural-image (자연 영상에서 얼굴영역 검출 알고리즘)

  • Lee, Joo-shin
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.7 no.1
    • /
    • pp.55-60
    • /
    • 2014
  • In this paper, we proposed a method for face region extraction by skin-color hue, saturation and facial feature extraction in natural images. The proposed algorithm is composed of lighting correction and face detection process. In the lighting correction step, performing correction function for a lighting change. The face detection process extracts the area of skin color by calculating Euclidian distances to the input images using as characteristic vectors color and chroma in 20 skin color sample images. Eye detection using C element in the CMY color model and mouth detection using Q element in the YIQ color model for extracted candidate areas. Face area detected based on human face knowledge for extracted candidate areas. When an experiment was conducted with 10 natural images of face as input images, the method showed a face detection rate of 100%.

Heterogeneous Face Recognition Using Texture feature descriptors (텍스처 기술자들을 이용한 이질적 얼굴 인식 시스템)

  • Bae, Han Byeol;Lee, Sangyoun
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.14 no.3
    • /
    • pp.208-214
    • /
    • 2021
  • Recently, much of the intelligent security scenario and criminal investigation demands for matching photo and non-photo. Existing face recognition system can not sufficiently guarantee these needs. In this paper, we propose an algorithm to improve the performance of heterogeneous face recognition systems by reducing the different modality between sketches and photos of the same person. The proposed algorithm extracts each image's texture features through texture descriptors (gray level co-occurrence matrix, multiscale local binary pattern), and based on this, generates a transformation matrix through eigenfeature regularization and extraction techniques. The score value calculated between the vectors generated in this way finally recognizes the identity of the sketch image through the score normalization methods.

Automatic Detection of Dead Trees Based on Lightweight YOLOv4 and UAV Imagery

  • Yuanhang Jin;Maolin Xu;Jiayuan Zheng
    • Journal of Information Processing Systems
    • /
    • v.19 no.5
    • /
    • pp.614-630
    • /
    • 2023
  • Dead trees significantly impact forest production and the ecological environment and pose constraints to the sustainable development of forests. A lightweight YOLOv4 dead tree detection algorithm based on unmanned aerial vehicle images is proposed to address current limitations in dead tree detection that rely mainly on inefficient, unsafe and easy-to-miss manual inspections. An improved logarithmic transformation method was developed in data pre-processing to display tree features in the shadows. For the model structure, the original CSPDarkNet-53 backbone feature extraction network was replaced by MobileNetV3. Some of the standard convolutional blocks in the original extraction network were replaced by depthwise separable convolution blocks. The new ReLU6 activation function replaced the original LeakyReLU activation function to make the network more robust for low-precision computations. The K-means++ clustering method was also integrated to generate anchor boxes that are more suitable for the dataset. The experimental results show that the improved algorithm achieved an accuracy of 97.33%, higher than other methods. The detection speed of the proposed approach is higher than that of YOLOv4, improving the efficiency and accuracy of the detection process.

Face Recognition Based on Facial Landmark Feature Descriptor in Unconstrained Environments (비제약적 환경에서 얼굴 주요위치 특징 서술자 기반의 얼굴인식)

  • Kim, Daeok;Hong, Jongkwang;Byun, Hyeran
    • Journal of KIISE
    • /
    • v.41 no.9
    • /
    • pp.666-673
    • /
    • 2014
  • This paper proposes a scalable face recognition method for unconstrained face databases, and shows a simple experimental result. Existing face recognition research usually has focused on improving the recognition rate in a constrained environment where illumination, face alignment, facial expression, and background is controlled. Therefore, it cannot be applied in unconstrained face databases. The proposed system is face feature extraction algorithm for unconstrained face recognition. First of all, we extract the area that represent the important features(landmarks) in the face, like the eyes, nose, and mouth. Each landmark is represented by a high-dimensional LBP(Local Binary Pattern) histogram feature vector. The multi-scale LBP histogram vector corresponding to a single landmark, becomes a low-dimensional face feature vector through the feature reduction process, PCA(Principal Component Analysis) and LDA(Linear Discriminant Analysis). We use the Rank acquisition method and Precision at k(p@k) performance verification method for verifying the face recognition performance of the low-dimensional face feature by the proposed algorithm. To generate the experimental results of face recognition we used the FERET, LFW and PubFig83 database. The face recognition system using the proposed algorithm showed a better classification performance over the existing methods.

Gabor Descriptors Extraction in the SURF Feature Point for Improvement Accuracy in Face Recognition (얼굴 인식의 정확도 향상을 위한 SURF 특징점에서의 Gabor 기술어 추출)

  • Lee, Jae-Yong;Kim, Ji-Eun;Oh, Seoung-Jun
    • Journal of Broadcast Engineering
    • /
    • v.17 no.5
    • /
    • pp.808-816
    • /
    • 2012
  • Face recognition has been actively studied and developed in various fields. In recent years, interest point extraction algorithms mainly used for object recognition were being applied to face recognition. The SURF(Speeded Up Robust Features) algorithm was used in this paper which was one of typical interest point extraction algorithms. Generally, the interest points extracted from human faces are less distinctive than the interest points extracted from objects due to the similar shapes of human faces. Thus, the accuracy of the face recognition using SURF tends to be low. In order to improve it, we propose a face recognition algorithm which performs interest point extraction by SURF and the Gabor wavelet transform to extract descriptors from the interest points. In the result, the proposed method shows around 23% better recognition accuracy than SURF-based conventional methods.