arXiv subjects

Feng Jiang

Publications and source records attributed to Feng Jiang.

140 records · Page 8Linked to original sources

arXiv2014

Detection in Analog Sensor Networks with a Large Scale Antenna Fusion Center

We consider the distributed detection of a zero-mean Gaussian signal in an analog wireless sensor network with a fusion center (FC) configured with a large number of antennas. The transmission gains of the sensor nodes are optimized by minimizing the ratio of the log probability of detection (PD) and log probability of false alarm (PFA). We show that the problem is convex with respect to the squared norm of the transmission gains, and that a closed-form solution can be found using the Karush-Kuhn-Tucker conditions. Our results indicate that a constant PD can be maintained with decreasing sensor transmit gain provided that the number of antennas increases at the same rate. This is contrasted with the case of a single-antenna FC, where PD is monotonically decreasing with transmit gain. On the other hand, we show that when the transmit power is high, the single- and multi-antenna FC both asymptotically achieve the same PD upper bound.

cs.IT↗

arXiv2014

Structural Group Sparse Representation for Image Compressive Sensing Recovery

Compressive Sensing (CS) theory shows that a signal can be decoded from many fewer measurements than suggested by the Nyquist sampling theory, when the signal is sparse in some domain. Most of conventional CS recovery approaches, however, exploited a set of fixed bases (e.g. DCT, wavelet, contourlet and gradient domain) for the entirety of a signal, which are irrespective of the nonstationarity of natural signals and cannot achieve high enough degree of sparsity, thus resulting in poor rate-distortion performance. In this paper, we propose a new framework for image compressive sensing recovery via structural group sparse representation (SGSR) modeling, which enforces image sparsity and self-similarity simultaneously under a unified framework in an adaptive group domain, thus greatly confining the CS solution space. In addition, an efficient iterative shrinkage/thresholding algorithm based technique is developed to solve the above optimization problem. Experimental results demonstrate that the novel CS recovery strategy achieves significant performance improvements over the current state-of-the-art schemes and exhibits nice convergence.

cs.CV↗

arXiv2014

Spatially Directional Predictive Coding for Block-based Compressive Sensing of Natural Images

A novel coding strategy for block-based compressive sens-ing named spatially directional predictive coding (SDPC) is proposed, which efficiently utilizes the intrinsic spatial cor-relation of natural images. At the encoder, for each block of compressive sensing (CS) measurements, the optimal pre-diction is selected from a set of prediction candidates that are generated by four designed directional predictive modes. Then, the resulting residual is processed by scalar quantiza-tion (SQ). At the decoder, the same prediction is added onto the de-quantized residuals to produce the quantized CS measurements, which is exploited for CS reconstruction. Experimental results substantiate significant improvements achieved by SDPC-plus-SQ in rate distortion performance as compared with SQ alone and DPCM-plus-SQ.

cs.CV↗

arXiv2014

Optimal Power Allocation for Parameter Tracking in a Distributed Amplify-and-Forward Sensor Network

We consider the problem of optimal power allocation in a sensor network where the sensors observe a dynamic parameter in noise and coherently amplify and forward their observations to a fusion center (FC). The FC uses the observations in a Kalman filter to track the parameter, and we show how to find the optimal gain and phase of the sensor transmissions under both global and individual power constraints in order to minimize the mean squared error (MSE) of the parameter estimate. For the case of a global power constraint, a closed-form solution can be obtained. A numerical optimization is required for individual power constraints, but the problem can be relaxed to a semidefinite programming problem (SDP), and we show that the optimal result can be constructed from the SDP solution. We also study the dual problem of minimizing global and individual power consumption under a constraint on the MSE. As before, a closed-form solution can be found when minimizing total power, while the optimal solution is constructed from the output of an SDP when minimizing the maximum individual sensor power. For purposes of comparison, we derive an exact expression for the outage probability on the MSE for equal-power transmission, which can serve as an upper bound for the case of optimal power control. Finally, we present the results of several simulations to show that the use of optimal power control provides a significant reduction in either MSE or transmit power compared with a non-optimized approach (i.e., equal power transmission).

cs.IT↗

arXiv2013

Mining the Temporal Evolution of the Android Bug Reporting Community via Sliding Windows

The open source development community consists of both paid and volunteer developers as well as new and experienced users. Previous work has applied social network analysis (SNA) to open source communities and has demonstrated value in expertise discovery and triaging. One problem with applying SNA directly to the data of the entire project lifetime is that the impact of local activities will be drowned out. In this paper we provide a method for aggregating, analyzing, and visualizing local (small time periods) interactions of bug reporting participants by using the SNA to measure the betweeness centrality of these participants. In particular we mined the Android bug repository by producing social networks from overlapping 30-day windows of bug reports, each sliding over by day. In this paper we define three patterns of participant behaviour based on their local centrality. We propose a method of analyzing the centrality of bug report participants both locally and globally, then we conduct a thorough case study of the bug reporter's activity within the Android bug repository. Furthermore, we validate the conclusions of our method by mining the Android version control system and inspecting the Android release history. We found that windowed SNA analysis elicited local behaviour that were invisible during global analysis.

