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

Low-complexity QTMT partition based on deep neural network for Versatile Video coding

SIGNAL IMAGE AND VIDEO PROCESSING 2021年第6期15卷 1153-1160页

作者： Abdallah, Bouthaina Belghith, Fatma Ben Ayed, Mohamed Ali Masmoudi, Nouri Univ Sfax Elect & Informat Technol Lab Natl Engn Sch Sfax Sfax Tunisia

Versatile Video coding (VVC), the newest standard for future video coding, is currently under development. This proposal aimed to improve the encoder performance over the latest standard namely High Efficiency Video coding, carried with a high increase in coding complexity. The VVC partition structure is mainly based on the quadtree with nested multi-type tree (QTMT) block scheme. Such an improvement leads to a more flexible block partition and promotes a high encoding efficiency, but generates a huge coding complexity. In order to deal with this issue, a fast QTMT intra partition algorithm, based on a deep neural network named Early Terminated Hierarchical Convolution Neural Network, is applied to predict the 64x64 block QT partition structure. The proposed algorithm determines the QTMT partition structure based on the decision of whether to split or skip the corresponding CU, in order to get 128x128 coding Tree Unit partition architecture. In this paper, the proposed intra partition work achieves a significant speedup in encoding gain that reaches 32.96% in best cases for Ultra High Definition video sequences compared to the reference VVC software VTM-3.0. For all video sequences, 24.49% time saving is reached on average. This improvement comes with an increase of 4.18% and a decrease of 0.18 dB in terms of BDBR and BDPSNR, respectively.

关键词： Versatile Video coding (VVC) Nested multi-type tree (QTMT) coding complexity Intra partition Deep neural network

来源：评论

学校读者我要写书评

暂无评论

Fountain Code-Based LT-SLT Anti-Eavesdropping coding Design

引用

IEEE ACCESS 2023年 11卷 134690-134700页

作者： Wang, Lizheng Niu, Fanglin Qian, Daxing Yu, Ling Liaoning Univ Technol Sch Elect & Informat Engn Jinzhou 121001 Peoples R China Dalian Ocean Univ Coll Informat Engn Dalian 116000 Peoples R China

In wireless communication wiretap channel, for the eavesdropper to obtain the legitimate receiver decoding rules situation, this paper proposes a LT-SLT fountain code anti-eavesdropping channel coding design. This method targets the Luby Transform (LT) code transmission for some of the original symbols of the Shifted LT (SLT) code and utilizes the fountain code to receive the correct symbols in different noise channels with differential characteristics so that the decoding process of the eavesdropper changes and cannot be decoded in synchronization with the legitimate receivers, and then the partial symbols of the recovered source are different from those of the legitimate receivers. When these symbols continue to participate in SLT decoding, increasing the untranslated rate of the eavesdropper. Experimental results show that although the method proposed in this paper increases the number of decoded symbols by a small amount, the eavesdropper untranslated rate of this scheme gets improved by about 15% when the main channel or the wiretap channel is varied individually, compared with LT code and SLT code. When both the main channel and the wiretap channel are varied simultaneously, the untranslated rate of the eavesdropper in this scheme gets approximately 30% higher compared to LT code and SLT code, and the untranslated rate of the eavesdropper in this scheme gets approximately 14% higher compared to SLT-LT fountain code. When the main channel is worse or slightly better than the wiretap channel, the untranslated rate of eavesdroppers of this scheme is better than that of SLT-LT fountain code, which effectively ensures secure transmission of information.

关键词： Anti-eavesdropping erase channel physical layer security fountain codes coding complexity

来源：评论

学校读者我要写书评

暂无评论

Vision-oriented algorithm for fast decision in 3D video coding

引用

IET IMAGE PROCESSING 2022年第8期16卷 2263-2281页

