• Title/Summary/Keyword: Sign algorithm

Search Result 278, Processing Time 0.025 seconds

Vision- Based Finger Spelling Recognition for Korean Sign Language

  • Park Jun;Lee Dae-hyun
    • Journal of Korea Multimedia Society
    • /
    • v.8 no.6
    • /
    • pp.768-775
    • /
    • 2005
  • For sign languages are main communication means among hearing-impaired people, there are communication difficulties between speaking-oriented people and sign-language-oriented people. Automated sign-language recognition may resolve these communication problems. In sign languages, finger spelling is used to spell names and words that are not listed in the dictionary. There have been research activities for gesture and posture recognition using glove-based devices. However, these devices are often expensive, cumbersome, and inadequate for recognizing elaborate finger spelling. Use of colored patches or gloves also cause uneasiness. In this paper, a vision-based finger spelling recognition system is introduced. In our method, captured hand region images were separated from the background using a skin detection algorithm assuming that there are no skin-colored objects in the background. Then, hand postures were recognized using a two-dimensional grid analysis method. Our recognition system is not sensitive to the size or the rotation of the input posture images. By optimizing the weights of the posture features using a genetic algorithm, our system achieved high accuracy that matches other systems using devices or colored gloves. We applied our posture recognition system for detecting Korean Sign Language, achieving better than $93\%$ accuracy.

  • PDF

Adaptive Feedback Interference Cancellation Algorithm Using Correlations for Adaptive Interference Cancellation System (적응 간섭 제거 시스템을 위한 상관도를 적용한 적응적 궤환 간섭 제거 알고리즘)

  • Han, Yong-Sik;Yang, Woon-Geun
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.21 no.4
    • /
    • pp.427-432
    • /
    • 2010
  • To reduce the outage probability and to increase the transmission capacity, the importance of repeaters in cellular systems is increasing. But a RF(Radio Frequency) repeater has a problem that the output of the transmit antenna is partially feedback to the receive antenna, which is feedback interference. In this paper, we proposed adaptive Sign-Sign LMS(Least Mean Square) algorithm using correlations for the performance enhancement of RF repeater. The weight vector is updated by using sign of input signal and error signal to the least squared error of the conventional algorithms. When compared with the conventional method, the proposed canceller achieves the maximum 10 dB performance gain in terms of the MSE(Mean Square Error).

Convergence Analysis of the Modified Adaptive Sign (MAS) Algorithm Using a Mixed Norm Error Criterion

  • Lee, Young-Hwan
    • The Journal of the Acoustical Society of Korea
    • /
    • v.16 no.3E
    • /
    • pp.62-68
    • /
    • 1997
  • In this paper, a modified adaptive sign (MAS) algorithm based on a mixed norm error criterion is proposed. The mixed norm error criterion of be minimized is constructed as a combined convex function of the mean-absolute error and the mean-absolute error to the third power. A convergence analysis of the MAS algorithm is also presented. Under a set of mild assumptions, a set of nonlinear evolution equations that characterizes the statistical mean and mean-squared behavior of the algorithm is derived. Computed simulations are carried out to verify the validity of our derivations.

  • PDF

Performance Analysis of th e Sign Algorithm for an Adaptive IIR Notch Filter with Constrained Poles and Zeros

  • Tani, Naoko;Xiao, Yegui
    • Proceedings of the IEEK Conference
    • /
    • 2000.07b
    • /
    • pp.681-684
    • /
    • 2000
  • Gradient-type algorithms for adaptive IIR notch filters are very attractive in terms of both performances and computational requirements. Generally, it is quite difficult to assess their performances analytically. There have been several trials to analyze such adaptive algorithms as the sign and the plain gradient algorithms for some types of adaptive IIR notch filters, but many of them still remain unexplored. Furthermore, analysis techniques used in those trials can not be directly applied to different types of adaptive IIR notch filters. This paper presents a detailed performance analysis of the sign algorithm for a well-known adaptive IIR notch filter with constrained poles and zeros, which can not be done by just applying the related existing analysis techniques, and therefore has not been attempted yet. The steady-state estimation error and mean square error (MSE) of the algorithm are derived in closed forms. Stability bounds of the algorithm are also assessed. extensive simulations are conducted to support the analytical findings.

  • PDF

A Study on the Convergence Characteristics Improvement of the Modified-Multiplication Free Adaptive Filer (변형 비적 적응 필터의 수렴 특성 개선에 관한 연구)

  • 김건호;윤달환;임제탁
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.18 no.6
    • /
    • pp.815-823
    • /
    • 1993
  • In this paper, the structure of modified multiplication-free adaptive filter(M-MADF) and convergence analysis are presented. To evaluate the performance of proposed M-MADF algorithm, fractionally spaced equalizer (FSE) is used. The input signals are quantized using DPCM and the reference signals is processed using a first-order linear prediction filter, and the outputs are processed by a conventional adaptive filter. The filter coefficients are updated using the Sign algorithm. Under the assumption that the primary and reference signals are zero mean, wide-sense stationary and Gaussian, theoretical results for the coefficient misalignment vector and its autocorrelation matrix of the filter are driven. The convergence properties of Sign. MADF and M-MADF algorithm for updating of the coefficients of a digital filter of the fractionally spaced equalizer (FSE) are investigated and compared with one another. The convergence properties are characterized by the steady state error and the convergence speed. It is shown that the convergence speed of M-MADF is almost same as Sign algorithm and is faster that MADF in the condition of same steady error. Especially it is very useful for high correlated signals.

  • PDF

