ALBERT

Description: Postdisaster search and rescue is an important application of ultrawideband (UWB) radar systems, which mainly detect trapped victims by their respiratory-motion response. The development of a respiratory-motion detection (RMD) algorithm that can eliminate nonstationary clutter and noise is a challenging task for the application. A new algorithm is proposed to deal with the task in this letter. It uses the multichannel singular spectrum analysis (MSSA) technique to reconstruct the respiratory-motion response detected by a UWB radar. During the reconstruction, the periodicity and range interrelation characteristics of the response are exploited to adaptively identify signal subspaces. The performance of the algorithm is verified both by simulated and real data. The results show its improved performance over the reference algorithms, e.g., a singular-value-decomposition-based algorithm. The adaptive-MSSA-based RMD algorithm has great promise not only in practical use but also for future research of UWB-radar-based human being remote sensing.

Description: Land–sea contamination observed in Soil Moisture and Ocean Salinity (SMOS) brightness temperature images is found to have two main contributions: the floor error inherent of image reconstruction and a multiplicative error either in the antenna temperature or in the visibility samples measured by the correlator. The origin of this last one is traced down to SMOS calibration parameters to yield a simple correction scheme, which is validated against several geophysical scenarios. Autoconsistency rules in interferometric synthesis together with redundant and complementary calibration procedures provide a robust SMOS calibration scheme.

Description: This letter proposes a novel algorithm, which is based on the generalized method of moments (GMM), for the estimation and correction of phase errors induced in synthetic aperture radar (SAR) imagery. The GMM algorithm is used to replace the original phase-estimation kernel in the basic structure of the phase-gradient-autofocus algorithm. Since this novel algorithm does not require the observed signal to be a certain distribution model, it is able to estimate arbitrary phase errors. The GMM algorithm has the ability of estimating range-dependent phase errors, which makes it an efficient estimator. As a result, higher accuracy of the estimated phase errors and a better focused image can be achieved. Excellent results have been obtained in autofocusing and imaging experiments on real SAR data.

Description: Strong clutter reflections of terrain and marine surfaces obscure the contrast between the target-of-interest and clutter (terrain and marine surface reflections) in synthetic aperture radar (SAR) images and consequently hinder the efficiency of image interpretation and analysis. To overcome this problem, this letter proposes an efficient clutter suppression method in SAR images, which is named shedding irrelevant patterns (SIP). The essence is to construct a regression function that can suppress clutter and preserve the target patterns concurrently. We assume that the clutter is irrelevant to the target-of-interest and distinguishable in patterns in terms of image-pixel distribution and intensity (spatial information). Experimental results show the efficiency of the proposed method in both clutter suppression and target pattern preservation.

Description: A concern in hyperspectral image classification is the high number of required training samples. When traditional classifiers are applied, feature reduction (FR) techniques are the most common approaches to deal with this problem. Subspace-based classifiers, which are developed based on high-dimensional space characteristics, are another way to handle the high dimension of hyperspectral images. In this letter, a novel subspace-based classification approach is proposed and compared with basic and improved subspace-based classifiers. The proposed classifier is also compared with traditional classifiers that are accompanied by an FR technique and the well-known support vector machine classifier. Experimental results prove the efficiency of the proposed method, especially when a limited number of training samples are available. Furthermore, the proposed method has a very high level of automation and simplicity, as it has no parameters to be set.

Description: To improve the spatial density of measurement points of persistent-scatterer interferometry, distributed scatterer (DS) should be considered and processed. An important procedure in DS interferometry is the phase triangulation (PT). This letter introduces two modified PT algorithms (i.e., equal-weighted PT and coherence-weighted PT) and analyzes the mathematical relations between different published PT methods (i.e., the maximum-likelihood phase estimator, least squares estimator, and eigendecomposition-based phase estimators). The analysis shows that the above five PT methods share very similar mathematical forms with different weight values in the estimation procedure.

Description: Sparse representation-based classifier and its variants have been widely adopted for hyperspectral image (HSI) classification recently. However, sparse representation is unstable so that similar features might obtain significantly different sparse codes. Despite the instability, we find that the sparse codes follow a class-dependent distribution under the structured dictionary consisting of training samples from all classes. Based on this observation, a novel discriminative feature, sparse code histogram (SCH), is developed for HSI classification. By counting the SCH of each sample from the sparse codes of its spatial neighbors, we can statistically obtain the distribution pattern of sparse codes of the class to which the sample belongs, and then treat the SCH as a new feature for classification. To reduce the possible outliers among the neighbors, a shape-adaptive neighborhood extractor is also employed to enhance the stability of the histogram feature. Experimental results demonstrate that SCH enjoys a strong discriminative power, which can achieve notably better performance than several state-of-the-art methods for HSI classification with limited training samples.

Description: Several detection statistics have been proposed for detecting fine ground disturbances between two synthetic aperture radar (SAR) images, such as vehicle tracks. The standard method involves estimating a local correlation coefficient between images. Other methods have been proposed using various statistical hypothesis tests. One of these alternative methods is a generalized likelihood ratio test (GLRT), which compares a full-correlation image model to a no-correlation image model. In this letter, we expand the GLRT to polarimetric SAR data and derive the appropriate GLRT detection statistics. Additionally, we explore relaxing the equal variance/equal polarimetric covariance assumptions used in previous results and find improved performance on macroscopic scene changes.

Description: For downward-looking linear array 3-D synthetic aperture radar, the resolution in cross-track direction is much lower than the ones in range and azimuth. Hence, superresolution reconstruction algorithms are desired. Since the cross-track signal to be reconstructed is sparse in the object domain, compressive sensing algorithm has been used. However, the imaging processing on the 3-D scene brings large computational loads, which renders challenges in both data acquisition and processing. To cover this shortage, truncated singular value decomposition is utilized to reconstruct a reduced-redundancy spatial measurement matrix. The proposed algorithm provides advantages in terms of computational time while maintaining the quality of the scene reconstructions. Moreover, our results on uniform linear array are generally applicable to sparse nonuniform linear array. Superresolution properties and reconstruction accuracies are demonstrated using simulations under the noise and clutter scenarios.

Description: This letter proposes a signal processing method of passive bistatic radar (PBR) exploiting an uncooperative radar as an illuminator. Compared with other opportunity illuminators, the transmitting signal of a radar usually has a better ambiguity function, which leads to a higher range resolution. Two channels are needed in PBR system. The reference channel is used to estimate radar signal parameters and reconstruct directly propagated signal. The surveillance channel is used to receive scattered wave. An array antenna and a simultaneous multibeam algorithm are necessary in the surveillance channel due to the flexible beam scanning of the uncooperative radar. The procedure of the proposed method is explained in detail, which is then followed by a field experiment. Preliminary results from the field experiment show that the proposed method can be applied to target angle and bistatic range measurement successfully.

Description: In order to achieve 3-D imaging with an airborne down-looking linear-array synthetic aperture radar (LASAR), a uniform virtual antenna array may be obtained by aperture synthesis of the cross-track sparse multiple-input–multiple-output array. However, the actual 3-D imaging quality is unavoidably degraded by errors in the virtual element position. In this letter, we investigate the effects of these errors on the forms and the degrees of image quality degradation by decomposing the error-related stochastic processes via an orthogonal transform based on discrete Legendre polynomials. It should be noted that these analyses are helpful for designing a LASAR system and providing a reference for specifying the requisite precision of measurement devices and calibration methods. Finally, we briefly consider the use of calibration methods to eliminate the effects of errors.

Description: In problems where labeled data are scarce, semisupervised learning (SSL) techniques are an attractive framework that can exploit both labeled and unlabeled data. These approaches typically rely on a smoothness assumption such that examples that are similar in input space should also be similar in label space. In many domains, such as remotely sensed hyperspectral image (HSI) classification, the data violate this assumption. In response, we propose a general method by which a neighborhood graph used in SSL is learned using binary classifiers that are trained to predict whether a pair of pixels shares the same label. Working within the framework of semisupervised neural networks (SSNNs), we show that our approach improves on the performance of the SSNN on two HSI data sets.

Description: In this letter, new models for the spatial correlation of sea clutter texture and intensity are proposed as improved versions of current power law models or exponential decay model. The models for texture have three unknown parameters, and thus can be called triparametric models. The structure of the models is a weighted sum of two components, which can describe the decaying process of the correlation coefficient with spatial lags, as well as the periodic behavior due to the existence of transient coherent structures in sea clutter. Unknown parameters are optimized by the nonlinear least square fit method. Models for sea clutter intensity can be obtained through a linear transform for uncorrelated speckle based on the compound-Gaussian representation of sea clutter. The proposed models are validated and compared with current models using S- and C-band measured sea clutter data. Analysis results indicate the effectiveness of the proposed models in that they can describe the behavior of spatial correlation coefficients with higher accuracy.

Description: Terrestrial laser scanning (TLS) has become a popular tool for acquiring source data points which can be used to construct digital elevation models (DEMs) for a wide number of applications. A TLS point cloud often has a very fine spatial resolution, which can represent well the spatial variation of a terrain surface. However, the uncertainty in DEMs created from this relatively new type of source data is not well understood, which forms the focus of this letter. TLS survey data representing four terrain surfaces of different characteristics were used to explore the effects of surface complexity and typical TLS data density (in terms of data point spacing) on DEM accuracy. The spatial variation in TLS data can be decomposed into parts corresponding to the signal of spatial variation (of terrain surfaces) and noise due to measurement error. We found a linear relation between the DEM error and the typical TLS data spacings considered (30–100 mm) which arises as a function of the interpolation error, and a constant contribution from the propagated data noise. This letter quantifies these components for each of the four surfaces considered and shows that, for the interpolation method considered here, higher density sampling would not be beneficial.

Description: A novel way to estimate the live fuel moisture content (LFMC) was explored from the ratio of canopy water content (CWC) and foliage dry biomass (FDB). The CWC was estimated using the PROSAIL (PROSPECT + SAIL) radiative transfer model from the Landsat 8 product. A weak constraint 4-D variational data assimilation method was employed to assimilate the temporally estimated leaf area index into a soil-water-atmosphere-plant (SWAP) model for optimizing the model control variables. Then, the SWAP model was reinitialized with this optimum set of control variables, and better prediction of FDB was obtained. Results showed that a high accuracy level was achieved for the estimated CWC ( $R^{2}=0.91$ , $mbox{RMSE}=84.74 mbox{g/m}^2$ ) and FDB ( $R^2=0.88$ , $mbox{RMSE}=48.54 mbox{g/m} ^2$ ) when compared with in situ measured values. However, the accuracy level of estimated LFMC was poor ( $R^2=0.59$ , $mbox{RMSE} =30.85%$ ) . Further analyses find that the estimated LFMC is reliable for low LFMC but challenged for high LFMC, which indicates that the presented method still makes sense to the assessment of wildfire risk since the wildfire generally occurs when the vegetation is in low LFMC condition.

Description: In this letter, we present the use of experimental human micro-Doppler signature data gathered by a multistatic radar system to discriminate between unarmed and potentially armed personnel walking along different trajectories. Different ways of extracting suitable features from the spectrograms of the micro-Doppler signatures are discussed, particularly empirical features such as Doppler bandwidth, periodicity, and others, and features extracted from singular value decomposition (SVD) vectors. High classification accuracy of armed versus unarmed personnel (between 90% and 97% depending on the walking trajectory of the people) can be achieved with a single SVD-based feature, in comparison with using four empirical features. The impact on classification performance of different aspect angles and the benefit of combining multistatic information is also evaluated in this letter.

