• Title/Summary/Keyword: binary vector

Search Result 368, Processing Time 0.03 seconds

Dorsal Hand Vein Identification Based on Binary Particle Swarm Optimization

  • Benziane, Sarah Hachemi;Benyettou, Abdelkader
    • Journal of Information Processing Systems
    • /
    • v.13 no.2
    • /
    • pp.268-284
    • /
    • 2017
  • The dorsal hand vein biometric system developed has a main objective and specific targets; to get an electronic signature using a secure signature device. In this paper, we present our signature device with its different aims; respectively: The extraction of the dorsal veins from the images that were acquired through an infrared device. For each identification, we need the representation of the veins in the form of shape descriptors, which are invariant to translation, rotation and scaling; this extracted descriptor vector is the input of the matching step. The optimization decision system settings match the choice of threshold that allows accepting/rejecting a person, and selection of the most relevant descriptors, to minimize both FAR and FRR errors. The final decision for identification based descriptors selected by the PSO hybrid binary give a FAR =0% and FRR=0% as results.

A Probabilistic Dissimilarity Matching for the DFT-Domain Image Hashing

  • Seo, Jin S.;Jo, Myung-Suk
    • International Journal of Advanced Culture Technology
    • /
    • v.5 no.1
    • /
    • pp.76-82
    • /
    • 2017
  • An image hash, a discriminative and robust summary of an image, should be robust against quality-preserving signal processing steps, while being pairwise independent for perceptually different inputs. In order to improve the hash matching performance, this paper proposes a probabilistic dissimilarity matching. Instead of extracting the binary hash from the query image, we compute the probability that the intermediate hash vector of the query image belongs to each quantization bin, which is referred to as soft quantization binning. The probability is used as a weight in comparing the binary hash of the query with that stored in a database. A performance evaluation over sets of image distortions shows that the proposed probabilistic matching method effectively improves the hash matching performance as compared with the conventional Hamming distance.

Position Estimator Employing Kalman Filter for PM Motors Driven with Binary-type Hall Sensors

  • Lee, Dong-Myung
    • Journal of Electrical Engineering and Technology
    • /
    • v.11 no.4
    • /
    • pp.931-938
    • /
    • 2016
  • Application of vector control scheme for consumer products is enlarging to improve control performance. For the field-oriented control, accurate position detection is essential and generally requires expensive sensors. On the other hand, cost-reduction is important in home appliances, so that binary-type Hall-effect sensors are commonly used rather than using an expensive sensor such as an encoder. The control performance is directly influenced by the accuracy of the position information, and there exist non-uniformities related to Hall sensors in electrical and mechanical aspects, which result in distorted position information. Therefore, to get high-precision position information from low-resolution Hall sensors, this paper proposes a new position estimator consisting of a Kalman filter and feedforward compensation scheme, which generates a linearly changing position signal. The efficacy of the proposed scheme is verified by simulation and experimental results carried out with a 48-pole permanent magnet motor.

Multiple Discriminative DNNs for I-Vector Based Open-Set Language Recognition (I-벡터 기반 오픈세트 언어 인식을 위한 다중 판별 DNN)

  • Kang, Woo Hyun;Cho, Won Ik;Kang, Tae Gyoon;Kim, Nam Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.8
    • /
    • pp.958-964
    • /
    • 2016
  • In this paper, we propose an i-vector based language recognition system to identify the spoken language of the speaker, which uses multiple discriminative deep neural network (DNN) models analogous to the multi-class support vector machine (SVM) classification system. The proposed model was trained and tested using the i-vectors included in the NIST 2015 i-vector Machine Learning Challenge database, and shown to outperform the conventional language recognition methods such as cosine distance, SVM and softmax NN classifier in open-set experiments.

Vector Data Hashing Using Line Curve Curvature (라인 곡선 곡률 기반의 벡터 데이터 해싱)

  • Lee, Suk-Hwan;Kwon, Ki-Ryong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.2C
    • /
    • pp.65-77
    • /
    • 2011
  • With the rapid expansion of application fields of vector data model such as CAD design drawing and GIS digital map, the security technique for vector data model has been issued. This paper presents the vector data hashing for the authentication and copy protection of vector data model. The proposed hashing groups polylines in main layers of a vector data model and generates the group coefficients by the line curve curvatures of the first and second type of all poly lines. Then we calculate the feature coefficients by projecting the group coefficients onto the random pattern and generate finally the binary hash from the binarization of the feature coefficients. From experimental results using a number of CAD drawings and GIS digital maps, we verified that the proposed hashing has the robustness against various attacks and the uniqueness and security by the random key.

