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

Optimized octree codec for geometry-based point cloud compression

SIGNAL IMAGE AND VIDEO PROCESSING 2024年第1期18卷 761-772页

作者： Wang, Zhecheng Wan, Shuai Wei, Lei Northwestern Polytech Univ Xian 710129 Peoples R China RMIT Univ Melbourne Vic 3001 Australia

Geometry-based point cloud compression (G-PCC) standard is devoted to generic point clouds and offers excellent performance. However, redundancies are found in the original octree codec of G-PCC. This paper addresses the found issues to optimize the octree codec of G-PCC to be more precise. First, uniform contexts are proposed based on the neighbouring child nodes and nodes for the bitwise mode. Second, we merge the single-child mode into the planar mode. A method of eligibility determination for this new planar mode guided by the required number of coded bits is proposed. In addition, the characteristics of each plane in the point cloud are utilized to design contexts for the new planar mode. Third, we use the exponential moving average to optimize the contexts for the bitwise and planar modes, guaranteeing low memory consumption and high compression performance. Experimental evaluation, performed on a diversity of point clouds in the common test condition of G-PCC, demonstrates that the proposed methods enhance the compression performance of the octree codec in G-PCC with a gain of - 2.5 and - 5.8% for lossless and lossy geometry compression, respectively. At the same time, the computational complexity is reduced. Part of this work has been adopted to the latest G-PCC Edition 2. Compared to methods published in recent years, the improved octree codec of G-PCC also shows the advantages of compressing a diversity of point clouds.

关键词： Point clouds G-PCC Octree arithmetic coding

来源：评论

学校读者我要写书评

暂无评论

An Efficient Adaptive Binary Range Coder and Its VLSI Architecture

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY 2015年第8期25卷 1435-1446页

作者： Belyaev, Evgeny Liu, Kai Gabbouj, Moncef Li, YunSong Tampere Univ Technol Dept Signal Proc Tampere 33720 Finland Xidian Univ Sch Comp Xian 710071 Peoples R China

In this paper, we propose a new hardware-efficient adaptive binary range coder (ABRC) and its very-large-scale integration (VLSI) architecture. To achieve this, we follow an approach that allows to reduce the bit capacity of the multiplication needed in the interval division part and shows how to avoid the need to use a loop in the renormalization part of ABRC. The probability estimation in the proposed ABRC is based on a lookup table free virtual sliding window. To obtain a higher compression performance, we propose a new adaptive window size selection algorithm. In comparison with an ABRC with a single window, the proposed system provides a faster probability adaptation at the initial encoding/decoding stage, and more accurate probability estimation for very low entropy binary sources. We show that the VLSI architecture of the proposed ABRC attains a throughput of 105.92 MSymbols/s on the FPGA platform, and consumes 18.15 mW for the dynamic part power. In comparison with the state-of-the-art MQ-coder (used in JPEG2000 standard) and the M-coder (used in H.264/Advanced Video coding and H.265/High Efficiency Video coding standards), the proposed ABRC architecture provides comparable throughput, reduced memory, and power consumption. Experimental results obtained for a wavelet video codec with JPEG2000-like bit-plane entropy coder show that the proposed ABRC allows to reduce the bit rate by 0.8%-8% in comparison with the MQ-coder and from 1.0%-24.2% in comparison with the M-coder.

关键词： arithmetic coding image/video compression range coder very-large-scale integration (VLSI) architecture

来源：评论

学校读者我要写书评

暂无评论

An Adaptive Binary rANS With Probability Estimation in Reverse Order

引用

IEEE SIGNAL PROCESSING LETTERS 2023年 30卷 1487-1491页

作者： Belyaev, Evgeny Liu, Kai ITMO Univ St Petersburg 197101 Russia Xidian Univ Sch Comp Sci & Technol Xian 710126 Peoples R China

We propose an adaptive binary implementation of the range version of Asymmetric Numeral Systems (rANS). First, as rANS encoder processes symbols in reverse order, we estimate the probabilities in forward order, store them into the encoder memory, and use them during the reverse encoding. It guarantees that both the encoder and the decoder have exactly the same probability estimation for each symbol. Second, we show how this approach can be implemented using probability estimation via Virtual Sliding Window (VSW). Finally, we demonstrate that comparing to rANS with a static model, the proposed adaptive binary rANS provides better compression performance having similar decoding complexity.

