ALBERT

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Description: Presents corrections to the paper, "Estimation of forest biomass from two-level model inversion of single-pass InSAR data" (Soja, M.J., et al.,Trans. Geosci. Remote Sens., vol. 53, no. 9, pp. 5083???5099, Sep. 2015).

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

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

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

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

Description: The temporal variations (diurnal and annual) in arboreal $(varepsilon_mathrm{Tree})$ and bare soil $(varepsilon_mathrm{Soil})$ dielectric constants and their correlation with precipitation were examined for several trees in Japan. A significant (1 $sigma$ (standard deviation) and 2 $sigma$ ) $varepsilon_mathrm{Tree}$ increase is observed after rainfall at 89.8% and 90.5% probability. However, rainfall does not always induce significant $varepsilon_mathrm{Tree}$ increases. Rainfall of more than 5 mm/day can induce 1 $sigma$ $varepsilon_mathrm{Tree}$ Tree increase at a 59.6% probability. In order to examine whether the increase in $varepsilon_mathrm{Tree}$ affects the L-band $sigma^{0}$ variation in a forest, the four-year temporal variation of the L-band backscattering coefficient $(sigma^{0})$ was estimated from observations by the Advanced Land Observing Satellite Phased Array type L-band Synthetic Aperture Radar. Observed maximum absolute deviations from the mean over the forest area were 1.0 and 1.2 dB for $sigma_{mathrm{HH}}^{0}$ and $sigma_mathrm{HV}^{0}$ , respectively, and 4.0 and 3.0 dB over open land. $sigma^{0}$ and rainfall correlations show that $varepsilon_mathrm{Tree}$ and $sigma_mathrm{Forest}^{0}$ are proportional to precipitation integrated over seven or eight days; $varepsilon_mathrm{Soil}$ and $sigma_mathrm{Open land}^{0}$ are proportional to precipitation integrated over three days. This finding indicates that $varepsilon_mathrm{Tree}$ variations influence $sigma_{mathrm{Forest areas}}^{0}$ . A stronger correlation between $sigma_mathrm{HV}^{0}$ and precipitation is observed in several sites with low $sigma_mathrm{HV}^{0}$ , where less biomass is expected, and several sites with high $sigma_mathrm{HV}^{0}$ , where more biomass is expected. A weaker correlation between $sigma_mathrm{HV}^{0}$ and precipitation is observed for several sites with high $sigma_mathrm{HV}^{0}$ . These differences may be explained by the different contributions of double bounce scattering and potential transpiration, which is a measure of the ability of the atmosphere to remove water from the surface th

Description: The spectral and radiometric quality of airborne imaging spectrometer data is affected by the anisotropic reflectance behavior of the imaged surface. Illumination and observation angle-dependent patterns of surface reflected radiation propagate into products, hinder quantitative assessment of biophysical/biochemical parameters, and decrease the comparability of data from multiple flight lines. The Ross–Li model, originally developed for multiangular observations, can be inverted to estimate and correct for surface anisotropy effects. This requires land cover be stratified into distinct types of scattering behavior. When the observations subsumed in these classes cover a range of view angles, a pseudo multiangular view on the surface can be employed to invert the Ross–Li model. A discrete land cover classification, however, bears the risk of inappropriate scattering correction resulting in spatial artifacts in the corrected data, predominantly in transition regions of two land cover types (e.g., soil and sparse vegetation with varying fractions). We invert the Ross–Li model on continuous land cover fraction layers. We decompose land cover in dominating structural types using linear spectral unmixing. Ross–Li kernel weights and formulations are estimated for each type independently; the correction is then applied pixel-wise according to the fractional distribution. The corrected Airborne Prism EXperiment imaging spectrometer data show significant reduction of anisotropic reflectance effects of up to 90% (average 60% to 75%, $p=0.05$ ), measured in the overlapping regions of adjacent flight lines. No spatial artifacts or spectral irregularities are observed after correction.

Description: Most spaceborne sensors have a tradeoff between high spatial and high temporal resolutions. This tradeoff limits the use of remote sensing data in various applications that require images in both the high spatial and high temporal resolutions. In this paper, we propose a novel technique to create a fine spatial and high temporal resolution images at a ground-based data processing system. Resourcesat-2 is one of the Indian Space Research Organization missions, and it carries the Linear Imaging Self-Scanning sensors (LISS III and LISS IV) and an Advanced Wide-Field Sensor (AWiFS) onboard. The spatial resolution of LISS III is 23.5 m, and that of AWiFS is 56 m. The temporal resolution of LISS III is 24 days, and that of AWiFS is five days. The proposed method creates a synthetic LISS-III image at 23.5-m spatial and five-day temporal resolutions. It is based on the subpixel relationship between a single AWiFS–LISS-III image pair, which is acquired before or after the prediction date. In temporal data composition, spurious spatial discontinuities are inevitable for land-cover type changes. These discontinuities were identified with temporal edge primitives and were smoothed with a spatial-profile-averaging method. A synthetic LISS-III image for time $t_{k}$ is predicted from an AWiFS image at time $t_{k}$ and a single AWiFS–LISS-III image pair at time $t_{0}$ , where $t_{0}ne t_{k}$ . Experimental results demonstrated that the proposed method is superior in terms of the computational efficiency and prediction accuracy with the other existing methods.

Description: Glacier avalanches are natural hazards that could damage infrastructures and threaten lives in high-altitude mountainous terrains. On April 7, 2012, a massive ice avalanche struck a Pakistani base at Gayari sector, Saltoro Valley, and buried/killed 148 soldiers and civilians. Keeping in view the catastrophe, a study was designed with the objectives to: 1) model and simulate the Gayari sector glacier avalanche incident in terms of height, extent, velocity, pressure, and momentum; 2) generate hazard risk assessment of possible other glacier avalanches in the Saltoro Valley through modeling and simulation; and 3) suitability analysis of current camp sites and recommendation of new safe camps sites locations in the Saltoro valley. To simulate the Gayari sector glacier event and other Glacier possible avalanches, a physical process-based rapid mass movements (RAMMS) was used. The RAMMS has two main components, i.e., Voellmy–Salm (VS) model and random kinetic energy, which deals with variables such as avalanche height and the mean avalanche velocity during the course of simulation. The suitability analysis of current camp sites were achieved using weighted overlay analysis with different constraints in ArcGIS Spatial Analyst. The RAMMS model simulation of the Gayari avalanche event predicted a maximum velocity of 74 ms -1 , generating a pressure of 5074 kPa and attaining a height of 45 m, whereas the predicted debris volume on the ground was 3.8145 million m 3 . A good agreement was found between actual debris height and extent, as compared with the RAMMS model output. The RAMMS model simulated all the potential tributary glacier avalanches of Saltoro valley very well. The weighted overlay analyses in ArcGIS Spatial Analyst revealed that the existing camp sites are safe and were not threatened by the glacier avalanche hazard. However, it was recommended that the Gayari camp should not be constructed at the same location and should be relocated- to the proposed safe camp sites identified in this research study. The proposed methodology developed in the current study could be applied in the Siachen conflict zone for avalanche hazard/risk analysis of all the camp sites located in the valley.

Description: Object-oriented remote sensing image classification is becoming more and more popular because it can integrate spatial information from neighboring regions of different shapes and sizes into the classification procedure to improve the mapping accuracy. However, object identification itself is difficult and challenging. Superpixels, which are groups of spatially connected similar pixels, have the scale between the pixel level and the object level and can be generated from oversegmentation. In this paper, we establish a new classification framework using a superpixel-based graphical model. Superpixels instead of pixels are applied as the basic unit to the graphical model to capture the contextual information and the spatial dependence between the superpixels. The advantage of this treatment is that it makes the classification less sensitive to noise and segmentation scale. The contribution of this paper is the application of a graphical model to remote sensing image semantic segmentation. It is threefold. 1) Gradient fusion is applied to multispectral images before the watershed segmentation algorithm is used for superpixel generation. 2) A probabilistic fusion method is designed to derive node potential in the superpixel-based graphical model to address the problem of insufficient training samples at the superpixel level. 3) A boundary penalty between the superpixels is introduced in the edge potential evaluation. Experiments on three real data sets were conducted. The results show that the proposed method performs better than the related state-of-the-art methods tested.

