[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
You seem to have javascript disabled. Please note that many of the page functionalities won't work as expected without javascript enabled.
 
 
Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Journals

Article Types

Countries / Regions

Search Results (296)

Search Parameters:
Keywords = ADMM

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
29 pages, 6610 KiB  
Article
Research on Distributed Optimization Scheduling and Its Boundaries in Virtual Power Plants
by Jiaquan Yu, Yanfang Fan and Junjie Hou
Electronics 2025, 14(5), 932; https://doi.org/10.3390/electronics14050932 - 26 Feb 2025
Viewed by 168
Abstract
To improve the operational efficiency of the Virtual Power Plant (VPP) and the effectiveness and reliability of scheduling boundary characterization, this paper proposes a time-decoupled distributed optimization algorithm. First, based on the Lyapunov optimization theory, time decoupling is implemented within the VPP, transforming [...] Read more.
To improve the operational efficiency of the Virtual Power Plant (VPP) and the effectiveness and reliability of scheduling boundary characterization, this paper proposes a time-decoupled distributed optimization algorithm. First, based on the Lyapunov optimization theory, time decoupling is implemented within the VPP, transforming long-term optimization problems into single-period optimization problems, thereby reducing optimization complexity and improving operational efficiency. Second, the Alternating Direction Method of Multipliers (ADMM) framework is used to decompose the optimization problem into multiple subproblems, combined with a hybrid strategy to improve the particle swarm optimization algorithm for solving the problem, thus achieving distributed optimization for the VPP. Finally, to facilitate intra-day interaction between the VPP and the distribution network, the remaining controllable capacity of the VPP’s devices is used as the spinning reserve to address renewable energy fluctuations. A dynamic scheduling boundary model is constructed by introducing wind and solar fluctuation factors. Based on time decoupling and algorithm improvement, the scheduling boundaries are solved and updated on a rolling basis. Simulation results show that, firstly, the time decoupling strategy based on Lyapunov optimization has an error of less than 3%, and the solving time is reduced by 86.11% after decoupling, significantly improving solving efficiency and validating the feasibility and effectiveness of the time decoupling strategy. Secondly, the hybrid strategy-improved particle swarm optimization algorithm achieves improvements in convergence speed and accuracy compared to other algorithms. Finally, the VPP scheduling boundary and scheduling cost characterization times are 115 s and 6.7 s, respectively, effectively meeting the timeliness of VPP and distribution network interaction while ensuring the safety and reliability of the scheduling boundaries. Full article
(This article belongs to the Special Issue Planning, Scheduling and Control of Grids with Renewables)
Show Figures

Figure 1

Figure 1
<p>Virtual Power Plant.</p>
Full article ">Figure 2
<p>Virtual Power Plant Scheduling Process.</p>
Full article ">Figure 3
<p>Distributed optimization design process.</p>
Full article ">Figure 4
<p>Interrelationship between optimization periods.</p>
Full article ">Figure 5
<p>Population Distribution Diagram. (<b>a</b>) Sobol Sequence Initialization; (<b>b</b>) Random Initialization.</p>
Full article ">Figure 6
<p>Interaction Process Between Virtual Power Plant and Distribution Network.</p>
Full article ">Figure 7
<p>Dispatch Boundary Calculation Process of Virtual Power Plant.</p>
Full article ">Figure 8
<p>Wind Power, Photovoltaic Power, Dispatch Commands.</p>
Full article ">Figure 9
<p>Day-Ahead Dispatch Plan of Virtual Power Plant.</p>
Full article ">Figure 10
<p>Time Decoupling Comparison.</p>
Full article ">Figure 11
<p>Comparison of Operating Costs.</p>
Full article ">Figure 12
<p>Average Convergence Curves of Test Functions.</p>
Full article ">Figure 13
<p>Dispatch Boundary of Virtual Power Plant.</p>
Full article ">Figure 14
<p>Costs Associated with Virtual Power Plant Dispatch Boundary.</p>
Full article ">Figure 15
<p>Probability Density Function of Wind–Solar Forecast Errors.</p>
Full article ">Figure 16
<p>Wind–Solar Output Scenarios.</p>
Full article ">
22 pages, 15479 KiB  
Article
ADMM-TransNet: ADMM-Based Sparse-View CT Reconstruction Method Combining Convolution and Transformer Network
by Sukai Wang, Xueqin Sun, Yu Li, Zhiqing Wei, Lina Guo, Yihong Li, Ping Chen and Xuan Li
Tomography 2025, 11(3), 23; https://doi.org/10.3390/tomography11030023 - 26 Feb 2025
Viewed by 169
Abstract
Background: X-ray computed tomography (CT) imaging technology provides high-precision anatomical visualization of patients and has become a standard modality in clinical diagnostics. A widely adopted strategy to mitigate radiation exposure is sparse-view scanning. However, traditional iterative approaches require manual design of regularization priors [...] Read more.
Background: X-ray computed tomography (CT) imaging technology provides high-precision anatomical visualization of patients and has become a standard modality in clinical diagnostics. A widely adopted strategy to mitigate radiation exposure is sparse-view scanning. However, traditional iterative approaches require manual design of regularization priors and laborious parameter tuning, while deep learning methods either heavily depend on large datasets or fail to capture global image correlations. Methods: Therefore, this paper proposes a combination of model-driven and data-driven methods, using the ADMM iterative algorithm framework to constrain the network to reduce its dependence on data samples and introducing the CNN and Transformer model to increase the ability to learn the global and local representation of images, further improving the accuracy of the reconstructed image. Results: The quantitative and qualitative results show the effectiveness of our method for sparse-view reconstruction compared with the current most advanced reconstruction algorithms, achieving a PSNR of 42.036 dB, SSIM of 0.979, and MAE of 0.011 at 32 views. Conclusions: The proposed algorithm has effective capability in sparse-view CT reconstruction. Compared with other deep learning algorithms, the proposed algorithm has better generalization and higher reconstruction accuracy. Full article
Show Figures

Figure 1

Figure 1
<p>The overall structure of our proposed ADMM-TransNet.</p>
Full article ">Figure 2
<p>Architecture of the encoder–decoder Transformer.</p>
Full article ">Figure 3
<p>Comparative reconstruction results obtained from 32-view imaging data. The ground truth image is compared against FBP, ADMM, FBPConvnet, LEARN, Trans-CT, ADMM-SVnet, and ADMM-TransNet. The display window is [−150, 250] HU in size.</p>
Full article ">Figure 4
<p>The intensity profiles along the yellow solid line in CT reconstructed images (from 32 views using (<b>b</b>) FBP, (<b>c</b>) ADMM (<b>d</b>) FBPConvNet, (<b>e</b>) LEARN, (<b>f</b>) Trans-CT (<b>g</b>) ADMM-SVnet, and (<b>h</b>) Ours).</p>
Full article ">Figure 5
<p>Comparative reconstruction results obtained from 64-view imaging data. The ground truth image is compared against FBP, ADMM, FBPConvnet, LEARN, Trans-CT, ADMM-SVnet, and ADMM-TransNet. The display window is [−150, 250] HU in size.</p>
Full article ">Figure 6
<p>The intensity profiles along the yellow solid line in CT reconstructed images (from 64 views using (<b>b</b>) FBP, (<b>c</b>) ADMM (<b>d</b>) FBPConvNet, (<b>e</b>) LEARN, (<b>f</b>) Trans-CT (<b>g</b>) ADMM-SVnet, and (<b>h</b>) Ours).</p>
Full article ">Figure 7
<p>Comparative reconstruction results obtained from 128-view imaging data. The ground truth image is compared against FBP, ADMM, FBPConvnet, LEARN, Trans-CT, ADMM-SVnet, and ADMM-TransNet. The display window is [−200, 300] HU in size.</p>
Full article ">Figure 8
<p>The intensity profiles along the yellow solid line in CT reconstructed images (from 128 views using (<b>b</b>) FBP, (<b>c</b>) ADMM (<b>d</b>) FBPConvNet, (<b>e</b>) LEARN, (<b>f</b>) Trans-CT (<b>g</b>) ADMM-SVnet, and (<b>h</b>) Ours).</p>
Full article ">Figure 9
<p>Model structure selection based on quantitative measures of the RMSE and SSIM as evaluated on the test dataset during training.</p>
Full article ">Figure 10
<p>Reconstructed results (32-views) under different noise levels. (<b>a</b>) The ground truth image. From (<b>b</b>–<b>f</b>): <span class="html-italic">I</span><sub>0</sub> = 1 × 10<sup>7</sup>, <span class="html-italic">I</span><sub>0</sub> = 5 × 10<sup>6</sup>, <span class="html-italic">I</span><sub>0</sub> = 1 × 10<sup>6</sup>, <span class="html-italic">I</span><sub>0</sub> = 5 × 10<sup>6</sup>, and <span class="html-italic">I</span><sub>0</sub> = 1 × 10<sup>5</sup>. The display window is [−150, 250] HU in size.</p>
Full article ">Figure 11
<p>Absolute residuals between the reconstruction results and the reference image corresponding to <a href="#tomography-11-00023-f010" class="html-fig">Figure 10</a>. From (<b>a</b>–<b>e</b>): I<sub>0</sub> = 1 × 10<sup>7</sup>, I<sub>0</sub> = 5 × 10<sup>6</sup>, I<sub>0</sub> = 1 × 10<sup>6</sup>, I<sub>0</sub> = 5 × 10<sup>6</sup>, and I<sub>0</sub> = 1 × 10<sup>5</sup>.</p>
Full article ">
33 pages, 9871 KiB  
Article
Energy Trading Strategy for Virtual Power Plants with Incomplete Resource Aggregation Based on Hybrid Game Theory
by Jing Wan, Jinrui Tang, Rui Chen, Leiming Suo, Honghui Yang, Yubo Song and Haibo Zhang
Appl. Sci. 2025, 15(4), 2100; https://doi.org/10.3390/app15042100 - 17 Feb 2025
Viewed by 261
Abstract
Shared energy storage (SES) and some photovoltaic prosumers (PVPs) are difficult to aggregate by the virtual power plant (VPP) in the short term. In order to realize the optimal operation of the VPP in the incomplete resource aggregation environment and to promote the [...] Read more.
Shared energy storage (SES) and some photovoltaic prosumers (PVPs) are difficult to aggregate by the virtual power plant (VPP) in the short term. In order to realize the optimal operation of the VPP in the incomplete resource aggregation environment and to promote the mutual benefit of multiple market entities, the energy trading strategy based on the hybrid game of SES–VPP–PVP is proposed. Firstly, the whole system configuration with incomplete resource aggregation is proposed, as well as the preconfigured market rules and the general problem for the optimal energy trading strategy of VPP. Secondly, the novel hybrid game theory-based optimization for the energy trading strategy of VPP is proposed based on the multi-level game theory model. And, the corresponding solving process using Karush–Kuhn–Tucker (KKT), dichotomy, and alternating direction method of multipliers (ADMM) algorithms are also constructed to solve nonconvex nonlinear models. The effectiveness of the proposed strategy is verified through the comparison of a large number of simulation results. The results show that our proposed energy trading strategy can be used for optimal low-carbon operation of VPPs with large-scale renewable energy and some unaggregated electricity consumers and distributed photovoltaic stations, while SES participates as an independent market entity. Full article
(This article belongs to the Special Issue Design, Optimization and Control Strategy of Smart Grids)
Show Figures

Figure 1

Figure 1
<p>Overall framework of the day-ahead trading model for VPPs.</p>
Full article ">Figure 2
<p>Multi-layer optimization model of energy trading for VPP based on mixed game theory.</p>
Full article ">Figure 3
<p>Whole mixed game-solving process for our proposed energy trading strategy.</p>
Full article ">Figure 4
<p>State of charge–discharge power and electric quantity of SES.</p>
Full article ">Figure 5
<p>Purchase and sale price of electricity between SES and VPP.</p>
Full article ">Figure 6
<p>VPP optimization results: (<b>a</b>) VPP electric load balance; (<b>b</b>) VPP heat load balance.</p>
Full article ">Figure 6 Cont.
<p>VPP optimization results: (<b>a</b>) VPP electric load balance; (<b>b</b>) VPP heat load balance.</p>
Full article ">Figure 7
<p>PVP1 optimization results: (<b>a</b>) PVP1 electric load balance; (<b>b</b>) PVP1 heat load balance.</p>
Full article ">Figure 7 Cont.
<p>PVP1 optimization results: (<b>a</b>) PVP1 electric load balance; (<b>b</b>) PVP1 heat load balance.</p>
Full article ">Figure 8
<p>Power purchase price between VPP and PVP for PVP1.</p>
Full article ">Figure 9
<p>Heat purchase price between VPP and PVP for PVP1.</p>
Full article ">Figure 10
<p>Results of electrical energy interactions between PVP members for PVP1.</p>
Full article ">Figure 11
<p>Interaction tariffs between PVP members.</p>
Full article ">Figure A1
<p>PVP1 electric heating load and PV output.</p>
Full article ">Figure A2
<p>PVP2 electric heating load and PV output.</p>
Full article ">Figure A3
<p>PVP3 electric heating load and PV output.</p>
Full article ">Figure A4
<p>VPP electric heat load and renewable energy output.</p>
Full article ">Figure A5
<p>PVP2 optimization results: (<b>a</b>) PVP2 electric balance; (<b>b</b>) PVP2 heat balance.</p>
Full article ">Figure A6
<p>PVP3 optimization results: (<b>a</b>) PVP3 electric balance; (<b>b</b>) PVP3 heat balance.</p>
Full article ">
24 pages, 11822 KiB  
Article
Electricity Data Quality Enhancement Strategy Based on Low-Rank Matrix Recovery
by Guo Xu, Xinliang Teng, Lei Zhang and Jianjun Xu
Energies 2025, 18(4), 944; https://doi.org/10.3390/en18040944 - 16 Feb 2025
Viewed by 268
Abstract
Electricity consumption data form the foundation for the efficient and reliable operation of smart grids and are a critical component for ensuring effective data mining. However, due to factors such as meter failures and extreme weather conditions, anomalies frequently occur in the data, [...] Read more.
Electricity consumption data form the foundation for the efficient and reliable operation of smart grids and are a critical component for ensuring effective data mining. However, due to factors such as meter failures and extreme weather conditions, anomalies frequently occur in the data, which adversely impact the performance of data-driven applications. Given the near full-rank nature of low-voltage distribution area electricity consumption data, this paper employs clustering to enhance the low-rank property of the data. Addressing common issues such as missing data, sparse noise, and Gaussian noise in electricity consumption data, this paper proposes a multi-norm optimization model based on low-rank matrix theory. Specifically, the truncated nuclear norm is used as an approximation of matrix rank, while the L1-norm and F-norm are employed to constrain sparse noise and Gaussian noise, respectively. The model is solved using the Alternating Direction Method of Multipliers (ADMM), achieving a unified framework for handling missing data and noise processing within the model construction. Comparative experiments on both synthetic and real-world datasets demonstrate that the proposed method can accurately recover measurement data under various noise contamination scenarios and different distributions of missing data. Moreover, it effectively separates principal components of the data from noise contamination. Full article
(This article belongs to the Special Issue Artificial Intelligence Technologies Applied to Smart Grids)
Show Figures

Figure 1

Figure 1
<p>Common data missing and noisy scenarios.</p>
Full article ">Figure 2
<p>Singular values of electricity consumption data matrix for different number of users in 30 days.</p>
Full article ">Figure 3
<p>Singular values of electricity consumption data matrix of 500 users under different time windows.</p>
Full article ">Figure 4
<p>Framework diagram of low-rank matrix data repair strategy based on clustering and truncation nuclear norm.</p>
Full article ">Figure 5
<p>Matrix element decomposition of electricity consumption data in low-voltage station area.</p>
Full article ">Figure 6
<p>Tuning of the regularization parameter <math display="inline"><semantics> <mi>δ</mi> </semantics></math>.</p>
Full article ">Figure 7
<p>(<b>a</b>) Comparison of the Root Mean Squared Error (RMSE) of different methods on the synthetic matrix under various missing rates. (<b>b</b>) Box plot of the mean and standard deviation of RMSE for TNN over 50 runs under different missing rates.</p>
Full article ">Figure 8
<p>(<b>a</b>) RMSE under varying matrix dimensions, <math display="inline"><semantics> <mrow> <mi>r</mi> <mo>=</mo> <mn>3</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>σ</mi> <mo>=</mo> <mn>0.1</mn> </mrow> </semantics></math>. (<b>b</b>) RMSE under varying matrix ranks, <math display="inline"><semantics> <mrow> <mi>m</mi> <mo>=</mo> <mi>n</mi> <mo>=</mo> <mn>300</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>σ</mi> <mo>=</mo> <mn>0.1</mn> </mrow> </semantics></math>. (<b>c</b>) RMSE under varying noise levels, <math display="inline"><semantics> <mrow> <mi>m</mi> <mo>=</mo> <mi>n</mi> <mo>=</mo> <mn>300</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>r</mi> <mo>=</mo> <mn>3</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 9
<p>Recovery accuracy (RMSE and RRE) of different methods under various random missing rates without noise.</p>
Full article ">Figure 10
<p>Recovery performance of electricity consumption data for one user over 30 days at a 20% missing rate without noise.</p>
Full article ">Figure 11
<p>Recovery accuracy (RMSE and RRE) of different methods under various continuous missing intervals without noise.</p>
Full article ">Figure 12
<p>Noise separation performance for Gaussian and impulse noise without missing data.</p>
Full article ">Figure 13
<p>Comparison of Data Recovery Performance Under Mixed Noise and Different Random Missing Rates.</p>
Full article ">Figure 14
<p>Comparison of data recovery performance under mixed noise and different continuous missing intervals.</p>
Full article ">
28 pages, 5483 KiB  
Review
Constrained Pulse Radar Waveform Design Based on Optimization Theory
by Jianwei Wu, Jiawei Zhang and Yifan Chen
Sensors 2025, 25(4), 1203; https://doi.org/10.3390/s25041203 - 16 Feb 2025
Viewed by 177
Abstract
Radar is utilized as an active sensing device across many fields. Its waveform optimization is responsible for target signature extraction, profoundly influencing the overall performance. First, the principle of pulse radar waveform design is explored. Waveform design strategies vary based on target models, [...] Read more.
Radar is utilized as an active sensing device across many fields. Its waveform optimization is responsible for target signature extraction, profoundly influencing the overall performance. First, the principle of pulse radar waveform design is explored. Waveform design strategies vary based on target models, whether point-like or extended ones, and are often formulated as high-dimensional, non-convex optimization problems with multiple constraints, such as energy, constant modulus, and sidelobe ratios. Second, to address them, techniques like alternating direction method of multipliers (ADMM), semidefinite relaxation (SDR), and minimization-maximization (MM) algorithms are widely employed. Finally, challenges in multimodal sensing collaborative detection, joint multi-tasking, sparse signal recovery, and intelligent perception highlight the need for innovative solutions to meet future demands. Full article
Show Figures

Figure 1

Figure 1
<p>The principle of radar transmit-receive operation.</p>
Full article ">Figure 2
<p>Schematic diagram of radar waveform design.</p>
Full article ">Figure 3
<p>Point-like target: (<b>a</b>) optical image of a metal sphere, (<b>b</b>) the model of an ideal metal sphere, and (<b>c</b>) its ISAR image.</p>
Full article ">Figure 4
<p>Extended targets: (<b>a</b>) optical image of a Boeing 737 aircraft, (<b>b</b>) the model of an ideal Boeing 737 aircraft, and (<b>c</b>) its ISAR image.</p>
Full article ">Figure 5
<p>Feature analysis with different signals: (<b>a</b>) spectrum of the LFM waveform, (<b>b</b>) time-frequency characteristics of the LFM waveform, (<b>c</b>) correlation function of the LFM waveform, (<b>d</b>) spectrum of the SF waveform, (<b>e</b>) time-frequency characteristics of the SF waveform, (<b>f</b>) correlation function of the SF waveform, (<b>g</b>) spectrum of the NLFM waveform, (<b>h</b>) time-frequency characteristics of the NLFM waveform, and (<b>i</b>) correlation function of the NLFM waveform.</p>
Full article ">Figure 6
<p>The spectra of the interference and the optimal waveform: (<b>a</b>) waveform spectra, (<b>b</b>) corresponding time series.</p>
Full article ">Figure 7
<p>SAR images with different waveforms: (<b>a</b>) the weighted LFM signal, (<b>b</b>) the classical LFM signal, and (<b>c</b>) the classical P4 sequence.</p>
Full article ">Figure 8
<p>Partial 3-D and 2-D AF of the proposed waveform and LFMW: (<b>a</b>) 3-D AF of the designed waveform, (<b>b</b>) 2-D AF of the designed waveform, (<b>c</b>) 3-D AF of LFMW, and (<b>d</b>) 2-D AF of LFMW. <math display="inline"><semantics> <mrow> <mo>Δ</mo> <mi>t</mi> </mrow> </semantics></math>, <span class="html-italic">D</span>, and <math display="inline"><semantics> <mi>τ</mi> </semantics></math> represent time delay, Doppler frequency shift, and duration, respectively.</p>
Full article ">Figure 9
<p>Correlation levels of the CAN(G), m- and random-phase sequences of length <span class="html-italic">N</span> = 127, designed under the ISLR metric: (<b>a</b>) the CAN(G) and m-sequences, (<b>b</b>) the CAN(G) and random-phase sequences.</p>
Full article ">Figure 10
<p>The ISLR of the CAN sequences (with length <span class="html-italic">N</span> = 256 and initialized either randomly or by P4) versus <math display="inline"><semantics> <mi>ρ</mi> </semantics></math>.</p>
Full article ">Figure 11
<p>ESDs of designed waveforms versus varied <math display="inline"><semantics> <msub> <mi>E</mi> <mi>I</mi> </msub> </semantics></math>, where the stopbands are shaded in light gray.</p>
Full article ">Figure 12
<p>Similarity constraints under different parameters.</p>
Full article ">Figure 13
<p>Ambiguity function with different similarity parameters: (<b>a</b>) <math display="inline"><semantics> <mi>ε</mi> </semantics></math> = 0.3, (<b>b</b>) <math display="inline"><semantics> <mi>ε</mi> </semantics></math> = 0.6, and (<b>c</b>) <math display="inline"><semantics> <mi>ε</mi> </semantics></math> = 1.0.</p>
Full article ">Figure 14
<p>Objective function and surrogate function of subproblem versus iteration step: (<b>a</b>) <math display="inline"><semantics> <mrow> <msub> <mi>f</mi> <mn>1</mn> </msub> <mrow> <mo>(</mo> <mi mathvariant="bold">x</mi> <mo>)</mo> </mrow> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <msub> <mi>g</mi> <mn>1</mn> </msub> <mrow> <mo>(</mo> <mi mathvariant="bold">x</mi> <mo>;</mo> <msub> <mi mathvariant="bold">x</mi> <mi>t</mi> </msub> <mo>)</mo> </mrow> </mrow> </semantics></math>, (<b>b</b>) <math display="inline"><semantics> <mrow> <msub> <mi>f</mi> <mn>2</mn> </msub> <mrow> <mo>(</mo> <mi mathvariant="bold">m</mi> <mo>)</mo> </mrow> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <msub> <mi>g</mi> <mn>2</mn> </msub> <mrow> <mo>(</mo> <mi mathvariant="bold">m</mi> <mo>;</mo> <msub> <mi mathvariant="bold">m</mi> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </msub> <mo>)</mo> </mrow> </mrow> </semantics></math>, and (<b>c</b>) <math display="inline"><semantics> <mrow> <msub> <mi>f</mi> <mn>3</mn> </msub> <mrow> <mo>(</mo> <mi mathvariant="bold">w</mi> <mo>)</mo> </mrow> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <msub> <mi>g</mi> <mn>3</mn> </msub> <mrow> <mo>(</mo> <mi mathvariant="bold">w</mi> <mo>;</mo> <msub> <mi mathvariant="bold">w</mi> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </msub> <mo>)</mo> </mrow> </mrow> </semantics></math>.</p>
Full article ">Figure 15
<p>Time consuming of ADMM, SDR, and MM algorithms.</p>
Full article ">
25 pages, 12377 KiB  
Article
Exploiting Weighted Multidirectional Sparsity for Prior Enhanced Anomaly Detection in Hyperspectral Images
by Jingjing Liu, Jiashun Jin, Xianchao Xiu, Wanquan Liu and Jianhua Zhang
Remote Sens. 2025, 17(4), 602; https://doi.org/10.3390/rs17040602 - 10 Feb 2025
Viewed by 380
Abstract
Anomaly detection (AD) is an important topic in remote sensing, aiming to identify unusual or abnormal features within the data. However, most existing low-rank representation methods usually use the nuclear norm for background estimation, and do not consider the different contributions of different [...] Read more.
Anomaly detection (AD) is an important topic in remote sensing, aiming to identify unusual or abnormal features within the data. However, most existing low-rank representation methods usually use the nuclear norm for background estimation, and do not consider the different contributions of different singular values. Besides, they overlook the spatial relationships of abnormal regions, particularly failing to fully leverage the 3D structured information of the data. Moreover, noise in practical scenarios can disrupt the low-rank structure of the background, making it challenging to separate anomaly from the background and ultimately reducing detection accuracy. To address these challenges, this paper proposes a weighted multidirectional sparsity regularized low-rank tensor representation method (WMS-LRTR) for AD. WMS-LRTR uses the weighted tensor nuclear norm for background estimation to characterize the low-rank property of the background. Considering the correlation between abnormal pixels across different dimensions, the proposed method introduces a novel weighted multidirectional sparsity (WMS) by unfolding anomaly into multimodal to better exploit the sparsity of the anomaly. In order to improve the robustness of AD, we further embed a user-friendly plug-and-play (PnP) denoising prior to optimize the background modeling under low-rank structure and facilitate the separation of sparse anomalous regions. Furthermore, an effective iterative algorithm using alternate direction method of multipliers (ADMM) is introduced, whose subproblems can be solved quickly by fast solvers or have closed-form solutions. Numerical experiments on various datasets show that WMS-LRTR outperforms state-of-the-art AD methods, demonstrating its better detection ability. Full article
Show Figures

Figure 1

Figure 1
<p>The illustration of the proposed method.</p>
Full article ">Figure 2
<p>The schematic diagram of the proposed weighted multidirectional sparsity.</p>
Full article ">Figure 3
<p>The detection maps on (<b>a</b>) Airport-1, (<b>b</b>) Airport-2, (<b>c</b>) Airport-3, (<b>d</b>) Airport-4, (<b>e</b>) Beach-1, (<b>f</b>) Beach-2, (<b>g</b>) Beach-3, (<b>h</b>) Beach-4, (<b>i</b>) Urban-1, (<b>j</b>) Urban-2, (<b>k</b>) Urban-3, (<b>l</b>) Urban-4, and (<b>m</b>) Urban-5.</p>
Full article ">Figure 4
<p>The <math display="inline"><semantics> <msub> <mi>AUC</mi> <mrow> <mo>(</mo> <mrow> <mi mathvariant="normal">D</mi> <mo>,</mo> <mi mathvariant="normal">F</mi> </mrow> <mo>)</mo> </mrow> </msub> </semantics></math> values of (<b>a</b>) <math display="inline"><semantics> <mrow> <mi>λ</mi> <mo>/</mo> <mi>μ</mi> </mrow> </semantics></math> on Urban-3, (<b>b</b>) <math display="inline"><semantics> <mrow> <mi>λ</mi> <mo>/</mo> <mi>μ</mi> </mrow> </semantics></math> on Urban-4, (<b>c</b>) <math display="inline"><semantics> <mrow> <mi>λ</mi> <mo>/</mo> <mi>μ</mi> </mrow> </semantics></math> on Urban-5, (<b>d</b>) <math display="inline"><semantics> <mrow> <mi>λ</mi> <mo>/</mo> <mi>β</mi> </mrow> </semantics></math> on Urban-3, (<b>e</b>) <math display="inline"><semantics> <mrow> <mi>λ</mi> <mo>/</mo> <mi>β</mi> </mrow> </semantics></math> on Urban-4, and (<b>f</b>) <math display="inline"><semantics> <mrow> <mi>λ</mi> <mo>/</mo> <mi>β</mi> </mrow> </semantics></math> on Urban-5.</p>
Full article ">Figure 5
<p>The spectral dimension selection on <math display="inline"><semantics> <mrow> <mo>(</mo> <mi mathvariant="bold">a</mi> <mo>)</mo> </mrow> </semantics></math> the Airport scenes, <math display="inline"><semantics> <mrow> <mo>(</mo> <mi mathvariant="bold">b</mi> <mo>)</mo> </mrow> </semantics></math> the Beach scenes, <math display="inline"><semantics> <mrow> <mo>(</mo> <mi mathvariant="bold">c</mi> <mo>)</mo> </mrow> </semantics></math> the Urban scenes.</p>
Full article ">Figure 6
<p>The ROC curves on the Airport-1 dataset. (<b>a</b>) ROC curves of (<math display="inline"><semantics> <msub> <mi>P</mi> <mi>D</mi> </msub> </semantics></math>, <math display="inline"><semantics> <msub> <mi>P</mi> <mi>F</mi> </msub> </semantics></math>), (<b>b</b>) ROC curves of (<math display="inline"><semantics> <msub> <mi>P</mi> <mi>D</mi> </msub> </semantics></math>, <math display="inline"><semantics> <mi>τ</mi> </semantics></math>), (<b>c</b>) ROC curves of (<math display="inline"><semantics> <msub> <mi>P</mi> <mi>F</mi> </msub> </semantics></math>, <math display="inline"><semantics> <mi>τ</mi> </semantics></math>), and (<b>d</b>) ROC curves of (<math display="inline"><semantics> <msub> <mi>P</mi> <mi>D</mi> </msub> </semantics></math>, <math display="inline"><semantics> <mi>τ</mi> </semantics></math>, <math display="inline"><semantics> <msub> <mi>P</mi> <mi>F</mi> </msub> </semantics></math>).</p>
Full article ">Figure 7
<p>The ROC curves on the Airport-2 dataset. (<b>a</b>) ROC curves of (<math display="inline"><semantics> <msub> <mi>P</mi> <mi>D</mi> </msub> </semantics></math>, <math display="inline"><semantics> <msub> <mi>P</mi> <mi>F</mi> </msub> </semantics></math>), (<b>b</b>) ROC curves of (<math display="inline"><semantics> <msub> <mi>P</mi> <mi>D</mi> </msub> </semantics></math>, <math display="inline"><semantics> <mi>τ</mi> </semantics></math>), (<b>c</b>) ROC curves of (<math display="inline"><semantics> <msub> <mi>P</mi> <mi>F</mi> </msub> </semantics></math>, <math display="inline"><semantics> <mi>τ</mi> </semantics></math>), and (<b>d</b>) ROC curves of (<math display="inline"><semantics> <msub> <mi>P</mi> <mi>D</mi> </msub> </semantics></math>, <math display="inline"><semantics> <mi>τ</mi> </semantics></math>, <math display="inline"><semantics> <msub> <mi>P</mi> <mi>F</mi> </msub> </semantics></math>).</p>
Full article ">Figure 8
<p>The ROC curves on the Beach-2 dataset. (<b>a</b>) ROC curves of (<math display="inline"><semantics> <msub> <mi>P</mi> <mi>D</mi> </msub> </semantics></math>, <math display="inline"><semantics> <msub> <mi>P</mi> <mi>F</mi> </msub> </semantics></math>), (<b>b</b>) ROC curves of (<math display="inline"><semantics> <msub> <mi>P</mi> <mi>D</mi> </msub> </semantics></math>, <math display="inline"><semantics> <mi>τ</mi> </semantics></math>), (<b>c</b>) ROC curves of (<math display="inline"><semantics> <msub> <mi>P</mi> <mi>F</mi> </msub> </semantics></math>, <math display="inline"><semantics> <mi>τ</mi> </semantics></math>), and (<b>d</b>) ROC curves of (<math display="inline"><semantics> <msub> <mi>P</mi> <mi>D</mi> </msub> </semantics></math>, <math display="inline"><semantics> <mi>τ</mi> </semantics></math>, <math display="inline"><semantics> <msub> <mi>P</mi> <mi>F</mi> </msub> </semantics></math>).</p>
Full article ">Figure 9
<p>The ROC curves on the Beach-3 dataset. (<b>a</b>) ROC curves of (<math display="inline"><semantics> <msub> <mi>P</mi> <mi>D</mi> </msub> </semantics></math>, <math display="inline"><semantics> <msub> <mi>P</mi> <mi>F</mi> </msub> </semantics></math>), (<b>b</b>) ROC curves of (<math display="inline"><semantics> <msub> <mi>P</mi> <mi>D</mi> </msub> </semantics></math>, <math display="inline"><semantics> <mi>τ</mi> </semantics></math>), (<b>c</b>) ROC curves of (<math display="inline"><semantics> <msub> <mi>P</mi> <mi>F</mi> </msub> </semantics></math>, <math display="inline"><semantics> <mi>τ</mi> </semantics></math>), and (<b>d</b>) ROC curves of (<math display="inline"><semantics> <msub> <mi>P</mi> <mi>D</mi> </msub> </semantics></math>, <math display="inline"><semantics> <mi>τ</mi> </semantics></math>, <math display="inline"><semantics> <msub> <mi>P</mi> <mi>F</mi> </msub> </semantics></math>).</p>
Full article ">Figure 10
<p>The ROC curves on the Urban-1 dataset. (<b>a</b>) ROC curves of (<math display="inline"><semantics> <msub> <mi>P</mi> <mi>D</mi> </msub> </semantics></math>, <math display="inline"><semantics> <msub> <mi>P</mi> <mi>F</mi> </msub> </semantics></math>), (<b>b</b>) ROC curves of (<math display="inline"><semantics> <msub> <mi>P</mi> <mi>D</mi> </msub> </semantics></math>, <math display="inline"><semantics> <mi>τ</mi> </semantics></math>), (<b>c</b>) ROC curves of (<math display="inline"><semantics> <msub> <mi>P</mi> <mi>F</mi> </msub> </semantics></math>, <math display="inline"><semantics> <mi>τ</mi> </semantics></math>), and (<b>d</b>) ROC curves of (<math display="inline"><semantics> <msub> <mi>P</mi> <mi>D</mi> </msub> </semantics></math>, <math display="inline"><semantics> <mi>τ</mi> </semantics></math>, <math display="inline"><semantics> <msub> <mi>P</mi> <mi>F</mi> </msub> </semantics></math>).</p>
Full article ">Figure 11
<p>The ROC curves on the Urban-2 dataset. (<b>a</b>) ROC curves of (<math display="inline"><semantics> <msub> <mi>P</mi> <mi>D</mi> </msub> </semantics></math>, <math display="inline"><semantics> <msub> <mi>P</mi> <mi>F</mi> </msub> </semantics></math>), (<b>b</b>) ROC curves of (<math display="inline"><semantics> <msub> <mi>P</mi> <mi>D</mi> </msub> </semantics></math>, <math display="inline"><semantics> <mi>τ</mi> </semantics></math>), (<b>c</b>) ROC curves of (<math display="inline"><semantics> <msub> <mi>P</mi> <mi>F</mi> </msub> </semantics></math>, <math display="inline"><semantics> <mi>τ</mi> </semantics></math>), and (<b>d</b>) ROC curves of (<math display="inline"><semantics> <msub> <mi>P</mi> <mi>D</mi> </msub> </semantics></math>, <math display="inline"><semantics> <mi>τ</mi> </semantics></math>, <math display="inline"><semantics> <msub> <mi>P</mi> <mi>F</mi> </msub> </semantics></math>).</p>
Full article ">Figure 12
<p>The ROC curves on the Urban-3 dataset. (<b>a</b>) ROC curves of (<math display="inline"><semantics> <msub> <mi>P</mi> <mi>D</mi> </msub> </semantics></math>, <math display="inline"><semantics> <msub> <mi>P</mi> <mi>F</mi> </msub> </semantics></math>), (<b>b</b>) ROC curves of (<math display="inline"><semantics> <msub> <mi>P</mi> <mi>D</mi> </msub> </semantics></math>, <math display="inline"><semantics> <mi>τ</mi> </semantics></math>), (<b>c</b>) ROC curves of (<math display="inline"><semantics> <msub> <mi>P</mi> <mi>F</mi> </msub> </semantics></math>, <math display="inline"><semantics> <mi>τ</mi> </semantics></math>), and (<b>d</b>) ROC curves of (<math display="inline"><semantics> <msub> <mi>P</mi> <mi>D</mi> </msub> </semantics></math>, <math display="inline"><semantics> <mi>τ</mi> </semantics></math>, <math display="inline"><semantics> <msub> <mi>P</mi> <mi>F</mi> </msub> </semantics></math>).</p>
Full article ">Figure 13
<p>The ROC curves on the Urban-4 dataset. (<b>a</b>) ROC curves of (<math display="inline"><semantics> <msub> <mi>P</mi> <mi>D</mi> </msub> </semantics></math>, <math display="inline"><semantics> <msub> <mi>P</mi> <mi>F</mi> </msub> </semantics></math>), (<b>b</b>) ROC curves of (<math display="inline"><semantics> <msub> <mi>P</mi> <mi>D</mi> </msub> </semantics></math>, <math display="inline"><semantics> <mi>τ</mi> </semantics></math>), (<b>c</b>) ROC curves of (<math display="inline"><semantics> <msub> <mi>P</mi> <mi>F</mi> </msub> </semantics></math>, <math display="inline"><semantics> <mi>τ</mi> </semantics></math>), and (<b>d</b>) ROC curves of (<math display="inline"><semantics> <msub> <mi>P</mi> <mi>D</mi> </msub> </semantics></math>, <math display="inline"><semantics> <mi>τ</mi> </semantics></math>, <math display="inline"><semantics> <msub> <mi>P</mi> <mi>F</mi> </msub> </semantics></math>).</p>
Full article ">Figure 14
<p>The ROC curves on the Urban-5 dataset. (<b>a</b>) ROC curves of (<math display="inline"><semantics> <msub> <mi>P</mi> <mi>D</mi> </msub> </semantics></math>, <math display="inline"><semantics> <msub> <mi>P</mi> <mi>F</mi> </msub> </semantics></math>), (<b>b</b>) ROC curves of (<math display="inline"><semantics> <msub> <mi>P</mi> <mi>D</mi> </msub> </semantics></math>, <math display="inline"><semantics> <mi>τ</mi> </semantics></math>), (<b>c</b>) ROC curves of (<math display="inline"><semantics> <msub> <mi>P</mi> <mi>F</mi> </msub> </semantics></math>, <math display="inline"><semantics> <mi>τ</mi> </semantics></math>), and (<b>d</b>) ROC curves of (<math display="inline"><semantics> <msub> <mi>P</mi> <mi>D</mi> </msub> </semantics></math>, <math display="inline"><semantics> <mi>τ</mi> </semantics></math>, <math display="inline"><semantics> <msub> <mi>P</mi> <mi>F</mi> </msub> </semantics></math>).</p>
Full article ">Figure 15
<p>The boxplots of all compared methods. <b>a</b>: RX; <b>b</b>: LRASR; <b>c</b>: GTVLRR; <b>d</b>: AUTO-AD; <b>e</b>: RGAE; <b>f</b>: DeCNN-AD; <b>g</b>: PTA; <b>h</b>: PCA-TLRSR; <b>i</b>: LARTVAD; <b>j</b>: WMS-LRTR.</p>
Full article ">Figure 16
<p>The detection maps on (<b>a</b>) Noisy Beach-3 and (<b>b</b>) Noisy Urban-3.</p>
Full article ">Figure 17
<p>The relative errors on <math display="inline"><semantics> <mrow> <mo>(</mo> <mi mathvariant="bold">a</mi> <mo>)</mo> </mrow> </semantics></math> the Airport scenes, <math display="inline"><semantics> <mrow> <mo>(</mo> <mi mathvariant="bold">b</mi> <mo>)</mo> </mrow> </semantics></math> the Beach scenes, <math display="inline"><semantics> <mrow> <mo>(</mo> <mi mathvariant="bold">c</mi> <mo>)</mo> </mrow> </semantics></math> the Urban scenes.</p>
Full article ">
26 pages, 2493 KiB  
Article
Resource Allocation and Interference Coordination Strategies in Heterogeneous Dual-Layer Satellite Networks
by Jinhong Li, Rong Chai, Tianyi Zhou and Chengchao Liang
Sensors 2025, 25(4), 1005; https://doi.org/10.3390/s25041005 - 8 Feb 2025
Viewed by 372
Abstract
In the face of rapidly evolving communication technologies and increasing user demands, traditional terrestrial networks are challenged by the need for high-quality, high-speed, and reliable communication. This paper explores the integration of heterogeneous satellite networks (HSN) with emerging technologies such as Mobile Edge [...] Read more.
In the face of rapidly evolving communication technologies and increasing user demands, traditional terrestrial networks are challenged by the need for high-quality, high-speed, and reliable communication. This paper explores the integration of heterogeneous satellite networks (HSN) with emerging technologies such as Mobile Edge Computing (MEC), in-network caching, and Software-Defined Networking (SDN) to enhance service efficiency. By leveraging dual-layer satellite networks combining Low Earth Orbit (LEO) and Geostationary Earth Orbit (GEO) satellites, the study addresses resource allocation and interference coordination challenges. This paper proposes a novel resource allocation and interference coordination strategy for dual-layer satellite networks integrating LEO and GEO satellites. We formulate a mathematical optimization problem to optimize resource allocation while minimizing co-channel interference and develop an ADMM-based distributed algorithm for efficient problem-solving. The proposed scheme enhances service efficiency by incorporating MEC, in-network caching, and SDN technologies into the satellite network. Simulation results demonstrate that our proposed algorithm significantly improves network performance by effectively managing resources and reducing interference. Full article
(This article belongs to the Topic Advances in Wireless and Mobile Networking)
Show Figures

Figure 1

Figure 1
<p>Heterogeneous Satellite Network Scene Model.</p>
Full article ">Figure 2
<p>Schematic diagram of antenna off-axis angle and interference distance.</p>
Full article ">Figure 3
<p>Problem Decomposition.</p>
Full article ">Figure 4
<p>Average user vMOS for different computing capacities.</p>
Full article ">Figure 5
<p>Average user vMOS for different numbers of access points.</p>
Full article ">Figure 6
<p>Average MEC server load for different numbers of users.</p>
Full article ">Figure 7
<p>Average MEC server load for different cache capacities.</p>
Full article ">Figure 8
<p>Average MEC server load for different computing capacities.</p>
Full article ">
23 pages, 979 KiB  
Article
Hyperspectral Band Selection via Tensor Low Rankness and Generalized 3DTV
by Katherine Henneberger and Jing Qin
Remote Sens. 2025, 17(4), 567; https://doi.org/10.3390/rs17040567 - 7 Feb 2025
Viewed by 557
Abstract
Hyperspectral band selection plays a key role in reducing the high dimensionality of data while maintaining essential details. However, existing band selection methods often encounter challenges, such as high memory consumption, the need for data matricization that disrupts inherent data structures, and difficulties [...] Read more.
Hyperspectral band selection plays a key role in reducing the high dimensionality of data while maintaining essential details. However, existing band selection methods often encounter challenges, such as high memory consumption, the need for data matricization that disrupts inherent data structures, and difficulties in preserving crucial spatial–spectral relationships. To address these challenges, we propose a tensor-based band selection model using Generalized 3D Total Variation (G3DTV), which utilizes the 1p norm to promote smoothness across spatial and spectral dimensions. Based on the Alternating Direction Method of Multipliers (ADMM), we develop an efficient hyperspectral band selection algorithm, where the tensor low-rank structure is captured through tensor CUR decomposition, thus significantly improving computational efficiency. Numerical experiments on benchmark datasets have demonstrated that our method outperforms other state-of-the-art approaches. In addition, we provide practical guidelines for parameter tuning in both noise-free and noisy data scenarios. We also discuss computational complexity trade-offs, explore parameter selection using grid search and Bayesian Optimization, and extend our analysis to evaluate performance with additional classifiers. These results further validate the proposed robustness and accuracy of the model. Full article
Show Figures

Graphical abstract

Graphical abstract
Full article ">Figure 1
<p>A visualization of the t-CUR decomposition where * represents the t-product as defined in Definition 4.</p>
Full article ">Figure 2
<p>Flowchart of the proposed method.</p>
Full article ">Figure 3
<p>Avisual representation of the 10th hyperspectral band from each of the test dataset. Here, each dataset is displayed using its original spatial scale and the same color range, where Indian Pines is <math display="inline"><semantics> <mrow> <mn>145</mn> <mo>×</mo> <mn>145</mn> </mrow> </semantics></math> pixels, Salinas-A is <math display="inline"><semantics> <mrow> <mn>86</mn> <mo>×</mo> <mn>83</mn> </mrow> </semantics></math> pixels, and Pavia University is <math display="inline"><semantics> <mrow> <mn>610</mn> <mo>×</mo> <mn>340</mn> </mrow> </semantics></math> pixels.</p>
Full article ">Figure 4
<p>Overall accuracy with SVM for the Indian Pines dataset.</p>
Full article ">Figure 5
<p>Overall accuracy with KNNs for the Indian Pines dataset.</p>
Full article ">Figure 6
<p>Overall accuracy of SVM for the Salinas-A dataset.</p>
Full article ">Figure 7
<p>Overall accuracy of KNNs for the Salinas-A dataset.</p>
Full article ">Figure 8
<p>Overall accuracy of SVM for the Pavia University dataset.</p>
Full article ">Figure 9
<p>Overall accuracy of KNNs for the Pavia University dataset.</p>
Full article ">Figure 10
<p>SVM overall accuracy for the Indian Pines dataset using grid search and BO.</p>
Full article ">Figure 11
<p>KNNs overall accuracy for the Indian Pines dataset using grid search and BO.</p>
Full article ">Figure 12
<p>SVM overall accuracy envelope for the Indian Pines dataset over 50 trials using random <span class="html-italic">k</span>-means initialization.</p>
Full article ">Figure 13
<p>SVM overall accuracy for the Indian Pines dataset using <span class="html-italic">k</span>-means and spectral clustering in Phase 2 of our algorithm.</p>
Full article ">Figure 14
<p>CNN overall accuracy for the Indian Pines dataset.</p>
Full article ">
18 pages, 2057 KiB  
Article
Cooperative Game Enabled Low-Carbon Energy Dispatching of Multi-Regional Integrated Energy Systems Considering Carbon Market
by Peiran Liang, Honghang Zhang and Rui Liang
Energies 2025, 18(4), 759; https://doi.org/10.3390/en18040759 - 7 Feb 2025
Viewed by 388
Abstract
With the growing global environmental concerns and the push for carbon neutrality, rural multi-regional integrated energy systems (IESs) face challenges related to low energy efficiency, high carbon emissions, and the transition to cleaner energy sources. This paper proposes a cooperative game-based low-carbon economic [...] Read more.
With the growing global environmental concerns and the push for carbon neutrality, rural multi-regional integrated energy systems (IESs) face challenges related to low energy efficiency, high carbon emissions, and the transition to cleaner energy sources. This paper proposes a cooperative game-based low-carbon economic dispatch strategy for rural IESs, integrating carbon trading mechanisms. A novel multi-regional IESs architecture is developed to exploit the synergy between photovoltaic (PV) and biomass energy systems. The proposed model described the anaerobic fermentation heat loads, incorporates variable-temperature fermentation, and employs a Nash bargaining model solved via the Alternating Direction Method of Multipliers (ADMM) to optimize cooperation while preserving stakeholder privacy. Simulation results show that the proposed strategy reduces total operating costs by 16.9% and carbon emissions by 7.5%, validating its effectiveness in enhancing efficiency and sustainability in rural energy systems. Full article
Show Figures

Figure 1

Figure 1
<p>Structure of the rural multi-area integrated energy system.</p>
Full article ">Figure 2
<p>The proposed ADMM-based energy trading algorithm.</p>
Full article ">Figure 3
<p>Optimization results of inter-microgrid power interactions and trading tariffs.</p>
Full article ">Figure 3 Cont.
<p>Optimization results of inter-microgrid power interactions and trading tariffs.</p>
Full article ">Figure 4
<p>Results of power optimization within Microgrid 3.</p>
Full article ">Figure A1
<p>Load profiles of electricity and heat in Microgrid 1.</p>
Full article ">Figure A2
<p>Load profiles of electricity and heat in Microgrid 2.</p>
Full article ">Figure A3
<p>Load profiles of electricity and heat in Microgrid 3.</p>
Full article ">
27 pages, 1810 KiB  
Article
Efficient Tensor Robust Principal Analysis via Right-Invertible Matrix-Based Tensor Products
by Zhang Huang, Jun Feng and Wei Li
Axioms 2025, 14(2), 99; https://doi.org/10.3390/axioms14020099 - 28 Jan 2025
Viewed by 470
Abstract
In this paper, we extend the definition of tensor products from using an invertible matrix to utilising right-invertible matrices, exploring the algebraic properties of these new tensor products. Based on this novel definition, we define the concepts of tensor rank and tensor nuclear [...] Read more.
In this paper, we extend the definition of tensor products from using an invertible matrix to utilising right-invertible matrices, exploring the algebraic properties of these new tensor products. Based on this novel definition, we define the concepts of tensor rank and tensor nuclear norm, ensuring consistency with their matrix counterparts, and derive a singular value thresholding (L,R SVT) formula to approximately solve the subproblems in the alternating direction method of multipliers (ADMM), which is integral to our proposed tensor robust principal component analysis (LR TRPCA) algorithm. The computational complexity of the LR TRPCA algorithm is O(k·(n1n2n3+p·min(n12n2,n1n22))) for k iterations. According to this complexity analysis, by using a right-invertible matrix that selects p rows from the n3 rows of the invertible matrix used in the tensor product with an invertible matrix, the computational load is approximately reduced to p/n3 of what it would be with an invertible matrix, highlighting the efficiency gain in terms of computational resources. We apply this efficient algorithm to grayscale video denoising and motion detection problems, where it demonstrates significant improvements in processing speed while maintaining comparable quality levels to existing methods, thereby providing a promising approach for handling multi-linear data and offering valuable insights for advanced data analysis tasks. Full article
(This article belongs to the Special Issue Advances in Linear Algebra with Applications, 2nd Edition)
Show Figures

Figure 1

Figure 1
<p>Comparative analysis of PSNR values for <math display="inline"><semantics> <msub> <mo>∗</mo> <mrow> <mi>L</mi> <mo>,</mo> <mi>R</mi> </mrow> </msub> </semantics></math> TRPCA algorithms (TRPCA-(20/200)C, TRPCA-(40/200)C, TRPCA-(60/200)C, and TRPCA-(100/200)C), and classical TRPCA algorithm (TRPCA-C) across frames on random tensor.</p>
Full article ">Figure 2
<p>Comparative analysis of RSE values for <math display="inline"><semantics> <msub> <mo>∗</mo> <mrow> <mi>L</mi> <mo>,</mo> <mi>R</mi> </mrow> </msub> </semantics></math> TRPCA algorithms (TRPCA-(20/200)C, TRPCA-(40/200)C, TRPCA-(60/200)C, and TRPCA-(100/200)C), and classical TRPCA algorithm (TRPCA-C) across frames on random tensor.</p>
Full article ">Figure 3
<p>Comparative analysis of PSNR values for TRPAC-C, TRPCA-(100/200)C, TRPCA-(40/200)C, and TRPCA-(20/200)C algorithms across video frames.</p>
Full article ">Figure 4
<p>Comparative analysis of RSE values for TRPAC-C, TRPCA-(100/200)C, TRPCA-(40/200)C, and TRPCA-(20/200)C algorithms across video frames.</p>
Full article ">Figure 5
<p>Comparison of denoised images with TRPAC-C (classic TRPCA) and TRPCA-(20/200)C(<math display="inline"><semantics> <msub> <mo>∗</mo> <mrow> <mi>L</mi> <mo>,</mo> <mi>R</mi> </mrow> </msub> </semantics></math> TRPCA) and frames = 40, 70, 120.</p>
Full article ">Figure 6
<p>Comparison of residuals after denoising with TRPAC-C (classic TRPCA) and TRPCA-(20/200)C(<math display="inline"><semantics> <msub> <mo>∗</mo> <mrow> <mi>L</mi> <mo>,</mo> <mi>R</mi> </mrow> </msub> </semantics></math> TRPCA) and frames = 40, 70, 120.</p>
Full article ">
22 pages, 865 KiB  
Article
Secrecy-Constrained UAV-Mounted RIS-Assisted ISAC Networks: Position Optimization and Power Beamforming
by Weichao Yang, Yajing Wang, Dawei Wang, Yixin He and Li Li
Drones 2025, 9(1), 51; https://doi.org/10.3390/drones9010051 - 13 Jan 2025
Viewed by 772
Abstract
This paper investigates secrecy solutions for integrated sensing and communication (ISAC) systems, leveraging the combination of a reflecting intelligent surface (RIS) and an unmanned aerial vehicle (UAV) to introduce new degrees of freedom for enhanced system performance. Specifically, we propose a secure ISAC [...] Read more.
This paper investigates secrecy solutions for integrated sensing and communication (ISAC) systems, leveraging the combination of a reflecting intelligent surface (RIS) and an unmanned aerial vehicle (UAV) to introduce new degrees of freedom for enhanced system performance. Specifically, we propose a secure ISAC system supported by a UAV-mounted RIS, where an ISAC base station (BS) facilitates secure multi-user communication while simultaneously detecting potentially malicious radar targets. Our goal is to improve parameter estimation performance, measured by the Cramér–Rao bound (CRB), by jointly optimizing the UAV position, transmit beamforming, and RIS beamforming, subject to constraints including the UAV flight area, communication users’ quality of service (QoS) requirements, secure transmission demands, power budget, and RIS reflecting coefficient limits. To address this non-convex, multivariate, and coupled problem, we decompose it into three subproblems, which are solved iteratively using particle swarm optimization (PSO), semi-definite relaxation (SDR), majorization–minimization (MM), and alternating direction method of multipliers (ADMM) algorithms. Our numerical results validate the effectiveness of the proposed scheme and demonstrate the potential of employing UAV-mounted RIS in ISAC systems to enhance radar sensing capabilities. Full article
(This article belongs to the Special Issue Physical-Layer Security in Drone Communications)
Show Figures

Figure 1

Figure 1
<p>A secure ISAC system supported by a UAV-mounted RIS.</p>
Full article ">Figure 2
<p>CRB versus the number of RIS reflecting the <span class="html-italic">M</span> element.</p>
Full article ">Figure 3
<p>CRB versus the SINR requirement <math display="inline"><semantics> <mi>γ</mi> </semantics></math>.</p>
Full article ">Figure 4
<p>CRB versus the transmit power <math display="inline"><semantics> <msub> <mi>P</mi> <mi>BS</mi> </msub> </semantics></math>.</p>
Full article ">Figure 5
<p>CRB versus the number of antennas <span class="html-italic">N</span>.</p>
Full article ">
16 pages, 9114 KiB  
Article
Low-Rank Tensor Recovery Based on Nonconvex Geman Norm and Total Variation
by Xinhua Su, Huixiang Lin, Huanmin Ge and Yifan Mei
Electronics 2025, 14(2), 238; https://doi.org/10.3390/electronics14020238 - 8 Jan 2025
Viewed by 647
Abstract
Tensor restoration finds applications in various fields, including data science, image processing, and machine learning, where the global low-rank property is a crucial prior. As the convex relaxation to the tensor rank function, the traditional tensor nuclear norm is used by directly adding [...] Read more.
Tensor restoration finds applications in various fields, including data science, image processing, and machine learning, where the global low-rank property is a crucial prior. As the convex relaxation to the tensor rank function, the traditional tensor nuclear norm is used by directly adding all the singular values of a tensor. Considering the variations among singular values, nonconvex regularizations have been proposed to approximate the tensor rank function more effectively, leading to improved recovery performance. In addition, the local characteristics of the tensor could further improve detail recovery. Currently, the gradient tensor is explored to effectively capture the smoothness property across tensor dimensions. However, previous studies considered the gradient tensor only within the context of the nuclear norm. In order to better simultaneously represent the global low-rank property and local smoothness of tensors, we propose a novel regularization, the Tensor-Correlated Total Variation (TCTV), based on the nonconvex Geman norm and total variation. Specifically, the proposed method minimizes the nonconvex Geman norm on singular values of the gradient tensor. It enhances the recovery performance of a low-rank tensor by simultaneously reducing estimation bias, improving approximation accuracy, preserving fine-grained structural details and maintaining good computational efficiency compared to traditional convex regularizations. Based on the proposed TCTV regularization, we develop TC-TCTV and TRPCA-TCTV models to solve completion and denoising problems, respectively. Subsequently, the proposed models are solved by the Alternating Direction Method of Multipliers (ADMM), and the complexity and convergence of the algorithm are analyzed. Extensive numerical results on multiple datasets validate the superior recovery performance of our method, even in extreme conditions with high missing rates. Full article
(This article belongs to the Special Issue Image Fusion and Image Processing)
Show Figures

Figure 1

Figure 1
<p>Example of recovery performance under extreme conditions. From top to bottom, sampling rates are 3%, 1%, and 0.5%, respectively.</p>
Full article ">Figure 2
<p>Convergence curves of the TC-TCTV and TRPCA-TCTV models. The relative errors of the two models decrease and converge with the increasing number of iterations.</p>
Full article ">Figure 3
<p>Sensitivity analysis of parameters <math display="inline"><semantics> <mi>ρ</mi> </semantics></math> and <math display="inline"><semantics> <msub> <mi>μ</mi> <mn>0</mn> </msub> </semantics></math> under different sampling rates.</p>
Full article ">Figure 4
<p>The 20 original color images that are chosen and tested in this experiment.</p>
Full article ">Figure 5
<p>Bar chart of PSNR values for different sampling rates.</p>
Full article ">Figure 6
<p>Visual comparisons of color images produced by all approaches. From top to bottom, sampling rates are 10%, 20%, and 30%, respectively.</p>
Full article ">Figure 7
<p>Examples of recovery performance under extreme conditions for different methods. From top to bottom, sampling rates are 3%, 1%, and 0.5%, respectively.</p>
Full article ">Figure 8
<p>Denoising results under 20% sparse salt and pepper noise for all competing methods.</p>
Full article ">
20 pages, 5642 KiB  
Article
Joint Transmit Waveform and Receive Mismatched Filter Design to Suppress Range Sidelobe
by Hairui Wang, Haihong Tao, Tiantian Zhong and Wendi Li
Remote Sens. 2025, 17(2), 175; https://doi.org/10.3390/rs17020175 - 7 Jan 2025
Viewed by 687
Abstract
Pulse compression technology can augment the likelihood of target discernment without degradation and without amplifying system hardware requisites. However, radar-communication integrated waveforms may cause mismatches in reception due to communication modulation, leading to increased loss in processing gain (LPG). This method aims to [...] Read more.
Pulse compression technology can augment the likelihood of target discernment without degradation and without amplifying system hardware requisites. However, radar-communication integrated waveforms may cause mismatches in reception due to communication modulation, leading to increased loss in processing gain (LPG). This method aims to achieve communication transmission while suppressing near-range sidelobe interference (NRSI) with a minor sacrifice in LPG. An environment-based weighted mismatched filter (EWMF) design methodology is proposed to attenuate NRSI to the requisite level, with further control of LPG possible by adjusting communication modulation parameters. Moreover, the alternating direction method of multipliers is employed to jointly optimize the integrated waveform and filter design. The effectiveness of this method is demonstrated using the average sidelobe level over a specified region as the performance metric. Theoretical evaluation and experimental results confirm the applicability of waveforms using EWMF, effectively suppressing NRSI, and this method is suitable for all waveforms based on pulse compression processing. Notably, it offers cost-reduction advantages without requiring modifications to the radar transmitter or receiver. Full article
Show Figures

Figure 1

Figure 1
<p>A schematic diagram of received data from different range cells.</p>
Full article ">Figure 2
<p>(<b>a</b>): With <math display="inline"><semantics> <mrow> <mi>M</mi> <mo>=</mo> <mn>2</mn> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <mi>h</mi> <mo>=</mo> <mn>0.5</mn> </mrow> </semantics></math>, the correlation between SNR and BER across various frequency pulse formulations. (<b>b</b>): With <math display="inline"><semantics> <mrow> <mi>M</mi> <mo>=</mo> <mn>2</mn> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <mi>h</mi> <mo>=</mo> <mn>0.5</mn> </mrow> </semantics></math>, the correlation between SNR and BER for differing partial response lengths.</p>
Full article ">Figure 3
<p>The different reference template sidelobe shapes.</p>
Full article ">Figure 4
<p>Different filter envelopes for the normalized peak loss obtained by the EWMF method.</p>
Full article ">Figure 5
<p>LPG for attenuating all range sidelobes derived from the following baseband signals: (<b>a</b>) Barker code, (<b>b</b>) P3 code, (<b>c</b>) P4 code, (<b>d</b>) LFM, (<b>e</b>) NLFM, and (<b>f</b>) NLFM-CPM waveform.</p>
Full article ">Figure 6
<p>Curve of strong interference first sidelobe peak and trough values as a function of reference template cavity depth.</p>
Full article ">Figure 7
<p>With different lengths of codes, the PSL after mismatch filtering varies with the change in input SINR.</p>
Full article ">Figure 8
<p>The relationship between the Modulation Index <span class="html-italic">h</span> of CPM and the LPG after mismatch filtering.</p>
Full article ">Figure 9
<p>The ISL fitness function values obtained after iterating with the ADMM algorithm for different waveforms.</p>
Full article ">Figure 10
<p>Comparison of the recognition capability of conventional matched filters and EWMF filters for weak targets under different waveform conditions.</p>
Full article ">
22 pages, 15185 KiB  
Article
Low Tensor Rank Constrained Image Inpainting Using a Novel Arrangement Scheme
by Shuli Ma, Youchen Fan, Shengliang Fang, Weichao Yang and Li Li
Appl. Sci. 2025, 15(1), 322; https://doi.org/10.3390/app15010322 - 31 Dec 2024
Viewed by 577
Abstract
Employing low tensor rank decomposition in image inpainting has attracted increasing attention. This study exploited novel tensor arrangement schemes to transform an image (a low-order tensor) to a higher-order tensor without changing the total number of pixels. The developed arrangement schemes enhanced the [...] Read more.
Employing low tensor rank decomposition in image inpainting has attracted increasing attention. This study exploited novel tensor arrangement schemes to transform an image (a low-order tensor) to a higher-order tensor without changing the total number of pixels. The developed arrangement schemes enhanced the low rankness of images under three tensor decomposition methods: matrix SVD, tensor train (TT) decomposition, and tensor singular value decomposition (t-SVD). By exploiting the schemes, we solved the image inpainting problem with three low-rank constrained models that use the matrix rank, TT rank, and tubal rank as constrained priors. The tensor tubal rank and tensor train multi-rank were developed from t-SVD and TT decomposition, respectively. Then, ADMM algorithms were efficiently exploited for solving the three models. Experimental results demonstrate that our methods are effective for image inpainting and superior to numerous close methods. Full article
(This article belongs to the Special Issue AI-Based Image Processing: 2nd Edition)
Show Figures

Figure 1

Figure 1
<p>(<b>a</b>) Examples of the basic QA scheme. Using the basic QA scheme, the matrix M size of 8 × 8 can be turned into an order-3 tensor with a size of 4 × 4 × 4. (<b>b</b>) Using the basic QA scheme, the Lena image can be divided into 4 small Lena images. (<b>c</b>) The four-pixel values curves of the four smaller Lena images have overlapped into one curve.</p>
Full article ">Figure 2
<p>(<b>a</b>) The first flexible QA scheme to obtain the unfolding matrix. Take the Lena RGB image as an example. First, the image size of 256 × 256 × 3 is permuted to order-3 tensor with the size of 32 × 32 × 192 using the basic QA scheme. Then, this order-3 tensor is reshaped into the unfolding matrix of size 1024 × 192. (<b>b</b>) The singular values of this unfolding matrix.</p>
Full article ">Figure 3
<p>(<b>a</b>) The second flexible QA scheme to permute the image into a balanced order-3 tensor. Take the Lena image size of 256 × 256 × 3 as an example. The balanced order-3 tensor size of 64 × 64 × 48 is obtained by multiple QA schemes. This balanced order-3 tensor is more suitable for the t-SVD decomposition than the original image size of 256 × 256 × 3. (<b>b</b>) The low tubal rankness of the balanced order-3 tensor.</p>
Full article ">Figure 4
<p>(<b>a</b>) Examples of the third flexible QA scheme. Using the third flexible QA, the matrix size of 16 × 16 can be permuted into an order-4 tensor size of 4 × 4 × 4 × 4. (<b>b</b>) Singular values of TT matrices. We permute the order-3 Lena RGB image size of 256 × 256 × 3 into an 8-order tensor with the size of 4 × 4 × 4 × 4 × 4 × 4 × 4 × 4 × 3 by the third flexible QA scheme. Then, eight different TT matrices are obtained from this higher-order tensor. We labeled those TT matrices as k = 1, 2, …, 8.</p>
Full article ">Figure 5
<p>Original color images and missing patterns.</p>
Full article ">Figure 6
<p>Comparison of KA and QA schemes under the corresponding TMac-TTKA method [<a href="#B23-applsci-15-00322" class="html-bibr">23</a>] and our TTLR method. The first row lists the painted images with a random missing pattern, and the missing ratio is 80%. The second row lists the recovered images by the TMac-TTKA method. The last row lists the recovered images by the LRTT method.</p>
Full article ">Figure 7
<p>The missing patterns and inpainting results of House image solved by different methods.</p>
Full article ">Figure 8
<p>The missing patterns and inpainting results of Lena image solved by different methods.</p>
Full article ">Figure 9
<p>The missing patterns and inpainting results of Baboon image solved by different methods.</p>
Full article ">Figure 10
<p>The PSNR curves of the inpainting results of the nine methods; the missing ratio ranges from 10% to 70% under a random missing pattern.</p>
Full article ">Figure 11
<p>The visual and numerical PSNR (dB)/SSIM comparisons of our methods for recovering the pepper image under 80% random missing patterns.</p>
Full article ">Figure 12
<p>The PSNR (dB) results of <math display="inline"><semantics> <mrow> <msubsup> <mi>X</mi> <mi>n</mi> <mo>*</mo> </msubsup> </mrow> </semantics></math> (in Algorithm 3, the optimal solution of the n<sup>th</sup> subproblem exploits the n<sup>th</sup> TT matrix rank) using the TTLR method and the TTLRTV method. We permuted the image size of 256 × 256 × 3 to an order-9 tensor by the QA scheme. Then, the TT matrices of this order-9 tensor were labelled as k = 1, 2, …, 8. We used the random missing patterns with four missing ratios: 10%, 30%, 50%, and 70% respectively. The tested color images for the PSNR curves in (<b>a</b>–<b>c</b>) are House, Lena and Airplane images, respectively.</p>
Full article ">Figure 13
<p>The 90% missing patterns and inpainting results solved by the ten methods.</p>
Full article ">
25 pages, 3488 KiB  
Article
Research on the Collaborative Operation of Diversified Energy Storage and Park Clusters: A Method Combining Data Generation and a Distributionally Robust Chance-Constrained Operational Model
by Zhuoya Siqin, Tiantong Qiao, Ruisheng Diao, Xuejie Wang and Guangjun Xu
Electronics 2024, 13(24), 4997; https://doi.org/10.3390/electronics13244997 - 19 Dec 2024
Viewed by 596
Abstract
Energy storage is crucial for enhancing the economic efficiency of integrated energy systems. This paper addresses the need for flexible resources due to high renewable energy integration and the complexity of managing multiple resources. We propose a decentralized collaborative multi-stage distributionally robust scheduling [...] Read more.
Energy storage is crucial for enhancing the economic efficiency of integrated energy systems. This paper addresses the need for flexible resources due to high renewable energy integration and the complexity of managing multiple resources. We propose a decentralized collaborative multi-stage distributionally robust scheduling method for electric-thermal systems, incorporating energy storage to mitigate renewable energy fluctuations. Firstly, we model the electric-thermal system with multiple flexible resources. Uncertain parameters of renewables are estimated using conditional generative adversarial networks (CGANs), assuming empirical probability distributions. Secondly, given the distinct operators of electric and thermal systems and information barriers, we develop a data-driven distributionally robust chance-constrained optimization model (DRCCO). This model ensures decentralized collaboration without compromising information security or fairness. Then, we introduce an Alternating Direction Method of Multipliers (ADMM) algorithm with parallel regularization to decouple the model. This approach facilitates rapid solution finding with minimal information exchange. Finally, numerical examples confirm the model’s effectiveness in enhancing system flexibility and ensuring wind power consumption. Full article
Show Figures

Figure 1

Figure 1
<p>Energy supply framework of the PMES.</p>
Full article ">Figure 2
<p>Basic framework of multi-agent decentralized collaboration.</p>
Full article ">Figure 3
<p>Flow chart for solving a DRCCO model for a park cluster based on CGAN.</p>
Full article ">Figure 4
<p>Algorithm solution flowchart.</p>
Full article ">Figure 5
<p>Trading price of energy and various typical loads.</p>
Full article ">Figure 6
<p>Correlation comparison between real data and generated data.</p>
Full article ">Figure 7
<p>Comparison of cumulative probability distribution between real data and generated data.</p>
Full article ">Figure 8
<p>Charging and discharging scheduling results of multi-energy storage.</p>
Full article ">Figure 9
<p>Power dispatching results in Parks 1–4.</p>
Full article ">Figure 10
<p>Thermal and cold energy dispatch results in Parks 1–4.</p>
Full article ">Figure 11
<p>Operating costs of park systems under different dispatching modes.</p>
Full article ">Figure 12
<p>Convergence process of improving ADMM.</p>
Full article ">
Back to TopTop