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

Entropy-constrained halftoning using multipath tree coding

IEEE TRANSACTIONS ON IMAGE PROCESSING 1997年第11期6卷 1567-1579页

作者： Wong, PW Hewlett-Packard Co. Palo Alto CA

We suggest an optimization-based method for halftoning that involves looking ahead before a decision for each binary output pixel is made. We first define a mixture distortion criterion that is a combination of a frequency-weighted mean square error (MSE) and a measure depending on the distances between minority pixels in the halftone, A tree-coding approach with the ML-algorithm is used for minimizing the distortion criterion to generate a halftone. While this approach generates halftones of high quality, these halftones are not very amenable to lossless compression. We introduce an entropy constraint into the cost function of the tree-coding algorithm that optimally trades off between image quality and compression performance in the output halftones.

关键词： digital halftoning entropy constraint frequency-weighted mean squared error halftone compression tree coding

来源：评论

学校读者我要写书评

暂无评论

Output Recursively Adaptive (ORA) tree coding of Speech with VAD/CNG 54

Output Recursively Adaptive (ORA) Tree Coding of Speech with...

引用

54th Asilomar Conference on Signals, Systems, and Computers

作者： Oh, Hoontaek Gibson, Jerry D. Univ Calif Santa Barbara Dept Elect & Comp Engn Santa Barbara CA 93106 USA

ISBN: (纸本)9780738131269

We study a new speech coding architecture based on the concept of tree coding along with recursive least squares lattice short term prediction and gradient/autocorrelation based long term prediction algorithms that adapt on the reconstructed output values of the codec, thus substantially reducing the number of parameters to be quantized, coded, and transmitted. The codec uses a perceptually weighted distortion measure similar to the popular analysis-by-synthesis codecs widely deployed today, but the codec differs from current codecs in that the codec is a sliding block analysis-by-synthesis scheme that is nearer waveform coding, which should allow smoother tracking of transitions and the reduction of block based artifacts. Voice activity detection (VAD) and comfort noise generation (CNG) are added to reduce the bit rate and the number of computations required. We present performance comparisons with G.711 using the same VAD/CNG and investigate the performance of a standard long (pitch)/short term predictor structure with a 10th order autoregressive predictor. It is shown that a bit rate reduction of 70 per cent can be achieved while maintaining nearly perceptually equivalent speech quality.

关键词： Speech coding tree coding Predictive coding Backward Adaptive Prediction

来源：评论

学校读者我要写书评

暂无评论

VARIABLE-RATE tree-STRUCTURED VECTOR QUANTIZERS

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 1995年第4期41卷 917-930页

作者： BALAKRISHNAN, M PEARLMAN, WA LU, LG RENSSELAER POLYTECH INST DEPT ELECT COMP & SYST ENGNTROYNY 12180

In general, growth algorithms for optimal tree-structured vector quantizers do not exist. In this paper we show that if the source satisfies certain conditions;namely, that of diminishing marginal returns;optimal growth algorithms do exist. We present such an algorithm and compare its performance with that of other tree growth algorithms. Even for sources that do not meet the necessary conditions for the growth algorithm to be optimal, such as for speech with unknown statistics, it is seen by simulation that the algorithm outperforms other known growth algorithms. For sources that do not satisfy the required conditions, the algorithm presented here can also be used to grow the initial tree for the pruning process. The performance of Such pruned trees is superior to that of trees pruned from full trees of the same rate.

关键词： VECTOR QUANTIZATION tree coding VARIABLE-RATE coding VARIABLE-LENGTH coding

来源：评论

学校读者我要写书评

暂无评论

A Genetic Programming-Driven Data Fitting Method

引用

IEEE ACCESS 2020年 8卷 111448-111459页

作者： Chen, Hao Guo, Zi Yuan Duan, Hong Bai Ban, Duo Xian Univ Posts & Telecommun Sch Comp Sci & Technol Xian 710121 Peoples R China Shaanxi Key Lab Network Data Anal & Intelligent P Xian 710121 Peoples R China

Data fitting is the process of constructing a curve, or a set of mathematical functions, that has the best fit to a series of data points. Different with constructing a fitting model from same type of function, such as the polynomial model, we notice that a hybrid fitting model with multiple types of function may have a better fitting result. Moreover, this also shows better interpretability. However, a perfect smooth hybrid fitting model depends on a reasonable combination of multiple functions and a set of effective parameters. That is a high-dimensional multi-objective optimization problem. This paper proposes a novel data fitting model construction approach. In this approach, the model is expressed by an improved tree coding expression and constructed through an evolution search process driven by the genetic programming. In order to verify the validity of generated hybrid fitting model, 6 prediction problems are chosen for experiment studies. The experimental results show that the proposed method is superior to 7 typical methods in terms of the prediction accuracy and interpretability.

关键词： Fitting Data models Mathematical model Predictive models Computational modeling Encoding Optimization Data fitting hybrid model genetic programming tree coding interpretability

来源：评论

学校读者我要写书评

暂无评论

On the Statistical Physics of Directed Polymers in a Random Medium and Their Relation to tree Codes

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2010年第3期56卷 1345-1350页

作者： Merhav, Neri Technion Israel Inst Technol Dept Elect Engn IL-32000 Haifa Israel

Using well-known results from statistical physics, concerning the almost-sure behavior of the free energy of directed polymers in a random medium, we prove that random tree codes achieve the distortion-rate function, ... 详细信息

关键词： Cayley tree delay directed polymer free energy partition function rate-distortion theory tree coding

来源：评论

学校读者我要写书评

暂无评论

OPTIMAL BIT ALLOCATION VIA THE GENERALIZED BFOS ALGORITHM

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 1991年第2期37卷 400-402页

