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

fast coding in digital steganography

The Journal of China Universities of Posts and Telecommunications 2009年第6期16卷 92-96页

作者： FU Yu ZHANG Ru MA Song-ya QU Zhi-guo Information Security Center State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing 100876 China Key Laboratory of Network and Information Attack and Defense Technology of MOE Beijing University of Posts and Telecommunications Beijing 100876 China College of Mathematics and Information Science Henan University Kaifeng 475004 China

Dynamical running coding was previously proposed as a method for construction of steganographic schemes in digital *** this article,a new approach of fast coding is proposed to improve steganographic *** embedding method is discussed in two cases of constructing different generating matrix;however,the proposed method generalizes the problem to only one case by changing the construction method from the original ***,the complexity of the proposed method is less than the original ***,both theoretical analysis and experiment results show better performance in terms of distortions and alterations of the cover objects when embedding the same amount of information data bits,which proves a better resistance against steganalysis.

关键词： cover object fast coding secret message steganography

来源：评论

学校读者我要写书评

暂无评论

fast CU decision method based on texture characteristics and decision tree for depth map intra-coding

引用

EURASIP JOURNAL ON IMAGE AND VIDEO PROCESSING 2024年第1期2024卷 34页

作者： Si, Lina Yan, Aohui Zhang, Qiuwen Zhengzhou Univ Light Ind Coll Comp Sci & Technol Zhengzhou 450002 Peoples R China

As the demand for higher quality 3D videos continues to grow, the 3D extensions of the Efficient Video coding (3D-HEVC) standard are gradually unable to meet the needs of users. Versatile Video coding Standard (H. 266/VVC), as an advanced video coding standard, adopts the nested Multi-Type Tree quadtree (QTMT) partitioning structure that current fast depth map coding unit (CU) partitioning methods cannot apply. Therefore, we have designed a fast intra-frame CU partitioning algorithm for VVC 3D video depth maps. Our proposed algorithm in this article consists of two steps, including two sub-algorithms. First, by analyzing the relationship between image entropy and variance and depth map CU division, we establish a bi-criterion decision algorithm to determine whether the texture complexity of the current CU is low enough to terminate its partitioning process. Then, for CUs that have been determined by the first algorithm to need further partitioning, we use a decision tree model based on Light Gradient Boosting Machine (LGBM) to predict which direction of Rate-Distortion Optimization (RDO) calculation can be skipped, which can avoid some unnecessary RDO calculations in a certain direction. The final experiment demonstrated the effect of the proposed algorithm, which can reduce 47.65% complexity of VVC 3D video intra-coding with negligible 0.23% Bj & oslash;ntegaard Delta Bitrate (BDBR) increase, superior to other advanced methods.

关键词： Depth map VVC 3D video fast coding Decision tree

来源：评论

学校读者我要写书评

暂无评论

fast SHVC inter-coding based on Bayesian decision with coding depth estimation

引用

JOURNAL OF REAL-TIME IMAGE PROCESSING 2021年第6期18卷 2269-2285页

作者： Lu, Yu Huang, Xudong Liu, Huaping Yin, Haibing Shen, Liquan Hangzhou Dianzi Univ Sch Commun Engn Hangzhou 310018 Peoples R China Oregon State Univ Sch Elect Engn & Comp Sci Corvallis OR 97331 USA Shanghai Univ Sch Commun & Informat Engn Shanghai 200444 Peoples R China

The scalable extension of the high efficiency video coding standard named SHVC supports flexible access for various terminals in heterogeneous networks. However, it is difficult to use in real-time scenarios because of the high complexity of the hierarchical coding structure. In this paper, a novel method for SHVC inter-coding is proposed to reduce the coding complexity in a manner that is compatible with quality scalability and spatial scalability. First, the depth range of the coding tree units is estimated from a reference table generated from a statistical probability distribution based on the correlation between the current coding unit (CU) and its adjacent CUs. Within this depth range, a fast CU partitioning method based on Bayesian minimum risk and a fast prediction unit (PU) selection method based on Bayesian maximum probability are adopted to improve time efficiency. Three different methods, namely, histogram estimation, Gaussian modelling and neighbouring prediction, are used to calculate the conditional probabilities for discrete or continuous features in the Bayesian decision method. The significant advantage of the proposed method is that the time savings in the enhancement layer for each sequence exceeds 60% with negligible quality loss.

关键词： SHVC Inter-coding fast coding Depth range Bayesian decision

来源：评论

学校读者我要写书评

暂无评论

Linear Multivariate Decision Trees for fast QTMT Partitioning in VVC

IEEE OPEN JOURNAL OF SIGNAL PROCESSING

引用

IEEE OPEN JOURNAL OF SIGNAL PROCESSING 2025年 6卷 175-183页

