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: 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: 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: 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: 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: 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: 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: 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: 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: 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: Person re-identification aims to match people across non-overlapping camera views, which is an important but challenging task in video surveillance. In order to obtain a robust metric for matching, metric learning has been introduced recently. Most existing works focus on seeking a Mahalanobis distance by employing sparse pairwise constraints, which utilize image pairs with the same person identity as positive samples, and select a small portion of those with different identities as negative samples. However, this training strategy has abandoned a large amount of discriminative information, and ignored the relative similarities. In this paper, we propose a novel relevance metric learning method with listwise constraints (RMLLCs) by adopting listwise similarities, which consist of the similarity list of each image with respect to all remaining images. By virtue of listwise similarities, RMLLC could capture all pairwise similarities, and consequently learn a more discriminative metric by enforcing the metric to conserve predefined similarity lists in a low-dimensional projection subspace. Despite the performance enhancement, RMLLC using predefined similarity lists fails to capture the relative relevance information, which is often unavailable in practice. To address this problem, we further introduce a rectification term to automatically exploit the relative similarities, and develop an efficient alternating iterative algorithm to jointly learn the optimal metric and the rectification term. Extensive experiments on four publicly available benchmarking data sets are carried out and demonstrate that the proposed method is significantly superior to the state-of-the-art approaches. The results also show that the introduction of the rectification term could further boost the performance of RMLLC.

Description: Tomographic iterative reconstruction methods need a very thorough modeling of data. This point becomes critical when the number of available projections is limited. At the core of this issue is the projector design, i.e., the numerical model relating the representation of the object of interest to the projections on the detector. Voxel driven and ray driven projection models are widely used for their short execution time in spite of their coarse approximations. Distance driven model has an improved accuracy but makes strong approximations to project voxel basis functions. Cubic voxel basis functions are anisotropic, accurately modeling their projection is, therefore, computationally expensive. Both smoother and more isotropic basis functions better represent the continuous functions and provide simpler projectors. These considerations have led to the development of spherically symmetric volume elements, called blobs. Set apart their isotropy, blobs are often considered too computationally expensive in practice. In this paper, we consider using separable B-splines as basis functions to represent the object, and we propose to approximate the projection of these basis functions by a 2D separable model. When the degree of the B-splines increases, their isotropy improves and projections can be computed regardless of their orientation. The degree and the sampling of the B-splines can be chosen according to a tradeoff between approximation quality and computational complexity. We quantitatively measure the good accuracy of our model and compare it with other projectors, such as the distance-driven and the model proposed by Long et al. From the numerical experiments, we demonstrate that our projector with an improved accuracy better preserves the quality of the reconstruction as the number of projections decreases. Our projector with cubic B-splines requires about twice as many operations as a model based on voxel basis functions. Higher accuracy projectors can be used to - mprove the resolution of the existing systems, or to reduce the number of projections required to reach a given resolution, potentially reducing the dose absorbed by the patient.

Description: Despite important recent advances, the vulnerability of biometric systems to spoofing attacks is still an open problem. Spoof attacks occur when impostor users present synthetic biometric samples of a valid user to the biometric system seeking to deceive it. Considering the case of face biometrics, a spoofing attack consists in presenting a fake sample (e.g., photograph, digital video, or even a 3D mask) to the acquisition sensor with the facial information of a valid user. In this paper, we introduce a low cost and software-based method for detecting spoofing attempts in face recognition systems. Our hypothesis is that during acquisition, there will be inevitable artifacts left behind in the recaptured biometric samples allowing us to create a discriminative signature of the video generated by the biometric sensor. To characterize these artifacts, we extract time-spectral feature descriptors from the video, which can be understood as a low-level feature descriptor that gathers temporal and spectral information across the biometric sample and use the visual codebook concept to find mid-level feature descriptors computed from the low-level ones. Such descriptors are more robust for detecting several kinds of attacks than the low-level ones. The experimental results show the effectiveness of the proposed method for detecting different types of attacks in a variety of scenarios and data sets, including photos, videos, and 3D masks.