Description: We introduce a practical and accurate model, referred to as “GO4,” to describe near-nadir microwave scattering from the sea surface, and at the same time, we address the issue of the filtered mean square slope (mss) conventionally used in the geometrical optics model. GO4 is a simple correction of this last model, taking into account the diffraction correction induced by the rough surface through what we call an effective mean square curvature (msc). We evaluate the effective msc as a function of the surface wavenumber spectrum and the radar frequency and show that GO4 reaches the same accuracy as the physical optics model in a wide range of incidence and frequency bands with the sole knowledge of the mss and msc parameters. The key point is that the mss entering in GO4 is not the filtered but the total slope. We provide estimation of the effective msc on the basis of classical sea spectrum models. We also evaluate the effective msc from near-nadir satellite data in various bands and show that it is consistent with model predictions. Non-Gaussian effects are discussed and shown to be incorporated in the effective msc. We give some applications of the method, namely, the estimation of the total sea surface mss and the recalibration of relative radar cross sections.

Description: This paper evaluates the radiometric accuracy of observations from the Advanced Technology Microwave Sounder (ATMS) onboard Suomi National Polar-orbiting Partnership and Sondeur Atmospherique du Profil d' Humidité Intropicale par Radiométrie (SAPHIR) onboard Megha-Tropiques through intercalibration and validation versus in situ radiosonde and Global Positioning System Radio Occultation (GPS-RO) observations. SAPHIR and ATMS water vapor channels operate at slightly different frequencies. We calculated the bias due to radiometric errors as the difference between the observed and simulated differences between the two instruments. This difference, which is often referred to as double difference, ranges between 0.3 and 0.7 K, which shows good consistency between the instruments. We used a radiative transfer model to simulate the satellite brightness temperatures (Tbs) using radiosonde and GPS-RO profiles and then compared simulated and observed Tbs. The difference between radiosonde and ATMS Tbs for the middle and upper tropospheric temperature sounding channels was less than 0.5 K at most stations, but the difference between radiosonde and ATMS/SAPHIR Tbs for water vapor channels was between 0.5 and 2.0 K. The larger bias for the water vapor channels is mainly due to several errors in radiosonde humidity observations. The mean differences between the ATMS observations and the Tbs simulated using GPS-RO profiles were 0.2, 0.3, 0.4, 0.2, and −0.2 K for channels 10–14, respectively; and the uncertainty increases from 0.02 K for channel 10 to 0.07 K for channel 14.

Description: This paper presents a completely automatic processing chain for orthorectification of optical pushbroom sensors. The procedure is robust and works without manual intervention from raw satellite image to orthoimage. It is modularly divided in four main steps: metadata extraction, automatic ground control point (GCP) extraction, geometric modeling, and orthorectification. The GCP extraction step uses georeferenced vector roads as a reference and produces a file with a list of points and their accuracy estimation. The physical geometric model is based on collinearity equations and works with sensor-corrected (level 1) optical satellite images. It models the sensor position and attitude with second-order piecewise polynomials depending on the acquisition time. The exterior orientation parameters are estimated in a least squares adjustment, employing random sample consensus and robust estimation algorithms for the removal of erroneous points and fine-tuning of the results. The images are finally orthorectified using a digital elevation model and positioned in a national coordinate system. The usability of the method is presented by testing three RapidEye images of regions with different terrain configurations. Several tests were carried out to verify the efficiency of the procedure and to make it more robust. Using the geometric model, subpixel accuracy on independent check points was achieved, and positional accuracy of orthoimages was around one pixel. The proposed procedure is general and can be easily adapted to various sensors.

Description: This paper presents a new ground moving target imaging (GMTIm) algorithm for airborne synthetic aperture radar (SAR) based on a novel time-frequency representation (TFR), Lv's distribution (LVD). We first analyze generic moving target signatures for a multichannel SAR and then derive the analytical spectrum of a point target moving at a constant velocity by a polar format algorithm for SAR image formation. SAR motion deviation from a predetermined flight track is considered to facilitate airborne SAR applications. LVD, as a recently developed TFR for the analysis of multicomponent linear-frequency-modulated signal, is adopted to represent the target kinematic spectrum in the Doppler centroid frequency and chirp rate domain. As a result, the proposed SAR-GMTIm algorithm is capable of imaging multiple moving targets even when they are located at the same range resolution cell. Some practical issues such as imaging maneuvering targets and small/weak targets are discussed to enhance the applicability of the proposed algorithm. Simulation results with isotropic point moving targets are presented to validate the effectiveness and superiority of the proposed algorithm. Raw data collected by an airborne multichannel SAR are also used to verify the performance improvement made by the proposed algorithm.

Description: Satellite soil moisture estimates have received increasing attention over the past decade. This paper examines the applicability of estimating soil moisture states and soil hydraulic parameters through two particle filter (PF) methods: The PF with commonly used sampling importance resampling (PF-SIR) and the PF with recently developed Markov chain Monte Carlo sampling (PF-MCMC) methods. In a synthetic experiment, the potential of assimilating remotely sensed near-surface soil moisture measurements into a 1-D mechanistic soil water model (HYDRUS-1D) using both the PF-SIR and PF-MCMC algorithms is analyzed. The effects of satellite temporal resolution and accuracy, soil type, and ensemble size on the assimilation of soil moisture are analyzed. In a real data experiment, we first validate the Advanced Microwave Scanning Radiometer--Earth Observing System (AMSR-E) soil moisture products in the Oklahoma Little Washita Watershed. Aside from rescaling the remotely sensed soil moisture, a bias correction algorithm is implemented to correct the deep soil moisture estimate. Both the ascending and descending AMSR-E soil moisture data are assimilated into the HYDRUS-1D model. The synthetic assimilation results indicated that, whereas both updating schemes showed the ability to correct the soil moisture state and estimate hydraulic parameters, the PF-MCMC scheme is consistently more accurate than PR-SIR. For real data case, the quality of remotely sensed soil moisture impacts the benefits of their assimilation into the model. The PF-MCMC scheme brought marginal gains than the open-loop simulation in RMSE at both surface and root-zone soil layer, whereas the PF-SIR scheme degraded the open-loop simulation.

Description: We propose a new deterministic approach for remote sensing retrieval, called modified total least squares (MTLS), built upon the total least squares (TLS) technique. MTLS implicitly determines the optimal regularization strength to be applied to the normal equation first-order Newtonian retrieval using all of the noise terms embedded in the residual vector. The TLS technique does not include any constraint to prevent noise enhancement in the state space parameters from the existing noise in measurement space for an inversion with an ill-conditioned Jacobian. To stabilize the noise propagation into parameter space, we introduce an additional empirically derived regularization proportional to the logarithm of the condition number of the Jacobian and inversely proportional to the L2-norm of the residual vector. The derivation, operational advantages and use of the MTLS method are demonstrated by retrieving sea surface temperature from GOES-13 satellite measurements. An analytic equation is derived for the total retrieval error, and is shown to agree well with the observed error. This can also serve as a quality indicator for pixel-level retrievals. We also introduce additional tests from the MTLS solutions to identify contaminated pixels due to residual clouds, error in the water vapor profile and aerosols. Comparison of the performances of our new and other methods, namely, optimal estimation and regression-based retrieval, is performed to understand the relative prospects and problems associated with these methods. This was done using operational match-ups for 42 months of data, and demonstrates a relatively superior temporally consistent performance of the MTLS technique.

