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

Conference on Visual Communications and Image Processing 2004

作者： Aaron, A Rane, S Setton, E Girod, B Stanford Univ Informat Syst Lab Dept Elect Engn Stanford CA 94305 USA

ISBN: (纸本)0819452114

In current interframe video compression systems, the encoder performs predictive coding to exploit the similarities of successive frames. The Wyner-Ziv Theorem on source coding with side information available only at the decoder suggests that an asymmetric video codec, where individual frames are encoded separately, but decoded conditionally (given temporally adjacent frames) could achieve similar efficiency. We propose a transform-domain Wyner-Ziv coding scheme for motion video that uses intraframe encoding, but interframe decoding. In this system. the transform coefficients of a Wyner-Ziv frame are encoded independently using a scalar quantizer and turbo coder. The decoder uses previously reconstructed frames to generate side information to conditionally decode the Wvner-Ziv frames. Simulation results show significant gains above DCT-based intraframe coding and improvements over the pixel-domain Wyner-Ziv video coder.

关键词： Wyner-Ziv coding distributed source coding video compression transform coding low-complexity encoders Slepian-Wolf turbo codes

来源：评论

学校读者我要写书评

暂无评论

MODIFIED DEcoding METRIC OF distributed ARITHMETIC coding

MODIFIED DECODING METRIC OF DISTRIBUTED ARITHMETIC CODING

引用

IEEE International Conference on Image Processing (ICIP)

作者： Yang, Yanchao Qi, Mingwei Zhou, Junwei Cheng, Lee-Ming Wuhan Univ Technol Sch Comp Sci & Technol Wuhan Peoples R China City Univ Hong Kong Dept Elect Engn Hong Kong Peoples R China

ISBN: (数字)9781728163956

ISBN: (纸本)9781728163956

As an alternative implementation of Slepian-Wolf coding, distributed arithmetic coding is very competitive in short and medium block lengths. The existing distributed arithmetic coding decoder uses the maximum a posteriori metric and the M-algorithm to select the decoding sequence by considering the prior information. Since the prior probability distribution has been explored by the encoding process via the model stage and retained in the codeword, we propose a modified decoding metric ignoring the prior information. The reliability of the decoding paths is only determined by the correlation between the side information and the input source. Simulation results show that the modified metric can significantly reduce the decoding error.

关键词： Slepian-Wolf coding distributed arithmetic coding arithmetic coding distributed source coding

来源：评论

学校读者我要写书评

暂无评论

Images as graphical password: verification and analysis using non-regular low-density parity check coding

引用

International Journal of Information Technology (Singapore) 2020年 1-41页

作者： Singh, Uday Pratap Chouhan, Siddharth Singh Jain, Sanjeev School of Mathematics Shri Mata Vaishno Devi University Katra 182320 India School of Computer Science and Engineering Shri Mata Vaishno Devi University Katra 182320 India Department of Computer Science and Engineering Indian Institute of Information Technology Design and Management Jabalpur 482005 India

The use of mobile computing devices like laptops, smartphones, tablets, etc. ease user access to work or connect remotely for performing a number of operations. Also, with the advent of these new technologies and devices, one of the major concerns emerges in the form of security for one’s personal data or information. Passwords are very critical to human safety as he or she could be a victim of unauthorized access, data misuse or even they may face some legal trouble because of unconventional activities. Robust passwords are recommended in this act to avoid various outbreaks. But, these passwords are not easy to remember in most of the cases. Therefore, an effort has been made in this paper to present a new graphical password-based method that verifies a user’s authenticity by using images as a password. In this regard, a two-way password verification system is adopted using non-regular low-density parity-check codes and an encryption methodology. The performance of the proposed work was evaluated for three different cases i.e. (a) To validate image for about thirteen of modifications (b) To validate image for different format conversion, and (c) Similarity measures for different face images taken from labeled faces in the wild (LFW) database. Results validated the performance of the proposed method when compared with other state-of-the-art approaches. © 2020, Bharati Vidyapeeth's Institute of Computer Applications and Management.

关键词： distributed source coding Error correction and detection Low-density parity-check codes Password authentication Tamper/forgery detection