Description: Target representation is a necessary component for a robust tracker. However, during tracking, many complicated factors may make the accumulated errors in the representation significantly large, leading to tracking drift. This paper aims to improve the robustness of target representation to avoid the influence of the accumulated errors, such that the tracker only acquires the information that facilitates tracking and ignores the distractions. We observe that the locally mutual relations between the feature observations of temporally obtained targets are beneficial to the subspace representation in visual tracking. Thus, we propose a novel subspace learning algorithm for visual tracking, which imposes joint row-wise sparsity structure on the target subspace to adaptively exclude distractive information. The sparsity is induced by exploiting the locally mutual relations between the feature observations during learning. To this end, we formulate tracking as a subspace sparsity inducing problem. A large number of experiments on various challenging video sequences demonstrate that our tracker outperforms many other state-of-the-art trackers.

Description: Color-to-gray (C2G) image conversion is the process of transforming a color image into a grayscale one. Despite its wide usage in real-world applications, little work has been dedicated to compare the performance of C2G conversion algorithms. Subjective evaluation is reliable but is also inconvenient and time consuming. Here, we make one of the first attempts to develop an objective quality model that automatically predicts the perceived quality of C2G converted images. Inspired by the philosophy of the structural similarity index, we propose a C2G structural similarity (C2G-SSIM) index, which evaluates the luminance, contrast, and structure similarities between the reference color image and the C2G converted image. The three components are then combined depending on image type to yield an overall quality measure. Experimental results show that the proposed C2G-SSIM index has close agreement with subjective rankings and significantly outperforms existing objective quality metrics for C2G conversion. To explore the potentials of C2G-SSIM, we further demonstrate its use in two applications: 1) automatic parameter tuning for C2G conversion algorithms and 2) adaptive fusion of C2G converted images.

Description: In this paper, we propose a skin classification method exploiting faces and bodies automatically detected in the image, to adaptively initialize individual ad hoc skin classifiers. Each classifier is initialized by a face and body couple or by a single face, if no reliable body is detected. Thus, the proposed method builds an ad hoc skin classifier for each person in the image, resulting in a classifier less dependent from changes in skin color due to tan levels, races, genders, and illumination conditions. The experimental results on a heterogeneous data set of labeled images show that our proposal outperforms the state-of-the-art methods, and that this improvement is statistically significant.

Description: Local binary descriptors are attracting increasingly attention due to their great advantages in computational speed, which are able to achieve real-time performance in numerous image/vision applications. Various methods have been proposed to learn data-dependent binary descriptors. However, most existing binary descriptors aim overly at computational simplicity at the expense of significant information loss which causes ambiguity in similarity measure using Hamming distance. In this paper, by considering multiple features might share complementary information, we present a novel local binary descriptor, referred as ring-based multi-grouped descriptor (RMGD), to successfully bridge the performance gap between current binary and floated-point descriptors. Our contributions are twofold. First, we introduce a new pooling configuration based on spatial ring-region sampling, allowing for involving binary tests on the full set of pairwise regions with different shapes, scales, and distances. This leads to a more meaningful description than the existing methods which normally apply a limited set of pooling configurations. Then, an extended Adaboost is proposed for an efficient bit selection by emphasizing high variance and low correlation, achieving a highly compact representation. Second, the RMGD is computed from multiple image properties where binary strings are extracted. We cast multi-grouped features integration as rankSVM or sparse support vector machine learning problem, so that different features can compensate strongly for each other, which is the key to discriminativeness and robustness. The performance of the RMGD was evaluated on a number of publicly available benchmarks, where the RMGD outperforms the state-of-the-art binary descriptors significantly.

Description: Palmprint recognition (PR) is an effective technology for personal recognition. A main problem, which deteriorates the performance of PR, is the deformations of palmprint images. This problem becomes more severe on contactless occasions, in which images are acquired without any guiding mechanisms, and hence critically limits the applications of PR. To solve the deformation problems, in this paper, a model for non-linearly deformed palmprint matching is derived by approximating non-linear deformed palmprint images with piecewise-linear deformed stable regions. Based on this model, a novel approach for deformed palmprint matching, named key point-based block growing (KPBG), is proposed. In KPBG, an iterative M-estimator sample consensus algorithm based on scale invariant feature transform features is devised to compute piecewise-linear transformations to approximate the non-linear deformations of palmprints, and then, the stable regions complying with the linear transformations are decided using a block growing algorithm. Palmprint feature extraction and matching are performed over these stable regions to compute matching scores for decision. Experiments on several public palmprint databases show that the proposed models and the KPBG approach can effectively solve the deformation problem in palmprint verification and outperform the state-of-the-art methods.

