4.7 Article

An Adaptive Weighted Tensor Completion Method for the Recovery of Remote Sensing Images With Missing Data

期刊

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TGRS.2017.2670021

关键词

Adaptive weighted; missing data reconstruction; remote sensing; tensor completion

资金

  1. National Key Research and Development Program of China [2016YFB0501403, 2016YFC0200903]
  2. National Natural Science Foundation of China [41401383, 41422108]
  3. HKRGC [GRF 12302715, 12306616, CRF C1007-15G]

向作者/读者索取更多资源

Missing information, such as dead pixel values and cloud effects, is very common image quality degradation problems in remote sensing. Missing information can reduce the accuracy of the subsequent image processing, in applications such as classification, unmixing, and target detection, and even the quantitative retrieval process. The main aim of this paper is to study an adaptive weighted tensor completion (AWTC) method for the recovery of remote sensing images with missing data. Our idea is to collectively make use of the spatial, spectral, and temporal information to build a new weighted tensor low-rank regularization model for recovering the missing data. In the model, the weights are determined adaptively by considering the contribution of the spatial, spectral, and temporal information in each dimension. Experimental results based on both simulated and real data sets are presented to verify that the proposed method can recover missing data, and its performance is found to be better than the other tested methods. In the simulated experiments, the peak signal-to-noise ratio is improved by more than 3 dB, compared with the original tensor completion model. In the real data experiments, the proposed AWTC model can better recover the dead line problem in Aqua Moderate Resolution Imaging Spectroradiometer band 6 and the scan-line corrector-off problem in enhanced thematic mapper plus images, with the smallest spectral distortion.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

Article Mathematics, Applied

Stability and generalization of graph convolutional networks in eigen-domains

Michael K. Ng, Andy Yip

Summary: This paper analyzes two-layer Graph Convolution Networks (GCNs), focusing on their generalization and stability. The study also explores the impact of data scaling on the network's stability.

ANALYSIS AND APPLICATIONS (2023)

Article Geochemistry & Geophysics

Cross-Track Illumination Correction for Hyperspectral Pushbroom Sensor Images Using Low-Rank and Sparse Representations

Lina Zhuang, Michael K. Ng, Yao Liu

Summary: This article introduces the working principle of a hyperspectral pushbroom sensor and addresses the cross-track illumination error issue. A mathematical model is developed to describe the image formation process corrupted by this error and additive Gaussian noise. A new method called HyCIC is proposed, which corrects the cross-track illumination using column mean compensation and attenuates the Gaussian noise using low-rank constraint.

IEEE TRANSACTIONS ON GEOSCIENCE AND REMOTE SENSING (2023)

Article Mathematics, Applied

A New Matrix Maximization Model for Computing Ratios of Generalized Singular Values from High-Order GSVD

Wei-Wei Xu, Michael K. Ng

Summary: A High-Order Generalized Singular Value Decomposition (HO-GSVD) is used to compare multiple matrices {Ai} (N) (i=1) with different row dimensions by examining their generalized singular values {sigma i, k} Ni=1. The significance of the k-th basis vector on the right hand side of the matrix from HO-GSVD for multiple matrices {A(i)} (N) (i=1) can be determined by the ratio values of sigma(i, k)/sigma(j, k). This paper proposes and studies a new matrix maximization model for computing these ratio values from A(1), ..., A(N), which can be solved using the Newton method on Lie Groups with well-defined initial values. Numerical examples are provided to demonstrate the fast performance of the proposed method in solving the optimization model compared to existing algorithms and the Riemannian Newton method.

JOURNAL OF SCIENTIFIC COMPUTING (2023)

Article Engineering, Electrical & Electronic

Fast Full-Wave Electromagnetic Forward Solver Based on Deep Conditional Convolutional Autoencoders

Huan Huan Zhang, He Ming Yao, Lijun Jiang, Michael Ng

Summary: This letter proposes a novel deep learning-based fast solver for the electromagnetic forward process. The solver is based on a deep conditional convolutional autoencoder (DCCAE) consisting of a complex-valued deep convolutional encoder network and its corresponding decoder network. The proposed solver can accurately predict the electromagnetic field of a target domain in real-time applications, significantly reducing computation time compared to conventional methods.

