• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.64 no.7
• /
• pp.1005-1011
• /
• 2015

This paper proposes the DC offset compensation algorithm with fast response to the sensed grid voltage in the single-phase grid connected inverter. If the sensor of the grid voltage has problems, the DC offset of the grid voltage can be generated. This error must be resolved because the DC offset can generate the estimated grid frequency error of the phase-locked loop (PLL). In conventional algorithm to compensate the DC offset, the DC offset is estimated by integrating the synchronous reference frame d-axis voltage during one period of the grid voltage. The conventional algorithm has a drawback that is a slow dynamic response because monitoring the one period of the grid voltage is required. the proposed algorithm has fast dynamic response because the DC offset is consecutively estimated by transforming the d-axis voltage to synchronous reference frame without monitoring one cycle time of the grid voltage. The proposed algorithm is verified from PSIM simulation and the experiment.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.3
• /
• pp.877-887
• /
• 2015

Rapid development of cities with constant increasing load and deregulation in electricity market had forced the transmission lines to operate near their threshold capacity and can easily lead to voltage instability and caused system breakdown. To prevent such catastrophe from happening, accurate readings of voltage stability condition is required so that preventive equipment and operators can execute security procedures to restore system condition to normal. This paper introduced Enhanced Hybrid Particle Swarm Optimization algorithm to estimate the voltage stability condition which utilized Fast Voltage Stability Index (FVSI) to indicate how far or close is the power system network to the collapse point when the reactive load in the system increases because reactive load gives the highest impact to the stability of the system as it varies. Particle Swarm Optimization (PSO) had been combined with the ANN to form the Enhanced Hybrid PSO-ANN (EHPSO-ANN) algorithm that worked accurately as a prediction algorithm. The proposed algorithm reduced serious local minima convergence of ANN but also maintaining the fast convergence speed of PSO. The results show that the hybrid algorithm has greater prediction accuracy than those comparing algorithms. High generalization ability was found in the proposed algorithm.

• Journal of Broadcast Engineering
• /
• v.7 no.4
• /
• pp.310-316
• /
• 2002

In this paper, we propose an adaptive search range decision algorithm for fast motion estimation of video coding. Block matching algorithm for motion vector estimation that improves coding efficiency by reduction of temporal redundancy has trade-off problem between the motion vector accuracy and the complexity. The proposed algorithm playing as a pre-processing of fast motion estimation adaptively determines the motion search range by the local statistics of neighboring motion vectors. resulting in dramatic reduction of the computational cost without the loss of coding efficiency. Experimental results show the capability of the proposed algorithm.

• Journal of Information Processing Systems
• /
• v.16 no.3
• /
• pp.688-698
• /
• 2020

Point clouds have ability to express the spatial entities, however, the point clouds redundancy always involves some uncertainties in computer recognition and model construction. Therefore, point clouds thinning is an indispensable step in point clouds model reconstruction and other applications. To overcome the shortcomings of complex classification index and long time consuming in existing point clouds thinning algorithms, this paper proposes a point clouds fast thinning algorithm. Specifically, the two-dimensional index is established in plane linear array (x, y) for the scanned point clouds, and the thresholds of adjacent point distance difference and height difference are employed to further delete or retain the selected sample point. Sequentially, the index of sample point is traversed forwardly and backwardly until the process of point clouds thinning is completed. The results suggest that the proposed new algorithm can be applied to different targets when the thresholds are built in advance. Besides, the new method also performs superiority in time consuming, modelling accuracy and feature retention by comparing with octree thinning algorithm.

• Journal of Broadcast Engineering
• /
• v.16 no.5
• /
• pp.861-872
• /
• 2011

Many fast block-matching algorithms (BMAs) in motion estimation field reduce computational complexity by screening the number of checking points. Although many fast BMAs reduce computations, sometimes they should endure matching errors in comparison with full-search algorithm (FSA). In this paper, a novel fast BMA for constrained one-bit transform (C1BT)-based motion estimation is proposed in order to decrease the calculations of the block distortion measure. Unlike the classical fast BMAs, the proposed algorithm shows a new approach to reduce computations. It utilizes the binomial distribution based on the characteristic of binary plane which is composed of only two elements: 0 and 1. Experimental results show that the proposed algorithm keeps its peak signal-to-noise ratio (PSNR) performance very close to the FSA-C1BT while the computation complexity is reduced considerably.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.7
• /
• pp.100-106
• /
• 2015

In this paper, we propose a fast algorithm for low-power image enhancement method for mobile LCD. In the proposed fast algorithm, the spatial resolution of the input image is significantly reduced, and the image characteristics are analyzed on the reduced resolution image to find a dimming rate adaptive to the image content, thereby saving power. The proposed fast adaptive dimming and image enhancement algorithm is implemented as an application that runs on an Android device. Image quality evaluation and running time analysis experiments on the device indicate that the proposed fast algorithm jointly minimizes the quality degradation and power consumption, reducing the required computation load by over 95%.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.3
• /
• pp.103-114
• /
• 1994

This paper proposes an implementation of DCT (Discrete Cosine Transform) and IDCT (Inverse DCT) using a fast DCT algorithm with shift and addition operations instead of multiplications Based on the proposed algorithm, a new VLSI architecture for the DCT and the IDCT is proposed. It shows modularity , regularity and capability for multiprocessing. Its performance is also simulated by a simulation software, "Compass". The results of the simulation provide the quality of decompression images, the increase in processing speed, representing the superiority of the proposed architecture.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1998.06e
• /
• pp.23-26
• /
• 1998

This paper presents a technique to enhance TDAC in the AC-3 algorithm. To reduce block boundary noise without decreasing the performance of transform coding, new special window adopted. They improves the defect of the AC-3 algorithm that could not properly cancel aliasing in the tansient period. In addition, a fast MDCT calculation algorithm based on a fast Fourier Transform, is adopted.

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.427-430
• /
• 1989

For on-line ARMA spectral estimation, the fast transversal filter algorithm of extended least squares method(ETS FTF) is presented. The projection operator, a key tool for geometric approach, is used in the derivation of the algorithm. ELS FTF is a fast time update recursion which is based on the fact that the correlation matrix of ARMA model satisfies the shift invariance property in each block, and thus it takes 10N+31 MADPR.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.597-600
• /
• 1999

In this paper, we propose a fast object-tracking algorithm in a moving picture. The proposed object-tracking algorithm is based on a projection scheme. More specifically, to alleviate the computational complexities of the previous motion estimation methods, we propose to use the projected row and column 1-D image data to extract the motion information. Experimental results show that the proposed method can detect the motion of an object fairly well with reduced computational time.