Nothing Special   »   [go: up one dir, main page]

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

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
remove_circle_outline

Article Types

Countries / Regions

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Search Results (1,093)

Search Parameters:
Keywords = topological localization

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
13 pages, 6259 KiB  
Article
Bound States and Particle Production by Breather-Type Background Field Configurations
by Abhishek Rout and Brett Altschul
Symmetry 2024, 16(12), 1571; https://doi.org/10.3390/sym16121571 - 24 Nov 2024
Viewed by 206
Abstract
We investigate the interaction of fermion fields with oscillating domain walls, inspired by breather-type solutions of the sine-Gordon equation, a nonlinear system of fundamental importance. Our study focuses on the fermionic bound states and particle production induced by a time-dependent scalar background field. [...] Read more.
We investigate the interaction of fermion fields with oscillating domain walls, inspired by breather-type solutions of the sine-Gordon equation, a nonlinear system of fundamental importance. Our study focuses on the fermionic bound states and particle production induced by a time-dependent scalar background field. The fermions couple to two domain walls undergoing harmonic motion, and we explore the resulting dynamics of the fermionic wave functions. We demonstrate that while fermions initially form bound states around the domain walls, the energy provided by the oscillatory motion of the scalar field induces an outward flux of fermions and antifermions, leading to particle production and eventual flux propagation toward spatial infinity. Through numerical simulations, we observe that the fermion density exhibits quasiperiodic behavior, with partial recurrences of the bound state configurations after each oscillation period. However, the fermion wave functions do not remain localized, and over time, the density decreases as more particles escape the vicinity of the domain walls. Our results highlight that the sine-Gordon-like breather background, when coupled non-supersymmetrically to fermions, does not preserve integrability or stability, with the oscillations driving a continuous energy transfer into the fermionic modes. This study sheds light on the challenges of maintaining steady-state fermion solutions in time-dependent topological backgrounds and offers insights into particle production mechanisms in nonlinear dynamical systems with oscillating solitons. Full article
(This article belongs to the Section Physics)
17 pages, 5937 KiB  
Article
Topology Optimization of Periodic Structures Subject to Self-Weight Loading Using a Heuristic Method
by Katarzyna Tajs-Zielińska
Materials 2024, 17(22), 5652; https://doi.org/10.3390/ma17225652 - 19 Nov 2024
Viewed by 348
Abstract
This paper deals with the actual and challenging process of the optimal design of topologies of periodic structures taking into account the design-dependent loads. The topology formulation used in this paper minimizes the compliance value of the structure and is subject to a [...] Read more.
This paper deals with the actual and challenging process of the optimal design of topologies of periodic structures taking into account the design-dependent loads. The topology formulation used in this paper minimizes the compliance value of the structure and is subject to a total volume constraint while maintaining a periodic pattern and self-weight load. This combination represents a promising and original contribution to the field of ongoing research, although it is not yet widely recognized. This paper aims to fill this gap by presenting the first results of numerical optimization tests. The redistribution of material within a design domain is governed by the rules of Cellular Automata, a locally oriented optimization tool that can be applied to all types of structural optimization, including topology optimization. The technique has been demonstrated by numerical tests on two- and three-dimensional examples. The calculations were performed for different types of periodic schemes. The optimized structures did not show the checkerboard effect or the presence of residual gray elements in the final topologies. The strategy used in this paper ensures connectivity between periodic subdomains without imposing additional conditions on the algorithm. Full article
(This article belongs to the Section Materials Simulation and Design)
Show Figures

Figure 1

Figure 1
<p>The flowchart of the topology optimization algorithm.</p>
Full article ">Figure 2
<p>Example 1: (<b>a</b>) initial structure, applied load, and supports; (<b>b</b>) final topology for applied load and volume fraction 0.4 (no periodicity, no self-weight, P = 100 N, final compliance 17,936 Nmm). The red line shows an initial design space for convenience.</p>
Full article ">Figure 3
<p>Compliance history for example 1.</p>
Full article ">Figure 4
<p>Percentage of gray elements at each iteration step for example 1.</p>
Full article ">Figure 5
<p>Topologies for example 1 (red line shows an initial design space for convenience): (<b>a</b>) applied force equals P = 1000 N and self-weight (final compliance: 2,014,111 Nmm); (<b>b</b>) applied force equals P = 500 N and self-weight (final compliance: 571,548 Nmm); (<b>c</b>) applied force equals P = 100 N and self-weight (final compliance: 50,045 Nmm); (<b>d</b>) applied force equals P = 20 N and self-weight (final compliance: 13,476 Nmm); (<b>e</b>) applied force equals P = 10 N and self-weight (final compliance: 10,240 Nmm); (<b>f</b>) self-weight only (final compliance: 6758 Nmm).</p>
Full article ">Figure 5 Cont.
<p>Topologies for example 1 (red line shows an initial design space for convenience): (<b>a</b>) applied force equals P = 1000 N and self-weight (final compliance: 2,014,111 Nmm); (<b>b</b>) applied force equals P = 500 N and self-weight (final compliance: 571,548 Nmm); (<b>c</b>) applied force equals P = 100 N and self-weight (final compliance: 50,045 Nmm); (<b>d</b>) applied force equals P = 20 N and self-weight (final compliance: 13,476 Nmm); (<b>e</b>) applied force equals P = 10 N and self-weight (final compliance: 10,240 Nmm); (<b>f</b>) self-weight only (final compliance: 6758 Nmm).</p>
Full article ">Figure 6
<p>Periodicity schemes and final topologies for example 1 considering concentrated, external load P only (red line shows an initial design space for convenience): (<b>a</b>) periodicity scheme I: 2 subdomains (final compliance: 21,814 Nmm); (<b>b</b>) periodicity scheme II: 3 subdomains (final compliance: 35,710 Nmm); (<b>c</b>) periodicity scheme III: 4 subdomains (final compliance: 30,829 Nmm); (<b>d</b>) periodicity scheme IV: 5 subdomains (final compliance: 37,199 Nmm).</p>
Full article ">Figure 7
<p>Final values of compliances for example 1 for assumed periodicity schemes.</p>
Full article ">Figure 8
<p>Final topologies for example 1 considering self-weight only (red line shows an initial design space for convenience): (<b>a</b>) periodicity scheme I: 2 subdomains (final compliance: 10,968 Nmm); (<b>b</b>) periodicity scheme II: 3 subdomains (final compliance: 14,514 Nmm); (<b>c</b>) periodicity scheme III: 4 subdomains (final compliance: 17,316 Nmm); (<b>d</b>) periodicity scheme IV: 5 subdomains (final compliance: 18,390 Nmm).</p>
Full article ">Figure 9
<p>Final topologies for example 1 considering self-weight and external load P = 30 N (red line shows an initial design space for convenience): (<b>a</b>) periodicity scheme I: 2 subdomains (final compliance: 20,614 Nmm); (<b>b</b>) periodicity scheme II: 3 subdomains (final compliance: 29,733 Nmm); (<b>c</b>) periodicity scheme III: 4 subdomains (final compliance: 31,302 Nmm); (<b>d</b>) periodicity scheme IV: 5 subdomains (final compliance: 34,704 Nmm).</p>
Full article ">Figure 10
<p>Final topologies for example 1 considering self-weight and external load P = 100 N (red line shows an initial design space for convenience): (<b>a</b>) periodicity scheme I: 2 subdomains (final compliance: 58,059 Nmm); (<b>b</b>) periodicity scheme II: 3 subdomains (final compliance: 90,058 Nmm); (<b>c</b>) periodicity scheme III: 4 subdomains (final compliance: 83,266 Nmm); (<b>d</b>) periodicity scheme IV: 5 subdomains (final compliance: 107,902 Nmm).</p>
Full article ">Figure 11
<p>Compliance history for example 1 with five subdomains considering self-weight and external load P = 100 N: (<b>a</b>) periodicity scheme I: 2 subdomains; (<b>b</b>) periodicity scheme II: 3 subdomains; (<b>c</b>) periodicity scheme III: 4 subdomains; (<b>d</b>) periodicity scheme IV: 5 subdomains.</p>
Full article ">Figure 11 Cont.
<p>Compliance history for example 1 with five subdomains considering self-weight and external load P = 100 N: (<b>a</b>) periodicity scheme I: 2 subdomains; (<b>b</b>) periodicity scheme II: 3 subdomains; (<b>c</b>) periodicity scheme III: 4 subdomains; (<b>d</b>) periodicity scheme IV: 5 subdomains.</p>
Full article ">Figure 12
<p>Cantilever T-beam: (<b>a</b>) initial structure, applied load, and supports; (<b>b</b>) cross-section of the beam.</p>
Full article ">Figure 13
<p>The cantilever T-beam results: (<b>a</b>) front view with the closed left end marked in dark blue and the support on the right side marked in gray; (<b>b</b>) front view with subdomain boundaries marked in red.</p>
Full article ">Figure 14
<p>Compliance history for the cantilever T-beam.</p>
Full article ">Figure 15
<p>Percentage of gray elements at each iteration step for the cantilever T-beam.</p>
Full article ">Figure 16
<p>The cantilever T-beam results: (<b>a</b>) front view: only self-weight is considered; (<b>b</b>) front view: only distributed load P is considered.</p>
Full article ">Figure 17
<p>The cantilever T-beam results after redesigning: (<b>a</b>) isometric view of the mesh; (<b>b</b>) isometric view of the CAD model.</p>
Full article ">
17 pages, 3228 KiB  
Article
A Method for Fault Localization in Distribution Networks with High Proportions of Distributed Generation Based on Graph Convolutional Networks
by Xiping Ma, Wenxi Zhen, Haodong Ren, Guangru Zhang, Kai Zhang and Haiying Dong
Energies 2024, 17(22), 5758; https://doi.org/10.3390/en17225758 - 18 Nov 2024
Viewed by 351
Abstract
To address the issues arising from the integration of a high proportion of distributed generation (DG) into the distribution network, which has led to the transition from traditional single-source to multi-source distribution systems, resulting in increased complexity of the distribution network topology and [...] Read more.
To address the issues arising from the integration of a high proportion of distributed generation (DG) into the distribution network, which has led to the transition from traditional single-source to multi-source distribution systems, resulting in increased complexity of the distribution network topology and difficulties in fault localization, this paper proposes a fault localization method based on graph convolutional networks (GCNs) for distribution networks with a high proportion of distributed generation. By abstracting busbars and lines into graph structure nodes and edges, GCN captures spatial coupling relationships between nodes, using key electrical quantities such as node voltage magnitude, current magnitude, power, and phase angle as input features to construct a fault localization model. A multi-type fault dataset is generated using the Matpower toolbox, and model training is evaluated using K-fold cross-validation. The training process is optimized through early stopping mechanisms and learning rate scheduling. Simulations are conducted based on the IEEE 33-node distribution network benchmark, with photovoltaic generation, wind generation, and energy storage systems connected at specific nodes, validating the model’s fault localization capability under various fault types (single-phase ground fault, phase-to-phase short circuit, and line open circuit). Experimental results demonstrate that the proposed model can effectively locate fault nodes in complex distribution networks with high DG integration, achieving an accuracy of 98.5% and an AUC value of 0.9997. It still shows strong robustness in noisy environments and is significantly higher than convolutional neural networks and other methods in terms of model localization accuracy, training time, F1 score, AUC value, and single fault detection inference time, which has good potential for practical application. Full article
(This article belongs to the Special Issue Clean and Efficient Use of Energy: 2nd Edition)
Show Figures

