LOW COMPLEXITY SEPARABLE MATCHING PURSUITS
LOW COMPLEXITY SEPARABLE MATCHING PURSUITS
复制标题
DOI：
--
复制
发表时间：
2004
期刊：
影响因子：
--
通讯作者：
Yuan Yuan-Yuan;A. Evans;D. Monro
中科院分区：
文献类型：
--
作者：
Yuan Yuan-Yuan;A. Evans;D. Monro
研究了在视频压缩中对位移帧差（DFD）图像进行编码时，降低匹配追踪算法复杂度的方法。使用2D基函数的全搜索被用作基准。可分离的1D基的使用大大降低了复杂性，并且通过仅使用1D内积搜索来定位原子位置，然后在相反方向上进一步1D内积搜索以识别第二1D基函数来实现显著的进一步降低。为了避免忽略与搜索方向正交的重要结构，建议在水平和垂直扫描之间交替初始搜索方向。与全2D搜索相比，这产生了适度的失真增加，复杂度降低超过一个数量级。
Methods of reducing the complexity of the matching pursuits algorithm with minimal loss of fidelity when coding displaced frame difference (DFD) images in video compression are investigated. A full search using 2D basis functions is used as a benchmark. The use of separable 1D bases greatly reduces the complexity, and significant further reductions are achieved by using only a 1D inner product search to locate the atom position, followed by a further 1D inner product search in the opposite direction to identify the second 1D basis function. To avoid ignoring significant structures orthogonal to the search direction, it is proposed to alternate the initial search direction between horizontal and vertical scanning. This produces a modest increase in distortion compared to the full 2D search, with a complexity reduction in excess of an order of magnitude.