Inferring network topologies from observed graph-structured data (also known as graph signals) is a crucial task in many applications of network science. Existing papers on network topology inference typically assume that the observations at all nodes are available. However, there are many situations where only partial observations can be collected due to application-specific constraints. To handle

This paper investigates the particle filtering problem for a class of nonlinear/non-Gaussian systems under the dynamic event-triggered protocol. In order to avert frequent data transmission and reduce the communication overhead, a dynamic event-triggered transmission mechanism is adopted to decide whether the data should be transmitted or not. We first consider a scenario where all sensor nodes selectively

We propose an entirely redesigned framework of bandlimited signal reconstruction for the time encoding machine (TEM) introduced by Lazar and Tóth. As the encoding part of TEM consists in obtaining integral values of a bandlimited input over known time intervals, it theoretically amounts to applying a known linear operator on the input. We then approach the general question of signal reconstruction

State estimation is a fundamental task in many engineering fields, and therefore robust nonlinear filtering techniques able to cope with misspecified, uncertain and/or corrupted models must be designed for real-life applicability. In this contribution we explore nonlinear Gaussian filtering problems where measurements may be corrupted by outliers, and propose a new robust variational-based filtering

In this paper, we present a class of cascaded nonlinear models for complex-valued system identification, aimed at baseband modeling of nonlinear radio systems. The proposed models consist of serially connected elementary linear and nonlinear blocks, with the nonlinear blocks implemented as uniform spline-interpolated look-up tables (LUT) and the linear blocks as FIR filters. Wiener, Hammerstein, and

It is well-known that time-varying channels can provide time diversity and improve error rate performance compared to time-invariant fading channels. However, exploiting time diversity requires very accurate channel estimates at the receiver. In order to reduce the number of unknown channel coefficients while estimating the time-varying channel, basis expansion models can be used along with long transmission

Mobile-edge computing (MEC) offloads computational tasks from wireless devices to network edge, and enables real-time information transmission and computing. Most existing work concerns a small-scale synchronous MEC system. In this paper, we focus on a large-scale asynchronous MEC system with random task arrivals, distinct workloads, and diverse deadlines. We formulate the offloading policy design

Deep learning techniques have become increasingly popular for classifying large-scale image and video data. Remote sensing applications require robust search engines to retrieve similar information dependent on an example-based query instead of a tag-based query. Deep features can be extracted automatically by training raw data without having any domain-specific knowledge. However, the training time

This is a list of reviewers who served the Journal of Applied Remote Sensing in 2020.

We address the covariance matrix estimation problem for radar adaptive detection in a non-Gaussian clutter environment. We first propose an estimation method based on α log-determinant divergence, which estimates the true covariance accurately by solving the geometric mean of the sample covariance matrix (SCM). Since the estimation performance would be seriously degraded when the number of secondary

Known for their capacity-achieving abilities and low complexity for both encoding and decoding, polar codes have been selected as the control channel coding scheme for 5G communications. To satisfy the needs of high throughput and low latency, belief propagation (BP) is chosen as the decoding algorithm. However, it suffers from worse error performance than that of cyclic redundancy check (CRC)-aided

Sparse unmixing (SU) can represent an observed image using pure spectral signatures and corresponding fractional abundance from a large spectral library and is an important technique in hyperspectral unmixing. However, the existing SU algorithms mainly exploit spatial information from a fixed neighborhood system, which is not sufficient. To solve this problem, we propose a nonlocal weighted SU algorithm

The imaging parameters of high-squint synthetic aperture radar (SAR) mounted on maneuvering platforms have obvious spatial variability, which cannot be effectively solved by traditional SAR imaging algorithms and limits the focus depth. To extend the focus depth of maneuvering SAR, an imaging method is proposed based on perturbation keystone transform (KT) and subregion phase filtering (SRPF). In the

Vegetated roofs provide many ecosystem services and support urban biodiversity. While it would be interesting to study the contribution of vegetated roofs to ecological corridors, vegetated roofs are listed in no French databases. Because of their intrinsic nature as roofs, their small number, their small size, and the type of vegetation planted on them, vegetated roofs seem to be very difficult to

Space-based light detection and ranging (LiDAR) sensors have provided valuable insight into the global, vertical distribution of aerosol and cloud layers in Earth’s atmosphere, and, more recently, of the distribution of phytoplankton in the ocean. However, the photodetectors in these sensors lack the performance necessary to capture the vertical structure of cloud tops and ocean phytoplankton to a