Figure 1

Figure 1
<p>Structure of GCN model.</p>
Full article ">Figure 2
<p>Flowchart of GCN-based fault traceability in distribution networks.</p>
Full article ">Figure 3
<p>K-fold visualization for 10 folds.</p>
Full article ">Figure 4
<p>IEEE 33-Bus Topology Diagram with Integrated Distributed Generation.</p>
Full article ">Figure 5
<p>Visualization Results of Fault Location in Distribution Networks.</p>
Full article ">Figure 6
<p>Training and Validation Loss Curve.</p>
Full article ">Figure 7
<p>Training and Validation Accuracy Curve.</p>
Full article ">Figure 8
<p>ROC Curve.</p>
Full article ">
17 pages, 2661 KiB  
Article
Spatially Localized Visual Perception Estimation by Means of Prosthetic Vision Simulation
by Diego Luján Villarreal and Wolfgang Krautschneider
J. Imaging 2024, 10(11), 294; https://doi.org/10.3390/jimaging10110294 - 18 Nov 2024
Viewed by 425
Abstract
Retinal prosthetic devices aim to repair some vision in visually impaired patients by electrically stimulating neural cells in the visual system. Although there have been several notable advancements in the creation of electrically stimulated small dot-like perceptions, a deeper comprehension of the physical [...] Read more.
Retinal prosthetic devices aim to repair some vision in visually impaired patients by electrically stimulating neural cells in the visual system. Although there have been several notable advancements in the creation of electrically stimulated small dot-like perceptions, a deeper comprehension of the physical properties of phosphenes is still necessary. This study analyzes the influence of two independent electrode array topologies to achieve single-localized stimulation while the retina is electrically stimulated: a two-dimensional (2D) hexagon-shaped array reported in clinical studies and a patented three-dimensional (3D) linear electrode carrier. For both, cell stimulation is verified in COMSOL Multiphysics by developing a lifelike 3D computational model that includes the relevant retinal interface elements and dynamics of the voltage-gated ionic channels. The evoked percepts previously described in clinical studies using the 2D array are strongly associated with our simulation-based findings, allowing for the development of analytical models of the evoked percepts. Moreover, our findings identify differences between visual sensations induced by the arrays. The 2D array showed drawbacks during stimulation; similarly, the state-of-the-art 2D visual prostheses provide only dot-like visual sensations in close proximity to the electrode. The 3D design could offer a technique for improving cell selectivity because it requires low-intensity threshold activation which results in volumes of stimulation similar to the volume surrounded by a solitary RGC. Our research establishes a proof-of-concept technique for determining the utility of the 3D electrode array for selectively activating individual RGCs at the highest density via small-sized electrodes while maintaining electrochemical safety. Full article
Show Figures

Figure 1

Figure 1
<p>Algorithm of the activation area. Steps showing letters and colors that are related to the same corresponding actions in the algorithm. <span class="html-italic">J<sub>c</sub></span> is the peak boundary current density of RGC. (Reprinted with permission from ref. [<a href="#B27-jimaging-10-00294" class="html-bibr">27</a>] Copyright 2019, Springer Nature).</p>
Full article ">Figure 2
<p>(<b>a</b>) Simulation model built in Comsol Multiphysics. (<b>b</b>) a zoomed-in view of the layers included in the model. p corresponds to the proximity of cells to the electrodes. θ is the angle of displacement along the width of the array. The electrodes are in contact with the retinal surface layer. (<b>c</b>) Twenty-five stimulating electrodes are arranged in a hexagonal array (data from [<a href="#B5-jimaging-10-00294" class="html-bibr">5</a>]). (<b>d</b>) Charge-balanced biphasic current pulse with pulse train frequency of 100 Hz. (Reprinted with permission from ref. [<a href="#B27-jimaging-10-00294" class="html-bibr">27</a>] Copyright 2019, Springer Nature).</p>
Full article ">Figure 3
<p>(<b>a</b>) A Three-dimensional linear electrode carrier can carry a plurality of penetrating electrodes. The electrodes are arranged along a substantially straight line to penetrate into or through the surface of the ganglionic layer. (<b>b</b>) The 3D retinal model implemented in Comsol Multiphysics (not drawn to scale). The model consists of tissue boxes that represent a segment of the human eye. A single pair of electrodes involving an active electrode and ground electrode is implemented using epi-retinal design. (<b>c</b>) The results of the action potential at the membrane triggered an average peak stimulus density of 11.31 A/m<sup>2</sup> from the electrode. The single RGC located between the active and ground electrodes obtains an average boundary-peak stimulus density of 3.1 A/m<sup>2</sup>. (<b>d</b>) On the left, groups of planes (zx, xy, yz) illustrate dashed-line squares representing the stimulation cube (drawn to scale with respect to the size of the electrode). On right, the white-line squares represent the dimensions of the cube seen on the groups of the planes (drawn to scale with respect to the size of the electrode). Current density distribution was determined in COMSOL Multiphysics using the surface/contour feature. On the top, we used a colormap to identify current densities applied to the RGC.</p>
Full article ">Figure 4
<p>Relationship between stimulation patterns and simulations. Spatial patterns in the first column are drawn to scale with respect to electrode diameter and inter electrode distance. Simulated visual percepts highlighted in dark brown (in background), yellow, and orange in figure (<b>h</b>) are generated with the current amplitudes and proximities of 13 µA and 25 µm, 26 µA and 50 µm, and 13 µA and 50 µm. Conductivities of the ganglionic layer and intracellular space were decreased with a factor of 10 due to the different data found. Sizes of visual percepts are related to the surface of the retina. (Reprinted with permission from ref. [<a href="#B27-jimaging-10-00294" class="html-bibr">27</a>] Copyright 2019, Springer Nature).</p>
Full article ">
19 pages, 1848 KiB  
Article
Underwater Network Time Synchronization Method Based on Probabilistic Graphical Models
by Yujie Ouyang, Yunfeng Han, Zeyu Wang and Yifei He
J. Mar. Sci. Eng. 2024, 12(11), 2079; https://doi.org/10.3390/jmse12112079 - 18 Nov 2024
Viewed by 336
Abstract
In underwater clustering and benchmark networks, nodes need to reduce the rate and energy consumption of acoustic communication while ensuring synchronization accuracy. In large-scale networks, the improvement in the efficiency of existing network time synchronization often relies on the optimization of topological structures, [...] Read more.
In underwater clustering and benchmark networks, nodes need to reduce the rate and energy consumption of acoustic communication while ensuring synchronization accuracy. In large-scale networks, the improvement in the efficiency of existing network time synchronization often relies on the optimization of topological structures, and the improvement in efficiency within local areas is limited. This paper proposes a method to synchronize underwater time using the probability graph model. The method utilizes the positional and motion status information of sensor networks to construct a factor graph model for distributed network synchronization. By simplifying the marginal probability density function of the system clock difference, it can quickly calculate the clock difference parameters of nodes, thereby effectively improve the synchronization efficiency. The experimental results show that the method can complete global time synchronization within a cycle while achieving a clock difference correction accuracy higher than seconds, which significantly optimized the synchronization cycle and efficiency, and reduced the energy consumption of the acoustic communication. Full article
(This article belongs to the Special Issue Advances in Underwater Positioning and Navigation Technology)
Show Figures

Graphical abstract

