Aiming at traditional neural networks non-uniformity correction (NUC) algorithm's disadvantages such as slow convergence, low correction precision and difficulty to meet the real-time engineering application requirements of infrared imaging system, an improved NUC algorithm for infrared focal plane arrays (IRFPA) based on neural network is proposed. The algorithm is based on linear response of detector, and in order to realize fast and synchronization convergence of correction parameters the each original image data is normalized to a value close to one. Experimental results show the method has the faster convergence speed and better vision effect than the traditional algorithms, and it is better applied in practical projects.

Existing pose estimation algorithms suffer from either low performance or heavy computation cost. In this letter, we present an approach to improve the attractive algorithm called Orthogonal Iteration. A new form of fundamental equations is derived which reduces the computation cost significantly. And paraperspective camera model is used instead of weak perspective camera model during initialization which improves the stability. Experiment results validate the accuracy and stability of the proposed algorithm and show that its computational complexity is favorably compare to the O(n) non-iterative algorithm.

Building detection from high resolution remote sensing images is challenging due to the high intraclass variability and the difficulty in describing buildings. To address the above difficulties, a novel approach is proposed based on the combination of shape-specific feature extraction and discriminative feature classification. Shape-specific feature can capture complex shapes and structures of buildings. Discriminative feature classification is effective in reflecting similarities among buildings and differences between buildings and backgrounds. Experiments demonstrate the effectiveness of the proposed approach.

Kennedy has proposed the bare bones particle swarm (BBPS) by the elimination of the velocity formula and its replacement by the Gaussian sampling strategy without parameter tuning. However, a delicate balance between exploitation and exploration is the key to the success of an optimizer. This paper firstly analyzes the sampling distribution in BBPS, based on which we propose an adaptive BBPS inspired by the cloud model (ACM-BBPS). The cloud model adaptively produces a different standard deviation of the Gaussian sampling for each particle according to the evolutionary state in the swarm, which provides an adaptive balance between exploitation and exploration on different objective functions. Meanwhile, the diversity of the swarms is further enhanced by the randomness of the cloud model itself. Experimental results show that the proposed ACM-BBPS achieves faster convergence speed and more accurate solutions than five other contenders on twenty-five unimodal, basic multimodal, extended multimodal and hybrid composition benchmark functions. The diversity enhancement by the randomness in the cloud model itself is also illustrated.

Combining the sphere decoding (SD) algorithm and the sequential detection method, we propose an adaptive group detection (AGD) scheme based on the sort-descending QRD (S-D-QRD) for V-BLAST architectures over an i.i.d. Rayleigh flat fading channel. Simulation results show that the proposed scheme, which encompasses the SD algorithm and the sequential detection method as two extreme cases in a probability sense, can achieve a very flexible tradeoff between the detection performance and computational complexity by adjusting the group parameter.

We propose a feasible V-BLAST detector based on modified Householder QRD (M-H-QRD) over spatially correlated fading channel, which can almost match the performance of the V-BLAST algorithm with much lower complexity and better numerical stability. Compared to the sorted QRD (S-QRD) detector, the proposed detector requires a smaller minimum word-length to reach the same value of error floor for fixed-point (FP) numerical precision despite no significant performance difference for floating-point machine precision. All these advantages make it attractive when implemented using FP arithmetic.

A nonlinear piecewise scheme for non-uniformity correction in infrared focal plane arrays (IRFPA) is presented. In this method, utilizing the nonlinear piecewise scheme of detector response has extended the larger dynamic range of IRFPA response and the higher correcting accuracy than the non-uniformity correction algorithms based on linear response model of IRFPA detector. Based on the principle of this method, the mathematical model is established. At last experimental results are given out. The results show that it has higher correction precision, fewer calculations, and is easier to implement real-time non-uniformity correction of IRFPA by hardware circuit.

