Search Results (523)

Least-squares reverse time migration (LSRTM) is an advanced seismic imaging technique that reconstructs subsurface models by minimizing the residuals between simulated and observed data. Mathematically, the LSRTM inversion of the sub-surface reflectivity is a large-scale, highly ill-posed sparse inverse problem, where conventional inversion methods typically lead to poor imaging quality. In this study, we propose a regularized LSRTM method based on the flexible Krylov subspace inversion framework. Through the strategy of the Krylov subspace projection, a basis set for the projection solution is generated, and then the inversion of a large ill-posed problem is expressed as the small matrix optimization problem. With flexible preconditioning, the proposed method could solve the sparse regularization LSRTM, like with the Tikhonov regularization style. Sparse penalization solution is implemented by decomposing it into a set of Tikhonov penalization problems with iterative reweighted norm, and then the flexible Golub–Kahan process is employed to solve the regularization problem in a low-dimensional subspace, thereby finally obtaining a sparse projection solution. Numerical tests on the Valley model and the Salt model validate that the LSRTM based on Krylov subspace method can effectively address the sparse inversion problem of subsurface reflectivity and produce higher-quality imaging results. Full article

Microwave tomography serves as a promising non-invasive technique for breast imaging, yet accurate reconstruction in noisy environments remains challenging. We propose an adaptive subspace-based two-step iterative shrinkage/thresholding (S-TwIST) algorithm that enhances reconstruction accuracy through two key innovations: a singular value decomposition (SVD) approach for extracting deterministic contrast sources, and an adaptive strategy for optimal singular value selection. Unlike conventional DBIM methods that rely solely on secondary incident fields, S-TwIST incorporates deterministic induced currents to achieve more accurate total field approximation. The algorithm’s performance is validated using both synthetic “Austria” profiles and 45 digital breast phantoms derived from the UWCEM repository. The results demonstrate robust reconstruction capabilities across varying noise levels (0–20 dB SNR), achieving average relative errors of 0.4847% in breast tissue reconstruction without requiring prior noise level knowledge. The algorithm successfully recovers complex tissue structures and density distributions, showing potential for clinical breast imaging applications. Full article

Local feature descriptors are a critical problem in computer vision; the majority of current approaches find it difficult to achieve a balance between descriptiveness, robustness, compactness, and efficiency. This paper proposes the local discrete feature histogram (LDFH), a novel local feature descriptor, as a solution to this problem. The LDFH descriptor is constructed based on a robust local reference frame (LRF). It partitions the local space based on radial distance and calculates three geometric features, including the normal deviation angle, polar angle, and normal lateral angle, in each subspace. These features are then discretized to generate three feature statistical histograms, which are combined using a weighted fusion strategy to generate the final LDFH descriptor. Experiments on public datasets demonstrate that, compared with the existing methods, LDFH strikes an excellent balance between descriptiveness, robustness, compactness, and efficiency, making it suitable for various scenes and sensor datasets. Full article

Rolling element bearings are key components for reducing friction and supporting rotors. Harsh working conditions contribute to the wear of bearings and consequent breakdown of machines, which leads to economic losses and even catastrophic accidents. Faulty impulses from bearings can excite resonance behavior in a system and produce modulation phenomena. Fault characteristics in modulated signals can be extracted using demodulation analysis methods, significantly improving the reliability and effectiveness of the fault diagnosis of rolling bearings. Optimal demodulation frequency band selection is a primary step for the demodulation-analysis-based fault diagnosis of bearing faults. To exploit the resonant modulation mechanism in the fault diagnosis of rolling element bearings, resonant frequencies identified through stochastic subspace identification are employed to guide the impulsive sparsity measures of an Autogram for bearing fault diagnosis, which combines physical modulation dynamics and data characteristics. The frequency band that not only matches the natural frequencies but also shows highly sparse impulsive characteristics is selected as the optimal demodulation frequency band for bearing fault diagnosis. The results of simulations and experimental data validate the advantages of the proposed method, which exploits physics-guided data processing for optimal demodulation frequency band determination. Full article