Description: Nonnegative Tucker decomposition (NTD) is a powerful tool for the extraction of nonnegative parts-based and physically meaningful latent components from high-dimensional tensor data while preserving the natural multilinear structure of data. However, as the data tensor often has multiple modes and is large scale, the existing NTD algorithms suffer from a very high computational complexity in terms of both storage and computation time, which has been one major obstacle for practical applications of NTD. To overcome these disadvantages, we show how low (multilinear) rank approximation (LRA) of tensors is able to significantly simplify the computation of the gradients of the cost function, upon which a family of efficient first-order NTD algorithms are developed. Besides dramatically reducing the storage complexity and running time, the new algorithms are quite flexible and robust to noise, because any well-established LRA approaches can be applied. We also show how nonnegativity incorporating sparsity substantially improves the uniqueness property and partially alleviates the curse of dimensionality of the Tucker decompositions. Simulation results on synthetic and real-world data justify the validity and high efficiency of the proposed NTD algorithms.

Description: The problem of estimating the parameters of a Rayleigh-Rice mixture density is often encountered in image analysis (e.g., remote sensing and medical image processing). In this paper, we address this general problem in the framework of change detection (CD) in multitemporal and multispectral images. One widely used approach to CD in multispectral images is based on the change vector analysis. Here, the distribution of the magnitude of the difference image can be theoretically modeled by a Rayleigh-Rice mixture density. However, given the complexity of this model, in applications, a Gaussian-mixture approximation is often considered, which may affect the CD results. In this paper, we present a novel technique for parameter estimation of the Rayleigh-Rice density that is based on a specific definition of the expectation-maximization algorithm. The proposed technique, which is characterized by good theoretical properties, iteratively updates the parameters and does not depend on specific optimization routines. Several numerical experiments on synthetic data demonstrate the effectiveness of the method, which is general and can be applied to any image processing problem involving the Rayleigh-Rice mixture density. In the CD context, the Rayleigh-Rice model (which is theoretically derived) outperforms other empirical models. Experiments on real multitemporal and multispectral remote sensing images confirm the validity of the model by returning significantly higher CD accuracies than those obtained by using the state-of-the-art approaches.

Description: In this paper, we propose a very simple deep learning network for image classification that is based on very basic data processing components: 1) cascaded principal component analysis (PCA); 2) binary hashing; and 3) blockwise histograms. In the proposed architecture, the PCA is employed to learn multistage filter banks. This is followed by simple binary hashing and block histograms for indexing and pooling. This architecture is thus called the PCA network (PCANet) and can be extremely easily and efficiently designed and learned. For comparison and to provide a better understanding, we also introduce and study two simple variations of PCANet: 1) RandNet and 2) LDANet. They share the same topology as PCANet, but their cascaded filters are either randomly selected or learned from linear discriminant analysis. We have extensively tested these basic networks on many benchmark visual data sets for different tasks, including Labeled Faces in the Wild (LFW) for face verification; the MultiPIE, Extended Yale B, AR, Facial Recognition Technology (FERET) data sets for face recognition; and MNIST for hand-written digit recognition. Surprisingly, for all tasks, such a seemingly naive PCANet model is on par with the state-of-the-art features either prefixed, highly hand-crafted, or carefully learned [by deep neural networks (DNNs)]. Even more surprisingly, the model sets new records for many classification tasks on the Extended Yale B, AR, and FERET data sets and on MNIST variations. Additional experiments on other public data sets also demonstrate the potential of PCANet to serve as a simple but highly competitive baseline for texture classification and object recognition.

Description: This paper considers the problem of emitter location in the presence of an adversary able to inject false information, where both the viewpoints of the adversary and locating network are considered. We begin by developing adversary strategies, which focus on degrading and redirecting the locating network. The locating network uses the time difference of arrival (TDOA) method and estimates the emitter location using both nonlinear least squares (LS) and the robust least median squares (LMS). Specifically, we determine the false sensor position the adversary should inject that maximally impacts the locating network by 1) minimizing the network???s accuracy, and 2) redirecting the network???s emitter location estimate. Similarly, we formulate a network???s strategy for detecting the adversary???s injection and develop a detector able to determine its presence under both adversary strategies. We present both theoretical and numerical results illustrating the effectiveness of the developed strategies.

