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

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Article Types

Countries / Regions

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Search Results (367)

Search Parameters:
Keywords = geometrical bounds

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
14 pages, 330 KiB  
Article
Sharp Bounds on Hankel Determinants for Starlike Functions Defined by Symmetry with Respect to Symmetric Domains
by Alina Alb Lupaş, Adel Salim Tayyah and Janusz Sokół
Symmetry 2025, 17(8), 1244; https://doi.org/10.3390/sym17081244 - 5 Aug 2025
Abstract
This work investigates the behavior of the coefficients of analytic functions within certain subclasses characterized by inherent symmetric structures. By leveraging deep connections with functions exhibiting positive real part properties, the approach introduces a modern analytical framework that links the studied coefficients to [...] Read more.
This work investigates the behavior of the coefficients of analytic functions within certain subclasses characterized by inherent symmetric structures. By leveraging deep connections with functions exhibiting positive real part properties, the approach introduces a modern analytical framework that links the studied coefficients to those of auxiliary functions with regulated behavior. This connection allows for the derivation of sharp estimates and facilitates computational treatment. The proposed method builds upon certain classical and modern coefficient inequalities. The study focuses on obtaining precise bounds for specific determinant expressions associated with initial, inverse, and inverse logarithmic coefficients, all within a subclass of starlike functions exhibiting internal symmetry aligned with a recently introduced canonical structure. This symmetric perspective reveals how geometric properties can lead to refined quantitative outcomes that enhance contemporary analytic theory. Full article
(This article belongs to the Special Issue Functional Equations and Inequalities: Topics and Applications)
Show Figures

Figure 1

34 pages, 4388 KiB  
Article
IRSD-Net: An Adaptive Infrared Ship Detection Network for Small Targets in Complex Maritime Environments
by Yitong Sun and Jie Lian
Remote Sens. 2025, 17(15), 2643; https://doi.org/10.3390/rs17152643 - 30 Jul 2025
Viewed by 340
Abstract
Infrared ship detection plays a vital role in maritime surveillance systems. As a critical remote sensing application, it enables maritime surveillance across diverse geographic scales and operational conditions while offering robust all-weather operation and resilience to environmental interference. However, infrared imagery in complex [...] Read more.
Infrared ship detection plays a vital role in maritime surveillance systems. As a critical remote sensing application, it enables maritime surveillance across diverse geographic scales and operational conditions while offering robust all-weather operation and resilience to environmental interference. However, infrared imagery in complex maritime environments presents significant challenges, including low contrast, background clutter, and difficulties in detecting small-scale or distant targets. To address these issues, we propose an Infrared Ship Detection Network (IRSD-Net), a lightweight and efficient detection network built upon the YOLOv11n framework and specially designed for infrared maritime imagery. IRSD-Net incorporates a Hierarchical Multi-Kernel Convolution Network (HMKCNet), which employs parallel multi-kernel convolutions and channel division to enhance multi-scale feature extraction while reducing redundancy and memory usage. To further improve cross-scale fusion, we design the Dynamic Cross-Scale Feature Pyramid Network (DCSFPN), a bidirectional architecture that combines up- and downsampling to integrate low-level detail with high-level semantics. Additionally, we introduce Wise-PIoU, a novel loss function that improves bounding box regression by enforcing geometric alignment and adaptively weighting gradients based on alignment quality. Experimental results demonstrate that IRSD-Net achieves 92.5% mAP50 on the ISDD dataset, outperforming YOLOv6n and YOLOv11n by 3.2% and 1.7%, respectively. With a throughput of 714.3 FPS, IRSD-Net delivers high-accuracy, real-time performance suitable for practical maritime monitoring systems. Full article
Show Figures

Figure 1