作者： Filipe, Jose N. Tavora, Luis M. N. Faria, Sergio M. M. Navarro, Antonio Assuncao, Pedro A. A. Univ Aveiro P-3810193 Aveiro Portugal Inst Telecomunicacoes P-3810193 Aveiro Portugal Inst Politecn Leiria P-2411901 Leiria Portugal Inst Telecomunicacoes P-2411901 Leiria Portugal

The demand for ultra-high definition (UHD) content has led to the development of advanced compression tools to enhance the efficiency of standard codecs. One such tool is the Quaternary Tree and Multi-Type Tree (QTMT) used in the Versatile Video coding (VVC), which significantly improves coding efficiency over previous standards, but introduces substantially higher computational complexity. To address the challenge of reducing computational complexity with minimal impact on coding efficiency, this paper presents a novel approach for intra-coding 360$<^>{\circ }$ video in Equirectangular Projection (ERP) format. By exploiting distinct complexity and spatial characteristics of the North, Equator, and South regions in ERP images, the proposed method is devised upon a region-based approach, using novel linear multivariate decision trees to determine whether a given partition type can be skipped. Optimisation of model parameters and an adaptive thresholding method is also presented. The experimental results show a Complexity Gain of approximately 16% with a negligible BD-Rate loss of only 0.06%, surpassing current state-of-the-art methods in terms of complexity gain per percentage point of BD-Rate loss.

关键词： Encoding Streaming media Random forests Computational complexity Standards Analysis of variance Solid modeling Equator Accuracy Computational modeling Video coding complexity versatile video coding fast coding omnidirectional video

来源：评论

学校读者我要写书评

暂无评论

coding Unit Splitting Early Termination for fast HEVC Intra coding Based on Global and Directional Gradients 18

Coding Unit Splitting Early Termination for Fast HEVC Intra ...

引用

18th IEEE International Workshop on Multimedia Signal Processing (MMSP)

作者： Jamali, Mohammadreza Coulombe, Stephane Univ Quebec Ecole Technol Super Montreal PQ Canada

ISBN: (纸本)9781509037247

High efficiency video coding (HEVC) doubles the compression ratio as compared to H.264/AVC, for the same quality. To achieve this improved coding performance, HEVC presents a new content-adaptive approach to split a frame into coding units (CUs), along with an increased number of prediction modes, which results in significant computational complexity. To lower this complexity with intra coding, in this paper, we develop a new method based on global and directional gradients to terminate the CU splitting procedure early and prevent processing of unnecessary depths. The global and directional gradients determine if the unit is predicted with high accuracy at the current level, and where that's the case, the CU is deemed to be non-split. Experimental results show that the proposed method reduces the encoding time by 52% on average, with a small quality loss of 0.07 dB (BD-PSNR) for all-intra scenarios, as compared to the HEVC reference implementation, HM 15.0.

关键词： HEVC intra coding CU splitting fast coding

来源：评论

学校读者我要写书评

暂无评论

CNN oriented fast QTBT partition algorithm for JVET intra coding

CNN oriented fast QTBT partition algorithm for JVET intra co...

引用

IEEE Visual Communications and Image Processing (VCIP)

作者： Jin, Zhipeng An, Ping Shen, Liquan Yang, Chao Shanghai Univ Sch Commun & Informat Engn Shanghai 200444 Peoples R China

ISBN: (纸本)9781538604625

In this paper, a novel fast coding unit depth decision algorithm based on convolution neural network is presented for JVET future video coding. JVET employs quad-tree plus binary-tree (QTBT) block partitioning structure, which can support much more flexibility for coding units partition shapes, and improve the coding performance significantly than the HEVC standard. However, the flexible partitioning structure also introduces a tremendous computation complexity. To address this issue, we model the QTBT partition depth range as a multi-class classification problem, and try to predict the depth range of 32x32 block directly, rather than to judge split or not at each depth level. To the best of our knowledge, it is the first framework to formulate the QTBT partition range as a multi classification task, and optimized by an end-to-end learning model. For training optimization, we design an objective function consists of class penalty term and L2 HingeLoss function, which leverage the characteristics of category settings, can further boost the classification accuracy. Experimental results demonstrate the effectiveness of our proposed method, which can achieve 42.80% complexity reduction with only 0.65% Bjontegaard Delta bitrate (BD-rate) increase.

关键词： JVET quad-tree plus binary-tree CU decision fast coding convolutional neural networks (CNN)

来源：评论

学校读者我要写书评

暂无评论

fast HEVC inter-frame coding based on LSTM neural network technology

引用

JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION 2024年 98卷

作者： Liu, Chang Nantong Univ Res Ctr Intelligent Informat Technol Nantong 226019 Peoples R China

