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

Dynamic coding of visual information

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY 1997年第3期7卷 489-500页

作者： Reusens, E Ebrahimi, T Kunt, M SWISS FED INST TECHNOL SIGNAL PROC LAB CH-1015 LAUSANNE SWITZERLAND

This paper introduces a novel approach to visual data compression. The approach, named dynamic coding, consists of an effective competition between several representation models used for describing data portions, The image data is represented as the union of several regions each approximated by a representation model locally appropriate, The dynamic coding concept leads to attractive features such as genericness, flexibility, and openness and is therefore particularly suited to a multimedia environment in which many types of applications are involved. Dynamic coding is a general proposal to visual data compression and many variations on the same theme may be designed. They differ by the particular procedure by which the data is segmented into objects and the local representation model selected, As an illustrative example, a video compression scheme based on the principles of dynamic coding is presented, This compression algorithm performs a joint optimization of the segmentation (restricted to a so-called generalized quadtree partition) together with the representation models associated with each data segment. Four representation models are competing namely, fractal, motion compensation, text and graphics, and background modes, Optimality is defined with respect to a rate-distortion tradeoff and the optimization procedure leads to a multicriterion segmentation.

关键词： data compression fractals image representation image segmentation image sequences motion compensation multimedia communication optimisation quadtrees rate distortion theory video coding background modes compression algorithm data segmentation dynamic cod Video coding Rate distortion theory quaternary tree compression algorithms image representation dynamic encoding image sequences Data compression image segmentation Fractals Data partitioning Motion compensation background mode visual information

来源：评论

学校读者我要写书评

暂无评论

Fast Multilevel Computation of Low-Rank Representation of H-Matrix Blocks

引用

IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION 2016年第12期64卷 5326-5334页

作者： Brick, Yaniv Yilmaz, Ali E. Univ Texas Austin Austin TX 78712 USA

A physics-based algorithm for accelerating the computation of method of moments matrix blocks' low-rank approximation is presented. The algorithm relies on efficient sampling of phase-and amplitude-compensated interactions using nonuniform grids. Rank-revealing analysis is applied, in a multilevel fashion, to matrices of reduced column and row dimensions that describe subdomains' interactions with these coarse grids, rather than to the original matrix blocks. As a result, significant savings are achieved, especially for the inherently more compressible dynamic quasi-planar and quasi-static cases. The algorithm's reduced storage and computation time requirements are estimated analytically and verified numerically for representative examples.

关键词： compression algorithm integral equations moment methods

来源：评论

学校读者我要写书评

暂无评论

A technique based on pulse shape comparison for linearizing compressed signals

引用

NUCLEAR INSTRUMENTS & METHODS IN PHYSICS RESEARCH SECTION A-ACCELERATORS SPECTROMETERS DETECTORS AND ASSOCIATED EQUIPMENT 2002年第1-3期481卷 529-537页

作者： Cattaneo, PW Ist Nazl Fis Nucl Sez Pavia I-27100 Pavia Italy Dipartimento Fis Teorica & Nucl I-27100 Pavia Italy

A nuclear electronics system designed to perform high precision energy measurement on a large dynamic range through high speed sampling of the output might be impossible to match to an adequate ADC. A solution consists in compressing the signal before digitization and linearizing it after with a look-up table, encoding the inverse of the compression function. This look-up table can be constructed using test pulses, the smallest of which is in the linear part and the largest spans the whole dynamic range. Reconstructing these pulse shapes and requiring them to be omothetic generates the look-up table providing a minimal distortion in the RMS sense. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： compression algorithm read-out electronics

来源：评论

学校读者我要写书评

暂无评论

Vertical Stacking Statistics of Multi-facies Object-Based Models

引用

MATHEMATICAL GEOSCIENCES 2023年第4期55卷 461-496页

作者： Manzocchi, Tom Walsh, Deirdre A. Univ Coll Dublin UCD Sch Earth Sci iCRAG & Fault Anal Grp Dublin Ireland

Equations describing facies proportions and amalgamation ratios are derived for randomly placed objects belonging to two or three foreground facies embedded in a background facies, as a function of the volume fractions and object thicknesses of independent facies models combined in a stratigraphically meaningful order. The equations are validated using one-dimensional continuum models. Evaluation of the equations reveals a simple relationship between an effective facies proportion and an effective amalgamation ratio, both measured as a function only of the facies in question and the background facies. This relationship provides a firm analytical basis for applying the compression algorithm to multi-facies object-based models. A set of two-dimensional cross-sectional models illustrates the approach, which allows models to be generated with realistic object stacking characteristics defined independently for each facies in a multi-facies object-based model.

关键词： Object-based model Amalgamation ratio Facies proportion compression-based model compression algorithm

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of a selectively compressed memory system

引用

MICROPROCESSORS AND MICROSYSTEMS 2002年第2期26卷 63-76页

