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

complexity optimization based on the order of coalition formation in cooperative spectrum sensing in cognitive radio networks

引用

JOURNAL OF INDUSTRIAL AND PRODUCTION ENGINEERING 2018年第7期35卷 421-431页

作者： Ji, Xi Liu, Quan Li, Ruifang Xu, Wenjun Wuhan Univ Technol Sch Informat Engn 122 Luoshi Rd Wuhan Hubei Peoples R China

Cognitive radio (CR), an effective method for shortage of spectrum resources and sensing, can be exploited well in manufacturing for communicating with limited spectrums and monitoring equipment and environment. Although cooperative spectrum sensing in CR using coalition formation (CF) games can bring in better sensing quality, it is more complex. In this paper, we study two representative CF algorithms with different orders of CF and then present an enhanced CF algorithm based on the new order of maximum utility for two coalitions, aiming at complexity optimization and remaining sensing quality at the same time. It is certified by analyses and simulations that compared with two CF representative algorithms the improved CF one is simple in complexity and high in sensing quality simultaneously. The improved CF algorithm is also demonstrated to be available for the CRN constantly changing.

关键词： Manufacturing cooperative spectrum sensing coalition formation games complexity optimization the order of coalition formation

来源：评论

学校读者我要写书评

暂无评论

complexity optimization FOR COOPERATIVE SENSING USING COALITION GAMES

引用

9th ASME International Manufacturing Science and Engineering Conference (MSEC2014)

作者： Ji, Xi Liu, Quan Xu, Wenjun Zhang, Duzhong Wuhan Univ Technol Sch Informat Engn Wuhan 430070 Peoples R China Wuhan Univ Technol Key Lab Fiber Opt Sensing Technol & Informat Proc Minist Educ Wuhan 430070 Peoples R China

ISBN: (纸本)9780791845806

Cognitive radio is a far effective method to solve the problem of limited spectrum resources in the wireless communication in cloud manufacturing, involved in kinds of networks. Cooperative spectrum sensing, as a research hotspot in cognitive radio, can improve the sensing quality in cognitive radio networks, but it will also bring in extra cost when forming coalitions and conduct cooperative spectrum sensing. Although CSS based on coalition formation games can significantly conquer this problem by improving the sensing quality and at the same time reducing extra cost, it is much too complex with many nodes. In this paper, we analyze the complexity of the proposed coalition formation (CF) algorithm, and then present an enhanced Selecting SUs and Coalition Formation (SSCF) algorithm where coalition formation and cooperative spectrum sensing is carried out with SUs selected before. In addition, it is shown that SSCF can lower the complexity of CF by reducing the number of nodes for coalition formation while hardly bringing down the sensing quality of CF with at most 0.5% decrease of utility in common case and at average 3% increase of that.

关键词： cooperative spectrum sensing coalition formation games complexity optimization selecting SUs

来源：评论

学校读者我要写书评

暂无评论

Flexible complexity optimization in Multiview Video Coding

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY 2021年第10期31卷 4096-4106页

作者： Xu, Yiwen Xing, Kaiying Liu, Hang Zhao, Tiesong Kwong, Sam Fuzhou Univ Fujian Key Lab Intelligent Proc & Wireless Transm Fuzhou 350108 Peoples R China Peng Cheng Lab Shenzhen 518066 Peoples R China City Univ Hong Kong Dept Comp Sci Hong Kong Peoples R China

Flexible optimization on video coding computational complexity is imperative to adapt to diverse terminals in video streaming, especially with high definition videos and increasingly comprehensive encoders. Until now, few efforts have been contributed to the encoder of multiview videos, which complicates its encoding structure with duplex frame display. To address this issue, we propose a flexible complexity optimization framework in this paper. In the first place, the proposed algorithm flexibly reduces the encoder complexity at different external-defined complexity constraints;furthermore, it is also committed to compression efficiency optimization at different complexity levels. The framework is achieved by a hybrid approach: complexity allocation, which allocates the external-defined complexity constraint to all views, hierarchical layers and frames based on linear programming;and complexity regulation, which dynamically adjusts local candidate partitions to fulfil the targeted local complexity constraint, with a probability-driven Alternate Partition Cost (APC) minimization. The overall algorithm is implemented on the popular multiview encoder, Multiview High Efficiency Video Coding (MV-HEVC), with promising Rate-Distortion (RD) performances at different complexity constraints, which are also superior to two recent complexity optimization algorithms.

关键词： complexity theory Encoding optimization Resource management Image coding Regulation Computational complexity Video coding Multiview High Efficiency Video Coding (MV-HEVC) complexity optimization

来源：评论

学校读者我要写书评

暂无评论

SSIM-Variation-Based complexity optimization for Versatile Video Coding

引用

IEEE SIGNAL PROCESSING LETTERS 2022年 29卷 2617-2621页

作者： Lin, Jielian Lin, Hongbin Zhang, Zhichen Xu, Yiwen Zhao, Tiesong Fuzhou Univ Fujian Key Lab Intelligent Proc & Wireless Transmi Fuzhou 350116 Fujian Peoples R China Peng Cheng Lab Shenzhen 518055 Peoples R China

