检索结果-内蒙古大学图书馆

texture coding using a weld decomposition model

IEEE TRANSACTIONS ON IMAGE PROCESSING 1996年第9期5卷 1382-1386页

作者： Sriram, R Francos, JM Pearlman, WA BEN GURION UNIV NEGEV DEPT ELECT & COMP ENGNIL-84105 BEER SHEVAISRAEL RENSSELAER POLYTECH INST DEPT ELECT COMP & SYST ENGNTROYNY 12180

A novel approach for coding textured images is presented. The texture field is assumed to be a realization of a regular homogeneous random field, which can have a mixed spectral distribution. On the basis of a two-dimensional (2-D) Weld-like decomposition, the field is represented as a sum of a purely indeterministic, harmonic, and countable number of evanescent fields. We present an algorithm for estimating and coding the texture model parameters, and show that the suggested algorithm yields high-quality reconstructions at low bit rates. The model and the resulting coding algorithm are seen to be applicable to a wide variety of texture types found in natural images.

关键词： coding Fields algorithms texture model disaggregation model texture coding spectrum distribution

来源：评论

学校读者我要写书评

暂无评论

Fast texture coding Based on Spatial, Temporal and Inter-View Correlations for 3D Video coding

引用

IEEE ACCESS 2021年 9卷 100081-100095页

作者： Lin, Jie-Ru Chen, Mei-Juan Ciou, Yi-Sheng Yeh, Chia-Hung Lin, Min-Hui Kau, Lih-Jen Chang, Chuan-Yu Natl Dong Hwa Univ Dept Elect Engn Hualien 974301 Taiwan Natl Taiwan Normal Univ Dept Elect Engn Taipei 106308 Taiwan Natl Sun Yat Sen Univ Dept Elect Engn Kaohsiung 804201 Taiwan Natl Taipei Univ Technol Dept Elect Engn Taipei 106344 Taiwan Natl Yunlin Univ Sci & Technol Dept Comp Sci & Informat Engn Touliu 640301 Yunlin Taiwan

3D-HEVC (The 3D Extension of High Efficiency Video coding), the latest international standard for 3D video coding, supports multiview plus depth 3D video format to enrich multimedia applications. For the texture coding, 3D-HEVC utilizes not only the information of temporal and spatial domains but also that of inter-view domain. However, the time consumption and complexity of 3D-HEVC also increase significantly. In this paper, fast texture coding algorithm for 3D-HEVC is proposed. We individually calculate the Pearson correlation coefficients by the rate-distortion costs (RD-costs) of coding tree units (CTUs) in the temporal, spatial and inter-view domains to analyze the correlations for independent view and dependent view. The proposed coding algorithm is based on the coding information of CTUs with higher correlations. The fast algorithm predicts and dynamically adjusts the depth range of the coding unit (CU). The prediction unit (PU) mode decision is proposed according to the complexity and partition direction of the best PU modes obtained from the highly correlated CTUs. The search range is adaptively adjusted for motion estimation. In addition, the RD-cost threshold is estimated to early terminate the CU split. Experimental results show that the proposed fast texture coding algorithm reduces the texture coding time significantly and outperforms numerous previous works.

关键词： Encoding Three-dimensional displays Correlation Video coding Correlation coefficient Prediction algorithms Partitioning algorithms 3D-HEVC texture coding CU early termination fast PU decision search range adjustment

来源：评论

学校读者我要写书评

暂无评论

Early merge mode decision for texture coding in 3D-HEVC

引用

JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION 2015年 33卷 60-68页

作者： Song, Yu-xin Jia, Ke-bin Beijing Univ Technol Coll Elect Informat & Control Engn Beijing 100124 Peoples R China

As the upcoming 3D video coding standard, high efficiency video coding (HEVC) based 3D video coding (3D-HEVC) has been drafted. In 3D-HEVC, the computational complexity of mode decision process is significantly high due to exhaustive modes' checks for coding units (CU) derived from recursive quad-tree partitioning. In this paper, we propose an early merge mode decision method for complexity reduction of dependent texture views. First, inter-view correlation and hierarchical depth correlation of coding modes are separately analyzed for B frame and P frame. Then, conditions to early determine merge mode coded CUs are derived based on the correlations. All of the early determined CUs only check merge modes in the mode decision process, which brings considerable complexity reduction. Experimental results demonstrate that the proposed method can achieve average 20.4% of encoding time saving for dependent texture views with negligible rate distortion performance loss. (C) 2015 Elsevier Inc. All rights reserved.

