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
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 (378)

Search Parameters:
Keywords = inverse representations

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
31 pages, 2262 KiB  
Article
Strike a Pose: Relationships Between Infants’ Motor Development and Visuospatial Representations of Bodies
by Emma L. Axelsson, Tayla Britton, Gurmeher K. Gulhati, Chloe Kelly, Helen Copeland, Luca McNamara, Hester Covell and Alyssa A. Quinn
Behav. Sci. 2025, 15(8), 1021; https://doi.org/10.3390/bs15081021 - 28 Jul 2025
Abstract
Infants discriminate faces early in the first year, but research on infants’ discrimination of bodies is plagued by mixed findings. Using a familiarisation novelty preference method, we investigated 7- and 9-month-old infants’ discrimination of body postures presented in upright and inverted orientations, and [...] Read more.
Infants discriminate faces early in the first year, but research on infants’ discrimination of bodies is plagued by mixed findings. Using a familiarisation novelty preference method, we investigated 7- and 9-month-old infants’ discrimination of body postures presented in upright and inverted orientations, and with and without heads, along with relationships with gross and fine motor development. In our initial studies, 7-month-old infants discriminated upright headless postures with forward-facing and about-facing images. Eye tracking revealed that infants looked at the bodies of the upright headless postures the longest and at the heads of upright whole figures for 60–70% of the time regardless of the presence of faces, suggesting that heads detract attention from bodies. In a more stringent test, with similarly complex limb positions between test items, infants could not discriminate postures. With longer trials, the 7-month-olds demonstrated a familiarity preference for the upright whole figures, and the 9-month-olds demonstrated a novelty preference, albeit with a less robust effect. Unlike previous studies, we found that better gross motor skills were related to the 7-month-olds’ better discrimination of upright headless postures compared to inverted postures. The 9-month-old infants’ lower gross and fine motor skills were associated with a stronger preference for inverted compared to upright whole figures. This is further evidence of a configural representation of bodies in infancy, but it is constrained by an upper bias (heads in upright figures, feet in inverted), the test item similarity, and the trial duration. The measure and type of motor development reveals differential relationships with infants’ representations of bodies. Full article
(This article belongs to the Special Issue The Role of Early Sensorimotor Experiences in Cognitive Development)
Show Figures

Figure 1

27 pages, 1481 KiB  
Article
Integration of Associative Tokens into Thematic Hyperspace: A Method for Determining Semantically Significant Clusters in Dynamic Text Streams
by Dmitriy Rodionov, Boris Lyamin, Evgenii Konnikov, Elena Obukhova, Gleb Golikov and Prokhor Polyakov
Big Data Cogn. Comput. 2025, 9(8), 197; https://doi.org/10.3390/bdcc9080197 - 25 Jul 2025
Viewed by 159
Abstract
With the exponential growth of textual data, traditional topic modeling methods based on static analysis demonstrate limited effectiveness in tracking the dynamics of thematic content. This research aims to develop a method for quantifying the dynamics of topics within text corpora using a [...] Read more.
With the exponential growth of textual data, traditional topic modeling methods based on static analysis demonstrate limited effectiveness in tracking the dynamics of thematic content. This research aims to develop a method for quantifying the dynamics of topics within text corpora using a thematic signal (TS) function that accounts for temporal changes and semantic relationships. The proposed method combines associative tokens with original lexical units to reduce thematic entropy and information noise. Approaches employed include topic modeling (LDA), vector representations of texts (TF-IDF, Word2Vec), and time series analysis. The method was tested on a corpus of news texts (5000 documents). Results demonstrated robust identification of semantically meaningful thematic clusters. An inverse relationship was observed between the level of thematic significance and semantic diversity, confirming a reduction in entropy using the proposed method. This approach allows for quantifying topic dynamics, filtering noise, and determining the optimal number of clusters. Future applications include analyzing multilingual data and integration with neural network models. The method shows potential for monitoring information flows and predicting thematic trends. Full article
Show Figures

Figure 1