Description: Automatic urban area detection in remote sensing images is an important application in the field of earth observation. Most of the existing methods employ feature classifiers and thereby contain a data training process. Moreover, some methods cannot detect urban areas in complex scenes accurately. This letter proposes an automatic urban area detection method that uses multiple features that have different resolutions. First, a downsampled low-resolution image is used to segment the candidate area. After the corner points of the urban area are extracted, a weighted Gaussian voting matrix technique is employed to integrate the corner points into the candidate area. Then, the edge features and homogeneous region are extracted by using the original high-resolution image. Using these results as the input, the processes of guided filtering and contrast enhancement can finally detect accurately the urban areas. This method combines multiple features, such as corner, edge, and regional characteristics, to detect the urban areas. The experimental results show that the proposed method has better detection accuracy for urban areas than the existing algorithms.

Description: In marine sciences, time series are often nonlinear and nonstationary. Adequate and specific methods are needed to analyze such series. In this letter, an application of the empirical mode decomposition method (EMD) associated to the Hilbert spectral analysis (HSA) is presented. Furthermore, EMD-based time-dependent intrinsic correlation (TDIC) analysis is applied to consider the correlation between two nonstationary time series. Four temperature time series obtained from automatic measurements in nearshore waters of the Réunion island are considered, recorded every 10 min from July 2011 to January 2012. The application of the EMD on these series and the estimation of their power spectra using the HSA are illustrated. The authors identify low-frequency tidal waves and display the pattern of correlations at different scales and different locations. By TDIC analysis, it was concluded that the high-frequency modes have small correlation, whereas the trends are perfectly correlated.

Description: Detecting vehicles in aerial images provides important information for traffic management and urban planning. Detecting the cars in the images is challenging due to the relatively small size of the target objects and the complex background in man-made areas. It is particularly challenging if the goal is near-real-time detection, i.e., within few seconds, on large images without any additional information, e.g., road database and accurate target size. We present a method that can detect the vehicles on a 21-MPixel original frame image without accurate scale information within seconds on a laptop single threaded. In addition to the bounding box of the vehicles, we extract also orientation and type (car/truck) information. First, we apply a fast binary detector using integral channel features in a soft-cascade structure. In the next step, we apply a multiclass classifier on the output of the binary detector, which gives the orientation and type of the vehicles. We evaluate our method on a challenging data set of original aerial images over Munich and a data set captured from an unmanned aerial vehicle (UAV).

Description: We compare five slope correction methods developed by Walter et al. , Montes et al. , Schleppi et al. , España et al. , and Gonsamo et al. (referred to as WAL, MON, SCH, ESP, and GON, respectively) using artificial fisheye pictures simulated by graphics software and a lookup table (LUT) retrieval method. The LUT is built by simulating the directional gap fraction as a function of leaf area index (LAI) and average leaf inclination angle (ALIA) using the Poisson law. LAI and ALIA estimates correspond to the case of the LUT that provides the lowest root-mean-square error between the observed gap fractions after slope correction and the simulated ones. Three LAI values (1.5, 3.5, and 5.5), four ALIA values (26.8°, 45°, 57.5°, and 63.2°), and three slope angles (0°, 20°, and 50°) constituted 36 samples of random scenes. ESP is recommended because its results are accurate and independent on the leaf angle distribution (LAD), while GON only performs well for spherical LAD. The three other methods present less good performances with underestimation or overestimation of LAI and/or ALIA depending on the LAD, and the recommended order for them is MON, SCH, and WAL.

Description: In this letter, an improved phase correlation (PC) method based on 2-D plane fitting and the maximum kernel density estimator (MKDE) is proposed, which combines the idea of Stone's method and robust estimator MKDE. The proposed PC method first utilizes a vector filter to minimize the noise errors of the phase angle matrix and then unwraps the filtered phase angle matrix by the use of the minimum cost network flow unwrapping algorithm. Afterward, the unwrapped phase angle matrix is robustly fitted via MKDE, and the slope coefficients of the 2-D plane indicate the subpixel shifts between images. The experiments revealed that the improved method can effectively avoid the impact of outliers on the phase angle matrix during the plane fitting and is robust to aliasing and noise. The matching accuracy can reach 1/50th of a pixel using simulated data. The real image sequence tracking experiment was also undertaken to demonstrate the effectiveness of the proposed PC method with a registration accuracy of root-mean-square error better than 0.1 pixels.

Description: Accurately mapping forest carbon density by combining sample plots and remotely sensed images has become popular because this method provides spatially explicit estimates. However, mixed pixels often impede the improvement of the estimation. In this letter, regression modeling and spectral unmixing analysis were integrated to improve the estimation of forest carbon density for the You County of Hunan, China, using Landsat Thematic Mapper images. Linear spectral unmixing with and without a constraint (LSUWC and LSUWOC) and nonlinear spectral unmixing (NSU) were compared to derive the fractions of five endmembers, particularly forests. Stepwise regression, logistic regression, and polynomial regression (PR) with and without the forest fraction used as an independent variable and the product of the forest fraction image and the map from the best model without the forest fraction were compared. The models were developed using 56 sample plots, and their results were validated using 26 test plots. The decomposition of mixed pixels was assessed using higher spatial resolution SPOT images and a corresponding land cover map. The results showed that 1) LSUWC more accurately estimated the endmember fractions than LSUWOC and NSU, 2) PR had the greatest estimation accuracy of forest carbon, and 3) combining regression modeling and spectral unmixing increased the estimation accuracy by 31%–39%, and introducing the forest fraction into the regressions performed better than the product of forest fraction image and the results from PR without the fraction. This implied that the integrations provided great potential in reducing the impacts of mixed pixels in mapping forest carbon.

Description: This letter proposes a multiresolution technique to address the high computational cost in remote sensing image registration. The scale-invariant feature transform is applied to detect keypoints and descriptors, and then, global information combined with descriptors is utilized to establish keypoint mappings. Keypoints are first classified according to their octaves. Then, in the lowest resolution, the keypoints of the largest octave are mapped with descriptors and the global information, giving an initial affine transformation $T_0$ . In the next octave, the keypoints of the second largest octave are mapped by employing $T_0$ to narrow the space of matching keypoints. By this means, the process of establishing keypoint correspondences is conducted from one resolution (octave) to the next as the obtained transformation gets finer until we get to the highest resolution. Due to the high computational expense of computing global information, the proposed technique is important for aligning large-size remote sensing imagery. Experimental results show that the proposed method can achieve a comparable registration accuracy but with a less computational cost than directly building keypoint mappings on images of large size.

Description: In this letter, we present an efficient parallel implementation of composite kernels in support vector machines (SVMs) for hyperspectral image (HSI) classification. Our implementation makes effective use of commodity graphics processing units (GPUs). Specifically, we port the calculation of composite kernels to GPUs, perform intensive computations based on NVidia's compute unified device architecture, and execute the rest of the operations related with control and small data calculations in the CPU. Our experimental results, conducted using real hyperspectral data sets and NVidia GPU platforms, indicate significant improvements in terms of computational effectiveness, achieving near-real-time performance of spatial–spectral HSI classification for the first time in the literature.

Description: Compared with airborne laser scanning, terrestrial laser scanning (TLS) offers ground-based point cloud data of trees and provides greater potential to accurately estimate tree and stand parameters. However, there is a lack of effective methods to accurately identify locations of individual trees from TLS point cloud data. It is also unknown whether the estimation accuracy of the parameters, including tree height (H), diameter at breast height (DBH), and so on, using TLS can meet the requirement of forest management and planning. In this letter, a novel method to effectively process point cloud data and further determine the locations of individual trees in a stand based on the central coordinates of point cloud data on a defined grid according to the largest DBH was developed. Moreover, a point-cloud-data-based convex hull algorithm and the cylinder method were, respectively, used to estimate DBH and H of individual trees. This study was conducted in a pure Chinese fir plantation of 45 trees located in Huang-Feng-Qiao forest farm, You County of Hunan, China. The comparison of the estimated and observed values showed that the obtained tree locations had errors of less than 20 cm, and the relative root mean square errors for the estimates of both DBH and H were less than 5%. This implies that TLS is very promising for the retrieval of tree and stand parameters in forest stands. For the applications of these methods to mixed forests with a structure of multilayer canopies, further examination is needed.

Description: In this letter, a novel algorithm for attitude measurement based on a 3-D electromagnetic model (3-D em-model) is proposed. The 3-D em-model is established offline based on the geometric structure of the target, and it can be used to predict the scattering features at different target attitudes. In order to measure the attitude of the air target, we design a bistatic step frequency radar system. The directions of the two radars' lines of sight (LOSs) relative to the target are acquired by matching the high-resolution range profiles (HRRPs) from the target echoes to the HRRPs generated from the 3-D em-model. Since the directions of two radars' LOSs relative to the Earth are already known, the absolute attitude of the target can be acquired. The innovative contributions of this letter are as follows: 1) A comprehensive theoretical analysis of air target attitude measurement based on its own 3-D em-model is proposed; 2) the method can be applied to different kinds of air targets such as aircraft, satellite, missile, etc.; 3) the proposed attitude measurement method does not require target motion model in advance; and 4) the proposed algorithm can be applied to any kind of step frequency waveforms. Experiments using both data predicted by a high-frequency electromagnetic code and data measured in the chamber verify the validity of the method.

Description: The Soil Moisture and Ocean Salinity (SMOS) and Soil Moisture Active Passive (SMAP) missions provide Level-1 brightness temperature (Tb) observations that are used for global soil moisture estimation. However, the nature of these Tb data differs: the SMOS Tb observations contain atmospheric and select reflected extraterrestrial (“Sky”) radiation, whereas the SMAP Tb data are corrected for these contributions, using auxiliary near-surface information. Furthermore, the SMOS Tb observations are multiangular, whereas the SMAP Tb is measured at 40° incidence angle only. This letter discusses how SMOS Tb, SMAP Tb, and radiative transfer modeling components can be aligned in order to enable a seamless exchange of SMOS and SMAP Tb data in soil moisture retrieval and assimilation systems. The aggregated contribution of the atmospheric and reflected Sky radiation is, on average, about 1 K for horizontally polarized Tb and 0.5 K for vertically polarized Tb at 40° incidence angle, but local and short-term values regularly exceed 5 K.

Description: Histopathological grading of cancer not only offers an insight to the patients’ prognosis but also helps in making individual treatment plans. Mitosis counts in histopathological slides play a crucial role for invasive breast cancer grading using the Nottingham grading system. Pathologists perform this grading by manual examinations of a few thousand images for each patient. Hence, finding the mitotic figures from these images is a tedious job and also prone to observer variability due to variations in the appearances of the mitotic cells. We propose a fast and accurate approach for automatic mitosis detection from histopathological images. We employ area morphological scale space for cell segmentation. The scale space is constructed in a novel manner by restricting the scales with the maximization of relative-entropy between the cells and the background. This results in precise cell segmentation. The segmented cells are classified in mitotic and non-mitotic category using the random forest classifier. Experiments show at least 12% improvement in $F_{1}$ score on more than 450 histopathological images at $40times $ magnification.

Description: This paper proposes a fast multi-band image fusion algorithm, which combines a high-spatial low-spectral resolution image and a low-spatial high-spectral resolution image. The well admitted forward model is explored to form the likelihoods of the observations. Maximizing the likelihoods leads to solving a Sylvester equation. By exploiting the properties of the circulant and downsampling matrices associated with the fusion problem, a closed-form solution for the corresponding Sylvester equation is obtained explicitly, getting rid of any iterative update step. Coupled with the alternating direction method of multipliers and the block coordinate descent method, the proposed algorithm can be easily generalized to incorporate prior information for the fusion problem, allowing a Bayesian estimator. Simulation results show that the proposed algorithm achieves the same performance as the existing algorithms with the advantage of significantly decreasing the computational complexity of these algorithms.

