• Title/Summary/Keyword: Matching Pursuit(MP)

Search Result 14, Processing Time 0.023 seconds

Multiple Candidate Matching Pursuit (다중 후보 매칭 퍼슛)

  • Kwon, Seokbeop;Shim, Byonghyo
    • Journal of Broadcast Engineering
    • /
    • v.17 no.6
    • /
    • pp.954-963
    • /
    • 2012
  • As a greedy algorithm reconstructing the sparse signal from underdetermined system, orthogonal matching pursuit (OMP) algorithm has received much attention. In this paper, we multiple candidate matching pursuit (MuCaMP), which builds up candidate support set in every iteration and uses the minimum residual at last iteration. Using the restricted isometry property (RIP), we derive the sufficient condition for MuCaMP to recover the sparse signal exactly. The MuCaMP guarantees to reconstruct the K-sparse signal when the sensing matrix satisfies the RIP constant ${\delta}_{N+K}<\frac{\sqrt{N}}{\sqrt{K}+3\sqrt{N}}$. In addition, we show a recovery performance both noiseless and noisy measurements.

Magnetic Resonance Imaging Using Matching Pursuit (Matching Pursuit 방법을 이용한 MR영상법에 관한 연구)

  • Ro, Y.M.;Zakhora, Avideh
    • Proceedings of the KOSOMBE Conference
    • /
    • v.1997 no.05
    • /
    • pp.230-234
    • /
    • 1997
  • The matching pursuit (MP) algorithm developed by S. Mallat and Z. Zhang is applied to magnetic resonance (MR) imaging. Since matching pursuit is a greedy algorithm to find waveforms which are the best match for an object-signal, the signal can be decomposed with a few iterations. In this paper, we propose an application of the MP algorithm to the MR imaging to reduce imaging time. Inner products of residual signals and selected waveforms in the MP algorithm are derived from the MR signals by excitation of RF pulses which are fourier transforms of selected waveforms. Results from computer simulations demonstrate that the imaging time is reduced by using the MP algorithm and further a progressive reconstruction can be achieved.

  • PDF

Computational performance and accuracy of compressive sensing algorithms for range-Doppler estimation (거리-도플러 추정을 위한 압축 센싱 알고리즘의 계산 성능과 정확도)

  • Lee, Hyunkyu;Lee, Keunhwa;Hong, Wooyoung;Lim, Jun-Seok;Cheong, Myoung-Jun
    • The Journal of the Acoustical Society of Korea
    • /
    • v.38 no.5
    • /
    • pp.534-542
    • /
    • 2019
  • In active SONAR, several different methods are used to detect range-Doppler information of the target. Compressive sensing based method is more accurate than conventional methods and shows superior performance. There are several compressive sensing algorithms for range-Doppler estimation of active sonar. The ability of each algorithm depends on algorithm type, mutual coherence of sensing matrix, and signal to noise ratio. In this paper, we compared and analyzed computational performance and accuracy of various compressive sensing algorithms for range-Doppler estimation of active sonar. The performance of OMP (Orthogonal Matching Pursuit), CoSaMP (Compressive Sampling Matching Pursuit), BPDN (CVX) (Basis Pursuit Denoising), LARS (Least Angle Regression) algorithms is respectively estimated for varying SNR (Signal to Noise Ratio), and mutual coherence. The optimal compressive sensing algorithm is presented according to the situation.

Matching Pursuit Estimation and Quantizer Design for Sinusoidal Model-based Coder (정현파 모델 부호화기를 위한 MP(Matching Pursuit) 알고리즘과 파라미터 양자화기)

  • Ahn Yeong-Uk;Jeong Gyu-Hyeok;Kim Jong-Hak;Yang Yong-Ho;Lee In-Sung
    • The Journal of the Acoustical Society of Korea
    • /
    • v.24 no.7
    • /
    • pp.402-409
    • /
    • 2005
  • In this paper. we propose a coding method using a matching pursuit algorithm in a strongly periodic highband signal. Also. we propose an efficient quantizer for the estimated parameters : spectral magnitude and phase. Based on the error concealment principle and sinusoidal model. the MP algorithm requires the high-precision pitch period estimation. To estimate more accurate pitch period. the refined pitch obtained from lowband speech is used. which increases the efficiency of bit allocation. The spectral magnitude parameters are quantized by the method which is combined with MDCT (Modified Discrete Cosine Transform) and multi-stage structure. The spectral phase quantizer uses the $2{\pi}$ modular characteristic of phases and the weighted function by spectral magnitudes. To evaluate the efficiency of the proposed method. we applied it to analysis-by-synthesis system. Furthermore we suggest the possibillity of scalable wideband speech codecs based on band-split structure.

