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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

60 篇 会议
39 篇 期刊文献

馆藏范围

99 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

95 篇 工学
- 56 篇 电气工程
- 39 篇 计算机科学与技术...
- 33 篇 信息与通信工程
- 15 篇 电子科学与技术（可...
- 14 篇 软件工程
- 8 篇 机械工程
- 4 篇 仪器科学与技术
- 4 篇 控制科学与工程
- 1 篇 光学工程
- 1 篇 环境科学与工程（可...
10 篇 医学
- 10 篇 临床医学
7 篇 理学
- 4 篇 数学
- 2 篇 系统科学
- 1 篇 化学
- 1 篇 生物学
4 篇 管理学
- 4 篇 管理科学与工程(可...
2 篇 军事学
- 2 篇 军队指挥学
1 篇 教育学
- 1 篇 教育学
1 篇 文学
- 1 篇 新闻传播学

主题

99 篇 encoding complex...
14 篇 video coding
14 篇 encoder
10 篇 hevc
9 篇 decoding
8 篇 coding
8 篇 rate distortion
8 篇 decoding complex...
8 篇 videotapes
8 篇 encoding
7 篇 bit rate
7 篇 high efficiency ...
7 篇 video compressio...
6 篇 decoders
5 篇 algorithms
5 篇 polar codes
4 篇 error correction...
4 篇 complexity class...
4 篇 vvc
4 篇 image coding

机构

2 篇 fudan univ sch c...
2 篇 beihang univ sch...
2 篇 kyungpook natl u...
2 篇 department of el...
2 篇 univ patras elec...
2 篇 kyungpook natl u...
2 篇 xidian univ stat...
2 篇 univ calgary dep...
1 篇 epfl
1 篇 national institu...
1 篇 kings coll londo...
1 篇 samsung elect sa...
1 篇 universidad poli...
1 篇 stanford univ de...
1 篇 dong a univ dept...
1 篇 peking univ natl...
1 篇 stanford univ de...
1 篇 school of commun...
1 篇 univ witwatersra...
1 篇 ewha womans univ...

作者

6 篇 park sang-hyo
2 篇 shimamoto takash...
2 篇 katayama takafum...
2 篇 tang li
2 篇 shi wen
2 篇 wang zulin
2 篇 hamid reza tohid...
2 篇 thompson john s.
2 篇 jiang xiantao
2 篇 lee sujin
2 篇 mahsa t. pouraza...
2 篇 kang je-won
2 篇 paliouras vassil...
2 篇 wang yan
2 篇 mahdi ahmed
2 篇 song tian
2 篇 jiang jing
2 篇 wang xin
2 篇 jeon byeungwoo
2 篇 won kwanghyun

语言

98 篇 英文
1 篇 其他

检索条件"主题词=encoding complexity"

共 99 条记录，以下是51-60 订阅

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

详细简洁

排序：

Low-complexity Video Compression and Compressive Sensing

Low-Complexity Video Compression and Compressive Sensing

引用

47th Asilomar Conference on Signals, Systems, and Computers

作者： Asif, M. Salman Fernandes, Felix Romberg, Justin Georgia Inst Technol Sch ECE Atlanta GA 30332 USA Samsung Res Amer Richardson TX 75082 USA

ISBN: (纸本)9781479923908

Compressive sensing (CS) provides a general signal acquisition framework that enables the reconstruction of sparse signals from a small number of linear measurements. To reduce video-encoder complexity, we present a CS-based video compression scheme. Modern video-encoder complexity arises mainly from the transform-coding and motion-estimation blocks. In our proposed scheme, we eliminate these blocks from the encoder, which achieves compression by merely taking a few linear measurements of each image in a video sequence. To guarantee stable reconstruction of the video sequence from only a few measurements, the decoder must effectively exploit the inherent spatial and temporal redundancies in a video sequence. To leverage these redundancies, we consider a motion-adaptive linear dynamical model for videos. Recovery process involves solving an l(1)-regularized optimization problem, which iteratively updates estimates for the video frames and motion within adjacent frames. To evaluate the performance of our proposed scheme we performed experiments on various standard test sequences.

关键词： Video sequences Compressed sensing Video compression Videotapes encoding complexity VIDEO FRAMES Linear measurement test standards ENCODER temporal redundancy motion estimation

来源：评论

学校读者我要写书评

暂无评论

Forward Error Correction with RaptorQ Code on Embedded Systems

Forward Error Correction with RaptorQ Code on Embedded Syste...

引用

54th IEEE International Midwest Symposium on Circuits and Systems (MWSCAS)

作者： Mladenov, T. Kim, K. Nooshabadi, S. Gwangju Inst Sci & Technol Dept Informat & Commun Kwangju 500712 South Korea Michigan Technol Univ Dept Elect & Comp Engn Houghton MI 49931 USA

ISBN: (纸本)9781612848570

Raptor code, a member of the rateless fountain codes family, has been a preferred technology for the forward error correction (FEC) at the application layer. It is used by the 3(rd) Generation Partnership Program (3GPP) Multimedia Broadcast/Multicast Service (MBMS) and Digital Video Broadcasting (DVB-H) standards for multimedia broadcast and content delivery. Currently, a next generation fountain code, called RaptorQ, is being proposed. It aims at reducing to a minimum the redundant FEC information, outperforming significantly Raptor code. The improved coding performance comes at the expense of increased encoding and decoding complexity. This paper compares the coding properties, the decoding performance and the energy efficiency of the two codes on embedded system. Furthermore, simulations are performed for a practical MBMS scenario. Finally, conclusions are drawn with respect to the applicability of the new code for realtime multimedia broadcasting and content delivery.

关键词： 3G mobile communication 3GPP 3rd Generation Partnership Program DVB-H Decoding Hardware Radiation detectors Radio access networks RaptorQ code communication complexity content delivery decoding decoding complexity digital video broadcasting digital video broadcasting standard embedded system embedded systems encoding complexity energy efficiency error correction codes forward error correction forward error correction multicast communication multimedia broadcast/multicast service multimedia communication rateless fountain codes family

来源：评论

学校读者我要写书评

暂无评论

Adaptive Coding Tree for complexity Control of High Efficiency Video Encoders

Adaptive Coding Tree for Complexity Control of High Efficien...

引用

29th Picture Coding Symposium (PCS)

作者： Correa, Guilherme Assuncao, Pedro da Silva Cruz, Luis A. Agostini, Luciano DEEC FCTUC Univ Coimbra Inst Telecomunicacoes Coimbra Portugal DEE ESTG Polytech Inst Leiria Leiria Portugal GACI CDTEC Fed Univ Pelotas Pelotas Brazil

ISBN: (纸本)9781457720482

The emerging HEVC standard introduces several techniques which increase compression efficiency in comparison to its predecessors. However, such advances are accompanied by increases in computational complexity, limiting the encoder use in computational or power-constrained devices. This paper proposes a novel complexity control method for the future HEVC encoders based on a dynamic adjustment of the newly proposed coding tree structures. The relationship between coding tree depths and the encoding complexity is explored to selectively constrain encoding possibilities in order to not exceed a predefined complexity target. Experimental results show that the encoder computational complexity can be downscaled to 60% with a bit rate increase under 3.5% and a PSNR decrease under 0.1 dB.

关键词： ENCODER COMPRESSION EFFICIENCY encoding complexity complexity classes Adaptive coding Control Methods

来源：评论

学校读者我要写书评

暂无评论

Not Just for Errors: Codes for Fast and Secure Flash Storage

Not Just for Errors: Codes for Fast and Secure Flash Storage

引用

Globecom Workshops

作者： Cassuto, Yuval Ecole Polytech Fed Lausanne Sch Comp & Commun Sci ALGO Lab CH-1015 Lausanne Switzerland

ISBN: (纸本)9781424488650

Error-correcting codes are normally employed in storage devices to guarantee the integrity of data in the presence of errors. This paper presents two schemes where error-correcting codes are used for entirely different purposes. In the first part of the paper, a new coding paradigm is proposed to improve the write performance of multi-level flash devices. By slightly relaxing the accuracy of cell programming, significant speed-up can be achieved. The resulting write inaccuracies are then corrected by codes that are tailored for the appropriately restricted error model. In the second part, new low-complexity codes are proposed to protect the security of sensitive data in the presence of imperfect physical erasure processes. Codes that have optimal encoding and decoding complexities are constructed to allow fast storing and retrieval of secret data, and guarantee unconditional security of data against an adversary with access to parts of the secret that failed to erase.

关键词： cell programming decoding decoding complexity encoding complexity error correction codes error-correcting codes flash memories low-complexity codes multilevel flash storage devices security of data sensitive data security

来源：评论

学校读者我要写书评

暂无评论

Improved fast mode decision algorithm for variable macro block motion compensation in H.264

Improved fast mode decision algorithm for variable macro blo...

引用

International Symposium on Information Technology Convergence

作者： Kim, Dae-gon Yoo, Cheol-jung Chang, Ok-bae Kim, Eun-mi Choi, Jong-Ryeol Chonbuk Natl Univ Div Elect & Informat Engn Jeonju South Korea Howon Univ Div Comp & Game Gunsan South Korea Jeonju Univ Coll Culture & Tourism Jeonju South Korea

ISBN: (纸本)9780769530451

H.264 is the latest international video coding standard and it can achieve considerably higher coding efficiency versus previous standards This is accomplished by an enhanced exploitation of the spatiotemporal correlation, such as various macro-block modes, variable block sizes for motion compensation, multiple reference frames, quarter pixel motion accuracy, and various predictive direction modes for intra prediction. However, although such new encoding technology is the main factor in improving the encoding efficiency, it is simultaneously a highly complex factor. Therefore, the H.264 standard is used widely in real applications where the speed elevation of these technologies is essential. The proposed fast motion vector search technique supports the fastest compensation of the variable size block motion that is suitable for the motion vector conclusions which comprise a significant proportion of the encoding complexity in this paper. In addition, a fast-mode decision algorithm capable of deciding various encoding optimal values of H.264 is proposed. Because the proposed fast mode decision algorithm is capable of deciding the mode early, the method enables the omission of the computational procedure of rate-distortion cost and the efficient operation of the motion vector search technique. The results presented here confirmed the achievement of a very high efficiency while decreasing the required number of calculations without incurring any significant encoding damage, thereby improving the existing algorithm by using the information of the surrounding block.

关键词： macro block Motion compensation motion vector coding encoding complexity search technique computational procedure efficient functioning algorithms Rate distortion Fasting

来源：评论

学校读者我要写书评

暂无评论

Resource-aware joint source-channel multiple description estimation and compression in networks

Resource-aware joint source-channel multiple description est...

引用

IEEE Information Theory Workshop

作者： Wu, Xiaolin Wang, Xiaohan Wang, Zhe McMaster Univ ECE Hamilton ON L8S 4L8 Canada

ISBN: (纸本)9781424415632

We present a joint source-channel multiple description (JSC-MD) framework for resource-constrained network communications (e.g., sensor networks), in which one or many deprived encoders communicate a Markov source against bit errors and erasure errors to many decoders, some powerful and some deprived. To keep the encoder complexity at minimum, the source is coded into K descriptions by a simple multiple description quantizer (MDQ) with neither entropy nor channel coding. The code diversity of MDQ and the path diversity of the network are exploited by decoders to correct transmission errors and improve coding efficiency. To suit heterogeneous decoders the proposed JSC-MD approach is made resource-scalable. Powerful nodes in the network can perform JSC-MD distributed estimation/decoding under the criteria of maximum a posteriori probability (MAP) or minimum mean-square error (MMSE), while primitive nodes resort to simpler MD decoding, all working with the same MDQ code. The application of JSC- MD to distributed estimation of hidden Markov models in a sensor network is demonstrated. The proposed JSC-MD MMSE decoder is an extension of the well-known forward-backward algorithm to multiple descriptions, while the JSC-MD MAP decoder is an algorithm of the longest path in a weighted directed acyclic graph. Both algorithms simultaneously exploit the source memory, the redundancy of the fixed-rate MDQ, and the inter-description correlations. They outperform the existing hard-decision MDQ decoders by large margins (up to 8dB). The new JSC-MD framework also enjoys an operational advantage over the existing MDQ decoders. It eliminates the need for as many as 2(K)-1 side decoders to handle different combinations of the received descriptions by unifying the treatments of all these possible cases.

关键词： decoders encoding complexity path diversity Sensor networks Network network node Maximum a posteriori estimation compression algorithms

来源：评论

学校读者我要写书评

暂无评论

CU Depth-based ALF Decision for Fast HEVC encoding

CU Depth-based ALF Decision for Fast HEVC Encoding

引用

IEEE 16th International Symposium on Consumer Electronics (ISCE)

作者： Park, Sanghyo Choi, Kiho Jang, Euee S. Hanyang Univ Dept Elect & Comp Engn Seoul 133791 South Korea

ISBN: (纸本)9781467313568

In this paper, we propose a coding unit (CU) depth-based adaptive loop filter (ALF) decision method to reduce the encoder complexity. In high efficiency video coding (HEVC), ALF is designed based on Wiener filter to minimize the distortion between the original frame and the coded frame. In order to design the optimal filter for each CU, the filter design process is repeated 12 times per CU. The repetition of the filter design process occupies about 77 percent in the total ALF computation time, which substantially increases the encoder complexity. The proposed method simplifies the filter design with the CU depth-based ALF decision, which is based on the observation by exploiting ineffective computations. Experimental results show that the proposed method reduces the encoding time for the repetition of the filter design process by about 13 percent of that of the HEVC test model (i.e., HM 5.0) with 0.1 percent BD-rate increase.

关键词： encoding complexity filter design design process Percent optimal filters Repetition

来源：评论

学校读者我要写书评

暂无评论

Average-Case Completeness in Tag Systems 36

Average-Case Completeness in Tag Systems

引用

36th International Symposium on Theoretical Aspects of Computer Science (STACS)

作者： Cook, Matthew Neary, Turlough Univ Zurich Zurich Switzerland Swiss Fed Inst Technol Zurich Switzerland

ISBN: (纸本)9783959771009

To prove average-case NP-completeness for a problem, we must choose a known average-case complete problem and reduce it to that problem. Unfortunately, the set of options to choose from is far smaller than for standard (worst-case) NP-completeness. In an effort to help remedy this we focus on tag systems, which due to their extreme simplicity have been a target for other types of reductions for many problems including the matrix mortality problem, the Post correspondence problem, the universality of cellular automaton Rule 110, and all of the smallest universal single-tape Turing machines. Here we show that a tag system can efficiently simulate a Turing machine even when the input is provided in an extremely simple encoding which adds just log n carefully set bits to encode an arbitrary Turing machine input of length n. As a result we show that the bounded halting problem for nondeterministic tag systems is average-case NP-complete. This result is unexpected when one considers that in the current state of the art for simple universal systems it had appeared that there was a trade-off whereby simpler systems required more complicated input encodings. In other words, although simple systems can compute interesting things, they had appeared to require very carefully encoded inputs in order to do so. Our result surprisingly goes in the opposite direction by giving the first average-case completeness result for such a simple model of computation. In ongoing work we have already found applications of our result having used it to give average-case NP-completeness results for a 2D generalization of the Collatz function, a nondeterministic version of the 2D elementary functions studied by Koiran and Moore, 3D piecewise affine maps, and bounded Post correspondence problem instances that use simpler word pairs than previous results.

关键词： average-case NP-completeness encoding complexity tag system bounded halting problem

来源：评论

学校读者我要写书评

暂无评论

Study on Machine Learning Models for Tree Partitioning Method of Versatile Video Coding

Study on Machine Learning Models for Tree Partitioning Metho...

引用

International Conference on Electronics, Information, and Communication (ICEIC)

作者： Lee, Sujin Park, Sang-Hyo Kyungpook Natl Univ Sch Comp Sci & Engn Daegu South Korea

ISBN: (纸本)9781665409346

In this paper, we propose a method using machine learning models to determine necessity of ternary tree (TT) partitioning in versatile video coding (VVC). To reduce the encoding complexity of a multi-type tree (MTT) partitioning in VVC, it is significantly important to early decide whether TT is needed. In this study, we analyze the correlation between the known features and the TT partitioning using extensive video dataset. We present a comparative study on machine learning models that consider the TT decision process as a binary classification problem. The experimental results show that the proposed model achieves higher accuracy than that of the existing model. Our code and dataset are available at https://***/sujineel/ICEIC_2022.

关键词： Machine learning VVC video compression decision tree encoding complexity

来源：评论

学校读者我要写书评

暂无评论

Design and Analysis of Compress-and-Forward Cooperation in a Virtual-MIMO Detection System

Design and Analysis of Compress-and-Forward Cooperation in a...

引用

Globecom Workshops

作者： Jiang, Jing Thompson, John S. Grant, Peter M. Univ Edinburgh Sch Engn Joint Res Inst Signal & Image Proc Inst Digital Commun Edinburgh EH9 3JL Midlothian Scotland

ISBN: (纸本)9781424488650

A cooperative virtual-MIMO system that implements bit-interleaved coded modulation (BICM) transmission and compress-and-forward (CF) cooperation is presented in this paper. The key tasks of the relay include constructing a good codebook, and forwarding a compressed version of the received signals to the destination. Codebook designs of the Voronoi vector quantization (VQ) and the tree-structure vector quantization (TSVQ) to enable CF cooperation are described in this paper. A comparison in terms of the codebook design complexity and encoding complexity is presented. It is shown that the TSVQ is much simpler to design and operate and can achieve performance comparable to the optimal but more complicated Voronoi VQ. Error performance results show that the helping relay enables the proposed cooperative virtual-MIMO system to achieve close to MIMO performance.

关键词： MIMO communication Voronoi vector quantization bit-interleaved coded modulation transmission codebook designs compress-and-forward cooperation cooperative communication encoding encoding complexity error performance tree-structure vector quantization virt

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共10页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：