Description: Radar-based remote sensing for measurement of ocean surface waves presents advantages over conventional point sensors such as wave buoys. As its use becomes more widespread, it is important to understand the sensitivity of the extracted wave parameters to the characteristics of the radar and the scatterers. To examine such issues, experiments were performed offshore of the Scripps Institution of Oceanography pier in July 2010. Radar measurements in low wind speeds were performed with a dual-polarized high-resolution X-band pulse-Doppler radar at low grazing angles along with two independent measurements of the surface waves using conventional sensors, a GPS-based buoy, and an ultrasonic array. Comparison between radar cross section (RCS) and Doppler modulations shows peak values occurring nearly in-phase, in contrast with tilt modulation theory. Spectral comparisons between Doppler-based and RCS-based spectra show that Doppler-based spectra demonstrate greater sensitivity to swell-induced modulations, whereas RCS-based spectra show greater sensitivity to small-scale modulations (or generally have more noise at high frequency), and they equally capture energy at the wind wave peak. Doppler estimates of peak period were consistent with the conventional sensors, whereas the RCS differed in assignment of peak period to wind seas rather than swell in a couple of cases. Higher order period statistics of both RCS and Doppler were consistent with the conventional sensors. Radar-based significant wave heights are lower than buoy-based values and contain nontrivial variability of ∼33%. Comparisons between HH and VV polarization data show that VV data more accurately represent the wave field, particularly as the wind speeds decrease.

Description: Polarimetric synthetic aperture radar satellite and ground-based Ku- and X-band scatterometer measurements are used to explore the scattering mechanism for ice in shallow Arctic lakes, wherein strong radiometric responses are seen for floating ice, and low returns are evident where the ice has grounded. Scatterometer measurements confirm that high backscatter is from the ice/water interface, whereas polarimetric decomposition suggests that the dominant scattering mechanism from that interface is single bounce. Using Fresnel equations, a simple model for surface bounce from the ice/water interface is proposed, and its predictions are supported by experimental parameters such as co-pol phase difference, co-pol ratio, and the results of rigorous numerical modeling. Despite early research suggesting double-bounce scattering from columnar air bubbles and the ice/water interface as the dominant scattering mechanism in shallow lakes, this paper strongly supports a single-bounce model.

Description: The on-orbit radiometric calibration of the reflective solar bands (RSBs) of the Visible Infrared Imaging Radiometer Suite (VIIRS) aboard the Suomi National Polar-orbiting Partnership satellite is carried out primarily through observations of a fully illuminated solar diffuser (SD) panel. Accurate knowledge of the solar spectral radiance scattered from the SD is available. The sensor aperture spectral radiance is assumed to be a quadratic polynomial function of a VIIRS detector's background-subtracted response in digital number. The coefficients of the polynomial were initially determined prelaunch. Once on orbit, we assume that these coefficients change uniformly by a common calibration factor, which is referred to as the $F$ -factor. The known solar spectral radiance scattered from a fully illuminated SD allows for the determination of these $F$ -factors. We describe the methodology and the associated algorithms used in the calculation of the RSB $F$ -factors. Our results show that the $F$ -factors change over time, with the largest change occurring at a wavelength of 862 nm (with a value of about 1.55 on day 950 after the satellite launch, relative to its value at the beginning of the launch) . In addition, we estimate the relative error standard deviations of the computed top-of-the-atmosphere reflectance at the detector pixel level. On day 950 of the mission, the relative error standard deviations are all less or equal to 0.016, except for the M11 band (band central wavelength of 2257 nm) , which has a relative error standard deviation of about 0.049 due to a very low signal-to-noise ratio.

Description: This installment of Computer's series highlighting the work published in IEEE Computer Society journals comes from IEEE Transactions on Visualization and Computer Graphics. The Web extra at http://youtu.be/E1PVTitj7h0 is a video demonstration of a novel solution to multivariate data visualization that helps users interactively explore data by combining standard presentations, from detailed views to high-level overviews.

Description: The data rearrangement engine (DRE) performs in-memory data restructuring to accelerate irregular, data-intensive applications. An emulation on a field-programmable gate array shows how the DRE could improve speedup, memory bandwidth, and energy consumption on three representative benchmarks.

Description: Advertisement, IEEE.

Description: The goal of cross-domain matching (CDM) is to find correspondences between two sets of objects in different domains in an unsupervised way. CDM has various interesting applications, including photo album summarization where photos are automatically aligned into a designed frame expressed in the Cartesian coordinate system, and temporal alignment which aligns sequences such as videos that are potentially expressed using different features. In this paper, we propose an information-theoretic CDM framework based on squared-loss mutual information (SMI). The proposed approach can directly handle non-linearly related objects/sequences with different dimensions, with the ability that hyper-parameters can be objectively optimized by cross-validation. We apply the proposed method to several real-world problems including image matching, unpaired voice conversion, photo album summarization, cross-feature video and cross-domain video-to-mocap alignment, and Kinect -based action recognition, and experimentally demonstrate that the proposed method is a promising alternative to state-of-the-art CDM methods.

Description: The skeleton of a 2D shape is an important geometric structure in pattern analysis and computer vision. In this paper we study the skeleton of a 2D shape in a two-manifold $mathcal {M}$ , based on a geodesic metric. We present a formal definition of the skeleton $S(Omega )$ for a shape $Omega$ in $mathcal {M}$ and show several properties that make $S(Omega )$ distinct from its Euclidean counterpart in $mathbb {R}^2$ . We further prove that for a shape sequence $lbrace Omega _irbrace$ that converge to a shape $Omega$ in $mathcal {M}$ , the mapping $Omega righta- row overline{S}(Omega )$ is lower semi-continuous. A direct application of this result is that we can use a set $P$ of sample points to approximate the boundary of a 2D shape $Omega$ in $mathcal {M}$ , and the Voronoi diagram of $P$ inside $Omega subset mathcal {M}$ gives a good approximation to the skeleton $S(Omega )$ . Examples of skeleton computation in topography and brain morphometry are illustrated.

Description: A widely used approach for locating points on deformable objects in images is to generate feature response images for each point, and then to fit a shape model to these response images. We demonstrate that Random Forest regression-voting can be used to generate high quality response images quickly. Rather than using a generative or a discriminative model to evaluate each pixel, a regressor is used to cast votes for the optimal position of each point. We show that this leads to fast and accurate shape model matching when applied in the Constrained Local Model framework. We evaluate the technique in detail, and compare it with a range of commonly used alternatives across application areas: the annotation of the joints of the hands in radiographs and the detection of feature points in facial images. We show that our approach outperforms alternative techniques, achieving what we believe to be the most accurate results yet published for hand joint annotation and state-of-the-art performance for facial feature point detection.

Description: We present a novel method to recognise planar structures in a single image and estimate their 3D orientation. This is done by exploiting the relationship between image appearance and 3D structure, using machine learning methods with supervised training data. As such, the method does not require specific features or use geometric cues, such as vanishing points. We employ general feature representations based on spatiograms of gradients and colour, coupled with relevance vector machines for classification and regression. We first show that using hand-labelled training data, we are able to classify pre-segmented regions as being planar or not, and estimate their 3D orientation. We then incorporate the method into a segmentation algorithm to detect multiple planar structures from a previously unseen image.

Description: Multiple view segmentation consists in segmenting objects simultaneously in several views. A key issue in that respect and compared to monocular settings is to ensure propagation of segmentation information between views while minimizing complexity and computational cost. In this work, we first investigate the idea that examining measurements at the projections of a sparse set of 3D points is sufficient to achieve this goal. The proposed algorithm softly assigns each of these 3D samples to the scene background if it projects on the background region in at least one view, or to the foreground if it projects on foreground region in all views. Second, we show how other modalities such as depth may be seamlessly integrated in the model and benefit the segmentation. The paper exposes a detailed set of experiments used to validate the algorithm, showing results comparable with the state of art, with reduced computational complexity. We also discuss the use of different modalities for specific situations, such as dealing with a low number of viewpoints or a scene with color ambiguities between foreground and background.

