• Journal of Electrical Engineering and Technology
• /
• v.12 no.2
• /
• pp.559-568
• /
• 2017

Harmonic/inter-harmonic detection and analysis is an important issue in power system signal processing. This paper proposes a fast algorithm based on matching pursuit (MP) sparse signal decomposition, which can be employed to extract the harmonic or inter-harmonic components of a distorted electric voltage/current signal. In the MP iterations, the method extracts harmonic/inter-harmonic components in order according to the spectrum peak. The Fast Fourier Transform (FFT) and nonlinear optimization techniques are used in the decomposition to realize fast and accurate estimation of the parameters. First, the frequency estimation value corresponding to the maxim spectrum peak in the present residual is obtained, and the phase corresponding to this frequency is searched in discrete sinusoids dictionary. Then the frequency and phase estimations are taken as initial values of the unknown parameters for Nelder-Mead to acquire the optimized parameters. Finally, the duration time of the disturbance is determined by comparing the inner products, and the amplitude is achieved according to the matching expression of the harmonic or inter-harmonic. Simulations and actual signal tests are performed to illustrate the effectiveness and feasibility of the proposed method.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.708-710
• /
• 2004

This paper studies a multirate sampled-data control for LTI systems by using the digital redesign (DR) method. In this note, to well tackle the problem associated with both the state matching and the stabilization, our nobel strategy is to minimize the linear quadratic cost function. The main features of the proposed method are that i) the delta-operator-based descretization method is applied to improve the state-matching performance in the fast sampling limit and/or the large input multiplicity; ii) the proposed multirate control scheme can improve the state-matching performance in the long sampling limit; iii) some sufficient conditions that guarantee the stability of the closed-loop discrete-time system and provide a guarantee cost for the cost function can be formulated in the LMIs format; and iv) an optimal sampled-data controller in the sense of minimizing the upper bound of the cost function is also given by means of an LMI optimization procedure.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.67 no.5
• /
• pp.656-662
• /
• 2018

Pattern matching algorithm is widely used in many application fields such as bio-informatics, intrusion detection, etc. Among many string matching algorithms, KMP (Knuth-Morris-Pratt) algorithm is commonly used because of its fast execution time when using large texts. However, the processing speed of KMP algorithm is also limited when the text size increases significantly. In this paper, we propose a high throughput parallel KMP algorithm considering CPU-GPU memory hierarchy based on OpenCL in GPGPU (General Purpose computing on Graphic Processing Unit). We focus on the optimization for the allocation of work-times and work-groups, the local memory copy of the pattern data and the failure table, and the overlapping of the data transfer with the string matching operations. The experimental results show that the execution time of the optimized parallel KMP algorithm is about 3.6 times faster than that of the non-optimized parallel KMP algorithm.

• Journal of IKEEE
• /
• v.17 no.3
• /
• pp.339-345
• /
• 2013

In this paper, the probabilistic exclusion based orthogonal matching pursuit (PEOMP) algorithm for the sparse signal reconstruction is proposed. Some of recent greedy algorithms such as CoSaMP, gOMP, BAOMP improved the reconstruction performance by deleting unsuitable atoms at each iteration. They still often fail to converge to the solution because the support set could not escape from a local minimum. PEOMP helps to escape by excluding a random atom in the support set according to a well-chosen probability function. Experimental results show that PEOMP outperforms several OMP based algorithms and the $l_1$ optimization method in terms of exact reconstruction probability.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.37 no.3
• /
• pp.37-44
• /
• 2000

In this paper, an efficient hardware architecture of Lempel-Ziv compressor for real time data compression is proposed. The accumulated shift operations in the Lempel-Ziv algorithm are the major problem, because many shift operations are needed to prepare a dictionary buffer and matching symbols. A new efficient architecture for the fast processing of Lempel-Ziv algorithm is presented in this paper. In this architecture, the optimization technique for dictionary size, a new comparing method of multi symbol and a rotational FIFO structure are used to control shift operations easily. For the functional verification, this architecture was modeled by C programming language, and its operation was verified by running on commercial DSP processor. Also, the design of overall architecture in VHDL was synthesized on commercial FPGA chip. The result of critical path analysis shows that this architecture runs well at the input bit rate of 256kbps with 33MHz clock frequency.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.9
• /
• pp.2087-2093
• /
• 2014

In this paper, an orthogonal matching pursuit (OMP) method combined with genetic algorithm (GA), named GAOMP, is proposed for sparse signal recovery. Some recent greedy algorithms such as SP, CoSaMP, and gOMP improved the reconstruction performance by deleting unsuitable atoms at each iteration. However they still often fail to converge to the solution because the support set could not avoid the local minimum during the iterations. Mutating the candidate support set chosen by the OMP algorithm, GAOMP is able to escape from the local minimum and hence recovers the sparse signal. Experimental results show that GAOMP outperforms several OMP based algorithms and the $l_1$ optimization method in terms of exact reconstruction probability.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.37 no.8
• /
• pp.759-766
• /
• 2009

The purpose of this paper is an image processing algorithm development as a base research achieving performance enhancement of integrated navigation system. We used the SIFT (Scale Invariant Feature Transform) algorithm for image processing, and developed feature point matching filter for rejecting mismatched points. By applying the proposed algorithm, it is obtained better result than other methods of parameter tuning and KLT based feature point tracking. For further study, integration with INS and algorithm optimization for the real-time implementation are under investigation.

• Journal of Broadcast Engineering
• /
• v.24 no.6
• /
• pp.1064-1071
• /
• 2019

Multiview stereo matching algorithm is used to reconstruct 3D shape from a set of 2D images. Conventional multiview stereo algorithms have been implemented on high-performance hardware due to the heavy complexity that contains a large number of calculations in each step. However, as the performance of mobile graphics processors has recently increased rapidly, complex computer vision algorithms can now be implemented on mobile devices like a smartphone and an embedded board. In this paper we parallelize an multiview stereo algorithm using OpenCL on mobile GPU and provide various optimization techniques on the embedded hardware with limited resource.

• ETRI Journal
• /
• v.40 no.2
• /
• pp.266-274
• /
• 2018

In error-prone wireless environments, it is difficult to realize video coding systems that are robust to various types of data loss. In this paper, a novel motion-vector refinement approach is presented for video error concealment. A traditional boundary-matching approach is exploited to reduce blocky effects along the block boundary. More specifically, a downhill simplex approach is combined with a boundary-matching approach to fine-tune the motion vectors, reducing the blocky effects along the prediction unit block boundary, and minimizing the computational cost. Extensive simulations are performed, and the results obtained verify the robustness and effectiveness of the proposed approach.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.4 no.2
• /
• pp.87-95
• /
• 2003

Dynamic Programming Matching (DPM) is a mathematical optimization technique for sequentially structured problems, which has, over the years, played a major role in providing primary algorithms in pattern recognition fields. Most practical applications of this method in signature verification have been based on the practical implementational version proposed by Sakoe and Chiba [9], and il usually applied as a case of slope constraint p = 0. We found, in this case, a modified version of DPM by applying a heuristic (forward seeking) implementation is more efficient, offering significantly reduced processing complexity as well as slightly improved verification performance.