Description: Delay/disruption tolerant networking (DTN) offers a solution to communications in ???challenged??? networks. Some work has been seen in evaluating the performance of DTN protocols based on simulated or emulated file transfer experiments. However, there is a need for a model of the performance of the DTN Licklider transmission protocol (LTP), which particularly targets reliable data transmission in deep space. In this paper, we present a performance model of LTP-based DTN data transmission in challenging communications characterized by extremely long signal propagation delay, lengthy link disruptions, and highly lossy channels that are typical of deep-space links. The model is verified by file-transfer experiments using a PC-based testbed.

Description: Modeling of the dynamics and disturbances and designing of the precise formation controller are two major problems for the inner-formation flying system (IFFS). This paper introduces a nonlinear, nonautonomous formation dynamics model for IFFS in a general elliptic orbit. This model integrates the newly developed formation dynamics and the detailed disturbance models, including atmospheric drag, solar radiation pressure, and J2 effects. Furthermore, this paper establishes a coupled self-gravitational attraction model for IFFS. After considering such a comprehensive dynamics model, the precise formation control problem of IFFS is researched in detail. By referring to the averaging system, Hurwitz matrix, Lyapunov stability theorem, Matrosov???s theory, and Barbalat???s lemma as preliminaries, four possible controllers are designed, i.e., feedback-linearization plus proportional-derivative (PD) controller, Lyapunov-based controller, virtual potential-based controller, and velocity-free virtual potential-based controller. These controllers are all analyzed by the corresponding stability theories. Some simulations are carried out to testify these controllers, and the results show the effectiveness. By comparing the convergence time and fuel consumption, the velocity-free virtual potential-based controller is proven to be a more advantageous controller.

Description: The fuel-optimal control problem of soft landing becomes a significant challenge due to the highly irregular gravitational field of an asteroid. An indirect method is used to deal with this fuel-optimal control problem. The difficult bang-bang control problem caused by the indirect method is solved through an improved fast homotopic approach. To validate the advanced homotopic method, the landing site is selected in a region where the gravitational field is especially irregular. The results show that this method is effective for the fuel-optimal control problem in an irregular gravitational field. Moreover, the trajectory designed with the fuel-optimal control is taken as a nominal descent trajectory for a sliding mode control. Monte Carlo simulations show that the desired soft landing can be achieved by tracking the fuel-optimal trajectory.

Description: In this paper, a novel framework of sparse kernel learning for support vector data description (SVDD) based anomaly detection is presented. By introducing 0-1 control variables to original features in the input space, sparse feature selection for anomaly detection is modeled as a mixed integer programming problem. Due to the prohibitively high computational complexity, it is relaxed into a quadratically constrained linear programming (QCLP) problem. The QCLP problem can then be practically solved by using an iterative optimization method, in which multiple subsets of features are iteratively found as opposed to a single subset. However, when a nonlinear kernel such as Gaussian radial basis function kernel, associated with an infinite-dimensional reproducing kernel Hilbert space (RKHS) is used in the QCLP-based iterative optimization, it is impractical to find optimal subsets of features due to a large number of possible combinations of the original features. To tackle this issue, a feature map called the empirical kernel map, which maps data points in the input space into a finite space called the empirical kernel feature space (EKFS), is used in the proposed work. The QCLP-based iterative optimization problem is solved in the EKFS instead of in the input space or the RKHS. This is possible because the geometrical properties of the EKFS and the corresponding RKHS remain the same. Now, an explicit nonlinear exploitation of the data in a finite EKFS is achievable, which results in optimal feature ranking. Comprehensive experimental results on three hyperspectral images and several machine learning datasets show that our proposed method can provide improved performance over the current state-of-the-art techniques.

Description: This paper deals with the swath acquisition planning problem for multisatellite Earth observation missions. Given a set of satellites and a mission time frame, the problem we solve consists of selecting a set of acquisitions from the satellites in order to cover a given region of interest during the requested time frame, optimizing a certain objective function.We show that the planning problem can be modeled as a set covering problem, using basic tools of mathematical programming. The formulation of the model requires the solution of a complex computational geometry problem, and therefore the use of heuristics and metaheuristics applies. In this paper, we discuss the efficiency of the constructive phase of a greedy randomized adaptive search procedure algorithm. Computational results comparing the heuristic algorithms with the exact approach are presented.