Description: Text detection in natural scene images is an important prerequisite for many content-based image analysis tasks, while most current research efforts only focus on horizontal or near horizontal scene text. In this paper, first we present a unified distance metric learning framework for adaptive hierarchical clustering, which can simultaneously learn similarity weights (to adaptively combine different feature similarities) and the clustering threshold (to automatically determine the number of clusters). Then, we propose an effective multi-orientation scene text detection system, which constructs text candidates by grouping characters based on this adaptive clustering. Our text candidates construction method consists of several sequential coarse-to-fine grouping steps: morphology-based grouping via single-link clustering, orientation-based grouping via divisive hierarchical clustering, and projection-based grouping also via divisive clustering. The effectiveness of our proposed system is evaluated on several public scene text databases, e.g., ICDAR Robust Reading Competition data sets (2011 and 2013), MSRA-TD500 and NEOCR. Specifically, on the multi-orientation text data set MSRA-TD500, the $f$ measure of our system is $71$ percent, much better than the state-of-the-art performance. We also construct and release a practical challenging multi-orientation scene text data set (USTB-SV1K), which is available at http://prir.ustb.edu.cn/TexStar/MOMV-text-detection/.

Description: Digital circuits are expected to increasingly suffer from more hard faults due to technology scaling. Especially, a single hard fault in ALU (Arithmetic Logic Unit) might lead to a total failure in processors or significantly reduce their performance. To address these increasingly important problems, we propose a novel cost-efficient fault-tolerant mechanism for the ALU, called LIZARD. LIZARD employs two half-word ALUs, instead of a single full-word ALU, to perform computations with concurrent fault detection. When a fault is detected, the two ALUs are partitioned into four quarter-word ALUs. After diagnosing and isolating a faulty quarter-word ALU, LIZARD continues its operation using the remaining ones, which can detect and isolate another fault. Even though LIZARD uses narrow ALUs for computations, it adds negligible performance overhead through exploiting predictability of the results in the arithmetic computations. We also present the architectural modifications when employing LIZARD for scalar as well as superscalar processors. Through comparative evaluation, we demonstrate that LIZARD outperforms other competitive fault-tolerant mechanisms in terms of area, energy consumption, performance and reliability.

Description: Information searches are the most common application within social networks. Normally, the social network is modeled as a network graph, consisting of nodes (In the rest of the paper, unless otherwise specified, we will use the terms “user” and “node” interchangeably.) representing users within the network and edges representing relationships between users. Choosing the appropriate nodes to form an auxiliary structure for supporting the effective query message spreading can reduce the troublesome repeated queries. To accomplish this, a hybrid search (HS) scheme is proposed. If the query message is received by a node belonging the auxiliary structure constructed by dynamic weighted distributed label clustering (DW-DLC), it would be flooded to all neighbors of the visited node; otherwise, it would be forwarded to one neighbor of the visited node. The DW-DLC based auxiliary structure can accelerate the process of obtaining required information within the network. The simulation results show that the HS+DW-DLC scheme can reduce the average searching delay time, even in a required-information-scarce social network. In addition, the proposed scheme can generate a relatively low amount of repeated messages to lower repeatedly asking social network users.

Description: This paper presents a derivation of four radix-2 division algorithms by digit recurrence. Each division algorithm selects a quotient digit from the over-redundant digit set {−2, −1, 0, 1, 2}, and the selection of each quotient digit depends only on the two most-significant digits of the partial remainder in a redundant representation. Two algorithms use a two’s complement representation for the partial remainder and carry-save additions, and the other two algorithms use a binary signed-digit representation for the partial remainder and carry-free additions. Three algorithms are novel. The fourth algorithm has been presented before. Results from the synthesized netlists show that two of our fastest algorithms achieve an improvement of 10 percent in latency per iteration over a standard radix-2 SRT algorithm at the cost of 36 percent more power and 50 percent more area.

Description: We present WaFS, a user-level file system, and a related scheduling algorithm for scientific workflow computation in the cloud. WaFS’s primary design goal is to automatically detect and gather the explicit and implicit data dependencies between workflow jobs, rather than high-performance file access. Using WaFS’s data, a workflow scheduler can either make effective cost-performance tradeoffs or improve storage utilization. Proper resource provisioning and storage utilization on pay-as-you-go clouds can be more cost effective than the uses of resources in traditional HPC systems. WaFS and the scheduler controls the number of concurrent workflow instances at runtime so that the storage is well used, while the total makespan (i.e., turnaround time for a workload) is not severely compromised. We describe the design and implementation of WaFS and the new workflow scheduling algorithm based on our previous work. We present empirical evidence of the acceptable overheads of our prototype WaFS and describe a simulation-based study, using representative workflows, to show the makespan benefits of our WaFS-enabled scheduling algorithm.

Description: Given a database table with records that can be ranked, an interesting problem is to identify selection conditions for the table, which are qualified by an input record and render its ranking as high as possible among the qualifying tuples. In this paper, we study this standing maximization problem, which finds application in object promotion and characterization. After showing the hardness of the problem, we propose greedy methods, which are experimentally shown to achieve high accuracy compared to exhaustive enumeration, while scaling very well to the problem input size. Our contributions include a linear-time algorithm for determining the optimal selection range for an ordinal attribute and techniques for choosing and prioritizing the most promising selection predicates to apply. Experiments on real datasets confirm the effectiveness and efficiency of our techniques.

Description: Some fairly recent research has focused on providing XACML-based solutions for dynamic privacy policy management. In this regard, a number of works have provided enhancements to the performance of XACML policy enforcement point (PEP) component, but very few have focused on enhancing the accuracy of that component. This paper improves the accuracy of an XACML PEP by filling some gaps in the existing works. In particular, dynamically incorporating user access context into the privacy policy decision, and its enforcement. We provide an XACML-based implementation of a dynamic privacy policy management framework and an evaluation of the applicability of our system in comparison to some of the existing approaches.

Description: This paper first introduces pattern aided regression (PXR) models, a new type of regression models designed to represent accurate and interpretable prediction models. This was motivated by two observations: (1) Regression modeling applications often involve complex diverse predictor-response relationships , which occur when the optimal regression models (of given regression model type) fitting two or more distinct logical groups of data are highly different. (2) State-of-the-art regression methods are often unable to adequately model such relationships. This paper defines PXR models using several patterns and local regression models, which respectively serve as logical and behavioral characterizations of distinct predictor-response relationships. The paper also introduces a contrast pattern aided regression (CPXR) method, to build accurate PXR models. In experiments, the PXR models built by CPXR are very accurate in general, often outperforming state-of-the-art regression methods by big margins. Usually using (a) around seven simple patterns and (b) linear local regression models, those PXR models are easy to interpret; in fact, their complexity is just a bit higher than that of (piecewise) linear regression models and is significantly lower than that of traditional ensemble based regression models. CPXR is especially effective for high-dimensional data. The paper also discusses how to use CPXR methodology for analyzing prediction models and correcting their prediction errors.

Description: This paper presents an anomaly detection model that is granular and distributed to accurately and efficiently identify sensed data anomalies within wireless sensor networks. A more decentralised mechanism is introduced with wider use of in-network processing on a hierarchical sensor node topology resulting in a robust framework for dynamic data domains. This efficiently addresses the big data issue that is encountered in large scale industrial sensor network applications. Data vectors on each node’s observation domain is first partitioned using an unsupervised approach that is adaptive regarding dynamic data streams using cumulative point-wise entropy and average relative density . Second order statistical analysis applied on average relative densities and mean entropy values is then used to differentiate anomalies through robust and adaptive thresholds that are responsive to a dynamic environment. Anomaly detection is then performed in a non-parametric and non-probabilistic manner over the different network tiers in the hierarchical topology in offering increased granularity for evaluation. Experiments were performed extensively using both real and artificial data distributions representative of different dynamic and multi-density observation domains. Results demonstrate higher accuracies in detection as more than 94 percent accompanied by a desirable reduction of more than 85 percent in communication costs when compared to existing centralized methods.

