ALBERT

Description: This paper presents a method to estimate steady wind and a maneuvering strategy for loitering under a strong, steady wind. The wind estimation uses Global Positioning System velocity only through a novel filter design without airspeed measurement. The wind estimate is then used to guide the aircraft to crab in a direction perpendicular to the wind, thereby avoiding large changes in flight variables if an orbit-type maneuver is attempted. The proposed method is demonstrated through flight tests.

Description: We propose biased estimators to find the direction of arrival of emitters present in the mainlobe of a spinning antenna-based electronic intelligence system. The proposed estimators were constructed by using Bayesian techniques and by performing a linear transformation and an affine transformation on the maximum likelihood estimator. From a Monte Carlo simulation and experimental results, we demonstrate that the proposed estimators outperform the limit set by the popular performance benchmark, the Cramer-Rao lower bound.

Description: A new method was proposed for chirp signal detection and estimation built on the frame-based fast Fourier transform (FFT). The proposed method uses the peak frequency difference between FFT frames to detect a chirp signal and estimate chirp rate. This approach differs from conventional methods and is easy to implement. It generates more accurate chirp rate estimation especially under a low signal-to-noise ratio. Simulation and experimental data are used to verify the proposed methods.

Description: The quasimaximum likelihood (QML) estimator of polynomial-phase signals (PPSs) is based on the maximization of the short-time Fourier transform and suffers from aliasing when signals are sampled below the Nyquist sampling rate. In this paper, a phase unwrapping procedure has been proposed as an additional step in the QML to estimate parameters of such signals. Statistical study has shown excellent performance of the proposed approach.

Description: The inverse problem of synthetic aperture imaging radiometers (SAIRs) has been demonstrated to be not well posed. The regularization methods are crucial for providing unique and stable solutions in the reconstruction of radiometric brightness temperature (BT) maps. Different to deterministic ones, a new approach is presented by referring to the rule of Bayesian inference, providing a probability model of regularized constraints to combat the ill-posedness of finite-dimensional discrete inverse problems. In addition, the SAIR inverse problem can be converted into the probability estimation of the reconstructed BT. Furthermore, in application to both uniformly and nonuniformly spaced arrays, our method can obtain the optimal solution adaptively and avoid the dilemma of choosing the optimal regularization parameter. Finally, simulation results illustrating the effectiveness and performance of the proposed method are provided.

Description: A range-cell-focusing algorithm is proposed in order to improve the quality of the target image. In a synthetic aperture radar (SAR) imaging system, the range resolution depends on the frequency bandwidth and determines the ability to distinguish between targets that are very close to each other. In cases where the resolution and the SNR from the environment are not adequate, targets cannot be accurately visualized. In order to successively classify targets that are close, we are combining an enhanced-multiple-signal-classification spectrum as a weighting function to reproduce the raw data. The proposed algorithm improves classification and separation for close targets while suppressing artifacts in the final images. The targets of interest are stationary point scatterers. The results are obtained from both simulated and experimental data to demonstrate that the proposed algorithm provides better performance than a conventional SAR imaging algorithm, the range migration algorithm.

Description: This letter presents a multiscale edge detection method for multilook polarimetric synthetic aperture radar (PolSAR) images based on the nonsubsampled contourlet transform (NSCT). The NSCT can provide flexible multiscale and directional decomposition. In the multiscale decomposition, the coefficients of the nonsubsampled pyramid in the NSCT are calculated via maximizing the polarimetric contrast between the adjacent subband levels, instead of using the difference of the adjacent subbands as used in the additive noise model. By this way, we make the NSCT applicable to PolSAR data and multiband data. Then, the edges are detected in the NSCT domain based on a fusion of the directional subband coefficients at different scales. Experimental results with both simulated and real PolSAR data show that the present approach is robust to noise and the extracted edges are complete and continuous.

Description: A method for defining the spatial resolution of a Global Navigation Satellite System reflectometry delay–Doppler map (DDM) and of any derived geophysical product is proposed. An effective spatial resolution is derived as a function of measurement geometry and delay–Doppler (DD) interval, and as a more appropriate representation of resolution than the geometric resolution previously used in the literature. The definition more accurately accounts for variations in the scattered power across different pixels of the DDM and more accurately includes the power spreading effect caused by the Woodward ambiguity function. The dependence of the effective resolution on incidence angle, receiver altitude, and DD interval is analyzed and compared with the dependence of the geometric resolution with similar parameters.

Description: Laser scanner-captured 3-D point cloud data analysis is becoming more commonly used for remote sensing and plant science applications. Because of nonrigidity and complexity, reconstructing a 3-D model of a plant is extremely challenging. Existing algorithms often fail to find correct correspondences for plantlike thin structures. We address the problem of finding 3-D junction points in plant point cloud data as a first step of this correspondence matching process. Temporarily, we transform the 3-D problem into 2-D by performing appropriate coordinate transformations to the neighborhood of each 3-D point. Our proposed method has two steps. First, a statistical dip test of multimodality is performed to detect the nonlinearity of the local 2D structure. Then, each branch is approximated by sequential random-sample-consensus line fitting and a Euclidean clustering technique. The straight line parameters of each branch are extracted using total-least-squares estimation. Finally, the straight line equations are solved to determine if they intersect in the local neighborhood. Such junction points are good candidates for subsequent correspondence algorithms. Using these detected junction points, we formulate a correspondence algorithm as a subgraph matching problem and show that, without using traditional descriptor similarity-based matching, good correspondences can be obtained by simply considering geodesic distances among graph nodes. Experiments on synthetic and real ( Arabidopsis plant) data show that the proposed method outperforms the state of the art.

Description: Repeat-track analysis is commonly utilized to generate elevation change time series from satellite radar altimetry over ice sheets. It requires surface gradient (SG) correction due primarily to orbital drifts and radar-related empirical corrections caused by radar scatters from ice surface and potential subsurface. In this letter, two approaches, namely, the use of a digital elevation model (DEM) and the modified repeat-track analysis, which uses the accumulated Envisat altimetry profiles, are applied to correct the SG over both Greenland ice sheet (GrIS) and Antarctic ice sheet (AIS). By comparing the root mean square (rms) of elevation change time series after SG correction, the percentage of data (rms< 1 m) obtained by using modified repeat-track analysis is found to be 85% and 88% for the GrIS and AIS, respectively, as opposed to 45% and 44% if the DEM method is used. Furthermore, three cases are studied to assess empirical corrections for elevation retrieved from both ice-1 and ice-2 algorithms over the AIS. We conclude that the modified repeat-track analysis is more effective to remove topographic induced error. For the ice-2 algorithm, waveform shape parameters are needed in addition to applying corrections from changes in backscatter coefficients. The trend of elevation changes from the ice-1 algorithm with only backscatter analysis agrees with that from the ice-2 algorithm with corrections from backscatter coefficient changes and waveform shape parameters. This study could provide a potential data processing recipe for generating improved satellite radar altimetry elevation time series over ice sheets.

Description: Extracting ships from complex backgrounds is the bottleneck of ship detection in high-resolution optical satellite images. In this letter, we propose a nearly closed-form ship rotated bounding box space used for ship detection and design a method to generate a small number of highly potential candidates based on this space. We first analyze the possibility of accurately covering all ships by labeling rotated bounding boxes. Moreover, to reduce search space, we construct a nearly closed-form ship rotated bounding box space. Then, by scoring for each latent candidate in the space using a two-cascaded linear model followed by binary linear programming, we select a small number of highly potential candidates. Moreover, we also propose a fast version of our method. Experiments on our data set validate the effectiveness of our method and the efficiency of its fast version, which achieves a close detection rate in near real time.

Description: In this letter, a two-stage method for airport detection on remote sensing images is proposed. In the first stage, a new algorithm composed of several line-based processing steps is used for extraction of candidate airport regions. In the second stage, the scale-invariant feature transformation and Fisher vector coding are used for efficient representation of the airport and nonairport regions and support vector machines employed for classification. In order to evaluate the performance of the proposed method, extensive experiments are conducted on airports around the world with different layouts. The measures used in the evaluation are accuracy, sensitivity, and specificity. The proposed method achieved an accuracy of 94.6%, which was benchmarked with two previous methods to prove its superiority.

Description: High-resolution wide-swath synthetic aperture radar (SAR) systems are very attractive for the observation of dynamic processes on the Earth's surface, but they require the downlink of a huge volume of data. In order to comply with azimuth ambiguity requirements, in fact, a pulse repetition frequency much higher than the required processed Doppler bandwidth is often desirable. The volume of downlinked data, however, can be drastically reduced by performing Doppler filtering and decimation on board. A finite-impulse-response filter with a relatively small number of taps suffices to suppress the additional ambiguous components and to recover the original impulse response. This strategy is of special relevance for staggered SAR systems, which are typically characterized by a high oversampling factor. The proposed data reduction technique is also baseline for Tandem-L, where onboard Doppler filtering, resampling, and decimation will be jointly implemented.

Description: In this letter, we generate anisotropic bicontinuous media with different vertical and horizontal correlation functions. With the computer-generated bicontinuous medium, we then use numerical solutions of Maxwell equations in 3-dimensions (NMM3D) to calculate the anisotropic effective permittivities and the effective propagation constants of V and H polarizations. The copolarization phase difference (CPD) of VV and HH is then derived. The CPDs have recently been applied to the retrieval of snow water equivalent, snow depth, and anisotropy. The NMM3D simulation results are also compared with the results of the strong permittivity fluctuations in the low frequency limit and compared against the Maxwell–Garnett mixing formula.

Description: The IEEE GRS Society is grateful for the support given by the organizations listed and invites applications for Institutional Listings from other firms interested in the field of geoscience and remote sensing.

Description: These instructions give guidelines for preparing papers for this publication. Presents information for authors publishing in this journal.

Description: Cloud storage offers a popular environment for users to store and share content. Yet, content sharing leads to multiple downloads of the same content when users synchronize devices. These downloads contribute to bandwidth waste and increase server workloads. To what extent does this occur? Would network caches alleviate the problem? The authors address these questions by investigating the traffic generated by Dropbox, a popular cloud storage service. Using data collected from four networks, they show that a large fraction (57-70 percent) of downloads generated by Dropbox users is associated with content shared among multiple devices. Moreover, despite optimizations such as the LAN Sync protocol, up to 25 percent of Dropbox download traffic comes from content replicas. The authors then evaluate an alternative synchronization architecture that uses caches to offload storage servers from such downloads. Their experiments show that the approach cost-effectively avoids most repetitive downloads, benefiting service providers, the network, and end users.