Description: This paper proposes an efficient method to classify inverse synthetic aperture radar (ISAR) images. The proposed method achieves invariance to translation and rotation of ISAR images by using two-dimensional (2D) Fourier transform (FT) of ISAR images, polar mapping of the 2D FT image, and a simple nearest-neighbor classifier. In simulations using ISAR images measured in a compact range, the proposed method yielded high classification ratios with small-sized data regardless of the location of the rotation center, whereas the existing method was very sensitive to the location of it.

Description: A method for fusing synthetic aperture radar (SAR) images with optical aerial images is presented. This is done in a navigation framework, in which the absolute position and orientation of the flying platform, as computed from the inertial navigation system, is corrected based on the aerial image coordinates taken as ground truth. The method is suitable for new low-price SAR systems for small unmanned vehicles. The primary application is surveillance, and to some extent it can be applied to remote sensing, where the SAR image provides complementary information by revealing reflectivity to microwave frequencies. The method is based on first applying an edge detection algorithm to the images and then optimising the most important navigation states by matching the two binary images. To get a measure of the estimation uncertainty, we embed the optimisation in a least squares framework, in which an explicit method to estimate the (relative) size of the errors is presented. The performance is demonstrated on real SAR and aerial images, leading to an error of only a few pixels (around 4 m in our case), which is a quite satisfactory performance for applications like surveillance and navigation.

Description: This paper presents a sensor-control method for choosing the best next state of the sensors that provide accurate estimation results in a multitarget tracking application. The proposed solution is formulated for a multi-Bernoulli filter and works via minimization of a new estimation-error-based cost function. Simulation results demonstrate that the proposed method can outperform the state-of-the-art methods in terms of computation time and robustness to clutter while delivering similar accuracy.

Description: The Kalman filter has always been applied to enhance the estimation of inertial measurement unit errors and to improve estimation accuracy of navigation states under practical conditions. Therefore, understanding the behaviors and limitations of optimal estimation of the navigation states is instructive and of great importance. In order to provide comprehensive information about the observability and convergence rapidity of the navigation states when implementing a Kalman filter, the basic properties of intuitive linear-algebraic characterizations of stochastic observability will be intensively investigated in this study. We have extended the utilization of the analytic stochastic observability approach for analytic optimization of strapdown inertial navigation systems multiposition stationary alignment. The advantage of analytic explicit formulation of convergence rapidity of the implemented Kalman filter by stochastic observability approach is demonstrated. Compared to numerical simulation methods, the proposed stochastic observability approach can provide analysts with much more analytic information.

Description: Localization of persons that are hidden behind a corner is important in various security situations when the first responders should not be exposed to any threat. This article demonstrates the feasibility of an ultrawideband multipath-exploitation radar for localization in such scenarios. The approach utilizes multibounce echoes of electromagnetic waves that are scattered by the closest person situated behind a corner. We assume that the person does not carry any tag and does not cooperate with the localization system. The multibounce echoes are reflected and diffracted by the surroundings and make the hidden person visible to an operator that is behind the corner. The location estimation relies only on single-channel time-of-arrival data. Measured data are first processed by a background subtraction algorithm, which reveals the multipath evoked by the person. The multipath echoes are detected by a parallel threshold-based detector. A simple global nearest-neighbor algorithm is used for tracking detected echoes and improving their range estimates. The obtained range estimates are assigned to different physical propagation paths of the electromagnetic waves. The location of the person is estimated by fusing the information of the antenna location with respect to its surroundings and the assigned range estimates. The proposed approach is experimentally verified in a scenario where data are measured in real time by an ultrawideband sensor. Experimental results demonstrate that, depending on the scenario geometry, a walking or calmly standing person can be localized up to several meters behind the corner.

