• Title/Summary/Keyword: binary feature

Search Result 359, Processing Time 0.027 seconds

Self-Organizing Feature Map with Constant Learning Rate and Binary Reinforcement (일정 학습계수와 이진 강화함수를 가진 자기 조직화 형상지도 신경회로망)

  • 조성원;석진욱
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.32B no.1
    • /
    • pp.180-188
    • /
    • 1995
  • A modified Kohonen's self-organizing feature map (SOFM) algorithm which has binary reinforcement function and a constant learning rate is proposed. In contrast to the time-varing adaptaion gain of the original Kohonen's SOFM algorithm, the proposed algorithm uses a constant adaptation gain, and adds a binary reinforcement function in order to compensate for the lowered learning ability of SOFM due to the constant learning rate. Since the proposed algorithm does not have the complicated multiplication, it's digital hardware implementation is much easier than that of the original SOFM.

  • PDF

Binary Image Watermarking for Preserving Feature Regions (특징영역을 보존한 이진영상의 워터마킹)

  • 이정환
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.6 no.4
    • /
    • pp.624-631
    • /
    • 2002
  • In this paper, an effective digital watermarking method for copyright protection of binary image data is proposed. First a binary image is grouped into feature regions which has geometrical features and general one. The watermark for authentication is embedded in general regions in order to preserve geometrical features regions. We have used run-length code and special runs for grouping feature regions and general one. For invisibility of watermark, we have embedded the watermark considering transition sensitivity of each pixel in general regions. The proposed method is applied some binary image such as character, signature, seal, and fingerprint image to evaluate performance. By the experimental results, the proposed method preserve feature regions of original image and have higher invisibility of watermarks.

Binary Image Watermarking Based on Grouping Feature Regions (특수런을 이용한 특징영역 분리에 의한 이진영상 워터마킹)

  • 이정환;박세현;노석호
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2002.05a
    • /
    • pp.177-180
    • /
    • 2002
  • In this paper, an effective digital watermarking method for copyright protection of binary image data is proposed. First, a binary image is grouped into feature regions which have geometrical features and general one. The watermark for authentication is embedded in general regions in order to preserve geometrical features regions. We have used run-length code and special runs for grouping feature regions and general one. For invisibility of watermark, we have embedded the watermark considering transition sensitivity of each pixel in general regions. The proposed method is applied to some binary image such as character, signature, seal, and fingerprint image to evaluate performance. By the experimental results, the proposed method preserve feature regions of original image and have higher invisibility of watermarks.

  • PDF

Binary Hashing CNN Features for Action Recognition

  • Li, Weisheng;Feng, Chen;Xiao, Bin;Chen, Yanquan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.9
    • /
    • pp.4412-4428
    • /
    • 2018
  • The purpose of this work is to solve the problem of representing an entire video using Convolutional Neural Network (CNN) features for human action recognition. Recently, due to insufficient GPU memory, it has been difficult to take the whole video as the input of the CNN for end-to-end learning. A typical method is to use sampled video frames as inputs and corresponding labels as supervision. One major issue of this popular approach is that the local samples may not contain the information indicated by the global labels and sufficient motion information. To address this issue, we propose a binary hashing method to enhance the local feature extractors. First, we extract the local features and aggregate them into global features using maximum/minimum pooling. Second, we use the binary hashing method to capture the motion features. Finally, we concatenate the hashing features with global features using different normalization methods to train the classifier. Experimental results on the JHMDB and MPII-Cooking datasets show that, for these new local features, binary hashing mapping on the sparsely sampled features led to significant performance improvements.

Face Detection for Interactive TV Control System in Near Infra-Red Images (인터랙티브 TV 컨트롤 시스템을 위한 근적외선 영상에서의 얼굴 검출)

  • Won, Chul-Ho
    • Journal of Sensor Science and Technology
    • /
    • v.20 no.6
    • /
    • pp.388-392
    • /
    • 2011
  • In this paper, a face detection method for interactive TV control system using a new feature, edge histogram feature, with a support vector machine(SVM) in the near-infrared(NIR) images is proposed. The edge histogram feature is extracted using 16-directional edge intensity and a histogram. Compared to the previous method using local binary pattern(LBP) feature, the proposed method using edge histogram feature has better performance in both smaller feature size and lower equal error rate(EER) for face detection experiments in NIR databases.