来源：评论

学校读者我要写书评

暂无评论

distributed COMPRESSION OF ZEROTREES OF WAVELET COEFFICIENTS

DISTRIBUTED COMPRESSION OF ZEROTREES OF WAVELET COEFFICIENTS

引用

18th IEEE International Conference on Image Processing (ICIP)

作者： Wang, Yige Rane, Shantanu Boufounos, Petros Vetro, Anthony Mitsubishi Elect Res Labs Cambridge MA 02139 USA

ISBN: (纸本)9781457713033

A distributed coding algorithm is presented for compression of wavelet-transformed data. Data structures based on zerotrees are exploited for efficient compression of the significance map of wavelet coefficients. The coefficients are scanned in two stages, with a significance pass and refinement pass, similar to the SPIHT algorithm. The bits resulting from these passes are Slepian-Wolf coded using an LDPC syndrome code selected from a bank of available codes. A key realization is that, for each bitplane of the wavelet coefficients, the significance pass of the source data can be synchronized with that of the side information. This allows distributed compression of the significance pass. This is substantially different from previous mixed approaches in which the refinement pass was Slepian-Wolf coded, but the significance pass was coded independently. Rate-distortion results are presented for images from the ALOS AVNIR-2 multispectral dataset and compared against those obtained with SPIHT and JPEG2000.

关键词： distributed source coding Wavelets LDPC codes Zerotrees

来源：评论

学校读者我要写书评

暂无评论

CORRELATION NOISE CLASSIFICATION BASED ON MATCHING SUCCESS FOR TRANSFORM DOMAIN WYNER-ZIV VIDEO coding

CORRELATION NOISE CLASSIFICATION BASED ON MATCHING SUCCESS F...

引用

IEEE International Conference on Acoustics, Speech and Signal Processing

作者： Esmaili, Ghazaleh R. Cosman, Pamela C. Univ Calif San Diego Dept Elect & Comp Engn La Jolla CA 92093 USA

ISBN: (纸本)9781424423538

distributed source coding strongly depends on the knowledge of statistical dependency between source and side information. In transform domain Wyner-Ziv video coding (TDWZ) this statistical dependency (also known as correlation noise) has been usually modeled by a unique Laplacian distribution for each frequency band. In this paper, we propose a method to define different classes of correlation noise for each frequency band based on the accuracy of the side information. With this approach the correlation between source and side information is estimated separately for each frequency band of each class. Therefore, the decoder can discriminate blocks in order to estimate the correlation noise of their frequency bands. Simulation results show that applying the proposed method improves rate-distortion performance.

关键词： Wyner-Ziv coding distributed source coding Correlation noise

来源：评论

学校读者我要写书评

暂无评论

Easier Encoding-Decoding distributed Arithmetic coding for Slepian-Woff coding

Easier Encoding-Decoding Distributed Arithmetic Coding for S...

引用

2nd International Conference on Multimedia and Signal Processing (CMSP 2012)

作者： Pang, Yuye Shanghai Univ Elect Power Sch Comp & Informat Engn Shanghai 200090 Peoples R China

ISBN: (纸本)9783642352850

distributed Arithmetic coding (DAC) is an effective implementation of Slepian-Wolf problem. In this paper, the coding theory of DAC is introduced including two implements for asymmetric Slepian-Wolf problem, distributed Overlap Arithmetic coding (DOAC) and distributed Quasi-Arithmetic coding (DQAC). Both of the implementation schemes are analyzed. The advantages and disadvantages of them are compared and discussed. Then an improved scheme with easier encoding and decoding is proposed. Simulation results show that the proposed scheme is better than DOAC and DQAC.

关键词： distributed Arithmetic coding distributed source coding arithmetic coding

来源：评论

学校读者我要写书评

暂无评论

distributed Compression of Correlated sources using Systematic Polar Codes 9

Distributed Compression of Correlated Sources using Systemat...

引用

9th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)

作者： Yaacoub, Charles Sarkis, Malak Holy Spirit Univ Kaslik USEK Fac Engn Dept Telecommun POB 446 Jounieh Lebanon

