• Title/Summary/Keyword: Fast adaptive algorithm

Search Result 431, Processing Time 0.021 seconds

Adaptive Control of Industrial Robot Using Neural Network (신경회로망을 이용한 산업용 로봇의 적응제어)

  • 차보남;장준화;한덕기;이명재;한성현
    • Proceedings of the Korean Society of Machine Tool Engineers Conference
    • /
    • 2001.10a
    • /
    • pp.134-139
    • /
    • 2001
  • This paper presents a new scheme of neural network controller to improve the robustuous of robot manipulator using digital signal processors. Digital signal processors, DSPs, are micro-processors that are particularly developed for fast numerical computations involving sums and products of variables. Digital version of most advanced control algorithms can be defined as sums and products of measured variables, thus it can be programmed and executed through DSPs. In addition, DSPs are as fast in computation as most 32-bit micro-processors and yet at a fraction of their prices. These features make DSPs a viable computational tool in digital implementation of sophisticated controllers. During past decade it was proposed the well-established theorys for the adaptive control of linear systems, but there exists relatively little general theory for the adaptive control of nonlinear systems. Perforating of the proposed controller is illustrated. This paper describes a new approach to the design of adaptive controller and implementation of real-time control for assembling robotic manipulator using digital signal processor. Digital signal processors used in implementing real time adaptive control algorithm are TMS320C50 series made in TI'Co..

  • PDF

Individual Variable Step-Size Subband Affine Projection Algorithm (독립 가변 스텝사이즈 부밴드 인접투사 알고리즘)

  • Choi, Hun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.3
    • /
    • pp.443-448
    • /
    • 2022
  • This paper presents a subband affine projection algorithm with variable step size to improve convergence performance in adaptive filtering applications with long adaptive filters and highly correlated input signals. The proposed algorithm can obtain fast convergence speed and small steady-state error by using different step sizes for each adaptive sub-filter in the subband structure to which polyphase decomposition and noble identity are applied. The step size derived to minimize the mean square error of the adaptive filter at each update time shows better convergence performance than the existing algorithm using a variable step size. In order to confirm the convergence performance of the proposed algorithm, which is superior to the existing algorithm, computer simulations are performed for mean square deviation(MSD) for AR(1) and AR(2) colored input signals considering the system identification model.

Fast Algorithm for 360-degree Videos Based on the Prediction of Cu Depth Range and Fast Mode Decision

  • Zhang, Mengmeng;Zhang, Jing;Liu, Zhi;Mao, Fuqi;Yue, Wen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.6
    • /
    • pp.3165-3181
    • /
    • 2019
  • Spherical videos, which are also called 360-degree videos, have become increasingly popular due to the rapid development of virtual reality technology. However, the large amount of data in such videos is a huge challenge for existing transmission system. To use the existing encode framework, it should be converted into a 2D image plane by using a specific projection format, e.g. the equi-rectangular projection (ERP) format. The existing high-efficiency video coding standard (HEVC) can effectively compress video content, but its enormous computational complexity makes the time spent on compressing high-frame-rate and high-resolution 360-degree videos disproportionate to the benefits of compression. Focusing on the ERP format characteristics of 360-degree videos, this work develops a fast decision algorithm for predicting the coding unit depth interval and adaptive mode decision for intra prediction mode. The algorithm makes full use of the video characteristics of the ERP format by dealing with pole and equatorial areas separately. It sets different reference blocks and determination conditions according to the degree of stretching, which can reduce the coding time while ensuring the quality. Compared with the original reference software HM-16.16, the proposed algorithm can reduce time consumption by 39.3% in the all-intra configuration, and the BD-rate increases by only 0.84%.

High Speed Face Detection Using Skin Color (살색을 이용한 고속 얼굴검출 알고리즘의 개발)

  • 한영신;박동식;이칠기
    • Proceedings of the IEEK Conference
    • /
    • 2002.06c
    • /
    • pp.173-176
    • /
    • 2002
  • This paper describes an implementation of fast face detection algorithm. This algorithm can robustly detect human faces with unknown sizes and positions in complex backgrounds. This paper provides a powerful face detection algorithm using skin color segmenting. Skin Color is modeled by a Gaussian distribution in the HSI color space among different persons within the same race, Oriental. The main feature of the Algorithm is achieved face detection robust to illumination changes and a simple adaptive thresholding technique for skin color segmentation is employed to achieve robust face detection.

  • PDF

Covariance Lattice Instrumental Variable Algorithm for Spectral Estimation (스펙트럼 추정을 위한 공분산 기구변수 격자 앨고리즘)

  • 양흥석;남현도;김진기
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.35 no.4
    • /
    • pp.156-162
    • /
    • 1986
  • The last few years have seen a rapid development of so-called lattice algorithms for the fast solution of finite date algorithms. So far, most of the work on ladder form has been done for the prewindowed case. In this paper, the covariance lattice algorithm for instrumental variable recusions is presented. This algorithm can be used in various areas of adaptive signal processing, spectral estimation and system identification. The behavior of the proposed algorithm is illustrated by some simulation results for spectral estimation.

  • PDF