Hitherto, Versatile Video Coding (VVC) has a more magnificent overall performance than High Efficiency Video Coding (HEVC). The Quadtree with Nested Multi-Type Tree (QTMT) coding block structure can substantially enhance video coding quality in VVC. However, the coding gain also leads to a greater coding complexity. Therefore, this letter proposes a Fast Decision Scheme Based on Structural Similarity Index Metric Variation (FDS-SSIMV) to solve this problem. Firstly, the Structural Similarity Index Metric Variation (SSIMV) characteristic among the sub coding units of the spit mode is illustrated. Next, to evaluate the SSIMV value, SSIMV measure strategies are designed for different split modes in this letter. Then, the desired split modes are selected by the SSIMV values. Experimental results show that the proposed method achieves an average encoding Time Saving (TS) and Bjontegaard Delta Bit Rate (BDBR) with 64.74% and 2.79%, respectively, outperforming the benchmarks.

关键词： Versatile video voding inter prediction supervised contrastive learning complexity optimization

来源：评论

学校读者我要写书评

暂无评论

VVC Intra Coding complexity optimization Based on Early Skipping of the Secondary Transform

引用

IEEE SIGNAL PROCESSING LETTERS 2024年 31卷 366-370页

作者： Wang, Yifan Feng, Shixuan Zhang, Wei Yang, Fuzheng Xidian Univ Sch Telecommun Engn Xian 710071 Peoples R China Peng Cheng Lab Artificial Intelligence Res Ctr Shenzhen 518055 Peoples R China

The new generation video coding standard, H.266/-VVC, brings performance gains while significantly increasing coding complexity. Most of the complexity optimization methods for intra coding focus on reducing the number of prediction modes entering the rate-distortion optimization, but there are few concerning the newly introduced secondary transform. This letter extends the scope of existing studies and provides valuable insights for intra coding complexity optimization based on early skipping of the secondary transform. Specifically, considering the distribution of residuals assessed by coefficients after the primary transform, we propose to skip the secondary transform when the residual variation is relatively flat or the distortion caused by zeroing high-frequency coefficients is significant. Based on this analysis, we establish two skip conditions through statistical analysis and enable efficient decision-making by skipping the unnecessary secondary transform. Experimental results demonstrate the effectiveness of our algorithm, achieving 3.84% and 10.29% reductions in encoding time with only 0.39% and 1.03% increases in Bjontegaard delta bit-rate compared to Fraunhofer Versatile Video Encoder (VVenC)'s medium preset, under random-access (RA) and all-intra (AI) configurations respectively.

关键词： Transforms Encoding complexity theory Kernel optimization Distortion Video coding complexity optimization intra coding secondary transform versatile video coding

来源：评论

学校读者我要写书评

暂无评论

A Performance and complexity optimization of Joint Code and Frame Synchronization for DVB-S2/RCS Mobile

A Performance and Complexity Optimization of Joint Code and ...

引用

5th Advanced Satellite Multimedia Systems Conference / 11th Signal Processing for Space Communications Workshop (ASMS/SPSC)

作者： Gabelli, Giulio Palestini, Claudio Cioni, Stefano Vanelli-Coralli, Alessandro Corazza, Giovanni E. Univ Bologna DEIS ARCES Viale Risorgimento 2 I-40136 Bologna Italy

ISBN: (纸本)9781424468331

This paper analyzes the possibility to perform joint frame synchronization and code acquisition for the DVB-RCS mobile system. Since the standard foresees the adoption of Direct Sequence Spread Spectrum techniques, novel detectors able to cope with the scenario at hand are proposed. Comparison in terms of Mean Acquisition Time and complexity are carried out, and the best solution in terms of performance/complexity tradeoff is identified.

关键词： DVB-RCS mobile system code acquisition codes complexity optimization digital video broadcasting direct sequence spread spectrum techniques joint code-frame synchronization mean acquisition time mobile satellite communication performance optimization spread spectrum communication synchronisation

来源：评论

学校读者我要写书评

暂无评论

Game-theory-based complexity allocation for 360-degree video coding

引用

SIGNAL PROCESSING 2025年 230卷

作者： Lin, Jielian Xing, Kaiying Xu, Yiwen Putian Univ Sch Mech Elect & Informat Engn Putian 351100 Fujian Peoples R China Fuzhou Univ Coll Zhicheng Fuzhou 350108 Fujian Peoples R China Fuzhou Univ Fujian Key Lab Intelligent Proc & Wireless Transmi Fuzhou 350108 Fujian Peoples R China

360-degree video applications with immersive experiences have been well spread in our daily life. However, 360-degree video with high resolution (e.g., 8192x4096,6144x 3072, and 3840 x 1920) leads to high coding computational complexity. To further optimize the complexity allocation and obtain the optimal coding performance, this paper proposes a game-theory-based complexity allocation algorithm for 360-degree video coding. The proposed method first constructs the latitude-level complexity allocation model by introducing game theory. Second, the optimal Lagrange coefficient lambda(& lowast;) value is obtained by the Newton method, and then, the complexity of the latitude can be further obtained. Finally, the overall complexity allocation algorithm is also designed. Experimental results indicate our method obtains Time Saving (TS) with 18.44%similar to 67.08% and BDBR performance with 0.10%similar to 3.11%. The proposed method also achieves the optimal Coding Gain (CG) values for the most global target complexity.

