Research on infrared dim and small target detection algorithm based on low-rank tensor recovery

In order to rapidly and accurately detect infrared small and dim targets in the infrared image of complex scene collected by virtual prototyping of space-based downward-looking multiband detection,an improved detection algorithm of infrared small and dim target is proposed in this paper.Firstly,the original infrared images are changed into a new infrared patch tensor mode through data reconstruction.Then,the infrared small and dim target detection problems are converted to low-rank tensor recovery problems based on tensor nuclear norm in accordance with patch tensor characteristics,and inverse variance weighted entropy is defined for self-adaptive adjustment of sparseness.Finally,the low-rank tensor recovery problem with noise is solved by alternating the direction method to obtain the sparse target image,and the final small target is worked out by a simple partitioning algorithm.The test results in various spacebased downward-looking complex scenes show that such method can restrain complex background well by virtue of rapid arithmetic speed with high detection probability and low false alarm rate.It is a kind of infrared small and dim target detection method with good performance.

Multidomain Correlation-Based Multidimensional CSI Tensor Generation for Device-FreeWi-Fi Sensing

Due to the fine-grained communication scenarios characterization and stability,Wi-Fi channel state information(CSI)has been increasingly applied to indoor sensing tasks recently.Although spatial variations are explicitlyreflected in CSI measurements,the representation differences caused by small contextual changes are easilysubmerged in the fluctuations of multipath effects,especially in device-free Wi-Fi sensing.Most existing datasolutions cannot fully exploit the temporal,spatial,and frequency information carried by CSI,which results ininsufficient sensing resolution for indoor scenario changes.As a result,the well-liked machine learning(ML)-based CSI sensing models still struggling with stable performance.This paper formulates a time-frequency matrixon the premise of demonstrating that the CSI has low-rank potential and then proposes a distributed factorizationalgorithm to effectively separate the stable structured information and context fluctuations in the CSI matrix.Finally,a multidimensional tensor is generated by combining the time-frequency gradients of CSI,which containsrich and fine-grained real-time contextual information.Extensive evaluations and case studies highlight thesuperiority of the proposal.

Low-Rank Optimal Transport for Robust Domain Adaptation

When encountering the distribution shift between the source(training) and target(test) domains, domain adaptation attempts to adjust the classifiers to be capable of dealing with different domains. Previous domain adaptation research has achieved a lot of success both in theory and practice under the assumption that all the examples in the source domain are welllabeled and of high quality. However, the methods consistently lose robustness in noisy settings where data from the source domain have corrupted labels or features which is common in reality. Therefore, robust domain adaptation has been introduced to deal with such problems. In this paper, we attempt to solve two interrelated problems with robust domain adaptation:distribution shift across domains and sample noises of the source domain. To disentangle these challenges, an optimal transport approach with low-rank constraints is applied to guide the domain adaptation model training process to avoid noisy information influence. For the domain shift problem, the optimal transport mechanism can learn the joint data representations between the source and target domains using a measurement of discrepancy and preserve the discriminative information. The rank constraint on the transport matrix can help recover the corrupted subspace structures and eliminate the noise to some extent when dealing with corrupted source data. The solution to this relaxed and regularized optimal transport framework is a convex optimization problem that can be solved using the Augmented Lagrange Multiplier method, whose convergence can be mathematically proved. The effectiveness of the proposed method is evaluated through extensive experiments on both synthetic and real-world datasets.

三维稳态Q-tensor液晶流系统各向异性的Liouville型定理

考虑速度分量的各向异性进行能量估计,得到三维稳态Q-tensor液晶流系统的Liouville型定理,即若u∈L^(q)(R^(3))∩˙H^(1)(R^(3)),u_(i)∈L xi q/q−2 L s xei(R×R^(2))(i=1,2,3),且Q∈H^(2)(R^(3)),其中2/q+1/s≥1/2,1≤s≤∞,2<q<∞,则该稳态系统只有平凡解.这个结论推广了已有的结果.

Euler Product Expressions of Absolute Tensor Products of Dirichlet L-Functions

In this paper, we calculate the absolute tensor square of the Dirichlet L-functions and show that it is expressed as an Euler product over pairs of primes. The method is to construct an equation to link primes to a series which has the factors of the absolute tensor product of the Dirichlet L-functions. This study is a generalization of Akatsuka’s theorem on the Riemann zeta function, and gives a proof of Kurokawa’s prediction proposed in 1992.