This paper considers an Internet-of-Things (IoT) scenario in which devices sporadically transmit short packets with few pilot symbols over a fading channel. Devices are characterized by unique transmission non-idealities, such as I/Q imbalance. The number of pilots is generally insufficient to obtain an accurate estimate of the end-to-end channel, which includes the effects of fading and of the transmission-side

Standard Principal-Component Analysis (PCA) is known to be sensitive to outliers among the processed data. On the other hand, L1-norm-based PCA (L1-PCA) exhibits sturdy resistance against outliers, while it performs similar to standard PCA when applied to nominal or smoothly corrupted data [1] . Exact calculation of the $K$ L1-norm Principal Components (L1-PCs) of a rank- $r$ data matrix $\mathbf X

A highly popular regularized (shrinkage) covariance matrix estimator is the shrinkage sample covariance matrix (SCM) which shares the same set of eigenvectors as the SCM but shrinks its eigenvalues toward the grand mean of the eigenvalues of the SCM. In this paper, a more general approach is considered in which the SCM is replaced by an M-estimator of scatter matrix and a fully automatic data adaptive

In principle, the Automatic Identification System (AIS) makes covert rendezvous at sea, such as smuggling and piracy, impossible; in practice, AIS can be spoofed or simply disabled. Previous work showed a means whereby such deviations can be spotted. Here we play the opponent's side, and describe the least-detectable trajectory that the elusive vessel can take. The opponent's route planning problem

Decentralized multi-agent optimization usually relies on information exchange between neighboring agents, which can incur unaffordable communication overhead in practice. To reduce the communication cost, we apply event-triggering technique to the decentralized multi-agent online convex optimization problem, where each agent is associated with a time-varying local loss function and the goal is to minimize

Hedgerows are one of the few remaining natural landscape features within European agricultural areas. To facilitate hedgerow monitoring, cost-effective and accurate mapping of hedgerows across large spatial scales is required. Current methods used for automatic hedgerow detection are overly complicated and generalize poorly to larger areas. We examine the application of transfer learning using two

Causality graphs are routinely estimated in social sciences, natural sciences, and engineering due to their capacity to efficiently represent the spatiotemporal structure of multi-variate data sets in a format amenable for human interpretation, forecasting, and anomaly detection. A popular approach to mathematically formalize causality is based on vector autoregressive (VAR) models and constitutes

Most existing multispectral fusion algorithms often suffer from spectral or spatial information distortion. Driven by this motivation, we propose an edge-guided multispectral (MS) image fusion algorithm. In particular, it combines the advantages of generative adversarial networks and improved fusion frameworks, so the merged image can better preserve the spectral information of the original multispectral

Due to lacking use of prior information, the anomaly detection results are not always satisfactory. However, with the establishment of the spectral library, it becomes possible to obtain one or more spectra of the background in the image to be detected. If we can make use of such background information that is always ignored or discarded, the detection result is very likely to be improved. Hence, we

Medium Resolution Spectral Imager II (MERSI-2) is a payload of the China meteorological satellite FY-3D. The sensor bands 24 (10.3 to 11.3 μm) and 25 (11.5 to 12.5 μm) images, which are most suitable for land surface temperature (LST) retrieval, have higher spatial resolution than that of similar sensors. However, bands 24/25 images with spatial resolution of 250 m (hereafter bands 24/25 250-m images)

In this paper, using the shrinkage-based approach for portfolio weights and modern results from random matrix theory we construct an effective procedure for testing the efficiency of the expected utility (EU) portfolio and discuss the asymptotic behavior of the proposed test statistic under the high-dimensional asymptotic regime, namely when the number of assets $p$ increases at the same rate as the

In this paper, the particle filtering problem is investigated for a class of nonlinear/non-Gaussian systems with energy harvesting sensors subject to randomly occurring sensor saturations (ROSSs). The random occurrences of the sensor saturations are characterized by a series of Bernoulli distributed stochastic variables with known probability distributions. The energy harvesting sensor transmits its

Adopting low-resolution analog-to-digital converters (ADCs) for receive antennas of a multiple-input multiple-output (MIMO) system can remarkably reduce the hardware cost, circuit power consumption as well as amount of data to be transferred from RF components and the baseband-processing unit. However, an obvious performance loss is also expected. Towards this end, in this work we introduce a new architecture

