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

A variable-complexity approach to second-order reliability-based optimization

STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION 2003年第4期25卷 237-250页

作者： Burton, SA Hajela, P Rensselaer Polytech Inst Dept Mech Aerosp & Nucl Engn Troy NY 12180 USA

This paper outlines a new methodology for second-order reliability-based optimization (RBO). A variable-complexity (VC) approach is used to implement a computationally efficient VCRBO algorithm, which reduces the number of costly second-order reliability analyses by using a lower fidelity, scaled mean-value technique during the majority of the constraint assessments. Two numerical examples are presented, which provide a comparison of several standard RBO approaches with the proposed algorithm. The examples include both Gaussian and non-Gaussian uncertainty to introduce significant nonlinearities in the limit state functions (LSFs). The design spaces and LSFs for both examples are presented, along with a discussion of the computational cost associated with the different RBO approaches.

关键词： optimization reliability-based optimization second-order reliability structural reliability variable-complexity

来源：评论

学校读者我要写书评

暂无评论

Exploring the rate-distortion-complexity optimization in neural image compression

引用

JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION 2024年 105卷

作者： Gao, Yixin Feng, Runsen Guo, Zongyu Chen, Zhibo Univ Sci & Technol China Hefei Peoples R China

Despite a short history, neural image codecs have been shown to surpass classical image codecs in terms of rate-distortion performance. However, most of them suffer from significantly longer decoding times, which hinders the practical applications of neural image codecs. This issue is especially pronounced when employing an effective yet time-consuming autoregressive context model since it would increase entropy decoding time by orders of magnitude. In this paper, unlike most previous works that pursue optimal RD performance while temporally overlooking the coding complexity, we make a systematical investigation on the rate-distortioncomplexity (RDC) optimization in neural image compression. By quantifying the decoding complexity as a factor in the optimization goal, we are now able to precisely control the RDC trade-off and then demonstrate how the rate-distortion performance of neural image codecs could adapt to various complexity demands. Going beyond the investigation of RDC optimization, a variable-complexity neural codec is designed to leverage the spatial dependencies adaptively according to industrial demands, which supports fine-grained complexity adjustment by balancing the RDC tradeoff. By implementing this scheme in a powerful base model, we demonstrate the feasibility and flexibility of RDC optimization for neural image codecs.

关键词： Neural image compression Rate-distortion-complexity optimization variable-complexity

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：