Description: Inverse synthetic aperture radar (ISAR) images can be obtained using digital video broadcasting???terrestrial (DVB-T)???based passive radars. However, television broadcast???transmitted signals offer poor range resolution for imaging purposes, because they have a narrower bandwidth with respect to those transmitted by a dedicated ISAR system. To reach finer range resolutions, signals composed of multiple DVB-T channels are required. Problems arise, however, because DVB-T channels are typically widely separated in the frequency domain. The gaps between channels produce high grating lobes in the image domain when Fourier-based algorithms are used to form the ISAR image. In this paper, compressive sensing theory is investigated to address this problem because of its ability to reconstruct sparse signals by using incomplete measures. By solving an optimization problem under the constraint of signal sparsity, passive ISAR images can be obtained with strongly reduced grating lobes. Both simulation and experimental results are shown to demonstrate the validity of the proposed approach.

Description: Mechanically steered scanning radars receive measurements continuously while sweeping the surveillance region. However, most target tracking algorithms, like the multiple hypothesis tracker (MHT) and the joint probabilistic data association (JPDA) techniques, wait for the end of a scan in order to process the measurements and to estimate targets states. This is due to the fundamental assumption of one-to-one association between tracks and measurements and the 360° physical limit of a scan. Associating measurements to initialized tracks and filtering at the end of a complete scan may cause significant delays in target state update. In addition, association may become imperfect due to longer intervals between updates. This issue becomes significant when tracking high-speed targets with low scan rate sensors as in the airborne early warning (AEW) system. In this paper, we present a new dynamic sector processing algorithm using two-dimensional (2-D) assignment for scanning radars that report measurements within the duration of a scan. The full scan is dynamically and adaptively divided into sectors, which could be as small as a single detection, depending on the scanning rate, sparsity of targets, and required target state update speed. Measurement-to-track association, filtering, and target state update are done dynamically while sweeping from one region to another, i.e., continuous track update, limited only by the intermeasurement interval, becomes possible. The proposed algorithm offers low latency while maintaining estimation accuracy in track updates as well as efficient utilization of computational resources compared with standard frame-based tracking algorithms. Experimental results based on rotating radars demonstrate the advantages of the proposed technique.

Description: An iterative ESPRIT-like algorithm is devised for direction-of-departure (DOD) and direction-of-arrival (DOA) estimation in multiple-input multiple-output radar. Our proposal can handle identical DODs and DOAs, and provides autopairing of the angle parameters. Furthermore, it is proved that the multiple signal classification methodology cannot identify (MN ??? 1) targets, where M and N are the element numbers in the transmit and receive antennas, respectively. Simulation results are included to evaluate the performance of the proposed algorithm.

Description: Multiple-input multiple-output (MIMO) radar imaging suffers from performance degradation under carrier offsets across transmitters and receivers. This paper analyzes the impact of carrier offsets on imaging a sparse target, from the perspective of the MIMO point spread function (PSF). Conditions are established for successful support recovery using orthogonal matching pursuit (OMP), and the performance loss is characterized in terms of l2 distance. A sparse imaging algorithm taking into account the perturbation due to carrier offsets is also proposed, which improves upon the OMP algorithm. Numerical experiments corroborate this analysis.

Description: Ambiguity functions (AFs) are obtained for a radar using matched illumination (MI) transmit signals for the detection of range-spread targets in the presence of clutter. The transmit signals are adapted to target and interference spectra and are filtered optimally in the receiver; they are designed to maximize signal-to-interference-and-noise ratio (SINR) power ratios at receiver output. In this paper, expressions for processing gains, spread AFs, and Cramer-Rao bounds on range and Doppler estimates are derived based on likelihood functions. Here, for extended targets, AFs resulting from using optimal MI constant envelope waveforms obtained via phase retrieval techniques demonstrate superior resolution characteristics compared with classic linear frequency-modulated (LFM) signals employing optimal pulse compression. For various target and clutter spectral models, simulation results show that optimally filtered MI signals provide significantly enhanced SINR behavior compared with LFM radar signals. Hopefully, these results set the stage for the induction of MI signaling and receive techniques into conventional radar signal processing and pave the way for realization of one methodology for achieving cognition in radar systems.

Description: In an effort to improve the channel utilization of a warship combat system (WCS), it is necessary to control and manage the large volume of video traffic by considering a strong self-similarity characteristic. We propose a new video traffic management method for the WCS that smooths the traffic of the closed-circuit television surveillance system (CSS) video and encodes the electro-optical tracking system (EOTS) video with low complexity in real time. First, to achieve global and local traffic smoothing for the CSS video traffic, a proper bandwidth allocation interval and a minimum bandwidth for the CSS video traffic must be determined. Second, due to the increased available bandwidth after traffic smoothing, more elaborate low-delay encoding is accomplished by selecting encoding modes adaptively to compress the EOTS video efficiently with high visual quality. The experimental results demonstrate that the proposed method is able to control the WCS traffic to be as flat as possible and to encode the EOTS video with low delay, even in combat and emergency scenarios. Hence, we show that to migrate to network-centric warfare successfully, the proposed method is much more suitable for the WCS than conventional video traffic management.

