This letter introduces a new model for backscatter assisted wireless powered communication networks (BAWPCNs) that include a hybrid access point (HAP) and multiple backscatter communication (BackCom) and traditional wireless powered communication network (WPCN) users. To make full use of time to transmit information, both backscatter and harvest-then-transmit (HTT) modes are employed. In the proposed model, during the first time slot dedicated for energy transfer in traditional WPCNs, the traditional WPCN users harvest energy radiated by the HAP, and simultaneously the BackCom users reflect modulated signals to the HAP. The traditional WPCN users are scheduled during the remaining time slots via time division multiple access (TMDA). The optimal time allocation policies for the half-duplex (HD) and full-duplex (FD) BAWPCNs are obtained to maximize the system throughput. The tradeoff between backscatter and HTT modes is analyzed. Simulation results demonstrate the superiority of the proposed model.

In this letter, we propose a novel method for change detection in multitemporal optical satellite images. Unlike the tradition methods, the proposed method is able to detect changed region even from unregistered images. In order to obtain the change detection map from the unregistered images, we first compute the sum of the color difference (SCD) of a pixel to all pixels in an input image. Then we calculate the SCD of this pixel to all pixels in the other input image. Finally, we use the difference of the two SCDs to represent the change detection map. Experiments on the multitemporal images demonstrates the good performance of the proposed method on the unregistered images.

Based on the reconstruction of the augmented interference-plus-noise (IPN) covariance matrix (CM) and the estimation of the desired signal's extended steering vector (SV), we propose a novel robust widely linear (WL) beamforming algorithm. Firstly, an extension of the iterative adaptive approach (IAA) algorithm is employed to acquire the spatial spectrum. Secondly, the IAA spatial spectrum is adopted to reconstruct the augmented signal-plus-noise (SPN) CM and the augmented IPNCM. Thirdly, the extended SV of the desired signal is estimated by using the iterative robust Capon beamformer with adaptive uncertainty level (AU-IRCB). Compared with several representative robust WL beamforming algorithms, simulation results are provided to confirm that the proposed method can achieve a better performance and has a much lower complexity.

This paper studies the problem of recovering an arbitrarily distributed sparse matrix from its one-bit (1-bit) compressive measurements. We propose a matrix sketching based binary method iterative hard thresholding (MSBIHT) algorithm by combining the two dimensional version of BIHT (2DBIHT) and the matrix sketching method, to solve the sparse matrix recovery problem in matrix form. In contrast to traditional one-dimensional BIHT (BIHT), the proposed algorithm can reduce computational complexity. Besides, the MSBIHT can also improve the recovery performance comparing to the 2DBIHT method. A brief theoretical analysis and numerical experiments show the proposed algorithm outperforms traditional ones.

Synthetic aperture radar (SAR) imagery is significantly deteriorated by the random phase noises which are generated by the frequency jitter of the transmit signal and atmospheric turbulence. In this paper, we recast the SAR imaging problem via the phase-corrupted data as for a special case of quadratic compressed sensing (QCS). Although the quadratic measurement model has potential to mitigate the effects of the phase noises, it also leads to a nonconvex and quartic optimization problem. In order to overcome these challenges and increase reconstruction robustness to the phase noises, we proposed a QCS-based SAR imaging algorithm by greedy local search to exploit the spatial sparsity of scatterers. Our proposed imaging algorithm can not only avoid the process of precise random phase noise estimation but also acquire a sparse representation of the SAR target with high accuracy from the phase-corrupted data. Experiments are conducted by the synthetic scene and the moving and stationary target recognition Sandia laboratories implementation of cylinders (MSTAR SLICY) target. Simulation results are provided to demonstrate the effectiveness and robustness of our proposed SAR imaging algorithm.

This paper proposes a novel matching pursuit generalized approximate message passing (MPGAMP) algorithm which explores the support of sparse representation coefficients step by step, and estimates the mean and variance of non-zero elements at each step based on a generalized-approximate-message-passing-like scheme. In contrast to the classic message passing based algorithms and matching pursuit based algorithms, our proposed algorithm saves a lot of intermediate process memory, and does not calculate the inverse matrix. Numerical experiments show that MPGAMP algorithm can recover a sparse signal from compressed sensing measurements very well, and maintain good performance even for non-zero mean projection matrix and strong correlated projection matrix.

This paper studies a wireless powered communication network (WPCN) with non-orthogonal multiple access (NOMA) under successive interference cancellation (SIC) constraints, where the users first harvest energy from the power station and then transmit data to the information receiver simultaneously. Under this setup, we investigate the system throughput maximization problem. We first formulate an optimization problem for a general case, which is non-convex. To derive the optimal solution, new variables are introduced to transform the initial problem into a convex optimization problem. For a special case, i.e., two-user case, the optimal solution is derived as a closed-form expression. Simulations on the effect of SIC constraints show the importance of the distinctness among users' channels for the proposed model.

Multiple image group cosegmentation (MGC) aims at segmenting common object from multiple group of images, which is a new cosegmentation research topic. The existing MGC methods formulate MGC as label assignment problem (Markov Random Field framework), which is observed to be sensitive to parameter setting. Meanwhile, it is also observed that large object variations and complicated backgrounds dramatically decrease the existing MGC performance. To this end, we propose a new object proposal based MGC model, with the aim of avoiding tedious parameter setting, and improving MGC performance. Our main idea is to formulate MGC as new region proposal selection task. A new energy function in term of proposal is proposed. Two aspects such as the foreground consistency within each single image group, and the group consistency among image groups are considered. The energy minimization method is designed in EM framework. Two steps such as the loop belief propagation and foreground propagation are iteratively implemented for the minimization. We verify our method on ICoseg dataset. Six existing cosegmentation methods are used for the comparison. The experimental results demonstrate that the proposed method can not only improve MGC performance in terms of larger IOU values, but is also robust to the parameter setting.

With the existing of coverage holes, the Quality of Service (such as event response, package delay, and the life time et al.) of a Wireless Sensor Network (WSN) may become weaker. In order to recover the holes, one can locate them by identifying the boundary nodes on their edges. Little effort has been made to distinguish the boundary nodes in a model where wireless sensors are randomly deployed on a three-dimensional surface. In this paper, we propose a distributed method which contains three steps in succession. It first projects the 1-hop neighborhood of a sensor to the plane. Then, it sorts the projected nodes according to their angles and finds out if there exists any ring formed by them. At last, the algorithm validates a circle to confirm that it is a ring surrounding the node. Our solution simulates the behavior of rotating a semicircle plate around a sensor under the guidance of its neighbors. Different from the existing results, our method transforms a three-dimensional problem into a two-dimensional one and maintaining its original topology, and it does not rely on any complex Hamiltonian Cycle finding to test the existence of a circle in the neighborhood of a sensor. Simulation results show our method outperforms others at the correctness and effectiveness in identifying the nodes on the edges of a three-dimensional WSN.

This letter considers a backscatter assisted wireless powered communication network (BAWPCN) with non-orthogonal multiple access (NOMA). This model consists of a hybrid access point (HAP) and multiple users which can work in either backscatter or harvest-then-transmit (HTT) protocol. To fully exploit time for information transmission, the users working in the backscatter protocol are scheduled to reflect modulated signals during the first phase of the HTT protocol which is dedicated for energy transfer. During the second phase, all users working in the HTT protocol transmit information to the HAP simultaneously since NOMA is adopted. Considering both short-term and long-term optimization problems to maximize the system throughput, the optimal resource allocation policies are obtained. Simulation results show that the proposed model can significantly improve the system performance.