Description: In recent years, baggage screening at airports has included the use of dual-energy X-ray computed tomography (DECT), an advanced technology for nondestructive evaluation. The main challenge remains to reliably find and identify threat objects in the bag from DECT data. This task is particularly hard due to the wide variety of objects, the high clutter, and the presence of metal, which causes streaks and shading in the scanner images. Image noise and artifacts are generally much more severe than in medical CT and can lead to splitting of objects and inaccurate object labeling. The conventional approach performs object segmentation and material identification in two decoupled processes. Dual-energy information is typically not used for the segmentation, and object localization is not explicitly used to stabilize the material parameter estimates. We propose a novel learning-based framework for joint segmentation and identification of objects directly from volumetric DECT images, which is robust to streaks, noise and variability due to clutter. We focus on segmenting and identifying a small set of objects of interest with characteristics that are learned from training images, and consider everything else as background. We include data weighting to mitigate metal artifacts and incorporate an object boundary field to reduce object splitting. The overall formulation is posed as a multilabel discrete optimization problem and solved using an efficient graph-cut algorithm. We test the method on real data and show its potential for producing accurate labels of the objects of interest without splits in the presence of metal and clutter.

Description: Feature point matching is a fundamental and challenging problem in many computer vision applications. In this paper, a robust feature point matching algorithm named spatial order constraints bilateral-neighbor vote (SOCBV) is proposed to remove outliers for a set of matches (including outliers) between two images. A directed ${k}$ nearest neighbor ( knn ) graph of match sets is generated, and the problem of feature point matching is formulated as a binary discrimination problem. In the discrimination process, the class labeled matrix is built via the spatial order constraints defined on the edges that connect a point to its knn . Then, the posterior inlier class probability of each match is estimated with the knn density estimation and spatial order constraints. The vote of each match is determined by averaging all posterior class probabilities that originate from its associative inliers set and is used for removing outliers. The algorithm iteratively removes outliers from the directed graph and recomputes the votes until the stopping condition is satisfied. Compared with other popular algorithms, such as RANSAC, RSOC, GTM, SOC and WGTM, experiments under various testing data sets demonstrate strong robustness for the proposed algorithm.

Description: Acoustic localization is an essential technique in speech capturing, speech enhancement, video conferencing, and human–robot interaction. However, in practical situations, localization has to be performed in abominable environments, where the presence of reverberation and noise degrades the performance of available position estimates. Besides, the designed systems should be adaptive to locomotion of targets with low computational complexity. In the context, this paper introduces a robust hierarchical acoustic localization method via time-delay compensation (TDC) and interaural matching filter (IMF). Firstly, interaural time-delay (ITD) and interaural level difference (ILD), which are cues involved in first two layers, respectively, are yielded by TDC all at once. Then, a novel feature named IMF, which can eliminate the difference between binaural signals, is proposed in the third layer. The final decision making is based on a Bayesian rule. The relationships among the three layers are that the former layer provides candidate directions for later ones such that the searching space becomes gradually smaller to reduce matching time. Experiments using both a public database and a real scenario verify that TDC and IMF are robust for acoustic localization, and hierarchical system has less consumption time.

Description: Canonical correlation analysis (CCA) is a widely used data analysis tool that allows to assess the correlation between two distinct sets of signals. It computes optimal linear combinations of the signals in both sets such that the resulting signals are maximally correlated. The weight vectors defining these optimal linear combinations are referred to as “principal CCA directions”. In addition to this particular type of data analysis, CCA is also often used as a blind source separation (BSS) technique, i.e., under certain assumptions, the principal CCA directions have certain demixing properties. In this paper, we propose a distributed CCA (DCCA) algorithm that can operate in wireless sensor networks (WSNs) with a fully connected or a tree topology. The algorithm estimates the $Q$ principal CCA directions from the sensor signal observations collected by the different nodes in the WSN and extracts the corresponding sources. These network-wide principal CCA directions are estimated in a time-recursive fashion without explicitly constructing the corresponding network-wide correlation matrices, i.e., without the need for data centralization. Instead, each node locally computes smaller CCA problems and only transmits compressed sensor signal observations (of dimension $Q$ ), which significantly reduces the bit rate over the wireless links of the WSN. We prove convergence and optimality of the DCCA algorithm, and we demonstrate its performance by means of numerical simulations in a blind source separation scenario.

Description: There has been much research on shrinkage methods for real-valued covariance matrices and their inverses (precision matrices). In spectral analysis of $p$ -vector-valued time series, complex-valued spectral matrices and precision matrices arise, and good shrinkage methods are often required, most notably when the estimated complex-valued spectral matrix is singular. As an improvement on the Ledoit-Wolf (LW) type of spectral matrix estimator we use random matrix theory to derive a Rao-Blackwell estimator for a spectral matrix, its inverse being a Rao–Blackwellized estimator for the spectral precision matrix. A random matrix method has previously been proposed for complex-valued precision matrices. It was implemented by very costly simulations. We formulate a fast, completely analytic approach. Moreover, we derive a way of selecting an important parameter using predictive risk methodology. We show that both the Rao–Blackwell estimator and the random matrix estimator of the precision matrix can substantially outperform the inverse of the LW estimator in a time series setting. Our new methodology is applied to EEG-derived time series data where it is seen to work well and deliver substantial improvements for precision matrix estimation.

Description: In this paper, the state estimation problem for discrete-time linear systems influenced by multiplicative and time-correlated additive measurement noises is considered where the multiplicative noises are zero-mean white noise sequences, and the time-correlated additive noise is described by a linear system model with white noise. An optimal linear estimator for the system under consideration is proposed, which does not require computing the inverse of state transition matrix. The proposed estimator has a recursive structure, and has time-independent computation and storage load. Computer simulations are carried out to demonstrate the performance of the proposed estimator. The simulation results show the superiority of the proposed estimator.

Description: In this paper, we start with the standard support vector machine (SVM) formulation and extend it by considering a general SVM formulation with normalized margin. This results in a unified convex framework that allows many different variations in the formulation with very diverse numerical performance. The proposed unified framework can capture the existing methods, i.e., standard soft-margin SVM, $ell_{1}$ -SVM, and SVMs with standardization, feature selection, scaling, and many more SVMs, as special cases. Furthermore, our proposed framework can not only provide us with more insights on different SVMs from the “energy” and “penalty” point of views, which help us understand the connections and differences between them in a unified way, but also enable us to propose more SVMs that outperform the existing ones under some scenarios.

Description: This paper presents a novel low-complexity motion estimation and mode decision algorithm for encoding multiple quality layers following the H.264/scalable video coding standard, considering both coarse grain scalability (CGS) and medium grain scalability (MGS). The proposed algorithm conducts motion estimation and mode decision only at the base layer (BL) and enforces the higher layers to inherit the motion and mode decisions of the BL. In order for the decision made at the BL to be nearly optimal for all layers, we use the highest layer reconstructed frame as the reference frame for motion estimation and set the Lagrangian multipliers according to the quantization parameter of the current and higher layers. We also propose a simple early skip/direct decision to further boost the encoding speed. Mode decision and motion estimation is conducted at a higher layer only if the layer below it uses the skip/direct mode for a block. Significant complexity reduction can be achieved because the mode and motion estimation is performed at most once for each macroblock. Because the mode and motion information only needs to be transmitted once, we also achieve a slightly better rate-distortion (R–D) performance for typical videos. Experiments have shown more than $2times $ (up to $5times $ ) speedup for a three-layer encoder against the conventional R–D optimized reference software JSVM on both CIF and HD sequences, and for both CGS and MGS, with the tradeoff of the coding efficiency measured by the Bjontegaard delta rate.

Description: We consider multiple-antenna signal detection of primary user transmission signals by a secondary user receiver in cognitive radio networks. The optimal detector is analyzed for the scenario where the number of primary user signals is no less than the number of receive antennas at the secondary user. We first derive exact expressions for the moments of the generalized likelihood ratio test (GLRT) statistic, yielding approximations for the false alarm and detection probabilities. We then show that the normalized GLRT statistic converges in distribution to a Gaussian random variable when the number of antennas and observations grow large at the same rate. Further, using results from large random matrix theory, we derive expressions to compute the detection probability without explicit knowledge of the channel, and then particularize these expressions for two scenarios of practical interest: 1) a single primary user sending spatially multiplexed signals, and 2) multiple spatially distributed primary users. Our analytical results are finally used to obtain simple design rules for the signal detection threshold.

Description: In this paper, we propose a novel unifying framework using a Markov network to learn the relationships among multiple classifiers. In face recognition, we assume that we have several complementary classifiers available, and assign observation nodes to the features of a query image and hidden nodes to those of gallery images. Under the Markov assumption, we connect each hidden node to its corresponding observation node and the hidden nodes of neighboring classifiers. For each observation-hidden node pair, we collect the set of gallery candidates most similar to the observation instance, and capture the relationship between the hidden nodes in terms of a similarity matrix among the retrieved gallery images. Posterior probabilities in the hidden nodes are computed using the belief propagation algorithm, and we use marginal probability as the new similarity value of the classifier. The novelty of our proposed framework lies in the method that considers classifier dependence using the results of each neighboring classifier. We present the extensive evaluation results for two different protocols, known and unknown image variation tests, using four publicly available databases: 1) the Face Recognition Grand Challenge ver. 2.0; 2) XM2VTS; 3) BANCA; and 4) Multi-PIE. The result shows that our framework consistently yields improved recognition rates in various situations.

Description: Ellipse fitting is widely applied in the fields of computer vision and automatic manufacture. However, the introduced edge point errors (especially outliers) from image edge detection will cause severe performance degradation of the subsequent ellipse fitting procedure. To alleviate the influence of outliers, we develop a robust ellipse fitting method in this paper. The main contributions of this paper are as follows. First, to be robust against the outliers, we introduce the maximum correntropy criterion into the constrained least-square (CLS) ellipse fitting method, and apply the half-quadratic optimization algorithm to solve the nonlinear and nonconvex problem in an alternate manner. Second, to ensure that the obtained solution is related to an ellipse, we introduce a special quadratic equality constraint into the aforementioned CLS model, which results in the nonconvex quadratically constrained quadratic programming problem. Finally, we derive the semidefinite relaxation version of the aforementioned problem in terms of the trace operator and thus determine the ellipse parameters using semidefinite programming. Some simulated and experimental examples are presented to illustrate the effectiveness of the proposed ellipse fitting approach.

Description: State-of-the-art web image search frameworks are often based on the bag-of-visual-words (BoVWs) model and the inverted index structure. Despite the simplicity, efficiency, and scalability, they often suffer from low precision and/or recall, due to the limited stability of local features and the considerable information loss on the quantization stage. To refine the quality of retrieved images, various postprocessing methods have been adopted after the initial search process. In this paper, we investigate the online querying process from a graph-based perspective. We introduce a heterogeneous graph model containing both image and feature nodes explicitly, and propose an efficient reranking approach consisting of two successive modules, i.e., incremental query expansion and image-feature voting, to improve the recall and precision, respectively. Compared with the conventional reranking algorithms, our method does not require using geometric information of visual words, therefore enjoys low consumptions of both time and memory. Moreover, our method is independent of the initial search process, and could cooperate with many BoVW-based image search pipelines, or adopted after other postprocessing algorithms. We evaluate our approach on large-scale image search tasks and verify its competitive search performance.