A fast algorithm to speed up the search process of vector quantization encoding is presented. Using the sum and the partial norms of a vector, some eliminating inequalities are constructeded. First the inequality based on the sum is used for determining the bounds of searching candidate codeword. Then, using an inequality based on subvector norm and another inequality combining the partial distance with subvector norm, more unnecessary codewords are eliminated without the full distance calculation. The proposed algorithm can reject a lot of codewords, while introducing no extra distortion compared to the conventional full search algorithm. Experimental results show that the proposed algorithm outperforms the existing state-of-the-art search algorithms in reducing the computational complexity and the number of distortion calculation.

A simple and successful design of initial codebook of vector quantization (VQ) is presented. For existing initial codebook algorithms, such as random method, the initial codebook is strongly influenced by selection of initial codewords and difficult to match with the features of the training vectors. In the proposed method, training vectors are sorted according to the norm of training vectors. Then, the ordered vectors are partitioned into N groups where N is the size of codebook. The initial codewords are obtained from calculating the centroid of each group. This initializtion method has a robust performance and can be combined with the VQ algorithm to further improve the quality of codebook.

This letter investigates transmit optimization in multi-user multi-input multi-output (MIMO) wiretap channels. In particular, we address the transmit covariance optimization for an artificial-noise (AN)-aided secrecy rate maximization (SRM) when subject to individual harvested energy and average transmit power. Owing to the inefficiency of the conventional interior-point solvers in handling our formulated SRM problem, a custom-designed algorithm based on penalty function (PF) and projected gradient (PG) is proposed, which results in semi-closed form solutions. The proposed algorithm achieves about two orders of magnitude reduction of running time with nearly the same performance comparing to the existing interior-point solvers. In addition, the proposed algorithm can be extended to other power-limited transmit design problems. Simulation results demonstrate the excellent performance and high efficiency of the algorithm.

A fast parameter estimation method with a coarse estimation and a fine estimation for polyphase P coded signals is proposed. For a received signal with N sampling points, the proposed method has an improved performance when the signal-to-noise ratio (SNR) is larger than 2dB and a lower computational complexity O(N logs N) compared with the latest time-frequency rate estimation method whose computational complexity is O(N2).

In the scenario of finite sample size, the performance of the generalized sidelobe canceller (GSC) is still affected by the desired signal even if all signal sources are independent with each other. Firstly, the novel expression of weight vector of the auxiliary array is derived under the circumstances of finite sample size. Utilizing this new weight vector and considering the correlative interferences, the general expression for the interference cancellation ratio (CR) is developed. Then, the impacts of the CR performance are further analyzed for the parameters including the input signal-to-noise ratio (SNR), the auxiliary array size, the correlation coefficient between the desired signal and interference as well as the snapshots of the sample data, respectively. Some guidelines can thus be given for the practical application. Numerical simulations demonstrate the agreement between the simulation results and the analytical results.

This letter proposes a track before detect scheme embedded in coherent repeated interference with the aid of frequency diversity array. The unmatched properties between echo and interferences are firstly discussed from both signal processing and data processing standpoints. Afterward, the interference suppression algorithm with virtual channel weighting at continue sampling stage is proposed, followed with kinematics constraint correspondingly. Further, the evaluations of the interference suppression performance are carried out through simulations which illustrate the feasibility and validity of the proposed algorithm.

To improve detection performance for a reconnaissance receiver, which is designed to detect the non-cooperative MIMO-LFM radar signal under low SNR condition, this letter proposed a novel signal detection method. This method is based on Fractional Fourier Transform with entropy weight (FRFTE) and autocorrelation algorithm. In addition, the flow chart and feasibility of the proposed algorithm are analyzed. Finally, applying our method to Wigner Hough Transform (WHT), we demonstrate the superiority of this method by simulation results.

In this paper, a novel eight-way Ka-band spatial power combining structure based on SIW/HMSIW is presented and studied. The power-combining structure is realized by transitions between HMSIW and parallel multiport planar microstrip lines. The power combiner is designed and fabricated in 33.5-35 GHz. The measured results show a good agreement with simulation and a combining efficiency of 72% is achieved at 34.3 GHz.

