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

20th European Signal Processing Conference (EUSIPCO)

作者： Ramalho, Mauricio Singh, Sanchit Correia, Paulo Lobato Soares, Luis Ducla Inst Telecomunicacoes P-1049001 Lisbon Portugal Inst Super Tecn P-1049001 Lisbon Portugal Inst Univ Lisboa ISCTE IUL P-1049001 Lisbon Portugal

ISBN: (纸本)9781467310680

distributed source coding (DSC) applications range from sensor networks to video coding. In this paper, DSC principles are integrated in a biometric system to provide secure template storage. The proposed biometric recognition system uses the palmprint as a biometric trait together with a state-of-the-art feature extraction technique that produces binary templates. The hand images are captured in an unconstrained way, i.e., the user can place his hand freely within the camera's field of view and the background is not required to be constant. The proposed system was tested in indoor environments and promising recognition accuracy results were achieved, when performing identification on a small database, acquired using the proposed system.

关键词： distributed source coding secure biometrics LDPC unconstrained palmprint palmprint recognition

来源：评论

学校读者我要写书评

暂无评论

distributed source coding for Mobile ECG Signal Monitoring

Distributed Source Coding for Mobile ECG Signal Monitoring

引用

12th International Conference on ITS Telecommunications (ITST)

作者： Wu, Hung-Tsai Tsai, Wei-Ying Chang, Wen-Whei Natl Chiao Tung Univ Inst Commun Engn Hsinchu Taiwan

ISBN: (纸本)9781467330701;9781467348171

This paper describes the design and implementation of an ECG signal monitoring system that is compatible with existing mobile telecommunications networks. First, a two-dimensional ECG signal compression scheme is presented using the distributed source coding (DSC). Also proposed is a modified BCJR algorithm which further enhances the DSC decoding by exploiting the symbol-level a priori information. Finally, we implement a novel integrated system comprising a mobile telephone, with sensors for patient monitoring, and a remote receiver linked by cellular networks. The system, when fully developed, will become powerful aids to monitoring a patient for mobile telemedicine and for emergency situations.

关键词： Mobile Telephone ECG Compression distributed source coding

来源：评论

学校读者我要写书评

暂无评论

Image Authentication Using distributed source coding

引用

IEEE TRANSACTIONS ON IMAGE PROCESSING 2012年第1期21卷 273-283页

作者： Lin, Yao-Chung Varodayan, David Girod, Bernd Stanford Univ Dept Elect Engn Stanford CA 94305 USA Hewlett Packard Labs Palo Alto CA 94304 USA

We present a novel approach using distributed source coding for image authentication. The key idea is to provide a Slepian-Wolf encoded quantized image projection as authentication data. This version can be correctly decoded with the help of an authentic image as side information. distributed source coding provides the desired robustness against legitimate variations while detecting illegitimate modification. The decoder incorporating expectation maximization algorithms can authenticate images which have undergone contrast, brightness, and affine warping adjustments. Our authentication system also offers tampering localization by using the sum-product algorithm.

关键词： distributed source coding EM algorithm image authentication sum-product algorithm

来源：评论

学校读者我要写书评

暂无评论

The Achievable Rate-Distortion Region for distributed source coding with One Distortion Criterion and Correlated Messages

引用

IEICE TRANSACTIONS ON COMMUNICATIONS 2012年第9期E95B卷 2914-2917页

作者： Choi, Suhan Moon, Hichan Hanyang Univ Dept Elect Engn Seoul 143701 South Korea Dankook Univ Dept Mobile Syst Eng Yongin 448701 South Korea

In this letter, distributed source coding with one distortion criterion and correlated messages is considered. This problem can be regarded as "Berger-Yeung problem with correlated messages". It corresponds to the source coding part of the graph-based framework for transmission of a pair of correlated sources over the multiple-access channel where one is lossless and the other is lossy. As a result, the achievable rate-distortion region for this problem is provided. A rigorous proof of both achievability and converse part is also given.

关键词： distributed source coding achievable rate-distortion region correlated messages Berger-Yeung problem random graphs

来源：评论

学校读者我要写书评

暂无评论

A SYNDROME-BASED AUTOENCODER FOR POINT CLOUD GEOMETRY COMPRESSION

A SYNDROME-BASED AUTOENCODER FOR POINT CLOUD GEOMETRY COMPRE...

引用

IEEE International Conference on Image Processing (ICIP)

作者： Milani, Simone Univ Padua Dept Informat Engn Padua Italy

ISBN: (纸本)9781728163956

Point cloud compression has been extensively-investigated in the past twenty years to find effective solutions that reduce the coded bit stream and permits adapting the coded bit rate to different scenarios. Despite these efforts, predictive strategies have so far performed poorly because of the low correlation level of the input data and the flexibility requirements, which imply minimizing the decoding dependences. The current paper proposes a convolutional autoencoder that applies the principles of distributed source coding (DSC) to the deep representations of voxelized point cloud geometry data. The hidden variables, called syndromes, enable reconstructing the coded point cloud geometry from different reference data. The proposed strategy overcomes the state-of-the-art solutions in terms of flexibility and rate-distortion performance.