Description: The study of fluid flow through solid matter by computed tomography (CT) imaging has many applications, ranging from petroleum and aquifer engineering to biomedical, manufacturing, and environmental research. To avoid motion artifacts, current experiments are often limited to slow fluid flow dynamics. This severely limits the applicability of the technique. In this paper, a new iterative CT reconstruction algorithm for improved a temporal/spatial resolution in the imaging of fluid flow through solid matter is introduced. The proposed algorithm exploits prior knowledge in two ways. First, the time-varying object is assumed to consist of stationary (the solid matter) and dynamic regions (the fluid flow). Second, the attenuation curve of a particular voxel in the dynamic region is modeled by a piecewise constant function over time, which is in accordance with the actual advancing fluid/air boundary. Quantitative and qualitative results on different simulation experiments and a real neutron tomography data set show that, in comparison with the state-of-the-art algorithms, the proposed algorithm allows reconstruction from substantially fewer projections per rotation without image quality loss. Therefore, the temporal resolution can be substantially increased, and thus fluid flow experiments with faster dynamics can be performed.

Description: Most existing approaches for RGB-D indoor scene labeling employ hand-crafted features for each modality independently and combine them in a heuristic manner. There has been some attempt on directly learning features from raw RGB-D data, but the performance is not satisfactory. In this paper, we propose an unsupervised joint feature learning and encoding (JFLE) framework for RGB-D scene labeling. The main novelty of our learning framework lies in the joint optimization of feature learning and feature encoding in a coherent way, which significantly boosts the performance. By stacking basic learning structure, higher level features are derived and combined with lower level features for better representing RGB-D data. Moreover, to explore the nonlinear intrinsic characteristic of data, we further propose a more general joint deep feature learning and encoding (JDFLE) framework that introduces the nonlinear mapping into JFLE. The experimental results on the benchmark NYU depth dataset show that our approaches achieve competitive performance, compared with the state-of-the-art methods, while our methods do not need complex feature handcrafting and feature combination and can be easily applied to other data sets.

Description: Out-of-focus blur occurs frequently in multispectral imaging systems when the camera is well focused at a specific (reference) imaging channel. As the effective focal lengths of the lens are wavelength dependent, the blurriness levels of the images at individual channels are different. This paper proposes a multispectral image deblurring framework to restore out-of-focus spectral images based on the characteristic of interchannel correlation (ICC). The ICC is investigated based on the fact that a high-dimensional color spectrum can be linearly approximated using rather a few number of intrinsic spectra. In the method, the spectral images are classified into an out-of-focus set and a well-focused set via blurriness computation. For each out-of-focus image, a guiding image is derived from the well-focused spectral images and is used as the image prior in the deblurring framework. The out-of-focus blur is modeled as a Gaussian point spread function, which is further employed as the blur kernel prior. The regularization parameters in the image deblurring framework are determined using generalized cross validation, and thus the proposed method does not need any parameter tuning. The experimental results validate that the method performs well on multispectral image deblurring and outperforms the state of the arts.

Description: This paper presents an optimized low-complexity and high-throughput MIMO signal detector core for detecting spatially multiplexed data streams. The core architecture supports various layer configurations up to 4, while achieving near-optimal performance, and configurable modulation constellations up to 256-QAM on each layer. The core is capable of operating as a soft-input soft-output log-likelihood ratio (LLR) MIMO detector which can be used in the context of iterative detection and decoding. High area-efficiency is achieved via algorithmic and architectural optimizations performed at two levels. First, distance computations and slicing operations for an optimal 2-layer maximum a posteriori MIMO detector are optimized to eliminate use of multipliers and reduce the overhead of slicing in the presence of soft-input LLRs. We show that distances can be easily computed using elementary addition operations, while optimal slicing is done via efficient comparisons with soft decision boundaries, resulting in a simple feed-forward pipelined architecture. Second, to support more layers, an efficient channel decomposition scheme is presented that reduces the detection of multiple layers into multiple 2-layer detection subproblems, which map onto the 2-layer core with a slight modification using a distance accumulation stage and a post-LLR processing stage. Various architectures are accordingly developed to achieve a desired detection throughput and run-time reconfigurability by time-multiplexing of one or more component cores. The proposed core is applied also to design an optimal multiuser MIMO detector for LTE. The core occupies an area of 1.58 MGE and achieves a throughput of 733 Mbps for 256-QAM when synthesized in 90-nm CMOS.

Description: We study a tandem of agents who make decisions about an underlying binary hypothesis, where the distribution of the agent observations under each hypothesis comes from an uncertainty class defined by a 2-alternating capacity. We investigate both decentralized detection rules, where agents collaborate to minimize the error probability of the final agent, and social learning rules, where each agent minimizes its own local minimax error probability. We then extend our results to the infinite tandem network, and derive necessary and sufficient conditions on the uncertainty classes for the minimax error probability to converge to zero when agents know their positions in the tandem. On the other hand, when agents do not know their positions in the network, we study the cases where agents collaborate to minimize the asymptotic minimax error probability, and where agents seek to minimize their worst-case minimax error probability (over all possible positions in the tandem). We show that asymptotic learning of the true hypothesis is no longer possible in these cases, and derive characterizations for the minimax error performance.

Description: Various blind synchronization methods built on the maximum likelihood (ML) principle have been proposed, where the addressed scenarios include additive white Gaussian noise (AWGN), single-path fading, and multipath fading channels. We consider ML blind synchronization over wide-sense stationary uncorrelated scattering (WSSUS) channels. Different from existing studies, we exploit a more complete signal correlation function and find the carrier frequency offset estimate to be the solution of a quartic equation, rather than the phase angle of a complex number. As the truly ML synchronizer (dubbed MLE) is very complicated, we also derive a reduced-complexity alternative (dubbed RCE). It is found that the RCE yields indistinguishable performance from the MLE, at a somewhat lower complexity than an existing rival. We also present an in-depth theoretical analysis and comparison of the performance of various methods. Simulations show that the proposed methods yield rather robust performance in modeling errors of the fading rate and the channel power-delay profile (PDP).

Description: How to produce the difference data of the two temporal images is a crucial factor in image change detection. In this letter, we propose multicontextual mutual information data (MMID) based on the bivariate Gaussian distribution (BGD) for synthetic aperture radar (SAR) image change detection and illustrate their superiorities over the classical difference data. MMID, which are an improved form of image spatial mutual information, are constructed based on the quadrilateral Markov random field (QMRF) and can be factored into the linear combination of the entropies. Then to adapt MMID to the change detection, we construct the 2-D entropies based on the BGD. In this way, MMID are able to capture the intertemporal statistical dependence of the two temporal images and thus can be taken as the feature-level difference data rather than the pixel-level data. The maximum-likelihood method, the automatic threshold method, and the Markov random field method are performed on the MMID of the real two temporal SAR images for the change detection. Experimental results demonstrate the superiorities of MMID over the traditional difference data.

Description: Spectral unmixing has been a popular technique for analyzing remotely sensed hyperspectral images. The goal of unmixing is to find a collection of pure spectral constituents (called endmembers ) that can explain each (possibly mixed) pixel of the scene as a combination of endmembers, weighted by their coverage fractions in the pixel or abundances . Over the last years, many algorithms have been presented to address the three main parts of the spectral unmixing chain: 1) estimation of the number of endmembers; 2) identification of the endmember signatures; and 3) estimation of the per-pixel fractional abundances. However, to date, there is no standardized tool that integrates these algorithms in a unified framework. In this letter, we present HyperMix, an open-source tool for spectral unmixing that integrates different approaches for spectral unmixing and allows building unmixing chains in graphical fashion, so that the end-user can define one or several spectral unmixing chains in fully configurable mode. HyperMix provides efficient implementations of most of the algorithms used for spectral unmixing, so that the tool automatically recognizes if the computer has a graphics processing unit (GPU) available and optimizes the execution of these algorithms in the GPU. This allows for the execution of spectral unmixing chains on large hyperspectral scenes in computationally efficient fashion. The tool is available online from http://hypercomphypermix.blogspot.com.es and has been validated with real hyperspectral scenes, providing state-of-the-art unmixing results.

Description: Seismic signals are nonlinear, and the seismic state-space model can be described as a nonlinear system. The particle filter (PF) method, as an effective method for estimating the state of a nonlinear system, can be applied to deal with seismic random noise attenuation. However, PF suffers from sample impoverishment caused by resampling, which results in serious loss of valid seismic information and leads to inaccurate representation of the reflected signal. To address the impoverishment issue and to further improve the particle quality, we propose a novel method to suppress seismic random noise—the adaptive fission particle filter (AFPF). In AFPF, all the particles undergo a fission process and produce “offspring” particles to maintain particle diversity. To implement the adaptation and to monitor the degree of fission, we apply a fission factor, which takes into account weights that indicate the quality of the particles. This leads to significant improvements in the particle quality, i.e., the proportion of highly weighted particles is increased. The effective seismic information provided by the resulting particles reproduces the true signal more reliably, reducing the bias of PF. In addition, we establish a dynamic state-space model suitable for seismic signals. Experimental results on synthetic records and field data illustrate the superior performance of AFPF in noise attenuation and reflected signal preservation compared with the PF.

Description: In this paper, the performance of cloud radio access networks (CRANs) where spatially distributed remote radio heads (RRHs) aid the macro base station (MBS) in transmission is analysed. In order to reflect a realistic scenario, the MBS and the RRHs are assumed to be equipped with multiple antennas and distributed according to a Poisson point process. Both, the MBS and the RRHs, are assumed to employ maximal ratio transmission (MRT) or transmit antenna selection (TAS). Considering downlink transmission, the outage performance of three schemes is studied; first is the selection transmission (ST) scheme, in which the MBS or the RRH with the best channel is selected for transmission. In the second scheme, all the RRHs participate (ARP) and transmit the signal to the user, whereas in the third scheme, a minimal number of RRHs, to attain a desired data-rate, participate in transmission (MRP). Exact closed-form expression for the outage probability is derived for the ST scheme. For the ARP and MRP schemes, analytical approximations of the outage probability are derived which are tight at high signal-to-noise ratios. In addition, for the MRP scheme, the minimal number of RRHs required to meet a target data rate is also calculated which can be useful in characterizing the system complexity. Furthermore, the derived expressions are validated through numerical simulation. It is shown that the average diversity gains of these schemes are independent of the intensity/number of RRHs and only depend on the number of antennas on the MBS. Furthermore, the ARP scheme outperforms the ST scheme when the MBS/RRHs transmit with maximum power. However, in case of a sum power constraint and equal power allocation, the ST scheme outperforms the ARP scheme.

Description: This paper proposes a dynamic resource allocation scheme to exploit the mixed timescale channel state information (CSI) knowledge structure in a multi-antenna base station-assisted device-to-device (D2D) network. The short-term multi-antenna beamforming control at each transmit device is adaptive to the local real-time CSI. The long-term routing and flow control is adaptive to the global topology and the long-term global CSI statistics of the D2D network. The design objective is to maximize a network utility function subject to the average transmit power constraint, the flow balance constraints and the instantaneous physical layer capacity constraints. The mixed timescale problem can be decomposed into a short-term beamforming control problem and a long-term flow and routing control problem. Using the stochastic cutting plane, we propose a low complexity, self-learning algorithm, which converges to the global optimal solution without explicit knowledge of the channel statistics. Simulation illustrates performance gains with several baselines.