32 pages, 392 KiB  
Article
Decomposition of Idempotent Operators on Hilbert C*-Modules
by Wei Luo
Mathematics 2025, 13(15), 2378; https://doi.org/10.3390/math13152378 - 24 Jul 2025
Viewed by 112
Abstract
This study advances the application of the generalized Halmos’ two projections theorem to idempotent operators on Hilbert C*-modules through a comprehensive study of sums involving adjointable idempotents and their adjoints. We establish fundamental properties including the closedness, orthogonal complementability, Moore–Penrose inverses, [...] Read more.
This study advances the application of the generalized Halmos’ two projections theorem to idempotent operators on Hilbert C*-modules through a comprehensive study of sums involving adjointable idempotents and their adjoints. We establish fundamental properties including the closedness, orthogonal complementability, Moore–Penrose inverses, and spectral norms of such sums. For arbitrary (not necessarily adjointable) idempotent operators that admit a decomposition into linear combinations or products of two idempotents, we derive explicit representations for all such decompositions. A numerical example is given to show how our main theorem allows for the decomposition of idempotent matrices into linear combinations of two idempotent matrices, and two concrete examples on Hilbert C*-modules validate the theoretical significance of our framework. Full article
14 pages, 2616 KiB  
Article
Novel Throat-Attached Piezoelectric Sensors Based on Adam-Optimized Deep Belief Networks
by Ben Wang, Hua Xia, Yang Feng, Bingkun Zhang, Haoda Yu, Xulehan Yu and Keyong Hu
Micromachines 2025, 16(8), 841; https://doi.org/10.3390/mi16080841 - 22 Jul 2025
Viewed by 204
Abstract
This paper proposes an Adam-optimized Deep Belief Networks (Adam-DBNs) denoising method for throat-attached piezoelectric signals. The method aims to process mechanical vibration signals captured through polyvinylidene fluoride (PVDF) sensors attached to the throat region, which are typically contaminated by environmental noise and physiological [...] Read more.
This paper proposes an Adam-optimized Deep Belief Networks (Adam-DBNs) denoising method for throat-attached piezoelectric signals. The method aims to process mechanical vibration signals captured through polyvinylidene fluoride (PVDF) sensors attached to the throat region, which are typically contaminated by environmental noise and physiological noise. First, the short-time Fourier transform (STFT) is utilized to convert the original signals into the time–frequency domain. Subsequently, the masked time–frequency representation is reconstructed into the time domain through a diagonal average-based inverse STFT. To address complex nonlinear noise structures, a Deep Belief Network is further adopted to extract features and reconstruct clean signals, where the Adam optimization algorithm ensures the efficient convergence and stability of the training process. Compared with traditional Convolutional Neural Networks (CNNs), Adam-DBNs significantly improve waveform similarity by 6.77% and reduce the local noise energy residue by 0.099696. These results demonstrate that the Adam-DBNs method exhibits substantial advantages in signal reconstruction fidelity and residual noise suppression, providing an efficient and robust solution for throat-attached piezoelectric sensor signal enhancement tasks. Full article
(This article belongs to the Section E:Engineering and Technology)
Show Figures

Figure 1

24 pages, 14887 KiB  
Article
Estimation and Change Analysis of Grassland AGB in the China–Mongolia–Russia Border Area Based on Multi-Source Geospatial Data
by Jiani Ma, Chao Zhang, Cong Ou, Chi Qiu, Cuicui Yang, Beibei Wang and Urtnasan Mandakh
Remote Sens. 2025, 17(14), 2527; https://doi.org/10.3390/rs17142527 - 20 Jul 2025
Viewed by 343
Abstract
Aboveground biomass (AGB) is a critical indicator for assessing carbon sequestration and ecosystem health in transboundary ecologically fragile areas. High-precision estimation and spatiotemporal inversion of AGB are the key to investigating transition zones. However, inadequate feature selection and complex parameter tuning limit accuracy [...] Read more.
Aboveground biomass (AGB) is a critical indicator for assessing carbon sequestration and ecosystem health in transboundary ecologically fragile areas. High-precision estimation and spatiotemporal inversion of AGB are the key to investigating transition zones. However, inadequate feature selection and complex parameter tuning limit accuracy and spatiotemporal representation in the estimation model. An AGB estimation model that integrates SHAP-based feature selection with a particle swarm optimization-enhanced random forest model (RF_PSO) was proposed. Then AGB trajectory clustering was used to characterize the grassland change pattern. The method was applied to grasslands across the China–Mongolia–Russia (CMR) border area from 2000 to 2020. The results show that (1) the SHAP-RF_PSO model achieved the highest accuracy (R2 = 0.87, RMSE = 45.8 g/m2), outperforming other estimation models. (2) AGB improvements were observed in 72.13% of the area, mainly in MN_EA, MN_CE, and CN_NMG, while 27.39% showed degradation, concentrated in CN_NMG and MN_CE. The stable area accounts for 0.48%, which is scattered in RU_BU and RU_ZA.CN_NMG. (3) Four change patterns, namely Fluctuating Low, Stable Low, Fluctuating High, and Stable High, were identified, with major shifts in 2007, 2012, and 2014. (4) Projections indicate that 80% of the region may maintain current trends, 13% may reverse, and 7% remain uncertain, requiring targeted interventions. This study offers a robust tool for high-precision AGB estimation and supports dynamic monitoring in the CMR border area. Full article
Show Figures