E-book to sign-language translation program based on morpheme analysis (형태소 분석 기반 전자책 수화 번역 프로그램)

  • Han, Sol-Ee;Kim, Se-A;Hwang, Gyung-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.2
    • /
    • pp.461-467
    • /
    • 2017
  • As the number of smart devices increases, e-book contents and services are proliferating. However, the text based e-book is difficult for a hearing-impairment person to understand. In this paper, we developed an android based application in which we can choose an e-book text file and each sentence is translated to sign-language elements which are shown in videos that are retrieved from the sign-language contents server. We used the korean sentence to sign-language translation algorithm based on the morpheme analysis. The proposed translation algorithm consists of 3 stages. Firstly, some elements in a sentence are removed for typical sign-language usages. Secondly, the tense of the sentence and the expression alteration are applied. Finally, the honorific forms are considered and word positions in the sentence are revised. We also proposed a new method to evaluate the performance of the translation algorithm and demonstrated the superiority of the algorithm through the translation results of 100 reference sentences.

High Speed Modular Multiplication Algorithm for RSA Cryptosystem (RSA 암호 시스템을 위한 고속 모듈라 곱셈 알고리즘)

  • 조군식;조준동
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.3C
    • /
    • pp.256-262
    • /
    • 2002
  • This paper presents a novel radix-4 modular multiplication algorithm based on the sign estimation technique (3). The sign estimation technique detects the sign of a number represented in the form of a carry-sum pair. It can be implemented with 5-bit carry look-ahead adder. The hardware speed of the cryptosystem is dependent on the performance modular multiplication of large numbers. Our algorithm requires only (n/2+3) clock cycle for n bit modulus in performing modular multiplication. Our algorithm out-performs existing algorithm in terms of required clock cycles by a half, It is efficient for modular exponentiation with large modulus used in RSA cryptosystem. Also, we use high-speed adder (7) instead of CPA (Carry Propagation Adder) for modular multiplication hardware performance in fecal stage of CSA (Carry Save Adder) output. We apply RL (Right-and-Left) binary method for modular exponentiation because the number of clock cycles required to complete the modular exponentiation takes n cycles. Thus, One 1024-bit RSA operation can be done after n(n/2+3) clock cycles.

Deep Learning Based Sign Detection and Recognition for the Blind (시각장애인을 위한 딥러닝 기반 표지판 검출 및 인식)

  • Jeon, Taejae;Lee, Sangyoun
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.54 no.2
    • /
    • pp.115-122
    • /
    • 2017
  • This paper proposes a deep learning algorithm based sign detection and recognition system for the blind. The proposed system is composed of sign detection stage and sign recognition stage. In the sign detection stage, aggregated channel features are extracted and AdaBoost classifier is applied to detect regions of interest of the sign. In the sign recognition stage, convolutional neural network is applied to recognize the regions of interest of the sign. In this paper, the AdaBoost classifier is designed to decrease the number of undetected signs, and deep learning algorithm is used to increase recognition accuracy and which leads to removing false positives which occur in the sign detection stage. Based on our experiments, proposed method efficiently decreases the number of false positives compared with other methods.

Real-time Speed Limit Traffic Sign Detection System for Robust Automotive Environments

  • Hoang, Anh-Tuan;Koide, Tetsushi;Yamamoto, Masaharu
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.4 no.4
    • /
    • pp.237-250
    • /
    • 2015
  • This paper describes a hardware-oriented algorithm and its conceptual implementation in a real-time speed limit traffic sign detection system on an automotive-oriented field-programmable gate array (FPGA). It solves the training and color dependence problems found in other research, which saw reduced recognition accuracy under unlearned conditions when color has changed. The algorithm is applicable to various platforms, such as color or grayscale cameras, high-resolution (4K) or low-resolution (VGA) cameras, and high-end or low-end FPGAs. It is also robust under various conditions, such as daytime, night time, and on rainy nights, and is adaptable to various countries' speed limit traffic sign systems. The speed limit traffic sign candidates on each grayscale video frame are detected through two simple computational stages using global luminosity and local pixel direction. Pipeline implementation using results-sharing on overlap, application of a RAM-based shift register, and optimization of scan window sizes results in a small but high-performance implementation. The proposed system matches the processing speed requirement for a 60 fps system. The speed limit traffic sign recognition system achieves better than 98% accuracy in detection and recognition, even under difficult conditions such as rainy nights, and is implementable on the low-end, low-cost Xilinx Zynq automotive Z7020 FPGA.