• Title/Summary/Keyword: a rate of convergence

Search Result 3,059, Processing Time 0.034 seconds

Exponential Convergence of A Learning Scheme for Unknown Linear Systems

  • Kuc, Tae-yong;Lee, Jin-Soo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1992.10b
    • /
    • pp.550-554
    • /
    • 1992
  • In this paper the issue of convergence rate is introduced for a learning control scheme we have developed and applied for tracking of unknown linear systems. A sufficient condition under which the output trajectory converges exponentially fast is obtained using the controllability grammian of controllable linear systems. Under the same condition it is also shown that the learning control input converges exponentially with the same rate as the rate of output convergence. A numerical example with computer simulation results is presented to show the feasibility of the scheme.

  • PDF

Aqua-Aware: Underwater Optical Wirelesss Communication enabled Compact Sensor Node, Temperature and Pressure Monitoring for Small Moblie Platforms

  • Maaz Salman;Javad Balboli;Ramavath Prasad Naik;Wan-Young Chung;Jong-Jin Kim
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.23 no.2
    • /
    • pp.50-61
    • /
    • 2022
  • This work demonstrates the design and evaluation of Aqua-Aware, a lightweight miniaturized light emitting diode (LED) based underwater compact sensor node which is used to obtain different characteristics of the underwater environment. Two optical sensor nodes have been designed, developed, and evaluated for a short and medium link range called as Aqua-Aware short range (AASR) and Aqua-Aware medium range (AAMR), respectively. The hardware and software implementation of proposed sensor node, algorithms, and trade-offs have been discussed in this paper. The underwater environment is emulated by introducing different turbulence effects such as air bubbles, waves and turbidity in a 4-m water tank. In clear water, the Aqua-Aware achieved a data rate of 0.2 Mbps at communication link up to 2-m. The Aqua-Aware was able to achieve 0.2 Mbps in a turbid water of 64 NTU in the presence of moderate water waves and air bubbles within the communication link range of 1.7-m. We have evaluated the luminous intensity, packet success rate and bit error rate performance of the proposed system obtained by varying the various medium characteristics.

Rate of Convergence of Empirical Distributions and Quantiles in Linear Processes with Applications to Trimmed Mean

  • Lee, Sangyeol
    • Journal of the Korean Statistical Society
    • /
    • v.28 no.4
    • /
    • pp.435-441
    • /
    • 1999
  • A 'convergence in probability' rate of the empirical distributions and quantiles of linear processes is obtained. As an application of the limit theorems, a trimmed mean for the location of the linear process is considered. It is shown that the trimmed mean is asymptotically normal. A consistent estimator for the asymptotic variance of the trimmed mean is provided.

  • PDF

Implementation of Real-Time Post-Processing for High-Quality Stereo Vision

  • Choi, Seungmin;Jeong, Jae-Chan;Chang, Jiho;Shin, Hochul;Lim, Eul-Gyoon;Cho, Jae Il;Hwang, Daehwan
    • ETRI Journal
    • /
    • v.37 no.4
    • /
    • pp.752-765
    • /
    • 2015
  • We propose a novel post-processing algorithm and its very-large-scale integration architecture that simultaneously uses the passive and active stereo vision information to improve the reliability of the three-dimensional disparity in a hybrid stereo vision system. The proposed architecture consists of four steps - left-right consistency checking, semi-2D hole filling, a tiny adaptive variance checking, and a 2D weighted median filter. The experimental results show that the error rate of the proposed algorithm (5.77%) is less than that of a raw disparity (10.12%) for a real-world camera image having a $1,280{\times}720$ resolution and maximum disparity of 256. Moreover, for the famous Middlebury stereo image sets, the proposed algorithm's error rate (8.30%) is also less than that of the raw disparity (13.7%). The proposed architecture is implemented on a single commercial field-programmable gate array using only 13.01% of slice resources, which achieves a rate of 60 fps for $1,280{\times}720$ stereo images with a disparity range of 256.

Non-Contact Heart Rate Monitoring from Face Video Utilizing Color Intensity

  • Sahin, Sarker Md;Deng, Qikang;Castelo, Jose;Lee, DoHoon
    • Journal of Multimedia Information System
    • /
    • v.8 no.1
    • /
    • pp.1-10
    • /
    • 2021
  • Heart Rate is a crucial physiological parameter that provides basic information about the state of the human body in the cardiovascular system, as well as in medical diagnostics and fitness assessments. At present day, it has been demonstrated that facial video-based photoplethysmographic signal captured using a low-cost RGB camera is possible to retrieve remote heart rate. Traditional heart rate measurement is mostly obtained by direct contact with the human body, therefore, it can result inconvenient for long-term measurement due to the discomfort that it causes to the subject. In this paper, we propose a non-contact-based remote heart rate measuring approach of the subject which depends on the color intensity variation of the subject's facial skin. The proposed method is applied in two regions of the subject's face, forehead and cheeks. For this, three different algorithms are used to measure the heart rate. i.e., Fast Fourier Transform (FFT), Independent Component Analysis (ICA) and Principal Component Analysis (PCA). The average accuracy for the three algorithms utilizing the proposed method was 89.25% in both regions. It is also noteworthy that the FastICA algorithm showed a higher average accuracy of more than 92% in both regions. The proposed method obtained 1.94% higher average accuracy than the traditional method based on average color value.