Description: This paper considers the estimation of multi-scale multi-lag (MSML) channels. The MSML channel model is a good representation for wideband communication channels, such as underwater acoustic communication and radar. This model is characterized by a limited number of paths, each parameterized by a delay, Doppler scale, and attenuation factor. Herein, it is shown that an OFDM signal after passing through the MSML channel exhibits a low rank representation. This feature can be exploited to improve the channel estimation. By characterizing the received signal, it is shown that the MSML channel estimation problem can be adapted to a structured spectral estimation problem. The challenge is that the unknown frequencies are very close to each other due to the small values of Doppler scales. This feature can be employed to show that the data matrix is approximately low-rank. By exploiting structural features of the received signal, the Prony algorithm is modified to estimate the Doppler scales (close frequencies), delays and channel gains. Two strategies using convex and no-convex regularizers to remove noise from the corrupted signal are proposed. These algorithms are iterative based on the alternating direction method of multipliers. A bound on the reconstruction of the noiseless received signal provides guidance on the selection of the relaxation parameter in the optimizations. The performance of the proposed estimation strategies are investigated via numerical simulations, and it is shown that the proposed non-convex method offers up to 7 dB improvement in low SNR and the convex method offers up to 5 dB improvement in high SNR over prior methods for the MSML channel estimation.

Description: We present a novel spatiotemporal saliency detection method to estimate salient regions in videos based on the gradient flow field and energy optimization. The proposed gradient flow field incorporates two distinctive features: 1) intra-frame boundary information and 2) inter-frame motion information together for indicating the salient regions. Based on the effective utilization of both intra-frame and inter-frame information in the gradient flow field, our algorithm is robust enough to estimate the object and background in complex scenes with various motion patterns and appearances. Then, we introduce local as well as global contrast saliency measures using the foreground and background information estimated from the gradient flow field. These enhanced contrast saliency cues uniformly highlight an entire object. We further propose a new energy function to encourage the spatiotemporal consistency of the output saliency maps, which is seldom explored in previous video saliency methods. The experimental results show that the proposed algorithm outperforms state-of-the-art video saliency detection methods.

Description: Hyperspectral unmixing is one of the crucial steps for many hyperspectral applications. The problem of hyperspectral unmixing has proved to be a difficult task in unsupervised work settings where the endmembers and abundances are both unknown. In addition, this task becomes more challenging in the case that the spectral bands are degraded by noise. This paper presents a robust model for unsupervised hyperspectral unmixing. Specifically, our model is developed with the correntropy-based metric where the nonnegative constraints on both endmembers and abundances are imposed to keep physical significance. Besides, a sparsity prior is explicitly formulated to constrain the distribution of the abundances of each endmember. To solve our model, a half-quadratic optimization technique is developed to convert the original complex optimization problem into an iteratively reweighted nonnegative matrix factorization with sparsity constraints. As a result, the optimization of our model can adaptively assign small weights to noisy bands and put more emphasis on noise-free bands. In addition, with sparsity constraints, our model can naturally generate sparse abundances. Experiments on synthetic and real data demonstrate the effectiveness of our model in comparison to the related state-of-the-art unmixing models.

Description: Distributed processing over networks relies on in-network processing and cooperation among neighboring agents. Cooperation is beneficial when agents share a common objective. However, in many applications, agents may belong to different clusters that pursue different objectives. Then, indiscriminate cooperation will lead to undesired results. In this paper, we propose an adaptive clustering and learning scheme that allows agents to learn which neighbors they should cooperate with and which other neighbors they should ignore. In doing so, the resulting algorithm enables the agents to identify their clusters and to attain improved learning and estimation accuracy over networks. We carry out a detailed mean-square analysis and assess the error probabilities of Types I and II, i.e., false alarm and misdetection, for the clustering mechanism. Among other results, we establish that these probabilities decay exponentially with the step-sizes so that the probability of correct clustering can be made arbitrarily close to one.

Description: Robust Chinese remainder theorem (CRT) has been recently investigated for both integers and real numbers, where the folding integers are accurately recovered from erroneous remainders. In this paper, we consider the CRT problem for real numbers with noisy remainders that follow wrapped Gaussian distributions. We propose the maximum-likelihood estimation (MLE) based CRT when the remainder noises may not necessarily have the same variances. Furthermore, we present a fast algorithm for the MLE based CRT algorithm that only needs to search for the solution among $L$ elements, where $L$ is the number of remainders. Then, a necessary and sufficient condition on the remainder errors for the MLE CRT to be robust is obtained, which is weaker than the existing result. Finally, we compare the performances of the newly proposed algorithm and the existing algorithm in terms of both theoretical analysis and numerical simulations. The results demonstrate that the proposed algorithm not only has a better performance especially when the remainders have different error levels/variances, but also has a much lower computational complexity.

Description: Sparse signal restoration is usually formulated as the minimization of a quadratic cost function $Vert { mbi { y}} - { mbi { A}} { mbi { x}} Vert_{2}^{2}$ where $ { mbi { A}} $ is a dictionary and $ { mbi { x}} $ is an unknown sparse vector. It is well-known that imposing an $ell _{0}$ constraint leads to an NP-hard minimization problem. The convex relaxation approach has received considerable attention, where the $ell _{0}$ -norm is replaced by the $ell _{1}$ -norm. Among the many effective $ell _{1}$ solvers, the homotopy algorithm minimizes $Vert { mbi { y}} - { mbi { A}} { mbi { x}} Vert_{2}^{2}+lambda Vert { mbi { x}} Vert _{1}$ with respect to $ { mbi { x}} $ for a continuum of $lambda $ ’s. It is inspired by the piecewise regularity of the $ell _{1}$ -regularization path, also referred to as the homotopy path. In this paper, we address the minimization problem $Vert { mbi { y}} - { mbi { A}} { mbi { x}} Vert_{2}^{2}+lambda Vert { mbi { x}} Vert _{0}$ for a continuum of $lambda $ ’s and propose two heuristic search algorithms for $ell _{0}$ -homotopy. Continuation Single Best Replacement is a forward–backward greedy strategy extending the Single Best Replacement algorithm, previously proposed for $ell _{0}$ -minimization at a given $lambda $ . The adaptive search of the $lambda $ -values is inspired by $ell _{1}$ -homotopy. $ell _{0}$ Regularization Path Descent is a more complex algorithm exploiting the structural properties of the $ell _{0}$ -regularization path, which is piecewise constant with respect to $lambda $ . Both algorithms are empirically evaluated for difficult inverse problems involving ill-conditioned dictionaries. Finally, we show that they can be easily coupled with usual methods of model order selection.

Description: In recent work, robust Principal Components Analysis (PCA) has been posed as a problem of recovering a low-rank matrix ${bf L}$ and a sparse matrix ${bf S}$ from their sum, ${bf M}:= {bf L} + {bf S}$ and a provably exact convex optimization solution called PCP has been proposed. This work studies the following problem. Suppose that we have partial knowledge about the column space of the low rank matrix ${bf L}$ . Can we use this information to improve the PCP solution, i.e., allow recovery under weaker assumptions? We propose here a simple but useful modification of the PCP idea, called modified-PCP, that allows us to use this knowledge. We derive its correctness result which shows that, when the available subspace knowledge is accurate, modified-PCP indeed requires significantly weaker incoherence assumptions than PCP. Extensive simulations are also used to illustrate this. Comparisons with PCP and other existing work are shown for a stylized real application as well. Finally, we explain how this problem naturally occurs in many applications involving time series data, i.e., in what is called the online or recursive robust PCA problem. A corollary for this case is also given.

Description: Phased array is widely used in radar systems with its beam steering fixed in one direction for all ranges. Therefore, the range of a target cannot be determined within a single pulse when range ambiguity exists. In this paper, an unambiguous approach for joint range and angle estimation is devised for multiple-input multiple-output (MIMO) radar with frequency diverse array (FDA). Unlike the traditional phased array, FDA is capable of employing a small frequency increment across the array elements. Because of the frequency increment, the transmit steering vector of the FDA-MIMO radar is a function of both range and angle. As a result, the FDA-MIMO radar is able to utilize degrees-of-freedom in the range-angle domains to jointly determine the range and angle parameters of the target. In addition, the Cramér–Rao bounds for range and angle are derived, and the coupling between these two parameters is analyzed. Numerical results are presented to validate the effectiveness of the proposed approach.

Description: In this paper, we propose a novel single-group multicasting relay beamforming scheme. We assume a source that transmits common messages via multiple amplify-and-forward relays to multiple destinations. To increase the number of degrees of freedom in the beamforming design, the relays process two received signals jointly and transmit the Alamouti space-time block code over two different beams. Furthermore, in contrast to the existing relay multicasting scheme of the literature, we take into account the direct links from the source to the destinations. We aim to maximize the lowest received quality-of-service by choosing the proper relay weights and the ideal distribution of the power resources in the network. To solve the corresponding optimization problem, we propose an iterative algorithm which solves sequences of convex approximations of the original non-convex optimization problem. Simulation results demonstrate significant performance improvements of the proposed methods as compared with the existing relay multicasting scheme of the literature and an algorithm based on the popular semidefinite relaxation technique.

Description: In this paper, we propose a new class of iteratively re-weighted least squares (IRLS) for sparse recovery problems. The proposed methods are inspired by constrained maximum-likelihood estimation under a Gaussian scale mixture (GSM) distribution assumption. In the noise-free setting, we provide sufficient conditions ensuring the convergence of the sequences generated by these algorithms to the set of fixed points of the maps that rule their dynamics and derive conditions verifiable a posteriori for the convergence to a sparse solution. We further prove that these algorithms are quadratically fast in a neighborhood of a sparse solution. We show through numerical experiments that the proposed methods outperform classical IRLS for $ell_{tau}$ -minimization with $tauin(0,1]$ in terms of speed and of sparsity-undersampling tradeoff and are robust even in presence of noise. The simplicity and the theoretical guarantees provided in this paper make this class of algorithms an attractive solution for sparse recovery problems.

Description: We consider the problem of approximating optimal in the Minimum Mean Squared Error (MMSE) sense nonlinear filters in a discrete time setting, exploiting properties of stochastically convergent state process approximations. More specifically, we consider a class of nonlinear, partially observable stochastic systems, comprised by a (possibly nonstationary) hidden stochastic process (the state), observed through another conditionally Gaussian stochastic process (the observations). Under general assumptions, we show that, given an approximating process which, for each time step, is stochastically convergent to the state process, an approximate filtering operator can be defined, which converges to the true optimal nonlinear filter of the state in a strong and well defined sense. In particular, the convergence is compact in time and uniform in a completely characterized set of probability measure almost unity. The results presented in this paper can form a common basis for the analysis and characterization of a number of popular but heuristic approaches for approximating optimal nonlinear filters, such as approximate grid based techniques.

Description: A standard assumption for consistent estimation in the errors-in-variables setting is persistency of excitation of the noise-free input signal. We relax this assumption by considering data from multiple experiments. Consistency is obtained asymptotically as the number of experiments tends to infinity. The main theoretical and algorithmic difficulties are related to the growing number of to-be-estimated initial conditions. The method proposed in the paper is based on analytic elimination of the initial conditions and optimization over the remaining parameters. The resulting estimator is consistent; however, achieving asymptotically efficiency is an open problem.

Description: Bayesian filtering aims at estimating sequentially a hidden process from an observed one. In particular, sequential Monte Carlo (SMC) techniques propagate in time weighted trajectories which represent the posterior probability density function (pdf) of the hidden process given the available observations. On the other hand, conditional Monte Carlo (CMC) is a variance reduction technique which replaces the estimator of a moment of interest by its conditional expectation given another variable. In this paper, we show that up to some adaptations, one can make use of the time recursive nature of SMC algorithms in order to propose natural temporal CMC estimators of some point estimates of the hidden process, which outperform the associated crude Monte Carlo (MC) estimator whatever the number of samples. We next show that our Bayesian CMC estimators can be computed exactly, or approximated efficiently, in some hidden Markov chain (HMC) models; in some jump Markov state-space systems (JMSS); as well as in multitarget filtering. Finally our algorithms are validated via simulations.