Description: Bot detection -- identifying a software program that's using a computer system -- is an increasingly necessary security task. Existing solutions balance proof of human identity with unobtrusiveness in users' workflows. Cognitive modeling and natural interaction might provide stronger security and less intrusiveness.

Description: The IPv6 Internet is an important component of the Internet's continued growth and evolution. By several metrics, IPv6 has grown exponentially and now carries nontrivial amounts of production traffic. Less well-understood, however, is IPv6's topology and the way in which providers are using their IPv6 address allocations. Rather than relying on passive measurements or heuristics, which can bias inferences, here the authors use uniform active probing. They execute Internet Control Message Protocol (ICMP)-Paris traceroute probes to an address in each /48 in all /32's advertised in the global IPv6 routing table (approximately 400 million traces from 26 globally distributed vantage points). At this granularity, they characterize the distribution of IPv6 interface addresses in the wild, and find significant differences among providers and regions. By providing insight into the structure of the current IPv6 Internet router interface addressing method, their hope is to better inform efforts to design future intelligent, active IPv6 topology-mapping algorithms and systems.

Description: Along-track multichannel synthetic aperture radar is usually used to achieve ground moving target detection and imaging. Nevertheless, there is a design dilemma between azimuth high resolution and wide swath (HRWS). To solve this problem in HRWS mode, we introduce a virtual multichannel (VMC) scheme. For each virtual channel, the low real pulse repetition frequency (PRF) improves the ability of resolving range ambiguity for wide-swath, and the high virtual PRF improves the capability of resolving Doppler ambiguity for azimuth high resolution. For multiple virtual channels, strong ground clutter is eliminated by the joint VMC processing. Furthermore, a detailed signal model of a moving target in the virtual channel is given, and the special false-peak effect in the azimuthal image is analyzed. Moreover, we propose a novel ground moving target processing method based on the VMC scheme and the clutter suppression interferometry (CSI) technique, which is called VMC-CSI. The integration of detection, location, velocity estimation, and imaging for ground moving targets can be achieved. Accounting for the unresolved main peak and false peak for a moving target, in the VMC-CSI method, we adopt a two-step scheme to estimate the radial velocity and along-track velocity, namely, rough estimation and precise estimation. Meanwhile, considering the same interferometric phases of the main peak and the false peak, we use false peaks first for the robustness of initial azimuth location estimation and remove false peaks afterward. Numerical simulations are provided for testing the effect of the false peak and the effectiveness of VMC-CSI.

Description: This paper presents an open-source canopy height profile (CHP) toolkit designed for processing small-footprint full-waveform LiDAR data to obtain the estimates of effective leaf area index (LAIe) and CHPs. The use of the toolkit is presented with a case study of LAIe estimation in discontinuous-canopy fruit plantations. The experiments are carried out in two study areas, namely, orange and almond plantations, with different percentages of canopy cover (48% and 40%, respectively). For comparison, two commonly used discrete-point LAIe estimation methods are also tested. The LiDAR LAIe values are first computed for each of the sites and each method as a whole, providing “apparent” site-level LAIe, which disregards the discontinuity of the plantations' canopies. Since the toolkit allows for the calculation of the study area LAIe at different spatial scales, between-tree-level clumping can be easily accounted for and is then used to illustrate the impact of the discontinuity of canopy cover on LAIe retrieval. The LiDAR LAIe estimates are therefore computed at smaller scales as a mean of LAIe in various grid-cell sizes, providing estimates of “actual” site-level LAIe. Subsequently, the LiDAR LAIe results are compared with theoretical models of “apparent” LAIe versus “actual” LAIe, based on known percent canopy cover in each site. The comparison of those models to LiDAR LAIe derived from the smallest grid-cell sizes against the estimates of LAIe for the whole site has shown that the LAIe estimates obtained from the CHP toolkit provided values that are closest to those of theoretical models.

Description: Multifrequency and multioffset ground-penetrating radar data acquisition modes are used to maximize the information content and parameter retrieval capabilities. However, they also increase the computational cost dedicated to the inversion procedure. In this paper, the impact of the number of frequencies and the multistatic configurations on the information retrieval capabilities is investigated through the response surface topographies of the objective functions. We resort to a full-wave-inversion procedure and a recently developed electromagnetic model which takes advantage of a closed-form solution of Maxwell's equations to describe the antenna–medium system. We show with numerical and laboratory experiments the possibility of reducing the number of frequencies from several hundreds to one or several tens of components without affecting the information retrieval capabilities. We also show through several scenarios that the presence of a perfect electrical conductor increases the number of frequencies required to ensure an acceptable retrieval of the subsurface properties whereas the conductivity of the first layer and the relative permittivity of the second layer do not affect it. The results highlight that information content analyses are important in order to study and optimize data acquisition and inversion procedures, and thereby the computation time.

Description: This paper addresses some important aspects for the spaceborne/stationary bistatic synthetic aperture radar (SAR) (SS-BiSAR) imaging with the transmitter, TerraSAR-X, operated in staring spotlight (ST) mode. With the large integration time reaching 7.5 s and the azimuth steering span reaching $pm 2.2^{0}$ , several significant effects occur, including troposphere delay, precision phase and time synchronization, the curved orbit effect, azimuth spectrum aliasing problem, and efficient frequency domain focusing algorithm. To circumvent the main effects, corresponding solutions are proposed, including a precise synchronization strategy with troposphere delay correction based on the direct signal from the transmitter and a modified and integrative bistatic polar format algorithm (PFA). This paper covers the theoretical development, implementation, and analysis of the SS-BiSAR PFA based on 2-D fast Gaussian gridding nonuniform fast Fourier transform with wavefront curvature correction. Furthermore, the high-resolution ST-mode SS-BiSAR image processed by the proposed algorithm is acquired, and the differences of scattering behaviors between monostatic and bistatic SAR images are analyzed in detail.

Description: The ground penetrating radar (GPR) is a popular and successful remote sensing modality that has been investigated for landmine detection. GPR offers excellent detection performance, but it is limited by a low rate of advance (ROA) due to its short sensing standoff distance. Standoff distance refers to the distance between the sensing platform and the location in front of the platform where the GPR senses the ground. Large standoff (high ROA) sensing modalities have been investigated as alternatives to the GPR, but they do not yet achieve comparable detection performance. This paper proposes a new sensor management approach, called multistate management (MSM), which combines large and short standoff sensors on the same platform in a way that leverages their respective advantages, yielding a system with better ROA and detection performance. MSM is more difficult to analyze than traditional systems because it allows sensor activity and system velocity to change over time. Therefore, a new probabilistic model based on queuing theory, called Q-MSM, is also proposed for analyzing and designing detection systems operating with MSM. Simulations were conducted using real field-collected data for a system with a large standoff forward-looking infrared camera and a GPR. The system is operated with MSM, and the results show that this leads to better ROA and detection performance than can be attained otherwise. Furthermore, the results show that Q-MSM can accurately predict the behavior of the MSM system, validating its utility for analyzing and designing such systems.

Description: The concept of simultaneous source has recently become of interest in seismic exploration, due to its efficient or economic acquisition or both. The blended data overlapped between shot records are acquired in simultaneous source acquisition. Separating the blended data and recovering the single-shot seismic signals (the recovery) are of great importance in the scenario of current workflows, which can be called seismic simultaneous source separation. In the context of general random time-dithering firing, we propose an alternative method to separate the blended data by combining patchwise dictionary learning with sparse inversion, in which the dictionary is directly learned from the measured blended data. Apart from the sparse coding used for the coefficients, an additional regularization term on the dictionary is particularly designed to remove the severe interference noise. The efficient and flexible alternating direction method of multipliers (ADMM) is used to update the dictionary in the used alternating optimization scheme. The results obtained from the synthetic and real examples reasonably suggest that the separated seismic signals by using dictionary learning are more accurate and robust compared with that using the fixed transform basis, such as the local discrete cosine transform. The learned dictionary tailors for the recovery and is similar to the local seismic waveform, which improves the sparsity of the recovery substantially and is highly advantageous for producing the promised results.

Description: This paper investigates the impact of the soil moisture distribution in the top layer on the accuracy of soil moisture retrieval by microwave remote sensing methods. We modeled soil emission at L-band by coherent and noncoherent models for the different moisture distributions in the top layer. As a result, it is found that, at high moisture gradients, the difference between average moisture within the sensing depth at L-band and the moisture retrievable from remote sensing data can be more than 20% in absolute terms. In addition, high differences between Soil Moisture and Ocean Salinity (SMOS) Level 2 data and the in situ measurements were revealed in cases of high gradients. Such high gradients may be observed during some time in the top layer of the drying soil after rainfall. These differences are significantly more than the accuracy declared by SMOS development team. We proposed a simple method that allows the assessment of the type of soil moisture profile by SMOS and Global Change Observation Mission‐Water “SHIZUKU” (GCOM-W1) satellites data. The procedure for simple processing of data of the two satellites is described. In addition, we compared the type of soil moisture profile retrieved from satellite data and the soil moisture profile found by in situ measurements.

Description: An iterative alternating direction method of multipliers (ADMM) is proposed for inverse finite-element–boundary-integral (FE–BI) problem with total variation (TV) regularization. The inverse FE–BI fits to a wide class of penetrable sensing applications, where this study specifically targets the problem of radio tomography of asteroid interior structure using orbiting spacecraft. The TV regularizer enforces sparsity on the gradient of reconstructed permittivity, which agrees well with the “piecewise constant” reality of “rocks embedded in soil” scenario and, meanwhile, addresses the inherent ill-posedness. For large-scale asteroid problems, the distributed ADMM algorithm is adapted to solve the linear TV inversion at each iteration. The 2-D inversion is validated with the Fresnel Institute measurement data. Simulated cases of asteroid internal imaging are also presented. The proposed iterative ADMM can be also applied to similar penetrable imaging applications.