作者： Lee, JS Kim, SD Weems, C Yonsei Univ Dept Comp Sci Seodaemoon Ku Seoul 120749 South Korea Univ Massachusetts Dept Comp Sci Amherst MA 01003 USA

On-line data compression is a new alternative technique for improving memory system performance, which can increase both the effective memory space and the bandwidth of memory systems, However, decompression time accompanied by accessing compressed data may offset the benefits of compression. In this paper, a selectively compressed memory system (SCMS) based on a combination of selective compression and hiding of decompression overhead is proposed and analyzed. The architecture of an efficient compressed cache and its management policies are presented, Analytical modeling shows that the performance of SCMS is influenced by the compression efficiency, the percentage of references to the compressed data block, and the percentage of references found in the decompression buffer. The decompression buffer plays the most important role in improving the performance of the SCMS. If the decompression buffer can filter more than 70% of the references to the compressed blocks, the SCMS can significantly improve performance over conventional memory systems. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： on-line data compression compression algorithm compressed memory system cache architecture memory performance analysis

来源：评论

学校读者我要写书评

暂无评论

algorithms for Bayesian network modeling and reliability inference of complex multistate systems: Part I - Independent systems

引用

RELIABILITY ENGINEERING & SYSTEM SAFETY 2020年 202卷 107011-107011页

作者： Zheng, Xiaohu Yao, Wen Xu, Yingchun Chen, Xiaoqian Natl Univ Def Technol Coll Aerosp Sci & Engn 109 Deya Rd Changsha 410073 Hunan Peoples R China Chinese Acad Mil Sci Natl Innovat Inst Def Technol 53 East Main St Beijing 100071 Peoples R China

As the number of complex multistate systems' components increases, one major challenge to analyze the reliabilities of complex multistate systems by Bayesian network (BN) is that the memory storage requirements (MSRs) of conditional probability table (CPT) increase exponentially. When the components reach a certain amount, the MSRs of CPT will exceed the computer's random access memory (RAM). To solve this problem, this two-part paper proposes a novel multistate compression algorithm to compress the CPT so that the MSRs of CPT can be reduced apparently. In this Part I, an independent multistate inference algorithm is proposed to perform the inference of BN based on the compressed CPT for the complex multistate independent systems. Given the evidence of system, the backward inference algorithm is proposed to update the probability distributions of compoents. The above proposed algorithms can be generally applied to any complex multistate independent system without constraints on system structure and state configurations. In addition, the Part II studies the application of compression idea in the complex multistate dependent systems. Finally, two case studies are used to validate the performance of the proposed algorithms.

关键词： Complex multistate independent systems compression algorithm reliability analysis Bayesian network

来源：评论

学校读者我要写书评

暂无评论

A provably secure non-iterative hash function resisting birthday attack

引用

THEORETICAL COMPUTER SCIENCE 2016年 654卷 128-142页

作者： Su, Shenghui Xie, Tao Lu, Shuwang Natl Univ Def Technol Sch Comp Changsha 410073 Hunan Peoples R China Beijing Univ Technol Lab Trusted Comp Beijing 100124 Peoples R China Univ Chinese Acad Sci Sch Comp Beijing 100039 Peoples R China BFID Corp Lab Computat Complex Beijing 100098 Peoples R China

To examine the integrity and authenticity of an IP address efficiently and economically, this paper proposes a new non -iterative hash function called JUNA that is based on a multivariate permutation problem and an anomalous subset product problem to which no subexponential time solutions are found so far. JUNA includes an initialization algorithm and a compression algorithm, and converts a short message of n bits which is regarded as only one block into a digest of m bits, where 80 <= m <= 232 and 80 <= m <= n <= 4096. The analysis and proof show that the new hash is one-way, weakly collision -free, and strongly collision-free, and its security against existent attacks such as birthday attack and meet in -the -middle attack is to 0(2(m)). Moreover, a detailed proof that the new hash function is resistant to the birthday attack is given. Compared with the Chaum-Heijst-Pfitzmann hash based on a discrete logarithm problem, the new hash is lightweight, and thus it opens a door to convenience for utilization of lightweight digital signing schemes. (C) 2016 Elsevier B.V. All rights reserved.

关键词： Hash function compression algorithm Non-iterative structure Provable security Birthday attack Meet-in-the-middle attack

来源：评论

学校读者我要写书评

暂无评论

Compress Blocks or Not: Tradeoffs for Energy Consumption of a Big Data Processing System

IEEE TRANSACTIONS ON SUSTAINABLE COMPUTING

引用

IEEE TRANSACTIONS ON SUSTAINABLE COMPUTING 2022年第1期7卷 112-124页

作者： Song, Jie Hu, Shengqiang Bao, Yubin Yu, Ge Northeastern Univ Software Coll Shenyang 110819 Liaoning Peoples R China Northeastern Univ Sch Comp Sci & Engn Shenyang 110819 Liaoning Peoples R China