Description: In this paper, cooperative sensor localization using asynchronous time-of-arrival measurements is investigated. It is well known that localization performance in wireless networks using time-based ranging or pseudo-ranging methods is greatly affected by the accuracy of the timing synchronization between the nodes involved in the estimation. Commonly, the original estimation problem is broken down into two subproblems, the synchronization problem and the localization problem, in what is known as a two-step approach. However, in this paper, the joint synchronization and localization problem is considered and examined for use in cooperative networks. It is discussed that the cooperation between the source nodes eliminates the need for high anchor node densities and improves localization performance significantly. Furthermore, the Cramér-Rao lower bounds (CRLB) and the maximum likelihood (ML) estimator are derived. It is shown that the ML estimator is highly nonlinear and nonconvex and must, therefore, be solved by using computationally complex algorithms. In order to reduce the complexity of the estimation, a novel semidefinite programming (SDP) relaxation method is developed by relaxing the original nonconvex ML problem, in such a way as to reformulate the estimation problem as a convex problem. The performance of the proposed SDP method is shown through computer simulations to nearly equal that of the ML estimator. The approach is also applied to the noncooperative case where it is found to be superior in performance than the previously proposed suboptimal estimators. Finally, complexity analyses are included for the estimators under consideration.

Description: In this paper, we consider the problem of parameter estimation over sensor networks in the presence of quantized data and directed communication links. We propose a two-stage distributed algorithm aiming at achieving the centralized sample mean estimate in a distributed manner. Different from the existing algorithms, a running average technique is utilized in the proposed algorithm to smear out the randomness caused by the probabilistic quantization scheme. With the running average technique, it is shown that the centralized sample mean estimate can be achieved both in the mean square and almost sure senses, which is not observed in the standard consensus algorithms. In addition, the rates of convergence are given to quantify the mean square and almost sure performances. Finally, simulation results are presented to illustrate the effectiveness of the proposed algorithm and highlight the improvements by using running average technique.

Description: This paper studies a pilot-assisted physical layer data fusion technique known as Distributed Co-Phasing (DCP). In this two-phase scheme, the sensors first estimate the channel to the fusion center (FC) using pilots sent by the latter; and then they simultaneously transmit their common data by pre-rotating them by the estimated channel phase, thereby achieving physical layer data fusion. First, by analyzing the symmetric mutual information of the system, it is shown that the use of higher order constellations (HOC) can improve the throughput of DCP compared to the binary signaling considered heretofore. Using an HOC in the DCP setting requires the estimation of the composite DCP channel at the FC for data decoding. To this end, two blind algorithms are proposed: 1) power method, and 2) modified $K$ -means algorithm. The latter algorithm is shown to be computationally efficient and converges significantly faster than the conventional $K$ -means algorithm. Analytical expressions for the probability of error are derived, and it is found that even at moderate to low SNRs, the modified $K$ -means algorithm achieves a probability of error comparable to that achievable with a perfect channel estimate at the FC, while requiring no pilot symbols to be transmitted from the sensor nodes. Also, the problem of signal corruption due to imperfect DCP is investigated, and constellation shaping to minimize the probability of signal corruption is proposed and analyzed. The analysis is validated, and the promising performance of DCP for energy-efficient physical layer data fusion is illustrated, using Monte Carlo simulations.

Description: In this paper we propose a fast and efficient Jacobi-like approach named JET (Joint Eigenvalue decomposition based on Triangular matrices) for the Joint EigenValue Decomposition (JEVD) of a set of real or complex non-defective matrices based on the LU factorization of the matrix of eigenvectors. Contrarily to classical Jacobi-like JEVD methods, the iterative procedure of the JET approach can be reduced to the search for only one of the two triangular matrices involved in the factorization of the matrix of eigenvectors, hence decreasing the numerical complexity. Two variants of the JET technique, namely JET-U and JET-O, which correspond to the optimization of two different cost functions are described in detail and these are extended to the complex case. Numerical simulations show that in many practical cases the JET approach provides more accurate estimation of the matrix of eigenvectors than its competitors and that the lowest numerical complexity is consistently achieved by the JET-U algorithm. In addition, we illustrate in the ICA context the interest of being able to solve efficiently the (non-orthogonal) JEVD problem. More particularly, based on our JET-U algorithm, we propose a more robust version of an existing ICA method, named MICAR-U. The identifiability of the latter is studied and proved under some conditions. Computer results given in the context of brain interfaces show the better ability of MICAR-U to denoise simulated electrocortical data compared to classical ICA techniques for low signal to noise ratio values.

Description: A new design for successive interference cancellation (SIC) detection for multiple-input multiple-output systems is introduced, and it is developed on the basis of the method of normal equations commonly used to solve the linear least squares problem. On the basis of this design, optimal-ordered and suboptimal-ordered SIC detection algorithms are derived. It is shown that the proposed optimal-ordered SIC detection algorithm offers a complexity reduction ratio of 1.11–1.25 compared to the fastest known optimal-ordered SIC detection algorithm for intermediate and large numbers of antennas and in terms of the average complexity. On the other hand, the proposed suboptimal-ordered SIC detection algorithm requires a lower complexity than the proposed optimal-ordered one and provides a bit-error-rate performance close to that of the optimal-ordered one and better than those of the other suboptimal-ordered SIC detection algorithms.

Description: We consider the problem of signal recovery on graphs. Graphs model data with complex structure as signals on a graph. Graph signal recovery recovers one or multiple smooth graph signals from noisy, corrupted, or incomplete measurements. We formulate graph signal recovery as an optimization problem, for which we provide a general solution through the alternating direction methods of multipliers. We show how signal inpainting, matrix completion, robust principal component analysis, and anomaly detection all relate to graph signal recovery and provide corresponding specific solutions and theoretical analysis. We validate the proposed methods on real-world recovery problems, including online blog classification, bridge condition identification, temperature estimation, recommender system for jokes, and expert opinion combination of online blog classification.

Description: In this paper, we investigate the network power minimization problem for the multicast cloud radio access network (Cloud-RAN) with imperfect channel state information (CSI). The key observation is that network power minimization can be achieved by adaptively selecting active remote radio heads (RRHs) via controlling the group-sparsity structure of the beamforming vector. However, this yields a non-convex combinatorial optimization problem, for which we propose a three-stage robust group sparse beamforming algorithm. In the first stage, a quadratic variational formulation of the weighted mixed $ell_1/ell_2$ -norm is proposed to induce the group-sparsity structure in the aggregated beamforming vector, which indicates those RRHs that can be switched off. A perturbed alternating optimization algorithm is then proposed to solve the resultant non-convex group-sparsity inducing optimization problem by exploiting its convex substructures. In the second stage, we propose a PhaseLift technique based algorithm to solve the feasibility problem with a given active RRH set, which helps determine the active RRHs. Finally, the semidefinite relaxation (SDR) technique is adopted to determine the robust multicast beamformers. Simulation results will demonstrate the convergence of the perturbed alternating optimization algorithm, as well as, the effectiveness of the proposed algorithm to minimize the network power consumption for multicast Cloud-RAN.

Description: Many machine learning frameworks, such as resource-allocating networks, kernel-based methods, Gaussian processes, and radial-basis-function networks, require a sparsification scheme in order to address the online learning paradigm. For this purpose, several online sparsification criteria have been proposed to restrict the model definition on a subset of samples. The most known criterion is the (linear) approximation criterion, which discards any sample that can be well represented by the already contributing samples, an operation with excessive computational complexity. Several computationally efficient sparsification criteria have been introduced in the literature with the distance and the coherence criteria. This paper provides a unified framework that connects these sparsification criteria in terms of approximating samples, by establishing theoretical bounds on the approximation errors. Furthermore, the error of approximating any pattern is investigated, by proposing upper bounds on the approximation error for each of the aforementioned sparsification criteria. Two classes of fundamental patterns are described in detail, the centroid (i.e., empirical mean) and the principal axes in the kernel principal component analysis. Experimental results show the relevance of the theoretical results established in this paper.

Description: The primary objective of the TanDEM-X mission is the generation of a global high-precision digital elevation model (DEM) by using synthetic aperture radar interferometry. This letter presents the developed strategy for estimating the relative height error of the TanDEM-X DEM on a global scale. The mosaicking process of the final DEM combines all acquisitions at full resolution and is expected to be finished by late 2016. On the other hand, global mosaics can be generated starting from quicklook images already available for each single input data take. These downsized mosaics are operationally used to analyze the performance improvement that can be achieved by combining multiple acquisitions over the same ground areas and are a powerful mean for optimizing further acquisition planning. This letter reports the expected global performance of the final TanDEM-X product in advance of the full-resolution DEM. Knowledge of the global status of the TanDEM-X DEM relative height error is fundamental for optimizing the acquisition strategy and, therefore, the final performance and represents a valuable input for the scientific community as well as for selecting suitable areas for further interferometric experiments on a global scale.

Description: Support vector machines (SVMs) have been applied to land cover classification, and a number of studies have demonstrated their ability to increase classification accuracy. The high correlation between the data set and SVM training model parameters indicates the high performance of the classification model. To improve the correlation, research has focused on the integration of SVMs and other algorithms for data set selection and SVM training model parameter estimation. This letter proposes a novel method, based on a particle filter (PF), of estimating SVM training model parameters according to an observation system. By treating the SVM training function as the observation system of the PF, the new method automatically updates the SVM training model parameters to values that are more appropriate for the data set and can provide a better classification model than can the original model, wherein the parameters are set by trial and error. Various experiments were conducted using Radarsat-2 synthetic aperture radar data from the 2011 Thailand flood. The proposed method provides superior performance and a more accurate analysis compared with the standard SVM.

Description: Maize is a widely planted crop in China and in other areas of the world and plays an important role in grain production. Monitoring the growth status of maize using remote sensing technology is an important component of precision agriculture and height, as a crucial growth indicator for maize, can be retrieved from light detection and ranging (LIDAR) data. However, height extraction for crops, such as maize using airborne laser scanning point clouds results in a great number of uncertainties and challenges. Here, airborne full-waveform LIDAR data were used to extract maize height. In the first step, a workflow was designed based on the Gold deconvolution algorithm combined with a basic data process technique. The method was then tested and was determined to be effective for capturing the portion of the waveform interacting with the tops of vegetation, characterized by lower amplitude stemming from the ground. Therefore, the number of second returns from point clouds was dramatically increased. During the experiment, the number of point clouds increased nearly 50% for three of the four maize plots, as compared with the original point clouds. Compared with the commonly used Gaussian fitting algorithm, the deconvolution algorithm had the advantage of extracting an accurate position for overlapping weak signals. The height percentiles indicated that the original and Gaussian decomposition derived point clouds data underestimated and deconvolution algorithm can accurately reflect the true height of maize, particularly for the 75% and 95% height percentiles.

Description: The Moderate Resolution Imaging Spectroradiometer (MODIS) is an important data set in global burned-area mapping. The MODIS global burned-area product has a coarse spatial resolution at approximately 500 m, which often introduces errors to the mapped burned areas. In this letter, a novel subpixel mapping (SPM) approach was proposed to produce burned-area maps at the fine spatial resolution similar to Landsat imagery, by exploring the spectral and spatial information provided by the second and fifth bands of MODIS. The proposed SPM approach aims to refine the estimate of burned areas, which have been detected by the MODIS global burned-area product. The performance of the proposed SPM approach was assessed with an experiment area containing six burned areas, by comparing with the MODIS burned-area product MCD45. The result shows that the average omission error decreased from 52.26% for MCD45 to 16.74% for SPM, and the average commission error decreased from 21.76% for MCD45 to 12.54% for SPM. The kappa value increased from 0.5583 for MCD45 to 0.8756 for SPM, indicating that the proposed SPM approach is effective in reducing the influence of the coarse spatial resolution of MODIS imagery in mapping a burned area and refining existing global burned-area products.

