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

Objective and subjective evaluation of High Dynamic Range video compression

SIGNAL PROCESSING-IMAGE COMMUNICATION 2016年 47卷 426-437页

作者： Mukherjee, R. Debattista, K. Bashford-Rogers, T. Vangorp, P. Mantiuk, R. Bessa, M. Waterfield, B. Chalmers, A. Univ Warwick WMG Coventry CV4 7AL W Midlands England Bangor Univ Bangor Gwynedd Wales Univ Cambridge Cambridge CB2 1TN England UTAD Vila Real Portugal Jaguar Land Rover Automot PLC Coventry W Midlands England

A number of High Dynamic Range (HDR) video compression algorithms proposed to date have either been developed in isolation or only-partially compared with each other. Previous evaluations were conducted using quality assessment error metrics, which for the most part were developed for qualitative assessment of Low Dynamic Range (LDR) videos. This paper presents a comprehensive objective and subjective evaluation conducted with six published HDR video compression algorithms. The objective evaluation was undertaken on a large set of 39 HDR video sequences using seven numerical error metrics namely: PSNR, logPSNR, puPSNR, puSSIM, Weber MSE, HDR-VDP and HDR-VQM. The subjective evaluation involved six short-listed sequences and two ranking-based subjective experiments with hidden reference at two different output bitrates with 32 participants each, who were tasked to rank distorted HDR video footage compared to an uncompressed version of the same footage. Results suggest a strong correlation between the objective and subjective evaluation. Also, non-backward compatible compression algorithms appear to perform better at lower output bit rates than backward compatible algorithms across the settings used in this evaluation. (C) 2016 Elsevier B.V. All rights reserved.

关键词： HDR video compression algorithm Quality assessment Ranking Rate-distortion

来源：评论

学校读者我要写书评

暂无评论

Murmur-adaptive compression technique for phonocardiogram signals

引用

ELECTRONICS LETTERS 2016年第3期52卷 183-184页

作者： Kim, Sunjung Hwang, Dosik Yonsei Univ Sch Elect & Elect Engn Seoul 120749 South Korea

As mobile and wearable health technologies have evolved, constant monitoring of bio-signals from patients has become important for accurate diagnosis using mobile and remote health services. As the need for constant monitoring of bio-signals increases, the amount of bio-signal data also increases, therefore an efficient compression method for specific bio-signals should be developed. In contrast to other types of signals, bio-signals contain important diagnostic information that should not be removed during compression. An effective compression algorithm for phonocardiogram (PCG) signals that contain important diagnostic information (murmur) is proposed. In this algorithm, the murmur is first estimated, then an adaptive thresholding scheme is applied in the wavelet domain to the normal portions and the murmur portions of PCGs depending on the murmur estimates during compression. Although other conventional compression methods result in substantial loss of murmur information, the proposed method is able to keep most of the murmur information in compressed PCGs.

关键词： compression algorithm Data handling techniques data compression wavelet domain Sonic and ultrasonic radiation (biomedical imaging/measurement) murmur-adaptive compression technique adaptive thresholding scheme Patient diagnostic methods and instrumentation Biology and medical computing Digital signal processing phonocardiogram signals Sonic and ultrasonic radiation (medical uses) Signal processing and detection medical signal processing phonocardiography

来源：评论

学校读者我要写书评

暂无评论

A Comparison of Road-Network-Constrained Trajectory compression Methods 22

A Comparison of Road-Network-Constrained Trajectory Compress...

引用

22nd IEEE International Conference on Parallel and Distributed Systems (ICPADS)

作者： Ji, Yudian Liu, Hao Liu, Xiaoying Ding, Ye Luo, Wuman Hong Kong Univ Sci & Technol Hong Kong Hong Kong Peoples R China Univ Macau Zhuhai Peoples R China

ISBN: (纸本)9781509044573

The popularity of location-acquisition devices has led to a rapid increase in the amount of trajectory data collected. The large volume of trajectory data causes the difficulties of storing and processing the data. Various trajectory compression methods are therefore proposed to deal with these problems. In this paper, we overview the existing road-network-constrained trajectory compression methods and propose a novel classification based on the features leveraged by them. We also propose new methods that fill in the research blanks indicated by the classification. We conduct a thorough comparison among the existing and new road-network-constrained trajectory compression methods. The performances of the methods are studied via various metrics on real-world dataset. We make new discoveries regarding the performances and the scalability of existing methods, and provide guidelines of road-network-constrained trajectory compression for various scenarios.

关键词： Trajectory compression road network compression algorithm moving object database spatio-temporal data

来源：评论

学校读者我要写书评

暂无评论

Comparison of compression algorithms on Vehicle Communications System

Comparison of Compression Algorithms on Vehicle Communicatio...

引用

IEEE Advanced Information Technology, Electronic and Automation Control Conference (IAEAC)

作者： Shuai, Chunyan Li, Siqi Liu, Hongrui Kunming Univ Sci & Technol Fac Elect Power Engn Kunming Peoples R China

ISBN: (纸本)9781479919802

in order to improve the compression ratio, most of improved compression methods require more memory and CPU time. But these improvements are not suitable for embedded system with limited-resource, especially for vehicle communications system. In order to communicate realtimely by lower costs, the huge and short data are compressed before transmitting. This paper discusses several original lossless compression methods including their principles, features, advantages and disadvantages respectively. Experiments on the front vehicle system show that the L777, PPM and BWT are more suitable for the automobile communication data, and they have better compression ratios, simpler coding, lower CPU and memory costs.