Finite rate of innovation (FRI) is a powerful reconstruction framework enabling the recovery of sparse Dirac streams from uniform low-pass filtered samples. An extension of this framework, called generalised FRI (genFRI), has been recently proposed for handling cases with arbitrary linear measurement models. In this context, signal reconstruction amounts to solving a joint constrained optimisation

Distributed signal processing has attracted widespread attention in the scientific community due to its several advantages over centralized approaches. Recently, graph signal processing has risen to prominence, and adaptive distributed solutions have also been proposed in the area. Both in the classical framework and in graph signal processing, sampling and censoring techniques have been topics of

In a number of data-driven applications such as detection of arrhythmia, interferometry or audio compression, observations are acquired indistinctly in the time or frequency domains: temporal observations allow us to study the spectral content of signals (e.g., audio), while frequency-domain observations are used to reconstruct temporal/spatial data (e.g., MRI). Classical approaches for spectral analysis

Cost-optimization through the minimization of hardware and processing costs with minimal loss in performance is an interesting design paradigm in evolving and emerging Multiple-Input-Multiple-Output (MIMO) radar systems. This optimization is a challenging task due to the increasing Radio Frequency (RF) hardware complexity as well as the signal design algorithm complexity in applications requiring high

In this paper we study from an algorithmic perspective the problem of finding the peak value of a bandlimited signal. This problem plays an important role in the design and optimization of communication systems. We show that the peak value problem, i.e., computing the peak value of a bandlimited signal from its samples, can be solved algorithmically if oversampling is used. Without oversampling this

A distributed approach is proposed to the problem of signal-to-interference-plus-noise-ratio (SINR)-guaranteed power minimization (SGPM) for multicell multiuser (MCMU) multiple-input multiple-output (MIMO) systems. Unlike prior SGPM approaches, the proposed technique is based on solving necessary and sufficient optimality conditions, which are derived by decomposing the original problem into forward

The ideal time-frequency (TF) representation which distributes the total energy along the instantaneous frequency (IF) of a signal is essentially sparse. Motivated by the weighted sparse representation of the signal, we propose the ridge-aware weighted sparse TF representation (RWSTF) which involves some properties an ideal TF representation should satisfy, such as, highly concentrated TF representation

A number of inference problems with sensor networks involve projecting a measured signal onto a given subspace. In existing decentralized approaches, sensors communicate with their local neighbors to obtain a sequence of iterates that asymptotically converges to the desired projection. In contrast, the present paper develops methods that produce these projections in a finite and approximately minimal

This paper investigates superresolution in deconvolution driven by sparsity priors. The observed signal is a convolution of an original signal with a continuous kernel. With the prior knowledge that the original signal can be considered as a sparse combination of Dirac delta peaks, we seek to estimate the positions and amplitudes of these peaks by solving a finite dimensional convex problem on a computational

In this paper, the paradigm of expectation propagation (EP) algorithm in large-scale MIMO detection is extended by the sampling decoding in an Markov chain Monte Carlo way to boost the approximation of the target posterior distribution. The proposed EP-based sampling decoding scheme not only theoretically addresses the inherent convergence problem of EP, but also is able to achieve the near-optimal

Object detection in synthetic aperture radar (SAR) images remains a challenging problem due to the particular imaging mechanism of SAR systems. The sizes of targets are relatively small and the scenes are large, indicating that the intersection over union value between the targets and anchors is probably small. In addition, SAR images are severely polluted by speckles under normal conditions. The edges

Microwave staring correlated imaging (MSCI) is a staring high-resolution microwave imaging technique, employing the temporal–spatial stochastic radiation field (TSSRF). The imaging capability of MSCI depends on the spatial correlation of the TSSRF, which is equivalent to the incoherence of the sensing matrix in discrete form. A waveform design method for MSCI using multifrequency signals to reduce

The characteristics of ecosystem functions are of great significance for biodiversity conservation and ecosystem services. Ecosystem functional types (EFTs) are land surface areas similar in carbon dynamics that are not defined by the structure and composition of vegetation and represent the spatial heterogeneity of ecosystem functions. However, identification of EFTs based on low-resolution remote

Presents the front cover for this issue of the publication.

Presents a listing of the editorial board, board of governors, current staff, committee members, and/or society editors for this issue of the publication.

Presents the table of contents for this issue of the publication.

Prospective authors are requested to submit new, unpublished manuscripts for inclusion in the upcoming event described in this call for papers.