Description: GNSS Reflectometry, Scatterometry and Radio Occultation aboard ISS is the mission concept under study within the European Space Agency. Its core payload consists of an interferometric GNSS-Reflectometry ocean altimeter/scatterometer which does not need to generate any clean replicas of the GNSS codes for its operation. This paper describes a new interferometric technique by which such payload could also perform radio occultation as an add-on, without requiring any additional hardware resources, like the generation of clean code replicas or a storage of them. Two possibilities are studied. The first one consists of performing the complex autocorrelation function of the received signal transmitted by a rising or setting GNSS satellite. The autocorrelation function is evaluated around time epochs that are multiples of the period of suitable codes found in the modulation of the navigation signals. Satellite discrimination has to be performed spatially, through the antenna pattern. The second possibility consists in acquiring the reference signal separately from the occultation event which, in turn, has two options depending upon the geometry at which the reference is recorded: zenithal and top of the atmosphere. The signal-to-noise ratio, the satellite discrimination, and the impact of clock errors are assessed.

Description: Geophysics experts are interested in understanding the behavior of volcanoes and forecasting possible eruptions by monitoring and detecting the increment on volcano-seismic activity, with the aim of safeguarding human lives and material losses. This paper presents an automatic volcanic event detection and classification system, which considers feature extraction and feature selection stages, to reduce the processing time toward a reliable real-time volcano early warning system (RT-VEWS). We built the proposed approach in terms of the seismicity presented in 2009 and 2010 at the Cotopaxi Volcano located in Ecuador. In the detection stage, the recordings were time segmented by using a nonoverlapping 15-s window, and in the classification stage, the detected seismic signals were 1-min long. For each detected signal conveying seismic events, a comprehensive set of statistical, temporal, spectral, and scale-domain features were compiled and extracted, aiming to separate long-period (LP) events from volcano-tectonic (VT) earthquakes. We benchmarked two commonly used types of feature selection techniques, namely, wrapper (recursive feature extraction) and embedded (cross-validation and pruning). Each technique was used within a suitable and appropriate classification algorithm, either the support vector machine (SVM) or the decision trees. The best result was obtained by using the SVM classifier, yielding up to 99% accuracy in the detection stage and 97% accuracy and sensitivity in the event classification stage. Selected features and their interpretation were consistent among different input spaces in simple terms of the spectral content of the frequency bands at 3.1 and 6.8 Hz. A comparative analysis showed that the most relevant features for automatic discrimination between LP and VT events were one in the time domain, five in the frequency domain, and nine in the scale domain. Our study provides the framework for an event classification system with high - ccuracy and reduced computational requirements, according to the orientation toward a future RT-VEWS.

Description: Classification of hyperspectral images usually suffers from high dimensionality and few reference data, which limits the performance of the pixelwise classifiers. The spectral–spatial classifiers, which integrate the spectral data and the spatial information during the classification, perform impressively in terms of the high classification accuracy and the homogeneous appearance of the classification map. In this paper, we propose a new probabilistic framework for spectral–spatial classification (PFSSC), which integrates the spectral data and the spatial information from the probabilistic point of view. Both the spectral data and the spatial information are used to estimate the per-pixel probability, which gives the likelihood that one pixel belongs to one class, respectively. The classification map can then be directly derived from the joint probability. In the proposed framework, a pixelwise probabilistic classifier can be extended as a spectral–spatial one since it can integrate spatial information easily. Furthermore, these spectral–spatial classifiers in the proposed framework are realized in an iterative way to avoid the problem caused by the limited reference data to some extent. In each iterative step, some unassigned pixels are classified by considering the pixels assigned in previous iterative steps. In this iterative process, pixels are assigned to specific labels step by step gradually. In the proposed framework, the probabilistic support vector machine (SVM) and random forest (RF) are extended to be two spectral–spatial classifiers. In short, we denote them as SVM-PFSSC and RF-PFSSC, respectively. The experimental results show that SVM-PFSSC and RF-PFSSC outperform some pixelwise and spectral–spatial classifiers.

Description: Land cover/land use (LCLU) information extraction from multitemporal sequences of remote sensing imagery is becoming increasingly important. Mixed pixels are a common problem in Landsat and MODIS images that are used widely for LCLU monitoring. Recently developed subpixel mapping (SPM) techniques can extract LCLU information at the subpixel level by dividing mixed pixels into subpixels to which hard classes are then allocated. However, SPM has rarely been studied for time-series images (TSIs). In this paper, a spatiotemporal SPM approach was proposed for SPM of TSIs. In contrast to conventional spatial dependence-based SPM methods, the proposed approach considers simultaneously spatial and temporal dependences, with the former considering the correlation of subpixel classes within each image and the latter considering the correlation of subpixel classes between images in a temporal sequence. The proposed approach was developed assuming the availability of one fine spatial resolution map which exists among the TSIs. The SPM of TSIs is formulated as a constrained optimization problem. Under the coherence constraint imposed by the coarse LCLU proportions, the objective is to maximize the spatiotemporal dependence, which is defined by blending both spatial and temporal dependences. Experiments on three data sets showed that the proposed approach can provide more accurate subpixel resolution TSIs than conventional SPM methods. The SPM results obtained from the TSIs provide an excellent opportunity for LCLU dynamic monitoring and change detection at a finer spatial resolution than the available coarse spatial resolution TSIs.

Description: The ability to classify urban objects in large urban scenes from point clouds efficiently and accurately still remains a challenging task today. A new methodology for the effective and accurate classification of terrestrial laser scanning (TLS) point clouds is presented in this paper. First, in order to efficiently obtain the complementary characteristics of each 3-D point, a set of point-based descriptors for recognizing urban point clouds is constructed. This includes the 3-D geometry captured using the spin-image descriptor computed on three different scales, the mean RGB colors of the point in the camera images, the LAB values of that mean RGB, and the normal at each 3-D point. The initial 3-D labeling of the categories in urban environments is generated by utilizing a linear support vector machine classifier on the descriptors. These initial classification results are then first globally optimized by the multilabel graph-cut approach. These results are further refined automatically by a local optimization approach based upon the object-oriented decision tree that uses weak priors among urban categories which significantly improves the final classification accuracy. The proposed method has been validated on three urban TLS point clouds, and the experimental results demonstrate that it outperforms the state-of-the-art method in classification accuracy for buildings, trees, pedestrians, and cars.

Description: Target detection in hyperspectral images (HSIs) is an active area of research; it seeks to detect objects that are small in both number and size within a scene. The proposed work presents a new methodology for target detection in HSIs by combining kurtosis, level sets, and a size-based thresholding strategy. Kurtosis is used as a preprocessing step to initially enhance the targets in an image. Then, level sets identify and mark associations of pixels with similar spectral information as candidate targets. Finally, the size-based thresholding strategy detects true targets and discards false alarms that do not fit with target dimensions set as input parameter. In addition, we propose a novel version of level sets, which is suitable for target detection tasks in HSIs. Results show that the proposed algorithm could successfully detect targets in HSIs, and it gave better performance in terms of the receiver operating characteristic curve than other techniques widely used in target detection such as orthogonal subspace projection, constrained signal detector, constrained energy minimization, adaptive cosine/coherent estimator algorithm, and generalized-likelihood ratio test.

Description: A high-pulse-repetition-frequency (PRF) radar can handle the high Doppler frequencies of clutter echoes received by a fast-moving airborne radar. However, high-PRF radar causes range ambiguity. In addition, the clutter is range dependent when the airborne radar works in a forward-looking geometry. The range ambiguity and range dependence will lead to severe performance degradation of the traditional space-time adaptive processing (STAP) methods. In this paper, a vertical frequency diverse array (FDA), which applies frequency diversity in the vertical of a planar array, is explored to circumvent the range ambiguity problem in STAP radar. A range-ambiguous clutter suppression approach is devised, which consists of vertical spatial frequency compensation and pre-STAP filtering. In the vertical-FDA radar, the vertical spatial frequency depends not only on the depression angle but also on the slant range. By using this characteristic, the range-ambiguous clutter can be separated in the vertical spatial frequency domain, and then, clutter suppression is achieved for each separated range region. As a result, both problems of range ambiguity and range dependence are solved. Simulation results are provided to demonstrate the effectiveness of the proposed method.

Description: Synthetic aperture radar (SAR) interferometric baseline parameters form important input for SAR interferometry. In this paper, a nonlinear error model is established for the SAR interferometric baseline and parameterized as a polynomial based on the natural nonlinearity of the orbit of a satellite. Unlike conventional models, the proposed model takes into account the nonlinear part of the baseline error. A theoretical derivation is performed based on the imaging geometry of interferometric SAR, and the results of the analysis show that the parameters of the nonlinear baseline error model can be obtained from the relationship between the orbit, the nominal baseline, the baseline error, and the residual interferogram phase. A sample data set from the Japanese Earth Resources Satellite-1 (JERS-1) L-band SAR is used to validate the proposed model, and the results indicated that the compensation of the residual interferogram phase of the test data is superior to that provided by conventional models.

Description: Leaf area index (LAI) is an important vegetation biophysical variable and has been widely used for crop growth monitoring and yield estimation, land-surface process simulation, and global change studies. Several LAI products currently exist, but most have limited temporal coverage. A long-term high-quality global LAI product is required for greatly expanded application of LAI data. In this paper, a method previously proposed was improved to generate a long time series of Global LAnd Surface Satellite (GLASS) LAI product from Advanced Very High Resolution Radiometer (AVHRR) and Moderate Resolution Imaging Spectroradiometer (MODIS) reflectance data. The GLASS LAI product has a temporal resolution of eight days and spans from 1981 to 2014. During 1981–1999, the LAI product was generated from AVHRR reflectance data and was provided in a geographic latitude/longitude projection at a spatial resolution of 0.05°. During 2000–2014, the LAI product was derived from MODIS surface-reflectance data and was provided in a sinusoidal projection at a spatial resolution of 1 km. The GLASS LAI values derived from MODIS and AVHRR reflectance data form a consistent data set at a spatial resolution of 0.05°. Comparison of the GLASS LAI product with the MODIS LAI product (MOD15) and the first version of the Geoland2 (GEOV1) LAI product indicates that the global consistency of these LAI products is generally good. However, relatively large discrepancies among these LAI products were observed in tropical forest regions, where the GEOV1 LAI values were clearly lower than the GLASS and MOD15 LAI values, particularly in January. A quantitative comparison of temporal profiles shows that the temporal smoothness of the GLASS LAI product is superior to that of the GEOV1 and MODIS LAI products. Direct validation with the mean values of high-resolution LAI maps demonstrates that the GLASS LAI values were closer to the mean values of the high-resolution LAI maps ( $text{RMSE}=0.7848$ and $R^{2}=0.8095$ ) than the GEOV1 LAI values ( $text{RMSE}=0.9084$ and $R^{2}=0.7939$ ) and the MOD15 LAI values ( $text{RMSE}=1.1173$ and $R^{2}=0.6705$ ).

