• Title/Summary/Keyword: Feature detection

Search Result 2,221, Processing Time 0.026 seconds

An Acceleration Method of Face Detection using Forecast Map (예측맵을 이용한 얼굴탐색의 가속화기법)

  • 조경식;구자영
    • Journal of the Korea Society of Computer and Information
    • /
    • v.8 no.2
    • /
    • pp.31-36
    • /
    • 2003
  • This paper proposes an acceleration method of PCA(Principal Component Analysis) based feature detection. The feature detection method makes decision whether the target feature is included in a given image, and if included, calculates the position and extent of the target feature. The position and scale of the target feature or face is not known previously, all the possible locations should be tested for various scales to detect the target. This is a search Problem in huge search space. This Paper proposes a fast face and feature detection method by reducing the search space using the multi-stage prediction map and contour Prediction map. A Proposed method compared to the existing whole search way, and it was able to reduce a computational complexity below 10% by experiment.

  • PDF

Change Detection in Bitemporal Remote Sensing Images by using Feature Fusion and Fuzzy C-Means

  • Wang, Xin;Huang, Jing;Chu, Yanli;Shi, Aiye;Xu, Lizhong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.4
    • /
    • pp.1714-1729
    • /
    • 2018
  • Change detection of remote sensing images is a profound challenge in the field of remote sensing image analysis. This paper proposes a novel change detection method for bitemporal remote sensing images based on feature fusion and fuzzy c-means (FCM). Different from the state-of-the-art methods that mainly utilize a single image feature for difference image construction, the proposed method investigates the fusion of multiple image features for the task. The subsequent problem is regarded as the difference image classification problem, where a modified fuzzy c-means approach is proposed to analyze the difference image. The proposed method has been validated on real bitemporal remote sensing data sets. Experimental results confirmed the effectiveness of the proposed method.

A person detection in HEVC bitstream domain based on bits density feature and YOLOv3 framework

  • Wiratama, Wahyu;Sim, Donggyu
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2019.11a
    • /
    • pp.169-171
    • /
    • 2019
  • This paper proposes an algorithm to detect persons in bitstream domain by skipping a reconstruction picture process in HEVC decoding. A new 3-channel feature extraction map is introduced in this paper by modelling the relationship between bits per CU density, average PU shape in CU, and total transform coefficients in CU from syntax elements. A state-of-the-art of YOLOv3 detection algorithm is used to detect and localize person on extracted feature maps. Based on the experimental results, the proposed person detection framework can achieve mAP of 0.68 and be able to find persons on feature maps. In addition, the proposed person detection can save decoding time about 60% by removing reconstruction picture process.

  • PDF

Evaluation of HOG-Family Features for Human Detection using PCA-SVM (PCA-SVM을 이용한 Human Detection을 위한 HOG-Family 특징 비교)

  • Setiawan, Nurul Arif;Lee, Chil-Woo
    • 한국HCI학회:학술대회논문집
    • /
    • 2008.02a
    • /
    • pp.504-509
    • /
    • 2008
  • Support Vector Machine (SVM) is one of powerful learning machine and has been applied to varying task with generally acceptable performance. The success of SVM for classification tasks in one domain is affected by features which represent the instance of specific class. Given the representative and discriminative features, SVM learning will give good generalization and consequently we can obtain good classifier. In this paper, we will assess the problem of feature choices for human detection tasks and measure the performance of each feature. Here we will consider HOG-family feature. As a natural extension of SVM, we combine SVM with Principal Component Analysis (PCA) to reduce dimension of features while retaining most of discriminative feature vectors.

  • PDF

Detection of Main Spindle Bearing Defects in Machine Tool by Acoustic Emission Signal via Neural Network Methodology (AE 신호 및 신경회로망을 이용한 공작기계 주축용 베어링 결함검출)

  • 정의식
    • Journal of the Korean Society of Manufacturing Technology Engineers
    • /
    • v.6 no.4
    • /
    • pp.46-53
    • /
    • 1997
  • This paper presents a method of detection localized defects on tapered roller bearing in main spindle of machine tool system. The feature vectors, i.e. statistical parameters, in time-domain analysis technique have been calculated to extract useful features from acoustic emission signals. These feature vectors are used as the input feature of an neural network to classify and detect bearing defects. As a results, the detection of bearing defect conditions could be sucessfully performed by using an neural network with statistical parameters of acoustic emission signals.

  • PDF

