Search Results (7)

Multispectral and hyperspectral image fusion (MHF) aims to reconstruct high-resolution hyperspectral images by fusing spatial and spectral information. Unlike the traditional canonical polyadic decomposition and Tucker decomposition models, the block-term tensor decomposition model is able to improve the quality of fused images using known endmember and abundance information. This paper presents an improved hyperspectral image fusion algorithm. Firstly, the two abundance matrices are combined into a single bulk matrix to promote structural sparsity by introducing the $L_{2,1}$-norm to eliminate the scaling effects present in the model. Secondly, the counter-scaling effect is eliminated by adding the $L_2$-norm to the endmember matrix. Finally, the chunk matrix and the endmember matrix are coupled together, and the matrix is reorganized by adding the $L_{2,1}$-norm to the matrix to facilitate chunk elimination and solved using an extended iterative reweighted least squares (IRLS) method, focusing on the problem of the inability to accurately estimate the tensor rank in the chunk-term tensor decomposition model and the noise/artifact problem arising from overestimation of rank. Experiments are conducted on standard and local datasets, and the fusion results are compared and analyzed in four ways: visual result analysis, metric evaluation, time of the algorithm, and classification results, and the experimental results show that the performance of the proposed method is better than the existing methods. An extensive performance evaluation of the algorithms is performed by conducting experiments on different datasets. The experimental results show that the proposed algorithm achieves significant improvements in terms of reconstruction error, signal-to-noise ratio, and image quality compared with the existing methods. Especially in the case of a low signal-to-noise ratio, the proposed algorithm shows stronger robustness and accuracy. These results show that the proposed algorithm has significant advantages in dealing with multispectral high-resolution hyperspectral data. Full article

The problem of multispectral and hyperspectral image fusion (MHF) is to reconstruct images by fusing the spatial information of multispectral images and the spectral information of hyperspectral images. Focusing on the problem that the hyperspectral canonical polyadic decomposition model and the Tucker model cannot introduce the physical interpretation of the latent factors into the framework, it is difficult to use the known properties and abundance of endmembers to generate high-quality fusion images. This paper proposes a new fusion algorithm. In this paper, a coupled non-negative block-term tensor model is used to estimate the ideal high spatial resolution hyperspectral images, its sparsity is characterized by adding 1-norm, and total variation (TV) is introduced to describe piecewise smoothness. Secondly, the different operators in two directions are defined and introduced to characterize their piecewise smoothness. Finally, the proximal alternating optimization (PAO) algorithm and the alternating multiplier method (ADMM) are used to iteratively solve the model. Experiments on two standard datasets and two local datasets show that the performance of this method is better than the state-of-the-art methods. Full article

Hyperspectral image (HSI) super-resolution aims at improving the spatial resolution of HSI by fusing a high spatial resolution multispectral image (MSI). To preserve local submanifold structures in HSI super-resolution, a novel superpixel graph-based super-resolution method is proposed. Firstly, the MSI is segmented into superpixel blocks to form two-directional feature tensors, then two graphs are created using spectral–spatial distance between the unfolded feature tensors. Secondly, two graph Laplacian terms involving underlying BTD factors of high-resolution HSI are developed, which ensures the inheritance of the spatial geometric structures. Finally, by incorporating graph Laplacian priors with the coupled BTD degradation model, a HSI super-resolution model is established. Experimental results demonstrate that the proposed method achieves better fused results compared with other advanced super-resolution methods, especially on the improvement of the spatial structure. Full article

This work proposes a novel scheme for speckle suppression on medical images acquired by ultrasound sensors. The proposed method is based on the block matching procedure by using mutual information as a similarity measure in grouping patches in a clustered area, originating a new despeckling method that integrates the statistical properties of an image and its texture for creating 3D groups in the BM3D scheme. For this purpose, the segmentation of ultrasound images is carried out considering superpixels and a variation of the local binary patterns algorithm to improve the performance of the block matching procedure. The 3D groups are modeled in terms of grouped tensors and despekled with singular value decomposition. Moreover, a variant of the bilateral filter is used as a post-processing step to recover and enhance edges’ quality. Experimental results have demonstrated that the designed framework guarantees a good despeckling performance in ultrasound images according to the objective quality criteria commonly used in literature and via visual perception. Full article

Hyperspectral images are becoming a valuable tool much used in agriculture, mineralogy, and so on. The challenge is to successfully classify the materials founded in the field relevant for different applications. Due to a large amount of data corresponding to a big number of spectral bands, the classification programs require a long time to analyze and classify the data. The purpose is to find a better method for reducing the classification time. We exploit various algorithms on real hyperspectral data sets to find out which algorithm is more effective. This paper presents a comparison of unsupervised hyperspectral image classification such as K-means, Hierarchical clustering, and Parafac decomposition, which allows the performance of the model reduction and feature extraction. The results showed that the method useful for big data is the classification of data after Parafac Decomposition. Full article

With the rapid expansion of the railway represented by high-speed rail (HSR) in China, competition between railway and aviation will become increasingly common on a large scale. Beijing, Shanghai, and Guangzhou are the busiest cities and the hubs of railway and aviation transportation in China. Obtaining their supply configuration patterns can help identify defects in planning. To achieve that, supply level is proposed, which is a weighted supply traffic volume that takes population and distance factors into account. Then supply configuration can be expressed as the distribution of supply level over time periods with different railway stations, airports, and city categories. Furthermore, nonnegative tensor factorization (NTF) is applied to pattern recognition by introducing CP (CANDECOMP/PARAFAC) decomposition and the block coordinate descent (BCD) algorithm for the selected data set. Numerical experiments show that the designed method has good performance in terms of computation speed and solution quality. Recognition results indicate the significant pattern characteristics of rail–air transport for Beijing, Shanghai, and Guangzhou are extracted, which can provide some theoretical references for practical policymakers. Full article

The statement of the eigenvalue problem for a tensor–block matrix (TBM) of any order and of any even rank is formulated, and also some of its special cases are considered. In particular, using the canonical presentation of the TBM of the tensor of elastic modules of the micropolar theory, in the canonical form the specific deformation energy and the constitutive relations are written. With the help of the introduced TBM operator, the equations of motion of a micropolar arbitrarily anisotropic medium are written, and also the boundary conditions are written down by means of the introduced TBM operator of the stress and the couple stress vectors. The formulations of initial-boundary value problems in these terms for an arbitrary anisotropic medium are given. The questions on the decomposition of initial-boundary value problems of elasticity and thin body theory for some anisotropic media are considered. In particular, the initial-boundary problems of the micropolar (classical) theory of elasticity are presented with the help of the introduced TBM operators (tensors–operators). In the case of an isotropic micropolar elastic medium (isotropic and transversely isotropic classical media), the TBM operator (tensors–operators) of cofactors to TBM operators (tensors–tensors) of the initial-boundary value problems are constructed that allow decomposing initial-boundary value problems. We also find the determinant and the tensor of cofactors to the sum of six tensors used for decomposition of initial-boundary value problems. From three-dimensional decomposed initial-boundary value problems, the corresponding decomposed initial-boundary value problems for the theories of thin bodies are obtained. Full article