作者： Lin, Jie-Ru Chen, Mei-Juan Yeh, Chia-Hung Lin, Shinfeng D. Sue, Kuen-Liang Kau, Lih-Jen Ciou, Yi-Sheng Natl Dong Hwa Univ Dept Elect Engn Hualien Taiwan Natl Taiwan Normal Univ Dept Elect Engn Taipei 10610 Taiwan Natl Sun Yat Sen Univ Dept Elect Engn Kaohsiung Taiwan Natl Dong Hwa Univ Dept Computet Sci & Informat Engn Hualien Taiwan Natl Cent Univ Dept Informat Management Taoyuan Taiwan Natl Taipei Univ Technol Dept Elect Engn Taipei Taiwan

This paper designs a novel method to reduce the coding complexity of 3D-HEVC encoder by utilizing the properties of human visual perception. Two vision-oriented edge detections are proposed: for colour texture detection, the authors adopt the Just-Noticeable Distortion (JND);for depth map, the authors combine the Sample Adaptive Offset (SAO) and the Just Noticeable Depth Difference (JNDD) model. The authors also analyse the properties of colour texture and depth map to classify the coding tree unit (CTU) into various kinds of types, including complex-edge CTU, moderate-edge CTU and homogeneous CTU. Besides, fast mode decisions and early termination criteria are performed individually on each type of CTUs according to their characteristics. Especially for those CTUs with more edge information, the proposed projection-based fast mode decision and residual-based early termination preserve important colour texture while speeding up the coding at the same time. The proposed vision-oriented algorithm reduces 31.981% of the overall average coding time with only 1.580% BD-Bitrate increase. Experimental results show that the proposed algorithm can provide considerable time-saving while still maintain the video quality, which outperforms the previous researches.

关键词： projection-based fast mode decision residual-based early termination preserve important colour texture homogeneous CTU Sample Adaptive Offset 3D video coding video coding complex-edge CTU fast decision depth map colour texture detection edge detection vision-oriented algorithm 3D-HEVC encoder human visual perception Noticeable Depth Difference model vision-oriented edge detections image texture coding tree unit visual perception Just-Noticeable Distortion moderate-edge CTU coding complexity early termination criteria fast mode decisions edge information average coding time

来源：评论

学校读者我要写书评

暂无评论

A high speed and memory efficient algorithm for perceptually-lossless volumetric medical image compression

引用

JOURNAL OF KING SAUD UNIVERSITY-COMPUTER AND INFORMATION SCIENCES 2022年第6期34卷 2964-2974页

作者： Lone, Mohd Rafi Baba Ghulam Shah Badshah Univ Dept Elect & Commun Engn Rajouri 185234 J&K India

With the advancements in modern medical imaging systems, the diagnostic image data has increased exponentially. The future medical applications seek medical imaging devices to be portable. Image quality and real-time processing are of prime importance in medical image compression. Therefore the volumetric medical images need to be compressed in perceptually lossless manner. Also the time taken to compress the images before transmitting (or storing), should be small. In this paper, an algorithm for lossless and perceptually-lossless medical image compression is proposed. The proposed algorithm uses two small lists and two small state-tables to encode an image. The compression efficiency is comparable to the state-of-the-art lossless compression techniques. Also the computational complexity and memory requirement are realistic for portable medical imaging devices. Combining all the three features, it is obvious that the proposed algorithm is a better candidate for image compression in comparison to all the state-of-art compression algorithms that we know of, for volumetric-medical imaging systems. (C) 2020 The Author. Published by Elsevier B.V. on behalf of King Saud University.

关键词： Medical image compression Near-lossless coding Peak absolute error coding complexity Spatial orientation block-tree

来源：评论

学校读者我要写书评

暂无评论

Listless Block Cube Tree coding for Low Resource Hyperspectral Image Compression Sensors 5

Listless Block Cube Tree Coding for Low Resource Hyperspectr...

引用

5th International Conference on Multimedia, Signal Processing and Communication Technologies (IMPACT)

作者： Chandra, Harshit Bajpai, Shrish Integral Univ Fac Engn & Informat Technol ECE Dept Lucknow Uttar Pradesh India

ISBN: (纸本)9781665476478