IEEE ANTENNAS AND WIRELESS PROPAGATION LETTERS (2023)

Article Mathematics, Applied

Riemannian conjugate gradient descent method for fixed multi rank third-order tensor completion

Guang-Jing Song, Xue-Zhong Wang, Michael K. Ng

Summary: This paper investigates the low rank third-order tensor completion problems and proposes a solution using Riemannian optimization methods. With suitable incoherence conditions, the proposed method can converge to the underlying low rank tensor with high probability and the required number of sampling entries for convergence is derived. Numerical experiments demonstrate that the proposed method outperforms other methods in terms of computational time and number of sampling entries.

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS (2023)

Article Computer Science, Artificial Intelligence

Tucker network: Expressive power and comparison

Ye Liu, Junjun Pan, Michael K. Ng

Summary: This paper proposes a deep neural network called the Tucker network derived from the Tucker format and analyzes its expressive power. The results show that the Tucker network has exponentially higher expressive power than the shallow network. Additionally, the paper discusses the expressive power between the hierarchical Tucker tensor network (HT network) and the proposed Tucker network. Experimental results validate the theoretical findings and demonstrate the superior performance of the Tucker network and deep Tucker network compared to the shallow network and HT network on three datasets.

NEURAL NETWORKS (2023)

Article Computer Science, Information Systems

High Dimensional Statistical Estimation Under Uniformly Dithered One-Bit Quantization

Junren Chen, Cheng-Long Wang, Michael K. Ng, Di Wang

Summary: In this paper, a uniformly dithered 1-bit quantization scheme for high-dimensional statistical estimation is proposed. The scheme includes truncation, dithering, and quantization as typical steps. The scheme is applied to the estimation problems of sparse covariance matrix estimation, sparse linear regression, and matrix completion. New estimators based on 1-bit quantized data are proposed. The rates of the estimators achieve minimax rates up to logarithmic factors in the sub-Gaussian regime, and improve existing results in the heavy-tailed regime. The approach to 1-bit matrix completion is robust to pre-quantization noise with unknown distribution.

IEEE TRANSACTIONS ON INFORMATION THEORY (2023)

Article Computer Science, Information Systems

Uniform Exact Reconstruction of Sparse Signals and Low-Rank Matrices From Phase-Only Measurements

Junren Chen, Michael K. Ng

Summary: This paper focuses on the signal recovery problem in phase-only compressive sensing. It addresses two open questions regarding the uniform recovery guarantee and exact recovery of complex signal. The authors prove that all complex sparse signals or low-rank matrices can be uniformly, exactly recovered using a near optimal number of complex Gaussian measurement phases. They also propose methods for handling complex signals and demonstrate the stability of uniform recovery under bounded noise. Experimental results confirm the validity of the theoretical findings.

IEEE TRANSACTIONS ON INFORMATION THEORY (2023)

Article Computer Science, Artificial Intelligence

Tangent Space Based Alternating Projections for Nonnegative Low Rank Matrix Approximation

Guangjing Song, Michael K. Ng, Tai-Xiang Jiang

Summary: In this article, a new alternating projection method is developed to compute nonnegative low-rank matrix approximation for nonnegative matrices. The proposed method reduces computational cost by approximating the projection onto the manifold using the tangent space of the point in the manifold. Numerical examples demonstrate that the proposed method outperforms nonnegative matrix factorization methods in terms of computational time and accuracy.

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING (2023)

Article Mathematics, Applied

SIGNAL RECONSTRUCTION FROM PHASE-ONLY MEASUREMENTS: UNIQUENESS CONDITION, MINIMAL MEASUREMENT NUMBER AND BEYOND

Junren Chen, Michael K. Ng