Figure 1

17 pages, 3856 KiB  
Article
Wavelet Fusion with Sobel-Based Weighting for Enhanced Clarity in Underwater Hydraulic Infrastructure Inspection
by Minghui Zhang, Jingkui Zhang, Jugang Luo, Jiakun Hu, Xiaoping Zhang and Juncai Xu
Appl. Sci. 2025, 15(14), 8037; https://doi.org/10.3390/app15148037 - 18 Jul 2025
Viewed by 256
Abstract
Underwater inspection images of hydraulic structures often suffer from haze, severe color distortion, low contrast, and blurred textures, impairing the accuracy of automated crack, spalling, and corrosion detection. However, many existing enhancement methods fail to preserve structural details and suppress noise in turbid [...] Read more.
Underwater inspection images of hydraulic structures often suffer from haze, severe color distortion, low contrast, and blurred textures, impairing the accuracy of automated crack, spalling, and corrosion detection. However, many existing enhancement methods fail to preserve structural details and suppress noise in turbid environments. To address these limitations, we propose a compact image enhancement framework called Wavelet Fusion with Sobel-based Weighting (WWSF). This method first corrects global color and luminance distributions using multiscale Retinex and gamma mapping, followed by local contrast enhancement via CLAHE in the L channel of the CIELAB color space. Two preliminarily corrected images are decomposed using discrete wavelet transform (DWT); low-frequency bands are fused based on maximum energy, while high-frequency bands are adaptively weighted by Sobel edge energy to highlight structural features and suppress background noise. The enhanced image is reconstructed via inverse DWT. Experiments on real-world sluice gate datasets demonstrate that WWSF outperforms six state-of-the-art methods, achieving the highest scores on UIQM and AG while remaining competitive on entropy (EN). Moreover, the method retains strong robustness under high turbidity conditions (T ≥ 35 NTU), producing sharper edges, more faithful color representation, and improved texture clarity. These results indicate that WWSF is an effective preprocessing tool for downstream tasks such as segmentation, defect classification, and condition assessment of hydraulic infrastructure in complex underwater environments. Full article
Show Figures

Figure 1

22 pages, 487 KiB  
Article
Fuzzy Hypothesis Testing for Radar Detection: A Statistical Approach for Reducing False Alarm and Miss Probabilities
by Ahmed K. Elsherif, Hanan Haj Ahmad, Mohamed Aboshady and Basma Mostafa
Mathematics 2025, 13(14), 2299; https://doi.org/10.3390/math13142299 - 17 Jul 2025
Viewed by 232
Abstract
This paper addresses a fundamental challenge in statistical radar detection systems: optimizing the trade-off between the probability of a false alarm (PFA) and the probability of a miss (PM). These two metrics are inversely related and [...] Read more.
This paper addresses a fundamental challenge in statistical radar detection systems: optimizing the trade-off between the probability of a false alarm (PFA) and the probability of a miss (PM). These two metrics are inversely related and critical for performance evaluation. Traditional detection approaches often enhance one aspect at the expense of the other, limiting their practical applicability. To overcome this limitation, a fuzzy hypothesis testing framework is introduced that improves decision making under uncertainty by incorporating both crisp and fuzzy data representations. The methodology is divided into three phases. In the first phase, we reduce the probability of false alarm PFA while maintaining a constant probability of miss PM using crisp data characterized by deterministic values and classical statistical thresholds. In the second phase, the inverse scenario is considered: minimizing PM while keeping PFA fixed. This is achieved through parameter tuning and refined threshold calibration. In the third phase, a strategy is developed to simultaneously enhance both PFA and PM, despite their inverse correlation, by adopting adaptive decision rules. To further strengthen system adaptability, fuzzy data are introduced, which effectively model imprecision and ambiguity. This enhances robustness, particularly in scenarios where rapid and accurate classification is essential. The proposed methods are validated through both real and synthetic simulations of radar measurements, demonstrating their ability to enhance detection reliability across diverse conditions. The findings confirm the applicability of fuzzy hypothesis testing for modern radar systems in both civilian and military contexts, providing a statistically sound and operationally applicable approach for reducing detection errors and optimizing system performance. Full article
(This article belongs to the Special Issue New Advance in Applied Probability and Statistical Inference)
Show Figures