cs.SE↗

arXiv2013

Inelastic transport dynamics through attractive impurity in charge Kondo regime

Within the frame of quantum dissipation theory, we develop a new hierarchical equations of motion theory, combined with the small polaron transformation. We fully investigate the electron transport of a single attractive impurity system with the strong electron-phonon coupling in charge- Kondo regime. Numerical results demonstrate the following facts: (i) The density of states curve shows that the attraction mechanism results in not only the charge-Kondo resonance (i.e. elastic pair-transition resonance), but also the inelastic pair-transition resonances and inelastic cotunneling resonances. These signals are separated discernibly in asymmetric levels about Fermi level; (ii) The differential conductance spectrum shows the distinct peaks or wiggles and the abnormal split of pair-transition peaks under the asymmetric bias; (iii) The improvement of bath-temperature can enhance the phonon-emission (absorption)-assisted sequential tunneling and also strengthen the signals of inelastic pair-transition under the asymmetric bias; (iv) The inelastic dynamics driven by the ramp-up time-dependent voltage presents clear steps which can be tailored by the duration-time and bath-temperature; (v) The linear-response spectrum obtained from the linear-response theory in the Liouville space reveals the excitation signals of electrons' dynamical transition. Briefly, the physics caused by attraction mechanism stems from the double-occupancy or vacant-occupation of impurity system

cond-mat.mes-hall↗

arXiv2013

Estimation in Phase-Shift and Forward Wireless Sensor Networks

We consider a network of single-antenna sensors that observe an unknown deterministic parameter. Each sensor applies a phase shift to the observation and the sensors simultaneously transmit the result to a multi-antenna fusion center (FC). Based on its knowledge of the wireless channel to the sensors, the FC calculates values for the phase factors that minimize the variance of the parameter estimate, and feeds this information back to the sensors. The use of a phase-shift-only transmission scheme provides a simplified analog implementation at the sensor, and also leads to a simpler algorithm design and performance analysis. We propose two algorithms for this problem, a numerical solution based on a relaxed semidefinite programming problem, and a closed-form solution based on the analytic constant modulus algorithm. Both approaches are shown to provide performance close to the theoretical bound. We derive asymptotic performance analyses for cases involving large numbers of sensors or large numbers of FC antennas, and we also study the impact of phase errors at the sensor transmitters. Finally, we consider the sensor selection problem, in which only a subset of the sensors is chosen to send their observations to the FC.

cs.IT↗

arXiv2013

Time Dependent Quantum Transport Through Graphene Nanoribbons

Time-dependent quantum transport for graphene nanoribbons (GNR) are calculated by the hierarchical equation of motion (HEOM) method based on the nonequilibrium Green's function (NEGF) theory (Xie et.al, J. Chem. Phys. 137, 044113, 2012). In this paper, a new steady state calculation technique is introduced and accelerated by the contour integration, which is suitable for large systems. Three Lorentzian fitting schemes for the self-energy matrices are developed based on the nonlinear least square method. Within these schemes, the number of Lorentzians is effectively reduced and the fitting results are good and convergent. With these two developments in HEOM, we have calculated the transient currents in GNR. We find a new type of edge state with delta-function-like density of states in many semi-infinite armchair-type GNR.

cond-mat.mes-hall↗

arXiv2013

Parameter Tracking via Optimal Distributed Beamforming in an Analog Sensor Network

We consider the problem of optimal distributed beamforming in a sensor network where the sensors observe a dynamic parameter in noise and coherently amplify and forward their observations to a fusion center (FC). The FC uses a Kalman filter to track the parameter using the observations from the sensors, and we show how to find the optimal gain and phase of the sensor transmissions under both global and individual power constraints in order to minimize the mean squared error (MSE) of the parameter estimate. For the case of a global power constraint, a closed-form solution can be obtained. A numerical optimization is required for individual power constraints, but the problem can be relaxed to a semidefinite programming problem (SDP), and we show how the optimal solution can be constructed from the solution to the SDP. Simulation results show that compared with equal power transmission, the use of optimized power control can significantly reduce the MSE.

cs.IT↗

arXiv2013

Linearly Reconfigurable Kalman Filtering for a Vector Process