关键词： lossless data compression compression algorithm vehicle communication encode decode

来源：评论

学校读者我要写书评

暂无评论

Recording and replaying of battle simulation situation data based on serialization and compression algorithm

Recording and replaying of battle simulation situation data ...

引用

2011 International Conference on System Science, Engineering Design and Manufacturing Informatization, ICSEM 2011

作者： Liu, Shuo Li, Zenghua Yang, Xuehui Battle Simulation Center Academy of Armored Forces Engineering 21st Mail Box Dujiakan Beijing 100072 China Department of Equipment Command and Administration Academy of Armored Forces Engineering 21st Mail Box Dujiakan Beijing 100072 China

ISBN: (纸本)9781457702471

Recording and replaying of situation data is critical in the battle simulation system, which is the foundation of the subsequent analysis and evaluation. First of all, the demand for recording and replaying of situation data in the simulation system was expatiated, and then the realizing methods, that is, integrated federation member and embedded programs were analyzed. The situation data object was defined according to the requirements of serialization, and the process of data recording and replaying was analyzed in detail. Moreover, the Zlib function library which supports memory compression and uncompression was referred to specifically. © 2011 IEEE.

关键词： Zlib function library battle simulation situation data compression compression algorithm data compression data recording data replay memory compression memory uncompression military computing recording replaying serialization serialization algorithm seria

来源：评论

学校读者我要写书评

暂无评论

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 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

来源：评论

学校读者我要写书评

暂无评论

7.1:Invited Paper:How to Quantify Vision-for-Recognition and Vision-for-Action for Distinct Display Form Factors

引用

SID Symposium Digest of Technical Papers 2018年第S1期49卷

作者： Shun-nan Yang Vision Performance Institute Pacific University College of Optometry Forest Grove OR

Human vision is roughly composed of two distinct but integrated functional pathways: vision-for-recognition and vision-for-action. Likewise, display form factors can be categorized as passive viewing (e.g., office work on a computer or movie viewing on a TV) and active interaction (e.g., VR and AR in gaming). Theoretical and empirical findings suggest the encoding of visual inputs can affect by task demands. Here we evaluated two corresponding methods of measuring image quality for visual consumption. The method of measuring vision-for-recognition involves direct visual comparison to discern any degraded visual quality. Visual attention is critical in such paradigm. Conversely, a novel method of assessing visual quality for vision-for-action is to assess how visuomotor responses are facilitated or altered independent of conscious detection. We reported empirical data obtained with a gaze-contingent flicker paradigm to measure the rate of detecting visual degradation and altered eye movements. These findings show that consciously invisible changes in visual image can alter viewing eye movements and conscious decision; conversely, the possibility of detecting visual degradation can be overestimated because of artificially manipulated attention. These findings call for a new approach to measure visual quality for different form factors and task requirements.

关键词： visual functions lossless image compression algorithm gaze-contingent image change eye tracking visual detection

来源：评论

学校读者我要写书评

暂无评论

A Secure Virtual Machine Migration Using Memory Space Prediction for Cloud Computing

A Secure Virtual Machine Migration Using Memory Space Predic...

引用

IEEE International Conference on Circuit, Power and Computing Technologies (ICCPCT)

作者： Jeincy, G. Jarlin Shaji, R. S. Jayan, J. P. Noorul Islam Univ Comp Sci Kumaracoil Tamil Nadu India Noorul Islam Univ Kumaracoil Tamil Nadu India

ISBN: (纸本)9781509012770

A cost effective, easy to manage, elastic and powerful resources over the internet is provided to the users by cloud environment. The resource pooling allows the use of same pool by multiple users through multi tenancy and virtualization technology. The VM Migration is the process of relocating a VM to another physical machine without shutting down the VM. The Virtual Migration is carried out for the number of reasons such as load balancing, fault tolerance and maintenance with respect to pooling and memory space management. Memory space prediction method used to predict the free memory space and allocate the memory to the new processes or the requested user. Memory allocation then becomes a selection function of selecting appropriate memory space according to the user needs a capacity. The free memory spaces are listed in the free list. It's helpful for easy allocation. During the migration phase, the contents of the VM are exposed to the network that might lead to data privacy and integrity concerns. Besides data, the space used by VM for storage and communication is also vulnerable to attackers during migration. To reduce the data loss due to attack on memory space to increase the confidentiality of the data which is migrated, here it is designed and implemented a new scheme for Virtual Machine Migration using Memory Space Prediction with compression method for storage using a cryptic methodology. The prediction based compression algorithm used to transfer data in compressed manner, it also decreases the migration time and down time and the hash algorithm used to increases the data confidentiality and security.

关键词： Virtual machine Live migration Memory prediction compression algorithm pre-copy Authentication

来源：评论

学校读者我要写书评

暂无评论

Dec :: Tech Reports :: Src-Tn-2000-005

引用

2016年

Dec :: Tech Reports :: Src-Tn-2000-005 by published by

关键词： algorithm characters compression compression algorithm consecutive context ratushnyak reports src-tn-2000-005 string strings transformation transformed

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：