Hyperspectral (HS) image has rich spectral information content, which facilitates multiple applications including remote sensing. Due to the big data size of the HS image, compression is a required process for the efficiency of image storage and transmission. However, the complexity of the compression algorithms turns real-time compression into a very challenging task. A novel listless set partitioned hyperspectral image compression algorithm is proposed. The proposed compression algorithm uses zero block cube tree structure to exploit the inter and intra sub-band correlation to achieve the compression. From the result, it has been clear that the proposed compression algorithm has low coding complexity with at-par coding efficiency. Thus, it can be a suitable contender for low-resource hyperspectral image sensors.

关键词： coding complexity Compression Hyperspectral Image Set Partitioned Hyperspectral Image Compression Wavelet Transform

来源：评论

学校读者我要写书评

暂无评论

A Low-complexity Multiuser coding Scheme With Near-Capacity Performance

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2017年第8期66卷 6775-6786页

作者： Song, Guanghui Wang, Xianbin Cheng, Jun Singapore Univ Technol & Design Cluster Sci Singapore 487372 Singapore Univ Western Ontario Dept Elect & Comp Engn London ON N6A 3K7 Canada Doshisha Univ Dept Intelligent Informat Engn & Sci Kyoto 6100321 Japan

Nonorthogonal multiuser coding is an essential technique for superimposed transmission and improving spectrum efficiency of future wireless communication networks. In this paper, a low-complexity nonorthogonal coding scheme, called multiuser repetition-aided irregular repeat-accumulate (IRA) code, is proposed for a multiple access channel (MAC), and the scheme can be applied to fifth-generation (5G) nonorthogonal multiple access systems. The main idea is that not only parity checks, which are generated by an IRA encoder, but repetitions as well, are used in each user's codeword to reduce the coding and decoding complexities. Repetition is a simple way to construct a low-rate code and is shown to be beneficial for multiuser decoding iteration. With a deliberate control of the fraction of repetitions in the codeword and a degree distribution optimization of the IRA encoder, near MAC capacity performance is achieved. It is shown that as the number of users increases, more repetitions can be used, and therefore, very low encoding and decoding complexities are required.

关键词： coding complexity low-rate code nonorthogonal multiple access (NOMA) repetition-aided irregular repeat-accumulate (IRA) code

来源：评论

学校读者我要写书评

暂无评论

Reliable Storage System With Priority Filter and Load Balance Collection Model for Large Scale Sensor Networks

引用

IEEE ACCESS 2019年 7卷 184078-184089页

作者： Zhang, Wei Wang, Chenchao Xiao, Fengjun Xiong, Neal N. Chang, Jianfei Hangzhou Dianzi Univ Dept Comp Sci & Technol Hangzhou 310037 Peoples R China Tianjin Univ Coll Intelligence & Comp Tianjin 300072 Peoples R China

Wireless sensor network are widely used in various types of environmental monitoring and there are also many applications in the industrial field, we usually deploy sensor nodes in the corresponding areas to monitor and collect relevant data, waiting for a sink node to collect the stored data for further analysis and decision. But in some extremely harsh scenarios, the living environment of the sensor node is very bad, hence the data on the nodes will always lose. Generally, we use LT Codes to improve data persistence. However, some difficult problems with regard to the efficiency of coding and decoding of data can not be resolved by traditional solutions. In terms of the above problems, this paper improves the traditional coding method by reducing the number of encoded packets, so that the network congestion can be alleviated under the premise of successful data coding. What's more, we propose an edge layered collection model and a new coding strategy Edge Layering Fountain Codes (ELFC) based on the model, each sensor node inside the network sends its data to the edge nodes which are relatively safe to ensure the secure collection of data and allocate the resource consumption of the sensor nodes around the sink node. On this basis, the Ordered Edge Layering Fountain Codes (OELFC) is further proposed. The OELFC can collect data packets in a low degree-to-high degree manner, which greatly improves the efficiency of data decoding.

关键词： Wireless sensor network network coding LT codes cliff effect coding complexity random walk load balance decoding

来源：评论

学校读者我要写书评

暂无评论

A Fast CU Partition Algorithm Based on the coding Cost in Screen Content coding 10

A Fast CU Partition Algorithm Based on the Coding Cost in Sc...

引用

10th International Conference on Digital Image Processing (ICDIP)