关键词： point cloud compression geometry distributed source coding autoencoder UNet

来源：评论

学校读者我要写书评

暂无评论

Fundamental limits of distributed tracking

Fundamental limits of distributed tracking

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Kostina, Victoria Hassibi, Babak CALTECH Pasadena CA 91125 USA

ISBN: (纸本)9781728164328

Consider the following communication scenario. An n-dimensional source with memory is observed by K isolated encoders via parallel channels, who causally compress their observations to transmit to the decoder via noiseless rate-constrained links. At each time instant, the decoder receives K new codewords from the observers, combines them with the past received codewords, and produces a minimum-distortion estimate of the latest block of n source symbols. This scenario extends the classical one-shot CEO problem to multiple rounds of communication with communicators maintaining memory of the past. We prove a coding theorem showing that the minimum asymptotically (as n -> infinity) achievable sum rate required to achieve a target distortion is equal to the directed mutual information from the observers to the decoder minimized subject to the distortion constraint and the separate encoding constraint. For the Gauss-Markov source observed via K parallel AWGN channels, we solve that minimal directed mutual information problem, thereby establishing the minimum asymptotically achievable sum rate. Finally, we explicitly bound the rate loss due to a lack of communication among the observers;that bound is attained with equality in the case of identical observation channels. The general coding theorem is proved via a new nonasymptotic bound that uses stochastic likelihood coders and whose asymptotic analysis yields an extension of the Berger-Tung inner bound to the causal setting. The analysis of the Gaussian case is facilitated by reversing the channels of the observers.

关键词： CEO problem Berger-Tung bound distributed source coding causal rate-distortion theory Gauss-Markov source LQG control

来源：评论

学校读者我要写书评

暂无评论

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 Fronthaul Compression Design for Rateless Coded Multi-User Uplink Transmission in C-RAN

Distributed Fronthaul Compression Design for Rateless Coded ...

引用

Information Communication Technologies Conference (ICTC)

作者： Zhang, Yu Fan, Zhehao Meng, Limin Lu, Weidang Zhejiang Univ Technol Coll Informat Engn Hangzhou Peoples R China Southeast Univ Natl Mobile Commun Res Lab Nanjing Peoples R China

ISBN: (纸本)9781728167763

In this paper, we consider the multi-user uplink transmission in cloud radio access network (C-RAN), which consists of two users, two radio remote heads (RRHs), and the baseband processing unit (BBU) pool. The users adopt Raptor code and send the modulated signals to both RRHs continuously until receiving the acknowledge character (ACK) feedback from the BBU. A novel fronthaul compression scheme for RRH is proposed. Explicitly, both RRHs quantize the received signal to meet the fronthaul capacity constraint. One of the RRHs further compresses the quantized signal with low density parity check (LDPC) code. Then not only the resulted syndrome bits, additional quantization bits are also sent to the BBU according to the remaining fronthaul capacity, which can reduce the quantization noise at the BBU. We optimize the LDPC code based on extrinsic information transfer (EXIT) analysis. Simulation results show that optimized LDPC code has good compression performance compared with regular LDPC code, and the proposed fronthaul compression scheme outperforms the conventional scheme without DSC.

关键词： C-RAN distributed source coding degree profile optimization LDPC code

来源：评论

学校读者我要写书评

暂无评论

VIEW SYNTHESIS-BASED distributed LIGHT FIELD COMPRESSION

VIEW SYNTHESIS-BASED DISTRIBUTED LIGHT FIELD COMPRESSION

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Mukati, M. Umair Stepanov, Milan Valenzise, Giuseppe Dufaux, Frederic Forchhammer, Sdren Tech Univ Denmark DTU Foton Orsteds Plads DK-2800 Lyngby Denmark Univ Paris Saclay CNRS Cent Supelec Lab Signaux & Syst F-91190 Gif Sur Yvette France

ISBN: (纸本)9781728114859

Light field imaging is becoming a key technology, which provides users with a realistic visual experience through the capability of dynamic viewpoint shifting. This ability comes at the cost of capturing huge amounts of information, leaving the problem of compression and transmission a challenge. The encoder complexity is the key to achieve efficient coding in conventional light field coding schemes, where a complicated prediction process is essentially used at the encoder side to exploit the redundancy present in the light field image. We employ distributed source coding (DSC) for light field images, which can extensively lift the computational requirement from the encoding side at the expense of increased computational complexity at the decoder side. The efficiency of DSC is heavily dependent on the quality of side information at the decoder. Therefore, we propose to leverage a learning-based view synthesis method, which takes into account the light field structure to generate high-quality side information. We compare our approach to distributed Video coding and distributed Multi-view Video coding schemes adapted to the light field framework and relevant standard-based approach, and demonstrate that the proposed view synthesis-based approach can achieve similar performance, while substantially reducing the number of key views to be transmitted.

关键词： Light field distributed source coding view synthesis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：