WLDF: Effective Statistical Shape Feature for Cracked Tongue Recognition

  • Li, Xiao-qiang;Wang, Dan;Cui, Qing
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.1
    • /
    • pp.420-427
    • /
    • 2017
  • This paper proposes a new method using Wide Line Detector based statistical shape Feature (WLDF) to identify whether or not a tongue is cracked; a cracked tongue is one of the most frequently used visible features for diagnosis in traditional Chinese Medicine (TCM). We first detected a wide line in the tongue image, and then extracted WLDF, such as the maximum length of each detected region, and the ratio between maximum length and the area of the detected region. We trained a binary support vector machine (SVM) based on the WLDF to build a classifier for cracked tongues. We conducted an experiment based on our proposed scheme, using 196 samples of cracked tongues and 245 samples of non-cracked tongues. The results of the experiment indicate that the recognition accuracy of the proposed method is greater than 95%. In addition, we provide an analysis of the results of this experiment with different parameters, demonstrating the feasibility and effectiveness of the proposed scheme.

Equivalence of Hadamard Matrices Whose Rows Form a Vector Space (행백터 집합이 벡터공간을 이루는 하다마드 행렬의 동치관계)

  • Jin, Seok-Yong;Kim, Jeong-Heon;Park, Ki-Hyeon;Song, Hong-Yeop
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.7C
    • /
    • pp.635-639
    • /
    • 2009
  • In this paper, we show that any two Hadamard matrices of the same size are equivalent if they have the property that the rows of each Hadamard matrix are closed under binary vector addition. One of direct consequences of this result is that the equivalence between cyclic Hadamard matrices constructed by maximal length sequences and Walsh-Hadamard matrix of the same size generated by Kronecker product can be established.

Simple Bump-removal Scheme for the Position Signal of PM Motor Drives with Low-resolution Hall-effect Sensors

  • Lee, Dong-Myung
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.4
    • /
    • pp.1449-1455
    • /
    • 2017
  • The vector control technique using low-resolution Hall-effect sensors has been widely used especially in consumer electronics. Due to electrical and/or mechanical unevenness related to binary-type Hall sensors, the calculated or estimated position information has discontinuities so called bumps, which causes the deterioration of vector control performance. In order to obtain a linearly changing position signal from low-precision Hall-effect sensors, this paper proposes a simple bumps in position signal removal algorithm that consists of a first-order observer with low-pass filtering scheme. The proposed algorithm has the feature of no needs for system parameters and additional estimation processes. The validity of the proposed method is verified through simulation and experimental results.

Parameter optimization for SVM using dynamic encoding algorithm

  • Park, Young-Su;Lee, Young-Kow;Kim, Jong-Wook;Kim, Sang-Woo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.2542-2547
    • /
    • 2005
  • In this paper, we propose a support vector machine (SVM) hyper and kernel parameter optimization method which is based on minimizing radius/margin bound which is a kind of estimation of leave-one-error. This method uses dynamic encoding algorithm for search (DEAS) and gradient information for better optimization performance. DEAS is a recently proposed optimization algorithm which is based on variable length binary encoding method. This method has less computation time than genetic algorithm (GA) based and grid search based methods and better performance on finding global optimal value than gradient based methods. It is very efficient in practical applications. Hand-written letter data of MNI steel are used to evaluate the performance.

  • PDF

Fixed size LS-SVM for multiclassification problems of large data sets

  • Hwang, Hyung-Tae
    • Journal of the Korean Data and Information Science Society
    • /
    • v.21 no.3
    • /
    • pp.561-567
    • /
    • 2010
  • Multiclassification is typically performed using voting scheme methods based on combining a set of binary classifications. In this paper we use multiclassification method with a hat matrix of least squares support vector machine (LS-SVM), which can be regarded as the revised one-against-all method. To tackle multiclass problems for large data, we use the $Nystr\ddot{o}m$ approximation and the quadratic Renyi entropy with estimation in the primal space such as used in xed size LS-SVM. For the selection of hyperparameters, generalized cross validation techniques are employed. Experimental results are then presented to indicate the performance of the proposed procedure.