Description: A novel approach called Spectral–Spatial 1-D Manifold Embedding (SS1DME) is proposed in this paper for remotely sensed hyperspectral image (HSI) classification. This novel approach is based on a generalization of the recently developed smooth ordering model, which has gathered a great interest in the image processing area. In the proposed approach, first, we employ the spectral–spatial information-based affinity metric to learn the similarity of HSI pixels, where the contextual information is encoded into the affinity metric using spatial information. In our derived model, based on the obtained affinity metric, the created multiple 1-D manifold embeddings (1DMEs) consist of several different versions of 1DME of the same set of all HSI points. Since each 1DME of the data is a 1-D sequence, a label function on the data can be obtained by applying the simple 1-D signal processing tools (such as interpolation/regression). By collecting the predicted labels from these label functions, we build a subset of the current unlabeled points, on which the labels are correctly labeled with high confidence. Next, we add a proportion of the elements from this subset to the original labeled set to get the updated labeled set, which is used for the next running instance. Repeating this process for several loops, we get an extended labeled set, where the new members are correctly labeled by the label functions with much high confidence. Finally, we utilize the extended labeled set to build the target classifier for the whole HSI pixels. In the whole process, 1DME plays the role of learning data features from the given affinity metric. With the incrementation of learning features during iteration, the proposed scheme will gradually approximate the exact labels of all sample points. The proposed scheme is experimentally demonstrated using four real HSI data sets, exhibiting promising classification performance when compared with other recently introduced - patial analysis alternatives.

Description: We evaluate the potential of troposphere models derived from ground meteorological data (pressure, temperature, and relative humidity) and Global Positioning System (GPS) data to improve InSAR measurements and models derived from them. We test this approach on an ERS-2/Envisat data set collected during a transient surface deformation episode that occurred from January to July 2005 in the San Gabriel Valley, southern California, USA. We find that the interferometric phase change observed over the corresponding period cannot be solely attributed to hydrological uplift associated with rising groundwater levels but also includes a significant contribution from differential tropospheric delay due to differing quantities of water vapor in the troposphere on the two SAR observation dates. We show that, if the tropospheric phase contribution is mistakenly interpreted as the range change associated with changes in groundwater storage, both the surface displacement and the groundwater storage coefficient may be overestimated by up to 30%. This method could be applied in real time where meteorological measurements are available near one or more GPS permanent site(s).

Description: In the booming era of high-resolution synthetic aperture radar (SAR) technology, SAR advanced information retrieval is critical for effective utilization of huge-volume SAR data. One important aspect of high-resolution SAR interpretation is to explore the anisotropic and dispersive information embedded among subaperture and subband SAR images. This paper formulates the polarimetric subaperture analysis as a singular-value decomposition problem, where polarimetric and anisotropic features can be simultaneously decomposed. The decomposed singular values and left singular vectors are equivalent to eigenanalysis-based polarimetric target decomposition, whereas the right singular vectors give the corresponding anisotropic feature vectors. A physics-based parameterization is proposed for anisotropic patterns, where two anisotropic entropy parameters, namely, compactness and directivity, are proposed. Both simulation results and real SAR image analyses demonstrate that these proposed anisotropic entropies can effectively identify specific types of scatterers depending on their geometric scale, curvature, and form of spatial distribution. The proposed anisotropic entropies could be applied to single- and dual-polarization high-resolution SAR data as well.

Description: This paper presents a method for estimating the solar transmittance of urban trees using airborne light detection and ranging (LiDAR), and the radiative transfer simulation of vegetation. The leaf area density (LAD) distribution of trees with voxel size $1 text{m}times 1 text{m}times 0.5 text{m}$ is estimated using high-resolution and multireturn airborne LiDAR data. The LAD of voxels having few incident laser beams is corrected from the surrounding voxels. The LAD of the periphery of the crown is discretized into $0.5 text{m}times 0.5 text{m}times 0.5 text{m}$ voxels to accurately calculate the shaded area. The resulting LAD distribution is used in a radiative transfer simulation to calculate the solar transmittance of the trees. We verified the accuracy of the calculated transmittance by comparing it with empirical data for a Zelkova serrata . The comparisons were conducted under different angles of incidence of laser beams and solar radiation. When the angle between the incident laser beams and solar radiation was small, the transmittance could be accurately estimated. The LAD correction enabled the method to be applied to a broader range of the angle between beams and solar radiation. When the zenith angle of the incident laser beams was small $(< 10^{circ})$ and the LAD correction was carried out, the errors in transmittance were within 0.06 for solar altitudes greater than 40°. Next, we examined the difference in solar transmittance among streets caused by the layout of trees and buildings and the growth condition of the trees. It was shown that the present method is able to quantify the solar shading provided by urban trees and take into account LAD, tree layout, and the spatial geometry of the surr- unding buildings.

Description: This paper investigates several optimum graph-cut techniques for pruning binary partition trees (BPTs) and their usefulness for the low-level processing of polarimetric synthetic aperture radar (PolSAR) images. BPTs group pixels to form homogeneous regions, which are hierarchically structured by inclusion in a binary tree. They provide multiple resolutions of description and easy access to subsets of regions. Once constructed, BPTs can be used for a large number of applications. Many of these applications consist in populating the tree with a specific feature and in applying a graph cut called pruning to extract a partition of the space. In this paper, different pruning examples involving the optimization of a global criterion are discussed and analyzed in the context of PolSAR images for segmentation. Through the objective evaluation of the resulting partitions by means of precision-and-recall-for-boundaries curves, the best pruning technique is identified, and the influence of the tree construction on the performances is assessed.

Description: Building on existing techniques for satellite remote sensing of fires, this paper takes advantage of the day–night band (DNB) aboard the Visible Infrared Imaging Radiometer Suite (VIIRS) to develop the Firelight Detection Algorithm (FILDA), which characterizes fire pixels based on both visible-light and infrared (IR) signatures at night. By adjusting fire pixel selection criteria to include visible-light signatures, FILDA allows for significantly improved detection of pixels with smaller and/or cooler subpixel hotspots than the operational Interface Data Processing System (IDPS) algorithm. VIIRS scenes with near-coincident Advanced Spaceborne Thermal Emission and Reflection (ASTER) overpasses are examined after applying the operational VIIRS fire product algorithm and including a modified “candidate fire pixel selection” approach from FILDA that lowers the 4- $mutext{m}$ brightness temperature (BT) threshold but includes a minimum DNB radiance. FILDA is shown to be effective in detecting gas flares and characterizing fire lines during large forest fires (such as the Rim Fire in California and High Park fire in Colorado). Compared with the operational VIIRS fire algorithm for the study period, FILDA shows a large increase (up to 90%) in the number of detected fire pixels that can be verified with the finer resolution ASTER data (90 m). Part (30%) of this increase is likely due to a combined use of DNB and lower 4- $mutext{m}$ BT thresholds for fire detection in FILDA. Although further studies are needed, quantitative use of the DNB to improve fire detection could lead to reduced response times to wildfires and better estimate of fire characteristics (smoldering and flaming) at night.

Description: Hyperspectral image (HSI) denoising is a crucial preprocessing task that is used to improve the quality of images for object detection, classification, and other subsequent applications. It has been reported that noise can be effectively removed using the sparsity in the nonnoise part of the image. With the appreciable redundancy and correlation in HSIs, the denoising performance can be greatly improved if this redundancy and correlation is utilized efficiently in the denoising process. Inspired by this observation, a noise reduction method based on joint spectral–spatial distributed sparse representation is proposed for HSIs, which exploits the intraband structure and the interband correlation in the process of joint sparse representation and joint dictionary learning. In joint spectral–spatial sparse coding, the interband correlation is exploited to capture the similar structure and maintain the spectral continuity. The intraband structure is utilized to adaptively code the spatial structure differences of the different bands. Furthermore, using a joint dictionary learning algorithm, we obtain a dictionary that simultaneously describes the content of the different bands. Experiments on both synthetic and real hyperspectral data show that the proposed method can obtain better results than the other classic methods.

Description: Miniaturized hyperspectral imaging sensors are becoming available to small unmanned airborne vehicle (UAV) platforms. Imaging concepts based on frame format offer an attractive alternative to conventional hyperspectral pushbroom scanners because they enable enhanced processing and interpretation potential by allowing for acquisition of the 3-D geometry of the object and multiple object views together with the hyperspectral reflectance signatures. The objective of this investigation was to study the performance of novel visible and near-infrared (VNIR) and short-wave infrared (SWIR) hyperspectral frame cameras based on a tunable Fabry–Pérot interferometer (FPI) in measuring a 3-D digital surface model and the surface moisture of a peat production area. UAV image blocks were captured with ground sample distances (GSDs) of 15, 9.5, and 2.5 cm with the SWIR, VNIR, and consumer RGB cameras, respectively. Georeferencing showed consistent behavior, with accuracy levels better than GSD for the FPI cameras. The best accuracy in moisture estimation was obtained when using the reflectance difference of the SWIR band at 1246 nm and of the VNIR band at 859 nm, which gave a root mean square error (rmse) of 5.21 pp (pp is the mass fraction in percentage points) and a normalized rmse of 7.61%. The results are encouraging, indicating that UAV-based remote sensing could significantly improve the efficiency and environmental safety aspects of peat production.

Description: This paper analyzes the availability and accuracy of coastal altimetry sea level products in the Strait of Gibraltar. All possible repeats of two sections of the Envisat and AltiKa ground-tracks were used in the eastern and western portions of the strait. For Envisat, along-track sea level anomalies (SLAs) at 18-Hz posting rate were computed using ranges from two sources, namely, the official Sensor Geophysical Data Records (SGDRs) and the outputs of a coastal waveform retracker, the Adaptive Leading Edge Subwaveform (ALES) retracker; in addition, SLAs at 1 Hz were obtained from the Centre for Topographic studies of the Ocean and Hydrosphere (CTOH). For AltiKa, along-track SLA at 40 Hz was also computed both from SGDR and ALES ranges. The sea state bias correction was recomputed for the ALES-retracked Envisat SLA. The quality of these altimeter products was validated using two tide gauges located on the southern coast of Spain. For Envisat, the availability of data close to the coast depends crucially on the strategy followed for data screening. Most of the rejected data were due to the radar instrument operating in a low-precision nonocean mode. We observed an improvement of about 20% in the accuracy of the Envisat SLAs from ALES compared to the standard (SGDR) and the reprocessed CTOH data sets. AltiKa shows higher accuracy, with no significant differences between SGDR and ALES. The use of products from both missions allows longer times series, leading to a better understanding of the hydrodynamic processes in the study area.