作者： Liu, Zhi Zhang, Wengang Zhang, Mengmeng North China Univ Technol Beijing Peoples R China

ISBN: (数字)9781510622005

ISBN: (纸本)9781510622005

The new generation of high efficiency video coding standard (HEVC), although remarkably improves the compression performance, it increases the computational complexity of coding for Screen Content coding (SCC). Therefore, how to reduce the coding complexity becomes an important task in HEVC optimization. In this work, the process of quad-tree recursive partitioning has been studied, and the relationship between the coding cost and the mother block and child block has been found in statistics way, and an improved fast early termination coding unit partition based on the cost of the coding unit has been proposed. The experiment results show that the fast algorithm proposed in this paper can save 31.37% of the encoding time at the cost of reduces the coding performance by about 1.02 %.

关键词： HEVC intra prediction stop splitting fast CU Partition Algorithm SCC coding cost coding complexity CU depths

来源：评论

学校读者我要写书评

暂无评论

A Class of Binary Locally Repairable Codes

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2016年第8期64卷 3182-3193页

作者： Shahabinejad, Mostafa Khabbazian, Majid Ardakani, Masoud Univ Alberta Dept Elect & Comp Engn Edmonton AB T6G 2R3 Canada

An (n, k) erasure code that can recover any coded symbol by at most r other coded symbols is called a locally repairable code (LRC) with locality r. LRCs have been recently implemented in distributed storage systems. coding complexity reduction can be significantly decreased by using binary LRCs (BLRCs) as they eliminate costly multiplication calculation. In this paper, motivated by the recently erasure codes with d = 4 used in practice, we propose BLRCs when (r + 1) vertical bar n and d = 4. We prove that our proposed binary codes are optimal for r is an element of {1, 3}, meaning that neither their locality nor their minimum distance can be improved by non-binary codes. For r >= 4, our proposed binary codes offer near-optimal code rate, with a rate gap of O(log r/n) compared with optimal non-binary codes. While keeping the bulk of code structure binary, we eliminate this rate gap by using fields with sizes as small as r + 2 for only two redundant symbols. These non-binary codes still eliminate the need for costly multiplications in many operations including a single failure repair (a dominant repair scenario). Using the construction of spanning BLRC with d = 4 as a backbone, we also construct LRCs with minimum distance d >= 6. Furthermore, we obtain a closed-form equation for the mean-time to data-loss of arbitrary erasure codes.

关键词： Erasure coding distributed storage systems coding complexity binary locally repairable codes

来源：评论

学校读者我要写书评

暂无评论

引用

ELECTRONICS LETTERS 2016年第12期52卷 1022-1023页

作者： Jiang, He Yang, Jie Shanghai Jiao Tong Univ Inst Image Proc & Pattern Recognit 800 Dongchuan Rd Shanghai Peoples R China

A low complexity but effective method in image and video detail enhancement - in-place similarity is proposed. In-place similarity is the statistic result of different kinds of nature image patches when similarity measurement is done in super resolution research, finding that patches in the upscale image have a good match around its original location in the corresponding lower ones. On the basis of the in-place similarity, a simple assumption is made that detail layer is the high-frequency component of twice search and patch match result. Then, images under the framework of super resolution techniques are enhanced. Unlike many current algorithms that need to adjust parameters for different images to acquire best outputs the approach mentioned here is adaptive. Moreover, many algorithms have outcome with intensity and contrast change, the algorithm proposed here can prevent images from over enhancement with obvious nature looking effect. Extensive experiments demonstrate that the algorithm mentioned here is simple with robust good performance both subjectively and objectively. It is particularly useful for practical applications and easily hardware implemented in FPGA, where input images require diverse detail textures.

关键词： image texture image coding motion estimation rate distortion theory adaptive search range neighbouring depth intensity weighted sum HEVC texture coding high-efficiency video coding H 264 AVC bitrate reduction perceptual quality motion estimation ME coding complexity depth map multiview plus depth video HEVC complexity reduction depth intensity variation neighbouring blocks motion vector weighted sum rate-distortion degradation

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：