Graphical abstract
Full article ">Figure 1
<p>Underwater sensor network topologies. The black dot represents the central node, and the red dot represents the node to be synchronized. The black dashed line represents the process of time synchronization between the central node and the nodes to be synchronized, while the red dashed line represents the time synchronization between the nodes to be synchronized.</p>
Full article ">Figure 2
<p>Schematic diagram of underwater network time synchronization scenario. The white dashed line represents communication between mobile nodes, while the black curve represents the motion trajectory of the mobile nodes.</p>
Full article ">Figure 3
<p>Network topology structure of time synchronization methods based on probabilistic graphical models. The solid line in the figure represents sea level, the white square represents the water surface reference nodeand the red and black dashed lines have the same meaning as in <a href="#jmse-12-02079-f001" class="html-fig">Figure 1</a>.</p>
Full article ">Figure 4
<p>Cluster-assisted probabilistic graphical model network topology structure. The unmarked curve is consistent with <a href="#jmse-12-02079-f003" class="html-fig">Figure 3</a>.</p>
Full article ">Figure 5
<p>Schematic diagram of intra-cluster time synchronization. The red arrow indicates the time synchronization request initiated by the cluster head node.</p>
Full article ">Figure 6
<p>Schematic diagram of intra-cluster time synchronization techniques using probabilistic graph methods. The red arrow represents the time synchronization information of cluster head node A, yellow represents node B, and blue represents node C.</p>
Full article ">Figure 7
<p>Factorgraph model for single-cycle underwater network time synchronization. The circle represents the corresponding variable node in the factor graph.</p>
Full article ">Figure 8
<p>Factor graph model for single-node underwater network time synchronization. The circle represents the corresponding variable node in the factor graph.</p>
Full article ">Figure 9
<p>Factor graph model for multi-cycle underwater network time synchronization. The circle represents the corresponding variable node in the factor graph.</p>
Full article ">Figure 10
<p>Experimental site. (<b>a</b>) The red box in the middle indicates the complete anchor structure, while the red box in (<b>b</b>) indicates the recovered beacon.</p>
Full article ">Figure 11
<p>Schematic diagram of sea trial beacon positions.</p>
Full article ">Figure 12
<p>Acoustic velocity profile.</p>
Full article ">Figure 13
<p>Measurement timestamps of J1.</p>
Full article ">Figure 14
<p>Measurement timestamps of J2.</p>
Full article ">Figure 15
<p>Measurement timestamps of J4.</p>
Full article ">Figure 16
<p>Clock offset estimation of J2.</p>
Full article ">Figure 17
<p>Clock offset estimation of J4.</p>
Full article ">Figure 18
<p>Comparison of clock offset estimation errors for J2.</p>
Full article ">Figure 19
<p>Comparison of clock offset estimation errors for J4.</p>
Full article ">
12 pages, 374 KiB  
Review
Exploring the Percolation Phenomena in Quantum Networks
by Chuanxin Wang, Xinqi Hu and Gaogao Dong
Mathematics 2024, 12(22), 3568; https://doi.org/10.3390/math12223568 - 15 Nov 2024
Viewed by 304
Abstract
Quantum entanglement as a non-local correlation between particles is critical to the transmission of quantum information in quantum networks (QNs); the key challenge lies in establishing long-distance entanglement transmission between distant targets. This issue aligns with percolation theory, and as a result, an [...] Read more.
Quantum entanglement as a non-local correlation between particles is critical to the transmission of quantum information in quantum networks (QNs); the key challenge lies in establishing long-distance entanglement transmission between distant targets. This issue aligns with percolation theory, and as a result, an entanglement distribution scheme called “Classical Entanglement Percolation” (CEP) has been proposed. While this scheme provides an effective framework, “Quantum Entanglement Percolation” (QEP) indicates a lower percolation threshold through quantum preprocessing strategies, which will modify the network topology. Meanwhile, an emerging statistical theory known as “Concurrence Percolation” reveals the unique advantages of quantum networks, enabling entanglement transmission under lower conditions. It fundamentally belongs to a different universality class from classical percolation. Although these studies have made significant theoretical advancements, most are based on an idealized pure state network model. In practical applications, quantum states are often affected by thermal noise, resulting in mixed states. When these mixed states meet specific conditions, they can be transformed into pure states through quantum operations and further converted into singlets with a certain probability, thereby facilitating entanglement percolation in mixed state networks. This finding greatly broadens the application prospects of quantum networks. This review offers a comprehensive overview of the fundamental theories of quantum percolation and the latest cutting-edge research developments. Full article
(This article belongs to the Special Issue Complex Network Modeling: Theory and Applications, 2nd Edition)
Show Figures

Figure 1

Figure 1
<p>The three graphs illustrate the connectivity of a square lattice network at different probabilities <span class="html-italic">p</span>. When <math display="inline"><semantics> <mrow> <mi>p</mi> <mo>=</mo> <mn>0.25</mn> </mrow> </semantics></math>, there are only scattered clusters; at <math display="inline"><semantics> <mrow> <mi>p</mi> <mo>=</mo> <mn>0.5</mn> </mrow> </semantics></math>, a clear connected path spans the entire lattice; while at <math display="inline"><semantics> <mrow> <mi>p</mi> <mo>=</mo> <mn>0.75</mn> </mrow> </semantics></math>, large-scale connected paths become even more apparent, with almost all nodes being connected.</p>
Full article ">Figure 2
<p>Small dots represent individual qubits, while large dots represent nodes in the network, with each node typically consisting of multiple qubits. The edges represent the entangled pure state formed between two qubits.</p>
Full article ">Figure 3
<p>(<b>a</b>) Star-Mesh transform compresses a star graph with loops (n nodes) into a complete graph with fewer nodes (n-1 nodes), thereby simplifying the topology. During this process, the connectivity equivalence between two specified nodes S and T is preserved. (<b>b</b>,<b>c</b>) Series rule and parallel rule: When multiple quantum channels (or connections) are connected in series or parallel, their overall equivalent transmission characteristics can be calculated using the series rule or parallel rule.</p>
Full article ">Figure 4
<p><math display="inline"><semantics> <mrow> <mo>(</mo> <mi>U</mi> <mo>,</mo> <mi>V</mi> <mo>)</mo> </mrow> </semantics></math> flower: The <math display="inline"><semantics> <msub> <mi>n</mi> <mrow> <mi>t</mi> <mi>h</mi> </mrow> </msub> </semantics></math> generation <math display="inline"><semantics> <mrow> <mo>(</mo> <mi>U</mi> <mo>,</mo> <mi>V</mi> <mo>)</mo> </mrow> </semantics></math> flower is shown in the figure, with (<b>a</b>) <math display="inline"><semantics> <mrow> <mi>n</mi> <mo>=</mo> <mn>1</mn> </mrow> </semantics></math> and (<b>b</b>) <math display="inline"><semantics> <mrow> <mi>n</mi> <mo>=</mo> <mn>2</mn> </mrow> </semantics></math>, where the blue paths represent the shorter path <math display="inline"><semantics> <mrow> <mi>U</mi> <mo>=</mo> <mn>2</mn> </mrow> </semantics></math>, and the orange paths represent the longer path <math display="inline"><semantics> <mrow> <mi>V</mi> <mo>=</mo> <mn>3</mn> </mrow> </semantics></math>.</p>
Full article ">
37 pages, 8673 KiB  
Article
Structure-Function Relationship of the Ryanodine Receptor Cluster Network in Sinoatrial Node Cells
by Alexander V. Maltsev, Valeria Ventura Subirachs, Oliver Monfredi, Magdalena Juhaszova, Pooja Ajay Warrier, Shardul Rakshit, Syevda Tagirova, Anna V. Maltsev, Michael D. Stern, Edward G. Lakatta and Victor A. Maltsev
Cells 2024, 13(22), 1885; https://doi.org/10.3390/cells13221885 - 14 Nov 2024
Viewed by 665
Abstract
The rate of spontaneous action potentials (APs) generated by sinoatrial node cells (SANC) is regulated by local Ca2+ release (LCR) from the sarcoplasmic reticulum via Ca2+ release channels (ryanodine receptors, RyRs). LCR events propagate and self-organize within the network of RyR [...] Read more.
The rate of spontaneous action potentials (APs) generated by sinoatrial node cells (SANC) is regulated by local Ca2+ release (LCR) from the sarcoplasmic reticulum via Ca2+ release channels (ryanodine receptors, RyRs). LCR events propagate and self-organize within the network of RyR clusters (Ca release units, CRUs) via Ca-induced-Ca-release (CICR) that depends on CRU sizes and locations: While larger CRUs generate stronger release signals, the network’s topology governs signal diffusion and propagation. This study used super-resolution structured illumination microscopy to image the 3D network of CRUs in rabbit SANC. The peripheral CRUs formed a spatial mesh, reflecting the cell surface geometry. Two distinct subpopulations of CRUs were identified within each cell, with size distributions conforming to a two-component Gamma mixture model. Furthermore, neighboring CRUs exhibited repulsive behavior. Functional properties of the CRU network were further examined in a novel numerical SANC model developed using our experimental data. Model simulations revealed that heterogeneities in both CRU sizes and locations facilitate CICR and increase the AP firing rate in a cooperative manner. However, these heterogeneities reduce the effect of β-adrenergic stimulation in terms of its relative change in AP firing rate. The presence of heterogeneities in both sizes and locations allows SANC to reach higher absolute AP firing rates during β-adrenergic stimulation. Thus, the CICR facilitation by heterogeneities in CRU sizes and locations regulates and optimizes cardiac pacemaker cell operation under various physiological conditions. Dysfunction of this optimization could be a key factor in heart rate reserve decline in aging and disease. Full article
(This article belongs to the Section Cells of the Cardiovascular System)
Show Figures

Figure 1

