.png){kind=icon}
返回
Sparse Approximation Using M-Term Pursuit and Application in Image and Video Coding
.png){kind=icon}
PRE
AI
DOI：10.1109/TIP.2011.2181525.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper introduces a novel algorithm for sparse approximation in redundant dictionaries called the M-term pursuit (MTP). This algorithm decomposes a signal into a linear combination of atoms that are selected in order to represent the main signal components. The MTP algorithm provides an adaptive representation for signals in any complete dictionary. The basic idea behind the MTP is to partition the dictionary into L quasi-disjoint subdictionaries. A k-term signal approximation is then iteratively computed, where each iteration leads to the selection of M <= L atoms based on thresholding. The MTP algorithm is shown to achieve competitive performance with the matching pursuit (MP) algorithm that greedily selects atoms one by one. This is due to efficient partitioning of the dictionary. At the same time, the computational complexity is dramatically reduced compared to MP due to the batch selection of atoms. We finally illustrate the performance of MTP in image and video compression applications, where we show that the suboptimal atom selection of MTP is largely compensated by the reduction in complexity compared with MP.
Keyword:
Dictionary partition
matching pursuit (MP)
M-term pursuit (MTP)
scalable image compression
scalable video compression
sparse approximation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.7
论文数:
1.0W
被引数:
8.4W
机构
引用论文
分享收藏
Numerical investigation of pipe length determination in branched systems by transient tests.png)
Water Supply
Water SupplyIF0
PREAI
分享收藏
The extrapolation of the Drucker–Prager/Cap material parameters to low and high relative densities
PREAI
分享收藏
查看更多内容