Description: This paper describes the analysis performed on coherent simultaneously recorded monostatic and bistatic sea clutter data. The data were generated using a networked pulsed radar system, namely, NetRAD. This analysis is completed in both the temporal and Doppler domains, and the parameters characterized are compared between multiple bistatic angles and different polarizations. The K-distribution model is used to assess the variation in the clutter amplitude statistics between multiple bistatic data and the corresponding monostatic data. Key characteristics of the Doppler data, such as the spectrum width, center of gravity (CoG), and variance of the spectral width, are evaluated as a function of bistatic angle allowing novel relationships to be defined. The results conclude that the bistatic Doppler data have a lower K-distribution shape parameter in the majority of bistatic angles compared with the simultaneous monostatic data. In addition, novel trends in the relationship between the clutter spectrum CoG and the clutter intensity are presented.

Description: Icebergs represent hazards to maritime traffic and offshore operations. Satellite synthetic aperture radar (SAR) is very valuable for the observation of polar regions, and extensive work was already carried out on detection and tracking of large icebergs. However, the identification of small icebergs is still challenging especially when these are embedded in sea ice. In this paper, a new detector is proposed based on incoherent dual-polarization SAR images. The algorithm considers the limited extension of small icebergs, which are supposed to have a stronger cross-polarization and higher cross- over copolarization ratio compared to the surrounding sea or sea ice background. The new detector is tested with two satellite systems. First, RADARSAT-2 quad-polarimetric images are analyzed to evaluate the effects of high-resolution data. Subsequently, a more exhaustive analysis is carried out using dual-polarization ground-detected Sentinel-1a extra wide swath images acquired over the time span of two months. The test areas are in the east coast of Greenland, where several icebergs have been observed. A quantitative analysis and a comparison with a detector using only the cross-polarization channel are carried out, exploiting grounded icebergs as test targets. The proposed methodology improves the contrast between icebergs and sea ice clutter by up to 75 times. This returns an improved probability of detection.

Description: A novel wavelet-based scheme to increase coefficient independence in hyperspectral images is introduced for lossless coding. The proposed regression wavelet analysis (RWA) uses multivariate regression to exploit the relationships among wavelet-transformed components. It builds on our previous nonlinear schemes that estimate each coefficient from neighbor coefficients. Specifically, RWA performs a pyramidal estimation in the wavelet domain, thus reducing the statistical relations in the residuals and the energy of the representation compared to existing wavelet-based schemes. We propose three regression models to address the issues concerning estimation accuracy, component scalability, and computational complexity. Other suitable regression models could be devised for other goals. RWA is invertible, it allows a reversible integer implementation, and it does not expand the dynamic range. Experimental results over a wide range of sensors, such as AVIRIS, Hyperion, and Infrared Atmospheric Sounding Interferometer, suggest that RWA outperforms not only principal component analysis and wavelets but also the best and most recent coding standard in remote sensing, CCSDS-123.

Description: Since Jeff Howe introduced the term Crowdsourcing in 2006, this human-powered problem-solving paradigm has gained a lot of attention and has been a hot research topic in the field of computer science. Even though a lot of work has been conducted on this topic, so far we do not have a comprehensive survey on most relevant work done in the crowdsourcing field. In this paper, we aim to offer an overall picture of the current state of the art techniques in general-purpose crowdsourcing. According to their focus, we divide this work into three parts, which are: incentive design, task assignment, and quality control. For each part, we start with different problems faced in that area followed by a brief description of existing work and a discussion of pros and cons. In addition, we also present a real scenario on how the different techniques are used in implementing a location-based crowdsourcing platform, gMission. Finally, we highlight the limitations of the current general-purpose crowdsourcing techniques and present some open problems in this area.

Description: Any important data management and analytics tasks cannot be completely addressed by automated processes. These tasks, such as entity resolution, sentiment analysis, and image recognition can be enhanced through the use of human cognitive ability. Crowdsouring platforms are an effective way to harness the capabilities of people (i.e., the crowd) to apply human computation for such tasks. Thus, crowdsourced data management has become an area of increasing interest in research and industry. We identify three important problems in crowdsourced data management. (1) Quality Control: Workers may return noisy or incorrect results so effective techniques are required to achieve high quality; (2) Cost Control: The crowd is not free, and cost control aims to reduce the monetary cost; (3) Latency Control: The human workers can be slow, particularly compared to automated computing time scales, so latency-control techniques are required. There has been significant work addressing these three factors for designing crowdsourced tasks, developing crowdsourced data manipulation operators, and optimizing plans consisting of multiple operators. In this paper, we survey and synthesize a wide spectrum of existing studies on crowdsourced data management. Based on this analysis we then outline key factors that need to be considered to improve crowdsourced data management.

Description: Principal component analysis and the residual error is an effective anomaly detection technique. In an environment where anomalies are present in the training set, the derived principal components can be skewed by the anomalies. A further aspect of anomaly detection is that data might be distributed across different nodes in a network and their communication to a centralized processing unit is prohibited due to communication cost. Current solutions to distributed anomaly detection rely on a hierarchical network infrastructure to aggregate data or models; however, in this environment, links close to the root of the tree become critical and congested. In this paper, an algorithm is proposed that is more robust in its derivation of the principal components of a training set containing anomalies. A distributed form of the algorithm is then derived where each node in a network can iterate towards the centralized solution by exchanging small matrices with neighboring nodes. Experimental evaluations on both synthetic and real-world data sets demonstrate the superior performance of the proposed approach in comparison to principal component analysis and alternative anomaly detection techniques. In addition, it is shown that in a variety of network infrastructures, the distributed form of the anomaly detection model is able to derive a close approximation of the centralized model.

Description: Many applications deal with moving object datasets, e.g., mobile phone social networking, scientific simulations, and ride-sharing services. These applications need to handle a tremendous number of spatial objects that continuously move and execute spatial queries to explore their surroundings. To manage such update-heavy workloads, several throwaway index structures have recently been proposed, where a static index is rebuilt periodically from scratch rather than updated incrementally. It has been shown that throwaway indices outperform specialized moving-object indices that maintain location updates incrementally. However, throwaway indices suffer from scalability due to their single-server design and the only distributed throwaway index (D-MOVIES), extension of a centralized approach, does not scale out as the number of servers increases, especially during query processing phase.

Description: Collaborative filtering (CF) is out of question the most widely adopted and successful recommendation approach. A typical CF-based recommender system associates a user with a group of like-minded users based on their individual preferences over all the items, either explicit or implicit, and then recommends to the user some unobserved items enjoyed by the group. However, we find that two users with similar tastes on one item subset may have totally different tastes on another set. In other words, there exist many user-item subgroups each consisting of a subset of items and a group of like-minded users on these items. It is more reasonable to predict preferences through one user's correlated subgroups, but not the entire user-item matrix. In this paper, to find meaningful subgroups, we formulate a new Multiclass Co-Clustering (MCoC) model, which captures relations of user-to-item, user-to-user, and item-to-item simultaneously. Then, we combine traditional CF algorithms with subgroups for improving their top- $N$ recommendation performance. Our approach can be seen as a new extension of traditional clustering CF models. Systematic experiments on several real data sets have demonstrated the effectiveness of our proposed approach.

Description: With the rapid development of Web 2.0 and Online To Offline (O2O) marketing model, various online e vent- b ased s ocial n etwork s (EBSNs) are getting popular. An important task of EBSNs is to facilitate the most satisfactory event-participant arrangement for both sides, i.e., events enroll more participants and participants are arranged with personally interesting events. Existing approaches usually focus on the arrangement of each single event to a set of potential users, or ignore the conflicts between different events, which leads to infeasible or redundant arrangements. In this paper, to address the shortcomings of existing approaches, we first identify a more general and useful event-participant arrangement problem, called G lobal E vent-participant A rrangement with C onflict and C apacity ( $GEACC$ ) problem, focusing on the conflicts of different events and making event-participant arrangements in a global view. We find that the GEACC problem is NP-hard due to the conflicts among events. Thus, we design two approximation algorithms with provable approximation ratios and an exact algorithm with pruning technique to address this problem. In addition, we propose an online setting of GEACC, called OnlineGEACC, which is also practical in real-world scenarios. We further design an online algorithm with provable performance guarantee. Finally, we verify the effectiveness and efficiency of the proposed methods through extensive experiments on real and synthetic datasets.

Description: Given a point $p$ and a set of points $S$ , the kNN operation finds the $k$ closest points to in $S$ . It is a computational intensive task with a large range of applications such as knowledge discovery or data mining. However, as the volume and the dimension of data increase, only distributed approaches can perform such costly operation in a reasonable time. Recent works have focused on implementing efficient solutions using the MapReduce programming model because it is suitable for distributed large scale data processing. Although these works provide different solutions to the same problem, each one has particular constraints and properties. In this paper, we compare the different existing approaches for computing kNN on MapReduce, first theoretically, and then by performing an extensive experimental evaluation. To be able to compare solutions, we identify three generic steps for kNN computation on MapReduce: data pre-processing, data partitioning, and computation. We then analyze each step from load balancing, accuracy, and complexity aspects. Experiments in this paper use a variety of datasets, and analyze the impact of data volume, data dimension, and the value of k from many perspectives like time and space complexity, and accuracy. The experimental part brings new advantages and shortcomings that are discussed for each algorithm. To the best of our knowledge, this is the first pape- that compares kNN computing methods on MapReduce both theoretically and experimentally with the same setting. Overall, this paper can be used as a guide to tackle kNN-based practical problems in the context of big data.

Description: Mining communities or clusters in networks is valuable in analyzing, designing, and optimizing many natural and engineering complex systems, e.g., protein networks, power grid, and transportation systems. Most of the existing techniques view the community mining problem as an optimization problem based on a given quality function(e.g., modularity), however none of them are grounded with a systematic theory to identify the central nodes in the network. Moreover, how to reconcile the mining efficiency and the community quality still remains an open problem. In this paper, we attempt to address the above challenges by introducing a novel algorithm. First, a kernel function with a tunable influence factor is proposed to measure the leadership of each node, those nodes with highest local leadership can be viewed as the candidate central nodes. Then, we use a discrete-time dynamical system to describe the dynamical assignment of community membership; and formulate the serval conditions to guarantee the convergence of each node's dynamic trajectory, by which the hierarchical community structure of the network can be revealed. The proposed dynamical system is independent of the quality function used, so could also be applied in other community mining models. Our algorithm is highly efficient: the computational complexity analysis shows that the execution time is nearly linearly dependent on the number of nodes in sparse networks. We finally give demonstrative applications of the algorithm to a set of synthetic benchmark networks and also real-world networks to verify the algorithmic performance.

