• Journal of the Korea Society of Computer and Information
• /
• v.1 no.1
• /
• pp.53-64
• /
• 1996

The methods for designing the adaptive filter performing DSP(digital signal processing)functions In mobile communication systems are Least-squares algorithm. Fast-Kalman and adaptive lattice algorithm. Least-squares algorithm It fast convergence algorithm for signal Processor of adaptive equallizer and used for eliminating inter symbol Interference which occur inmultiple path fading channel In mobille communication systems. In this paper. we propose the method of control adjustably algebra characteristics of signal vector that is sampling at some of new data sequence and confirm the improvement of fast convergence and iterative performance speed compared to existing algorithms by computer simulation.

• The Journal of the Acoustical Society of Korea
• /
• v.27 no.2E
• /
• pp.64-68
• /
• 2008

This paper investigates noise reduction performance and performs convergence analysis of a Variable Error Data Normalized Step-Size Least Mean Square(VEDNSS LMS) algorithm. Adopting VEDNSS LMS results in higher system complexity, but noise is reduced providing fast convergence speed Mathematical analysis demonstrates that tap coefficient misadjustment converges. This is confirmed by computer simulation with the proposed algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.176.4-176
• /
• 2001

In this paper, a novel type of iterative learning controller is studied. The proposed learning algorithm utilizes not only the error signal of the previous iteration but also the delayed error signal of the current iteration. The delayed error signal is adopted to improve the convergence speed. The convergence condition is examined and the result shows that the proposed learning algorithm shows the fast convergence speed under the same convergence condition of the traditional iterative learning algorithm. The simulation examples are presented to confirm the validity of the proposed ILC algorithm.

• Journal of the Institute of Convergence Signal Processing
• /
• v.20 no.2
• /
• pp.84-90
• /
• 2019

Tremendous computation of full search or lossless motion estimation algorithms for video coding has led development of many fast motion estimation algorithms. We still need proper control of computation and prediction quality. In the paper, we suggest an algorithm that reduces computation effectively and controls computational amount and prediction quality, while keeping prediction quality as almost the same as that of the full search. The proposed algorithm uses multiple thresholds for partial block sum and times of counting unchanged minimum position for each step. It also calculates the partial block matching error, removes impossible candidates early, implements fast motion estimation by comparing times of keeping the position of minimum error for each step, and controls prediction quality and computation easily by adjusting the thresholds. The proposed algorithm can be combined with conventional fast motion estimation algorithms as well as by itself, further reduce computation while keeping the prediction quality as almost same as the algorithms, and prove it in the experimental results.

• Journal of the Institute of Convergence Signal Processing
• /
• v.18 no.2
• /
• pp.62-67
• /
• 2017

In this paper, we propose a fast motion estimation algorithm which is important in performance of video encoding. Even though so many fast algorithms for motion estimation have been published due to tremendous computational amount of full search algorithm, efforts for reducing computations of motion estimation still remain. In the paper, we propose an algorithm that reduces unnecessary computations only, while keeping prediction quality the same as that of the full search. The proposed algorithm does not calculate block matching error for each candidate directly to find motion vectors but divides the calculation procedure into several steps and calculates partial sum of block errors for candidates with high priority. By doing that, we can find the minimum error point early and get the enhancement of calculation speed by reducing unnecessary computations. The proposed algorithm uses smaller computations than conventional fast search algorithms with the same prediction quality as the full search algorithm.

• Korean Journal of Applied Biomechanics
• /
• v.34 no.1
• /
• pp.25-33
• /
• 2024

Objective: The purpose of this study was to compare the lower extremity muscle activity and knee joint load according to movement speed conditions during the barbell back squat. Method: Nine males with resistance training experience participated in this study. Participants performed the barbell back squat in three conditions (Standard, Fast, and Slow) differing movement speed. During the barbell back squat, muscle activity of the rectus femoris (RF), vastus lateralis (VL), vastus medialis (VM), biceps femoris long head (BFL), semitendinosus (ST), gluteus maximus (GM), gastrocnemius (GCN), and tibialis anterior (TA) was collected using an 8 channel wireless EMG system. The peak flexion angle of the lower extremity joints and the peak resultant joint force in each direction of the knee joint were calculated using eight motion capture cameras and ground reaction force plates. This study was to used the Friedman test and the Wilcoxon signed rank test, to compare lower extremity muscle activity and peak resultant joint force at knee joint according to movement speed conditions during the barbell back squat, and the statistical significance level was set at .01. Results: In the downward phase of the barbell back squat, the RF and TA showed the higher muscle activity in the fast condition, and in the upward phase, RF, VL, VM, BFL, ST, GM, and TA showed the higher muscle activity in the fast condition. As a results, analyzing of the load on the knee joint, in the downward phase, and in the upward phase, the higher peak compressive force of the knee joint was showed in the fast condition. Conclusion: The barbell back squat with fast movement speed was more effective due to increased muscle activity of lower extremity, but one must be careful of knee joint injuries because the load on the knee joint may increase during the barbell back squat with fast movement speed.

• Journal of the Optical Society of Korea
• /
• v.20 no.6
• /
• pp.794-798
• /
• 2016

A polymer-stabilized vertical alignment (PS-VA) mode with fishbone-shaped pixel electrode structure is mainly used in large-sized liquid crystal displays (LCDs) owing to its advantages such as wide viewing angle, good transmittance and fast response time. One drawback of this mode is a main bone electrode, which crosses in the center of a pixel. It causes the transmittance to decrease badly because LCs cannot be reoriented in this region, and thus, it is particularly unfavorable in an ultra-high-definition LCD. Here, we propose an innovative structure with the main bone electrode relocated to the edge area in a pixel, and investigate how this reverse directed fishbone-shaped pixel electrode structure affects electro-optic characteristics. The proposed structure shows enhanced electro-optic performance, such as the higher transmittance and the faster response time than the conventional VA mode with fishbone-shaped pixel electrode structure.

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

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.10
• /
• pp.575-587
• /
• 2004

In this paper. a new Fast Expectation-Maximization algorithm(FEM) is proposed. Firstly the K-means algorithm is modified to reduce the number of iterations for finding the initial values that are used as the initial values in EM process. Conventionally the Initial values in K-means clustering are chosen randomly. which sometimes forces the process of clustering converge to some undesired center points. Uniform partitioning method is added to the conventional K-means to extract the proper initial points for each clusters. Secondly the effect of posterior probability is emphasized such that the application of Maximum Likelihood Posterior(MLP) yields fast convergence. The proposed FEM strengthens the characteristics of conventional EM by reinforcing the speed of convergence. The superiority of FEM is demonstrated in experimental results by presenting the improvement results of EM and accelerating the speed of convergence in parameter estimation procedures.

• Journal of the Korean Mathematical Society
• /
• v.32 no.1
• /
• pp.7-15
• /
• 1995

Multigrid method has been used widely to solve elliptic problems because of its applicability to many class of problems and fast convergence ([1], [3], [9], [10], [11], [12]). The estimate of convergence rate of multigrid is one of the main objectives of the multigrid analysis ([1], [2], [5], [6], [7], [8]). In many problems, the convergence rate depends on the regularity of the solutions([5], [6], [8]). In this paper, we present an improved estimate of reduction factor of multigrid iteration based on the proof in [6].