전기전자학회논문지 (Journal of IKEEE)

  • 제17권3호
  • /
  • Pages.339-345
  • /
  • 2013
  • /
  • 1226-7244(pISSN)
  • /
  • 2288-243X(eISSN)
한국전기전자학회 (Institute of Korean Electrical and Electronics Engineers)
권호 표지
DOI QR코드

DOI QR Code

희소 신호의 복원을 위한 확률적 배제 기반의 직교 정합 추구 알고리듬

Probabilistic Exclusion Based Orthogonal Matching Pursuit Algorithm for Sparse Signal Reconstruction

  • Kim, Seehyun (Department of Information and Communication Engineering, The University of Suwon)
  • 투고 : 2013.08.30
  • 심사 : 2013.09.17
  • 발행 : 2013.09.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

본 논문에서는 희소한 신호의 압축센싱를 위해 확률적 배제에 기반한 직교정합추구 (PEOMP) 신호 복원 알고리듬을 제안하였다. CoSaMP, gOMP, BAOMP 등의 알고리듬들은 매 반복 단계에서 새로운 atom들을 support set에 추가할 뿐만 아니라 부적절하다고 판단되어지는 atom들은 삭제하기 때문에 우수한 신호 복원 성능을 보인다. 그러나 반복 과정 중에 support set의 구성이 국소 최저점에서 벗어나지 못하여 신호 복원에 실패하는 경우가 발생하는 단점을 가지고 있다. 제안된 알고리듬은 매 반복 단계에서 확률적으로 임의의 atom을 배제하여 support set이 국소 최저점에 빠져 있는 경우 그곳에서 탈출하는데 도움을 준다. 모의실험을 통해 PEOMP가 기존의 OMP 기반의 알고리듬들과 $l_1$ 최적화 방법보다 신호 복원 능력 관점에서 우수한 성능을 보임을 확인하였다.

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.

키워드

참고문헌

  1. E. Candes, J. Romberg, and T. Tao, "Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information," IEEE Trans. Information Theory, vol. 52, no. 2, pp. 489-509, February, 2006. https://doi.org/10.1109/TIT.2005.862083
  2. D. Donoho, "Compressed sensing," IEEE Trans. Information Theory, vol. 52, no. 4, pp. 1289-1306, April, 2006. https://doi.org/10.1109/TIT.2006.871582
  3. E. Candes and T. Tao, "Decoding by linear programming," IEEE Trans. Information Theory, vol. 51, no. 12, pp. 4203-4215, Dec. 2005. https://doi.org/10.1109/TIT.2005.858979
  4. S. Mallat and Z. Zhang, "Matching pursuit with time-frequency dictionaries," IEEE Trans. Signal Processing, vol. 41, no. 12, pp. 3397-3415, December, 1993. https://doi.org/10.1109/78.258082
  5. J. A. Tropp, "Greed is good: algorithmic results for sparse approximation," IEEE Trans. Information Theory, vol. 50, no. 10, pp. 2231-2242, Oct. 2004. https://doi.org/10.1109/TIT.2004.834793
  6. D. Donoho, Y. Tsaig, I. Drori, and J. Starck, "Sparse solution of underdetermined linear equations by stagewise orthogonal matching pursuit," IEEE Trans. Information Theory, vol. 58, no. 2, pp. 1094-1121, Feb. 2012. https://doi.org/10.1109/TIT.2011.2173241
  7. D. Needell and J. A. Tropp, "CoSaMP: Iterative signal recovery from incomplete and inaccurate samples," Appl. Comput. Harmon. Anal., vol 26, no. 3, pp. 301-321, May 2009 https://doi.org/10.1016/j.acha.2008.07.002
  8. W. Dai and O. Milenkovic, "Subspace pursuit for compressive sensing signal reconstruction," IEEE Trans. Information Theory, vol. 55, no. 5, pp. 2230-2249, May 2009. https://doi.org/10.1109/TIT.2009.2016006
  9. S. Kwon and B. Shim, "Generalized orthogonal matching pursuit," Journal of IEEK, vol. SP-49, no. 2, pp. 122-128, March 2012. https://doi.org/10.5573/ieek.2012.49.10.122
  10. H. Huang and A. Makur, "Backtracking-based matching pursuit method for sparse signal reconstruction," IEEE Signal Processing Letters, vol. 18, no. 7, pp. 391-394, July 2011. https://doi.org/10.1109/LSP.2011.2147313