Figure 1

20 pages, 1765 KiB  
Article
Can Informativity Effects Be Predictability Effects in Disguise?
by Vsevolod Kapatsinski
Entropy 2025, 27(7), 739; https://doi.org/10.3390/e27070739 - 10 Jul 2025
Viewed by 574
Abstract
Recent work in corpus linguistics has observed that informativity predicts articulatory reduction of a linguistic unit above and beyond the unit’s predictability in the local context, i.e., the unit’s probability given the current context. Informativity of a unit is the inverse of average [...] Read more.
Recent work in corpus linguistics has observed that informativity predicts articulatory reduction of a linguistic unit above and beyond the unit’s predictability in the local context, i.e., the unit’s probability given the current context. Informativity of a unit is the inverse of average (log-scaled) predictability and corresponds to its information content. Research in the field has interpreted effects of informativity as speakers being sensitive to the information content of a unit in deciding how much effort to put into pronouncing it or as accumulation of memories of pronunciation details in long-term memory representations. However, average predictability can improve the estimate of local predictability of a unit above and beyond the observed predictability in that context, especially when that context is rare. Therefore, informativity can contribute to explaining variance in a dependent variable like reduction above and beyond local predictability simply because informativity improves the (inherently noisy) estimate of local predictability. This paper shows how to estimate the proportion of an observed informativity effect that is likely to be artifactual, due entirely to informativity improving the estimates of predictability, via simulation. The proposed simulation approach can be used to investigate whether an effect of informativity is likely to be real, under the assumption that corpus probabilities are an unbiased estimate of probabilities driving reduction behavior, and how much of it is likely to be due to noise in predictability estimates, in any real dataset. Full article
(This article belongs to the Special Issue Complexity Characteristics of Natural Language)
Show Figures

Figure 1

18 pages, 3224 KiB  
Article
Distributed Fiber Optic Sensing for Fracture Geometry Inversion Using All Time Steps Data
by Shaohua You, Geyitian Feng, Xiaojun Qian, Qinzhuo Liao, Zhengting Yan, Shuqi Sun, Xu Liu and Shirish Patil
Sensors 2025, 25(14), 4290; https://doi.org/10.3390/s25144290 - 9 Jul 2025
Viewed by 325
Abstract
As an advanced real-time monitoring technique, optic fiber downhole sensing has been widely applied in monitoring fracture propagation during hydraulic fracturing. However, existing fracture shape inversion methods face two main challenges: firstly, traditional methods struggle to accurately capture the dynamic changes in strain [...] Read more.
As an advanced real-time monitoring technique, optic fiber downhole sensing has been widely applied in monitoring fracture propagation during hydraulic fracturing. However, existing fracture shape inversion methods face two main challenges: firstly, traditional methods struggle to accurately capture the dynamic changes in strain rate and fracture shape during the propagation process, and secondly, they are computationally expensive. To address these issues, this study proposes a full-time-step fitting inversion method. By precisely fitting all time steps of fracture propagation, this method effectively overcomes the shape deviation problems often encountered in traditional methods and significantly reduces computational costs. Compared to conventional single-time-step inversion methods, our approach not only provides a more accurate representation of the spatiotemporal dynamics of fracture propagation but also avoids the risk of significant errors in fracture shape reconstruction. Therefore, the proposed inversion method holds substantial practical value and significance in fracture monitoring and sensing for oil and gas fields. Full article
(This article belongs to the Topic Distributed Optical Fiber Sensors)
Show Figures

