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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

4,590 篇 会议
920 篇 期刊文献
8 篇 学位论文
3 册 图书

馆藏范围

5,521 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,647 篇 工学
- 1,193 篇 电气工程
- 961 篇 计算机科学与技术...
- 512 篇 信息与通信工程
- 169 篇 软件工程
- 100 篇 电子科学与技术（可...
- 64 篇 控制科学与工程
- 41 篇 仪器科学与技术
- 17 篇 交通运输工程
- 10 篇 机械工程
- 8 篇 测绘科学与技术
- 6 篇 光学工程
- 5 篇 网络空间安全
- 4 篇 力学（可授工学、理...
- 4 篇 生物医学工程（可授...
- 3 篇 材料科学与工程（可...
- 3 篇 航空宇航科学与技...
- 2 篇 石油与天然气工程
345 篇 理学
- 256 篇 数学
- 57 篇 物理学
- 21 篇 系统科学
- 6 篇 统计学（可授理学、...
- 5 篇 生物学
- 4 篇 地球物理学
271 篇 文学
- 271 篇 新闻传播学
114 篇 医学
- 111 篇 临床医学
- 9 篇 特种医学
59 篇 管理学
- 55 篇 管理科学与工程(可...
- 4 篇 图书情报与档案管...
9 篇 军事学
- 9 篇 军队指挥学
2 篇 教育学
- 2 篇 教育学
1 篇 农学

主题

5,521 篇 source coding
1,261 篇 decoding
639 篇 codes
602 篇 channel coding
418 篇 rate-distortion
387 篇 entropy
340 篇 random variables
291 篇 image coding
271 篇 data compression
227 篇 software
227 篇 training
223 篇 computational mo...
212 篇 semantics
203 篇 video coding
197 篇 encoding
191 篇 quantization
185 篇 distortion
184 篇 redundancy
182 篇 information theo...
181 篇 parity check cod...

机构

28 篇 department of el...
25 篇 department of el...
24 篇 department of el...
20 篇 school of electr...
19 篇 technion israel ...
19 篇 stanford univ de...
18 篇 univ calif berke...
17 篇 school of electr...
15 篇 princeton univ d...
15 篇 univ calif san d...
15 篇 department of el...
15 篇 department of el...
15 篇 queens univ dept...
15 篇 univ michigan de...
14 篇 georgia inst tec...
13 篇 department of el...
13 篇 department of el...
12 篇 ibm thomas j. wa...
12 篇 university of ca...
12 篇 department of el...

作者

46 篇 zixiang xiong
31 篇 k. ramchandran
26 篇 yang yang
25 篇 mikael skoglund
24 篇 en-hui yang
24 篇 m. effros
23 篇 s. sandeep pradh...
20 篇 tsachy weissman
19 篇 chang wen chen
18 篇 k. rose
18 篇 jun chen
18 篇 michelle effros
17 篇 yasutada oohama
16 篇 skoglund mikael
15 篇 chao tian
14 篇 k. zeger
14 篇 b. girod
13 篇 s.s. pradhan
13 篇 xiaolin wu
13 篇 pradhan s. sande...

语言

5,468 篇 英文
44 篇 其他
8 篇 中文
1 篇 俄文

检索条件"主题词=Source coding"

共 5521 条记录，以下是201-210 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

引用

Data Compression Conference (DCC)

作者： Wang, Jin Shi, Yunhui Xing, Yinsen Ling, Nam Yin, Baocai Beijing Univ Technol Fac Informat Technol Beijing 100124 Peoples R China Santa Clara Univ Dept Comp Sci & Engn Santa Clara CA 95053 USA

ISBN: (纸本)9781665478939

In this paper, we present a deep correlated image set compression scheme based on Distributed source coding(DSC) and multi-scale image fusion. As there exists strong correlation among images in a similar image set, we propose to utilize such correlation to generate side information at decoder side for each image in the set. Specifically, a reference structure of the image set is generated by building a minimum spanning tree according to the similarity between two images at encoder. With the reference structure, the side information of each image to be decoded can be generated based on the decoded reference image. And our network learns the correlation between an image and its side information in the training phase. Based on the principle of DSC, the side information can provide additional information such as rich details at decoder side. To make full use of the side information, the initially decoded image and the additional side information are fused at different scales. A decompressed image enhancement network is introduced to reduce the compression artifacts of the decoded images. Extensive experimental results compared with other mainstream methods validate the superior performance of our scheme in both terms of subjective and objective quality.

关键词： Training Image coding Correlation source coding Buildings Decoding Image enhancement

来源：评论

学校读者我要写书评

暂无评论

Lossless source coding using tree structured random binning

Lossless source coding using tree structured random binning

引用

IEEE International Symposium on Information Theory

作者： Haghighat, Javad Hamouda, Walaa Soleymani, M. Reza Concordia Univ Dept Elect & Comp Engn Montreal PQ H3G 1M8 Canada

ISBN: (纸本)9781424405053

We propose a tree structured variable length random binning scheme for lossless compression of binary memoryless sources. Previously proposed source coding schemes based on nested error correcting codes can be regarded as practical implementations of this random binning scheme. For sufficiently large data blocks, we prove that the proposed scheme asymptotically achieves the entropy limit. We also derive the distribution of the compression rate achieved by the tree structured random binning scheme. Comparing this distribution with the distribution obtained using a library of random binning schemes, we show that a nested code can achieve rates close to a library of codes but with much lower encoding/decoding complexity.

关键词： source coding nested codes random binning entropy

来源：评论

学校读者我要写书评

暂无评论

Lossy Subset source coding

Lossy Subset Source Coding

引用

Information Theory and Applications Workshop

作者： MolavianJazi, Ebrahim Yener, Aylin Penn State Univ Dept Elect Engn Wireless Commun & Networking Lab University Pk PA 16802 USA

ISBN: (纸本)9781509025299

This paper studies the lossy version of a problem recently proposed by the authors termed subset source coding, where the focus is on the fundamental limits of compression for subsets of the possible realizations of a discrete memoryless source. An upper bound is derived on the subset rate-distortion function in terms of the subset mutual information optimized over the set of conditional distributions that satisfy the expected distortion constraint with respect to the subset-typical distribution and over the set of certain auxiliary subsets. By proving a strong converse result, this upper bound is shown to be tight for a class of symmetric subsets. As illustrated in our numerical examples, more often than not, one achieves a gain in the fundamental limit, in that the optimal lossy compression rate for the subset can be strictly smaller than the rate-distortion function of the source, although exceptions can also be constructed.

关键词： Rate-distortion Distortion Entropy source coding Mutual information Standards Random variables

来源：评论

学校读者我要写书评

暂无评论

Wyner-Ziv source coding with Feedback and Uncertain Side Information

Wyner-Ziv Source Coding with Feedback and Uncertain Side Inf...

引用

Iran Workshop on Communication and Information Theory

作者： Joda, Roghayeh Erkip, Elza Lahouti, Farshad Iran Telecommun Res Ctr Tehran Iran Polytech Univ Dept Elect & Comp Engn Brooklyn NY 11201 USA Univ Tehran Sch Elect & Comp Engn Coll Engn Tehran Iran CALTECH Dept Elect Engn Pasadena CA 91125 USA

ISBN: (纸本)9781479982356

In this paper, the problem of lossy source coding with side information at the decoder is considered when the dependency between the source and the side information (SI) is quasi-stationary and unknown to the encoder. This dependency is modeled using a (virtual) block fading channel. In order to help the decoder estimate the dependency, a part of the transmitted source in each block is coded at high rate (disregarding the SI) to be decoded error-free at the decoder. The estimate of the virtual block fading channel is imperfect and its quality depends on the length of the estimation block. The decoder's estimate is then quantized and communicated back to the encoder using a limited rate feedback. The encoder encodes the rest of the source block with this knowledge of the SI dependency model. A source coding scheme that uses the estimated dependency structure is proposed and the appropriate length of the source assigned for the estimation phase is characterized so as to minimize the mean distortion. The effect of the feedback rate, the quantization step size and the dependency estimation error are also investigated.

关键词： decoders Feedback ENCODER side information source coding On-Site Inspections Silicon International System of Units lossy source coding quasi-steady states DEPENDENCE step size Fading channels Imperfect

来源：评论

学校读者我要写书评

暂无评论

Lossy source coding using Belief Propagation and Soft-Decimation Over LDGM Codes

Lossy Source Coding using Belief Propagation and Soft-Decima...

引用

21st Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

作者： Castanheira, Daniel Gameiro, Atilio Univ Aveiro Inst Telecomunicacoes P-3810193 Aveiro Portugal

ISBN: (纸本)9781424480166

This paper focus on the lossy compression of a binary symmetric source. We propose a new algorithm for binary quantization over low density generator matrix (LDGM) codes. The proposed algorithm is a modified version of the belief propagation (BP) algorithm used in the channel coding framework and has linear complexity in the code block length. We also provide a common framework under which the proposed algorithm and some previously proposed algorithms fit. Simulation results show that our scheme achieves close to state-of-the-art performance with reduced complexity.

关键词： belief propagation algorithm binary codes binary symmetric source block codes channel coding framework linear complexity lossy compression lossy source coding low density generator matrix codes parity check codes soft decimation over LDGM code source coding

来源：评论

学校读者我要写书评

暂无评论

Blahut-Arimoto Algorithm and Code Design for Action-Dependent source coding Problems

Blahut-Arimoto Algorithm and Code Design for Action-Dependen...

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Trillingsgaard, Kasper F. Simeone, Osvaldo Popovski, Petar Larsen, Torben Aalborg Univ Dept Elect Syst Aalborg Denmark New Jersey Inst Technol CWCSPR Newark NJ 07102 USA

ISBN: (纸本)9781479904464

The source coding problem with action-dependent side information at the decoder has recently been introduced to model data acquisition in resource-constrained systems. In this paper, an efficient Blahut-Arimoto-type algorithm for the numerical computation of the rate-distortion-cost function for this problem is proposed. Moreover, a simplified two-stage code structure based on multiplexing is put forth, whereby the first stage encodes the actions and the second stage is composed of an array of classical Wyner-Ziv codes, one for each action. Leveraging this structure, specific coding/decoding strategies are designed based on LDGM codes and message passing. Through numerical examples, the proposed code design is shown to achieve performance close to the rate-distortion-cost function.

关键词： data acquisition decoding message passing multiplexing rate distortion theory source coding

来源：评论

学校读者我要写书评

暂无评论

Proactive source coding

Proactive Source Coding

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Gungor, Onur Koyluoglu, O. Ozan El Gamal, Hesham Koksal, Can Emre Ohio State Univ Dept Elect & Comp Engn Columbus OH 43210 USA

ISBN: (纸本)9781457705953

A coding problem, over a slotted system, is introduced where the sender has to transmit one out of several packets to the receiver, but learns the request only at the beginning of each slot with prior statistical information about which packet is needed at the receiver. There is an associated cost of sending bits at each slot, and the goal is to minimize the expected cost of the communication. A proactive coding scheme is proposed, where the source proactively communicates with the receiver before the receiver requests the message. This way, by designing a cost optimal side information at the receiver, the scheme is able to minimize the expected cost of the communication. Numerical results are provided demonstrating the gains obtained by proactive coding over the conventional coding technique.

关键词： Indexes Markov processes Receivers Resource management source coding coding problem cost optimal side information expected cost of communication proactive source coding receivers slotted system source coding statistical information

来源：评论

学校读者我要写书评

暂无评论

Efficient Distributed source coding for Multiple Receivers Via Matrix Sparsification

Efficient Distributed Source Coding for Multiple Receivers V...

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Avin, Chen Borokhovich, Michael Cohen, Asaf Lotker, Zvi Ben Gurion Univ Negev Dept Commun Syst Engn IL-84105 Beer Sheva Israel

ISBN: (纸本)9781457705953

Consider the problem of source coding with side information in large networks with multiple receivers. In this case, standard coding techniques are either prohibitively complex to decode, or require source-network coding separation, resulting in sub-optimal transmission schemes. To alleviate this problem, we offer a joint network-source coding scheme based on matrix sparsification at the code design phase, which allows the terminals to use an efficient decoding procedure (syndrome decoding using LDPC), despite the network coding throughout the network. Via a novel relation between matrix sparsification and rate-distortion theory, we give lower and upper bounds on the best achievable sparsification performance, and analyze our scheme in the limit of weak side information at the receivers. Simulation results motivate the use of this scheme at non-limiting rates as well.

关键词： Decoding Joints LDPC Network coding Parity check codes Rate-distortion source coding distributed source coding matrix algebra matrix sparsification multiple receivers network coding parity check codes source coding source-network coding syndrome decoding

来源：评论

学校读者我要写书评

暂无评论

Distributed source coding in wireless sensor networks using LDPC coding: The entire Slepian-Wolf rate region

Distributed source coding in wireless sensor networks using ...

引用

IEEE Wireless Communications and Networking Conference

作者： Sartipi, M Fekri, F Georgia Inst Technol Sch Elect & Comp Engn Atlanta GA 30332 USA

ISBN: (纸本)0780389662

In this paper, we propose a scheme for distributed source coding that achieves any arbitrary rate on the Slepian-Wolf rate region using a single systematic LDPC code. This method is based on sending a fraction of the information bits along with a fraction of parity bits generated by the LDPC code. First, we study the problem of distributed source coding of two correlated sources at the symmetric rate. We propose to use non-uniform LDPC codes for this application. Then, we generalize our approach to any arbitrary rate on the Slepian-Wolf rate region. The detailed construction of this scheme is investigated. We illustrate that the design procedure for the LDPC code simplifies to the design of rate-adaptive LDPC codes that need unequal error protection. It is shown that the performance of distributed source coding at any arbitrary rate is almost the same as that of asymmetric rates. Because of the proposed decoding algorithm, each of the sources is decoded independently (only part of the information bits are being exchanged between the decoders). Therefore, this approach does not suffer from the problems of heavily damaged or propagation of the errors. This method can be easily applied to joint source-channel coding.

关键词： decoding parity check codes source coding variable rate codes wireless sensor networks Slepian-Wolf rate region decoding algorithm distributed source coding nonuniform LDPC codes rate-adaptive LDPC codes symmetric rate correlated sources systematic LDPC

来源：评论

学校读者我要写书评

暂无评论

Outage Probability Bounds for Integer-Forcing source coding

Outage Probability Bounds for Integer-Forcing Source Coding

引用

2017 IEEE Information Theory Workshop (ITW)

作者： Domanovitz, Elad Erez, Uri Tel Aviv Univ Dept EE Syst Tel Aviv Israel

ISBN: (纸本)9781509030972

Integer-forcing source coding has been proposed as a low complexity method for compression of distributed correlated Gaussian sources. In this scheme, each encoder quantizes its observation using the same fine lattice and reduces the result modulo the coarse lattice. Rather than directly recovering the individual quantized signals, the decoder first recovers a full-rank set of judiciously chosen integer linear combinations of the quantized signals, and then inverts it. It has been observed that the method works very well for "most" but not all source covariance matrices. The present work quantifies the measure of bad covariance matrices by studying the probability that integer forcing source coding fails as a function of the rate allocated in excess of the Berger-Tung benchmark, where the probability is with respect to a random orthogonal transformation that is applied to the sources prior to quantization. For the important case where the signals to be compressed correspond to the antenna inputs of relays in an i.i.d. Rayleigh fading environment, this orthogonal transformation can be viewed as if it is performed by nature. Hence, the results provide performance guarantees for distributed source coding via integer forcing in this scenario.

关键词： source coding Covariance matrices Lattices Decoding Probability Precoding Power system reliability

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共500页 << < 17 18 19 20 21 22 23 24 25 26 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：