作者： RISKIN, EA STANFORD UNIV INFORMAT SYST LABSTANFORDCA 94305

The use of the generalized Breiman, Friedman, Olshen, and Stone (BFOS) algorithm, a recently developed technique for variable rate vector quantizer design, for optimal bit allocation is analyzed. It is shown that if e... 详细信息

关键词： BIT ALLOCATION VECTOR QUANTIZATION tree coding

来源：评论

学校读者我要写书评

暂无评论

Practical Random tree Generation: Information-Theoretic Analysis and Applications to IoT

Practical Random Tree Generation: Information-Theoretic Anal...

引用

IEEE Conference on Standards for Communications and Networking (CSCN)

作者： Farzaneh, Amirmohammad Badiu, Mihai-Alin Coon, Justin P. Univ Oxford Dept Engn Sci Oxford England

ISBN: (纸本)9798350395389

tree structures make an appearance in many network related problems, such as network routing. Modelling and simulating the appearance of these data structures can be done using random tree generators. However, there has been very little study on random models that are able to capture the dynamics of networks. We introduce the random spanning tree model, which is a random tree generator that is based on generating a tree from an already existing network topology. The Shannon entropy of this model is then analysed, and upper bounds to it are found. As compression can be beneficial because of the complexity of large trees, we then introduce a universal approach to compressing trees generated using the spanning tree model. It will be shown that the proposed method of compression introduces a redundancy that tends to zero for larger trees. We recommend the use of this random model and the proposed compression algorithm in routing protocols of IoT, as it can contribute to saving routing communication overhead and increasing the overall lifetime of the network.

关键词： Entropy Random trees tree coding tree compression IoT

来源：评论

学校读者我要写书评

暂无评论

treeExplorer: a coding algorithm for rooted trees with application to wireless and ad hoc routing 96

TreeExplorer: a coding algorithm for rooted trees with appli...

引用

IEEE 96th Vehicular Technology Conference (VTC-Fall)

作者： Farzaneh, Amirmohammad Badiu, Mihai-Alin Coon, Justin P. Univ Oxford Dept Engn Sci Oxford England

ISBN: (纸本)9781665454681

Routing tables in ad hoc and wireless routing protocols can be represented using rooted trees. The constant need for communication and storage of these trees in routing protocols demands an efficient rooted tree coding algorithm. This efficiency is defined in terms of the average code length, and the optimality of the algorithm is measured by comparing the average code length with the entropy of the source. In this work, treeExplorer is introduced as an easy-to-implement and nearly optimal algorithm for coding rooted tree structures. This method utilizes the number of leaves of the tree as an indicator for choosing the best method of coding. We show how treeExplorer can improve existing routing protocols for ad hoc and wireless systems, which normally entails a significant communication overhead.

关键词： tree coding routing protocols entropy information theory

来源：评论

学校读者我要写书评

暂无评论

Research on Optimal Modeling of Layout of Square Parts Based on Intelligent Algorithm

Research on Optimal Modeling of Layout of Square Parts Based...

引用

Euro-Asia Conference on Frontiers of Computer Science and Information Technology (FCSIT)

作者： Zhang, Zhuo Zhao, Huan Shi, Yicheng Bao, Shuyuan Zhang, Zhichen Wu, Hongbing Tiangong Univ Tianjin Key Lab Optoelect Detect Technol & Syst Tianjin Peoples R China Tianjin Univ Coll Management & Econ Tianjin Peoples R China Tiangong Univ Sch Comp Sci & Technol Tianjin Peoples R China

ISBN: (纸本)9781665463539

The square parts layout is the most used solution in the current manufacturing industry. The target product is cut through the order layout, and then production is completed after product classification. However, there is a huge contradiction between the production efficiency and personalized production of the current order. In order to increase the production rate and maximize the utilization rate of raw material, the other party layout is required to be carefully optimized to make the production process more fine standards, reduce waste of resources and energy enterprises, to maximize benefits under the premise of meeting orders. For sampling optimization issues, give the best cutting solution, establish a mixed integer planning model, and make reasonable sampling of product items. On the basis of meeting the constraints, the use of board can maximize the utilization rate. Innovatively use the genetic algorithm of tree codes to solve it, and use the tree-like gene encoding to convert into a string gene encoding to obtain the use rate of each data set. In summary, the use of tree coding genetic algorithms to solve the problem to make the cutting of the board more reasonable. At the same time, optimize the order layout plan, speed up the production progress, maximize the benefits, and the waste of resources is reduced on the premise of meeting the order requirements, so as to bring practical benefits to the industrial production of enterprises.

关键词： Mixed integer planning model tree coding genetic algorithms sampling optimization

来源：评论

学校读者我要写书评

暂无评论

Performance improvement with decoder output smoothing in differential predictive coding

Performance improvement with decoder output smoothing in dif...

引用

Information Theory and Applications Workshop (ITA)

作者： Gibson, Jerry D. Bhaskaranand, Malavika Univ Calif Santa Barbara Dept Elect & Comp Engn Santa Barbara CA 93106 USA

ISBN: (纸本)9781479935901

We provide a theoretical analysis of the performance of differential predictive coding using fixed-lag smoothing of the standard decoder output. This performance is compared to related results for coding using latency at the encoder, and causal encoding with delayed decoding, as well as with some prior theoretical analyses of these methods. Surprisingly, it is shown that fixed-lag smoothing of the standard decoder output with causal encoding achieves the asymptotic and finite lag performance promised by a completely reoptimized decoder.

关键词： decoding encoding smoothing methods causal encoding decoder output smoothing delayed decoding differential predictive coding finite lag performance fixed-lag smoothing tree coding Decoding Distortion measurement Encoding Mathematical model Noise Predictive coding Smoothing methods

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：