These instructions give guidelines for preparing papers for this publication. Presents information for authors publishing in this journal.

Presents a listing of institutions relevant for this issue of the publication.

Phase extraction in differential synthetic aperture radar (SAR) interferometry (DInSAR) is an important tool used for detecting subcentimeter-level change in ground deformation. The evaluated phase map processing is conducted via two important and successive steps: phase denoising and phase unwrapping. We attack the first step and propose the performance of discrete Riesz wavelets transform to reduce

Massive machine type communications (mMTC) is one of the three major scenarios of the fifth generation (5G) communication system, and raises new challenges for the development of new radio access technology. Unlike human type communications (HTC), mMTC is typically characterised by a massive number of devices, small-sized packets, low or no mobility, low energy consumption and sporadic transmission

Bearings-only target motion analysis with fusion of heterogeneous passive sensors with and without propagation delay attempts to estimate a target trajectory by fusing bearings from two sensors: a sensor whose measurements have negligible propagation delay and a sensor with measurements that have non-negligible propagation delay. This problem is highly nonlinear and challenging, particularly due to

Training a one-node neural network with the ReLU activation function via optimization, which we refer to as the ON-ReLU problem, is a fundamental problem in machine learning. In this paper, we begin by proving the NP-hardness of the ON-ReLU problem. We then present an approximation algorithm to solve the ON-ReLU problem, whose running time is $\mathcal {O}(n^k)$ where $n$ is the number of samples,

Visible-near infrared (VIS-NIR) spectral data are widely used for remotely estimating a number of crop health metrics. In general, these indices and models do not explicitly account for leaf surface characteristics, which themselves can be indicators of plant status or environmental responses. To explicitly include leaf surface characteristics, data are required linking optical properties to surface

The Fly’s Eye GLM Simulator (FEGS) is a multi-spectral array of radiometers designed to provide a validation dataset for the geostationary lightning mapper (GLM). The main component of FEGS is a 5 × 5 grid of radiometers, each with a square 18 deg field of view, that are sensitive to a 10-nm wide spectral band centered on 780 nm to observe a neutral atomic oxygen emission triplet at 777.4 nm. FEGS

In this work, we consider the modeling of signals that are almost, but not quite, harmonic, i.e., composed of sinusoids whose frequencies are close to being integer multiples of a common frequency. Typically, in applications, such signals are treated as perfectly harmonic, allowing for the estimation of their fundamental frequency, despite the signals not actually being periodic. Herein, we provide

Information sanitization to suppress sensitive information expressed through diverse sensor measurements is investigated in this work. Specifically, this work aims to integrate privacy preservation into the data compression phase of the sensing system streamline. The problem is posed as finding an optimal mapping from a collection of underlying raw distributions that reveal sensitive information for

Minimum achievable complexity (MAC) for a maximum likelihood (ML) performance-achieving detection algorithm is derived. Using the derived MAC, we prove that the conventional sphere decoding (SD) algorithms suffer from an inherent weakness at low SNRs. To find a solution for the low SNR deficiency, we analyze the effect of zero-forcing (ZF) and minimum mean square error (MMSE) linearly detected symbols

This article addresses the joint estimation of range, velocity and azimuth for multiple fast-moving targets using (ultra-)wideband (UWB) frequency-modulated continuous-wave (FMCW) radar with a phased array in the presence of Doppler ambiguities. The range migration of moving targets is described with the coupling of the fast-time and slow-time (chirp index), leading to the smearing of the target Doppler

This paper investigatesthe issue of cooperative activity detection for grant-free random access in the sixth-generation (6G) cell-free wireless networks with sourced and unsourced paradigms. First, we propose a cooperative framework for solving the problem of device activity detection in sourced random access. In particular, multiple access points (APs) cooperatively detect the device activity via

Sparse signal recovery or compressed sensing can be formulated as certain sparse optimization problems. The classic optimization theory indicates that the Newton-like method often has a numerical advantage over the classic gradient method for nonlinear optimization problems. In this paper, we propose the so-called Newton-step-based iterative hard thresholding (NSIHT) and the Newton-step-based hard

In this paper, the unlabeled target localization problem in a wireless sensor network is addressed. Sensors of the network are deployed in a two-dimensional surveyed area and measure their distance to a target. A central unit processes the data delivered by the sensors and is tasked to infer the position of a target, but it must do so without knowing the association between the received data and the