Figure 1

17 pages, 7786 KiB  
Article
Video Coding Based on Ladder Subband Recovery and ResGroup Module
by Libo Wei, Aolin Zhang, Lei Liu, Jun Wang and Shuai Wang
Entropy 2025, 27(7), 734; https://doi.org/10.3390/e27070734 - 8 Jul 2025
Viewed by 290
Abstract
With the rapid development of video encoding technology in the field of computer vision, the demand for tasks such as video frame reconstruction, denoising, and super-resolution has been continuously increasing. However, traditional video encoding methods typically focus on extracting spatial or temporal domain [...] Read more.
With the rapid development of video encoding technology in the field of computer vision, the demand for tasks such as video frame reconstruction, denoising, and super-resolution has been continuously increasing. However, traditional video encoding methods typically focus on extracting spatial or temporal domain information, often facing challenges of insufficient accuracy and information loss when reconstructing high-frequency details, edges, and textures of images. To address this issue, this paper proposes an innovative LadderConv framework, which combines discrete wavelet transform (DWT) with spatial and channel attention mechanisms. By progressively recovering wavelet subbands, it effectively enhances the video frame encoding quality. Specifically, the LadderConv framework adopts a stepwise recovery approach for wavelet subbands, first processing high-frequency detail subbands with relatively less information, then enhancing the interaction between these subbands, and ultimately synthesizing a high-quality reconstructed image through inverse wavelet transform. Moreover, the framework introduces spatial and channel attention mechanisms, which further strengthen the focus on key regions and channel features, leading to notable improvements in detail restoration and image reconstruction accuracy. To optimize the performance of the LadderConv framework, particularly in detail recovery and high-frequency information extraction tasks, this paper designs an innovative ResGroup module. By using multi-layer convolution operations along with feature map compression and recovery, the ResGroup module enhances the network’s expressive capability and effectively reduces computational complexity. The ResGroup module captures multi-level features from low level to high level and retains rich feature information through residual connections, thus improving the overall reconstruction performance of the model. In experiments, the combination of the LadderConv framework and the ResGroup module demonstrates superior performance in video frame reconstruction tasks, particularly in recovering high-frequency information, image clarity, and detail representation. Full article
(This article belongs to the Special Issue Rethinking Representation Learning in the Age of Large Models)
Show Figures

Figure 1

29 pages, 1971 KiB  
Article
Mathematical Model of Data Processing in a Personalized Search Recommendation System for Digital Collections
by Serhii Semenov, Wojciech Baran, Magdalena Andrzejewska, Maxim Pochebut, Inna Petrovska, Oksana Sitnikova, Marharyta Melnyk and Anastasiya Mekhovykh
Appl. Sci. 2025, 15(13), 7583; https://doi.org/10.3390/app15137583 - 6 Jul 2025
Viewed by 356
Abstract
This paper presents a probabilistic-temporal modeling approach for analyzing data processing stages in a personalized recommendation system for digital heritage collections. The methodology is based on (Graphical Evaluation and Review Technique) GERT network formalism, which enables the representation of complex probabilistic workflows with [...] Read more.
This paper presents a probabilistic-temporal modeling approach for analyzing data processing stages in a personalized recommendation system for digital heritage collections. The methodology is based on (Graphical Evaluation and Review Technique) GERT network formalism, which enables the representation of complex probabilistic workflows with feedbacks and alternative branches. For each processing stage, corresponding GERT-schemes were developed, and equivalent transfer functions were derived. Using Laplace transform inversion techniques, probability density functions of processing time were recovered, followed by the calculation of key statistical metrics, including expectation, standard deviation, and quantiles. The results demonstrate that the proposed approach allows for detailed temporal performance evaluation, including the estimation of time exceedance probabilities at each stage. This provides a quantitative basis for optimizing recommendation system design and highlights the applicability of GERT-based modeling to intelligent data-driven services in the cultural domain. Full article
(This article belongs to the Special Issue Advanced Models and Algorithms for Recommender Systems)
Show Figures