This paper deals with developing a comparative study of the principal time-domain system identification methods suitable for performing an experimental modal analysis of structural systems. To this end, this work focuses first on analyzing and reviewing the mathematical background concerning the analytical methods and the computational algorithms of interest for this study. The methods considered in the paper are referred to as the AutoRegressive eXogenous (ARX) method, the State-Space ESTimation (SSEST) method, the Numerical Algorithm for Subspace State-Space System Identification (N4SID), the Eigensystem Realization Algorithm (ERA) combined with the Observer/Kalman Filter Identification (OKID) method, and the Transfer Function ESTimation (TFEST) method. Starting from the identified models estimated through the methodologies reported in the paper, a set of second-order configuration-space dynamical models of the structural system of interest can also be determined by employing an estimation method for the Mass, Stiffness, and Damping (MSD) matrices. Furthermore, in practical applications, the correct estimation of the damping matrix is severely hampered by noise that corrupts the input and output measurements. To address this problem, in this paper, the identification of the damping matrix is improved by employing the Proportional Damping Coefficient (PDC) identification method, which is based on the use of the identified set of natural frequencies and damping ratios found for the case study analyzed in the paper. This work also revisits the critical aspects and pitfalls related to using the Model Order Reduction (MOR) approach combined with the Balanced Truncation Method (BTM) to reduce the dimensions of the identified state-space models. Finally, this work analyzes the performance of all the fundamental system identification methods mentioned before when applied to the experimental modal analysis of flexible structures. This is achieved by carrying out an experimental campaign based on the use of a vibrating test rig, which serves as a demonstrative example of a typical structural system. The complete set of experimental results found in this investigation is reported in the appendix of the paper. Full article

Conventional adaptive beamformers usually suffer from serious performance degradation when the receive array is imperfect and unknown sporadic interferences appear. To enhance robustness against array imperfections and simultaneously suppress sporadic interferences, this paper studies robust adaptive beamforming (RAB) with accurate sidelobe level (SLL) control, where the imperfect array steering vector (SV) is expressed as a spherical uncertainty set. Under the maximum signal-to-interference-plus-noise ratio (SINR) criterion and robust SLL constraints, we formulate the resultant RAB into a second-order cone programming problem, which is computationally prohibitive due to numerous robust quadratic SLL constraints. To tackle this issue, we provide a subspace approximation-based method to approximate the whole sidelobe space, thus replacing all robust SLL constraints with a single subspace constraint. Moreover, we leverage the Gauss–Legendre quadrature-based scheme to generate the sidelobe space in a computationally efficient manner. Additionally, we give an explicit approach for determining the norm upper bound of SV uncertainty sets under various imperfection scenarios, addressing the challenge of obtaining this upper bound in practice.Simulation results showed that the proposed subspace approximation-based RAB beamformer had a better SINR performance than typical counterparts and was much more computationally efficient. Full article

Multi-view subspace clustering enhances clustering performance by optimizing and integrating structural information from multiple views. Recently, anchor-based methods have made notable progress in large-scale clustering scenarios by leveraging anchor points to capture data distribution across different views. Although these methods improve efficiency, a common limitation is that they typically select an equal number of anchor points from each view. Additionally, during the graph fusion stage, most existing frameworks use simple linear weighting to construct the final consensus graph, overlooking the inherent structural relationships between the data. To address these issues, we propose a novel and flexible anchor graph fusion framework which selects an appropriate number of anchor points for each view based on its data space, creating suitable anchor graphs. In the graph fusion stage, we introduce a regularization term which adaptively and flexibly combines anchor graphs of varying sizes. Moreover, our approach incorporates both global and local information between views, enabling a more accurate capture of the cluster structure within the data. Furthermore, our method operates with linear time complexity, making it well suited for large-scale datasets. Extensive experiments on multiple datasets demonstrate the superior performance of our proposed algorithm. Full article