An unsupervised adaptive signal processing method of principal components analysis (PCA) neural networks (NN) based on signal eigen-analysis is proposed to permit the eigenstructure analysis of lower signal to noise ratios (SNR) direct sequence spread spectrum (DS) signals. The objective of eigenstructure analysis is to estimate the pseudo noise (PN) of DS signals blindly. The received signal is firstly sampled and divided into non-overlapping signal vectors according to a temporal window, which duration is two periods of PN sequence. Then an autocorrelation matrix is computed and accumulated by these signal vectors one by one. Lastly, the PN sequence can be estimated by the principal eigenvector of autocorrelation matrix. Since the duration of temporal window is two periods of PN sequence, the PN sequence can be reconstructed by the first principal eigenvector only. Additionally, the eigen-analysis method becomes inefficient when the estimated PN sequence is long. We can use an unsupervised adaptive method of PCA NN to realize the PN sequence estimation from lower SNR input DS-SS signals effectively.

Estimation of the gradient of the logarithm of a probability density function is a versatile tool in statistical data analysis. A recent method for model-seeking clustering called the least-squares log-density gradient clustering (LSLDGC) [Sasaki et al., 2014] employs a sophisticated gradient estimator, which directly estimates the log-density gradients without going through density estimation. However, the typical implementation of LSLDGC is based on a spherical Gaussian function, which may not work well when the probability density function for data has highly correlated local structures. To cope with this problem, we propose a new gradient estimator for log-density gradients with Gaussian mixture models (GMMs). Covariance matrices in GMMs enable the new estimator to capture the highly correlated structures. Through the application of the new gradient estimator to mode-seeking clustering and hierarchical clustering, we experimentally demonstrate the usefulness of our clustering methods over existing methods.

This paper describes a fast and effective algorithm for refining the parameter estimates of multicomponent third-order polynomial phase signals (PPSs). The efficiency of the proposed algorithm is accompanied by lower signal-to-noise ratio (SNR) threshold, and computational complexity. A two-step procedure is used to estimate the parameters of multicomponent third-order PPSs. In the first step, an initial estimate for the phase parameters can be obtained by using fast Fourier transformation (FFT), k-means algorithm and three time positions. In the second step, these initial estimates are refined by a simple moving average filter and singular value decomposition (SVD). The SNR threshold of the proposed algorithm is lower than those of the non-linear least square (NLS) method and the estimation refinement method even though it uses a simple moving average filter. In addition, the proposed method is characterized by significantly lower complexity than computationally intensive NLS methods. Simulations confirm the effectiveness of the proposed method.

Rapid development of modern communications has initiated essential requirements for providing efficient algorithms that can solve the routing and wavelength assignment (RWA) problem in satellite optical networks. In this paper, the bee colony algorithm optimization based on link cost for RWA (BCO-LCRWA) is tailored for satellite networks composed of intersatellite laser links. In BCO-LCRWA, a cost model of intersatellite laser links is established based on metrics of network transmission performance namely delay and wavelengths utilization, with constraints of Doppler wavelength drift, transmission delay, wavelength consistency and continuity. Specifically, the fitness function of bee colony exploited in the proposed algorithm takes wavelength resources utilization and communication hops into account to implement effective utilization of wavelengths, to avoid unnecessary over-detouring and ensure bit error rate (BER) performance of the system. The simulation results corroborate the improved performance of the proposed algorithm compared with the existing alternatives.

Adaptive multilooking is a critical processing step in multi-temporal interferometric synthetic aperture radar (InSAR) measurement, especially in small temporal baseline subsets. Various amplitude-based adaptive multilook approaches have been proposed for the improvement of interferometric processing. However, the phase signal, which is fundamental in interferometric systems, is typically ignored in these methods. To fully exploit the information in complex SAR images, a nonlocal adaptive multilooking is proposed based on complex covariance matrix in this work. The complex signal is here exploited for the similiarity measurement between two pixels. Given the complexity of objects in SAR images, structure feature detection is introduced to adaptively estimate covariance matrix. The effectiveness and reliability of the proposed approach are demonstrated with experiments both on simulated and real data.