High Efficiency Video coding (HEVC) is the most commonly used video coding standard. However, its high coding complexity is a heavy burden for real-time video applications. But, coding tools designed based on traditional coding frameworks have reached limits. Furthermore, existing low-complexity video coding methods have not thoroughly analyzed the characteristics of compressed video, making it impossible to develop targeted models to reduce coding complexity. Therefore, in this research, a fast HEVC inter-frame coding technique is proposed. Firstly, we perform a characteristics analysis of HEVC inter-frame coding to explore the correlation between video frames. Secondly, we develop an Inter-Frame Feature Transfer-Long Short-Term Memory (IFFT-LSTM) model to obtain the optimal coding tree unit (CTU) partition structure. Thirdly, we embed the IFFT-LSTM model into the HEVC test platform. The experimental results show that suggested method can effectively reduce the HEVC inter-frame coding complexity with a small amount of rate-distortion (RD) performance loss while maintaining acceptable subjective video quality.

关键词： HEVC fast coding Inter -frame coding LSTM Neural network

来源：评论

学校读者我要写书评

暂无评论

An Adaptive Quad-Tree Depth Range Prediction Mechanism for HEVC

引用

IEEE ACCESS 2018年 6卷 54195-54206页

作者： Duan, Kun Liu, Pengyu Jia, Kebin Feng, Zeqi Beijing Univ Technol Fac Informat Technol Beijing 100124 Peoples R China Beijing Lab Adv Informat Networks Beijing 100124 Peoples R China Beijing Univ Technol Beijing Key Lab Computat Intelligence & Intellige Beijing 100124 Peoples R China

A next-generation video coding standard High Efficiency Video coding (HEVC) provides higher video quality and lower compression bit rate but leads to very high encoding complexity, especially in the quad-tree-based coding tree unit partitioning process. To reduce the computational complexity of HEVC, in this paper, we propose an adaptive quad-tree depth range prediction mechanism. First, the proposed mechanism defines the similar region flag to distinguish between the similar region and the non-similar region. Then, two algorithms, the similar region depth range prediction algorithm and the non-similar region depth range prediction algorithm, are proposed. The similar region depth range prediction algorithm estimates the features of the similar region based on the coding unit depth of this region. The optimal depth of this region can be predicted. The non-similar region depth range prediction algorithm can skip low probability tree nodes based on the depth correlation coefficient, which is calculated based on scene content change. Both the similar region depth range prediction algorithm and the non-similar region depth range prediction algorithm show more than 90% predictive accuracy. Experimental results show that under random access configuration and low delay configuration, the proposed mechanism can yield 28.17% and 32.99% computational complexity reduction with negligible rate distortion performance loss, respectively, compared with HM16.9. The results show that the proposed mechanism is expected to be applied in real-time environments.

关键词： HEVC fast coding CU depth spatio-temporal correlation

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Classification for Complexity Reduction in HEVC Inter coding

引用

IEEE ACCESS 2020年 8卷 41690-41704页

作者： Lu, Yu Huang, Xudong Liu, Huaping Zhou, Yang Yin, Haibing Shen, Liquan Hangzhou Dianzi Univ Sch Commun Engn Hangzhou 31018 Peoples R China Oregon State Univ Sch Elect Engn & Comp Sci Corvallis OR 97331 USA Shanghai Univ Sch Commun & Informat Engn Shanghai 200444 Peoples R China

In order to adapt to various real-time applications, fast coding algorithms for high efficiency video coding (HEVC) standard maintain a hot research topic in recent years. In this paper, a complexity reduction algorithm based on hierarchical classification for HEVC inter coding is proposed. It consists of five fast algorithms which is accomplished by hierarchical classification trees at coding unit (CU) level, prediction unit (PU) level and transformation unit (TU) level respectively. At the beginning of proposed algorithm, intra features and inter features which describe the texture and context properties of CU, PU and TU are extracted from the training set. Then the classification trees for CU, PU and TU are generated by carefully selecting features and designing the classification criteria. By analyzing the spatiotemporal correlation, two strategies including early termination and early split are applied to fast coding by referring to these classification trees. The objective evaluation demonstrates that the proposed algorithm can significantly reduce coding complexity with little compression loss. Particularly the subjective evaluation based on similarity measurement for color histogram approves that decoded video quality between the original HM16.9 algorithm and the proposed algorithm is nearly identical.

关键词： Encoding Classification algorithms Prediction algorithms Partitioning algorithms Correlation Complexity theory Machine learning algorithms HEVC inter coding fast coding coding unit prediction unit transformation unit classification tree histogram similarity

来源：评论

学校读者我要写书评

暂无评论

fast and efficient construction of an unbiased random sequence

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2000年第3期46卷 1090-1093页

作者： Ryabko, BY Matchikina, E Siberian State Univ Telecommun & Informat Sci Dept Appl Math & Cybernet Novosibirsk Russia

The problem of converting a sequence of symbols generated bg a Bernoulli source into an unbiased random sequence is well-known in information theory. The proposed method is based on Elias' algorithm [5] in which the sequence of symbols is divided into blocks of length N, N greater than or equal to 1. We suggest a new method of constructing an unbiased random sequence which uses O(N log(2) N) bits of memory and takes O(log(3) N log log(N)) bit operations per letter.

关键词： efficiency fast coding redundancy unbiased random sequence

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：