This paper describes a hybrid object-basedvideocoding scheme that achieves efficient compression by separating moving objects from stationary background and transmitting the shape, motion and residuals for each segm...
详细信息
ISBN:
(纸本)9781424403523
This paper describes a hybrid object-basedvideocoding scheme that achieves efficient compression by separating moving objects from stationary background and transmitting the shape, motion and residuals for each segmented object. In this scheme, a new content-based object segmentation algorithm is proposed, which does not assume any prior modeling of the objects being segmented. The binarization process, which finds large object regions, is based on a threshold function that calculates block histograms and takes image noise into account. The resultant binary mask is further processed using morphological operations. The motion vectors are estimated inside the change detection mask using block-matching method between two successive frames, and then the dense motion field is estimated using the motion vectors and the Horn-Schunck algorithm.
Textures are one of the main characteristics of the visual scene. Perceptually, their details are less important than their semantic meaning. This property has been exploited in many texture coding (contentbased vide...
详细信息
ISBN:
(纸本)9781467383530
Textures are one of the main characteristics of the visual scene. Perceptually, their details are less important than their semantic meaning. This property has been exploited in many texture coding (contentbasedvideocoding) approaches by removing parts of the textures in the encoder and synthesizing them at the decoder side. Such an approach would necessarily need modification of the coding process and violating the standard. This paper introduces a novel algorithm for texture coding called Local Texture Synthesis (LTS), in which texture synthesis is employed in a full compatibility with HEVC standard. This implies that a basic HEVC decoder can be used to reconstruct the signal. LTS defines the necessary conditions to synthesize a patch and produces different synthesis of it. It tries then coding each of them, and finally chooses the one that minimizes the coding cost. A prototype of this algorithm, based on Markov Random Fields, is given in this paper. This prototype provides up to 10% bitrate saving (using the same quantization parameter) while maintaining an equivalent visual quality.
暂无评论