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

Combining the Improved RGB water-filling algorithm With Penumbra Removal Technique for Shadow Removal From Digitized Images

引用

IEEE ACCESS 2025年 13卷 57847-57857页

作者： Liu, You-Chang Chuang, Cheng-Ta Natl Taipei Univ Technol Dept Intelligent Automat Engn Taipei 106344 Taiwan

This study proposes a novel and highly efficient approach for the comprehensive removal of shadows from digitized images that is applicable to a broad spectrum of image types, from document scans to natural scenes. The proposed method introduces an RGB water-filling algorithm specifically designed to address soft shadows, optimized with matrix operations and a streamlined processing workflow that substantially enhance the computational efficiency over existing methods. This improved efficiency facilitates real-time applications such as vision systems in automated guided vehicles, which often contend with shadow interference in natural environments. In addition to soft shadows, the proposed method addresses hard shadows, which can severely degrade the image quality and leave residual shadow boundaries that are difficult to eliminate using conventional techniques. To overcome this, the proposed method combines the RGB water-filling algorithm with the penumbra removal technique that not only removes shadow boundaries but also reconstructs the underlying image background. A comparative analysis demonstrates that the proposed method significantly reduces the root mean squared error (RMSE) by 70% and the processing time by 99%, while achieving the highest peak signal-to-noise ratio (PSNR) and structural similarity index measure (SSIM), outperforming previous approaches for both soft and hard shadow removal.

关键词： Mathematical models Light sources Real-time systems Surface topography Image color analysis Autonomous vehicles Surface treatment Lighting filling Depression Image processing shadow shadow removal water-filling algorithm

来源：评论

学校读者我要写书评

暂无评论

Pilot Scheduling based on water-filling algorithm in Massive MIMO 6

Pilot Scheduling based on Water-filling Algorithm in Massive...

引用

IEEE 6th International Conference on Electronics Information and Emergency Communication (ICEIEC)

作者： Zhou, Zhichao Wang, Dong Beijing Jiaotong Univ Inst Informat Sci Beijing Peoples R China Beijing Key Lab Adv Informat Sci & Network Techno Beijing 100044 Peoples R China

ISBN: (纸本)9781509019977

Pilot contamination becomes a bottleneck of performance improvement in massive MIMO (multiple-input-multiple-output) multiple-cell system, due to the signal interference coming from the users that reuse the same pilots in the adjacent cells. Therefore, it is necessary to explore effective approaches to reduce the inter-cell signals interference in order to increase the whole system capacity for massive MIMO. Few former schemes, which are used to mitigate pilot contamination, consider the specific characteristics of the different channels and the interfering degree of different pilots. In this paper, we take these characters into consideration and propose a low-complexity pilot scheduling scheme by applying water-filling algorithm to improve the cell sum-rate. We assign these pilots that are less interference to the users with favourable wireless channel states, and assign severely interfering pilots to the users with inferior channel states. From the perspective of the whole system capacity, pilot contamination can be largely reduced with the proposed scheme, and the system sum-rate can be significantly increased. The simulation results verify the proposed pilot scheduling scheme.

关键词： Massive MIMO pilot contamination reduction pilot scheduling water-filling algorithm system capacity

来源：评论

学校读者我要写书评

暂无评论

A Modified water-filling algorithm of Power Allocation

A Modified Water-Filling Algorithm of Power Allocation

引用

2016 IEEE Information Technology,Networking,Electronic and Automation Control Conference(ITNEC 2016)

作者： Shi Yu Guo Daoxing Lu Lu Duan Xiaopei PLA University of Science and Technology The 94303th Troops The 95806th Troops

ISBN: (纸本)9781467391955

OFDMA is a multiple access based on orthogonal frequency division multiplexing of multi-users. As a method, conventional iterative water-filling algorithm satisfies the convergent condition by constantly closing to the optimum value. Therefore, the application of the algorithm is limited for the huge computations and complex algorithm. Aiming at solving the problem, a modified water-filling algorithm based on limitations of total power and capacity of each subcarrier is proposed. The iterative computations are avoided by the modified algorithm, and the simulation results show that the modified algorithm has a great advantage in complexity of operations compared with conventional iterative water-filling algorithm in the same condition. Meanwhile, the impacts on the two algorithms of the BER and the numbers of subcarriers are discussed.

关键词： OFDMA Power allocation water-filling algorithm

来源：评论

学校读者我要写书评

暂无评论

Spectrum underlay-based water-filling algorithm in cognitive radio networks

Spectrum underlay-based water-filling algorithm in cognitive...

引用

International Conference on Electric Information and Control Engineering

作者： Yutao Liu Liqiang Liu Cong Xu The 54th Research Institute of CETC

ISBN: (纸本)9781424480364