23 pages, 2253 KiB  
Article
Robust Underwater Vehicle Pose Estimation via Convex Optimization Using Range-Only Remote Sensing Data
by Sai Krishna Kanth Hari, Kaarthik Sundar, José Braga, João Teixeira, Swaroop Darbha and João Sousa
Remote Sens. 2025, 17(15), 2637; https://doi.org/10.3390/rs17152637 - 29 Jul 2025
Viewed by 201
Abstract
Accurate localization plays a critical role in enabling underwater vehicle autonomy. In this work, we develop a robust infrastructure-based localization framework that estimates the position and orientation of underwater vehicles using only range measurements from long baseline (LBL) acoustic beacons to multiple on-board [...] Read more.
Accurate localization plays a critical role in enabling underwater vehicle autonomy. In this work, we develop a robust infrastructure-based localization framework that estimates the position and orientation of underwater vehicles using only range measurements from long baseline (LBL) acoustic beacons to multiple on-board receivers. The proposed framework integrates three key components, each formulated as a convex optimization problem. First, we introduce a robust calibration function that unifies multiple sources of measurement error—such as range-dependent degradation, variable sound speed, and latency—by modeling them through a monotonic function. This function bounds the true distance and defines a convex feasible set for each receiver location. Next, we estimate the receiver positions as the center of this feasible region, using two notions of centrality: the Chebyshev center and the maximum volume inscribed ellipsoid (MVE), both formulated as convex programs. Finally, we recover the vehicle’s full 6-DOF pose by enforcing rigid-body constraints on the estimated receiver positions. To do this, we leverage the known geometric configuration of the receivers in the vehicle and solve the Orthogonal Procrustes Problem to compute the rotation matrix that best aligns the estimated and known configurations, thereby correcting the position estimates and determining the vehicle orientation. We evaluate the proposed method through both numerical simulations and field experiments. To further enhance robustness under real-world conditions, we model beacon-location uncertainty—due to mooring slack and water currents—as bounded spherical regions around nominal beacon positions. We then mitigate the uncertainty by integrating the modified range constraints into the MVE position estimation formulation, ensuring reliable localization even under infrastructure drift. Full article
Show Figures

Figure 1

21 pages, 1210 KiB  
Article
Fixed-Time Bearing-Only Formation Control Without a Global Coordinate Frame
by Hanqiao Huang, Mengwen Lu, Bo Zhang and Qian Wang
Electronics 2025, 14(15), 3021; https://doi.org/10.3390/electronics14153021 - 29 Jul 2025
Viewed by 155
Abstract
This work addresses distributed fixed-time bearing-only formation stabilization for multi-agent systems lacking shared orientation knowledge. Addressing the challenge of missing global coordinate alignment in multi-agent systems, this work introduces a novel distributed estimator ensuring almost globally fixed-time convergence of orientation estimates. Leveraging this [...] Read more.
This work addresses distributed fixed-time bearing-only formation stabilization for multi-agent systems lacking shared orientation knowledge. Addressing the challenge of missing global coordinate alignment in multi-agent systems, this work introduces a novel distributed estimator ensuring almost globally fixed-time convergence of orientation estimates. Leveraging this estimator, we develop a distributed bearing-only formation control law specifically designed for agents governed by double-integrator dynamics, guaranteeing fixed-time convergence. Comprehensive stability analysis proves the almost global fixed-time stability of the overall closed-loop system. Crucially, the proposed control strategy drives actual formation to achieve the desired geometric pattern with almost global exponential convergence within a fixed time bound. Rigorous numerical experiments corroborate the theoretical framework. Full article
(This article belongs to the Special Issue Research on Cooperative Control of Multi-agent Unmanned Systems)
Show Figures

Figure 1