Description: We analyze models for predicting the probability of a strikeout for a batter/pitcher matchup in baseball using player descriptors that can be estimated accurately from small samples. We start with the log5 model which has been used extensively for describing matchups in sports. Log5 is a special case of a logit model and we use constrained logistic regression over nearly one million matchup observations to assess the use of the log5 explanatory variables for this application. We also show that a batter/pitcher ground ball rate interaction variable is significant for the prediction of strikeout probability and we provide physical justification for the inclusion of this variable in the model. We quantify the differences among the models and show that batters control the majority of the variance in predicted strikeout rate.

Description: This study proposes a quantitative measurement of split of the second heart sound (S2) based on nonstationary signal decomposition to deal with overlaps and energy modeling of the subcomponents of S2. The second heart sound includes aortic (A2) and pulmonic (P2) closure sounds. However, the split detection is obscured due to A2-P2 overlap and low energy of P2. To identify such split, HVD method is used to decompose the S2 into a number of components while preserving the phase information. Further, A2s and P2s are localized using smoothed pseudo Wigner-Ville distribution followed by reassignment method. Finally, the split iscalculated by taking the differences between the means of time indices of A2s and P2s. Experiments on total 33 clips of S2 signals are performed for evaluation of the method. The mean ± standard deviation of the split is 34.7 ± 4.6 ms. The method measures the splitefficiently, even when A2-P2 overlap is ≤ 20 ms and the normalized peak temporal ratio of P2 to A2 is low (≥ 0.22). This proposed method thus, demonstrates its robustness by defining split detectability (SDT), the split detection aptness through detecting P2s, by measuring upto 96 percent. Such findings reveal the effectiveness of the method as competent against the other baselines, especially for A2-P2 overlaps and low energy P2.

Description: Post-acquisition denoising of magnetic resonance (MR) images is an important step to improve any quantitative measurement of the acquired data. In this paper, assuming a Rician noise model, a new filtering method based on the linear minimum mean square error (LMMSE) estimation is introduced, which employs the self-similarity property of the MR data to restore the noise-less signal. This method takes into account the structural characteristics of images and the Bayesian mean square error (Bmse) of the estimator to address the denoising problem. In general, a twofold data processing approach is developed; first, the noisy MR data is processed using a patch-based L 2 -norm similarity measure to provide the primary set of samples required for the estimation process. Afterwards, the Bmse of the estimator is derived as the optimization function to analyze the pre-selected samples and minimize the error between the estimated and the underlying signal. Compared to the LMMSE method and also its recently proposed SNR-adapted realization (SNLMMSE), the optimized way of choosing the samples together with the automatic adjustment of the filtering parameters lead to a more robust estimation performance with our approach. Experimental results show the competitive performance of the proposed method in comparison with related state-of-the-art methods.

Description: Large-scale ad hoc analytics of genomic data is popular using the R-programming language supported by over 700 software packages provided by Bioconductor. More recently, analytical jobs are benefitting from on-demand computing and storage, their scalability and their low maintenance cost, all of which are offered by the cloud. While biologists and bioinformaticists can take an analytical job and execute it on their personal workstations, it remains challenging to seamlessly execute the job on the cloud infrastructure without extensive knowledge of the cloud dashboard. How analytical jobs can not only with minimum effort be executed on the cloud, but also how both the resources and data required by the job can be managed is explored in this paper. An open-source light-weight framework for executing R-scripts using Bioconductor packages, referred to as ‘RBioCloud’, is designed and developed. RBioCloud offers a set of simple command-line tools for managing the cloud resources, the data and the execution of the job. Three biological test cases validate the feasibility of RBioCloud. The framework is available from http://www.rbiocloud.com .

Description: Of major interest to translational genomics is the intervention in gene regulatory networks (GRNs) to affect cell behavior; in particular, to alter pathological phenotypes. Owing to the complexity of GRNs, accurate network inference is practically challenging and GRN models often contain considerable amounts of uncertainty. Considering the cost and time required for conducting biological experiments, it is desirable to have a systematic method for prioritizing potential experiments so that an experiment can be chosen to optimally reduce network uncertainty. Moreover, from a translational perspective it is crucial that GRN uncertainty be quantified and reduced in a manner that pertains to the operational cost that it induces, such as the cost of network intervention. In this work, we utilize the concept of mean objective cost of uncertainty (MOCU) to propose a novel framework for optimal experimental design. In the proposed framework, potential experiments are prioritized based on the MOCU expected to remain after conducting the experiment. Based on this prioritization, one can select an optimal experiment with the largest potential to reduce the pertinent uncertainty present in the current network model. We demonstrate the effectiveness of the proposed method via extensive simulations based on synthetic and real gene regulatory networks.

Description: A novel approach to Contact Map Overlap (CMO) problem is proposed using the two dimensional clusters present in the contact maps. Each protein is represented as a set of the non-trivial clusters of contacts extracted from its contact map. The approach involves finding matching regions between the two contact maps using approximate 2D-pattern matching algorithm and dynamic programming technique. These matched pairs of small contact maps are submitted in parallel to a fast heuristic CMO algorithm. The approach facilitates parallelization at this level since all the pairs of contact maps can be submitted to the algorithm in parallel. Then, a merge algorithm is used in order to obtain the overall alignment. As a proof of concept, MSVNS, a heuristic CMO algorithm is used for global as well as local alignment. The divide and conquer approach is evaluated for two benchmark data sets that of Skolnick and Ding et al. It is interesting to note that along with achieving saving of time, better overlap is also obtained for certain protein folds.

Description: Canalizing genes possess broad regulatory power over a wide swath of regulatory processes. On the other hand, it has been hypothesized that the phenomenon of intrinsically multivariate prediction (IMP) is associated with canalization. However, applications have relied on user-selectable thresholds on the IMP score to decide on the presence of IMP. A methodology is developed here that avoids arbitrary thresholds, by providing a statistical test for the IMP score. In addition, the proposed procedure allows the incorporation of prior knowledge if available, which can alleviate the problem of loss of power due to small sample sizes. The issue of multiplicity of tests is addressed by family-wise error rate (FWER) and false discovery rate (FDR) controlling approaches. The proposed methodology is demonstrated by experiments using synthetic and real gene-expression data from studies on melanoma and ionizing radiation (IR) responsive genes. The results with the real data identified DUSP1 and p53, two well-known canalizing genes associated with melanoma and IR response, respectively, as the genes with a clear majority of IMP predictor pairs. This validates the potential of the proposed methodology as a tool for discovery of canalizing genes from binary gene-expression data. The procedure is made available through an R package.

Description: We present simplified expressions for the cross-polarized backscatter of a randomly rough surface predicted by the second-order small-slope approximation (SSA2). The simplification is based on appropriate polynomial approximations of the SSA2 kernel function. We obtain numerically efficient expressions for the cross-polarized backscattering amplitude of a deterministic surface in the form of a single space integral involving only the surface elevation and the second (mixed) derivative of the surface elevation. The ensemble average normalized radar cross section is then derived under a Gaussian random process assumption for the surface. The resulting expression has the form of a Kirchhoff integral involving the roughness correlation function and its second- and fourth-order cross-derivatives. Further simplification is achieved for off-nadir observations using a high-frequency approximation; the result is an analytical formula involving only the resonant curvature and the radar-filtered mean square slope in the out-of-plane direction. A numerical validation of the simplified expressions is provided by comparison with exact SSA2 predictions in representative test cases. The dependence of cross-polarized backscattering on the incidence angle as well as wind speed and direction is then investigated for the case of a directional sea surface model. At near nadir incidence, a clear maximum in azimuth of the cross-polarized backscatter is observed for radar look directions 45 $^{circ}$ from the wind direction.