Fast Adaptive Block Matching Algorithm using Characteristic of the Motion Vector Distribution (움직임 벡터 분포 특성을 이용한 고속 적응 블럭 정합 알고리즘)

  • Shin, Yong-Dal;Kim, Young-Choon
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.12
    • /
    • pp.63-68
    • /
    • 1998
  • We present a fast adaptive block matching algorithm using characteristic of the motion vector distribution. In the presented method, the block is classified into one of four motion categories: stationary block, quasi-stationary block, medium-motion block or high-motion block according to characteristic of the MAD(0,0) distribution for motion vector, each block estiamtes the motion vector adaptively. By the simulation, the PSNR of our algorithm is similar to NTSS method. The computation amount of the presented method decreased 30.44% ~ 40.27% more than NTSS method.

  • PDF

An Adaptive Speed Estimation Method Based on a Strong Tracking Extended Kalman Filter with a Least-Square Algorithm for Induction Motors

  • Yin, Zhonggang;Li, Guoyin;Du, Chao;Sun, Xiangdong;Liu, Jing;Zhong, Yanru
    • Journal of Power Electronics
    • /
    • v.17 no.1
    • /
    • pp.149-160
    • /
    • 2017
  • To improve the performance of sensorless induction motor (IM) drives, an adaptive speed estimation method based on a strong tracking extended Kalman filter with a least-square algorithm (LS-STEKF) for induction motors is proposed in this paper. With this method, a fading factor is introduced into the covariance matrix of the predicted state, which forces the innovation sequence orthogonal to each other and tunes the gain matrix online. In addition, the estimation error is adjusted adaptively and the mutational state is tracked fast. Simultaneously, the fading factor can be continuously self-tuned with the least-square algorithm according to the innovation sequence. The application of the least-square algorithm guarantees that the information in the innovation sequence is extracted as much as possible and as quickly as possible. Therefore, the proposed method improves the model adaptability in terms of actual systems and environmental variations, and reduces the speed estimation error. The correctness and the effectiveness of the proposed method are verified by experimental results.

Deterministic Function Variable Step Size LMS Algorithm (결정함수 가변스텝 LMS 알고리즘)

  • Woo, Hong-Chae
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.12 no.2
    • /
    • pp.128-132
    • /
    • 2011
  • Least mean square adaptive algorithms have played important role in radar, sonar, speech processing, and mobile communication. In mobile communication area, the convergence rate of a LMS algorithm is quite important. However, LMS algorithms have slow and non-uniform convergence rate problem For overcoming these shortcomings, various variable step LMS adaptive algorithms have been studied in recent years. Most of these recent LMS algorithms have used complex variable step methods to get a rapid convergence. But complex variable step methods need a high computational complexity. Therefore, the main merits such as the simplicity and the robustness in a LMS algorithm can be eroded. The proposed deterministic variable step LMS algorithm is based upon a simple deterministic function for the step update so that the simplicity of the proposed algorithm is obtained and the fast convergence is still maintainable.

Fast Motion Estimation using Adaptive Search Region Prediction (적응적 탐색 영역 예측을 이용한 고속 움직임 추정)

  • Ryu, Kwon-Yeol
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.7
    • /
    • pp.1187-1192
    • /
    • 2008
  • This paper proposes a fast motion estimation using an adaptive search region and a new three step search. The proposed method improved in the quality of motion compensation image as $0.43dB{\sim}2.19dB$, according as it predict motion of current block from motion vector of neigher blocks, and adaptively set up search region using predicted motion information. We show that the proposed method applied a new three step search pattern is able to fast motion estimation, according as it reduce computational complexity per blocks as $1.3%{\sim}1.9%$ than conventional method.

A Fast Motion Estimation Algorithm using Adaptive Search According to Importance of Search Ranges (탐색영역의 중요도에 따라 적응적인 탐색을 이용한 고속 움직임 예측 알고리즘)

  • Kim, Tae Hwan;Kim, Jong Nam;Jeong, Shin Il
    • Journal of Korea Multimedia Society
    • /
    • v.18 no.4
    • /
    • pp.437-442
    • /
    • 2015
  • Voice activity detection is very important process that voice activity separated form noisy speech signal for speech enhance. Over the past few years, many studies have been made on voice activity detection, but it has poor performance in low signal to noise ratio environment or fickle noise such as car noise. In this paper, it proposed new voice activity detection algorithm using ensemble variance based on wavelet band entropy and soft thresholding method. We conduct a survey in a lot of signal to noise ratio environment of car noise to evaluate performance of the proposed algorithm and confirmed performance of the proposed algorithm.