Description: When a microblogging user adopts some content propagated to her, we can attribute that to three behavioral factors, namely, topic virality , user virality , and user susceptibility . Topic virality measures the degree to which a topic attracts propagations by users. User virality and susceptibility refer to the ability of a user to propagate content to other users, and the propensity of a user adopting content propagated to her, respectively. In this paper, we study the problem of mining these behavioral factors specific to topics from microblogging content propagation data. We first construct a three dimensional tensor for representing the propagation instances. We then propose a tensor factorization framework to simultaneously derive the three sets of behavioral factors. Based on this framework, we develop a numerical factorization model and another probabilistic factorization variant. We also develop an efficient algorithm for the models’ parameters learning. Our experiments on a large Twitter dataset and synthetic datasets show that the proposed models can effectively mine the topic-specific behavioral factors of users and tweet topics. We further demonstrate that the proposed models consistently outperforms the other state-of-the-art content based models in retweet prediction over time.

Description: We propose an algorithm for detecting patterns exhibited by anomalous clusters in high dimensional discrete data. Unlike most anomaly detection (AD) methods, which detect individual anomalies, our proposed method detects groups ( clusters ) of anomalies; i.e., sets of points which collectively exhibit abnormal patterns. In many applications, this can lead to a better understanding of the nature of the atypical behavior and to identifying the sources of the anomalies. Moreover, we consider the case where the atypical patterns exhibit on only a small (salient) subset of the very high dimensional feature space. Individual AD techniques and techniques that detect anomalies using all the features typically fail to detect such anomalies, but our method can detect such instances collectively, discover the shared anomalous patterns exhibited by them, and identify the subsets of salient features. In this paper, we focus on detecting anomalous topics in a batch of text documents, developing our algorithm based on topic models. Results of our experiments show that our method can accurately detect anomalous topics and salient features (words) under each such topic in a synthetic data set and two real-world text corpora and achieves better performance compared to both standard group AD and individual AD techniques. All required code to reproduce our experiments is available from https://github.com/hsoleimani/ATD .

Description: Multilabel classification is prevalent in many real-world applications where data instances may be associated with multiple labels simultaneously. In multilabel classification, exploiting label correlations is an essential but nontrivial task. Most of the existing multilabel learning algorithms are either ineffective or computationally demanding and less scalable in exploiting label correlations. In this paper, we propose a co-evolutionary multilabel hypernetwork (Co-MLHN) as an attempt to exploit label correlations in an effective and efficient way. To this end, we firstly convert the traditional hypernetwork into a multilabel hypernetwork (MLHN) where label correlations are explicitly represented. We then propose a co-evolutionary learning algorithm to learn an integrated classification model for all labels. The proposed Co-MLHN exploits arbitrary order label correlations and has linear computational complexity with respect to the number of labels. Empirical studies on a broad range of multilabel data sets demonstrate that Co-MLHN achieves competitive results against state-of-the-art multilabel learning algorithms, in terms of both classification performance and scalability with respect to the number of labels.

Description: Query auto completion (QAC) methods recommend queries to search engine users when they start entering a query. Current QAC methods mostly rank query completions based on their past popularity, i.e., on the number of times they have previously been submitted as a query. However, query popularity changes over time and may vary drastically across users. Accordingly, the ranking of query completions should be adjusted. Previous time-sensitive and user-specific QAC methods have been developed separately, yielding significant improvements over methods that are neither time-sensitive nor personalized. We propose a hybrid QAC method that is both time-sensitive and personalized. We extend it to handle long-tail prefixes, which we achieve by assigning optimal weights to the contribution from time-sensitivity and personalization. Using real-world search log datasets, we return top $N$ query suggestions ranked by predicted popularity as estimated from popularity trends and cyclic popularity behavior; we rerank them by integrating similarities to a user's previous queries (both in the current session and in previous sessions). Our method outperforms state-of-the-art time-sensitive QAC baselines, achieving total improvements of between 3 and 7 percent in terms of mean reciprocal rank (MRR). After optimizing the weights, our extended model achieves MRR improvements of between 4 and 8 percent.

Description: Wrappers are pieces of software used to extract data from websites and structure them for further application processing. Unfortunately, websites are continuously evolving and structural changes happen with no forewarning, which usually results in wrappers working incorrectly. Thus, wrappers maintenance is necessary for detecting whether wrapper is extracting erroneous data. The solution consists of using verification models to detect whether wrapper output is statistically similar to the output produced by the wrapper itself when it was successfully invoked in the past. Current proposals present some weaknesses, as the data used to build these models are supposed to be homogeneous, independent, or representative enough, or following a single predefined mathematical model. In this paper, we present MAVE, a novel multilevel wrapper verification system that is based on one-class classification techniques to overcome previous weaknesses. The experimental results show that our proposal outperforms accuracy of current solutions.

Description: Provides a listing of board members, committee members, editors, and society officers.

Description: Certain inner feelings and physiological states like pain are subjective states that cannot be directly measured, but can be estimated from spontaneous facial expressions. Since they are typically characterized by subtle movements of facial parts, analysis of the facial details is required. To this end, we formulate a new regression method for continuous estimation of the intensity of facial behavior interpretation, called Doubly Sparse Relevance Vector Machine (DSRVM). DSRVM enforces double sparsity by jointly selecting the most relevant training examples (a.k.a. relevance vectors) and the most important kernels associated with facial parts relevant for interpretation of observed facial expressions. This advances prior work on multi-kernel learning, where sparsity of relevant kernels is typically ignored. Empirical evaluation on challenging Shoulder Pain videos, and the benchmark DISFA and SEMAINE datasets demonstrate that DSRVM outperforms competing approaches with a multi-fold reduction of running times in training and testing.

Description: During at-speed test of high performance sequential ICs using scan-based Logic BIST, the IC activity factor (AF) induced by the applied test vectors is significantly higher than that experienced during its in field operation. Consequently, power droop (PD) may take place during both shift and capture phases, which will slow down the circuit under test (CUT) signal transitions. At capture, this phenomenon is likely to be erroneously recognized as due to delay faults. As a result, a false test fail may be generated, with consequent increase in yield loss. In this paper, we propose two approaches to reduce the PD generated at capture during at-speed test of sequential circuits with scan-based Logic BIST using the Launch-On-Shift scheme. Both approaches increase the correlation between adjacent bits of the scan chains with respect to conventional scan-based LBIST. This way, the AF of the scan chains at capture is reduced. Consequently, the AF of the CUT at capture, thus the PD at capture, is also reduced compared to conventional scan-based LBIST. The former approach, hereinafter referred to as Low-Cost Approach (LCA), enables a 50 percent reduction in the worst case magnitude of PD during conventional logic BIST. It requires a small cost in terms of area overhead (of approximately 1.5 percent on average), and it does not increase the number of test vectors over the conventional scan-based LBIST to achieve the same Fault Coverage (FC). Moreover, compared to three recent alternative solutions, LCA features a comparable AF in the scan chains at capture, while requiring lower test time and area overhead. The second approach, hereinafter referred to as High-Reduction Approach (HRA), enables scalable PD reductions at capture of up to 87 percent, with limited additional costs in terms of area overhead and number of required test vectors for a given target FC, over our LCA approach. Particularly, compared to two of the three recent alternative solutions mentioned above, HRA en- bles a significantly lower AF in the scan chains during the application of test vectors, while requiring either a comparable area overhead or a significantly lower test time. Compared to the remaining alternative solutions mentioned above, HRA enables a similar AF in the scan chains at capture (approximately 90 percent lower than conventional scan-based LBIST), while requiring a significantly lower test time (approximately 4.87 times on average lower number of test vectors) and comparable area overhead (of approximately 1.9 percent on average).

Description: In this paper, a direct approach of designing robust weighted fusion steady-state Kalman predictors with uncertain noise variances is presented. Based on the steady-state Kalman filtering theory, using the minimax robust estimation principle, the local and six weighted fusion robust steady-state Kalman predictors are proposed based on the worst case systems with the conservative upper bounds of noise variances. They include the three robust weighted state fusers, two robust weighted measurement fusers, and a modified robust covariance intersection (CI) fuser. Their actual prediction error variances are guaranteed to have the corresponding minimal upper bounds for all admissible uncertainties. A Lyapunov equation approach for robustness analysis and the concept of the robust accuracy are presented and their robust accuracy relations are proved. A simulation example verifies the accuracy relations and robustness.

Description: In multitarget tracking, the problem of track labeling (assigning labels to tracks) is an ongoing research topic. The existing literature, however, lacks an appropriate measure of uncertainty related to the assigned labels that has a sound mathematical basis as well as clear practical meaning to the user. This is especially important in a situation where well separated targets move in close proximity with each other and thereafter separate again; in such a situation, it is well known that there will be confusion on target identities, also known as "mixed labeling." In this paper, we specify comprehensively the necessary assumptions for a Bayesian formulation of the multitarget tracking and labeling (MTTL) problem to be meaningful.We provide a mathematical characterization of the labeling uncertainties with clear physical interpretation.We also propose a novel labeling procedure that can be used in combination with any existing (unlabeled)MTT algorithm to obtain a Bayesian solution to the MTTL problem. One advantage of the resulting solution is that it readily provides the labeling uncertainty measures. Using the mixed labeling phenomenon in the presence of two targets as our test bed, we show with simulation results that an unlabeled multitarget sequential Monte Carlo (M-SMC) algorithm that employs sequential importance resampling (SIR) augmented with our labeling procedure performs much better than its "naive" extension, the labeled SIR M-SMC filter.

