中国科学院机构知识库网格系统: 检索

Unsupervised Balanced Hash Codes Learning With Multichannel Feature Fusion 期刊论文 OAI收割
IEEE JOURNAL OF SELECTED TOPICS IN APPLIED EARTH OBSERVATIONS AND REMOTE SENSING, 2022, 卷号: 15, 页码: 2816-2825
作者: Chen, Yaxiong; Zhao, Dongjie; Lu, Xiongbo; Xiong, Shengwu; Wang, Huangting

|

收藏 | 浏览/下载：43/0 | 提交时间：2022/05/07

Feature extraction Codes Data mining Convolution Linear programming Approximation algorithms Semantics Deep hash codes multichannel feature fusion multiscale context information unsupervised hashing learning

An Integer Programming-Based Bound for Locally Repairable Codes 期刊论文 OAI收割
IEEE TRANSACTIONS ON INFORMATION THEORY, 2015, 卷号: 61, 期号: 10, 页码: 5280-5294
作者: Wang, Anyu; Zhang, Zhifang

|

收藏 | 浏览/下载：20/0 | 提交时间：2018/07/30

Distributed storage erasure codes locally repairable codes linear codes

LQG control of networked control systems with limited information 期刊论文 OAI收割
Mathematical Problems in Engineering, 2014, 卷号: 2014, 页码: 1-12
作者: Liu QQ(刘庆泉); Jin F(金芳)

收藏 | 浏览/下载：30/0 | 提交时间：2014/12/29

Digital communication systems Feedback control Linear control systems Stabilization State feedback Trellis codes

A design of high-speed and low-consume parallel grouping RS code and simulation (EI CONFERENCE) 会议论文 OAI收割
2010 3rd International Conference on Advanced Computer Theory and Engineering, ICACTE 2010, August 20, 2010 - August 22, 2010, Chengdu, China
Chen C.; Jin G.

收藏 | 浏览/下载：23/0 | 提交时间：2013/03/25

RS code is a linear error correction codes with better error correction capability is widely used in different kinds of occasions for communications or data storage. But for its high difficulty of coding and decoding algorithm and low throughput optimization RS algorithm is always studied as one of the focus in the error-correction field. A new coding method parallel coding and decoding data into groups in lower step finite field for avoiding complex matrix iteration and Chien search computation is proposed in this paper. It is proved that the coding and decoding throughput of the parallel grouping RS coder is increased and the hardware complexity is reduced with changeless error-correction capability from the simulation results using ModelSim SE 6.0 and synthetic results using ISE 9.11. 2010 IEEE.

Dembowski-Ostrom型完全非线性函数构造的线性码权分布 期刊论文 OAI收割
应用科学学报, 2010, 卷号: 28, 期号: 5, 页码: 441-446
李平; 李超; 周悦

|

收藏 | 浏览/下载：26/0 | 提交时间：2011/05/23

完全非线性函数二次型指数和线性码权分布perfect nonlinear functions quadratic forms exponential sums linear codes weight distributions

priority linear coding based opportunistic routing for video streaming in ad hoc networks 会议论文 OAI收割
53rd IEEE Global Communications Conference, GLOBECOM 2010, Miami, FL, 40883
Zhi Li; Limin Sun; Xinyun Zhou; Liqun Li

|

收藏 | 浏览/下载：22/0 | 提交时间：2011/03/31

H.264 video streaming OR-PLC mechanism error propagation error protection priorities multihop ad hoc networks priority linear coding-based opportunistic routing progressive decoding progressive encoding video packets video quality ad hoc networks linear codes telecommunication network routing video coding video streaming

Automatic robust linear receiver for multi-access space-time block coded mimo systems 期刊论文 iSwitch采集
Ieee signal processing letters, 2009, 卷号: 16, 期号: 8, 页码: 687-690
作者: Yang, Jun; Ma, Xiaochuan; Hou, Chaohuan; Liu, Yicong; Yao, Zheng

收藏 | 浏览/下载：34/0 | 提交时间：2019/05/10

Multi-access mimo communications Orthogonal space-time block codes Robust linear receiver

Block diagonal differential space-time-frequency codes for four transmit antennas 期刊论文 iSwitch采集
Wireless personal communications, 2009, 卷号: 49, 期号: 4, 页码: 517-531
作者: Zhang, Yi; Zhang, Can; Tu, Guo Fang

收藏 | 浏览/下载：25/0 | 提交时间：2019/05/10

Differential space-time-frequency codes Block diagonal orthogonal structure Linear constellation decimation codes Subcarrier grouping

The relative generalized Hamming weight of linear q-ary codes and their subcodes 期刊论文 OAI收割
DESIGNS CODES AND CRYPTOGRAPHY, 2008, 卷号: 48, 期号: 2, 页码: 111-123
作者: Liu, Zihui; Chen, Wende; Luo, Yuan

|

收藏 | 浏览/下载：15/0 | 提交时间：2018/07/30

relative generalized Hamming weight linear codes finite projective geometry relative difference sequence

Lossless wavelet compression on medical image (EI CONFERENCE) 会议论文 OAI收割
4th International Conference on Photonics and Imaging in Biology and Medicine, September 3, 2005 - September 6, 2005, Tianjin, China
作者: Liu H.; Liu H.; Liu H.

收藏 | 浏览/下载：41/0 | 提交时间：2013/03/25

An increasing number of medical imagery is created directly in digital form. Such as Clinical image Archiving and Communication Systems (PACS). as well as telemedicine networks require the storage and transmission of this huge amount of medical image data. Efficient compression of these data is crucial. Several lossless and lossy techniques for the compression of the data have been proposed. Lossless techniques allow exact reconstruction of the original imagery while lossy techniques aim to achieve high compression ratios by allowing some acceptable degradation in the image. Lossless compression does not degrade the image thus facilitating accurate diagnosis of course at the expense of higher bit rates i.e. lower compression ratios. Various methods both for lossy (irreversible) and lossless (reversible) image compression are proposed in the literature. The recent advances in the lossy compression techniques include different methods such as vector quantization wavelet coding neural networks and fractal coding. Although these methods can achieve high compression ratios (of the order 50:1 or even more) they do not allow reconstructing exactly the original version of the input data. Lossless compression techniques permit the perfect reconstruction of the original image but the achievable compression ratios are only of the order 2:1 up to 4:1. In our paper we use a kind of lifting scheme to generate truly loss-less non-linear integer-to-integer wavelet transforms. At the same time we exploit the coding algorithm producing an embedded code has the property that the bits in the bit stream are generated in order of importance so that all the low rate codes are included at the beginning of the bit stream. Typically the encoding process stops when the target bit rate is met. Similarly the decoder can interrupt the decoding process at any point in the bil stream and still reconstruct the image. Therefore a compression scheme generating an embedded code can start sending over the network the coarser version of the image first and continues with the progressive transmission of the refinement details. Experimental results show that our method can get a perfect performance in compression ratio and reconstructive image.