Gabor-Features Based Wavelet Decomposition Method for Face Detection (얼굴 검출을 위한 Gabor 특징 기반의 웨이블릿 분해 방법)

  • Lee, Jung-Moon;Choi, Chan-Sok
    • Journal of Industrial Technology
    • /
    • v.28 no.B
    • /
    • pp.143-148
    • /
    • 2008
  • A real-time face detection is to find human faces robustly under the cluttered background free from the effect of occlusion by other objects or various lightening conditions. We propose a face detection system for real-time applications using wavelet decomposition method based on Gabor features. Firstly, skin candidate regions are extracted from the given image by skin color filtering and projection method. Then Gabor-feature based template matching is performed to choose face cadidate from the skin candidate regions. The chosen face candidate region is transformed into 2-level wavelet decomposition images, from which feature vectors are extracted for classification. Based on the extracted feature vectors, the face candidate region is finally classified into either face or nonface class by the Levenberg-Marguardt back-propagation neural network.

  • PDF

Design and Evaluation of a Dynamic Anomaly Detection Scheme Considering the Age of User Profiles

  • Lee, Hwa-Ju;Bae, Ihn-Han
    • Journal of the Korean Data and Information Science Society
    • /
    • v.18 no.2
    • /
    • pp.315-326
    • /
    • 2007
  • The rapid proliferation of wireless networks and mobile computing applications has changed the landscape of network security. Anomaly detection is a pattern recognition task whose goal is to report the occurrence of abnormal or unknown behavior in a given system being monitored. This paper presents a dynamic anomaly detection scheme that can effectively identify a group of especially harmful internal masqueraders in cellular mobile networks. Our scheme uses the trace data of wireless application layer by a user as feature value. Based on the feature values, the use pattern of a mobile's user can be captured by rough sets, and the abnormal behavior of the mobile can be also detected effectively by applying a roughness membership function with both the age of the user profile and weighted feature values. The performance of our scheme is evaluated by a simulation. Simulation results demonstrate that the anomalies are well detected by the proposed dynamic scheme that considers the age of user profiles.

  • PDF

Robust appearance feature learning using pixel-wise discrimination for visual tracking

  • Kim, Minji;Kim, Sungchan
    • ETRI Journal
    • /
    • v.41 no.4
    • /
    • pp.483-493
    • /
    • 2019
  • Considering the high dimensions of video sequences, it is often challenging to acquire a sufficient dataset to train the tracking models. From this perspective, we propose to revisit the idea of hand-crafted feature learning to avoid such a requirement from a dataset. The proposed tracking approach is composed of two phases, detection and tracking, according to how severely the appearance of a target changes. The detection phase addresses severe and rapid variations by learning a new appearance model that classifies the pixels into foreground (or target) and background. We further combine the raw pixel features of the color intensity and spatial location with convolutional feature activations for robust target representation. The tracking phase tracks a target by searching for frame regions where the best pixel-level agreement to the model learned from the detection phase is achieved. Our two-phase approach results in efficient and accurate tracking, outperforming recent methods in various challenging cases of target appearance changes.

A Fast and Efficient Haar-Like Feature Selection Algorithm for Object Detection (객체검출을 위한 빠르고 효율적인 Haar-Like 피쳐 선택 알고리즘)

  • Chung, Byung Woo;Park, Ki-Yeong;Hwang, Sun-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38A no.6
    • /
    • pp.486-491
    • /
    • 2013
  • This paper proposes a fast and efficient Haar-like feature selection algorithm for training classifier used in object detection. Many features selected by Haar-like feature selection algorithm and existing AdaBoost algorithm are either similar in shape or overlapping due to considering only feature's error rate. The proposed algorithm calculates similarity of features by their shape and distance between features. Fast and efficient feature selection is made possible by removing selected features and features with high similarity from feature set. FERET face database is used to compare performance of classifiers trained by previous algorithm and proposed algorithm. Experimental results show improved performance comparing classifier trained by proposed method to classifier trained by previous method. When classifier is trained to show same performance, proposed method shows 20% reduction of features used in classification.

Feature Selection Algorithms in Intrusion Detection System: A Survey

  • MAZA, Sofiane;TOUAHRIA, Mohamed
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.10
    • /
    • pp.5079-5099
    • /
    • 2018
  • Regarding to the huge number of connections and the large flow of data on the Internet, Intrusion Detection System (IDS) has a difficulty to detect attacks. Moreover, irrelevant and redundant features influence on the quality of IDS precisely on the detection rate and processing cost. Feature Selection (FS) is the important technique, which gives the issue for enhancing the performance of detection. There are different works have been proposed, but a map for understanding and constructing a state of the FS in IDS is still need more investigation. In this paper, we introduce a survey of feature selection algorithms for intrusion detection system. We describe the well-known approaches that have been proposed in FS for IDS. Furthermore, we provide a classification with a comparative study between different contribution according to their techniques and results. We identify a new taxonomy for future trends and existing challenges.