关键词： arithmetic coding asymmetric numeral system probability estimation

来源：评论

学校读者我要写书评

暂无评论

AFRESh: an adaptive framework for compression of reads and assembled sequences with random access functionality

引用

BIOINFORMATICS 2017年第10期33卷 1464-1472页

作者： Paridaens, Tom Van Wallendael, Glenn De Neve, Wesley Lambert, Peter Ghent Univ iMinds Data Sci Lab B-9000 Ghent Belgium Ghent Univ Global Campus Ctr Biotech Data Sci Incheon 305701 South Korea Korea Adv Inst Sci & Technol Image & Video Syst Lab Daejeon 305732 South Korea

Motivation: The past decade has seen the introduction of new technologies that lowered the cost of genomic sequencing increasingly. We can even observe that the cost of sequencing is dropping significantly faster than the cost of storage and transmission. The latter motivates a need for continuous improvements in the area of genomic data compression, not only at the level of effectiveness (compression rate), but also at the level of functionality (e.g. random access), configurability (effectiveness versus complexity, coding tool set...) and versatility (support for both sequenced reads and assembled sequences). In that regard, we can point out that current approaches mostly do not support random access, requiring full files to be transmitted, and that current approaches are restricted to either read or sequence compression. Results: We propose AFRESh, an adaptive framework for no-reference compression of genomic data with random access functionality, targeting the effective representation of the raw genomic symbol streams of both reads and assembled sequences. AFRESh makes use of a configurable set of prediction and encoding tools, extended by a Context-Adaptive Binary arithmetic coding scheme (CABAC), to compress raw genetic codes. To the best of our knowledge, our paper is the first to describe an effective implementation CABAC outside of its' original application. By applying CABAC, the compression effectiveness improves by up to 19% for assembled sequences and up to 62% for reads. By applying AFRESh to the genomic symbols of the MPEG genomic compression test set for reads, a compression gain is achieved of up to 51% compared to SCALCE, 42% compared to LFQC and 44% compared to ORCOM. When comparing to generic compression approaches, a compression gain is achieved of up to 41% compared to GNU Gzip and 22% compared to 7-Zip at the Ultra setting. Additionaly, when compressing assembled sequences of the Human Genome, a compression gain is achieved up to 34% compared

关键词： SOFTWARE sequencers DATA compression (Computer science) GENOMICS -- Computer network resources HUMAN genome arithmetic coding

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of grammar-based codes revisited

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2004年第7期50卷 1524-1535页

作者： He, DK Yang, EH Univ Waterloo Dept Elect & Comp Engn Waterloo ON N2L 3G1 Canada

The compression performance of grammar-based codes is revisited from a new perspective. Previously, the compression performance of grammar-based codes was evaluated against that of the best arithmetic coding algorithm with finite contexts. In this correspondence, we first define semifinite-state sources and finite-order semi-Markov sources. Based on the definitions of semifinite-state sources and finite-order semi-Markov sources, and the idea of run-length encoding (RLE), we then extend traditional RLE algorithms to context-based RLE algorithms: RLE algorithms with k contexts and RLE algorithms of order k, where k is a nonnegative integer. For each individual sequence x, let r(sr,k)*(x) and r(sr/k)*(x) be the best compression rate given by RLE algorithms;kith k contexts and by RLE algorithms of order k, respectively. It is proved that for any x, r(sr,k)* is no greater than the best compression rate among all arithmetic coding algorithms with k contexts. Furthermore, it is shown that there exist stationary, ergodic semi-Markov sources for which the best RLE algorithms without any context outperform the best arithmetic coding algorithms with any finite number of contexts. Finally, we show that the worst case redundancies of grammar-based codes against r(sr,k)*(x) and r(sr/k)*(x) among all length-n individual sequences x from a finite alphabet are upper-bounded by d(1) log log n / log n and d(2) log log n / log n, respectively, where d(1) and d(2) are constants. This redundancy result is stronger than all previous corresponding results.

关键词： arithmetic coding entropy grammar-based coding redundancy renewal processes run-length encoding (RLE) semi-Markov processes universal data compression

来源：评论

学校读者我要写书评

暂无评论

Improved ECG compression method using discrete cosine transform