Non-invasive temperature monitoring is highly valuable in applications such as microwave hyperthermia treatment, where overheating may damage healthy tissue. This paper presents a subspace-based method for real-time temperature monitoring using a sensor array configuration. The proposed method improves upon the conventional Born approximation (BA) approach by accurately estimating the total field through primary induced currents. The temperature-dependent dielectric properties of breast tissues are modeled using data from porcine tissues, and a sigmoid function is employed to create realistic temperature transition zones in the numerical breast phantom. The method is validated through extensive simulations under noise-free and noisy conditions (SNR = 30 dB and 20 dB). The results demonstrate that our method maintains consistent performance across different temperature levels (38–45 °C), achieving reconstruction accuracy within ±0.2 °C at SNR = 30 dB and ±0.5 °C at SNR = 20 dB. While the computational overhead of calculating primary induced currents slightly increases the overall processing time, it leads to a faster convergence in the cost function minimization. These findings suggest that the proposed method offers a promising solution for real-time temperature monitoring in microwave hyperthermia applications. Full article

Commonly used methods for identifying modal parameters under environmental excitations assume that the unknown environmental input is a stationary white noise sequence. For large-scale civil structures, actual environmental excitations, such as wind gusts and impact loads, cannot usually meet this condition, and exhibit obvious non-stationary and non-white-noise characteristics. The theoretical basis of the stochastic subspace method is the state-space equation in the time domain, while the state-space equation of the system is only applicable to linear systems. Therefore, under non-smooth excitation, this paper proposes a stochastic subspace method based on RDT. Firstly, this paper uses the random decrement technique of non-stationary excitation to obtain the free attenuation response of the response signal, and then uses the stochastic subspace identification (SSI) method to identify the modal parameters. This not only improves the signal-to-noise ratio of the signal, but also improves the computational efficiency significantly. A non-stationary excitation is applied to the spatial grid structure model, and the RDT-SSI method is used to identify the modal parameters. The identification results show that the proposed method can solve the problem of identifying structural modal parameters under non-stationary excitation. This method is applied to the actual health monitoring of stadium grids, and can also obtain better identification results in frequency, damping ratio, and vibration mode, while also significantly improving computational efficiency. Full article

Software-defined radio (SDR) has high flexibility and low cost. It conforms to the miniaturization, lightweight, and digitization trends in through-wall radar systems. Stepped frequency continuous waveform (SFCW) is commonly used in through-wall radar, which has high resolution and strong anti-interference ability. This article develops an SFCW through-wall radar system based on a dual-channel SDR platform. Without changing hardware structure and complicated accessories, a phase compensation method of solving the phase incoherence problem in a low-cost dual-channel SDR platform is proposed. In addition, this article proposes a wall clutter mitigation approach by means of singular value decomposition (SVD) and principal component analysis (PCA) framework for through-wall applications. This approach can process the wall clutter and noise efficiently, and then extract the target subspace to obtain location information. The experimental results indicate that the proposed windowing-based SVD-PCA approach is effective for the developed radar system, which can ensure the accuracy of through-wall detection. It is also superior to the traditional methods in terms of the image quality of range profiles or signal-to-noise ratio (SNR). Full article

Band selection is an important step in the dimensionality reduction processing of hyperspectral images and is highly important for eliminating redundant spectral information and reducing computational costs. In recent years, band selection methods based on ordered partition have been widely used in the dimensionality reduction processing of hyperspectral images. However, most of the methods use coarse and fine partition for band subspace partition, so that the partition results are affected by equal interval partition. Furthermore, existing methods usually select a representative band in each band subspace but do not consider the relationship between the output bands in the selection process, resulting in a certain degree of redundancy between the output bands. To solve the above problems, we propose a band selection method based on global partition clustering that contains band subspace partition and band selection. The band subspace partition is based on coarse and fine partition and the similarity-based ranking-structural similarity method, which divides the band space into band subspaces according to the relationship between the number of bands in the hyperspectral image and the number of selected bands. Band selection is based on the sequential forward selection method, which iteratively selects one band as the output band in each band subspace. The proposed method makes two main contributions. Firstly, this method avoids the negative effect of equal interval partition on the results. Secondly, this method fully considers the relationship between the selected bands and the bands to be selected. The effectiveness of the proposed method is demonstrated via ablation and comparison experiments on three publicly available datasets. Comparison experiments show that the classification accuracy of the proposed method can exceed the accuracy of the comparison methods. Full article