Description: Radiometric distortions caused by rugged terrain make the classification of forest types from satellite imagery a challenge. Various band-specific topographic normalization models are expected to eliminate or reduce these effects. The quality of these models also depends on the approach to estimate empirical parameters. Generally, a global estimation of these parameters from a whole satellite image is simple, but it may tend to overcorrection, particularly for larger areas. A land-cover-specific method usually performs better, but it requires obtaining a priori land classification, which presents another challenge in many cases. Empirical parameters can be directly estimated from local pixels in a given window. In this letter, we propose and evaluate a central-pixel-based parameter estimation method for topographic normalization using local window pixels. We tested the method with Landsat 8 imagery and the Advanced Spaceborne Thermal Emission and Reflection Radiometer Global Digital Elevation Model (ASTER GDEM) in very rough terrain with diverse forest types. Visual comparison and statistical analyses showed that the proposed method performed better at a range of window sizes compared with an uncorrected image or with a global parameter estimation approach. The intraclass spectral variability of each forest type has been reduced significantly, and it can yield higher accuracy of forest type classification. The proposed method does not require the a priori knowledge of land covers. Its simplicity and robustness suggest that this method has the potential to be a standard preprocessing approach for optical satellite imagery, particularly for rough terrain.

Description: We present a hierarchical grid-based, globally optimal tracking-by-detection approach to track an unknown number of targets in complex and dense scenarios, particularly addressing the challenges of complex interaction and mutual occlusion. Frame-by-frame detection is performed by hierarchical likelihood grids, matching shape templates through a fast oriented distance transform. To allow recovery from misdetections, common heuristics such as nonmaxima suppression within observations is eschewed. Within a discretized state-space, the data association problem is formulated as a grid-based network flow model, resulting in a convex problem casted into an integer linear programming form, giving a global optimal solution. In addition, we show how a behavior cue (body orientation) can be integrated into our association affinity model, providing valuable hints for resolving ambiguities between crossing trajectories. Unlike traditional motion-based approaches, we estimate body orientation by a hybrid methodology, which combines the merits of motion-based and 3D appearance-based orientation estimation, thus being capable of dealing also with still-standing or slowly moving targets. The performance of our method is demonstrated through experiments on a large variety of benchmark video sequences, including both indoor and outdoor scenarios.

Description: Many impulse noise (IN) reduction methods suffer from two obstacles, the improper noise detectors and imperfect filters they used. To address such issue, in this paper, a weighted couple sparse representation model is presented to remove IN. In the proposed model, the complicated relationships between the reconstructed and the noisy images are exploited to make the coding coefficients more appropriate to recover the noise-free image. Moreover, the image pixels are classified into clear, slightly corrupted, and heavily corrupted ones. Different data-fidelity regularizations are then accordingly applied to different pixels to further improve the denoising performance. In our proposed method, the dictionary is directly trained on the noisy raw data by addressing a weighted rank-one minimization problem, which can capture more features of the original data. Experimental results demonstrate that the proposed method is superior to several state-of-the-art denoising methods.

Description: The radix- $2^{k}$ algorithm plays a crucial role in the pipelined implementation of fast Fourier transform (FFT). This paper presents a fixed-point analysis and hardware evaluation of radix- $2^{k}$ FFT under the framework of the single-path delay feedback (SDF) and multi-path delay commutator (MDC) pipelined structure. The investigation is carried out with variable operating word-lengths to ensure the generality. Furthermore, the main streams to fulfill FFT coefficients weighting, namely, the approach using complex multipliers and the one adopting memoryless CORDIC units, are both considered in the analysis. Based on these derivations, a joint optimization of radix- $2^{k}$ algorithm and operating word-length is discussed to achieve a reasonable trade-off between computational accuracy and hardware expenditure. Simulations and experiments indicates that the derived SQNR is reliable to unfold the quantization effects of fixed-point radix- $2^{k}$ FFT. In addition, the proposed joint optimization strategy is capable of providing better solutions to implement the radix- $2^{k}$ FFT processor efficiently.

Description: In this paper, a hierarchical multi-task structural learning algorithm is developed to support large-scale plant species identification, where a visual tree is constructed for organizing large numbers of plant species in a coarse-to-fine fashion and determining the inter-related learning tasks automatically. For a given parent node on the visual tree, it contains a set of sibling coarse-grained categories of plant species or sibling fine-grained plant species, and a multi-task structural learning algorithm is developed to train their inter-related classifiers jointly for enhancing their discrimination power. The inter-level relationship constraint, e.g., a plant image must first be assigned to a parent node (high-level non-leaf node) correctly if it can further be assigned to the most relevant child node (low-level non-leaf node or leaf node) on the visual tree, is formally defined and leveraged to learn more discriminative tree classifiers over the visual tree. Our experimental results have demonstrated the effectiveness of our hierarchical multi-task structural learning algorithm on training more discriminative tree classifiers for large-scale plant species identification.

Description: In this paper, the quickest change detection problem is studied in two-state hidden Markov models (HMM), where the vector parameter $theta$ of the HMM changes from $theta_{0}$ to $theta_{1}$ at some unknown time, and one wants to detect the true change as quickly as possible while controlling the false alarm rate. It turns out that the generalized likelihood ratio (GLR) scheme, while theoretically straightforward, is generally computationally infeasible for the HMM. To develop efficient but computationally simple schemes for the HMM, we first discuss a subtlety in the recursive form of the generalized likelihood ratio (GLR) scheme for the HMM. Then we show that the recursive CUSUM scheme proposed in Fuh (Ann. Statist., 2003) can be regarded as a quasi-GLR scheme for pseudo post-change hypotheses with certain dependence structure between pre- and postchange observations. Next, we extend the quasi-GLR idea to propose recursive score schemes in the scenario when the postchange parameter $theta_{1}$ of the HMM involves a real-valued nuisance parameter. Finally, the Kullback-Leibler (KL) divergence plays an essential role in the quickest change detection problem and many other fields, however it is rather challenging to numerically compute it in HMMs. Here we develop a non-Monte Carlo method that computes the KL divergence of two-state HMMs via the underlying invariant probability measure, which is characterized by the Fredholm integral equation. Numerical study demonstrates an unusual property of the KL divergence for HMM that implies the severe effects of misspecifying the postchange parameter for the HMM.

Description: Many methods have been developed to detect damaged buildings due to earthquake. However, little attention has been paid to analyze slightly affected buildings. In this letter, an unsupervised method is presented to detect earthquake-triggered “ roof-holes ” on rural houses from unmanned aerial vehicle (UAV) images. First, both orthomosaic and gradient images are generated from a set of UAV images. Then, a modified Chinese restaurant franchise model is used to learn an unsupervised model of the geo-object classes in the area by fusing both oversegmented orthomosaic and gradient images. Finally, “roof-holes” on rural houses are detected using the learned model. The performance of the proposed method is evaluated in terms of both qualitative and quantitative indexes.

Description: Automatic target generation process (ATGP) has been used in a wide range of applications in hyperspectral image analysis. It performs a sequence of orthogonal subspace projections to extract potential targets of interest. This letter presents a recursive version of the ATGP, which is referred to as the recursive ATGP (RATGP) and has three advantages over the ATGP as follows: 1) there is no need of inverting a matrix as the ATGP does for finding each new target; 2) there is a significant reduction in the computational complexity in the hardware design due to its recursive structure; and 3) there is an automatic stopping rule that can be derived by the Neyman–Pearson detection theory to terminate the algorithm.

Description: In this letter, we propose a novel automatic algorithm for road extraction from remote sensing images. The algorithm includes low- and high-level processing. In the low-level processing, we determine a normalized second derivative map of road profiles of a generalized bar shape, which is width invariant and contrast proportional, and accordingly obtain initial road center pixels. In the high-level processing, using the map and initial center pixels, we initially determine road segments. The segments are then locally refined using their orientation randomness and length-to-width ratio and further refined via global graph-cut optimization. A final road network is thereby extracted in a robust manner. Experimental results demonstrate that the proposed algorithm provides noticeably more robust and higher road extraction performance in various images compared with the existing algorithms.

Description: Remote sensing images often need to be coded and/or transmitted with constrained computational resources. Among other features, such images commonly have high spatial, spectral, and bit-depth resolution, which may render difficult their handling. This letter introduces an embedded quantization scheme based on two-step scalar deadzone quantization (2SDQ) that enhances the quality of transmitted images when coded with a constrained number of bits. The proposed scheme is devised for use in JPEG2000. It is named cell-based 2SDQ since it uses cells, i.e., small sets of wavelet coefficients within the codeblocks defined by JPEG2000. Cells permit a finer discrimination of coefficients in which to apply the proposed quantizer. Experimental results indicate that the proposed scheme is especially beneficial for high bit-depth hyperspectral images.

Description: High suspended solid (SS) concentrations in coastal waters are aesthetically undesirable, and adversely affect fisheries and coastal ecosystems. Environmental agencies usually require frequent measurements of SS over coastal regions at a spatially detailed level for water quality assessment and control. To develop a method for SS estimation in the complex coastal waters of Hong Kong, an archive of 57 Landsat Thematic Mapper (TM), Enhanced Thematic Mapper Plus (ETM+), and HJ-1 A/B Charged Couple Device (CCD) images over a 13-year period from January 2000 to December 2012 was used. Atmospherically corrected Landsat TM/ETM+ and HJ-1 A/B CCD bands 1–4 along with 240 in situ field samples of SS concentration collected within 2 h of image acquisition, were used to develop and validate regression models over a wide range of SS concentrations from 0.5–56.0 mg/L. The best representation of actual SS concentrations was given by the log-transformed combination of Band 2 (Green, 0.52–0.60 $mumbox{m}$ ) and Band 3 (Red, 0.63–0.69 $mumbox{m} $ ), with correlation coefficient (R) of 0.85, root-mean-square error of 2.60 mg/L and mean absolute error of 2.04 mg/L. This is attributed to the sensitivity of SS to green and red wavelengths specific to the characteristic refractive index and grain size of SS found in Hong Kong waters. This letter is considered more robust than previous studies, due to the much larger number of images and in situ samples used for model development and validation, as well as the different times of year and wide range of SS concentrations investigated.

Description: The quantitative estimation of the fractional cover of carbonate rock (CR) is critical for natural resource management and ecological conservation in karst areas. Based on the analysis of spectral properties of CR together with other land cover types, we proposed two CR indices (CRIs) and established the model that represents the relationships between the CRIs and the fractional cover of CR. Then, the fractional cover of CR was estimated by using the developed model. Experimental results on Landsat-8 Operational Land Imager images acquired at Southwestern China demonstrated the effectiveness of the developed model. Compared with other indices, the proposed CRIs show the highest correlations with the fractional cover of CR.