Under the constraint of the interference power for the primary user and the overall transmission power for the cognitive user, we mainly investigate the spectrum sharing problems in a cognitive radio network. According to the interference constraint of the primary user and the water-filling power of the cognitive user, we obtain a monotonic function about the water-level, and then propose a novel power allocation algorithm based on the water-filling theorem. Through which we can not only protect the primary user's QoS, but also obtain the optimal communication utility for the cognitive user. Theory analysis shows that the proposed algorithm can significantly reduce the complexity. Simulation results verify the feasibility and validity of the proposed algorithm.

关键词： Cognitive radio Spectrum sharing Power allocation Interference constraint water-filling algorithm

来源：评论

学校读者我要写书评

暂无评论

A probabilistic linguistic thermodynamic method based on the water-filling algorithm and regret theory for emergency decision making

引用

ECONOMIC RESEARCH-EKONOMSKA ISTRAZIVANJA 2022年第1期36卷 Article: 2076141页

作者： Xue, Wenting Xu, Zeshui Lu, Wuhui Zhejiang Gongshang Univ Sch Stat & Math Hangzhou Peoples R China Sichuan Univ Business Sch Chengdu Sichuan Peoples R China

Since thermodynamics can describe the energy of matter and its form of storage or transformation in the system, it is introduced to resolve the uncertain decision-making problems. The paper proposes the thermodynamic decision-making method which considers both the quantity and quality of the probabilistic linguistic decision information. The analogies for thermodynamical indicators: energy, exergy and entropy are developed under the probabilistic linguistic circumstance. The probabilistic linguistic thermodynamic method combines the regret theory which captures decision makers' regret-aversion and the objective weight of criterion obtained by the water-filling algorithm. The proposed method is applied to select the optimal solution to respond to the floods in Chongqing, China. The self-comparison is conducted to verify the effectiveness of the objective weight obtained by the water-filling algorithm and regret theory in the probabilistic linguistic thermodynamic method. The reliability and feasibility of the proposed method are verified by comparative analysis with other decision-making methods by some simulation experiments and non-parametric tests.

关键词： Probabilistic linguistic term set thermodynamics regret theory water-filling algorithm emergency decision making

来源：评论

学校读者我要写书评

暂无评论

A water-filling PRIMAL-DUAL algorithm FOR APPROXIMATING NONLINEAR COVERING PROBLEMS

引用

SIAM JOURNAL ON DISCRETE MATHEMATICS 2022年第4期36卷 2889-2915页

作者： Fielbaum, Andres Morales, Ignacio Verschae, Jose Delft Univ Technol Delft Netherlands Pontificia Univ Catolica Santiago Chile

Obtaining strong linear relaxations for capacitated covering problems constitutes a significant technical challenge. For one of the most basic cases, the relaxation based on knapsackcover inequalities has an integrality gap of 2. We generalize the setting considering items that can be taken fractionally to cover a given demand, with a cost given by an arbitrary nondecreasing function (not necessarily convex) of the chosen fraction. We generalize the knapsack-cover inequalities and use them to obtain a polynomial (2 + epsilon)-approximation algorithm. Our primal-dual procedure has a natural interpretation as a water-filling algorithm, which overcomes the difficulties implied by having different growth rates in the cost functions: when the cost of an item increases slowly at some superior segment, it carefully increases the priority of all preceding segments. We generalize our algorithm to the Unsplittable Flow-Cover problem on a line, also for fractional items with nonlinear costs. We obtain a 4-approximation in pseudopolynomial time (4 + epsilon in polynomial time),matching the approximation ratio of the classical setting. We also present a rounding algorithm with an approximation guarantee of 2. This result is coupled with a polynomial time separation algorithm that allows solving our linear relaxation up to a loss of a (1 + epsilon) factor.

关键词： knapsack-cover inequalities nonlinear knapsack-cover primal-dual water-filling algorithm

来源：评论

学校读者我要写书评

暂无评论

water-filling Exact Solutions for Load Balancing of Smart Power Grid Systems

引用

IEEE TRANSACTIONS ON SMART GRID 2018年第2期9卷 1397-1407页

作者： He, Peter Li, Mushu Zhao, Lian Venkatesh, Bala Li, Hongwei Ryerson Univ Dept Elect & Comp Engn Toronto ON M5B 2K3 Canada Univ Elect Sci & Technol China Sch Comp Sci & Engn Chengdu 611731 Sichuan Peoples R China

For the demand side management, the elastic power loads can be scheduled to achieve load balancing and to minimize the fluctuation of the overall load. In a process of power supply, the inelastic power loads can be regarded as a group of parameters. Then the demand response can be utilized to realize the optimal allocation of the elastic power loads. Importantly, the power load balancing can reduce the cost from power generations since no cost is spent on the requirement of frequency control. This paper focuses on the optimal allocation of the elastic load for load balancing. A load balancing problem, with the node and the group power upper bound constraints, is investigated in this paper. water-filling algorithm is proposed for exactly and efficiently computing the optimal solutions to the power load balancing optimization problem with lower degree polynomial computational complexity. The proposed algorithm can be applied to solve the target optimization problems with large-scale due to utilization of non-derivative water-filling method. To the best of the authors-knowledge, there is no existing algorithm reported in the open literature that can compute the exact solution to the target problem.