Research on Tensor Multi-Clustering Distributed Incremental Updating Method for Big Data

The scale and complexity of big data are growing continuously,posing severe challenges to traditional data processing methods,especially in the field of clustering analysis.To address this issue,this paper introduces a new method named Big Data Tensor Multi-Cluster Distributed Incremental Update(BDTMCDIncreUpdate),which combines distributed computing,storage technology,and incremental update techniques to provide an efficient and effective means for clustering analysis.Firstly,the original dataset is divided into multiple subblocks,and distributed computing resources are utilized to process the sub-blocks in parallel,enhancing efficiency.Then,initial clustering is performed on each sub-block using tensor-based multi-clustering techniques to obtain preliminary results.When new data arrives,incremental update technology is employed to update the core tensor and factor matrix,ensuring that the clustering model can adapt to changes in data.Finally,by combining the updated core tensor and factor matrix with historical computational results,refined clustering results are obtained,achieving real-time adaptation to dynamic data.Through experimental simulation on the Aminer dataset,the BDTMCDIncreUpdate method has demonstrated outstanding performance in terms of accuracy(ACC)and normalized mutual information(NMI)metrics,achieving an accuracy rate of 90%and an NMI score of 0.85,which outperforms existing methods such as TClusInitUpdate and TKLClusUpdate in most scenarios.Therefore,the BDTMCDIncreUpdate method offers an innovative solution to the field of big data analysis,integrating distributed computing,incremental updates,and tensor-based multi-clustering techniques.It not only improves the efficiency and scalability in processing large-scale high-dimensional datasets but also has been validated for its effectiveness and accuracy through experiments.This method shows great potential in real-world applications where dynamic data growth is common,and it is of significant importance for advancing the development of data analysis technology.

Fault Diagnosis Scheme for Railway Switch Machine Using Multi-Sensor Fusion Tensor Machine

Railway switch machine is essential for maintaining the safety and punctuality of train operations.A data-driven fault diagnosis scheme for railway switch machine using tensor machine and multi-representation monitoring data is developed herein.Unlike existing methods,this approach takes into account the spatial information of the time series monitoring data,aligning with the domain expertise of on-site manual monitoring.Besides,a multi-sensor fusion tensor machine is designed to improve single signal data’s limitations in insufficient information.First,one-dimensional signal data is preprocessed and transformed into two-dimensional images.Afterward,the fusion feature tensor is created by utilizing the images of the three-phase current and employing the CANDE-COMP/PARAFAC(CP)decomposition method.Then,the tensor learning-based model is built using the extracted fusion feature tensor.The developed fault diagnosis scheme is valid with the field three-phase current dataset.The experiment indicates an enhanced performance of the developed fault diagnosis scheme over the current approach,particularly in terms of recall,precision,and F1-score.

Optimizing Recovery Following Mihata Superior Capsular Reconstruction Surgery with Tensor Fascia Lata Auto Graft: A Comprehensive Rehabilitation Protocol

Objective: Superior Capsular Reconstruction (SCR) using a Tensor Fascia Lata (TFL) autograft is an evolving technique for treating irreparable rotator cuff tears. The Mihata technique, initially developed in Japan, has shown promising long-term results. However, a standardized post-operative rehabilitation protocol for this procedure in the USA is lacking. Purpose: This study aims to evaluate the outcomes of a comprehensive rehabilitation protocol following SCR with TFL autograft in a cohort of nine patients. Participants and Methods: A prospective observational study was conducted at Concentra Urgent Care, San Francisco. Nine patients, aged 55 - 65 years, underwent SCR with TFL autograft performed by a specialized orthopedic surgeon. Post-operative rehabilitation was managed using a structured protocol, divided into three phases focusing on passive exercises, progressive range of motion, and strengthening. Outcomes were measured using the Visual Analogue Scale (VAS) for pain, forward flexion range of motion (FF-ROM), and Single Assessment Numeric Evaluation (SANE) scores over a six-month period. Results: Significant improvements were observed in pain reduction (mean VAS decrease of −3.67 points, p = 0.01), ROM (mean FF increase of 41.11 degrees, p = 0.014), and SANE scores (mean improvement of 42.11%, p = 0.009), indicating the efficacy of the rehabilitation protocol. Conclusion: The comprehensive rehabilitation protocol following SCR with TFL autograft significantly improved pain, range of motion, and shoulder function in patients, suggesting its potential utility in clinical practice.