Description: Convex optimization is a powerful tool for resource allocation and signal processing in wireless networks. As the network density is expected to drastically increase in order to accommodate the exponentially growing mobile data traffic, performance optimization problems are entering a new era characterized by a high dimension and/or a large number of constraints, which poses significant design and computational challenges. In this paper, we present a novel two-stage approach to solve large-scale convex optimization problems for dense wireless cooperative networks, which can effectively detect infeasibility and enjoy modeling flexibility. In the proposed approach, the original large-scale convex problem is transformed into a standard cone programming form in the first stage via matrix stuffing, which only needs to copy the problem parameters such as channel state information (CSI) and quality-of-service (QoS) requirements to the prestored structure of the standard form. The capability of yielding infeasibility certificates and enabling parallel computing is achieved by solving the homogeneous self-dual embedding of the primal-dual pair of the standard form. In the solving stage, the operator splitting method, namely, the alternating direction method of multipliers (ADMM), is adopted to solve the large-scale homogeneous self-dual embedding. Compared with second-order methods, ADMM can solve large-scale problems in parallel with modest accuracy within a reasonable amount of time. Simulation results will demonstrate the speedup, scalability, and reliability of the proposed framework compared with the state-of-the-art modeling frameworks and solvers.

Description: This paper proposes a two-stage texture synthesis algorithm. At the first stage, a structure tensor map carrying information about the local orientation is synthesized from the exemplar’s data and used at the second stage to constrain the synthesis of the texture. Keeping in mind that the algorithm should be able to reproduce as faithfully as possible the visual aspect, statistics, and morphology of the input sample, the method is tested on various textures and compared objectively with existing methods, highlighting its strength in successfully synthesizing the output texture in many situations where traditional algorithms fail to reproduce the exemplar’s patterns. The promising results pave the way towards the synthesis of accurately large and multi-scale patterns as it is the case for carbon material samples showing laminar structures, for example.

Description: An image search reranking (ISR) technique aims at refining text-based search results by mining images’ visual content. Feature extraction and ranking function design are two key steps in ISR. Inspired by the idea of hypersphere in one-class classification, this paper proposes a feature extraction algorithm named hypersphere-based relevance preserving projection (HRPP) and a ranking function called hypersphere-based rank (H-Rank). Specifically, an HRPP is a spectral embedding algorithm to transform an original high-dimensional feature space into an intrinsically low-dimensional hypersphere space by preserving the manifold structure and a relevance relationship among the images. An H-Rank is a simple but effective ranking algorithm to sort the images by their distances to the hypersphere center. Moreover, to capture the user’s intent with minimum human interaction, a reversed $k$ -nearest neighbor (KNN) algorithm is proposed, which harvests enough pseudorelevant images by requiring that the user gives only one click on the initially searched images. The HRPP method with reversed KNN is named one-click-based HRPP (OC-HRPP). Finally, an OC-HRPP algorithm and the H-Rank algorithm form a new ISR method, H-reranking. Extensive experimental results on three large real-world data sets show that the proposed algorithms are effective. Moreover, the fact that only one relevant image is required to be labeled makes it has a strong practical significance.

Description: The discrete cosine transform (DCT) is known to be asymptotically equivalent to the Karhunen-Loève transform (KLT) of Gaussian first-order auto-regressive (AR(1)) processes. Since being uncorrelated under the Gaussian hypothesis is synonymous with independence, it also yields an independent-component analysis (ICA) of such signals. In this paper, we present a constructive non-Gaussian generalization of this result: the characterization of the optimal orthogonal transform (ICA) for the family of symmetric- $alpha$ -stable AR(1) processes. The degree of sparsity of these processes is controlled by the stability parameter $0 〈 alphaleq2$ with the only non-sparse member of the family being the classical Gaussian AR(1) process with $alpha=2$ . Specifically, we prove that, for $alpha 〈 2$ , a fixed family of operator-like wavelet bases systematically outperforms the DCT in terms of compression and denoising ability. The effect is quantified with the help of two performance criteria (one based on the Kullback-Leibler divergence, and the other on Stein’s formula for the minimum estimation error) that can also be viewed as statistical measures of independence. Finally, we observe that, for the sparser kind of processes with $0 〈 alphaleq 1$ , the operator-like wavelet basis, as dictated by linear system theory, is undistinguishable from the ICA solution obtained through numerical optimization. Our framework offers a unified view that encompasses sinusoidal transforms such as the DCT and a family of orthogonal Haar-like wavelets that is linked analytically to the underlying signal model.

Description: In this paper, we propose a novel method for image fusion with a high-resolution panchromatic image and a low-resolution multispectral (Ms) image at the same geographical location. The fusion is formulated as a convex optimization problem which minimizes a linear combination of a least-squares fitting term and a dynamic gradient sparsity regularizer. The former is to preserve accurate spectral information of the Ms image, while the latter is to keep sharp edges of the high-resolution panchromatic image. We further propose to simultaneously register the two images during the fusing process, which is naturally achieved by virtue of the dynamic gradient sparsity property. An efficient algorithm is then devised to solve the optimization problem, accomplishing a linear computational complexity in the size of the output image in each iteration. We compare our method against six state-of-the-art image fusion methods on Ms image data sets from four satellites. Extensive experimental results demonstrate that the proposed method substantially outperforms the others in terms of both spatial and spectral qualities. We also show that our method can provide high-quality products from coarsely registered real-world IKONOS data sets. Finally, a MATLAB implementation is provided to facilitate future research.

Description: Automatic fluorescent particle tracking is an essential task to study the dynamics of a large number of biological structures at a sub-cellular level. We have developed a probabilistic particle tracking approach based on multi-scale detection and two-step multi-frame association. The multi-scale detection scheme allows coping with particles in close proximity. For finding associations, we have developed a two-step multi-frame algorithm, which is based on a temporally semiglobal formulation as well as spatially local and global optimization. In the first step, reliable associations are determined for each particle individually in local neighborhoods. In the second step, the global spatial information over multiple frames is exploited jointly to determine optimal associations. The multi-scale detection scheme and the multi-frame association finding algorithm have been combined with a probabilistic tracking approach based on the Kalman filter. We have successfully applied our probabilistic tracking approach to synthetic as well as real microscopy image sequences of virus particles and quantified the performance. We found that the proposed approach outperforms previous approaches.

Description: In this paper, we propose a novel model, a discriminatively learned iterative shrinkage (DLIS) model, for color image denoising. The DLIS is a generalization of wavelet shrinkage by iteratively performing shrinkage over patch groups and whole image aggregation. We discriminatively learn the shrinkage functions and basis from the training pairs of noisy/noise-free images, which can adaptively handle different noise characteristics in luminance/chrominance channels, and the unknown structured noise in real-captured color images. Furthermore, to remove the splotchy real color noises, we design a Laplacian pyramid-based denoising framework to progressively recover the clean image from the coarsest scale to the finest scale by the DLIS model learned from the real color noises. Experiments show that our proposed approach can achieve the state-of-the-art denoising results on both synthetic denoising benchmark and real-captured color images.

Description: In cross-view action recognition, what you saw in one view is different from what you recognize in another view, since the data distribution even the feature space can change from one view to another. In this paper, we address the problem of transferring action models learned in one view (source view) to another different view (target view), where action instances from these two views are represented by heterogeneous features. A novel learning method, called heterogeneous transfer discriminant-analysis of canonical correlations (HTDCC), is proposed to discover a discriminative common feature space for linking source view and target view to transfer knowledge between them. Two projection matrices are learned to, respectively, map data from the source view and the target view into a common feature space via simultaneously minimizing the canonical correlations of interclass training data, maximizing the canonical correlations of intraclass training data, and reducing the data distribution mismatch between the source and target views in the common feature space. In our method, the source view and the target view neither share any common features nor have any corresponding action instances. Moreover, our HTDCC method is capable of handling only a few or even no labeled samples available in the target view, and can also be easily extended to the situation of multiple source views. We additionally propose a weighting learning framework for multiple source views adaptation to effectively leverage action knowledge learned from multiple source views for the recognition task in the target view. Under this framework, different source views are assigned different weights according to their different relevances to the target view. Each weight represents how contributive the corresponding source view is to the target view. Extensive experiments on the IXMAS data set demonstrate the effectiveness of HTDCC on learning the common feature space for heterogeneous cross-view action rec- gnition. In addition, the weighting learning framework can achieve promising results on automatically adapting multiple transferred source-view knowledge to the target view.

Description: A complete encoding solution for efficient intra-based depth map compression is proposed in this paper. The algorithm, denominated predictive depth coding (PDC), was specifically developed to efficiently represent the characteristics of depth maps, mostly composed by smooth areas delimited by sharp edges. At its core, PDC involves a directional intra prediction framework and a straightforward residue coding method, combined with an optimized flexible block partitioning scheme. In order to improve the algorithm in the presence of depth edges that cannot be efficiently predicted by the directional modes, a constrained depth modeling mode, based on explicit edge representation, was developed. For residue coding, a simple and low complexity approach was investigated, using constant and linear residue modeling, depending on the prediction mode. The performance of the proposed intra depth map coding approach was evaluated based on the quality of the synthesized views using the encoded depth maps and original texture views. The experimental tests based on all intra configuration demonstrated the superior rate-distortion performance of PDC, with average bitrate savings of 6%, when compared with the current state-of-the-art intra depth map coding solution present in the 3D extension of a high-efficiency video coding (3D-HEVC) standard. By using view synthesis optimization in both PDC and 3D-HEVC encoders, the average bitrate savings increase to 14.3%. This suggests that the proposed method, without using transform-based residue coding, is an efficient alternative to the current 3D-HEVC algorithm for intra depth map coding.

Description: MUSIC is a popular algorithm for estimating the direction of arrival (DOA) in array signal processing applications. In this paper, we analyze the performance of the MUSIC algorithm for a single source system, in the presence of noisy and missing data (when only a random subset of the entries in the data matrix are observed). We prove consistency of the DOA estimate when signal from a single source is impinging on low coherence arrays, and derive an analytic expression for the mean-squared-error (MSE) performance of MUSIC for the case of uniform linear arrays, in the large array and relatively large sample setting. Our analysis is mathematically justified in both the sample rich and deficient regimes. The expression for the MSE is a simple function of array geometry, signal-to-noise ratio (SNR), the fraction of entries observed, and the ratio of the number of sensors to number of snapshots. We derive a phase transition threshold which separates a regime where MUSIC is consistent from a regime where MUSIC is inconsistent. This threshold depends upon the SNR, the probability of observing entries in the data matrix, and number of sensors and snapshots in a simple manner which we make explicit.

Description: Phase retrieval problems involve solving linear equations, but with missing sign (or phase, for complex numbers) information. More than four decades after it was first proposed, the seminal error reduction algorithm of Gerchberg and Saxton and Fienup is still the popular choice for solving many variants of this problem. The algorithm is based on alternating minimization; i.e., it alternates between estimating the missing phase information, and the candidate solution. Despite its wide usage in practice, no global convergence guarantees for this algorithm are known. In this paper, we show that a (resampling) variant of this approach converges geometrically to the solution of one such problem—finding a vector $bf x$ from ${bf y}, {bf A}$ , where ${bf y} = vert {bf A}^T{bf x}vert$ and $vert{bf z}vert$ denotes a vector of element-wise magnitudes of ${bf z}$ —under the assumption that $ {bf A}$ is Gaussian. Empirically, we demonstrate that alternating minimization performs similar to recently proposed convex techniques for this problem (which are based on “lifting” to a convex matrix problem) in sample complexity and robustness to noise. However, it is much more efficient and can scale to large problems. Analytically, for a resampling version of alternating minimization, we show geometric convergence to the solution, and sample complexity that is off by log factors from obvious lower bounds. We also establish close to optimal scaling for the case when the unknown vector is sparse. Our work represents the first theoretical guarantee for al- ernating minimization (albeit with resampling) for any variant of phase retrieval problems in the non-convex setting.