Full face recognition using the feature extracted gy shape analyzing and the back-propagation algorithm (형태분석에 의한 특징 추출과 BP알고리즘을 이용한 정면 얼굴 인식)

  • 최동선;이주신
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.10
    • /
    • pp.63-71
    • /
    • 1996
  • This paper proposes a method which analyzes facial shape and extracts positions of eyes regardless of the tilt and the size of input iamge. With the extracted feature parameters of facial element by the method, full human faces are recognized by a neural network which BP algorithm is applied on. Input image is changed into binary codes, and then labelled. Area, circumference, and circular degree of the labelled binary image are obtained by using chain code and defined as feature parameters of face image. We first extract two eyes from the similarity and distance of feature parameter of each facial element, and then input face image is corrected by standardizing on two extracted eyes. After a mask is genrated line historgram is applied to finding the feature points of facial elements. Distances and angles between the feature points are used as parameters to recognize full face. To show the validity learning algorithm. We confirmed that the proposed algorithm shows 100% recognition rate on both learned and non-learned data for 20 persons.

  • PDF

Local Binary Feature and Adaptive Neuro-Fuzzy based Defect Detection in Solar Wafer Surface (지역적 이진 특징과 적응 뉴로-퍼지 기반의 솔라 웨이퍼 표면 불량 검출)

  • Ko, JinSeok;Rheem, JaeYeol
    • Journal of the Semiconductor & Display Technology
    • /
    • v.12 no.2
    • /
    • pp.57-61
    • /
    • 2013
  • This paper presents adaptive neuro-fuzzy inference based defect detection method for various defect types, such as micro-crack, fingerprint and contamination, in heterogeneously textured surface of polycrystalline solar wafers. Polycrystalline solar wafer consists of various crystals so the surface of solar wafer shows heterogeneously textures. Because of this property the visual inspection of defects is very difficult. In the proposed method, we use local binary feature and fuzzy reasoning for defect detection. Experimental results show that our proposed method achieves a detection rate of 80%~100%, a missing rate of 0%~20% and an over detection (overkill) rate of 9%~21%.

A Study on the Design of Binary Decision Tree using FCM algorithm (FCM 알고리즘을 이용한 이진 결정 트리의 구성에 관한 연구)

  • 정순원;박중조;김경민;박귀태
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.32B no.11
    • /
    • pp.1536-1544
    • /
    • 1995
  • We propose a design scheme of a binary decision tree and apply it to the tire tread pattern recognition problem. In this scheme, a binary decision tree is constructed by using fuzzy C-means( FCM ) algorithm. All the available features are used while clustering. At each node, the best feature or feature subset among these available features is selected based on proposed similarity measure. The decision tree can be used for the classification of unknown patterns. The proposed design scheme is applied to the tire tread pattern recognition problem. The design procedure including feature extraction is described. Experimental results are given to show the usefulness of this scheme.

  • PDF

Texture Image Retrieval Using DTCWT-SVD and Local Binary Pattern Features

  • Jiang, Dayou;Kim, Jongweon
    • Journal of Information Processing Systems
    • /
    • v.13 no.6
    • /
    • pp.1628-1639
    • /
    • 2017
  • The combination texture feature extraction approach for texture image retrieval is proposed in this paper. Two kinds of low level texture features were combined in the approach. One of them was extracted from singular value decomposition (SVD) based dual-tree complex wavelet transform (DTCWT) coefficients, and the other one was extracted from multi-scale local binary patterns (LBPs). The fusion features of SVD based multi-directional wavelet features and multi-scale LBP features have short dimensions of feature vector. The comparing experiments are conducted on Brodatz and Vistex datasets. According to the experimental results, the proposed method has a relatively better performance in aspect of retrieval accuracy and time complexity upon the existing methods.

Smoke Detection Method Using Local Binary Pattern Variance in RGB Contrast Imag (RGB Contrast 영상에서의 Local Binary Pattern Variance를 이용한 연기검출 방법)

  • Kim, Jung Han;Bae, Sung-Ho
    • Journal of Korea Multimedia Society
    • /
    • v.18 no.10
    • /
    • pp.1197-1204
    • /
    • 2015
  • Smoke detection plays an important role for the early detection of fire. In this paper, we suggest a newly developed method that generated LBPV(Local Binary Pattern Variance)s as special feature vectors from RGB contrast images can be applied to detect smoke using SVM(Support Vector Machine). The proposed method rearranges mean value of the block from each R, G, B channel and its intensity of the mean value. Additionally, it generates RGB contrast image which indicates each RGB channel’s contrast via smoke’s achromatic color. Uniform LBPV, Rotation-Invariance LBPV, Rotation-Invariance Uniform LBPV are applied to RGB Contrast images so that it could generate feature vector from the form of LBP. It helps to distinguish between smoke and non smoke area through SVM. Experimental results show that true positive detection rate is similar but false positive detection rate has been improved, although the proposed method reduced numbers of feature vector in half comparing with the existing method with LBP and LBPV.