Currently, in addition to the performance, the energy consumption (hereinafter EC) of jobs running in a big data processing systemis also of interest to academia and industry because it grows rapidly as an increasing amount of data is processed. Many studies focus on the EC optimization of jobs from the perspective of computation, which is specific to the algorithms in each job. However, the part of EC involved in I/O operations, which is general and universal, is mostly ignored in optimization. In this paper, we concentrate on the EC optimization of jobs from the perspective of I/O operations. To save energy, we argue that data compression could be exploited. On one hand, energy is saved by processing compressed data with less I/O cost. On the other hand, extra EC is incurred from the necessary data compression/decompression process, which may offset the saved energy. Therefore, there are tradeoffs to consider when determining whether to compress data for these jobs. In this paper, such tradeoffs and boundary conditions are studied. We first abstract a paradigm for the runtime environment of big data processing jobs. Then, we establish the power, jobs, compression, and I/O models in detail. Based on these models, we discuss the compression tradeoffs and derive the boundary conditions for EC optimization. Finally, we design and conduct experiments to validate our proposition. The experimental results confirm that the tradeoffs and boundary conditions exist for typical jobs in MapReduce and Spark. As explained, first, the EC of a job is reduced using data compression. Second, whether or not such optimization occurs is related to the specification of both the compression algorithm and the job and is determined by corresponding boundary conditions. Third, for a compression algorithm, the larger its compression/decompression speed and the better its compression ratio, the more likely it is to achieve EC optimization.

关键词： Big data processing system compression algorithm energy consumption optimization

来源：评论

学校读者我要写书评

暂无评论

MECOM: Live migration of virtual machines by adaptively compressing memory pages

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2014年 38卷 23-35页

作者： Jin, Hai Deng, Li Wu, Song Shi, Xuanhua Chen, Hanhua Pan, Xiaodong Huazhong Univ Sci & Technol Sch Comp Sci & Technol Serv Comp Technol & Syst Lab Cluster & Grid Comp Lab Wuhan 430074 Peoples R China Wuhan Univ Sci & Technol Sch Comp Sci & Technol Wuhan 430065 Peoples R China Baofeng Network Technol Co Ltd Beijing 100191 Peoples R China

Live migration of virtual machines has been a powerful tool to facilitate system maintenance, load balancing, fault tolerance, and power-saving, especially in clusters or data centers. Although pre-copy is extensively used to migrate memory data of virtual machines, it cannot provide quick migration with low network overhead but leads to large performance degradation of virtual machine services due to the great amount of transferred data during migration. To solve the problem, this paper presents the design and implementation of a novel memory-compression-based VM migration approach (MECOM for short) that uses memory compression to provide fast, stable virtual machine migration, while guaranteeing the virtual machine services to be slightly affected. Based on memory page characteristics, we design an adaptive zero-aware compression algorithm for balancing the performance and the cost of virtual machine migration. Using the proposed scheme pages are rapidly compressed in batches on the source and exactly recovered on the target. Experimental results demonstrate that compared with Xen, our system can significantly reduce downtime, total migration time, and total transferred data by 27.1%, 32%, and 68.8% respectively. (C) 2013 Elsevier B.V. All rights reserved.

关键词： Virtual machine Live migration compression algorithm Pre-copy

来源：评论

学校读者我要写书评

暂无评论

A Comprehensive Data Reduction algorithm for Automotive Multiplexing

引用

SAE INTERNATIONAL JOURNAL OF PASSENGER CARS-ELECTRONIC AND ELECTRICAL SYSTEMS 2019年第1期12卷 13-21页

作者： Baldiwala, Aliakbar A. Necsulescu, Dan Univ Ottawa Ottawa ON Canada

Present-day vehicles come with a variety of new features like the pre-crash warning, the vehicle-to-vehicle communication, semi-autonomous driving systems, telematics, drive by wire. They demand very high bandwidth from in-vehicle networks. Various ECUs present inside the automotive transmits useful information via automotive multiplexing. Transmission of data in real-time achieves optimum functionality. The high bandwidth and high-speed requirement can be achieved either by using multiple buses or by implementing higher bandwidth. But, by doing so, the cost of the network as well as the complexity of the wiring increases. Another option is to implement higher layer protocol which can reduce the amount of data transferred by using data reduction (DR) techniques, thus reducing the bandwidth usage. The implementation cost is minimal as the changes are required in the software only and not in hardware. This article presents a new data reduction algorithm termed as "Comprehensive Data Reduction (CDR)" algorithm. The article also demonstrates a comparison of the proposed algorithm with the boundary of fifteen compression algorithms and compression area selection algorithms. The results show that the proposed CDR algorithm provides better data reduction compared to the earlier proposed algorithms. The proposed algorithm has been developed for automotive environment, but it can also be utilized in any applications where extensive information transmission among various control units is carried out via a multiplexing bus.

关键词： Automotive networks Data reduction (DR) Data compression compression algorithm Controller area network (CAN) protocol Automotive multiplexing Onboard diagnostics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：