Figure 1

23 pages, 1290 KiB  
Article
A KeyBERT-Enhanced Pipeline for Electronic Information Curriculum Knowledge Graphs: Design, Evaluation, and Ontology Alignment
by Guanghe Zhuang and Xiang Lu
Information 2025, 16(7), 580; https://doi.org/10.3390/info16070580 - 6 Jul 2025
Viewed by 404
Abstract
This paper proposes a KeyBERT-based method for constructing a knowledge graph of the electronic information curriculum system, aiming to enhance the structured representation and relational analysis of educational content. Electronic Information Engineering curricula encompass diverse and rapidly evolving topics; however, existing knowledge graphs [...] Read more.
This paper proposes a KeyBERT-based method for constructing a knowledge graph of the electronic information curriculum system, aiming to enhance the structured representation and relational analysis of educational content. Electronic Information Engineering curricula encompass diverse and rapidly evolving topics; however, existing knowledge graphs often overlook multi-word concepts and more nuanced semantic relationships. To address this gap, this paper presents a KeyBERT-enhanced method for constructing a knowledge graph of the electronic information curriculum system. Utilizing teaching plans, syllabi, and approximately 500,000 words of course materials from 17 courses, we first extracted 500 knowledge points via the Term Frequency–Inverse Document Frequency (TF-IDF) algorithm to build a baseline course–knowledge matrix and visualize the preliminary graph using Graph Convolutional Networks (GCN) and Neo4j. We then applied KeyBERT to extract about 1000 knowledge points—approximately 65% of extracted terms were multi-word phrases—and augment the graph with co-occurrence and semantic-similarity edges. Comparative experiments demonstrate a ~20% increase in non-zero matrix coverage and a ~40% boost in edge count (from 5100 to 7100), significantly enhancing graph connectivity. Moreover, we performed sensitivity analysis on extraction thresholds (co-occurrence ≥ 5, similarity ≥ 0.7), revealing that (5, 0.7) maximizes the F1-score at 0.83. Hyperparameter ablation over n-gram ranges [(1,1),(1,2),(1,3)] and top_n [5, 10, 15] identifies (1,3) + top_n = 10 as optimal (Precision = 0.86, Recall = 0.81, F1 = 0.83). Finally, GCN downstream tests show that, despite higher sparsity (KeyBERT 64% vs. TF-IDF 40%), KeyBERT features achieve Accuracy = 0.78 and F1 = 0.75, outperforming TF-IDF’s 0.66/0.69. This approach offers a novel, rigorously evaluated solution for optimizing the electronic information curriculum system and can be extended through terminology standardization or larger data integration. Full article
Show Figures

Figure 1

27 pages, 6102 KiB  
Article
Inverse Kinematics for Robotic Manipulators via Deep Neural Networks: Experiments and Results
by Ana Calzada-Garcia, Juan G. Victores, Francisco J. Naranjo-Campos and Carlos Balaguer
Appl. Sci. 2025, 15(13), 7226; https://doi.org/10.3390/app15137226 - 26 Jun 2025
Viewed by 391
Abstract
This paper explores the application of Deep Neural Networks (DNNs) to solve the Inverse Kinematics (IK) problem in robotic manipulators. The IK problem, crucial for ensuring precision in robotic movements, involves determining joint configurations for a manipulator to reach a desired position or [...] Read more.
This paper explores the application of Deep Neural Networks (DNNs) to solve the Inverse Kinematics (IK) problem in robotic manipulators. The IK problem, crucial for ensuring precision in robotic movements, involves determining joint configurations for a manipulator to reach a desired position or orientation. Traditional methods, such as analytical and numerical approaches, have limitations, especially for redundant manipulators, or involve high computational costs. Recent advances in machine learning, particularly with DNNs, have shown promising results and seem fit for addressing these challenges. This study investigates several DNN architectures, namely Feed-Forward Multilayer Perceptrons (MLPs), Convolutional Neural Networks (CNNs), and Recurrent Neural Networks (RNNs), for solving the IK problem, using the TIAGo robotic arm with seven Degrees of Freedom (DOFs). Different training datasets, normalization techniques, and orientation representations are tested, and custom metrics are introduced to evaluate position and orientation errors. The performance of these models is compared, with a focus on curriculum learning to optimize training. The results demonstrate the potential of DNNs to efficiently solve the IK problem while avoiding issues such as singularities, competing with traditional methods in precision and speed. Full article
(This article belongs to the Special Issue Technological Breakthroughs in Automation and Robotics)
Show Figures

