A fast matching pursuits algorithm using sub-band decomposition of video signals

金沢大学大学院自然科学研究科情報システム金沢大学工学部A high-efficiency video coding method using matching pursuits, which is a waveform coding technique, has recently been proposed. In this method, the motion compensated prediction error image is encoded by applying matching pursuits. In the present paper, we propose a matching pursuits coding method that encodes the sub-band images derived from motion compensated prediction error images. The complexity of the proposed method is reduced compared to the full-band matching pursuits because of lighter inner product computation due to reduction of both the resolution of the sub-band image and the basis function length of the dictionary. We evaluated the coding performance and computational complexity of the proposed method via computer simulations. © 2006 IEEE

非低エネルギー領域多段探索法によるMatching Pursuitsの高速化

金沢大学理工研究域電子情報学系A fast atom searching method for matching pursuits in a high-efficiency video coding system is described in this paper. The immense amount of operations is needed for the atom searching in matching pursuits, so speed-up in the searching algorithm is indispensable. We propose an atom searching algorithm that is based on both a correlation between the high signal-energy regions and optimal matching points and the correlation between the highly efficient approximated points, and to improve the computational complexity by reducing the searching points

動的学習による辞書を用いたMatching Pursuits符号化

金沢大学理工研究域電子情報学系Recently, an efficient video coding method at low bit rate using Matching Pursuits (MP) has been proposed. The MP coding method represents a signal in an approximate form using a dictionary. Therefore, coding performance depends greatly on the dictionary. In this paper, we introduce a video coding method that employs motion compensation and MP using a dynamic learning dictionary. The dictionary of the proposed method is renewed at each frame by using encoded information. Simulation results show that the coding performance of MP can be improved by applying the dynamic learning dictionary

Visual Data Compression for Multimedia Applications

The compression of visual information in the framework of multimedia applications is discussed. To this end, major approaches to compress still as well as moving pictures are reviewed. The most important objective in any compression algorithm is that of compression efficiency. High-compression coding of still pictures can be split into three categories: waveform, second-generation, and fractal coding techniques. Each coding approach introduces a different artifact at the target bit rates. The primary objective of most ongoing research in this field is to mask these artifacts as much as possible to the human visual system. Video-compression techniques have to deal with data enriched by one more component, namely, the temporal coordinate. Either compression techniques developed for still images can be generalized for three-dimensional signals (space and time) or a hybrid approach can be defined based on motion compensation. The video compression techniques can then be classified into the following four classes: waveform, object-based, model-based, and fractal coding techniques. This paper provides the reader with a tutorial on major visual data-compression techniques and a list of references for further information as the details of each metho

Efficient compression of motion compensated residuals

EThOS - Electronic Theses Online ServiceGBUnited Kingdo