In this paper, we consider a dynamic linear system in state-space form where the observation equation depends linearly on a set of parameters. We address the problem of how to dynamically calculate these parameters in order to minimize the mean-squared error (MSE) of the state estimate achieved by a Kalman filter. We formulate and solve two kinds of problems under a quadratic constraint on the observation parameters: minimizing the sum MSE (Min-Sum-MSE) or minimizing the maximum MSE (Min-Max-MSE). In each case, the optimization problem is divided into two sub-problems for which optimal solutions can be found: a semidefinite programming (SDP) problem followed by a constrained least-squares minimization. A more direct solution is shown to exist for the special case of a scalar observation; in particular, the Min-Sum-MSE solution can be found directly using a generalized eigendecomposition, and is optimally solved utilizing Rayleigh quotient, and the Min-Max-MSE problem reduces to an SDP feasibility test that can be solved via the bisection method.

cs.IT↗

arXiv2012

High Quality Image Interpolation via Local Autoregressive and Nonlocal 3-D Sparse Regularization

In this paper, we propose a novel image interpolation algorithm, which is formulated via combining both the local autoregressive (AR) model and the nonlocal adaptive 3-D sparse model as regularized constraints under the regularization framework. Estimating the high-resolution image by the local AR regularization is different from these conventional AR models, which weighted calculates the interpolation coefficients without considering the rough structural similarity between the low-resolution (LR) and high-resolution (HR) images. Then the nonlocal adaptive 3-D sparse model is formulated to regularize the interpolated HR image, which provides a way to modify these pixels with the problem of numerical stability caused by AR model. In addition, a new Split-Bregman based iterative algorithm is developed to solve the above optimization problem iteratively. Experiment results demonstrate that the proposed algorithm achieves significant performance improvements over the traditional algorithms in terms of both objective quality and visual perception

cs.MM↗

arXiv2012

Optimization of UAV Heading for the Ground-to-Air Uplink

In this paper we consider a collection of single-antenna ground nodes communicating with a multi-antenna unmanned aerial vehicle (UAV) over a multiple-access ground-to-air wireless communications link. The UAV uses beamforming to mitigate the inter-user interference and achieve spatial division multiple access (SDMA). First, we consider a simple scenario with two static ground nodes and analytically investigate the effect of the UAV heading on the system sum rate. We then study a more general setting with multiple mobile ground-based terminals, and develop an algorithm for dynamically adjusting the UAV heading in order to maximize a lower bound on the ergodic sum rate of the uplink channel, using a Kalman filter to track the positions of the mobile ground nodes. Fairness among the users can be guaranteed through weighting the bound for each user's ergodic rate with a factor inversely proportional to their average data rate. For the common scenario where a high $K$-factor channel exists between the ground nodes and UAV, we use an asymptotic analysis to find simplified versions of the algorithm for low and high SNR. We present simulation results that demonstrate the benefits of adapting the UAV heading in order to optimize the uplink communications performance. The simulation results also show that the simplified algorithms perform near-optimal performance.

cs.IT↗

arXiv2012

Interference-Aware Scheduling for Connectivity in MIMO Ad Hoc Multicast Networks

We consider a multicast scenario involving an ad hoc network of co-channel MIMO nodes in which a source node attempts to share a streaming message with all nodes in the network via some pre-defined multi-hop routing tree. The message is assumed to be broken down into packets, and the transmission is conducted over multiple frames. Each frame is divided into time slots, and each link in the routing tree is assigned one time slot in which to transmit its current packet. We present an algorithm for determining the number of time slots and the scheduling of the links in these time slots in order to optimize the connectivity of the network, which we define to be the probability that all links can achieve the required throughput. In addition to time multiplexing, the MIMO nodes also employ beamforming to manage interference when links are simultaneously active, and the beamformers are designed with the maximum connectivity metric in mind. The effects of outdated channel state information (CSI) are taken into account in both the scheduling and the beamforming designs. We also derive bounds on the network connectivity and sum transmit power in order to illustrate the impact of interference on network performance. Our simulation results demonstrate that the choice of the number of time slots is critical in optimizing network performance, and illustrate the significant advantage provided by multiple antennas in improving network connectivity.

cs.IT↗

arXiv2012

Phase-Only Analog Encoding for a Multi-Antenna Fusion Center

We consider a distributed sensor network in which the single antenna sensor nodes observe a deterministic unknown parameter and after encoding the observed signal with a phase parameter, the sensor nodes transmit it simultaneously to a multi-antenna fusion center (FC). The FC optimizes the phase encoding parameter and feeds it back to the sensor nodes such that the variance of estimation error can be minimized. We relax the phase optimization problem to a semidefinite programming problem and the numerical results show that the performance of the proposed method is close to the theoretical bound. Also, asymptotic results show that when the number of sensors is very large and the variance of the distance between the sensor nodes and FC is small, multiple antennas do not provide a benefit compared with a single antenna system; when the number of antennas $M$ is large and the measurement noise at the sensor nodes is small compared with the additive noise at the FC, the estimation error variance can be reduced by a factor of $M$.

cs.IT↗