Summary: This paper investigates the phase-only reconstruction problem, focusing on recovering a complex-valued signal x in Cd from the phase of Ax. Uniqueness conditions are derived using discriminant matrices, determining if the signal can be uniquely reconstructed. The minimum measurement number is also examined, with at least 2d but no more than 4d-2 measurements needed for reconstruction of all x∈Cd. Practical and general uniqueness conditions are provided for the phase-only reconstruction in Rd, and the results can be extended to affine phase-only reconstruction where the phase of Ax + b is observed for some b∈Cm.

SIAM JOURNAL ON APPLIED MATHEMATICS (2023)

Article Mathematics, Applied

COSEPARABLE NONNEGATIVE MATRIX FACTORIZATION

Junjun Pan, Michael K. Ng

Summary: This paper introduces the nonnegative matrix factorization model (NMF) and its extended form, coseparable NMF (CoS-NMF), and studies their mathematical properties and relationships with other matrix factorization methods. The paper also proposes an optimization method for CoS-NMF and verifies its effectiveness and superiority through experiments.

SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS (2023)

Article Computer Science, Artificial Intelligence

Eigenimage2Eigenimage (E2E): A Self-Supervised Deep Learning Network for Hyperspectral Image Denoising

Lina Zhuang, Michael K. Ng, Lianru Gao, Joseph Michalski, Zhicheng Wang

Summary: The performance of deep learning-based denoisers is highly dependent on the quantity and quality of the training data. However, in hyperspectral remote sensing areas, paired noisy-clean training images are generally unavailable. To overcome this, this work uses self-supervised learning to train a model that can learn one part of noisy input from another part. The proposed Eigenimage2Eigenimage (E2E) framework converts the HSI denoising problem into an eigenimage denoising problem and generates noisy-noisy paired training eigenimages. Experimental results demonstrate that the proposed method outperforms other existing deep learning methods for denoising HSIs. A MATLAB demo is provided for reproducibility.

IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS (2023)

Article Mathematics, Applied

FULLY-CONNECTED TENSOR NETWORK DECOMPOSITION FOR ROBUST TENSOR COMPLETION PROBLEM

Yun-Yang Liu, Xi-Le Zhao, Guang-Jing Song, Yu-Bang Zheng, Michael K. Ng, Ting-Zhu Huang

Summary: Motivated by the success of fully-connected tensor network (FCTN) decomposition, this study proposes two FCTN-based models for the robust tensor completion (RTC) problem. The first model, named RNC-FCTN, directly applies FCTN decomposition for the RTC problem. An algorithm based on proximal alternating minimization (PAM) is developed to solve RNC-FCTN. The second model, named RC-FCTN, uses the FCTN nuclear norm as a convex surrogate function and applies robust convex optimization for RTC. An algorithm based on alternating direction method of multipliers (ADMM) is developed for RC-FCTN.

INVERSE PROBLEMS AND IMAGING (2023)

Article Mathematics, Applied

Analysis of the ratio of l1 and l2 norms for signal recovery with partial support information

Huanmin Ge, Wengu Chen, Michael K. Ng

Summary: In this paper, we propose a novel model, the weighted l(1)/l(2) minimization, which incorporates partial support information into the standard l(1)/l(2) minimization to recover sparse signals from linear measurements. We establish the restricted isometry property based conditions for sparse signal recovery using the weighted l(1)/l(2) minimization in both noiseless and noisy cases. Our results show that these conditions are weaker than the analogous conditions for standard l(1)/l(2) minimization when the accuracy of the partial support information is at least 50%. Additionally, we develop effective algorithms and validate our results through extensive numerical experiments using synthetic data in both noiseless and noisy cases.

INFORMATION AND INFERENCE-A JOURNAL OF THE IMA (2023)

Article Computer Science, Artificial Intelligence

Hypergraph Collaborative Network on Vertices and Hyperedges

Hanrui Wu, Yuguang Yan, Michael Kwok-Po Ng

Summary: In this paper, a novel model called Hypergraph Collaborative Network (HCoN) is proposed, which considers the information from both previous vertices and hyperedges to achieve informative latent representations and introduces the hypergraph reconstruction error as a regularizer to learn an effective classifier. Experimental results demonstrate that the proposed method outperforms the baseline methods.

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE (2023)

暂无数据