关键词： HEVC complexity optimization Game theory 360-degree video

来源：评论

学校读者我要写书评

暂无评论

Low-complexity Multi-stage method for long-haul optical link anomaly localization using Power Profile Estimation

引用

Optical Fiber Technology 2025年 93卷

作者： Xulong Yan Runzhe Fan Zhudong Shi Yuyang Gao Jichun Ma Xian Zhou University of Science and Technology Beijing Beijing 100083 China Zhongxun Post & Telecommunications Consultation Design Institute Co. Ltd Beijing 100048 China

The Power Profile Estimation (PPE) method, which requires no hardware deployment, is considered a promising solution for optical network automation. However, the high complexity required for high-precision localization limits its practical deployment. This paper proposes a Multi-stage method to reduce complexity while keeping traditional accuracy. For example, in an 80 km × 15 span link, employing the optimal M = 7 for localization with a step size of 0.005 km, the complexity is reduced by approximately 99.96% compared to traditional PPE method of the same precision. This study demonstrates that the Multi-stage method is a reliable and efficient solution, contributing to the advancement of automated optical networks.

关键词： Anomaly position identification complexity optimization Computational complexity Longitudinal power monitoring Optical fiber networks

来源：评论

学校读者我要写书评

暂无评论

Accurate, Very Low Computational complexity Spike Sorting Using Unsupervised Matched Subspace Learning

引用

IEEE TRANSACTIONS ON BIOMEDICAL CIRCUITS AND SYSTEMS 2020年第2期14卷 221-231页

作者： Zamani, Majid Sokolic, Jure Jiang, Dai Renna, Francesco Rodrigues, Miguel R. D. Demosthenous, Andreas UCL Dept Elect & Elect Engn Torrington Pl London WC1E 7JE England UCL Dept Elect & Elect Engn London WC1E 6BT England Metron Doo Ljubljana 1000 Slovenia Univ Porto Fac Ciencias Inst Telecomunicacoes P-4169007 Porto Portugal

This paper presents an adaptable dictionary-based feature extraction approach for spike sorting offering high accuracy and low computational complexity for implantable applications. It extracts and learns identifiable features from evolving subspaces through matched unsupervised subspace filtering. To provide compatibility with the strict constraints in implantable devices such as the chip area and power budget, the dictionary contains arrays of {-1, 0 and 1} and the algorithm need only process addition and subtraction operations. Three types of such dictionary were considered. To quantify and compare the performance of the resulting three feature extractors with existing systems, a neural signal simulator based on several different libraries was developed. For noise levels sigma(N) between 0.05 and 0.3 and groups of 3 to 6 clusters, all three feature extractors provide robust high performance with average classification errors of less than 8% over five iterations, each consisting of 100 generated data segments. To our knowledge, the proposed adaptive feature extractors are the first able to classify reliably 6 clusters for implantable applications. An ASIC implementation of the best performing dictionary-based feature extractor was synthesized in a 65-nm CMOS process. It occupies an area of 0.09 mm(2) and dissipates up to about 10.48 mu W from a 1 V supply voltage, when operating with 8-bit resolution at 30 kHz operating frequency.

关键词： complexity optimization digital ASIC feature extraction implantable devices high performance classification spike sorting subspace tracking unsupervised learning

来源：评论

学校读者我要写书评

暂无评论

Optimizing target selection complexity of a recommendation system by skyline query and multi-criteria decision analysis

引用

JOURNAL OF SUPERCOMPUTING 2020年第8期76卷 6453-6474页

作者： Ke, Chih-Kun Chang, Chiao-Min Natl Taichung Univ Sci & Technol Dept Informat Management 129Sect 3Sanmin Rd Taichung 40401 Taiwan

Various factors related to user consideration cause a target selection problem that may lead users to receive unexpected or confusing results. Traditionally, the recommendation system is constructed to help the user filter out unrelated targets and recommend targets that may be of interest to the user. However, the complexity of target selection requires a more advanced decision-making analysis to offer support. Determining how to optimize the target selection complexity of a recommendation system has become a critical challenge. This study proposes a novel approach using skyline query and multi-criteria decision analysis to recommend Top-ktargets for user selection. Skyline query domination reduces the complexity of target selection by filtering out non-dominant candidates and keeping the dominant candidates for multi-criteria decision analysis. After the skyline query processing, the multi-criteria decision analysis is optimized, producing a Top-kranking order of the candidate targets. The experiment illustrates an empirical case study to verify the effectiveness of the proposed approach. The contribution is optimizing the target selecting complexity of the recommendation system to solve the target selection problem.

关键词： Recommendation system Target selection complexity optimization Skyline query domination Multi-criteria decision analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：