Description: Prospective authors are requested to submit new, unpublished manuscripts for inclusion in the upcoming event described in this call for papers.

Description: Kalyani Nair reviews "Multiscale Modeling in Biomechanics and Mechanobiology", edited by S. De, W. Hwang, and E. Kuhl, declaring it useful for anyone looking to get a quick overview of the field over a broad spectrum of areas.

Description: Presents the information on the 2016 Richard E. Merwin Distinguished Service Award.

Description: As part of the Naming the Pain in Requirements Engineering (NaPiRE) initiative, researchers compared problems that companies in Brazil and Germany encountered during requirements engineering (RE). The key takeaway was that in RE, human interaction is necessary for eliciting and specifying high-quality requirements, regardless of country, project type, or company size.

Description: A swift execution from idea to market has become a key competitive advantage for software companies to enable them to survive and grow in turbulent business environments. To combat this challenge, companies are using hackathons. A hackathon is a highly engaging, continuous event in which people in small groups produce working software prototypes in a limited amount of time. F-Secure, a software product company, views hackathons as a possible solution to the fundamental business problem of how to make revenue from an idea, spanning the phases from creating the idea to producing a software prototype. However, hackathons pose the challenge of how to transform those promising prototypes into finalized products that create revenue and real business value.

Description: "The Karlskrona Manifesto on Sustainability Design" is a call for discussion and action on the challenge of sustainability and its relation to software engineering. The manifesto aims to create common ground and develop a reference point for the global community of research and practice in software and sustainability. The Web extra at http://youtu.be/PXhFgswJPco is an audio podcast in which author Birgit Penzenstadler provides an audio recording of this column.

Description: Software adaptation has become prominent owing to the proliferation of software in everyday devices. In particular, computing with the Internet of Things requires adaptability. Traditional software maintenance, which involves long, energy-consuming cycles, is no longer satisfactory. Adaptation is a lightweight software evolution that provides more transparent maintenance for users. This article classifies types of adaptation and describes an implementation of it.

Description: There's much discussion about being open, with topics such as open source software, open innovation, open research, and open education. Will the whole world be open, and, if so, what was all closed in the past? The authors analyze the similarities and differences between the open movements they've been part of and come up with expectations for software's future.

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

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

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

Description: The synoptic determination of ocean circulation using the data acquired from space, with a coherent depiction of its turbulent characteristics, remains a fundamental challenge in oceanography. This determination has the potential of revealing all aspects of the ocean dynamic variability on a wide range of spatiotemporal scales and will enhance our understanding of ocean–atmosphere exchanges at superresolution, as required in the present context of climate change. Here, we show a four-year time series of spatial superresolution (4 km) turbulent ocean dynamics generated from satellite data using emerging ideas in signal processing coming from nonlinear physics, low-resolution dynamics, and superresolution oceanic sea surface temperature data acquired from optical sensors. The method at its core consists in propagating across the scales the low-resolution dynamics in a multiresolution analysis computed on adimensional critical transition information.

Description: This paper presents the theory, algorithm, and results of a new bistatic interferometry synthetic aperture radar (InSAR) method. It employs the data acquired in an innovative bistatic configuration, which uses the orbital sensors as transmitters of opportunity and the stationary receivers on the ground, to generate a digital elevation model (DEM). In the bistatic spaceborne/stationary InSAR configuration, the interferometric phase only depends on the target-receiver range, which could not be obtained directly from the measured bistatic range. Therefore, the conventional transforming relationship between the interferometric phase and the topographic height is no longer practical. In order to solve the problem, we introduce a new conversion relationship between the interferometric phase and the topographic height, which is derived by the model of the ellipsoidal projection in the bistatic configuration. Meanwhile, the error analysis of the new conversion is carried out through a simulation. Both the simulated and measured data are used to test and verify the feasibility of the new bistatic InSAR method. In the spaceborne/stationary InSAR experiment, YaoGan-3 (an L-band spaceborne SAR system launched by China) was selected as the transmitter and two stationary receivers were mounted on the top of a tall building. The generated DEM of high quality shows that the presented method performs very well in the bistatic InSAR data process.

Description: We present a nonparametric Bayesian hierarchical model (HDP_IBPs) to classify very high resolution panchromatic satellite images in an unsupervised way, in which the hierarchical Dirichlet process (HDP) and Indian buffet process (IBP) are combined on multiple scenes. The main contribution of this paper is a novel application framework to solve the problems of traditional probabilistic topic models and achieve the effective unsupervised classification of very high resolution (VHR) panchromatic satellite images. In this framework, a VHR satellite image is first oversegmented into basic processing units and divided into a set of subimages. We use the Chinese restaurant franchise process as a construct method of the HDP to capture the latent semantic structures (i.e., classes) and the class proportion (i.e., co-occurrence of topics) for each subimage. Meanwhile, the subimages are grouped into different scenes based on the class proportion. Finally, the IBP is employed to select the most appropriate classes for each subimage from all of the classes based on different scenes in turn. The hierarchical structure of our model transmits the spatial information from the original image to the scene layer implicitly and provides useful cues of classification. The experimental results show that HDP_IBPs outperforms state-of-the-art models in terms of both qualitative and quantitative evaluations.

Description: This paper describes a linear-image-transform-based algorithm for reducing stripe noise, track line artifacts, and motion-induced errors in remote sensing data. Developed for multibeam bathymetry (MB), the method has also been used for removing scalloping in synthetic aperture radar images. The proposed image transform is the composition of an invertible edge detection operator and a fast discrete Radon transform (DRT) due to Götz, Druckmüller, and Brady. The inverse DRT is computed by using an iterative method and exploiting an approximate inverse algorithm due to Press. The edge operator is implemented by circular convolution with a Laplacian point spread function modified to render the operator invertible. In the transformed image, linear discontinuities appear as high-intensity spots, which may be reset to zero. In MB data, a second noise signature is linked to motion-induced errors. A Chebyshev approximation of the original image is subtracted before applying the transform, and added back to the denoised image; this is necessary to avoid boundary effects. It is possible to process data faster and suppress motion-induced noise further by filtering images in nonoverlapping blocks using a matrix representation for the inverse DRT. Processed test images from several MB data sets had less noise and distortion compared with those obtained with standard low-pass filters. Denoising also improved the accuracy in statistical classification of geomorphological type by 10–28% for two sets of invariant terrain features.

Description: Sparse graph embedding (SGE) is a promising technique useful for the nonlinear feature extraction (FE) of hyperspectral images (HSIs). However, such images exhibit spatial variability and spectral multimodality, presenting challenges to existing FE methods, including SGE. To address this issue, this paper presents two novel SGE methods for HSI classification. One method, which is termed simultaneous SGE (SSGE), is designed to consider the spatial variability of spectral signatures by using a simultaneous sparse representation (SSR) model integrated with a shape-adaptive neighborhood building approach. In addition, a sparse graph is constructed via matrix computation based on sparse codes. Then, low-dimensional features are produced by employing linear graph embedding (LGE) based on the constructed sparse graph. The other method, which is termed simultaneous sparse multimanifold learning (SSMML), is proposed to handle the multimodality of an HSI. In SSMML, multiple views are generated to represent different modalities. Then, multiview-oriented submanifolds are produced by adopting SSGE, and they are further integrated via coregularization. SSGE is capable of modeling both local and global data structures. Furthermore, SSMML serves as a prototype that can model multimodal data structures. The proposed methods are evaluated by using sparse multinomial logistic regression for HSI classification. Experimental results with two popular hyperspectral data sets validate the good performance of the two methods in producing more representative low-dimensional features and yielding superior classification results compared with other related approaches.