关键词： Video coding 3D-HEVC Multiview plus depth Dependent view texture coding Mode decision Merge mode Complexity reduction

来源：评论

学校读者我要写书评

暂无评论

Optimal bit allocation for joint texture-aware contour-based shape coding and shape-adaptive texture coding

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY 2008年第6期18卷 840-844页

作者： Bandyopadhyay, Saurav K. Kondi, Lisimachos P. W&W Comm DSP Res Sunnyvale CA 94086 USA Univ Ioannina Dept Comp Sci GR-45110 Ioannina Greece

In this paper, an operationally optimal joint shape and texture coding algorithm is proposed that uses shape-adaptive texture coding as well as texture-aware shape coding. The solution is optimal in the operational rate distortion sense, i.e, given the coding setup, the solution will guarantee the smallest possible distortion for a given rate. The shape is approximated using polygons or higher order curves. We also consider biasing the cost function to favor horizontal and vertical edges for the case of polygon approximation (biased polygon approximation). The texture is encoded using shape-adaptive discrete cosine transform. or shape-adaptive discrete wavelet transform of the MPEG-4 video codec. A comparison is drawn between the two techniques. Both a fixed-width and a variable-width tolerance band for shape coding are considered. The variable width of the tolerance band is a function of the texture profile, i.e, the width is inversely proportional to the magnitude of the image gradient. Experimental results are presented and conclusions are drawn.

关键词： optimization shape-adaptive discrete cosine transform (SA-DCT) shape-adaptive discrete wavelet transform (SA-DWT) shape coding texture coding

来源：评论

学校读者我要写书评

暂无评论

Boundary block-merging (BBM) technique for efficient texture coding of arbitrarily shaped object

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY 1999年第1期9卷 35-43页

作者： Moon, JH Kweon, JH Kim, HK Hyundai Elect Ind Co Ltd Informat & Telecommun R&D Ctr Seoul South Korea

We present an efficient texture coding method which enhances the coding efficiency of conventional discrete cosine transform (DCT) with padding techniques for arbitrarily shaped objects in object-based video coding where shape information is provided. The BBM (boundary block-merging) technique is applied to the boundary macroblocks of 16 x 16 pixels of a VOP (video object plane) which consist of both background and object pixels. A macroblock consists of four subblocks of 8 x 8 pixels. For boundary subblocks consisting of object and background pixels, padding is performed in the background region. For a pair of padded boundary subblocks in a macroblock of which alignment belongs to a predefined set, one subblock is rotated 180 degrees and merged into another one if object pixels do not overlap, After merging, the boundary macroblock is coded using the conventional DCT coding. The merging process reduces the number of subblocks to be DCT coded, and high correlation between adjacent subblocks makes the number of DCT coding bits small, Experimentation has been done on various test sequences under different test conditions, and verifies significant coding efficiency improvement: reduction of coding bits for luminance boundary blocks by 5.7-11.9 % at the same PSNR values compared with the padding-based DCT without BBM.

关键词： arbitrarily shaped object coding efficiency object-based coding texture coding

来源：评论

学校读者我要写书评

暂无评论

An MPEG-4 texture coding approach using refined boundary block merging and adaptive SA-DCT

An MPEG-4 texture coding approach using refined boundary blo...

引用

International Multiconference of Engineers and Computer Scientists

作者： Shih, Jau-Ling Lee, Chang-Hsing Chiang, Yen-Yi Chung Hua Univ Dept Comp Sci & Informat Engn 707Sec 2WuFu Rd Hsinchu Taiwan

ISBN: (纸本)9889867133

The refined boundary block merging (RBBM) algorithm is proposed for coding the texture information of arbitrarily shaped video objects in MPEG-4. In RBBM, only horizontal and vertical merging are taken into account since the diagonal merging ratio is very small. To further improve the coding performance, adaptive SA-DCT is then exploited to efficiently encode each merged block. Experimental results confirm the effectiveness of the proposed algorithm.

关键词： MPEG4 texture coding SA-DCT

来源：评论

学校读者我要写书评

暂无评论

Local texture Synthesis: A Static texture coding Algorithm Fully Compatible With HEVC 22

Local Texture Synthesis: A Static Texture Coding Algorithm F...