Figure 1

22 pages, 2286 KiB  
Article
GPR-Based Leakage Reconstruction of Shallow-Buried Water Supply Pipelines Using an Improved UNet++ Network
by Qingqi Xu, Qinghua Liu and Shan Ouyang
Remote Sens. 2025, 17(13), 2174; https://doi.org/10.3390/rs17132174 - 25 Jun 2025
Viewed by 251
Abstract
Ground-penetrating radar (GPR) plays a critical role in detecting underground targets, particularly locating and characterizing leaks in buried pipelines. However, the complex nature of GPR images related to pipeline leaks, combined with the limitations of existing neural network-based inversion methods, such as insufficient [...] Read more.
Ground-penetrating radar (GPR) plays a critical role in detecting underground targets, particularly locating and characterizing leaks in buried pipelines. However, the complex nature of GPR images related to pipeline leaks, combined with the limitations of existing neural network-based inversion methods, such as insufficient feature extraction and low inversion accuracy, poses significant challenges for effective leakage reconstruction. To address these challenges, this paper proposes an enhanced UNet++-based model: the Multi-Scale Directional Network PlusPlus (MSDNet++). The network employs an encoder–decoder architecture, in which the encoder incorporates multi-scale directional convolutions with coordinate attention to extract and compress features across different scales effectively. The decoder fuses multi-level features through dense skip connections and further enhances the representation of critical information via coordinate attention, enabling the accurate inversion of dielectric constant images. Experimental results on both simulated and real-world data demonstrate that MSDNet++ can accurately invert the location and extent of buried pipeline leaks from GPR B-scan images. Full article
(This article belongs to the Special Issue Advanced Ground-Penetrating Radar (GPR) Technologies and Applications)
Show Figures

Figure 1

20 pages, 4098 KiB  
Article
Hierarchical Deep Learning for Comprehensive Epileptic Seizure Analysis: From Detection to Fine-Grained Classification
by Peter Akor, Godwin Enemali, Usman Muhammad, Rajiv Ranjan Singh and Hadi Larijani
Information 2025, 16(7), 532; https://doi.org/10.3390/info16070532 - 24 Jun 2025
Viewed by 460
Abstract
Epileptic seizure detection and classification from EEG recordings faces significant challenges due to extreme class imbalance. Analysis of the Temple University Hospital Seizure (TUSZ) dataset reveals imbalance ratios of 150:1 between common and rare seizure types, with high temporal heterogeneity (seizure durations of [...] Read more.
Epileptic seizure detection and classification from EEG recordings faces significant challenges due to extreme class imbalance. Analysis of the Temple University Hospital Seizure (TUSZ) dataset reveals imbalance ratios of 150:1 between common and rare seizure types, with high temporal heterogeneity (seizure durations of 1–1638 s). We propose a cascaded deep learning architecture with two specialized CNNs: a binary detector followed by a multi-class classifier. This approach decomposes the classification problem, reducing the maximum imbalance from 150:1 to manageable levels (9:1 binary, 5:1 type). The architecture implements a high-confidence filtering mechanism (threshold = 0.9), creating a 99.5% pure dataset for type classification, dynamic class-weighted optimization proportional to inverse class frequencies, and information flow refinement through progressive stages. Loss dynamics analysis reveals that our weighting scheme strategically redistributes optimization attention, reducing variance by 90.7% for majority classes while increasing variance for minority classes, ensuring all seizure types receive proportional learning signals regardless of representation. The binary classifier achieves 99.64% specificity and 98.23% sensitivity (ROC-AUC = 0.995). The type classifier demonstrates >99% accuracy across seven seizure categories with perfect (100%) classification for three seizure types despite minimal representation. Cross-dataset validation on the University of Bonn dataset confirms robust generalization (96.0% accuracy) for binary seizure detection. This framework effectively addresses multi-level imbalance in neurophysiological signal classification with hierarchical class structures. Full article
Show Figures

Graphical abstract

Back to TopTop