Description: We present a new algorithm that simultaneously retrieves aerosol properties and land surface bidirectional reflectance distribution function (BRDF) over Australian from Advanced Along-Track Scanning Radiometer images. Three key components are addressed: 1) an analytical radiative transfer formulation, based on Green's function, linking top-of-atmosphere (TOA) reflectance to the surface BRDF; 2) a novel approach to modeling BRDF using an extended compositing period; and 3) a set of representative aerosol models based on a published typology of Australian aerosols. Due to the generally low aerosol loadings and widespread bright surfaces over Australia, BRDF modeling is crucial. By using a 9-month compositing period, 90% of the Australian continent can be modeled with an error in the forward-to-nadir reflectance ratio of 2.5% or less. Comparison with suitably processed Moderate Resolution Imaging Spectroradiometer BRDF/albedo products demonstrates satisfactory agreement. For the studying period from 2002 to 2008, validation of aerosol optical depth (AOD) against eight sun photometers across Australia encompassing widely different atmospheric and surface regimes shows high accuracy, with a mean absolute error in AOD at 550 nm of 0.03 and a bias of 0.007. About 60% of the matchup points are within an absolute error of 0.03, 80% are within 0.05, and 96% are within 0.1. The algorithm selects for each cell an optimal aerosol type from a set of four predefined candidate models. Continental aerosol maps derived from the new method indicate broadscale agreement with known seasonal aerosol sources, while providing new insights into the spatial and temporal distributions of aerosol over the Australian continent.

Description: This investigation examines the phenomenology effects of the squint angle on the morphology of moving target smears in spotlight synthetic aperture radar (SAR). This analysis includes both the smears resulting from standard image formation applied to simulated radar measurements as well as the theoretical predictions for the central contours of the signatures. In particular, this paper generates the down-range and cross-range components of the predicted central 2-D contours of mover signatures, including the locations of the cross-range offsets. The analytics for squinted geometry include additional contributions in the signature contour equations that do not arise for the case of broadside imaging. These terms can affect the overall contour morphology, particularly in terms of shape and extent. Numerous examples are presented to demonstrate that the signature prediction equations yield excellent agreement with standard image formation with simulated radar data. Therefore, this analysis can provide an effective tool in predicting the shape, extent, and location of smears due to arbitrarily moving surface targets for squinted spotlight SAR.

Description: In this paper, we consider signal subspace estimation based on low-rank representation for hyperspectral imagery. It is often assumed that major signal sources occupy a low-rank subspace. Due to the mixed nature of hyperspectral remote sensing data, the underlying data structure may include multiple subspaces instead of a single subspace. Therefore, in this paper, we propose the use of low-rank subspace representation to estimate the number of subspaces in hyperspectral imagery. In particular, we develop simple estimation approaches without user-defined parameters because these parameters can be fixed as constants. Both real data experiments and computer simulations demonstrate excellent performance of the proposed approaches over those currently in the literature.

Description: The conventional spaced-receiver approach uses amplitude scintillations to estimate equatorial ionospheric irregularity drift velocities. This approach is less applicable at high latitudes where there is a lack of substantial amplitude scintillations. This paper presents a method to estimate ionosphere irregularity horizontal drift velocities based on GPS signal carrier phase measurements. Joint time–frequency analysis of the carrier phase measurements using an adaptive periodogram technique generates time-varying spectrograms of ionospheric irregularity-induced phase fluctuations. Cross correlation of the spectrograms between antenna pairs provides time lag information on propagating radio signals through the same ionospheric structure. The time lag information is combined with known positions of the receiver array, satellite orbits, and assumed irregularity altitude to infer ionospheric irregularity horizontal drift velocity. This paper presents the methodology and demonstrates its feasibility using data collected by a GPS receiver array at Gakona, Alaska. The potential error sources of this method are also analyzed.

Description: License plate recognition is a computer vision method that identifies vehicles from their license plates. The most crucial step of such a system is accurate localization of the plate. The authors propose a system for automatic recognition that has three phases: image capture, plate localization, and license plate number recognition. They tested their methodology on 40 different car models with different types of license plates.

Description: A novel approach for event summarization and rare event detection is proposed. Unlike conventional methods that deal with event summarization and rare event detection independently, our method solves them in a single framework by transforming them into a graph editing problem. In our approach, a video is represented by a graph, each node of which indicates an event obtained by segmenting the video spatially and temporally. The edges between nodes describe the relationship between events. Based on the degree of relations, edges have different weights. After learning the graph structure, our method finds subgraphs that represent event summarization and rare events in the video by editing the graph, that is, merging its subgraphs or pruning its edges. The graph is edited to minimize a predefined energy model with the Markov Chain Monte Carlo (MCMC) method. The energy model consists of several parameters that represent the causality, frequency, and significance of events. We design a specific energy model that uses these parameters to satisfy each objective of event summarization and rare event detection. The proposed method is extended to obtain event summarization and rare event detection results across multiple videos captured from multiple views. For this purpose, the proposed method independently learns and edits each graph of individual videos for event summarization or rare event detection. Then, the method matches the extracted multiple graphs to each other, and constructs a single composite graph that represents event summarization or rare events from multiple views. Experimental results show that the proposed approach accurately summarizes multiple videos in a fully unsupervised manner . Moreover, the experiments demonstrate that the approach is advantageous in detecting rare transition of events .

Description: Object tracking has been one of the most important and active research areas in the field of computer vision. A large number of tracking algorithms have been proposed in recent years with demonstrated success. However, the set of sequences used for evaluation is often not sufficient or is sometimes biased for certain types of algorithms. Many datasets do not have common ground-truth object positions or extents, and this makes comparisons among the reported quantitative results difficult. In addition, the initial conditions or parameters of the evaluated tracking algorithms are not the same, and thus, the quantitative results reported in literature are incomparable or sometimes contradictory. To address these issues, we carry out an extensive evaluation of the state-of-the-art online object-tracking algorithms with various evaluation criteria to understand how these methods perform within the same framework. In this work, we first construct a large dataset with ground-truth object positions and extents for tracking and introduce the sequence attributes for the performance analysis. Second, we integrate most of the publicly available trackers into one code library with uniform input and output formats to facilitate large-scale performance evaluation. Third, we extensively evaluate the performance of 31 algorithms on 100 sequences with different initialization settings. By analyzing the quantitative results, we identify effective approaches for robust tracking and provide potential future research directions in this field.

Description: Fused Lasso is a popular regression technique that encodes the smoothness of the data. It has been applied successfully to many applications with a smooth feature structure. However, the computational cost of the existing solvers for fused Lasso is prohibitive when the feature dimension is extremely large. In this paper, we propose novel screening rules that are able to quickly identity the adjacent features with the same coefficients. As a result, the number of variables to be estimated can be significantly reduced, leading to substantial savings in computational cost and memory usage. To the best of our knowledge, the proposed approach is the first attempt to develop screening methods for the fused Lasso problem with general data matrix. Our major contributions are: 1) we derive a new dual formulation of fused Lasso that comes with several desirable properties; 2) we show that the new dual formulation of fused Lasso is equivalent to that of the standard Lasso by two affine transformations; 3) we propose a novel framework for developing effective and efficient screening rules for f used La sso via the m onotonicity of the s ubdifferentials (FLAMS). Some appealing features of FLAMS are: 1) our methods are safe in the sense that the detected adjacent features are guaranteed to have the same coefficients; 2) the dataset needs to be scanned only once to run the screening, whose computational cost is negligible compared to that of solving the fused Lasso; (3) FLAMS is independent of the solvers and can be integrated with any existing solvers. We have evaluated the proposed FLAMS rules on both synthetic and real datasets. The experiments indicate that FLAMS is very effective in identifying the adjacent features with the same coefficients. The speedup gained by FLAMS can be orders of magnitude.