This paper implements an unsupervised single-image sharpening method for multispectral images, focusing on Sentinel-2 and Landsat 8 imagery. Our method combines traditional model-based methods with neural network optimization techniques. Our method solves the same optimization problem as traditional model-based methods while leveraging neural network optimization techniques through a customized U-Net architecture and specialized loss function. The key innovation lies in simultaneously optimizing a low-rank approximation of the target image and a linear transformation from the subspace to the sharpened image within an unsupervised training framework. Our method offers several distinct advantages: it requires no external training data beyond the image being processed, it provides fast training speeds through a compact, interpretable network model, and most importantly, it adapts to different input images without requiring extensive parameter tuning—a common limitation of traditional methods. The method was developed with a focus on sharpening Sentinel-2 imagery. The Copernicus Sentinel-2 satellite constellation captures images at three different spatial resolutions, 10, 20, and 60 m, and many applications benefit from a unified 10 m resolution. Still, the method’s effectiveness extends to other remote sensing tasks, achieving competitive results in both sharpening and multisensor fusion scenarios. It is evaluated using both real and simulated data, and its versatility is shown through successful applications to Sentinel-2 sharpening and Sentinel-2/Landsat 8 fusion. In comparison with leading methods, it is shown to give excellent results. Full article

This paper takes underwater hexapod robot target grasping in an extremely shallow water environment as the research goal and carries out the research on a high-precision and low-complexity method of target positioning. We address the above problem of estimating the two-dimensional (2D) directions of arrival (DOAs) of targets, using an L-shaped ultrasonic array. Based on the above considerations, low-complexity 2D multiple signal classification (MUSIC) based on sparse signal recovery (SSR) is proposed to enhance the super-resolution capability and DOA estimation accuracy. In the first step, subspace dimension is determined based on space distance. Then, a mixed-norm method is exploited to construct the projection subspace and new noise subspace. Finally, the orthogonality between the noise and signal subspaces is used to estimate DOAs. Via a numerical simulations analysis, we illustrate that the proposed technique can enhance the accuracy of DOA estimation while also being robust against coherent sources and limited snapshots. Full article

Subspace learning has achieved promising performance as a key technique for unsupervised feature selection. The strength of subspace learning lies in its ability to identify a representative subspace encompassing a cluster of features that are capable of effectively approximating the space of the original features. Nonetheless, most existing unsupervised feature selection methods based on subspace learning are constrained by two primary challenges. (1) Many methods only predominantly focus on the relationships between samples in the data space but ignore the correlated information between features in the feature space, which is unreliable for exploiting the intrinsic spatial structure. (2) Graph-based methods typically only take account of one-order neighborhood structures, neglecting high-order neighborhood structures inherent in original data, thereby failing to accurately preserve local geometric characteristics of the data. To pursue filling this gap in research, taking dual high-order graph learning into account, we propose a framework called subspace learning for dual high-order graph learning based on Boolean weight (DHBWSL). Firstly, a framework for unsupervised feature selection based on subspace learning is proposed, which is extended by dual-graph regularization to fully investigate geometric structure information on dual spaces. Secondly, the dual high-order graph is designed by embedding Boolean weights to learn a more extensive node from the original space such that the appropriate high-order adjacency matrix can be selected adaptively and flexibly. Experimental results on 12 public datasets demonstrate that the proposed DHBWSL outperforms the nine recent state-of-the-art algorithms. Full article

For solving the continuous Sylvester equation, a class of Hermitian and skew-Hermitian based multiplicative splitting iteration methods is presented. We consider two symmetric positive definite splittings for each coefficient matrix of the continuous Sylvester equations, and it can be equivalently written as two multiplicative splitting matrix equations. When both coefficient matrices in the continuous Sylvester equation are (non-symmetric) positive semi-definite, and at least one of them is positive definite, we can choose Hermitian and skew-Hermitian (HS) splittings of matrices A and B in the first equation, and the splitting of the Jacobi iterations for matrices A and B in the second equation in the multiplicative splitting iteration method. Convergence conditions of this method are studied in depth, and numerical experiments show the efficiency of this method. Moreover, by numerical computation, we show that multiplicative splitting can be used as a splitting preconditioner and induce accurate, robust and effective preconditioned Krylov subspace iteration methods for solving the continuous Sylvester equation. Full article