Description: In this paper, we propose multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) radar with sufficient cyclic prefix (CP), where all OFDM pulses transmitted from different transmitters share the same frequency band and are orthogonal to each other for every subcarrier in the discrete frequency domain. The orthogonality is not affected by time delays from transmitters. Thus, our proposed MIMO OFDM radar has the same range resolution as single transmitter radar and achieves full spatial diversity. Orthogonal designs are used to achieve this orthogonality across the transmitters, with which it is only needed to design OFDM pulses for the first transmitter. We also propose a joint pulse compression and pulse coherent integration for range reconstruction. In order to achieve the optimal signal-to-noise ratio (SNR) for the range reconstruction, we apply the paraunitary filterbank theory to design the OFDM pulses. We then propose a modified iterative clipping and filtering (MICF) algorithm for the designs of OFDM pulses jointly, when other important factors, such as peak-to-average power ratio (PAPR) in time domain, are also considered.With our proposed MIMO OFDM radar, there is no interference for the range reconstruction not only across the transmitters but also across the range cells in a swath called inter-range-cell interference (IRCI) free that is similar to our previously proposed CP-based OFDM radar for single transmitter. Simulations are presented to illustrate our proposed theory and show that the CP-based MIMO OFDM radar outperforms the existing frequency-band shared MIMO radar with polyphase codes and also frequency division MIMO radar.

Description: The minimum-variance filter and smoother are generalized to include Poisson-distributed measurement noise components. It is shown that the resulting filtered and smoothed estimates are unbiased. The use of the filter and smoother within expectation-maximization algorithms are described for joint estimation of the signal and Poisson noise intensity. Conditions for the monotonicity and asymptotic convergence of the Poisson intensity iterates are also established. An image restoration example is presented that demonstrates improved estimation performance at low signal-to-noise ratios.

Description: This paper proposes a new radar/sonar processing architecture that enables a low-rate time-sampling rate while still producing a high-resolution range profile over a narrow range-window. This new architecture generalizes the conventional ???stretch processing??? architecture (which employs linear frequency modulated (LFM) waveforms that suffer from high range-sidelobes), to nonlinear frequency modulated (NLFM) waveforms, which can lower the range-sidelobes without tapering. Computational results demonstrate both the estimation efficacy and the time-sampling efficiency of the proposed scheme.

Description: Free-floating manipulators are subject to dynamic singularities that complicate their Cartesian motions and restrict their workspace. In this work, the Cartesian trajectory planning of free-floating manipulators is studied. A methodology is developed in which, for given end-effector trajectories, appropriate initial system configurations are found that result in singularity avoidance during end-effector motion. The method applies to both planar and spatial systems, with and without initial angular momentum, and to any desired end-effector position and attitude trajectories.

Description: This paper investigates the problem of fusion filtering for a class of networked multisensor fusion systems with multiple uncertainties, including sensor failures, stochastic parameter uncertainties, random observation delays, and packet dropouts. A novel model is proposed to describe the random observation delays and packet dropouts, and a robust optimal fusion filter for the addressed networked multisensor fusion systems is designed using the innovation analysis method. The dimension of the designed filter is the same as that of the original system, which helps to reduce computation cost compared with the augmentation method. Moreover, robust reduced-dimension observation-fusion Kalman filters are proposed to further reduce the computation burden. Note that the designed fusion filter gain matrices can be computed off-line, as they depend only on the upper bounds of random delays and on the occurrence probabilities of delays and sensor failures. Some sufficient conditions are presented for stability and optimality of the designed fusion filters, and a steady-state fusion filter is also given for the networked multisensor fusion systems. Simulations show the effectiveness of the proposed fusion filters.

Description: Provides a listing of the editors, board members, and current staff for this issue of the publication.

Description: Provides a listing of the editors, board members, and current staff for this issue of the publication.