Stress tensor determination by modified hydraulic tests on pre-existing fractures:Method and stress constraints

The hydraulic testing of pre-existing fractures(HTPF)is one of the most promising in situ stress measurement methods,particularly for three-dimensional stress tensor determination.However,the stress tensor determination based on the HTPF method requires at least six tests or a minimum of 14-15 tests(under different conditions)for reliable results.In this study,we modified the HTPF method by considering the shear stress on each pre-existing fracture,which increased the number of equations for the stress tensor determination and decreased the number of tests required.Different shear stresses were attributed to different fractures by random sampling;therefore,the stress tensors were obtained by searching for the optimal solution using the least squares criterion based on the Monte Carlo method.Thereafter,we constrained the stress tensor based on the tensile strength criterion,compressive strength criterion,and vertical stress constraints.The inverted stress tensors were presented and analyzed based on the tensorial nature of the stress using the Euclidean mean stress tensor.Two stress-measurement campaigns in Weifang(Shandong Province,China)and Mercantour road tunnel(France)were implemented to highlight the validity and efficiency of the modified HTPF(M-HTPF)method.The results showed that the M-HTPF method can be applied for stress tensor inversion using only three to four tests on pre-existing fractures,neglecting the stress gradient.The inversion results were confined to relatively small distribution dispersions and were significantly reliable and stable due to the shear stresses on the fractures and the stress constraints employed.The M-HTPF method is highly feasible and efficient for complete stress tensor determination in a single borehole.

Quantum geometric tensor and the topological characterization of the extended Su-Schrieffer-Heeger model

We investigate the quantum metric and topological Euler number in a cyclically modulated Su-Schrieffer-Heeger(SSH)model with long-range hopping terms.By computing the quantum geometry tensor,we derive exact expressions for the quantum metric and Berry curvature of the energy band electrons,and we obtain the phase diagram of the model marked by the first Chern number.Furthermore,we also obtain the topological Euler number of the energy band based on the Gauss-Bonnet theorem on the topological characterization of the closed Bloch states manifold in the first Brillouin zone.However,some regions where the Berry curvature is identically zero in the first Brillouin zone result in the degeneracy of the quantum metric,which leads to ill-defined non-integer topological Euler numbers.Nevertheless,the non-integer"Euler number"provides valuable insights and an upper bound for the absolute values of the Chern numbers.

Prediction of(n,2n)reaction cross-sections of long-lived fission products based on tensor model

Interest has recently emerged in potential applications of(n,2n)reactions of unstable nuclei.Challenges have arisen because of the scarcity of experimental cross-sectional data.This study aims to predict the(n,2n)reaction cross-section of long-lived fission products based on a tensor model.This tensor model is an extension of the collaborative filtering algorithm used for nuclear data.It is based on tensor decomposition and completion to predict(n,2n)reaction cross-sections;the corresponding EXFOR data are applied as training data.The reliability of the proposed tensor model was validated by comparing the calculations with data from EXFOR and different databases.Predictions were made for long-lived fission products such as^(60)Co,^(79)Se,^(93)Zr,^(107)P,^(126)Sn,and^(137)Cs,which provide a predicted energy range to effectively transmute long-lived fission products into shorter-lived or less radioactive isotopes.This method could be a powerful tool for completing(n,2n)reaction cross-sectional data and shows the possibility of selective transmutation of nuclear waste.

Implementing and evaluating an automatic centroid moment tensor procedure for the Indonesia region and surrounding areas