Description: Track-before-detect methods jointly detect and track one or several targets from raw sensor measurements. They often require the computation of the measurement likelihood conditional on the hidden state, which depends on the complex amplitudes of the targets. Since these amplitudes are unknown and fluctuate over time, this likelihood must be marginalized over the complex amplitude (i.e., phase and modulus). It has been demonstrated that this marginalization can be done analytically over the phase in the monotarget case. In this article, we first propose to extend the marginalization to the modulus in a monotarget setting, and we show that closed forms can be obtained for fluctuations of type Swerling 1 and 3. Second, we demonstrate that, in a multitarget setting, a closed form can be obtained for the Swerling 1 case. For Swerling 0 and 3 models, we propose some approximation to alleviate the computation. Since many articles consider the case of squared modulus measurements, we also consider this specific case in monoand multitarget settings with Swerling 0, 1, and 3 fluctuations. Finally, we compare the performance in estimation and detection for the different cases studied, and we show the gain, both in detection and estimation, of the complex measurement method over the squared modulus method, for any fluctuation model.

Description: When a bistatic inverse synthetic aperture radar (ISAR) system fails to collect complete radar cross section (RCS) datasets, bistatic ISAR (Bi-ISAR) images are usually corrupted using the conventional Fourier transform (FT)-based imaging algorithm. To overcome this problem, this paper proposes a new Bi-ISAR image reconstruction method that includes three steps: suboptimal estimation of parameters regarding the bistatic angle in the Bi-ISAR signal model via an orthogonal matching pursuit-type group-searching scheme, Bi-ISAR signal reconstruction using the estimated parameters, and Bi-ISAR image generation using the FT-based imaging algorithm applied to the reconstructed Bi-ISAR signal. To validate the reconstruction capability of the proposed method, bistatic-scattered field data using the physical optics technique as well as the point-scatterer model are used for Bi-ISAR image reconstruction. The results show that the proposed sparse-recovery-interpolation approach based on the Bi-ISAR signal model reconstruction combined with the classical FT-based algorithm can yield high reconstruction accuracy for incomplete bistatic RCS data compared to conventional numerical interpolation methods and existing direct sparse reconstruction techniques.

Description: Bistatic inverse synthetic aperture radar (ISAR) is an efficient geometric configuration of ISAR to image targets traveling along radar transmitter's line of sight, but it has the problem of defocusing and distortion because of the time-varying bistatic angle. In this paper, we derive the defocusing term and the distortion term by expanding the bistatic angle using first-order Taylor expansion. In addition, necessary constraints to neglect the defocusing term are provided via point spread function analysis, and a novel method to eliminate distortion based on linked scatterers is proposed. Simulation results validate our theoretical analysis and show the effectiveness of our method.

Description: Micro-Doppler (MD)-based target classification capabilities of automotive radars can provide high reliability and short latency to future active safety automotive features. A large number of pedestrians surrounding a vehicle in practical urban scenarios mandate prioritization of their treatment level. Distinguishing between relevant pedestrians that are crossing the street or are within the vehicle path and those that are on the sidewalks and are moving along the vehicle route can significantly minimize the number of vehicle-to-pedestrian accidents. This work proposes a novel technique for estimating a pedestrian direction of motion that treats pedestrians as complex distributed targets and utilizes their MD radar signatures. The MD signatures are shown to be indicative of pedestrian direction of motion, and a supervised regression is used to estimate the mapping between the directions of motion and the corresponding MD signatures. In order to achieve higher regression performance, a state-of-the-art sparse dictionary learning-based feature extraction algorithm was adopted from the field of computer vision by drawing a parallel between the Doppler effect and the video temporal gradient. The performance of the proposed approach is evaluated in practical automotive scenario simulations, where a walking pedestrian is observed by a multiple-input/multiple-output automotive radar with a two-dimensional rectangular array. The simulated data was generated using the statistical Boulic-Thalman human locomotion model. Accurate direction of motion estimation was achieved by using support vector regression and multilayer perceptron-based regression algorithms. The results show that the direction estimation error is less than 10° in 95% of the tested cases for pedestrian at a range of 100 m from the radar.

Description: This paper proposes a novel phase synchronization technique that enables beamforming with multiple resource-limited spacecraft in space and capitalizes on their spatial geometry. The proposed technique employs an external beacon to obviate the need for explicit time synchronization and reduces the accuracy requirements on localization. Results show that subcentimeter (subnanosecond)-level phase synchronization can be achieved with localization accuracy in the order of meters.

Description: The use of chirp signals in modern radar and ranging systems have numerous benefits. They are extensively used to improve signal-to-noise ratio and range resolution. The performance capabilities of these signals are directly related to their time-bandwidth product, i.e., the duration and bandwidth of the pulse. Ultra-wideband chirp signals are further desirable because they span a large bandwidth, making them resistant to narrowband environmental interference. The accurate detection and measurement of high chirp signals is difficult due to the necessity of a high-sampling analog-digital converter, a target measurement platform with high computational power, and a time-of-arrival (TOA) estimator with high temporal resolution. The difficulty of the problem is further compounded with the requirement that no a priori knowledge of the signal, noise, or operating environment is known. This paper presents a practical approach and implementation of a high linear chirp rate receiver and TOA estimator pair capable of detecting and measuring stationary radio frequency pulses as well as linear chirp rates up to 1.18 GHz in 400 ns. The high-resolution TOA algorithm and linear chirp receiver have been prototyped, synthesized, and placed and routed for a Virtex 6 SX475 FPGA.

Description: In this paper, an impact angle control guidance law, which considers simultaneously the impact angle and seeker's look angle constraints, is proposed for a constant speed missile against a stationary target. An optimal control theory with state variable inequality constraint is used to design the guidance law, for which a control energy performance index with the weighting function of the range-to-go is minimized. Various forms of guidance and trajectory shaping are possible by selecting a proper gain of the weighting function. To handle the seeker's look angle limits when the missile trajectory is highly curved by controlling the impact angle, the proposed guidance law generates three types of acceleration commands as the guidance phases: the first acceleration command for an initial guidance phase makes an initial seeker's look angle reach the maximum look angle; the second one for a midguidance phase maintains the maximum look angle; the final one for a terminal guidance phase intercepts the target with the desired impact angle. The performance of the proposed guidance law was investigated with nonlinear simulations for various engagement conditions.

Description: This paper presents a means of near asteroid hovering of a rigid spacecraft in the asteroid body-fixed frame with parameter variations and external disturbances. An adaptive finite-time control scheme is proposed, where the upper bounds of the parametric uncertainties and disturbances are not required for controller design. The detailed design principles and a rigorous stability analysis are provided. Finally, a body-fixed hovering maneuver is employed in numerical simulation to verify the effectiveness of the proposed strategy.

Description: In global navigation satellite system (GNSS) receivers, the acquisition process is the first stage of the signal processing module. It consists of assessing the presence of GNSS signals and providing a rough estimation of the incoming signal parameters: the Doppler frequency and the code delay. However, the presence of bit sign transitions affects receiver performance in signal acquisition detection. This article focuses on the bit transition and its impact on the acquisition performance by providing a general mathematical study and an illustration for two GNSS signals: the global positioning system legacy civil signal (GPS L1 C/A) and Galileo E1 open service (OS). This study is applicable to a terrestrial user in a constraint environment. Furthermore, the presented results are mathematical models of the probability of detection in the presence of bit sign transitions (only one potential bit sign transition per integration interval), and potential uncertainties on the Doppler frequency and code delay. These do not result from empirical acquisition of real signals.

Description: This paper investigates the problem of ground vehicle tracking with ground-moving target indicator (GMTI) radar. In practice, the movement of ground vehicles may involve several different maneuvering types (acceleration, deceleration, standstill, etc.). Consequently, the GMTI radar may lose measurements when the radial velocity of the ground vehicle is below a threshold, i.e., falling into the Doppler blind region. In this paper, to incorporate the information gathered from normal measurements and knowledge on the Doppler blindness constraint, we develop an enhanced particle filtering method for which the importance distributions are inspired by a recent noise-related Doppler blind (NRDB) filtering algorithm for GMTI tracking. Specifically, when constructing the importance distributions, the proposed particle filter takes the advantages of the efficient NRDB algorithm by applying the extended Kalman filter and its generalization for interval-censored measurements. In addition, the linearization and Gaussian approximations in the NRDB algorithm are corrected by the weighting process of the developed filtering method to achieve a more accurate GMTI tracking performance. The simulation results show that the proposed method substantially outperforms the existing methods for the GMTI tracking problem.

Description: Sets that are defined either from closed contours or from a set of points are generic descriptors for several kinds of objects in binary images. In this paper, we derive a novel model in the space of sets and design an observer for the proposed model to estimate the depth and orientation of planar objects from a camera. This problem is well known as "structure from motion." When the objects are only partially projected on the image plane of the camera, our model makes object depth and orientation estimation possible without feature tracking and matching between distinct image frames (i.e., the so-called correspondence problem), which is an advantage over the image moments-based model. However, the proposed model fails in some situations (the failures can be seen as brief instabilities), and it is not always continuous. To compensate for these drawbacks, we designed a fast observer based on L 1 control theory with a binary signal for the proposed model. Stability analysis with respect to a certain asymptotic instability ratio is also presented in this paper. The effectiveness of the proposed model and observer is demonstrated through simulations and experimental results.

Description: Presents the front cover/table of contents for this issue of this publication.

Description: A novel differential vector phase locked loop (DVPLL) is derived that takes global navigation satellite system (GNSS) code-phase and carrier-phase measurements from a base station and uses them to maintain a position with centimeter-level accuracy directly in the vector tracking loop of a rover receiver. The navigation filter uses five state variables, three position and two clock states, to create the replica code and carrier measurements for a static test. There are no individual channel states or feedback mechanisms. Closing the individual loops solely through the navigation filter makes this a purely vector method. For short baselines, where differential atmospheric errors are small, the DVPLL can be used on single-frequency data. An L1-only live-sky static test was performed using the method, resulting in a three-dimensional accuracy of 1.3 mm for a zero-baseline and 5.3 mm for an 18.5 m baseline.

Description: An adaptive actuator failure and disturbance compensation scheme is developed for attitude tracking control of spacecraft. The proposed scheme consists of a composite parameter adaptation design that incorporates an adaptive backstepping feedback control law and an adaptive feedforward actuator failure compensator; it can guarantee the overall closed-loop system stability and asymptotic tracking. Illustrative simulation results of an application to a spacecraft model show that the designed actuator failure compensation controller ensures system stability and tracking performance.