引用

ELECTRONICS LETTERS 2011年第2期47卷 87-+页

作者： Bendifallah, A. Benzid, R. Boulemden, M. Univ Batna Fac Technol Dept Elect Engn Batna 05000 Algeria

An improvement of a discrete cosine transform (DCT)-based method for electrocardiogram (ECG) compression is presented. The appropriate use of a block based DCT associated to a uniform scalar dead zone quantiser and arithmetic coding show very good results, confirming that the proposed strategy exhibits competitive performances compared with the most popular compressors used for ECG compression.

关键词： DCT ECG compression method arithmetic codes arithmetic coding data compression discrete cosine transform discrete cosine transforms electrocardiogram compression electrocardiography medical signal processing scalar dead zone quantiser

来源：评论

学校读者我要写书评

暂无评论

Constant Composition Distribution Matching

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2016年第1期62卷 430-434页

作者： Schulte, Patrick Boecherer, Georg Tech Univ Munich Inst Commun Engn D-80333 Munich Germany

Distribution matching transforms independent and Bernoulli(1/2) distributed input bits into a sequence of output symbols with a desired distribution. Fixed-to-fixed length, invertible, and low complexity encoders and decoders based on constant composition and arithmetic coding are presented. The encoder achieves the maximum rate, namely, the entropy of the desired distribution, asymptotically in the blocklength. Furthermore, the normalized divergence of the encoder output and the desired distribution goes to zero in the blocklength.

关键词： Distribution matching fixed length arithmetic coding asymptotically optimal algorithm

来源：评论

学校读者我要写书评

暂无评论

Signal-dependent wavelet transform and application to lossless image compression

引用

ELECTRONICS LETTERS 2002年第4期38卷 170-172页

作者： Yoo, H Joeng, J Hanyang Univ Dept Elect Commun Engn Seoul 133791 South Korea

A signal-dependent wavelet transform based on the lifting scheme is proposed. The transform can be made reversible (i.e. an integer-to-integer transform). The reversible transform. followed by arithmetic coding, is applied to lossless image compression. Simulation results indicate that the proposed method is superior to the S + P method.

关键词： wavelet transforms arithmetic coding simulation lifting scheme data compression Image and video coding arithmetic codes reversible transform signal-dependent wavelet transform Integral transforms image coding S+P method integer-to-integer transform lossless image compression Computer vision and image processing techniques Image recognition

来源：评论

学校读者我要写书评

暂无评论

CHEATING DETECTION AND CHEATER IDENTIFICATION IN SECRET SHARING SCHEMES

引用

IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES 1995年第5期142卷 367-369页

作者： WU, TC WU, TS Dept. of Ind. Manage. Nat. Taiwan Inst. of Technol. Taipei Taiwan

A threshold scheme for secret sharing can protect a secret with high reliability and flexibility. These advantages can be achieved only when all the participants are honest, i.e. all the participants willing to pool their shadows shall always present the true ones. Cheating detection is an important issue in the secret sharing scheme. However, cheater identification is more effective than cheating detection in realistic applications. If some dishonest participants exist, the other honest participants will obtain a false secret, while the cheaters may individually obtain the true one. The paper presents a method to enforce the security of any threshold scheme with the ability to detect cheating and identify cheaters. By applying a one-way hashing function along with the use of arithmetic coding, the proposed method can be used to deterministically detect cheating and identify the cheaters, no matter how many cheaters are involved in the secret reconstruction.

关键词： arithmetic coding CHEATING INTERPOLATING POLYNOMIAL ONE-WAY HASHING FUNCTION SECRET SHARING

来源：评论

学校读者我要写书评

暂无评论

Families of ternary sequences with aperiodic zero correlation zones for MC-DS-CDMA

引用

ELECTRONICS LETTERS 2002年第25期38卷 1660-1661页

作者： Donelan, H O'Farrell, T Univ Leeds Dept Elect & Elect Engn Inst Entegrated Informat Syst Leeds LS2 9JT W Yorkshire England

A new method for generating ternary spreading sequences with aperiodic zero correlation zones and large family sizes is presented. The sequences are proposed as spreading sequences to provide high capacity and cancel ... 详细信息

关键词： .zones arithmetic coding MC-DS-CDMA family sizes Zero correlation zone ZCZ

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：