INVESTIGATION OF SOME FIXED POINT THEOREMS IN HYPERBOLIC SPACES FOR A THREE STEP ITERATION PROCESS

  • Atalan, Yunus;Karakaya, Vatan
    • Korean Journal of Mathematics
    • /
    • v.27 no.4
    • /
    • pp.929-947
    • /
    • 2019
  • In the present paper, we investigate the convergence, equivalence of convergence, rate of convergence and data dependence results using a three step iteration process for mappings satisfying certain contractive condition in hyperbolic spaces. Also we give nontrivial examples for the rate of convergence and data dependence results to show effciency of three step iteration process. The results obtained in this paper may be interpreted as a refinement and improvement of the previously known results.

Improvement of Topology Algorithm's Convergence Rate Using Chaotic Map (카오틱 맵을 이용한 위상 최적화 알고리즘의 수렴속도 향상)

  • Kim, Yong-Ho;Kim, Gi-Chul;Lee, Jae-Hwan;Jang, Hyo-Jae;Han, Seog-Young
    • Journal of the Korean Society of Manufacturing Technology Engineers
    • /
    • v.23 no.3
    • /
    • pp.279-283
    • /
    • 2014
  • Recently, a topology algorithm based on the artificial bee colony algorithm (ABCA) has been proposed for static and dynamic topology optimization. From the results, the convergence rate of the algorithm was determined to be slightly slow. Therefore, we propose a new search method to improve the convergence rate of the algorithm using a chaotic map. We investigate the effect of the chaotic map on the convergence rate of the algorithm in static and dynamic topology optimization. The chaotic map has been applied to three cases, namely, employ bee search, onlooker bee search, and both employ bee as well as onlooker bee search steps. It is verified that the case in which the logistic function of the chaotic map is applied to both employ bee as well as onlooker bee search steps shows the best dynamic topology optimization, improved by 5.89% compared to ABCA. Therefore, it is expected that the proposed algorithm can effectively be applied to dynamic topology optimization to improve the convergence rate.

An Improved Element Removal Method for Evolutionary Structural Optimization

  • Han, Seog-Young
    • Journal of Mechanical Science and Technology
    • /
    • v.14 no.9
    • /
    • pp.913-919
    • /
    • 2000
  • The purpose of this study was to develop a new element removal method for ESO (Evolutionary Structural Optimization), which is one of the topology optimization methods. ESO starts with the maximum allowable design space and the optimal topology emerges by a process of removal of lowly stressed elements. The element removal ratio of ESO is fixed throughout topology optimization at 1 or 2%. BESO (bidirectional ESO) starts with either the least number of elements connecting the loads to the supports, or an initial design domain that fits within the maximum allowable domain, and the optimal topology evolves by adding or subtracting elements. But the convergence rate of BESO is also very slow. In this paper, a new element removal method for ESO was developed for improvement of the convergence rate. Then it was applied to the same problems as those in papers published previously. From the results, it was verified that the convergence rate was significantly improved compared with ESO as well as BESO.

  • PDF

AFFINE INVARIANT LOCAL CONVERGENCE THEOREMS FOR INEXACT NEWTON-LIKE METHODS

  • Argyros, Ioannis K.
    • Journal of applied mathematics & informatics
    • /
    • v.6 no.2
    • /
    • pp.393-406
    • /
    • 1999
  • Affine invariant sufficient conditions are given for two local convergence theorems involving inexact Newton-like methods. The first uses conditions on the first Frechet-derivative whereas the second theorem employs hypotheses on the second. Radius of con-vergence as well as rate of convergence results are derived. Results involving superlinear convergence and known to be true for inexact Newton methods are extended here. Moreover we show that under hypotheses on the second Frechet-derivation our radius of convergence results are derived. Results involving superlinear convergence and known to be true or inexact Newton methods are extended here. Moreover we show that under hypotheses on the second Frechet-derivative our radius of conver-gence is larger than the corresponding one in [10]. This allows a wider choice for the initial guess. A numerical example is also pro-vided to show that our radius of convergence is larger then the one in [10].

LOCAL CONVERGENCE THEOREMS FOR NEWTON METHODS

  • Argyros, Ioannis K.
    • Journal of applied mathematics & informatics
    • /
    • v.8 no.2
    • /
    • pp.345-360
    • /
    • 2001
  • Affine invariant sufficient conditions are given for two local convergence theorems involving inexact Newton-like methods. The first uses conditions on the first Frechet-derivative whereas the second theorem employs hypotheses on the mth(m≥2 an integer). Radius of convergence as well as rate of convergence results are derived. Results involving superlinear convergence and known to be true for inexact Newton methods are extended here. Moreover, we show that under hypotheses on the mth Frechet-derivative our radius of convergence can sometimes be larger than the corresponding one in [10]. This allows a wider choice for the initial guess. A numerical example is also provided to show that our radius of convergence is larger than the one in [10].