Figure 1
<p><b>Flowchart of the peripheral RyR cluster analysis algorithm.</b> Presented is our image-processing algorithm for the precise segmentation and analysis of peripheral RyR clusters in 3D SIM imaging data in SANCs. Initially, the data undergo cropping and contrast enhancement through 3D CLAHE. The main segmentation process is conducted using the 3D StarDist neural network, which is trained using ground truth data generated through the Squassh software and refined via adaptive watershed. Following segmentation, RyR clusters that are part of the cell are identified and extracted using the density-based spatial clustering of applications with noise (DBSCAN) algorithm, which detects high-density clusters within the dataset. The culmination of this process is the generation of a 3D alpha shape encapsulating the spatial distribution of the RyR clusters on the periphery of SANCs. The peripheral RyR cluster sizes, the distances, and their alpha shape mesh are exported for further statistical processing.</p>
Full article ">Figure 2
<p><b>Visual representation of transformations and segmentation of flowchart.</b> (<b>A</b>): The initial, unprocessed SIM image data (in 3 dimensions) of RyR immunofluorescence in SANC, serving as the primary source for image analysis. (<b>B</b>): The enhanced and denoised raw SIM data. (<b>C</b>): The preliminary segmentation from Squassh with a purple ROI. (<b>D</b>): The stage where distinct RyR clusters are isolated, establishing boundaries between adjoining regions using a 3D 26-connectivity strategy. (<b>E</b>): The Watershed algorithm’s role in further refining the segmentation, capable of isolating individual RyR clusters even in complex spatial arrangements.</p>
Full article ">Figure 3
<p><b>Three-dimensional visualization of RyR cluster distribution in all 31 rabbit SANCs analyzed in the study</b>. Each cell is represented by a unique number (1–31) corresponding to the cell identifiers used in <a href="#cells-13-01885-t001" class="html-table">Table 1</a> and <a href="#cells-13-01885-t002" class="html-table">Table 2</a>. The visualizations depict the spatial distribution of RyR clusters within each cell, with clusters represented as colored points. The color intensity indicates the relative sizes of the clusters, with brighter colors (yellow to green) representing larger clusters and dimmer colors (blue to gray) representing smaller clusters. These visualizations provide a comprehensive overview of the RyR cluster organization across the entire sample set, allowing for visual comparison of cluster distributions and densities among cells of different morphologies. Cells are shown at various zoom levels to closely fit the panel size. Three-dimensional representations of each cell with its scale bar are available in html format in GitHub <a href="https://github.com/alexmaltsev/SANC/tree/main/3D%20Visualizations" target="_blank">https://github.com/alexmaltsev/SANC/tree/main/3D%20Visualizations</a> (accessed 13 November 2024). Each html file can be opened in a web browser for a computer mouse-interactive view (rotation and zoom-in and -out).</p>
Full article ">Figure 4
<p><b>Analysis of RyR cluster distribution and nearest-neighbor distances in representative rabbit SANC.</b> (<b>A</b>–<b>D</b>): Four representative cells (3, 8, 24, and 27 in <a href="#cells-13-01885-f003" class="html-fig">Figure 3</a>), each presenting three key analyses. First, a 3D visualization depicts RyR clusters as colored spheres scaled to their volumes (yellow for largest, purple for smallest) within a gray mesh representing the cell surface. Second, a fitted Gamma Mixture Model for RyR cluster size distributions is shown, with blue histograms representing observed data, green and blue dashed lines indicating individual gamma components, and a red line showing the overall fitted mixture. Model parameters (α<sub>1</sub>, α<sub>2</sub>, β<sub>1</sub>, β<sub>2</sub>, π) and the 95th percentile of the second gamma component (vertical black dash-dot line, marking large CRUs) are displayed. Third, a log-log histogram of RyR cluster nearest neighbor distances is presented, where blue bars show observed distances, red dots mark bins up to the inflection point used for power law fitting (blue line), and the fitted power law exponent (<b>B</b>) is provided. This comprehensive analysis reveals cell-to-cell variability in RyR cluster organization and spacing but overall consistency, offering insights into the spatial arrangement of Ca<sup>2+</sup> release sites in SANC.</p>
Full article ">Figure 5
<p><b>Gamma mixture model analysis of RyR cluster sizes in rabbit SANCs.</b> Probability density function (PDF) of RyR cluster sizes derived from 31 rabbit SANCs, encompassing 70,982 clusters. The distribution is fitted with a two-component Gamma Mixture Model, with parameters (α<sub>1</sub>, β<sub>1</sub>, α<sub>2</sub>, β<sub>2</sub>, π) displayed. The blue histogram represents experimental data, while green and blue dashed lines show individual gamma components. The red line depicts the overall fitted mixture, and the vertical black dash–dot line marks the 95th percentile of the second gamma component (marking large CRUs).</p>
Full article ">Figure 6
<p><b>Analysis of RyR cluster nearest-neighbor distances in rabbit sinoatrial node cells.</b> (<b>A</b>) Log-log histogram of nearest-neighbor distances (NND) for ryanodine receptor (RyR) clusters. The blue bars represent the observed NND distribution. Red dots indicate bins up to the inflection point, which were used to fit a power function (blue line). The fitted power law exponent b = 3.81 is displayed, suggesting strong repulsion among RyR clusters at short distances. (<b>B</b>) Histogram of power law exponents (b) derived from individual analysis of 31 cells, with an accompanying box plot.</p>
Full article ">Figure 7
<p><b>Spatial distribution and connectivity analysis of RyR clusters in a rabbit SANC.</b> Detailed visualization of RyR cluster distribution in cell #14 (in <a href="#cells-13-01885-f003" class="html-fig">Figure 3</a>). The cell’s shape is outlined by a network of interconnected black vertices, each representing an RyR cluster. The surface coloring, transitioning from purple to yellow (via blue and green), indicates the density and connectivity of these clusters. Purple areas signify regions where clusters strongly repel each other, resulting in lower cluster density and fewer neighboring connections. Conversely, blue → green → yellow areas represent regions where this repulsion is weaker, leading to higher-density regions with more interconnected clusters. The varying degrees of repulsion between RyR clusters across different areas of the cell provide insights into the spatial organization of Ca<sup>2+</sup> release sites, which influence CICR and AP firing rate. Specifically, this visualization technique effectively highlights potential hotspots of Ca<sup>2+</sup> signaling activity within the cell that is likely associated with higher density of RyR clusters.</p>
Full article ">Figure 8
<p><b>Results of numerical model simulations of SANC function: heterogeneities in both CRU sizes and locations facilitate LCR propagation and increase AP firing rate in a cooperative manner but decrease the effect of βAR stimulation in terms of relative change in AP firing rate; at the same time, the presence of heterogeneities in both sizes and locations allows higher absolute AP firing rates to be reached during βAR stimulation.</b> (<b>A</b>–<b>C</b>): Intervalograms for AP cycle length (CL) in 12 numerical model simulations during 16 s for 6 models featuring different distributions of CRU sizes and distances in basal state and during βAR stimulation (shown by text labels in the panel (<b>B</b>)). (<b>D</b>): Graph showing average CL calculated for steady-state AP firing during 6 to 16 s of the simulations (see also <a href="#app1-cells-13-01885" class="html-app">Videos S3–S8</a>). Explanation for symbols: blue circles-identical CRU sizes in basal state; orange squares–real CRU sizes in basal state; purple triangles–identical CRU sizes in βAR stimulation; red diamonds–real CRU sizes in βAR stimulation.</p>
Full article ">Figure 9
<p><b>Biophysical mechanism of how CRU distribution affects AP firing rate.</b> Shown is the relationship between of AP cycle length (CL) and the total number of RyRs in all firing CRUs at −45 mV, i.e., at the threshold of <span class="html-italic">I<sub>CaL</sub></span> activation. Both in basal-state firing (fitted by power function, R<sup>2</sup> = 0.994) and during βAR stimulation (fitted by linear function, R<sup>2</sup> = 0.9773), CL was closely linked to the RyR firing at this critical timing within diastolic depolarization.</p>
Full article ">Figure A1
<p><b>Schematic illustration of approximation of local Ca<sup>2+</sup> dynamics in our CRU-based SANC model</b>. Panel (<b>A</b>) shows the spatial positioning of Ca<sup>2+</sup> release units (CRUs) beneath the cell membrane. CRUs are shown in different sizes (a key feature of our new model), reflecting different numbers of ryanodine receptors (RyRs) included in each CRU. In Panels (<b>B</b>,<b>C</b>), a cross-sectional and a longitudinal section of our simulation are presented, respectively, revealing a three-layer voxel-based approximation of intracellular Ca<sup>2+</sup> dynamics. These voxel layers offer a discretized 3D view of the cellular space, enabling the detailed spatio-temporal representation of Ca<sup>2+</sup> signals within the cell. Specifically, the first layer (red) approximates the submembrane space where the CRUs are located and interact with cell membrane proteins. The second layer (ring) approximates cell space associated with the junctional sarcoplasmic reticulum (JSR), and the third layer (the core) is representative of the bulk cytosolic space. Both the ring and the core include the network sarcoplasmic reticulum, the primary intracellular Ca<sup>2+</sup> storage site that is equipped with Ca<sup>2+</sup> pump (SERCA, labeled by star). Collectively, this updated 3D SANC model, with its refined representation of CRU sizes and locations, provides a more accurate and realistic approximation of Ca<sup>2+</sup> signaling in sinoatrial node cells. Adopted from [<a href="#B22-cells-13-01885" class="html-bibr">22</a>].</p>
Full article ">Figure A2
<p>Various degrees of CRU repulsion (i.e., order and disorder) generated by our repulsion algorithm in a cell with realistic CRU sizes (as in cell #8, <a href="#cells-13-01885-t001" class="html-table">Table 1</a>) ((<b>left</b>) panels) and in a virtual cell with CRUs of identical sizes accommodating 48 RyRs ((<b>right</b>) panels). Top panels (<b>A</b>,<b>B</b>) show in blue circles how average NND changed in the respective CRU networks under cell membrane as repulsion transformed uniformly randomly distributed CRUs (step 0) towards a crystal-like structure (step 100). An intermediate CRU network with mean nearest neighbor distance (NND) close to that measured experimentally was used in our model simulations (steps 13 and 4 for networks of realistic and identical CRU sizes, respectively, vertical orange lines in (<b>A</b>,<b>B</b>)). Panels (<b>C</b>–<b>H</b>) show CRU distributions under the cell membrane (cylinder surfaces unwrapping to squares) that were used in our numerical model simulations of SANC function. See also <a href="#app1-cells-13-01885" class="html-app">Videos S1 and S2</a> for more details, including NND distributions, mean NND, and NND standard deviation at each repulsion step.</p>
Full article ">Figure A3
<p>Effect of Ca<sup>2+</sup> escape from dyadic space on RyR interaction profile in CRUs of different sizes (boundary effect). (<b>A</b>): A cascade of distributions of Ca<sup>2+</sup> in dyadic space for CRUs with different numbers of RyRs (shown by yellow circles): 3 × 3, 5 × 5, 7 × 7 etc. The distributions were simulated by running Stern at al.’s spark model [<a href="#B52-cells-13-01885" class="html-bibr">52</a>], which describes the function of each individual RyR within an individual CRU. The distributions were assessed 10 ms after one RyR channel opened in the middle of each CRU. Other RyRs were not allowed to open. The initial [Ca] in JSR was set to 1 mM. [Ca] is coded by red shades, saturating (pure red) at 60 μM. The voxel size in the model is 10 × 10 nm in the xy plane, parallel to the cell surface membrane. (<b>B</b>): Ca<sup>2+</sup> profiles (interaction profiles) via the CRU center of the respective distributions in the panel. The distance <span class="html-italic">r</span> is given by the model voxel size (10 nm). Arrows show positions of open RyRs in the CRU center (r = 0) and its nearest RyR neighbor (r = 3 voxels). (<b>C</b>): Plot of Ca<sup>2+</sup> at the nearest neighbor for CRUs of different sizes Ca<sub>neighbor</sub> = <span class="html-italic">ψ(3,N<sub>RyR</sub>)</span> together with its exponential fit (R<sup>2</sup> = 0.976) is shown by the grey line with the equation at the bottom of the plot.</p>
Full article ">
22 pages, 9046 KiB  
Article
Single-Sample Networks Reveal Intra-Cytoband Co-Expression Hotspots in Breast Cancer Subtypes
by Richard Ponce-Cusi, Patricio López-Sánchez, Vinicius Maracaja-Coutinho and Jesús Espinal-Enríquez
Int. J. Mol. Sci. 2024, 25(22), 12163; https://doi.org/10.3390/ijms252212163 - 13 Nov 2024
Viewed by 394
Abstract
Breast cancer is a heterogeneous disease comprising various subtypes with distinct molecular characteristics, clinical outcomes, and therapeutic responses. This heterogeneity evidences significant challenges for diagnosis, prognosis, and treatment. Traditional genomic co-expression network analyses often overlook individual-specific interactions critical for personalized medicine. In this [...] Read more.
Breast cancer is a heterogeneous disease comprising various subtypes with distinct molecular characteristics, clinical outcomes, and therapeutic responses. This heterogeneity evidences significant challenges for diagnosis, prognosis, and treatment. Traditional genomic co-expression network analyses often overlook individual-specific interactions critical for personalized medicine. In this study, we employed single-sample gene co-expression network analysis to investigate the structural and functional genomic alterations across breast cancer subtypes (Luminal A, Luminal B, Her2-enriched, and Basal-like) and compared them with normal breast tissue. We utilized RNA-Seq gene expression data to infer gene co-expression networks. The LIONESS algorithm allowed us to construct individual networks for each patient, capturing unique co-expression patterns. We focused on the top 10,000 gene interactions to ensure consistency and robustness in our analysis. Network metrics were calculated to characterize the topological properties of both aggregated and single-sample networks. Our findings reveal significant fragmentation in the co-expression networks of breast cancer subtypes, marked by a change from interchromosomal (TRANS) to intrachromosomal (CIS) interactions. This transition indicates disrupted long-range genomic communication, leading to localized genomic regulation and increased genomic instability. Single-sample analyses confirmed that these patterns are consistent at the individual level, highlighting the molecular heterogeneity of breast cancer. Despite these pronounced alterations, the proportion of CIS interactions did not significantly correlate with patient survival outcomes across subtypes, suggesting limited prognostic value. Furthermore, we identified high-degree genes and critical cytobands specific to each subtype, providing insights into subtype-specific regulatory networks and potential therapeutic targets. These genes play pivotal roles in oncogenic processes and may represent important keys for targeted interventions. The application of single-sample co-expression network analysis proves to be a powerful tool for uncovering individual-specific genomic interactions. Full article
(This article belongs to the Special Issue Breast Cancers: From Molecular Basis to Therapy)
Show Figures

Figure 1

Figure 1
<p>Visualization of gene co-expression in healthy breast tissue and breast cancer subtypes (Top—10,000 higher edges). Genes are color-coded by chromosome, highlighting the distribution of interchromosomal and intrachromosomal interactions. Upper right, evaluation of CIS/TRANS and Inter/Intracytoband interactions in healthy breast tissue and breast cancer subtypes.</p>
Full article ">Figure 2
<p>Boxplots of CIS/TRANS (<b>A</b>) and Inter/Intra-cytoband (<b>B</b>) interactions in healthy breast tissue and breast cancer subtypes across all samples (single-samples). Each point corresponds to the number of edges in a single-sample network. Notice that the distribution of control samples is much narrower than cancer subtypes.</p>
Full article ">Figure 3
<p>Network metrics in the largest component (clustering coefficient, modularity, closeness, degree, global efficiency, density) for healthy (normal) and breast cancer subtypes across all samples. *** <span class="html-italic">p</span>-value &lt; 0.001. NS = Non-Significant.</p>
Full article ">Figure 4
<p>Comparison between the top 10,000 interactions from aggregated networks with the top 10,000 interactions from each single sample network using the Jaccard index.</p>
Full article ">Figure 5
<p>Kaplan–Meier survival curves for breast cancer patients with high (blue) and low (yellow) of CIS interactions across different molecular subtypes (Luminal A, Luminal B, Her2 and Basal).</p>
Full article ">Figure 6
<p>Distribution of High-Degree genes in Single-Sample co-expression networks across breast cancer subtypes.</p>
Full article ">Figure 7
<p>Top 10 High-Degree genes in breast cancer subtypes: Cytoband localization across Single-Sample networks.</p>
Full article ">
19 pages, 5882 KiB  
Article
Design Methods of Aluminium Pin-Ended Columns with Topology-Optimised Cross-Sections
by Mehmet Ali Güler, Aykut Artac, Bora Yildirim and Konstantinos Daniel Tsavdaridis
Buildings 2024, 14(11), 3588; https://doi.org/10.3390/buildings14113588 - 12 Nov 2024
Viewed by 402
Abstract
This paper presents a numerical study of topology-optimised pin-end aluminium alloy columns using finite element analysis (FEA). The FEA models integrate geometric imperfections and material nonlinearity, and are validated against experimental findings from the existing literature. ABAQUS v.6.15 (release 2020) is used in [...] Read more.
This paper presents a numerical study of topology-optimised pin-end aluminium alloy columns using finite element analysis (FEA). The FEA models integrate geometric imperfections and material nonlinearity, and are validated against experimental findings from the existing literature. ABAQUS v.6.15 (release 2020) is used in preparing the FEA models and obtaining the analysis results. Furthermore, modern design methodologies including Eurocode 9, the direct strength method (DSM), and the continuous strength method (CSM) are employed to assess the maximum load capacity of such columns. Parametric investigations encompass diverse parameters such as varied cross-sections, column lengths, and global and local imperfections. By analysing a total of 288 FE models, incorporating 16 column cross-sections across two lengths with nine distinct imperfections, this study compares results with those derived from modern design methodologies. Thus, this research elucidates the behaviour of novel cross-sections and the application of contemporary design techniques in their analysis. Full article
(This article belongs to the Special Issue Buildings for the 21st Century)
Show Figures

Figure 1

Figure 1
<p>The generic representation of square hollow sections used in analyses.</p>
Full article ">Figure 2
<p>Novel cross-section geometries with the section codes N1-N6 have been assigned for these cross-sections: (<b>a</b>) N1, (<b>b</b>) N2, (<b>c</b>) N3, (<b>d</b>) N4, (<b>e</b>) N5, (<b>f</b>) N6.</p>
Full article ">Figure 3
<p>FEA model for 50.8 × 50.8 × 6.35-L500 specimen in Ref. [<a href="#B39-buildings-14-03588" class="html-bibr">39</a>].</p>
Full article ">Figure 4
<p>Boundary conditions of the validation FEA model for 50.8 × 50.8 × 6.35-L500 specimen in Ref. [<a href="#B39-buildings-14-03588" class="html-bibr">39</a>].</p>
Full article ">Figure 5
<p>Comparison of the FEA result with the experimental result of Georgantzia et al. [<a href="#B39-buildings-14-03588" class="html-bibr">39</a>] for the column with dimensions 50.8 × 50.8 × 6.35-L500.</p>
Full article ">Figure 6
<p>FEA model for the C6061-80 × 80 × 1350 specimen in Ref. [<a href="#B40-buildings-14-03588" class="html-bibr">40</a>].</p>
Full article ">Figure 7
<p>Comparison of the FEA result with the experimental result of Chen et al. [<a href="#B40-buildings-14-03588" class="html-bibr">40</a>] for the C6061-80 × 80 × 1350 specimen.</p>
Full article ">Figure 8
<p>Roadmap of FEM studies for a column.</p>
Full article ">Figure 9
<p>Some examples of buckling results of various columns with equivalent stress contours (MPa) (<b>a</b>) N2-0.5 m, (<b>b</b>) B1-0.5 m, (<b>c</b>) N4-1 m, (<b>d</b>) A4-1 m.</p>
Full article ">Figure 10
<p>Methods comparison with respect to FEM results of 0.5 m columns (<b>a</b>): FEM vs. EC-9, (<b>b</b>): FEM vs. DSM, (<b>c</b>): FEM vs. CSM.</p>
Full article ">Figure 11
<p>Methods comparison with respect to FEM results of 1 m columns (<b>a</b>): FEM vs. EC-9, (<b>b</b>): FEM vs. DSM, (<b>c</b>): FEM vs. CSM.</p>
Full article ">Figure 12
<p>Change in load ratios with slenderness (<b>a</b>): 0.5 m columns (<b>b</b>): 1 m columns.</p>
Full article ">
20 pages, 3018 KiB  
Article
Global Semantic Localization from Abstract Ellipse-Ellipsoid Model and Object-Level Instance Topology
by Heng Wu, Yanjie Liu, Chao Wang and Yanlong Wei
Remote Sens. 2024, 16(22), 4187; https://doi.org/10.3390/rs16224187 - 10 Nov 2024
Viewed by 344
Abstract
Robust and highly accurate localization using a camera is a challenging task when appearance varies significantly. In indoor environments, changes in illumination and object occlusion can have a significant impact on visual localization. In this paper, we propose a visual localization method based [...] Read more.
Robust and highly accurate localization using a camera is a challenging task when appearance varies significantly. In indoor environments, changes in illumination and object occlusion can have a significant impact on visual localization. In this paper, we propose a visual localization method based on an ellipse-ellipsoid model, combined with object-level instance topology and alignment. First, we develop a CNN-based (Convolutional Neural Network) ellipse prediction network, DEllipse-Net, which integrates depth information with RGB data to estimate the projection of ellipsoids onto images. Second, we model environments using 3D (Three-dimensional) ellipsoids, instance topology, and ellipsoid descriptors. Finally, the detected ellipses are aligned with the ellipsoids in the environment through semantic object association, and 6-DoF (Degree of Freedom) pose estimation is performed using the ellipse-ellipsoid model. In the bounding box noise experiment, DEllipse-Net demonstrates higher robustness compared to other methods, achieving the highest prediction accuracy for 11 out of 23 objects in ellipse prediction. In the localization test with 15 pixels of noise, we achieve ATE (Absolute Translation Error) and ARE (Absolute Rotation Error) of 0.077 m and 2.70 in the fr2_desk sequence. Additionally, DEllipse-Net is lightweight and highly portable, with a model size of only 18.6 MB, and a single model can handle all objects. In the object-level instance topology and alignment experiment, our topology and alignment methods significantly enhance the global localization accuracy of the ellipse-ellipsoid model. In experiments involving lighting changes and occlusions, our method achieves more robust global localization compared to the classical bag-of-words based localization method and other ellipse-ellipsoid localization methods. Full article
Show Figures

Figure 1

Figure 1
<p>Overview of global semantic localization. Before using a single-frame RGB-D image for localization, it is essential to construct a “Global Map” that includes the 3D ellipsoid abstraction and the topological relationships of each object instance. Upon receiving each RGB-D image as input, we use YOLOv8 [<a href="#B13-remotesensing-16-04187" class="html-bibr">13</a>] to detect the semantic information and bounding boxes of each object within the RGB image. We then crop the corresponding object regions from both the RGB and depth images for ellipse prediction using DEllipse-Net. Afterward, the ellipse and semantic information are combined to construct a topology map, which is aligned with the “Global Map”. Finally, the aligned ellipse-ellipsoid pairs are used for pose estimation.</p>
Full article ">Figure 2
<p>The construction process of ellipsoid map. (<b>a</b>) is the dense map constructed by ORB-SLAM3 and Voxblox. (<b>b</b>) is the semantic map of objects. (<b>c</b>) is the ellipsoid map of objects.</p>
Full article ">Figure 3
<p>Object-level instance topology and descriptor extraction. Top left: undirected topology diagram between nodes and distance weights and random walks diagram with <math display="inline"><semantics> <msub> <mi mathvariant="script">O</mi> <mn>0</mn> </msub> </semantics></math> as the root node. Top right: List of distance weights for each node. Bottom: Category and distance weights obtained through random walks. Nodes of different colors represent objects of different categories.</p>
Full article ">Figure 4
<p>Overview of the DEllipse-Net. “MP” is maximum pooling, “AP” is average pooling, “RL” is Relu.</p>
Full article ">Figure 5
<p>Different methods for ellipse prediction in bounding box with 15 pixel noise. The top is the predicted result of an image in the <math display="inline"><semantics> <mrow> <mi>f</mi> <mi>r</mi> <mn>2</mn> <mo>_</mo> <mi>d</mi> <mi>e</mi> <mi>s</mi> <mi>k</mi> </mrow> </semantics></math>, and the bottom is the predicted result of an image in the <math display="inline"><semantics> <mrow> <mi>C</mi> <mi>h</mi> <mi>e</mi> <mi>s</mi> <mi>s</mi> </mrow> </semantics></math>. (<b>a</b>–<b>c</b>) are comparisons between the three methods (Mathematical, Ellipse-Net and DEllipse-Net (Ours)) and ground truth, respectively. The white rectangle is the bounding box after adding 15 pixels of noise. “White ellipse” is the ground truth, “Blue ellipse” is Mathematical, “Red ellipse” is Ellipse-Net, and “Green ellipse” is DEllipse-Net.</p>
Full article ">Figure 6
<p>The percentage of images in <math display="inline"><semantics> <mrow> <mi>f</mi> <mi>r</mi> <mn>2</mn> <mo>_</mo> <mi>d</mi> <mi>e</mi> <mi>s</mi> <mi>k</mi> </mrow> </semantics></math> with different <math display="inline"><semantics> <mrow> <mi>I</mi> <mi>o</mi> <msub> <mi>U</mi> <mrow> <mi>e</mi> <mi>r</mi> <mi>r</mi> <mi>o</mi> <mi>r</mi> </mrow> </msub> </mrow> </semantics></math> thresholds as a proportion of the total number of images.</p>
Full article ">Figure 7
<p>The percentage of images in <math display="inline"><semantics> <mrow> <mi>C</mi> <mi>h</mi> <mi>e</mi> <mi>s</mi> <mi>s</mi> </mrow> </semantics></math> with different <math display="inline"><semantics> <mrow> <mi>I</mi> <mi>o</mi> <msub> <mi>U</mi> <mrow> <mi>e</mi> <mi>r</mi> <mi>r</mi> <mi>o</mi> <mi>r</mi> </mrow> </msub> </mrow> </semantics></math> thresholds as a proportion of the total number of images.</p>
Full article ">Figure 8
<p>A comparison of images from the <math display="inline"><semantics> <mrow> <mi>f</mi> <mi>r</mi> <mn>2</mn> <mo>_</mo> <mi>d</mi> <mi>e</mi> <mi>s</mi> <mi>k</mi> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>f</mi> <mi>r</mi> <mn>3</mn> <mo>_</mo> <mi>o</mi> <mi>f</mi> <mi>f</mi> <mi>i</mi> <mi>c</mi> <mi>e</mi> <mo>_</mo> <mi>h</mi> <mi>o</mi> <mi>u</mi> <mi>s</mi> <mi>e</mi> <mi>h</mi> <mi>o</mi> <mi>l</mi> <mi>d</mi> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>C</mi> <mi>h</mi> <mi>e</mi> <mi>s</mi> <mi>s</mi> </mrow> </semantics></math>, and <math display="inline"><semantics> <mrow> <mi>R</mi> <mi>e</mi> <mi>d</mi> <mi>k</mi> <mi>i</mi> <mi>t</mi> <mi>c</mi> <mi>h</mi> <mi>e</mi> <mi>n</mi> </mrow> </semantics></math> sequences under normal and dark conditions.</p>
Full article ">Figure 9
<p>The image performance of the <math display="inline"><semantics> <mrow> <mi>f</mi> <mi>r</mi> <mn>2</mn> <mo>_</mo> <mi>d</mi> <mi>e</mi> <mi>s</mi> <mi>k</mi> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>f</mi> <mi>r</mi> <mn>3</mn> <mo>_</mo> <mi>o</mi> <mi>f</mi> <mi>f</mi> <mi>i</mi> <mi>c</mi> <mi>e</mi> <mo>_</mo> <mi>h</mi> <mi>o</mi> <mi>u</mi> <mi>s</mi> <mi>e</mi> <mi>h</mi> <mi>o</mi> <mi>l</mi> <mi>d</mi> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>C</mi> <mi>h</mi> <mi>e</mi> <mi>s</mi> <mi>s</mi> </mrow> </semantics></math>, and <math display="inline"><semantics> <mrow> <mi>R</mi> <mi>e</mi> <mi>d</mi> <mi>k</mi> <mi>i</mi> <mi>t</mi> <mi>c</mi> <mi>h</mi> <mi>e</mi> <mi>n</mi> </mrow> </semantics></math> sequences with one, two, and three occlusions.</p>
Full article ">
19 pages, 3654 KiB  
Article
Fatigue Characterization of EEG Brain Networks Under Mixed Reality Stereo Vision
by Yan Wu, Chunguang Tao and Qi Li
Brain Sci. 2024, 14(11), 1126; https://doi.org/10.3390/brainsci14111126 - 7 Nov 2024
Viewed by 572
Abstract
Mixed Reality (MR) technology possesses profound and extensive potential across a multitude of domains, including, but not limited to industry, healthcare, and education. However, prolonged use of MR devices to watch stereoscopic content may lead to visual fatigue. Since visual fatigue involves multiple [...] Read more.
Mixed Reality (MR) technology possesses profound and extensive potential across a multitude of domains, including, but not limited to industry, healthcare, and education. However, prolonged use of MR devices to watch stereoscopic content may lead to visual fatigue. Since visual fatigue involves multiple brain regions, our study aims to explore the topological characteristics of brain networks derived from electroencephalogram (EEG) data. Because the Phase-Locked Value (PLV) is capable of effectively measuring the phase synchronization relationship between brain regions, it was calculated between all pairs of channels in both comfort and fatigue states. Subsequently, a sparse brain network was constructed based on PLV by applying an appropriate threshold. The node properties (betweenness centrality, clustering coefficient, node efficiency) and edge properties (characteristic path length) were calculated based on the corresponding brain network within specific frequency bands for both comfort and fatigue states. In analyzing the PLV of brain connectivity in comfort and fatigue states, a notable enhancement in brain connectivity is observed within the alpha, theta, and delta frequency bands during fatigue status. By analyzing the node and edge properties of brain networks, it is evident that the mean values of these properties in the fatigue state were higher than those in the comfort state. By analyzing the node and edge properties at a local level, the average difference in betweenness centrality, clustering coefficients, and nodal efficiency across the three EEG frequency bands was computed to find significant brain regions. The main findings are as follows: Betweenness centrality primarily differs in frontal and parietal regions, with minor involvement in temporal and central regions. The clustering Coefficient mainly varies in the frontal region, with slight differences being seen in the temporal and occipital regions. Nodal efficiency primarily varies in the frontal, temporal, and central regions, with minor differences being seen in the parietal and occipital regions. Edge property analysis indicates that there is a higher occurrence of long-distance connections among brain regions during the fatigue state, which reflects a loss of synaptic transmission efficiency on a global level. Our study plays a crucial role in understanding the neural mechanisms underlying visual fatigue, potentially providing insights that could be applied to high-demand cognitive fields where prolonged use of MR devices leads to visual fatigue. Full article
(This article belongs to the Special Issue Brain Network Connectivity Analysis in Neuroscience)
Show Figures

Figure 1

Figure 1
<p>Average ratings for the six-speed modes.</p>
Full article ">Figure 2
<p>Flow diagram of EEG experiments.</p>
Full article ">Figure 3
<p>Schematic diagram of the EEG recording and experimental environment.</p>
Full article ">Figure 4
<p>Average network distribution of two conditions of participants. Note: ↑ indicates that the mean PLV in the fatigue state is higher compared to the comfort state. **: <math display="inline"><semantics> <mrow> <msub> <mi>p</mi> <mi>mean</mi> </msub> <mo>&lt;</mo> <mn>0.01</mn> </mrow> </semantics></math>, where <math display="inline"><semantics> <msub> <mi>p</mi> <mi>mean</mi> </msub> </semantics></math> represents the mean of all significant electrode pairs.</p>
Full article ">Figure 5
<p>Comparative analysis of brain functional network metrics across the alpha, theta, and delta frequency bands among participants with varying thresholds. *: <math display="inline"><semantics> <mrow> <mi>p</mi> <mo>&lt;</mo> <mn>0.05</mn> </mrow> </semantics></math>, **: <math display="inline"><semantics> <mrow> <mi>p</mi> <mo>&lt;</mo> <mn>0.01</mn> </mrow> </semantics></math>, ***: <math display="inline"><semantics> <mrow> <mi>p</mi> <mo>&lt;</mo> <mn>0.001</mn> </mrow> </semantics></math>. Note: red signifies the threshold exhibiting the highest level of significance.</p>
Full article ">Figure 6
<p>Average difference of BC (fatigue)-BC (comfort) for all participants of the alpha, theta, and delta bands. <sup>+</sup>, <sup>#</sup>, *: <math display="inline"><semantics> <mrow> <mi>p</mi> <mo>&lt;</mo> <mn>0.05</mn> </mrow> </semantics></math>; <sup>##</sup>, **: <math display="inline"><semantics> <mrow> <mi>p</mi> <mo>&lt;</mo> <mn>0.01</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 7
<p>Average difference of CC (fatigue)-CC (comfort) for all participants of the alpha, theta, and delta bands. <sup>+</sup>, <sup>#</sup>, *: <math display="inline"><semantics> <mrow> <mi>p</mi> <mo>&lt;</mo> <mn>0.05</mn> </mrow> </semantics></math>; <sup>++</sup>: <math display="inline"><semantics> <mrow> <mi>p</mi> <mo>&lt;</mo> <mn>0.01</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 8
<p>Average difference of NE (fatigue)-NE (comfort) for all participants of the alpha, theta, and delta bands. <sup>+</sup>, <sup>#</sup>, *: <math display="inline"><semantics> <mrow> <mi>p</mi> <mo>&lt;</mo> <mn>0.05</mn> </mrow> </semantics></math>; <sup>++</sup>, <sup>##</sup>, **: <math display="inline"><semantics> <mrow> <mi>p</mi> <mo>&lt;</mo> <mn>0.01</mn> </mrow> </semantics></math>; ***: <math display="inline"><semantics> <mrow> <mi>p</mi> <mo>&lt;</mo> <mn>0.001</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 9
<p>3D Modular Brain Networks. (<b>a</b>) represents the alpha band. (<b>b</b>) represents the theta band. (<b>c</b>) represents the delta band. Each band corresponds to both comfort and fatigue states. Different nodes have different colors, and the color of the edges changes according to the colors of the nodes. The edge thickness signifies the strength of the connection between nodes. A thicker edge indicates a stronger relationship. The brain networks were visualized using the BrainNet Viewer (<a href="http://www.nitrc.org/projects/bnv/" target="_blank">http://www.nitrc.org/projects/bnv/</a>, accessed on 15 December 2023) [<a href="#B45-brainsci-14-01126" class="html-bibr">45</a>].</p>
Full article ">Figure 10
<p>The significance of alpha, theta, and delta in the comfort and fatigue states was assessed using a one-tailed test.</p>
Full article ">
13 pages, 2148 KiB  
Article
False Data Injection Attacks Detection Based on Stacking and MIC-DCXGB
by Tong Li, Tian Xia, Haoming Zhang, Dongyang Liu, Hai Zhao and Zhuolin Liu
Sustainability 2024, 16(22), 9692; https://doi.org/10.3390/su16229692 - 7 Nov 2024
Viewed by 401
Abstract
With the integration of sustainable energy, the power grid has become increasingly information-intensive and complex. To address the issue of power grid cyber-physical systems being unable to operate securely and stably when systems suffer false data injection attacks, a two-stage detection method based [...] Read more.
With the integration of sustainable energy, the power grid has become increasingly information-intensive and complex. To address the issue of power grid cyber-physical systems being unable to operate securely and stably when systems suffer false data injection attacks, a two-stage detection method based on Stacking and Maximum Information Coefficient and Dual-layer Confidence Extreme Gradient Boosting (MIC-DCXGB) is proposed by the paper. Firstly, a Stacking classification model consisting of multiple heterogeneous learners detects anomalies in real-time measurement data samples to determine if false data are present. Secondly, the method incorporates the Maximum Information Coefficient (MIC) for feature selection, which non-linearly measures the correlation between data features and fairly removes redundant features by evaluating the amount of information one feature variable contains about another. This approach effectively tackles the high-dimensional redundancy problem commonly faced in false data injection attack detection. Then, the paper introduces a dual-layer confidence Extreme Gradient Boosting (XGBoost) tree with positive feedback information transmission to classify node states. By combining grid topology learning with label correlation, it selectively uses preceding label information to reduce errors in the predictions learned by subsequent classifiers, achieving precise localization of the attack positions. Finally, extensive simulations validate the effectiveness of the proposed method. Full article
Show Figures

Figure 1

Figure 1
<p>The behavior of FDIA.</p>
Full article ">Figure 2
<p>Stacking based FDIA detection method.</p>
Full article ">Figure 3
<p>IEEE-14 node system detection path diagram.</p>
Full article ">Figure 4
<p>Flowchart.</p>
Full article ">Figure 5
<p>IEEE-14 node system each state detection accuracy.</p>
Full article ">Figure 6
<p>IEEE-57 node system each state detection accuracy.</p>
Full article ">
15 pages, 2925 KiB  
Article
CrackNet: A Hybrid Model for Crack Segmentation with Dynamic Loss Function
by Yawen Fan, Zhengkai Hu, Qinxin Li, Yang Sun, Jianxin Chen and Quan Zhou
Sensors 2024, 24(22), 7134; https://doi.org/10.3390/s24227134 - 6 Nov 2024
Viewed by 467
Abstract
Cracks are a common form of damage in infrastructure, posing significant risks to both personal safety and property. Along with the development of deep learning, visual-based crack automatic detection has been widely studied. However, this task is still challenging due to complex crack [...] Read more.
Cracks are a common form of damage in infrastructure, posing significant risks to both personal safety and property. Along with the development of deep learning, visual-based crack automatic detection has been widely studied. However, this task is still challenging due to complex crack topology, noisy backgrounds, unbalanced categories, etc. To address these challenges, this research proposes a novel hybrid network, named CrackNet, which leverages the strengths of both CNN and transformer. On the encoder side, CNNs are employed to extract multi-level local features, while transformers are used to model global dependencies. Additionally, a strip pooling module is introduced to suppress irrelevant regions and enhance the network’s ability to segment narrow and elongated cracks. On the decoder side, an attention-based skip connection strategy and a mixed up-sampling module are implemented to restore detailed information. Furthermore, a joint learning loss combining Dice and cross-entropy with dynamic weighting is proposed to mitigate the effects of severe class imbalance. CrackNet is trained and evaluated on three public crack datasets, and experimental results show that the proposed model outperforms several well-known deep neural networks, with a particularly noticeable improvement in recall rate. Full article
(This article belongs to the Section Intelligent Sensors)
Show Figures

Figure 1

Figure 1
<p>Crack Detection Tasks.</p>
Full article ">Figure 2
<p>Overview of the proposed CrackNet.</p>
Full article ">Figure 3
<p>Transformer Module.</p>
Full article ">Figure 4
<p>Strip pooling module.</p>
Full article ">Figure 5
<p>Attention block.</p>
Full article ">Figure 6
<p>Visualization of testing results on the DeepCrack. (<b>a</b>) original image, (<b>b</b>) groundtruth, (<b>c</b>) Swin-Unet, (<b>d</b>) TransUNet, (<b>e</b>) DeepCrack, (<b>f</b>) CrackNet. The red box denotes the areas that are erroneously identified as cracks. The blue box represents the fine cracks that are prone to being overlooked.</p>
Full article ">Figure 7
<p>Visualization of testing results on the Crack500. (<b>a</b>) original image, (<b>b</b>) groundtruth, (<b>c</b>) Swin-Unet, (<b>d</b>) TransUNet, (<b>e</b>) DeepCrack, (<b>f</b>) CrackNet.</p>
Full article ">Figure 8
<p>Visualization of testing results on the CFD. (<b>a</b>) original image, (<b>b</b>) groundtruth, (<b>c</b>) Swin-Unet, (<b>d</b>) TransUNet, (<b>e</b>) DeepCrack, (<b>f</b>) CrackNet. The red box denotes the areas that are erroneously identified as cracks. The blue box represents the fine cracks that are prone to being overlooked.</p>
Full article ">
16 pages, 1556 KiB  
Article
Maintaining Cyber Resilience in the Reconfigurable Networks with Immunization and Improved Network Game Methods
by Maxim Kalinin, Evgeny Pavlenko, Georgij Gavva and Maxim Pakhomov
Sensors 2024, 24(22), 7116; https://doi.org/10.3390/s24227116 - 5 Nov 2024
Viewed by 515
Abstract
The paper proposes a technique for protecting reconfigurable networks that implements topology rebuilding, which combines immunization and network gaming methods, as a solution for maintaining cyber resilience. Immunization presumes an adaptive set of protective reconfigurations destined to ensure the functioning of a network. [...] Read more.
The paper proposes a technique for protecting reconfigurable networks that implements topology rebuilding, which combines immunization and network gaming methods, as a solution for maintaining cyber resilience. Immunization presumes an adaptive set of protective reconfigurations destined to ensure the functioning of a network. It is a protective reconfiguration aimed to preserve/increase the functional quality of the system. Network nodes and edges are adaptively reorganized to counteract an invasion. This is a functional component of cyber resilience. It can be implemented as a global strategy, using knowledge of the whole network structure, or a local strategy that only works with a certain part of a network. A formal description of global and local immune strategies based on hierarchical and peer-to-peer network topologies is presented. A network game is a kind of the well-defined game model in which each situation generates a specific network, and the payoff function is calculated based on the constructed networks. A network game is proposed for analyzing a network topology. This model allows quickly identifying nodes that require disconnection or replacement when a cyber attack occurs, and understanding which network sectors might be affected by an attack. The gaming method keeps the network topology resistant to unnecessary connections. This is a structural component of cyber resilience. The basic network game method has been improved by using the criterion of maximum possible path length to reduce the number of reconfigurations. Network optimization works together with immunization to preserve the structural integrity of the network. In an experimental study, the proposed method demonstrated its effectiveness in maintaining system quality within given functional limits and reducing the cost of system protective restructuring. Full article
(This article belongs to the Special Issue IoT Cybersecurity)
Show Figures

Figure 1

Figure 1
<p>Sample of a hierarchical infrastructure: (<b>a</b>) a smart grid network; (<b>b</b>) result of the network immunization.</p>
Full article ">Figure 2
<p>Demonstration of the immunization effectiveness.</p>
Full article ">Figure 3
<p>Experiments with the network game method: (<b>a</b>–<b>c</b>) original network game; (<b>d</b>–<b>f</b>) modified network game.</p>
Full article ">Figure 4
<p>Results for direct connections: (<b>a</b>) broadcast; (<b>b</b>) sequential; (<b>c</b>) mixed requests.</p>
Full article ">Figure 5
<p>Results for direct disconnections: (<b>a</b>) broadcast; (<b>b</b>) sequential; (<b>c</b>) mixed requests.</p>
Full article ">Figure 6
<p>Results for spectral radius of the graph: (<b>a</b>) broadcast; (<b>b</b>) sequential; (<b>c</b>) mixed requests.</p>
Full article ">
20 pages, 5537 KiB  
Article
TTMGNet: Tree Topology Mamba-Guided Network Collaborative Hierarchical Incremental Aggregation for Change Detection
by Hongzhu Wang, Zhaoyi Ye, Chuan Xu, Liye Mei, Cheng Lei and Du Wang
Remote Sens. 2024, 16(21), 4068; https://doi.org/10.3390/rs16214068 - 31 Oct 2024
Viewed by 480
Abstract
Change detection (CD) identifies surface changes by analyzing bi-temporal remote sensing (RS) images of the same region and is essential for effective urban planning, ensuring the optimal allocation of resources, and supporting disaster management efforts. However, deep-learning-based CD methods struggle with background noise [...] Read more.
Change detection (CD) identifies surface changes by analyzing bi-temporal remote sensing (RS) images of the same region and is essential for effective urban planning, ensuring the optimal allocation of resources, and supporting disaster management efforts. However, deep-learning-based CD methods struggle with background noise and pseudo-changes due to local receptive field limitations or computing resource constraints, which limits long-range dependency capture and feature integration, normally resulting in fragmented detections and high false positive rates. To address these challenges, we propose a tree topology Mamba-guided network (TTMGNet) based on Mamba architecture, which combines the Mamba architecture for effectively capturing global features, a unique tree topology structure for retaining fine local details, and a hierarchical feature fusion mechanism that enhances multi-scale feature integration and robustness against noise. Specifically, the a Tree Topology Mamba Feature Extractor (TTMFE) leverages the similarity of pixels to generate minimum spanning tree (MST) topology sequences, guiding information aggregation and transmission. This approach utilizes a Tree Topology State Space Model (TTSSM) to embed spatial and positional information while preserving the global feature extraction capability, thereby retaining local features. Subsequently, the Hierarchical Incremental Aggregation Module is utilized to gradually align and merge features from deep to shallow layers to facilitate hierarchical feature integration. Through residual connections and cross-channel attention (CCA), HIAM enhances the interaction between neighboring feature maps, ensuring that critical features are retained and effectively utilized during the fusion process, thereby enabling more accurate detection results in CD. The proposed TTMGNet achieved F1 scores of 92.31% on LEVIR-CD, 90.94% on WHU-CD, and 77.25% on CL-CD, outperforming current mainstream methods in suppressing the impact of background noise and pseudo-change and more accurately identifying change regions. Full article
Show Figures

Figure 1

Figure 1
<p>The overview flow diagram of TTMGNet, where σ represents the sigmoid activation function and GAP denotes the Global Average Pooling operation. The data flow begins with the bi-temporal images, <span class="html-italic">I<sub>pre</sub></span> and <span class="html-italic">I<sub>post</sub></span>, which are fed into the stem module. Subsequently, the extracted features undergo further extraction through four stages within the TTMFE, each consisting of a different number of TTM blocks. Finally, the outputs from all four stages are then fed into the HIAM for feature alignment and fusion, ultimately generating the final output image.</p>
Full article ">Figure 2
<p>The inner structure of the TTM block, where <b><span class="html-italic">F</span></b> is the input feature of the TTSSM module, the red points in <b><span class="html-italic">F</span></b> indicate pixels, MST denotes the minimum spanning tree composed of pixels, and <span class="html-italic">x</span> and <span class="html-italic">y</span> mean the input and output of the TTSS block. Details of TTSS are shown in <a href="#remotesensing-16-04068-f003" class="html-fig">Figure 3</a>.</p>
Full article ">Figure 3
<p>The illustration of TTSS. <span class="html-italic">A</span>, <span class="html-italic">B</span>, <span class="html-italic">C</span>, and <span class="html-italic">D</span> are the parameters of the TTSSM, <math display="inline"><semantics> <mo>Δ</mo> </semantics></math> means the transform parameters used to discrete the continuous parameters of A and B. Set <b><span class="html-italic">V</span></b> means all vertices in MST, <math display="inline"><semantics> <mrow> <msub> <mi>E</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> </mrow> </semantics></math> denotes all edges from vertex <math display="inline"><semantics> <mrow> <mi>i</mi> </mrow> </semantics></math> to vertex <span class="html-italic">j</span>. <math display="inline"><semantics> <mrow> <msub> <mrow> <mover accent="true"> <mi>A</mi> <mo stretchy="true">¯</mo> </mover> </mrow> <mi mathvariant="normal">k</mi> </msub> </mrow> </semantics></math> means the transition parameters of vertex <span class="html-italic">k</span>. <math display="inline"><semantics> <mrow> <msub> <mi>h</mi> <mi>i</mi> </msub> </mrow> </semantics></math> is the hidden state of the input.</p>
Full article ">Figure 4
<p>Visual comparison results on the LEVIR-CD dataset. The red indicates false positives; the green indicates false negatives. (<b>a</b><span class="html-italic">–</span><b>f</b>) are six representative scenarios in LEVIR-CD.</p>
Full article ">Figure 5
<p>Visual comparison results on the WHU-CD dataset. The red indicates false positives; the green indicates false negatives. (<b>a</b>–<b>f</b>) are six representative scenarios in WHU-CD.</p>
Full article ">Figure 6
<p>Visual comparison results on the CL-CD dataset. The red indicates false positives; the green indicates false negatives. (<b>a</b>–<b>f</b>) are six representative scenarios in CL-CD.</p>
Full article ">Figure 7
<p>Box plots of the six metrics on LEVIR-CD for the proposed method and comparison methods.</p>
Full article ">
Back to TopTop