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

ELECTRONICS LETTERS 2000年第3期36卷 208-210页

作者： Yang, SH Cheng, TC Natl Taipei Unniv Technol Inst Comp Commun & Control Taipei Taiwan

The authors develop an efficient error-resilient scheme for the set partitioning in hierarchical trees (SPIHT) technique, one of the most successful image compression algorithms. By partitioning the coded data sequence and adding appropriate side information, the proposed algorithm provides significantly better PSNR performance over noisy channels with a minimal increase in the coding complexity.

关键词： set partitioning in hierarchical trees Image and video coding data compression coding complexity image coding error-resilient SPIHT image coding Codes appropriate side information Physics and chemistry computing physics computing error-resilient scheme coded data sequence partitioning noisy channels PSNR performance optical noise Computer vision and image processing techniques Image processing and restoration Image recognition

来源：评论

学校读者我要写书评

暂无评论

引用

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

来源：评论

学校读者我要写书评

暂无评论

Approaching Blokh-Zyablov Error Exponent with Linear-Time Encodable/Decodable Codes

引用

IEEE COMMUNICATIONS LETTERS 2009年第6期13卷 438-440页

作者： Wang, Zheng Luo, Jie Colorado State Univ Dept Elect & Comp Engn Ft Collins CO 80523 USA

Guruswami and Indyk showed in [1] that Forney's error exponent can be achieved with linear coding complexity over binary symmetric channels. This paper extends this conclusion to general discrete-time memoryless channels and shows that Forney's and Blokh-Zyablov error exponents can be arbitrarily approached by one-level and multi-level concatenated codes with linear encoding/decoding complexity. The key result is a revision to Forney's general minimum distance decoding algorithm, which enables a low complexity integration of Guruswami-Indyk's outer codes into the concatenated coding schemes.

关键词： coding complexity concatenated code error exponent

来源：评论

学校读者我要写书评

暂无评论

Information theoretic considerations for coded modulation over fading channels

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2000年第12期48卷 1970-1974页

作者： Ahmed, WKM McLane, PJ Queens Univ Dept Elect & Comp Engn Kingston ON K7L 3N6 Canada

In this correspondence, we compute the random coding error exponent for coded modulation transmitted over a flat, memoryless, Rayleigh fading channel. In addition, estimates of code lengths required to achieve a certain error probability are determined and compared to those required for the additive white Gaussian noise channel. Finally, the effect of receiver antenna diversity is also considered as a method to compensate for fading and is shown to have a significant, positive impact on the error exponent. The results we obtain represent an information theoretic view that complements the existing literature on performance of coded modulation over fading channels with receiver diversity.

关键词： average-power constraints channel capacity coded modulation coding complexity cut-off rate fading channels random coding exponent reliability function space diversity

来源：评论

学校读者我要写书评

暂无评论

Classified vector quantisation using principal components

引用

ELECTRONICS LETTERS 1998年第6期34卷 538-540页

作者： Quweider, MK Farison, JB Univ Toledo Dept Bioengn Toledo OH 43606 USA

The authors describe a novel classified vector quantisation technique that uses a principal component-based classifier. Each non-shade class is associated with a vector representing the largest principal component of the training vectors for that class. The technique works directly in the spatial domain without any preprocessing and achieves good perceptual quality and edge integrity at bit rates well below 1 bit/pixel with reduced coding complexity.

关键词： perceptual quality training vector coding complexity vector quantisation image coding classified vector quantisation Codes Optical information, image and video signal processing bit rate image classification spatial domain nonshade class edge integrity principal components

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

On Low-complexity Maximum-Likelihood Decoding of Convolutional Codes

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2008年第12期54卷 5756-5765页

作者： Luo, Jie Colorado State Univ Dept Elect & Comp Engn Ft Collins CO 80523 USA

This letter considers the average complexity of maximum-likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path taken through a Markov graph. Integrated with the Viterbi algorithm (VA), complexity reduction methods often use the sum log likelihood (SLL) of a Markov path as a bound to disprove the optimality of other Markov path sets and to consequently avoid exhaustive path search. In this letter, it is shown that SLL-based optimality tests are inefficient if one fixes the coding memory and takes the codeword length to infinity. Alternatively, optimality of a source symbol at a given time index can be testified using bounds derived from log likelihoods of the neighboring symbols. It is demonstrated that such neighboring log likelihood (NLL)-based optimality tests, whose efficiency does not depend on the codeword length, can bring significant complexity reduction. The results are generalized to NIL sequence detection in a class of discrete-time hidden Markov systems.

关键词： coding complexity convolutional code hidden Markov model maximum-likelihood (ML) decoding Viterbi algorithm (VA)

来源：评论

学校读者我要写书评

暂无评论

A Novel Subgridding Technique for Unconditionally Stable Time Domain Method

A Novel Subgridding Technique for Unconditionally Stable Tim...

引用

2010 IEEE International Symposium Antennas and Propagation/CNC-USNC/URSI Radio Science Meeting

作者： Huang, Zhenyu Pan, G. Arizona State Univ Tempe AZ 85287 USA

ISBN: (纸本)9781424449682

In this paper, a new subgridding technique based upon HSG and USTD is developed. Due to the unconditional stability of USTD, the synchrousness of the field update in coarse and fine grid regions are realized, which reduces the coding complexity and suppressed the late time instability. Comparing to the method in [J.P. Berenger, 2006], our method not only has the merits of arbitrarily large spatial ratio and negligible numerical reflection, but also eliminates the drawback of late time instability.

关键词： Huygens subgridding antenna theory coarse grid region coding complexity fine grid region late time instability numerical reflection subgridding technique unconditional stability unconditionally stable time domain method

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：