引用

22nd International Conference on Systems, Signals and Image Processing (IWSSIP)

作者： Naser, Karam Ricordel, Vincent Le Callet, Patrick Univ Nantes LUNAM Univ CNRS UMR 6597IRCCyNPolytech Nantes Rue Christian PaucBP 50609 F-44306 Nantes 3 France

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 (content based video coding) 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.

关键词： texture coding Perceptual Optimization Content-based Video coding Beyond HEVC

来源：评论

学校读者我要写书评

暂无评论

Shape Adaptive texture coding Based on Wavelet-Based Contourlet Transform 11

Shape Adaptive Texture Coding Based on Wavelet-Based Contour...

引用

11th International Congress on Image and Signal Processing, BioMedical Engineering and Informatics (CISP-BMEI)

作者： Shu, Zhenghua Liu, Guodong Xie, Zhihua Ren, Zhong Jiangxi Sci & Technol Normal Univ Key Lab Opt Elect & Commun Nanchang Jiangxi Peoples R China

ISBN: (纸本)9781538676042

Transform coding of arbitrary shape object is one of the core technologies of MPEG-4 video coding. In this chapter, we propose a shape adaptive Wavelet-Based Contourlet Transform framework for MPEG4 texture coding. In the shape adaptive texture coding framework, Wavelet-Based Contourlet Transform is divided into two parts: the Wavelet-Based Contourlet Transform of the shape mask, and the Wavelet-Based Contourlet Transform of the object texture. In the Wavelet-Based Contourlet Transform phase, the shape coding is carried out using lazy Wavelet-Based Contourlet Transform, and the texture coding is carried out by 9/7 wavelets in the form of lifting. In the zerotree quantization stage of wavelet coefficients, three quantization methods are adopted according to different needs. The experimental results show that the Wavelet-Based Contourlet Transform texture coding based on object has similar low complexity with the texture coding, such as SADCT, and the performance is better. Moreover, the coding effect is better than that of SADCT at low bit rate.

关键词： texture coding arbitrary shape area video object plane Wavelet-Based Contourlet Transform

来源：评论

学校读者我要写书评

暂无评论

AN ADAPTIVE LIGHTING CORRECTION METHOD FOR MATCHED-texture coding

AN ADAPTIVE LIGHTING CORRECTION METHOD FOR MATCHED-TEXTURE C...

引用

IEEE International Conference on Acoustics, Speech and Signal Processing

作者： Guoxin Jin Thrasyvoulos N. Pappas David L. Neuhoff EECS Department Northwestern Univ. Evanston IL 60208 EECS Department Univ. of Michigan Ann Arbor MI 48109

ISBN: (纸本)9781479928941

Matched-texture coding is a novel image coder that utilizes the self-similarity of natural images that include textures, in order to achieve structurally lossless compression. The key to a high compression ratio is replacing large image blocks with previously encoded blocks with similar structure. Adjusting the lighting of the replaced block is critical for eliminating illumination artifacts and increasing the number of matches. We propose a new adaptive lighting correction method that is based on the Poisson equation with incomplete boundary conditions. In order to fully exploit the benefits of the adaptive Poisson lighting correction, we also propose modifications of the side-matching (SM) algorithm and structural texture similarity metric. We show that the resulting matched-texture algorithm achieves better coding performance.

关键词： Lighting Poisson equation compression ratio texture coding textures images

来源：评论

学校读者我要写书评

暂无评论

A novel scalable texture video coding scheme with GPCA

A novel scalable texture video coding scheme with GPCA

引用

32nd IEEE International Conference on Acoustics, Speech and Signal Processing

作者： Liu, Jian Zhuang, Yueting Yao, Lei Wu, Fei Zhejiang Univ Coll Comp Sci Hangzhou 310027 Peoples R China

ISBN: (纸本)9781424407286

This paper proposes a novel SNR scalable coding method with the support of generalized principle component analysis (GPCA). This method encodes the low-pass and high-pass pictures generated by the MCTF decomposition with a hybrid linear model instead of traditional block-based DCT transform. GPCA is a powerful tool to identify the hybrid linear model in the textures, which segment the texture into heterogeneous regions, and then encode each region with PCA method. By keeping various proportions of PCA coefficients, and altering the quantization step sizes for different layers, a better scalable coding result can be achieved.

关键词： video coding scalability texture coding GPCA hybrid linear model

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：