Description: Track-before-detect (TBD) is a popular incoherent energy integration technique aimed at improving detectability of weak targets. A number of studies are available in the literature demonstrating its efficacy against disturbance (whether noise or clutter), but most of them refer to synthetic data, i.e., relying on computer simulations. In this paper, we tackle the problem of assessing the TBD performance with real data and in a particularly severe clutter environment, i.e., sea-clutter. Precisely, using a set of real data from a ground-based sea-search radar, we implement TBD directly on the plot-lists coming from the radar plot extractor (this be can done with acceptable complexity by using an ad hoc dynamic programming algorithm), and demonstrate its effectiveness in reducing sea-clutter. As a further contribution, we also develop an improved decision logic for plot confirmation.

Description: The concept of more electric aircraft leads to increases in the amount of electrical loads, as well as the power consumed in the aircraft of the future. To utilize the power feeders, more symmetric, load balancing methods can be applied to swap loads between different phases of an alternating current (AC) feeder, or even between different power feeders. If the load balancing system reacts to measurement data during the flight in real time, the cable power losses and return network power losses, too, are reduced. In addition, the rate of power management interventions decreases. The load balancing problem in three-phase systems is a mixed-integer nonlinear nondifferentiable optimization problem, which is typically solved by elaborate and time-consuming nonreal-time optimization algorithms. The AC loads in aircraft have different power factors, which result in currents described by complex numbers. To determine a load swapping scheme in real time starting from a given load allocation with sparse swapping, new heuristics are presented. One heuristic is specially designed to solve the phase swapping problem by shifting single-phase loads between phases of a feeder. Another heuristic, based on the first one, is enhanced to more than one three-phase feeder and considers the swapping of single-phase and three-phase loads. The heuristics are tested by simulations of a comprehensive case study based on real measurement data from a modern passenger aircraft. To prove the efficiency of the new concepts, a test bench has been built, and several experiments successfully conducted.

Description: The probability hypothesis density (PHD) filter is an efficient algorithm for multitarget tracking in the presence of nonlinearities and/or non-Gaussian noise. The sequential Monte Carlo (SMC) and Gaussian mixture (GM) techniques are commonly used to implement the PHD filter. Recently, a new implementation of the PHD filter using B-splines with the capability to model any arbitrary density functions using only a few knots was proposed. The spline PHD (SPHD) filter was found to be more robust than the SMC-PHD filter because it does not suffer from degeneracy, and it was better than the GM-PHD implementation in terms of estimation accuracy, albeit with a higher computational complexity. In this paper, we propose a multiple model extension to the SPHD filter to track multiple maneuvering targets. Simulation results are presented to demonstrate the effectiveness of the new filter.

Description: This paper proposes an optimal control framework for the climb and descent economy modes of a flight management system (FMS) yielding a solution that can be implemented in real-time flights below the drag divergence Mach number. The problem is formulated as the optimization of a functional that trades off the fuel- and time-related costs of a flight as a function of a (crew-supplied) parameter called the cost index. The work builds on previous research of the authors for the cruise phase and extends it to the climb and descent phases of flight. More specifically, for both climb and descent, it is found that suboptimal solutions can be obtained as the positive real roots of a fifth-degree polynomial lying inside the flight envelope, which can be found using fast-converging algorithms such as Newton's method. The main contributions of this work are threefold. First, the proposed method gives physical insight because there is an analytical expression for each coefficient of the polynomial. Second, this approach eliminates the need to have a performance database in the system, thus making its implementation faster in real-time. Third, the solution exhibits the same behavior of airborne FMS units as a function of the cost index, which is justified in this paper based on Bellman's principle of optimality. This justification is an important theoretical contribution of the paper. A validation of the approximate solution is obtained using the shooting method to compute the optimal trajectories and compare them against the proposed suboptimal solution. Simulation results show that, for an Airbus A320 model and for a Gulfstream-IV aircraft model, the relative error of the suboptimal trajectories when compared to the optimal trajectories is small for climb and descent trajectories, respectively.

Description: An X-band, 15-W-class gallium nitride (GaN) solid-state power amplifier (SSPA) for the 50-kg-class ultrasmall deep-space probe PROCYON has been demonstrated in deep space for the first time. PROCYON was launched on December 3, 2014, as a subpayload of the Hayabusa 2 spacecraft. The GaN SSPA consists of three-stage, single-end amplifiers. The final-stage GaN high-power amplifier, which dominates the characteristics of the SSPA, achieves a maximum drain efficiency of 55.8% at 8.4 GHz. The fabricated SSPA using this GaN high-power amplifier has dimensions of 150 x 120 x 62 mm and weighs 1.5 kg, and its space applicability was confirmed through space environmental tests. For more than 2450 h of continuous operation in deep space, the GaN SSPA has achieved an average output power of 41.7 dBm (14.8 W), with standard deviation of 0.12 dB, maximum overall efficiency of 35.7%, and average efficiency of 33.8%. To the authors' knowledge, this is the highest efficiency of all proven X-band onboard SSPAs.

Description: In this paper, an adaptive cubature Kalman filter (ACKF) is proposed to improve the performance of the conventional cubature Kalman filter. The ACKF uses a new cubature rule that combines a third-degree spherical rule with an adaptive higher degree radial rule along the directions of larger uncertainty. More accurate and robust results can be obtained with slightly more cubature points than the conventional third-degree cubature Kalman filter (CKF). Compared with other high-degree Gaussian filters, ACKF uses much fewer points but maintains very close performance. A target tracking problem is used to demonstrate the effectiveness of the proposed filter.

Description: We propose a simple method for estimating crystal oscillator g-sensitivity in inertially aided Global Navigation Satellite System (GNSS) receivers. It does not require any specific equipment, like GNSS signal simulators or rate tables. The method is based on analyzing closed-loop phase tracking errors. This enables us to utilize the actual GNSS signal as the frequency reference, despite the presence of an unknown Doppler shift in it. The method has been successfully applied to the calibration of an oven-controlled crystal oscillator.

Description: This letter presents an analysis of prefiltered clutter ultrawideband (UWB) very high frequency synthetic aperture radar (SAR) images. The image data are reorganized into subvectors based on the observation of the image-pair magnitude samples. Based on this approach, we present a statistical description of the SAR clutter obtained by the subtraction between two real SAR images. The statistical analysis based on bivariate distribution data organized into different intervals of magnitude can be an important tool to further understand the properties of the backscattered signal for low-frequency SAR images. In this letter, it is found that, for “good” image pairs, the subtracted image has Gaussian distributed clutter backscattering and that the noise mainly consists of the thermal noise and, therefore, speckle noise does not have to be considered. This is a consequence of the stable backscattering for a UWB low-frequency SAR system.

Description: For most land and ice surfaces, the measured radar backscatter at the spatial resolution of a wind scatterometer is insensitive to the azimuth angle. However, for regions of East Antarctica, the backscatter strongly depends on the azimuth angle. This relationship between backscatter and azimuth angle is often modeled with a Fourier series. Although previous work has separately examined the data from QuikSCAT, a Ku-band scatterometer, and the Advanced Scatterometer (ASCAT), a C-band scatterometer, this letter compares the two on the same high-resolution grid. We find that, although QuikSCAT has superior azimuth angle coverage (due to its measurement geometry) compared to ASCAT, both are suitable to estimate the radar backscatter azimuth angle modulation of East Antarctica. The ASCAT data exhibit a much larger azimuth modulation than the QuikSCAT data. This is attributed to the different wavelengths of the microwave signal: At C-band (5.7 cm), East Antarctica has features that show radar backscatter to be more dependent on azimuth angle than at Ku-band (2.2 cm). This letter also examines the ASCAT and QuikSCAT azimuth modulation over previously identified regions of wind glaze. Although azimuth modulation is expected to be minimal over wind glaze, we find the wind-glaze regions to contain more structure than previously suggested.

Description: A novel polarimetric calibration scheme on the basis of lexicographic matrix decomposition is proposed, and a new polarimetric active radar calibrator (PARC) with two independently rotatable antennas is designed to obtain the lexicographic matrices. Thus, the proposed method is realizable and can operate with the lexicographic target vectors instead of the polarization scattering matrix (PSM). The base elements of the lexicographic target vectors are the vectors corresponding to the new PARC with the antennas at different orientations. Moreover, the elements of the vector are just the elements of the PSM. Hence, the error coefficients corresponding to a polarimetric measurement system are directly achieved, and the polarimetric calibration is simple and accurate. Experimental results confirm the superiority of the presented strategy. A 35-dB improvement in the system cross-polarization isolation is obtained.

Description: Target detection plays an important role in the field of hyperspectral image (HSI) remote sensing. In this letter, a novel matched subspace detector based on low-rank regularized least squares (LRLS-MSD) is proposed for hyperspectral target detection. As pixels in an HSI have global correlation and can be represented in subspace, the low-rank regularization is introduced in the least squares model. An effective algorithm is presented to solve the problem. Then, the detection results are generated according to the generalized likelihood ratio test with statistical hypotheses. The experimental results suggest an advantage of the low-rank regularization over other classical target detection methods.

Description: An improved facet model for the predication of the normalized radar cross section (NRCS) of electrically large rough sea surface was proposed based on the first-order small slope approximation (SSA-1) method, the Bragg scattering mechanism, and the specular scattering mechanism. The proposed method is able to evaluate both the complex reflective function and NRCS of electrically large sea surfaces from as low as ultrahigh frequency band to as high as Ka-band. The main idea is that a tilt sea facet can be regarded as the superposition of a planner facet and the microscopic profile; the latter is assumed to be a set of sinusoidal ripple patches. Thus, the integration kernel in SSA-1 over several small facets can be replaced by a large facet with a short wave modification. The efficiency increases because of the much larger mesh size than SSA. Then, both the backscattering and bistatic scattering NRCS results calculated by the proposed method were compared with those predicated by SSA-1, and all of the results show that the proposed method has the merits of high calculation efficiency as well as calculation accuracy.

Description: In this letter, pioneering experimental results of passive synthetic aperture radar (SAR) imaging are presented. The classical active SAR radar operates in monostatic geometry. The SAR sensor presented in this letter is a passive radar utilizing commercial Digital Video Broadcasting—Terrestrial transmitters as illuminators of opportunity. It works in a bistatic configuration, where the receiver is placed on a moving platform and the transmitter is placed on the ground and is stationary. The imaged scenes are stationary surfaces on Earth such as agriculture or urban areas, buildings, etc. In this letter, pioneering results of signal processing verified by a measurement campaign are presented. In the experiment, two synchronized passive radar receivers were mounted on a small airborne platform. The main goal of the presented experiment was to verify the possibility of ground imaging using passive SAR technology and validate previously presented theoretical results.

Description: nullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnull

Description: nullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnull

Description: nullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnul- nullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnull