Search Results (20)

In this paper, we present a novel four-dimensional (4D) parameter estimation method to localize the mixed far-field (FF) and near-field (NF) targets using bistatic MIMO arrays and higher-order singular value decomposition (HOSVD). The estimated four parameters include the angle-of-departure (AOD), angle-of-arrival (AOA), range-of-departure (ROD), and range-of-arrival (ROA). In the method, we store array data in a tensor form to preserve the inherent multidimensional properties of the array data. First, the observation data are arranged into a third-order tensor and its covariance tensor is calculated. Then, the HOSVD of the covariance tensor is performed. From the left singular vector matrices of the corresponding module expansion of the covariance tensor, the subspaces with respect to transmit and receive arrays are obtained, respectively. The AOD and AOA of the mixed FF and NF targets are estimated with signal-subspace, and the ROD and ROA of the NF targets are achieved using noise-subspace. Finally, the estimated four parameters are matched via a pairing method. The Cramér–Rao lower bound (CRLB) of the mixed target parameters is also derived. The numerical simulations demonstrate the superiority of the tensor-based method. Full article

Hyperspectral images (HSIs) possess an inherent three-order structure, prompting increased interest in extracting 3D features. Tensor analysis and low-rank representations, notably truncated higher-order SVD (T-HOSVD), have gained prominence for this purpose. However, determining the optimal order and addressing sensitivity to changes in data distribution remain challenging. To tackle these issues, this paper introduces an unsupervised Superpixelwise Multiscale Adaptive T-HOSVD (SmaT-HOSVD) method. Leveraging superpixel segmentation, the algorithm identifies homogeneous regions, facilitating the extraction of local features to enhance spatial contextual information within the image. Subsequently, T-HOSVD is adaptively applied to the obtained superpixel blocks for feature extraction and fusion across different scales. SmaT-HOSVD harnesses superpixel blocks and low-rank representations to extract 3D features, effectively capturing both spectral and spatial information of HSIs. By integrating optimal-rank estimation and multiscale fusion strategies, it acquires more comprehensive low-rank information and mitigates sensitivity to data variations. Notably, when trained on subsets comprising 2%, 1%, and 1% of the Indian Pines, University of Pavia, and Salinas datasets, respectively, SmaT-HOSVD achieves impressive overall accuracies of 93.31%, 97.21%, and 99.25%, while maintaining excellent efficiency. Future research will explore SmaT-HOSVD’s applicability in deep-sea HSI classification and pursue additional avenues for advancing the field. Full article

In this paper, we introduce a Reduced-Dimension Multiple-Signal Classification (RD-MUSIC) technique via Higher-Order Orthogonal Iteration (HOOI), which facilitates the estimation of the target range and angle for Frequency-Diverse Array Multiple-Input–Multiple-Output (FDA-MIMO) radars in the unfolded coprime array with unfolded coprime frequency offsets (UCA-UCFO) structure. The received signal undergoes tensor decomposition by the HOOI algorithm to get the core and factor matrices, then the 2D spectral function is built. The Lagrange multiplier method is used to obtain a one-dimensional spectral function, reducing complexity for estimating the direction of arrival (DOA). The vector of the transmitter is obtained by the partial derivatives of the Lagrangian function, and its rotational invariance facilitates target range estimation. The method demonstrates improved operation speed and decreased computational complexity with respect to the classic Higher-Order Singular-Value Decomposition (HOSVD) technique, and its effectiveness and superiority are confirmed by numerical simulations. Full article

Traditional Angle of Arrival (AoA)-based WiFi array indoor localization algorithms do not fuse Channel State Information (CSI) inter-packet data for estimation, which makes WiFi arrays less effective for localization in complex indoor environments. Most algorithms are overburdened leading to inefficient localization. To address these issues, in this article, an indoor positioning algorithm based on Higher-Order Singular Value Decomposition (HOSVD) is proposed. First, the CSI data are reconstructed as a new measurement matrix by borrowing subcarriers, and a third-order tensor is constructed. Next, tensor compression techniques are used to reduce computational complexity and the signal subspace is obtained by HOSVD. Then, the AoA is obtained by the Reduced Dimension Multiple Signal Classification (RD-MUSIC) method. Finally, the coordinates of the target can be obtained by triangulating the AoAs of the three Access Points (APs). According to the simulation experiments, the AoA can be estimated accurately at a low SNR and with low snapshots. In practical experiments, we can successfully estimate the AoA in complex indoor environments with shorter timelines using HOSVD without modifications to commercial hardware and produce a lower AoA error and localization error rates compared to other algorithms. The effectiveness of our proposed algorithm is proven by simulations and practical experiments. Full article

Coherent imaging systems, such as synthetic aperture radar (SAR), often suffer from granular speckle noise due to inherent defects, which can make interpretation challenging. Although numerous despeckling methods have been proposed in the past three decades, SAR image despeckling remains a challenging task. With the extensive use of non-local self-similarity, despeckling methods under the non-local framework have become increasingly mature. However, effectively utilizing patch similarities remains a key problem in SAR image despeckling. This paper proposes a three-dimensional (3D) SAR image despeckling method based on searching for similar patches and applying the high-order singular value decomposition (HOSVD) theory to better utilize the high-dimensional information of similar patches. Specifically, the proposed method extends two-dimensional (2D) to 3D for SAR image despeckling using tensor patches. A new, non-local similar patch-searching measure criterion is used to classify the patches, and similar patches are stacked into 3D tensors. Lastly, the iterative adaptive weighted tensor cyclic approximation is used for SAR image despeckling based on the HOSVD method. Experimental results demonstrate that the proposed method not only effectively reduces speckle noise but also preserves fine details. Full article

Since there is a frequency offset between each adjacent antenna of FDA radar, there exists angle-range two-dimensional dependence in the transmitter. For bistatic FDA-multiple input multiple output (MIMO) radar, range-direction of departure (DOD)-direction of arrival (DOA) information is coupled in transmitting the steering vector. How to decouple the three information has become the focus of research. Aiming at the issue of target parameter estimation of bistatic FDA-MIMO radar, a real-valued parameter estimation algorithm based on high-order-singular value decomposition (HOSVD) is developed. Firstly, for decoupling DOD and range in transmitter, it is necessary to divide the transmitter into subarrays. Then, the forward–backward averaging and unitary transformation techniques are utilized to convert complex-valued data into real-valued data. The signal subspace is obtained by HOSVD, and the two-dimensional spatial spectral function is constructed. Secondly, the dimension of spatial spectrum is reduced by the Lagrange algorithm, so that it is only related to DOA, and the DOA estimation is obtained. Then the frequency increment between subarrays is used to decouple the DOD and range information, and eliminate the phase ambiguity at the same time. Finally, the DOD and range estimation automatically matched with DOA estimation are obtained. The proposed algorithm uses the multidimensional structure of high-dimensional data to promote performance. Meanwhile, the proposed real-valued tensor-based method can effectively cut down the computing time. Simulation results verify the high efficiency of the developed method. Full article

Remote sensing change detection (CD) using multitemporal hyperspectral images (HSIs) provides detailed information on spectral–spatial changes and is useful in a variety of applications such as environmental monitoring, urban planning, and disaster detection. However, the high dimensionality and low spatial resolution of HSIs do not only lead to expensive computation but also bring about inter-class homogeneity and inner-class heterogeneity. Meanwhile, labeled samples are difficult to obtain in reality as field investigation is expensive, which limits the application of supervised CD methods. In this paper, two algorithms for CD based on the tensor train (TT) decomposition are proposed and are called the unsupervised tensor train (UTT) and self-supervised tensor train (STT). TT uses a well-balanced matricization strategy to capture global correlations from tensors and can therefore effectively extract low-rank discriminative features, so the curse of the dimensionality and spectral variability of HSIs can be overcome. In addition, the two proposed methods are based on unsupervised and self-supervised learning, where no manual annotations are needed. Meanwhile, the ket-augmentation (KA) scheme is used to transform the low-order tensor into a high-order tensor while keeping the total number of entries the same. Therefore, high-order features with richer texture can be extracted without increasing computational complexity. Experimental results on four benchmark datasets show that the proposed methods outperformed their tensor counterpart, the tucker decomposition (TD), the higher-order singular value decomposition (HOSVD), and some other state-of-the-art approaches. For the Yancheng dataset, OA and KAPPA of UTT reached as high as 98.11% and 0.9536, respectively, while OA and KAPPA of STT were at 98.20% and 0.9561, respectively. Full article

Frequency diverse array (FDA) radar has attracted much attention due to the angle and range dependence of the beam pattern. Multiple-input-multiple-output (MIMO) radar has high degrees of freedom (DOF) and spatial resolution. The FDA-MIMO radar, a hybrid of FDA and MIMO radar, can be used for target parameter estimation. This paper investigates a tensor-based reduced-dimension multiple signal classification (MUSIC) method, which is used for target parameter estimation in the FDA-MIMO radar. The existing subspace methods deteriorate quickly in performance with small samples and a low signal-to-noise ratio (SNR). To deal with the deterioration difficulty, the sparse estimation method is then proposed. However, the sparse algorithm has high computation complexity and poor stability, making it difficult to apply in practice. Therefore, we use tensor to capture the multi-dimensional structure of the received signal, which can optimize the effectiveness and stability of parameter estimation, reduce computation complexity and overcome performance degradation in small samples or low SNR simultaneously. In our work, we first obtain the tensor-based subspace by the high-order-singular value decomposition (HOSVD) and establish a two-dimensional spectrum function. Then the Lagrange multiplier method is applied to realize a one-dimensional spectrum function, estimate the direction of arrival (DOA) and reduce computation complexity. The transmitting steering vector is obtained by the partial derivative of the Lagrange function, and automatic pairing of target parameters is then realized. Finally, the range can be obtained by using the least square method to process the phase of transmitting steering vector. Method analysis and simulation results prove the superiority and reliability of the proposed method. Full article

Matrix completion, the problem of completing missing entries in a data matrix with low-dimensional structure (such as rank), has seen many fruitful approaches and analyses. Tensor completion is the tensor analog that attempts to impute missing tensor entries from similar low-rank type assumptions. In this paper, we study the tensor completion problem when the sampling pattern is deterministic and possibly non-uniform. We first propose an efficient weighted Higher Order Singular Value Decomposition (HOSVD) algorithm for the recovery of the underlying low-rank tensor from noisy observations and then derive the error bounds under a properly weighted metric. Additionally, the efficiency and accuracy of our algorithm are both tested using synthetic and real datasets in numerical simulations. Full article

Data modeling and dimensionality reduction are important research points in the field of big data. At present, there is no effective model to realize the consistent representation and fusion of different types of data of students in unstructured campus big data. In addition, in the process of big data processing, the amount of data is too large and the intermediate results are too complex, which seriously affects the efficiency of big data dimension reduction. To solve the above problems, this paper proposes an incremental high order singular value decomposition dimensionality (icHOSVD) reduction algorithm for unstructured campus big data. In this algorithm, the characteristics of audio, video, image and text data in unstructured campus student data are tensioned to form a sub-tensor model, and the semi-tensor product is used to fuse the sub-tensor model into a unified model as the individual student tensor model. On the basis of individual model fusion, the campus big data fusion model was segmented, and each segmented small tensor model was dimensioned by icHOSVD reduction to obtain an approximate tensor as the symmetric tensor that could replace the original tensor, so as to solve the problem of large volume of tensor fusion model and repeated calculation of intermediate results in data processing. The experimental results show that the proposed algorithm can effectively reduce the computational complexity and improve the performance compared with traditional data dimension reduction algorithms. The research results can be applied to campus big data analysis and decision-making. Full article

In recent years, advanced threats against Cyber–Physical Systems (CPSs), such as Distributed Denial of Service (DDoS) attacks, are increasing. Furthermore, traditional machine learning-based intrusion detection systems (IDSs) often fail to efficiently detect such attacks when corrupted datasets are used for IDS training. To face these challenges, this paper proposes a novel error-robust multidimensional technique for DDoS attack detection. By applying the well-known Higher Order Singular Value Decomposition (HOSVD), initially, the average value of the common features among instances is filtered out from the dataset. Next, the filtered data are forwarded to machine learning classification algorithms in which traffic information is classified as a legitimate or a DDoS attack. In terms of results, the proposed scheme outperforms traditional low-rank approximation techniques, presenting an accuracy of $98.94\%$, detection rate of $97.70\%$ and false alarm rate of $4.35\%$ for a dataset corruption level of $30\%$ with a random forest algorithm applied for classification. In addition, for error-free conditions, it is found that the proposed approach outperforms other related works, showing accuracy, detection rate and false alarm rate of $99.87\%$, $99.86\%$ and $0.16\%$, respectively, for the gradient boosting classifier. Full article

As a kind of transportation in a smart city, urban public bicycles have been adopted by major cities and bear the heavy responsibility of the “last mile” of urban public transportation. At present, the main problem of the urban public bicycle system is that it is difficult for users to rent a bike during peak h, and real-time monitoring cannot be solved adequately. Therefore, predicting the demand for bicycles in a certain period and performing redistribution in advance is of great significance for solving the lag of bicycle system scheduling with the help of IoT. Based on the HOSVD-LSTM prediction model, a prediction model of urban public bicycles based on the hybrid model is proposed by transforming the source data (multiple time series) into a high-order tensor time series. Furthermore, it uses the tensor decomposition technology (HOSVD decomposition) to extract new features (kernel tenor) from higher-order tensors. At the same time, these kernel tenors are directly used to train tensor LSTM models to obtain new kernel tenors. The inverse tensor decomposition and high-dimensional, multidimensional, and tensor dimensionality reduction were introduced. The new kernel tenor obtains the predicted value of the source sequence. Then the bicycle rental amount is predicted. Full article

No matter your experience level or budget, there is a great ski goggle waiting to be found.Goggles are an essential part of skiing or snowboarding gear to protect your eyes from harsh environmental elements and injury. In the ski goggles manufacturing industry, defects, especially on the lens surface, are unavoidable. However, defect detection and classification by visual inspection in the manufacturing process is very difficult. To overcome this problem, a novel framework based on machine vision is presented, named as the ski goggles lens defect detection, with five high-resolution cameras and custom-made lighting field to achieve a high-quality ski goggles lens image. Next, the defects on the lens of ski goggles are detected by using parallel projection in opposite directions based on adaptive energy analysis. Before being put into the classification system, the defect images are enhanced by an adaptive method based on the high-order singular value decomposition (HOSVD). Finally, dust and five types of defect images are classified into six types, i.e., dust, spotlight (type 1, type 2, type 3), string, and watermark, by using the developed classification algorithm. The defect detection and classification results of the ski goggles lens are compared to the standard quality of the manufacturer. Experiments using 120 ski goggles lens samples collected from the largest manufacturer in Taiwan are conducted to validate the performance of the proposed framework. The accurate defect detection rate is 100% and the classification accuracy rate is 99.3%, while the total running time is short. The results demonstrate that the proposed method is sound and useful for ski goggles lens inspection in industries. Full article

Hyperspectral imaging is widely used to many applications as it includes both spatial and spectral distributions of a target scene. However, a compression, or a low multilinear rank approximation of hyperspectral imaging data, is required owing to the difficult manipulation of the massive amount of data. In this paper, we propose an efficient algorithm for higher order singular value decomposition that enables the decomposition of a tensor into a compressed tensor multiplied by orthogonal factor matrices. Specifically, we sequentially compute low rank factor matrices from the Tucker-1 model optimization problems via an alternating least squares approach. Experiments with real world hyperspectral imaging revealed that the proposed algorithm could compute the compressed tensor with a higher computational speed, but with no significant difference in accuracy of compression compared to the other tensor decomposition-based compression algorithms. Full article

Here we propose an online method to explore the multiway nature of urban spaces data for outlier detection based on higher-order singular value tensor decomposition. Our proposal has two sequential steps: (i) the offline modeling step, where we model the outliers detection problem as a system; and (ii) the online modeling step, where the projection distance of each data vector is decomposed by a multidimensional method as new data arrives and an outlier statistical index is calculated. We used real data gathered and streamed by urban sensors from three cities in Finland, chosen during a continuous time interval: Helsinki, Tuusula, and Lohja. The results showed greater efficiency for the online method of detection of outliers when compared to the offline approach, in terms of accuracy between a range of 8.5% to 10% gain. We observed that online detection of outliers from real-time monitoring through the sliding window becomes a more adequate approach once it achieves better accuracy. Full article