Description: Hidden conditional random fields (HCRFs) are discriminative latent variable models which have been shown to successfully learn the hidden structure of a given classification problem. An Infinite hidden conditional random field is a hidden conditional random field with a countably infinite number of hidden states, which rids us not only of the necessity to specify a priori a fixed number of hidden states available but also of the problem of overfitting. Markov chain Monte Carlo (MCMC) sampling algorithms are often employed for inference in such models. However, convergence of such algorithms is rather difficult to verify, and as the complexity of the task at hand increases the computational cost of such algorithms often becomes prohibitive. These limitations can be overcome by variational techniques. In this paper, we present a generalized framework for infinite HCRF models, and a novel variational inference approach on a model based on coupled Dirichlet Process Mixtures, the HCRF-DPM. We show that the variational HCRF-DPM is able to converge to a correct number of represented hidden states, and performs as well as the best parametric HCRFs—chosen via cross-validation—for the difficult tasks of recognizing instances of agreement, disagreement, and pain in audiovisual sequences.

Description: In this paper, we address the challenging problem of detecting pedestrians who appear in groups. A new approach is proposed for single-pedestrian detection aided by two-pedestrian detection. A mixture model of two-pedestrian detectors is designed to capture the unique visual cues which are formed by nearby pedestrians but cannot be captured by single-pedestrian detectors. A probabilistic framework is proposed to model the relationship between the configurations estimated by single- and two-pedestrian detectors, and to refine the single-pedestrian detection result using two-pedestrian detection. The two-pedestrian detector can integrate with any single-pedestrian detector. Twenty-five state-of-the-art single-pedestrian detection approaches are combined with the two-pedestrian detector on three widely used public datasets: Caltech, TUD-Brussels, and ETH. Experimental results show that our framework improves all these approaches. The average improvement is $9$ percent on the Caltech-Test dataset, $11$ percent on the TUD-Brussels dataset and $17$ percent on the ETH dataset in terms of average miss rate. The lowest average miss rate is reduced from $37$ to percent on the Caltech-Test dataset, from $55$ to $50$ percent on the TUD-Brussels dataset and from $43$ to $38$ percent on the ETH dataset.

Description: The Regression Network plugin for Cytoscape ( RegNetC ) implements the RegNet algorithm for the inference of transcriptional association network from gene expression profiles. This algorithm is a model tree-based method to detect the relationship between each gene and the remaining genes simultaneously instead of analyzing individually each pair of genes as correlation-based methods do. Model trees are a very useful technique to estimate the gene expression value by regression models and favours localized similarities over more global similarity, which is one of the major drawbacks of correlation-based methods. Here, we present an integrated software suite, named RegNetC , as a Cytoscape plugin that can operate on its own as well. RegNetC facilitates, according to user-defined parameters, the resulted transcriptional gene association network in .sif format for visualization, analysis and interoperates with other Cytoscape plugins, which can be exported for publication figures. In addition to the network, the RegNetC plugin also provides the quantitative relationships between genes expression values of those genes involved in the inferred network, i.e., those defined by the regression models.

Description: The problem of securing data present on USB memories and SD cards has not been adequately addressed in the cryptography literature. While the formal notion of a tweakable enciphering scheme (TES) is well accepted as the proper primitive for secure data storage, the real challenge is to design a low cost TES which can perform at the data rates of the targeted memory devices. In this work, we provide the first answer to this problem. Our solution, called STES, combines a stream cipher with a XOR universal hash function. The security of STES is rigorously analyzed in the usual manner of provable security approach. By carefully defining appropriate variants of the multi-linear hash function and the pseudo-dot product based hash function we obtain controllable trade-offs between area and throughput. We combine the hash function with the recent hardware oriented stream ciphers, namely Mickey, Grain and Trivium. Our implementations are targeted towards two low cost FPGAs—Xilinx Spartan 3 and Lattice ICE40. Simulation results demonstrate that the speeds of encryption/decryption match the data rates of different USB and SD memories. We believe that our work opens up the possibility of actually putting FPGAs within controllers of such memories to perform low-level in-place encryption.

Description: Over the past decade or so, several research groups have addressed the problem of multi-label classification where each example can belong to more than one class at the same time. A common approach, called  Binary Relevance (BR) , addresses this problem by inducing a separate classifier for each class. Research has shown that this framework can be improved if mutual class dependence is exploited: an example that belongs to class $X$ is likely to belong also to class $Y$ ; conversely, belonging to $X$ can make an example less likely to belong to $Z$ . Several works sought to model this information by using the vector of class labels as additional example attributes. To fill the unknown values of these attributes during prediction, existing methods resort to using outputs of other classifiers, and this makes them prone to errors. This is where our paper wants to contribute. We identified two potential ways to prune unnecessary dependencies and to reduce error-propagation in our new classifier-stacking technique, which is named PruDent . Experimental results indicate that the classification performance of PruDent compares favorably with that of other state-of-the-art approaches over a broad range of testbeds. Mor- over, its computational costs grow only linearly in the number of classes.

Description: Cellular automata (CAs) have been widely used to model and simulate physical systems and processes. CAs have also been successfully used as a VLSI architecture that proved to be very efficient at least in terms of silicon-area utilization and clock-speed maximization. Quantum cellular automata (QCAs) as one of the promising emerging technologies for nanoscale and quantum computing circuit implementation, provides very high scale integration, very high switching frequency and extremely low power characteristics. In this paper we present a new automated design architecture and a tool, namely DATICAQ (Design Automation Tool of 1-D CAs using QCAs), that builds a bridge between 1-D CAs as models of physical systems and processes and 1-D QCAs as nanoelectronic architecture. The QCA implementation of CAs not only drives the already developed CAs circuits to the nanoelectronics era but improves their performance significantly. The inputs of the proposed architecture are CA dimensionality, size, local rule, and initial and boundary conditions imposed by the particular problem. DATICAQ produces as output the layout of the QCA implementation of the particular 1-D CA model. Simulations of CA models for zero and periodic boundary conditions and the corresponding QCA circuits showed that the CA models have been successfully implemented.

Description: Role-based access control is an important access control method for securing computer systems. A role-based access control policy can be implemented incorrectly due to various reasons, such as programming errors. Defects in the implementation may lead to unauthorized access and security breaches. To reveal access control defects, this paper presents a model-based approach to automated generation of executable access control tests using predicate/transition nets. Role-permission test models are built by integrating declarative access control rules with functional test models or contracts (preconditions and postconditions) of the associated activities (the system functions). The access control tests are generated automatically from the test models to exercise the interactions of access control activities. They are transformed into executable code through a model-implementation mapping that maps the modeling elements to implementation constructs. The approach has been implemented in an industry-adopted test automation framework that supports the generation of test code in a variety of languages. The full model-based testing process has been applied to three systems implemented in Java. The effectiveness is evaluated through mutation analysis of role-based access control rules. The experiments show that the model-based approach is highly effective in detecting the seeded access control defects.

Description: Heterogeneous multiprocessor systems, which are composed of a mix of processing elements, such as commodity multicore processors, graphics processing units (GPUs), and others, have been widely used in scientific computing community. Software applications incorporate the code designed and optimized for different types of processing elements in order to exploit the computing power of such heterogeneous computing systems. In this paper, we consider the problem of optimal distribution of the workload of data-parallel scientific applications between processing elements of such heterogeneous computing systems. We present a solution that uses functional performance models (FPMs) of processing elements and FPM-based data partitioning algorithms. Efficiency of this approach is demonstrated by experiments with parallel matrix multiplication and numerical simulation of lid-driven cavity flow on hybrid servers and clusters.