ISBN: (纸本)9781509034017

Since their invention in 2009, Polar Codes have emerged as new near-capacity channel codes with a great potential of replacing turbo codes and low density parity check codes in a wide range of applications. This paper investigates the use of systematic polar codes in a distributed source coding application. A system model is proposed for the compression of distributed sources with side information at the decoder, along with a theoretical approach for estimating the ideal compression ratio. The system performance is assessed in terms of compression efficiency and bit error rate, for different code parameters and source correlation levels. Simulation results show the efficiency of systematic polar codes in distributed source coding, which makes them suitable for practical distributed compression applications such as wireless sensor networks and distributed video coding. Furthermore, despite the fact that error correction performance of polar codes improves with larger blocks, results show that for a compression rate below 0.4 (i.e. compression stronger than 2.5:1), better error rates can be achieved with smaller blocks.

关键词： channel coding compression distributed source coding entropy systematic polar codes

来源：评论

学校读者我要写书评

暂无评论

An Information Theoretic Perspective Over an Extremal Entropy Inequality

An Information Theoretic Perspective Over an Extremal Entrop...

引用

IEEE International Symposium on Information Theory

作者： Park, Sangwoo Serpedin, Erchin Qaraqe, Khalid Texas A&M Univ Dept Elect & Comp Engn College Stn TX 77843 USA

ISBN: (纸本)9781467325790

This paper focuses on developing an alternative proof for an extremal entropy inequality, originally presented in [1]. The proposed alternative proof is simply based on the classical entropy power inequality and the data processing inequality. Compared with the proofs in [1], the proposed alternative proof is simpler, more direct, and information theoretic, and presents the advantage of providing the structure of the optimal solution covariance matrix. Also, the proposed proof might also be used as a novel method to address applications such as calculation of the vector Gaussian broadcast channel capacity, establishing a lower bound for the achievable rate of distributed source coding with a single quadratic distortion constraint, and the secrecy capacity of the Gaussian wire-tap channel.

关键词： inequalities extremum values distributed source coding entropy data processing inequality

来源：评论

学校读者我要写书评

暂无评论

An Optimal Quantizer for distributed Souce coding

An Optimal Quantizer for Distributed Souce Coding

引用

2nd International Conference on Instrumentation and Measurement, Computer, Communication and Control (IMCCC)

作者： Hao Runfang Cheng Yongqiang Taiyuan Univ Technol Coll Informat Engn Taiyuan Peoples R China

ISBN: (纸本)9780769549354

We present a extended algorithm to design an optimal scalar quantizer for distributed source coding in order to achieve a coding rate close to joint conditional entropy of the quantized frames given the side information. A simple model is considered in this paper. A tabu search method was combined with the Lloyd algorithm to select initial quantizers, which aims at minimizing the Lagrangian cost function and avoiding many poor local optima. Experimental results show the proposed method can improve rate-distortion performance for Gaussian scalar asymmetric case.

关键词： wireless sensor network distributed source coding quantizer

来源：评论

学校读者我要写书评

暂无评论

MAXIMIZING THE LIFETIME OF CLUSTERS WITH SLEPIAN-WOLF coding

MAXIMIZING THE LIFETIME OF CLUSTERS WITH SLEPIAN-WOLF CODING

引用

2010 IEEE International Conference on Acoustics, Speech, and Signal Processing

作者： Wang, Tianqi Heinzelman, Wendi Seyedi, Alireza Vosoughi, Azadeh Univ Rochester Dept Elect & Comp Engn Rochester NY 14627 USA

ISBN: (纸本)9781424442966

In this paper, we propose an iteration-free algorithm to find the optimal configuration, including transmit power and source coding rates, to maximize the lifetime of a cluster utilizing Slepian-Wolf source coding of data sent to a fusion center. Exact closed form solutions are derived when the fusion center is not energy constrained. When the fusion center is energy constrained, a near optimum solution is provided. Numerical results demonstrating the performance of the proposed algorithms are also provided.

关键词： distributed source coding Wireless sensor networks Energy efficiency Lifetime

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：