关键词： Demand side management (DSM) energy demand management power load allocation optimal load allocation optimization theory and methods water-filling algorithm

来源：评论

学校读者我要写书评

暂无评论

Resource Allocation Scheme for Cognitive Radio System Based on COFDM Signaling Considering Secondary User's Channel Uncertainty

引用

IETE JOURNAL OF RESEARCH 2013年第5期59卷 466-471页

作者： Hosseini, Elham Falahati, Abolfazi Iran Univ Sci & Technol Dept Elect Engn DCCS Lab Tehran Iran

One of the most important challenges in cognitive radio (CR) system is its robustness against primary user jamming problem. Anti-jamming coding mechanism and distributing power properly among subcarriers has been introduced to overcome this problem. In order to increase system performance and secondary network reliability, radio environment information has to be present for designing CR system. In this paper, the erasure probability (Pr-e,Pr-i) for the secondary user receiver is used to select idle subcarriers and to determine the code rate to make a reliable link to transfer secondary user's data. An adaptive coding rate with a proper bit distribution can decrease the negative impacts of primary user's activity, which may be performed better than employing an unpredictable LT code. Furthermore, a multi-level water-filling algorithm is proposed to assign subcarriers' power in coded orthogonal frequency division multiplexing-based CR system. In this algorithm, the interference channel gain is used as a maximum power mask. Simulation results show that the proposed approach can increase the power efficiency and also, at the same time, it reduces the interference on the primary network.

关键词： Cognitive radio LT code Power control Radio resource allocation water-filling algorithm

来源：评论

学校读者我要写书评

暂无评论

Interference alignment in cognitive radio networks

引用

IET COMMUNICATIONS 2014年第10期8卷 1769-1777页

作者： Rezaei, Fatemeh Tadaion, Aliakbar Yazd Univ Elect & Commun Engn Dept Signal Proc Lab Yazd Iran

A fast algorithm to perform interference alignment (IA) in a cognitive radio network is proposed. Here, the authors consider a network consisting of multiple primary users (PUs) and secondary users (SUs). Although the PUs are cooperating through IA and their rates are maximised by water-filling algorithm, in the secondary network, the authors try to choose the precoding matrices of the SUs such that the interferences at the primary receivers are aligned away from the desired subspaces of the primary receivers. Besides, the interference cancellation of the PUs on the secondary links is considered through designing the post-processing matrices for the secondary links. In this way, their mutual harmful effects are suppressed and SUs could transmit their information simultaneously on the same frequency or time without causing/receiving any interference to/from the primary links. Meanwhile, the feasibility condition for the secondary network regarding the mentioned constraints is investigated. In addition, the rates of the secondary links are maximised by water-filling algorithm. The proposed iterative algorithm is an improved version of minimum weighted leakage interference algorithm with a much faster convergence rate. The analytical results are confirmed through simulations.

关键词： cognitive radio interference suppression precoding iterative methods matrix algebra interference alignment cognitive radio networks IA primary users secondary users PU water-filling algorithm secondary network precoding matrices primary receivers interference cancellation secondary links post-processing matrices mutual harmful effect suppression primary links iterative algorithm minimum weighted leakage interference algorithm convergence rate

来源：评论

学校读者我要写书评

暂无评论

Antenna Selection and Power Allocation for Energy Efficient MIMO Systems

引用

JOURNAL OF COMMUNICATIONS AND NETWORKS 2018年第6期20卷 546-553页

作者： Eskandari, Mandi Doost-Hoseini, Ali Mohamad Jung, Jaehoon Lee, Inkyu Isfahan Univ Technol Dept Elect & Comp Engn Esfahan *** Iran Korea Univ Sch Elect Engn 145 Anam Ro Seoul 02841 South Korea

In this paper, we investigate a new solution for the energy efficiency (EE) maximization and power allocation problem in point-to-point multiple-input multiple-output (MIMO) spatial multiplexing schemes. Different from conventional energy-efficient optimization approaches that require iterative numerical algorithms, we derive an optimal solution in a closed form, which provides an insight upon the relation between the optimum EE and system parameters such as circuit power and channel conditions. In addition, using the proposed closed form function, we present an upper bound on the optimum EE in terms of the full active transmit antennas parameters. Based on the derived upper hound, we also propose a new antenna selection algorithm which achieves almost the same performance as the optimum solution with much reduced complexity.

关键词： Antenna selection energy efficiency multi-antenna systems optimal power allocation water-filling algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：