Channel estimation of OFDM System using MP Algorithm (Matching Pursuit 방식 을 이용한 OFDM 시스템의 채널 추정)

  • Choi Jaehwan;Lim Chaehyun;Han Dongseog;Yoon Daejung
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2004.11a
    • /
    • pp.175-178
    • /
    • 2004
  • 본 논문에서는 직교 주파수 분한 다중 접속 (orthogonal frequency division multiplexing, OFDM) 시스템에서 matching pursuit (MP) 알고리듬을 이용하는 이동 채널 추정 법을 제안한다. 기존의 OFDM 시스템에서 채널추정 알고리즘으로 쓰이는 zero-forcing (ZF) 알고리듬은 잡음의 영향으로 채널 추정 오류의 가능성을 가지고 있다. 제안한 알고리듬에서는 MP 알고리듬을 이용하여 스파스(sparse)형태의 채널을 추정함으로써 다중경로가 없다고 가정되는 시간영역의 채널구간에서 발생될 수 있는 잡음에 의한 영향을 줄인다. 또한 연속적으로 전송되는 파일럿 정보를 이용하여 실시간으로 채널의 변화를 추정한다. 제안한 알고리듬으로 채널을 추정하고 등화를 했을 경우 ZF 알고리듬보다 우수한 성능을 보임을 실험에서 확인한다.

  • PDF

Probabilistic Exclusion Based Orthogonal Matching Pursuit Algorithm for Sparse Signal Reconstruction (희소 신호의 복원을 위한 확률적 배제 기반의 직교 정합 추구 알고리듬)

  • Kim, Seehyun
    • 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.

Genetic Algorithm based Orthogonal Matching Pursuit for Sparse Signal Recovery (희소 신호 복원을 위한 유전 알고리듬 기반 직교 정합 추구)

  • Kim, Seehyun
    • 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.

Channel estimation of OFDM System using Matching Pursuit method (Matching Pursuit 방식을 이용한 OFDM 시스템의 채널 추정)

  • Choi Jae Hwan;Lim Chae Hyun;Han Dong Seog;Yoon Dae Jung
    • Journal of Broadcast Engineering
    • /
    • v.10 no.2
    • /
    • pp.166-173
    • /
    • 2005
  • In this paper, we propose a mobile channel estimation algorithm using matching pursuit algorithm for orthogonal frequency division multiplexing (OFDM) systems. Least square (LS) algorithm, which is used as a conventional channel estimation algorithm for OFDM systems, has error probability of channel estimation affected by effects of noise. By estimating the channel of sparse type, the proposed algorithm reduces effects of noise during time intervals that multi-path signal doesn't exist. The proposed algorithm estimates a mobile receivingchannel using pilot information transmitted consequently. We compare performance of the proposed algorithm with the LS algorithm by measuring symbol error rate with 64QAM under a mobile multi-path fading channel model.

Performance evaluation of estimation methods based on analysis of mean square error bounds for the sparse channel (Sparse 채널에서 최소평균오차 경계값 분석을 통한 채널 추정 기법의 성능 비교)

  • Kim, Hyeon-Su;Kim, Jae-Young;Park, Gun-Woo;Choi, Young-Kwan;Chung, Jae-Hak
    • Journal of Satellite, Information and Communications
    • /
    • v.7 no.1
    • /
    • pp.53-58
    • /
    • 2012
  • In this paper, we evaluate and analyze representative estimation methods for the sparse channel. In order to evaluate error performance of matching pursuit(MP) and minimum mean square error(MMSE) algorithm, lower bound of MMSE is determined by Cramer-Rao bound and compared with upper bound of MP. Based on analysis of those bounds, mean square error of MP which is effective in the estimation of sparse channel can be larger than that of MMSE according to the number of estimated tap and signal-to-noise ratio. Simulation results show that the performances of both algorithm are reversed on the sparse channel with Rayleigh fading according to signal-to-noise ratio.

Method Based on Sparse Signal Decomposition for Harmonic and Inter-harmonic Analysis of Power System

  • Chen, Lei;Zheng, Dezhong;Chen, Shuang;Han, Baoru
    • 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.