The purpose of this research was to suggest an applicable procedure for computing the centroid moment tensor(CMT)automatically and in real time from earthquakes that occur in Indonesia and the surrounding areas.Gisola software was used to estimate the CMT solution by selecting the velocity model that best suited the local and regional geological conditions in Indonesia and the surrounding areas.The data used in this study were earthquakes with magnitudes of 5.4 to 8.0.High-quality,real-time broadband seismographic data were provided by the International Federation of Digital Seismograph Networks Web Services(FDSNWS)and the European Integrated Data Archive(EIDA)Federation in Indonesia and the surrounding areas.Furthermore,the inversion process and filter adjustment were carried out on the seismographic data to obtain good CMT solutions.The CMT solutions from Gisola provided good-quality solutions,in which all earthquake data had A-level quality(high quality,with good variant reduction).The Gisola CMT solution was justified with the Global CMT(GCMT)solution by using the Kagan angle value,with an average of approximately 11.2°.This result suggested that the CMT solution generated from Gisola was trustworthy and reliable.The Gisola CMT solution was typically available within approximately 15 minutes after an earthquake occurred.Once it met the quality requirement,it was automatically published on the internet.The catalog of local and regional earthquake records obtained through this technology holds great promise for improving the current understanding of regional seismic activity and ongoing tectonic processes.The accurate and real-time CMT solution generated by implementing the Gisola algorithm consisted of moment tensors and moment magnitudes,which provided invaluable insights into earthquakes occurring in Indonesia and the surrounding areas.

A Novel Tensor Decomposition-Based Efficient Detector for Low-Altitude Aerial Objects With Knowledge Distillation Scheme

Unmanned aerial vehicles(UAVs) have gained significant attention in practical applications, especially the low-altitude aerial(LAA) object detection imposes stringent requirements on recognition accuracy and computational resources. In this paper, the LAA images-oriented tensor decomposition and knowledge distillation-based network(TDKD-Net) is proposed,where the TT-format TD(tensor decomposition) and equalweighted response-based KD(knowledge distillation) methods are designed to minimize redundant parameters while ensuring comparable performance. Moreover, some robust network structures are developed, including the small object detection head and the dual-domain attention mechanism, which enable the model to leverage the learned knowledge from small-scale targets and selectively focus on salient features. Considering the imbalance of bounding box regression samples and the inaccuracy of regression geometric factors, the focal and efficient IoU(intersection of union) loss with optimal transport assignment(F-EIoU-OTA)mechanism is proposed to improve the detection accuracy. The proposed TDKD-Net is comprehensively evaluated through extensive experiments, and the results have demonstrated the effectiveness and superiority of the developed methods in comparison to other advanced detection algorithms, which also present high generalization and strong robustness. As a resource-efficient precise network, the complex detection of small and occluded LAA objects is also well addressed by TDKD-Net, which provides useful insights on handling imbalanced issues and realizing domain adaptation.

Least Squares One-Class Support Tensor Machine

One-class classification problem has become a popular problem in many fields, with a wide range of applications in anomaly detection, fault diagnosis, and face recognition. We investigate the one-class classification problem for second-order tensor data. Traditional vector-based one-class classification methods such as one-class support vector machine (OCSVM) and least squares one-class support vector machine (LSOCSVM) have limitations when tensor is used as input data, so we propose a new tensor one-class classification method, LSOCSTM, which directly uses tensor as input data. On one hand, using tensor as input data not only enables to classify tensor data, but also for vector data, classifying it after high dimensionalizing it into tensor still improves the classification accuracy and overcomes the over-fitting problem. On the other hand, different from one-class support tensor machine (OCSTM), we use squared loss instead of the original loss function so that we solve a series of linear equations instead of quadratic programming problems. Therefore, we use the distance to the hyperplane as a metric for classification, and the proposed method is more accurate and faster compared to existing methods. The experimental results show the high efficiency of the proposed method compared with several state-of-the-art methods.

Low-Rank Multi-View Subspace Clustering Based on Sparse Regularization

Multi-view Subspace Clustering (MVSC) emerges as an advanced clustering method, designed to integrate diverse views to uncover a common subspace, enhancing the accuracy and robustness of clustering results. The significance of low-rank prior in MVSC is emphasized, highlighting its role in capturing the global data structure across views for improved performance. However, it faces challenges with outlier sensitivity due to its reliance on the Frobenius norm for error measurement. Addressing this, our paper proposes a Low-Rank Multi-view Subspace Clustering Based on Sparse Regularization (LMVSC- Sparse) approach. Sparse regularization helps in selecting the most relevant features or views for clustering while ignoring irrelevant or noisy ones. This leads to a more efficient and effective representation of the data, improving the clustering accuracy and robustness, especially in the presence of outliers or noisy data. By incorporating sparse regularization, LMVSC-Sparse can effectively handle outlier sensitivity, which is a common challenge in traditional MVSC methods relying solely on low-rank priors. Then Alternating Direction Method of Multipliers (ADMM) algorithm is employed to solve the proposed optimization problems. Our comprehensive experiments demonstrate the efficiency and effectiveness of LMVSC-Sparse, offering a robust alternative to traditional MVSC methods.

Robust Principal Component Analysis Integrating Sparse and Low-Rank Priors

Principal Component Analysis (PCA) is a widely used technique for data analysis and dimensionality reduction, but its sensitivity to feature scale and outliers limits its applicability. Robust Principal Component Analysis (RPCA) addresses these limitations by decomposing data into a low-rank matrix capturing the underlying structure and a sparse matrix identifying outliers, enhancing robustness against noise and outliers. This paper introduces a novel RPCA variant, Robust PCA Integrating Sparse and Low-rank Priors (RPCA-SL). Each prior targets a specific aspect of the data’s underlying structure and their combination allows for a more nuanced and accurate separation of the main data components from outliers and noise. Then RPCA-SL is solved by employing a proximal gradient algorithm for improved anomaly detection and data decomposition. Experimental results on simulation and real data demonstrate significant advancements.

Multi-Modal Medical Image Fusion Based on Improved Parameter Adaptive PCNN and Latent Low-Rank Representation

Multimodal medical image fusion can help physicians provide more accurate treatment plans for patients, as unimodal images provide limited valid information. To address the insufficient ability of traditional medical image fusion solutions to protect image details and significant information, a new multimodality medical image fusion method(NSST-PAPCNNLatLRR) is proposed in this paper. Firstly, the high and low-frequency sub-band coefficients are obtained by decomposing the source image using NSST. Then, the latent low-rank representation algorithm is used to process the low-frequency sub-band coefficients;An improved PAPCNN algorithm is also proposed for the fusion of high-frequency sub-band coefficients. The improved PAPCNN model was based on the automatic setting of the parameters, and the optimal method was configured for the time decay factor αe. The experimental results show that, in comparison with the five mainstream fusion algorithms, the new algorithm has significantly improved the visual effect over the comparison algorithm,enhanced the ability to characterize important information in images, and further improved the ability to protect the detailed information;the new algorithm has achieved at least four firsts in six objective indexes.

A Perturbation Analysis of Low-Rank Matrix Recovery by Schatten p-Minimization

A number of previous papers have studied the problem of recovering low-rank matrices with noise, further combining the noisy and perturbed cases, we propose a nonconvex Schatten p-norm minimization method to deal with the recovery of fully perturbed low-rank matrices. By utilizing the p-null space property (p-NSP) and the p-restricted isometry property (p-RIP) of the matrix, sufficient conditions to ensure that the stable and accurate reconstruction for low-rank matrix in the case of full perturbation are derived, and two upper bound recovery error estimation ns are given. These estimations are characterized by two vital aspects, one involving the best r-approximation error and the other concerning the overall noise. Specifically, this paper obtains two new error upper bounds based on the fact that p-RIP and p-NSP are able to recover accurately and stably low-rank matrix, and to some extent improve the conditions corresponding to RIP.

关于Focal Loss的Tensor Train多项式分类器

在模式分类领域,多项式分类器因其复杂决策边界能力而得到广泛研究。利用TensorTrain分解形式来表示多项式分类器,可有效克服维数灾难。针对多项式分类器在训练过程中遇到的训练集分布不平衡问题,文章使用FocalLoss重塑了标准交叉损失,以降低分配给易分类样本的损失的权重,并在被广泛使用的图像分类数据集MNIST上验证了分类器的有效性。

Solution of the Matrix Second Semi-Tensor Product Equation A ∘ l X ∘ l B=C

In this paper, the solution of the matrix second semi-tensor product equation A∘lX∘lB=Cis studied. Firstly, the solvability of the matrix-vector second semi-tensor product equation is investigated. At the same time, the compatibility conditions, the sufficient and necessary conditions and the specific solution methods for the matrix solution are given. Secondly, we further consider the solvability of the second semi-tensor product equation of the matrix. For each part, several examples are given to illustrate the validity of the results.