• The Journal of the Acoustical Society of Korea
• /
• v.13 no.1E
• /
• pp.25-36
• /
• 1994

A problem of making a neural network learning self-adaptive to the training set supplied is addressed in this paper. This arises from the aspect in choice of an adequate stepsize for the update of the current weigh vectors according to the training pairs. Related issues in this attempt are raised and fundamentals in neural network learning are introduced. In comparison to the most popular back-propagation scheme, the usefulness and superiority of the proposed weight update algorithm are illustrated by examing the identification of unknown nonlinear systems only from measurements.

• Journal of the Institute of Convergence Signal Processing
• /
• v.19 no.2
• /
• pp.42-46
• /
• 2018

Adaptive signal processing is quite important in various signal and communication environments. In adaptive signal processing methods since the least mean square(LMS) algorithm is simple and robust, it is used everywhere. As the step is varied in the variable step(VS) LMS algorithm, the fast convergence speed and the small excess mean square error can be obtained. Various variable step LMS algorithms are researched for better performances. But in some of variable step LMS algorithms the computational complexity is quite large for better performances. The fixed step LMS algorithm with a low computational complexity merit and the variable step LMS algorithm with a fast convergence merit are combined in the proposed sporadic step algorithm. As the step is sporadically updated, the performances of the variable step LMS algorithm can be maintained in the low update rate using Fibonacci sequence. The performances of the proposed variable step LMS algorithm are proved in the adaptive equalizer.

• 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.

• Proceedings of the KOSOMBE Conference
• /
• v.1991 no.11
• /
• pp.44-47
• /
• 1991

There exists a transform trellis code that is optimal for stationary Gaussian sources and the squared-error distortion measure at all rates. In this paper, we train an asymptotically optimal version of such a code to obtain one which is matched better to the statistics of real world data. The training algorithm uses the M-algorithm to search the trellis codebook and the LBG-algorithm to update the trellis codebook. To adapt the codebook for the varying input data. we use two gain-adaptive methods. The gain-adaptive scheme 1, which normalizes input block data by its gain factor, is applied to images at rate 0.5 bits/pixel. When each block is encoded at the same rate, the nonstationarity among the block variances leads to a variation in the resulting distortion from one block to another. To alleviate the non-uniformity among the encoded image, we design four clusters from the block power, in which each cluster has its own trellis codebook and different rates. The rate of each cluster is assigned through requiring a constant distortion per-letter. This gain-adaptive scheme 2 produces good visual and measurable quality at low rates.

• International journal of advanced smart convergence
• /
• v.4 no.2
• /
• pp.20-28
• /
• 2015

In this paper, we propose an effective tracking algorithm with an appearance model based on features extracted from a video frame with posture variation and camera view point adaptation by employing the non-adaptive random projections that preserve the structure of the image feature space of objects. The existing online tracking algorithms update models with features from recent video frames and the numerous issues remain to be addressed despite on the improvement in tracking. The data-dependent adaptive appearance models often encounter the drift problems because the online algorithms does not get the required amount of data for online learning. So, we propose an effective tracking algorithm with an appearance model based on features extracted from a video frame.

• 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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.451-465
• /
• 2017

This paper presents a novel discriminative visual tracking algorithm with an adaptive incremental extreme learning machine. The parameters for an adaptive incremental extreme learning machine are initialized at the first frame with a target that is manually assigned. At each frame, the training samples are collected and random Haar-like features are extracted. The proposed tracker updates the overall output weights for each frame, and the updated tracker is used to estimate the new location of the target in the next frame. The adaptive learning rate for the update of the overall output weights is estimated by using the confidence of the predicted target location at the current frame. Our experimental results indicate that the proposed tracker can manage various difficulties and can achieve better performance than other state-of-the-art trackers.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.7
• /
• pp.617-621
• /
• 2012

This paper studies asymptotic consensus problem for linear multi-agent systems. We propose a distributed state feedback control algorithm for solving the problem under fixed and undirected network communication. In contrast with the conventional algorithms that use global information (e.g., graph connectivity), the proposed algorithm only uses local information from neighbors. The principle for achieving asymptotic consensus is that, for each agent, a distributed update law gradually increases the coupling gain of LQR-type feedback and thus, the overall stability of the multi-agent system is recovered by the gain margin of LQR.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.1982-1985
• /
• 2003

Future cellular networks will mainly be driven by, high quality channels, high band with utilization, low power consumption and efficient network management. For a given channel allocation, the capacity and quality of communication of cellular radio systems using CDMA(Code Division Multiple Access) can be increased by using a transmitter power control scheme to combat the near-far problem. Centralized power control schemes or distributed ones to maximize the minimum signal-to-interference in each user of CDMA wireless network have been investigated. This paper has proposed a distributed power control algorithm, which employs an adaptive search scheme, in order to solve quickly the linear systems of equations for power update in CDMA cellular radio systems. The simulation results show that the proposed scheme has faster convergence rate than the typical bang-bang type of distributed power control algorithm, which has been much used as a reference algorithm in IS-95A and W-CDMA communication network.

• The Journal of Information Technology
• /
• v.8 no.3
• /
• pp.105-115
• /
• 2005

The CMA and MMA blind equalization algorithm has the inevitable large residual error caused by mismatching between the symbol constellation at a steady state after convergence. Stop-and-Go algorithm has a very superior residual error characteristics at a steady state but a relatively slow convergence characteristics. In this paper, we propose a SAG-Flagged MMA as a new adaptive blind equalization algorithm with a Stop-and-Go flag which follows a flagged MMA in update scheme of tap weights as appling the flag obtaining from Stop-and-Go algorithm to MMA. Using computer simulation, it is confirmed that the proposed algorithm has an enhancing performance from the viewpoint of residual ISI, residual error and convergence speed in comparison with MMA and Stop-and-Go algorithm. Algorithm has a new error function using the decided original constellation instead of the reduced constellation. By computer simulation, it is confirmed that the proposed algorithm has the performance superiority in terms of residual ISI and convergence speed compared with the adaptive blind equalization algorithm of CMA family, Constant Modulus Algorithm with Carrier Phase Recovery and Modified CMA(MCMA).