24 pages, 4106 KiB  
Article
Visualizing Three-Qubit Entanglement
by Alfred Benedito and Germán Sierra
Entropy 2025, 27(8), 800; https://doi.org/10.3390/e27080800 - 27 Jul 2025
Viewed by 129
Abstract
We present a graphical framework to represent entanglement in three-qubit states. The geometry associated with each entanglement class and type is analyzed, revealing distinct structural features. We explore the connection between this geometric perspective and the tangle, deriving bounds that depend on the [...] Read more.
We present a graphical framework to represent entanglement in three-qubit states. The geometry associated with each entanglement class and type is analyzed, revealing distinct structural features. We explore the connection between this geometric perspective and the tangle, deriving bounds that depend on the entanglement class. Based on these insights, we conjecture a purely geometric expression for both the tangle and Cayley’s hyperdeterminant for non-generic states. As an application, we analyze the energy eigenstates of physical Hamiltonians, identifying the sufficient conditions for genuine tripartite entanglement to be robust under symmetry-breaking perturbations and level repulsion effects. Full article
(This article belongs to the Special Issue Editorial Board Members' Collection Series on Quantum Entanglement)
Show Figures

Figure 1

21 pages, 3816 KiB  
Article
A K-Means Clustering Algorithm with Total Bregman Divergence for Point Cloud Denoising
by Xiaomin Duan, Anqi Mu, Xinyu Zhao and Yuqi Wu
Symmetry 2025, 17(8), 1186; https://doi.org/10.3390/sym17081186 - 24 Jul 2025
Viewed by 269
Abstract
Point cloud denoising is essential for improving 3D data quality, yet traditional K-means methods relying on Euclidean distance struggle with non-uniform noise. This paper proposes a K-means algorithm leveraging Total Bregman Divergence (TBD) to better model geometric structures on manifolds, enhancing robustness against [...] Read more.
Point cloud denoising is essential for improving 3D data quality, yet traditional K-means methods relying on Euclidean distance struggle with non-uniform noise. This paper proposes a K-means algorithm leveraging Total Bregman Divergence (TBD) to better model geometric structures on manifolds, enhancing robustness against noise. Specifically, TBDs—Total Logarithm, Exponential, and Inverse Divergences—are defined on symmetric positive-definite matrices, each tailored to capture distinct local geometries. Theoretical analysis demonstrates the bounded sensitivity of TBD-induced means to outliers via influence functions, while anisotropy indices quantify structural variations. Numerical experiments validate the method’s superiority over Euclidean-based approaches, showing effective noise separation and improved stability. This work bridges geometric insights with practical clustering, offering a robust framework for point cloud preprocessing in vision and robotics applications. Full article
(This article belongs to the Section Mathematics)
Show Figures

Figure 1

20 pages, 1816 KiB  
Article
A Self-Attention-Enhanced 3D Object Detection Algorithm Based on a Voxel Backbone Network
by Zhiyong Wang and Xiaoci Huang
World Electr. Veh. J. 2025, 16(8), 416; https://doi.org/10.3390/wevj16080416 - 23 Jul 2025
Viewed by 436
Abstract
3D object detection is a fundamental task in autonomous driving. In recent years, voxel-based methods have demonstrated significant advantages in reducing computational complexity and memory consumption when processing large-scale point cloud data. A representative method, Voxel-RCNN, introduces Region of Interest (RoI) pooling on [...] Read more.
3D object detection is a fundamental task in autonomous driving. In recent years, voxel-based methods have demonstrated significant advantages in reducing computational complexity and memory consumption when processing large-scale point cloud data. A representative method, Voxel-RCNN, introduces Region of Interest (RoI) pooling on voxel features, successfully bridging the gap between voxel and point cloud representations for enhanced 3D object detection. However, its robustness deteriorates when detecting distant objects or in the presence of noisy points (e.g., traffic signs and trees). To address this limitation, we propose an enhanced approach named Self-Attention Voxel-RCNN (SA-VoxelRCNN). Our method integrates two complementary attention mechanisms into the feature extraction phase. First, a full self-attention (FSA) module improves global context modeling across all voxel features. Second, a deformable self-attention (DSA) module enables adaptive sampling of representative feature subsets at strategically selected positions. After extracting contextual features through attention mechanisms, these features are fused with spatial features from the base algorithm to form enhanced feature representations, which are subsequently input into the region proposal network (RPN) to generate high-quality 3D bounding boxes. Experimental results on the KITTI test set demonstrate that SA-VoxelRCNN achieves consistent improvements in challenging scenarios, with gains of 2.49 and 1.87 percentage points at Moderate and Hard difficulty levels, respectively, while maintaining real-time performance at 22.3 FPS. This approach effectively balances local geometric details with global contextual information, providing a robust detection solution for autonomous driving applications. Full article
Show Figures

Figure 1

28 pages, 8337 KiB  
Article
Collision Detection Algorithms for Autonomous Loading Operations of LHD-Truck Systems in Unstructured Underground Mining Environments
by Mingyu Lei, Pingan Peng, Liguan Wang, Yongchun Liu, Ru Lei, Chaowei Zhang, Yongqing Zhang and Ya Liu
Mathematics 2025, 13(15), 2359; https://doi.org/10.3390/math13152359 - 23 Jul 2025
Viewed by 218
Abstract
This study addresses collision detection in the unmanned loading of ore from load-haul-dump (LHD) machines into mining trucks in underground metal mines. Such environments present challenges like heavy dust, confined spaces, sensor occlusions, and poor lighting. This work identifies two primary collision risks [...] Read more.
This study addresses collision detection in the unmanned loading of ore from load-haul-dump (LHD) machines into mining trucks in underground metal mines. Such environments present challenges like heavy dust, confined spaces, sensor occlusions, and poor lighting. This work identifies two primary collision risks and proposes corresponding detection strategies. First, for collisions between the bucket and tunnel walls, LiDAR is used to collect 3D point cloud data. The point cloud is processed through filtering, downsampling, clustering, and segmentation to isolate the bucket and tunnel wall. A KD-tree algorithm is then used to compute distances to assess collision risk. Second, for collisions between the bucket and the mining truck, a kinematic model of the LHD’s working device is established using the Denavit–Hartenberg (DH) method. Combined with inclination sensor data and geometric parameters, a formula is derived to calculate the pose of the bucket’s tip. Key points from the bucket and truck are then extracted to perform collision detection using the oriented bounding box (OBB) and the separating axis theorem (SAT). Simulation results confirm that the derived pose estimation formula yields a maximum error of 0.0252 m, and both collision detection algorithms demonstrate robust performance. Full article
(This article belongs to the Special Issue Mathematical Modeling and Analysis in Mining Engineering)
Show Figures

Figure 1

16 pages, 278 KiB  
Article
Maximal Norms of Orthogonal Projections and Closed-Range Operators
by Salma Aljawi, Cristian Conde, Kais Feki and Shigeru Furuichi
Symmetry 2025, 17(7), 1157; https://doi.org/10.3390/sym17071157 - 19 Jul 2025
Viewed by 201
Abstract
Using the Dixmier angle between two closed subspaces of a complex Hilbert space H, we establish the necessary and sufficient conditions for the operator norm of the sum of two orthogonal projections, PW1 and PW2, onto closed [...] Read more.
Using the Dixmier angle between two closed subspaces of a complex Hilbert space H, we establish the necessary and sufficient conditions for the operator norm of the sum of two orthogonal projections, PW1 and PW2, onto closed subspaces W1 and W2, to attain its maximum, namely PW1+PW2=2. These conditions are expressed in terms of the geometric relationship and symmetry between the ranges of the projections. We apply these results to orthogonal projections associated with a closed-range operator via its Moore–Penrose inverse. Additionally, for any bounded operator T with closed range in H, we derive sufficient conditions ensuring TT+TT=2, where T denotes the Moore–Penrose inverse of T. This work highlights how symmetry between operator ranges and their algebraic structure governs norm extremality and extends a recent finite-dimensional result to the general Hilbert space setting. Full article
(This article belongs to the Special Issue Mathematics: Feature Papers 2025)
36 pages, 7426 KiB  
Article
PowerLine-MTYOLO: A Multitask YOLO Model for Simultaneous Cable Segmentation and Broken Strand Detection
by Badr-Eddine Benelmostafa and Hicham Medromi
Drones 2025, 9(7), 505; https://doi.org/10.3390/drones9070505 - 18 Jul 2025
Viewed by 527
Abstract
Power transmission infrastructure requires continuous inspection to prevent failures and ensure grid stability. UAV-based systems, enhanced with deep learning, have emerged as an efficient alternative to traditional, labor-intensive inspection methods. However, most existing approaches rely on separate models for cable segmentation and anomaly [...] Read more.
Power transmission infrastructure requires continuous inspection to prevent failures and ensure grid stability. UAV-based systems, enhanced with deep learning, have emerged as an efficient alternative to traditional, labor-intensive inspection methods. However, most existing approaches rely on separate models for cable segmentation and anomaly detection, leading to increased computational overhead and reduced reliability in real-time applications. To address these limitations, we propose PowerLine-MTYOLO, a lightweight, one-stage, multitask model designed for simultaneous power cable segmentation and broken strand detection from UAV imagery. Built upon the A-YOLOM architecture, and leveraging the YOLOv8 foundation, our model introduces four novel specialized modules—SDPM, HAD, EFR, and the Shape-Aware Wise IoU loss—that improve geometric understanding, structural consistency, and bounding-box precision. We also present the Merged Public Power Cable Dataset (MPCD), a diverse, open-source dataset tailored for multitask training and evaluation. The experimental results show that our model achieves up to +10.68% mAP@50 and +1.7% IoU compared to A-YOLOM, while also outperforming recent YOLO-based detectors in both accuracy and efficiency. These gains are achieved with a smaller model memory footprint and a similar inference speed compared to A-YOLOM. By unifying detection and segmentation into a single framework, PowerLine-MTYOLO offers a promising solution for autonomous aerial inspection and lays the groundwork for future advances in fine-structure monitoring tasks. Full article
Show Figures

Figure 1

20 pages, 917 KiB  
Article
Numerical Investigation of Buckling Behavior of MWCNT-Reinforced Composite Plates
by Jitendra Singh, Ajay Kumar, Barbara Sadowska-Buraczewska, Wojciech Andrzejuk and Danuta Barnat-Hunek
Materials 2025, 18(14), 3304; https://doi.org/10.3390/ma18143304 - 14 Jul 2025
Viewed by 258
Abstract
The current study demonstrates the buckling properties of composite laminates reinforced with MWCNT fillers using a novel higher-order shear and normal deformation theory (HSNDT), which considers the effect of thickness in its mathematical formulation. The hybrid HSNDT combines polynomial and hyperbolic functions that [...] Read more.
The current study demonstrates the buckling properties of composite laminates reinforced with MWCNT fillers using a novel higher-order shear and normal deformation theory (HSNDT), which considers the effect of thickness in its mathematical formulation. The hybrid HSNDT combines polynomial and hyperbolic functions that ensure the parabolic shear stress profile and zero shear stress boundary condition at the upper and lower surface of the plate, hence removing the need for a shear correction factor. The plate is made up of carbon fiber bounded together with polymer resin matrix reinforced with MWCNT fibers. The mechanical properties are homogenized by a Halpin–Tsai scheme. The MATLAB R2019a code was developed in-house for a finite element model using C0 continuity nine-node Lagrangian isoparametric shape functions. The geometric nonlinear and linear stiffness matrices are derived using the principle of virtual work. The solution of the eigenvalue problem enables estimation of the critical buckling loads. A convergence study was carried out and model efficiency was corroborated with the existing literature. The model contains only seven degrees of freedom, which significantly reduces computation time, facilitating the comprehensive parametric studies for the buckling stability of the plate. Full article
(This article belongs to the Special Issue Mechanical Behavior of Advanced Composite Materials and Structures)
Show Figures

Figure 1

23 pages, 17655 KiB  
Article
Colony-YOLO: A Lightweight Micro-Colony Detection Network Based on Improved YOLOv8n
by Meihua Wang, Junhui Luo, Kai Lin, Yuankai Chen, Xinpeng Huang, Jiping Liu, Anbang Wang and Deqin Xiao
Microorganisms 2025, 13(7), 1617; https://doi.org/10.3390/microorganisms13071617 - 9 Jul 2025
Viewed by 338
Abstract
The detection of colony-forming units (CFUs) is a time-consuming but essential task in mulberry bacterial blight research. To overcome the problem of inaccurate small-target detection and high computational consumption in mulberry bacterial blight colony detection task, a mulberry bacterial blight colony dataset (MBCD) [...] Read more.
The detection of colony-forming units (CFUs) is a time-consuming but essential task in mulberry bacterial blight research. To overcome the problem of inaccurate small-target detection and high computational consumption in mulberry bacterial blight colony detection task, a mulberry bacterial blight colony dataset (MBCD) consisting of 310 images and 23,524 colonies is presented. Based on the MBCD, a colony detection model named Colony-YOLO is proposed. Firstly, the lightweight backbone network StarNet is employed, aiming to enhance feature extraction capabilities while reducing computational complexity. Next, C2f-MLCA is designed by embedding MLCA (Mixed Local Channel Attention) into the C2f module of YOLOv8 to integrate local and global feature information, thereby enhancing feature representation capabilities. Furthermore, the Shape-IoU loss function is implemented to prioritize geometric consistency between predicted and ground truth bounding boxes. Experiment results show that the Colony-YOLO achieved an mAP of 96.1% on MBCDs, which is 4.8% higher than the baseline YOLOv8n, with FLOPs and Params reduced by 1.8 G and 0.8 M, respectively. Comprehensive evaluations demonstrate that our method excels in detection accuracy while maintaining lower complexity, making it effective for colony detection in practical applications. Full article
(This article belongs to the Section Microbial Biotechnology)
Show Figures

Figure 1

26 pages, 7731 KiB  
Article
A Finite Element Approach to the Upper-Bound Bearing Capacity of Shallow Foundations Using Zero-Thickness Interfaces
by Yu-Lin Lee, Yu-Tang Huang, Chi-Min Lee, Tseng-Hsing Hsu and Ming-Long Zhu
Appl. Sci. 2025, 15(14), 7635; https://doi.org/10.3390/app15147635 - 8 Jul 2025
Viewed by 251
Abstract
This study presents a robust numerical framework for evaluating the upper-bound ultimate bearing capacity of shallow foundations in cohesive and C-phi soils using a self-developed finite element method. The model incorporates multi-segment zero-thickness interface elements to accurately simulate soil discontinuities and progressive failure [...] Read more.
This study presents a robust numerical framework for evaluating the upper-bound ultimate bearing capacity of shallow foundations in cohesive and C-phi soils using a self-developed finite element method. The model incorporates multi-segment zero-thickness interface elements to accurately simulate soil discontinuities and progressive failure mechanisms, based on the Mohr–Coulomb failure criterion. In contrast to optimization-based methods such as discontinuity layout optimization (DLO) or traditional finite element limit analysis (FELA), the proposed approach uses predefined failure mechanisms to improve computational transparency and efficiency. A variety of geometric failure mechanisms are analyzed, including configurations with triangular, circular, and logarithmic spiral slip surfaces. Particular focus is given to the transition zone, which is discretized into multiple blocks to enhance accuracy and convergence. The method is developed for two-dimensional problems under the assumption of elastic deformable-plastic behavior and homogeneous isotropic soil, with limitations in automatically detecting failure mechanisms. The proposed approach is validated against classical theoretical solutions, demonstrating excellent agreement. For friction angles ranging from 0° to 40°, the computed bearing capacity factors Nc and Nq show minimal deviation from the analytical results, with errors as low as 0.04–0.19% and 0.12–2.43%, respectively. The findings confirm the method’s effectiveness in capturing complex failure behavior, providing a practical and accurate tool for geotechnical stability assessment and foundation design. Full article
Show Figures

Figure 1

15 pages, 1770 KiB  
Article
PSHNet: Hybrid Supervision and Feature Enhancement for Accurate Infrared Small-Target Detection
by Weicong Chen, Chenghong Zhang and Yuan Liu
Appl. Sci. 2025, 15(14), 7629; https://doi.org/10.3390/app15147629 - 8 Jul 2025
Viewed by 239
Abstract
Detecting small targets in infrared imagery remains highly challenging due to sub-pixel target sizes, low signal-to-noise ratios, and complex background clutter. This paper proposes PSHNet, a hybrid deep-learning framework that combines dense spatial heatmap supervision with geometry-aware regression for accurate infrared small-target detection. [...] Read more.
Detecting small targets in infrared imagery remains highly challenging due to sub-pixel target sizes, low signal-to-noise ratios, and complex background clutter. This paper proposes PSHNet, a hybrid deep-learning framework that combines dense spatial heatmap supervision with geometry-aware regression for accurate infrared small-target detection. The network generates position–scale heatmaps to guide coarse localization, which are further refined through sub-pixel offset and size regression. A Complete IoU (CIoU) loss is introduced as a geometric regularization term to improve alignment between predicted and ground-truth bounding boxes. To better preserve fine spatial details essential for identifying small thermal signatures, an Enhanced Low-level Feature Module (ELFM) is incorporated using multi-scale dilated convolutions and channel attention. Experiments on the NUDT-SIRST and IRSTD-1k datasets demonstrate that PSHNet outperforms existing methods in IoU, detection probability, and false alarm rate, achieving IoU improvement and robust performance under low-SNR conditions. Full article
Show Figures

Figure 1

29 pages, 1997 KiB  
Article
An Efficient Sparse Twin Parametric Insensitive Support Vector Regression Model
by Shuanghong Qu, Yushan Guo, Renato De Leone, Min Huang and Pu Li
Mathematics 2025, 13(13), 2206; https://doi.org/10.3390/math13132206 - 6 Jul 2025
Viewed by 279
Abstract
This paper proposes a novel sparse twin parametric insensitive support vector regression (STPISVR) model, designed to enhance sparsity and improve generalization performance. Similar to twin parametric insensitive support vector regression (TPISVR), STPISVR constructs a pair of nonparallel parametric insensitive bound functions to indirectly [...] Read more.
This paper proposes a novel sparse twin parametric insensitive support vector regression (STPISVR) model, designed to enhance sparsity and improve generalization performance. Similar to twin parametric insensitive support vector regression (TPISVR), STPISVR constructs a pair of nonparallel parametric insensitive bound functions to indirectly determine the regression function. The optimization problems are reformulated as two sparse linear programming problems (LPPs), rather than traditional quadratic programming problems (QPPs). The two LPPs are originally derived from initial L1-norm regularization terms imposed on their respective dual variables, which are simplified to constants via the Karush–Kuhn–Tucker (KKT) conditions and consequently disappear. This simplification reduces model complexity, while the constraints constructed through the KKT conditions— particularly their geometric properties—effectively ensure sparsity. Moreover, a two-stage hybrid tuning strategy—combining grid search for coarse parameter space exploration and Bayesian optimization for fine-grained convergence—is proposed to precisely select the optimal parameters, reducing tuning time and improving accuracy compared to a singlemethod strategy. Experimental results on synthetic and benchmark datasets demonstrate that STPISVR significantly reduces the number of support vectors (SVs), thereby improving prediction speed and achieving a favorable trade-off among prediction accuracy, sparsity, and computational efficiency. Overall, STPISVR enhances generalization ability, promotes sparsity, and improves prediction efficiency, making it a competitive tool for regression tasks, especially in handling complex data structures. Full article
Show Figures

Figure 1

Back to TopTop