scispace - formally typeset
Search or ask a question

Showing papers on "Change detection published in 2013"


Journal ArticleDOI
Masroor Hussain1, Dongmei Chen1, Angela Cheng1, Hui Wei, David Stanley 
TL;DR: This paper begins with a discussion of the traditionally pixel-based and (mostly) statistics-oriented change detection techniques which focus mainly on the spectral values and mostly ignore the spatial context, followed by a review of object-basedchange detection techniques.
Abstract: The appetite for up-to-date information about earth’s surface is ever increasing, as such information provides a base for a large number of applications, including local, regional and global resources monitoring, land-cover and land-use change monitoring, and environmental studies. The data from remote sensing satellites provide opportunities to acquire information about land at varying resolutions and has been widely used for change detection studies. A large number of change detection methodologies and techniques, utilizing remotely sensed data, have been developed, and newer techniques are still emerging. This paper begins with a discussion of the traditionally pixel-based and (mostly) statistics-oriented change detection techniques which focus mainly on the spectral values and mostly ignore the spatial context. This is succeeded by a review of object-based change detection techniques. Finally there is a brief discussion of spatial data mining techniques in image processing and change detection from remote sensing data. The merits and issues of different techniques are compared. The importance of the exponential increase in the image data volume and multiple sensors and associated challenges on the development of change detection techniques are highlighted. With the wide use of very-high-resolution (VHR) remotely sensed images, object-based methods and data mining techniques may have more potential in change detection.

1,159 citations


Journal ArticleDOI
TL;DR: In this article, a 3D point cloud comparison method is proposed to measure surface changes via 3D surface estimation and orientation in 3D at a scale consistent with the local surface roughness.
Abstract: Surveying techniques such as terrestrial laser scanner have recently been used to measure surface changes via 3D point cloud (PC) comparison. Two types of approaches have been pursued: 3D tracking of homologous parts of the surface to compute a displacement field, and distance calculation between two point clouds when homologous parts cannot be defined. This study deals with the second approach, typical of natural surfaces altered by erosion, sedimentation or vegetation between surveys. Current comparison methods are based on a closest point distance or require at least one of the PC to be meshed with severe limitations when surfaces present roughness elements at all scales. To solve these issues, we introduce a new algorithm performing a direct comparison of point clouds in 3D. The method has two steps: (1) surface normal estimation and orientation in 3D at a scale consistent with the local surface roughness; (2) measurement of the mean surface change along the normal direction with explicit calculation of a local confidence interval. Comparison with existing methods demonstrates the higher accuracy of our approach, as well as an easier workflow due to the absence of surface meshing or Digital Elevation Model (DEM) generation. Application of the method in a rapidly eroding, meandering bedrock river (Rangitikei River canyon) illustrates its ability to handle 3D differences in complex situations (flat and vertical surfaces on the same scene), to reduce uncertainty related to point cloud roughness by local averaging and to generate 3D maps of uncertainty levels. We also demonstrate that for high precision survey scanners, the total error budget on change detection is dominated by the point clouds registration error and the surface roughness. Combined with mm-range local georeferencing of the point clouds, levels of detection down to 6 mm (defined at 95% confidence) can be routinely attained in situ over ranges of 50 m. We provide evidence for the self-affine behaviour of different surfaces. We show how this impacts the calculation of normal vectors and demonstrate the scaling behaviour of the level of change detection. The algorithm has been implemented in a freely available open source software package. It operates in complex 3D cases and can also be used as a simpler and more robust alternative to DEM differencing for the 2D cases.

881 citations


Journal ArticleDOI
TL;DR: In this paper, the authors present a new comprehensive change detection method (CCDM) designed as a key component for the development of NLCD 2011 and the research results from two exemplar studies, which integrates spectral-based change detection algorithms including a Multi-Index Integrated Change Analysis (MIICA) model and a novel change model called Zone, which extracts change information from two Landsat image pairs.

655 citations


Journal ArticleDOI
TL;DR: A general framework for assessing predictive stream learning algorithms and defends the use of prequential error with forgetting mechanisms to provide reliable error estimators, and proves that, in stationary data and for consistent learning algorithms, the holdout estimator, the preQUential error and the prequentially error estimated over a sliding window or using fading factors, all converge to the Bayes error.
Abstract: Most streaming decision models evolve continuously over time, run in resource-aware environments, and detect and react to changes in the environment generating data. One important issue, not yet convincingly addressed, is the design of experimental work to evaluate and compare decision models that evolve over time. This paper proposes a general framework for assessing predictive stream learning algorithms. We defend the use of prequential error with forgetting mechanisms to provide reliable error estimators. We prove that, in stationary data and for consistent learning algorithms, the holdout estimator, the prequential error and the prequential error estimated over a sliding window or using fading factors, all converge to the Bayes error. The use of prequential error with forgetting mechanisms reveals to be advantageous in assessing performance and in comparing stream learning algorithms. It is also worthwhile to use the proposed methods for hypothesis testing and for change detection. In a set of experiments in drift scenarios, we evaluate the ability of a standard change detection algorithm to detect change using three prequential error estimators. These experiments point out that the use of forgetting mechanisms (sliding windows or fading factors) are required for fast and efficient change detection. In comparison to sliding windows, fading factors are faster and memoryless, both important requirements for streaming applications. Overall, this paper is a contribution to a discussion on best practice for performance assessment when learning is a continuous process, and the decision models are dynamic and evolve over time.

432 citations


Journal ArticleDOI
TL;DR: A hybrid methodology combining backscatter thresholding, region growing, and change detection (CD) is introduced as an approach enabling the automated, objective, and reliable flood extent extraction from very high resolution urban SAR images.
Abstract: Very high resolution synthetic aperture radar (SAR) sensors represent an alternative to aerial photography for delineating floods in built-up environments where flood risk is highest. However, even with currently available SAR image resolutions of 3 m and higher, signal returns from man-made structures hamper the accurate mapping of flooded areas. Enhanced image processing algorithms and a better exploitation of image archives are required to facilitate the use of microwave remote-sensing data for monitoring flood dynamics in urban areas. In this paper, a hybrid methodology combining backscatter thresholding, region growing, and change detection (CD) is introduced as an approach enabling the automated, objective, and reliable flood extent extraction from very high resolution urban SAR images. The method is based on the calibration of a statistical distribution of “open water” backscatter values from images of floods. Images acquired during dry conditions enable the identification of areas that are not “visible” to the sensor (i.e., regions affected by “shadow”) and that systematically behave as specular reflectors (e.g., smooth tarmac, permanent water bodies). CD with respect to a reference image thereby reduces overdetection of inundated areas. A case study of the July 2007 Severn River flood (UK) observed by airborne photography and the very high resolution SAR sensor on board TerraSAR-X highlights advantages and limitations of the method. Even though the proposed fully automated SAR-based flood-mapping technique overcomes some limitations of previous methods, further technological and methodological improvements are necessary for SAR-based flood detection in urban areas to match the mapping capability of high-quality aerial photography.

328 citations


Journal ArticleDOI
TL;DR: In this paper, the relative Pearson divergence is used as a divergence measure, and it is accurately and efficiently estimated by a method of direct density-ratio estimation, which can detect abrupt property changes lying behind time-series data.

321 citations


Journal ArticleDOI
01 Mar 2013
TL;DR: A framework that aims at defining a top-down approach to the design of the architecture of novel change-detection systems for multitemporal VHR images taking into account the intrinsic complexity associated with these data is proposed.
Abstract: This paper addresses change detection in multitemporal remote sensing images. After a review of the main techniques developed in remote sensing for the analysis of multitemporal data, the attention is focused on the challenging problem of change detection in very-high-resolution (VHR) multispectral images. In this context, we propose a framework that aims at defining a top-down approach to the design of the architecture of novel change-detection systems for multitemporal VHR images. The proposed framework explicitly models the presence of different radiometric changes on the basis of the properties of multitemporal images, extracts the semantic meaning of radiometric changes, identifies changes of interest with strategies designed on the basis of the specific application, and takes advantage of the intrinsic multiscale/multilevel properties of the objects and the high spatial correlation between pixels in a neighborhood. This framework defines guidelines for the development of a new generation of change-detection methods that can properly analyze multitemporal VHR images taking into account the intrinsic complexity associated with these data. In order to illustrate the use of the proposed framework, a real change-detection problem has been considered, which is described by a pair of VHR multispectral images acquired by the QuickBird satellite on the city of Trento, Italy. The proposed framework has been used for defining a system for change detection in the two images. Experimental results confirm the effectiveness of the developed system and the usefulness of the proposed framework.

269 citations


Journal ArticleDOI
TL;DR: An effective solution to deal with supervised change detection in very high geometrical resolution (VHR) images is studied and the inclusion of spatial and contextual information issued from local textural statistics and mathematical morphology is proposed.

249 citations


Journal ArticleDOI
TL;DR: The overall accuracy of change detection can be increased step by step by the proposed sequential fusion framework, which effectively reduces the omission errors in change detection.

188 citations


Journal ArticleDOI
TL;DR: In this paper, a mixture procedure is proposed to monitor parallel streams of data for a change-point that affects only a subset of them, without assuming a spatial structure relating the data streams to one another.
Abstract: We develop a mixture procedure to monitor parallel streams of data for a change-point that affects only a subset of them, without assuming a spatial structure relating the data streams to one another. Observations are assumed initially to be independent standard normal random variables. After a change-point the observations in a subset of the streams of data have nonzero mean values. The subset and the post-change means are unknown. The procedure we study uses stream specific generalized likelihood ratio statistics, which are combined to form an overall detection statistic in a mixture model that hypothesizes an assumed fraction $p_{0}$ of affected data streams. An analytic expression is obtained for the average run length (ARL) when there is no change and is shown by simulations to be very accurate. Similarly, an approximation for the expected detection delay (EDD) after a change-point is also obtained. Numerical examples are given to compare the suggested procedure to other procedures for unstructured problems and in one case where the problem is assumed to have a well-defined geometric structure. Finally we discuss sensitivity of the procedure to the assumed value of $p_{0}$ and suggest a generalization.

183 citations


Journal ArticleDOI
TL;DR: A novel score-based multi-cyclic detection algorithm based on the Shiryaev-Roberts procedure, which is as easy to employ in practice and as computationally inexpensive as the popular Cumulative Sum chart and the Exponentially Weighted Moving Average scheme is proposed.
Abstract: We consider the problem of efficient on-line anomaly detection in computer network traffic. The problem is approached statistically, as that of sequential (quickest) changepoint detection. A multi-cyclic setting of quickest change detection is a natural fit for this problem. We propose a novel score-based multi-cyclic detection algorithm. The algorithm is based on the so-called Shiryaev-Roberts procedure. This procedure is as easy to employ in practice and as computationally inexpensive as the popular Cumulative Sum chart and the Exponentially Weighted Moving Average scheme. The likelihood ratio based Shiryaev-Roberts procedure has appealing optimality properties, particularly it is exactly optimal in a multi-cyclic setting geared to detect a change occurring at a far time horizon. It is therefore expected that an intrusion detection algorithm based on the Shiryaev-Roberts procedure will perform better than other detection schemes. This is confirmed experimentally for real traces. We also discuss the possibility of complementing our anomaly detection algorithm with a spectral-signature intrusion detection system with false alarm filtering and true attack confirmation capability, so as to obtain a synergistic system.

Journal ArticleDOI
TL;DR: In this article, a range of techniques for both detection and de-shadowing of shadow are reviewed, focusing on urban regions (urban shadows), mountainous areas (topographic shadow), cloud shadows and composite shadows.
Abstract: Shadow is one of the major problems in remotely sensed imagery which hampers the accuracy of information extraction and change detection. In these images, shadow is generally produced by different objects, namely, cloud, mountain and urban materials. The shadow correction process consists of two steps: detection and de-shadowing. This paper reviews a range of techniques for both steps, focusing on urban regions (urban shadows), mountainous areas (topographic shadow), cloud shadows and composite shadows. Several issues including the problems and the advantages of those algorithms are discussed. In recent years, thresholding and recovery techniques have become important for shadow detection and de-shadowing, respectively. Research on shadow correction is still an important topic, particularly for urban regions (in high spatial resolution data) and mountainous forest (in high and medium spatial resolution data). Moreover, new algorithms are needed for shadow correction, especially given the advent of new satellite images.

Journal ArticleDOI
TL;DR: It is found that M3C2 provides a better accounting of the sources of uncertainty in TLS change detection than C2M, because it considers the uncertainty due to surface roughness and scan registration, and that localized areas of the RTS do not always approximate the overall retreat of the feature and show considerable spatial variability during inclement weather.
Abstract: Terrestrial laser scanners (TLS) allow large and complex landforms to be rapidly surveyed at previously unattainable point densities. Many change detection methods have been employed to make use of these rich data sets, including cloud to mesh (C2M) comparisons and Multiscale Model to Model Cloud Comparison (M3C2). Rather than use simulated point cloud data, we utilized a 58 scan TLS survey data set of the Selawik retrogressive thaw slump (RTS) to compare C2M and M3C2. The Selawik RTS is a rapidly evolving permafrost degradation feature in northwest Alaska that presents challenging survey conditions and a unique opportunity to compare change detection methods in a difficult surveying environment. Additionally, this study considers several error analysis techniques, investigates the spatial variability of topographic change across the feature and explores visualization techniques that enable the analysis of this spatiotemporal data set. C2M reports a higher magnitude of topographic change over short periods of time ( 12 h) and reports a lower magnitude of topographic change over long periods of time ( four weeks) when compared to M3C2. We found that M3C2 provides a better accounting of the sources of uncertainty in TLS change detection than C2M, because it considers the uncertainty due to surface roughness and scan registration. We also found that localized areas of the RTS do not always approximate the overall retreat of the feature and show considerable spatial variability during inclement weather; however, when averaged together, the spatial subsets approximate the retreat of the entire feature. New data visualization techniques are explored to leverage temporally and spatially continuous data sets. Spatially binning the data into vertical strips

Journal ArticleDOI
TL;DR: The approach described in this paper leverages several recent results in the field of high-dimensional data analysis, including subspace tracking with missing data, multiscale analysis techniques for point clouds, online optimization, and change-point detection performance analysis.
Abstract: This paper describes a novel approach to change-point detection when the observed high-dimensional data may have missing elements The performance of classical methods for change-point detection typically scales poorly with the dimensionality of the data, so that a large number of observations are collected after the true change-point before it can be reliably detected Furthermore, missing components in the observed data handicap conventional approaches The proposed method addresses these challenges by modeling the dynamic distribution underlying the data as lying close to a time-varying low-dimensional submanifold embedded within the ambient observation space Specifically, streaming data is used to track a submanifold approximation, measure deviations from this approximation, and calculate a series of statistics of the deviations for detecting when the underlying manifold has changed in a sharp or unexpected manner The approach described in this paper leverages several recent results in the field of high-dimensional data analysis, including subspace tracking with missing data, multiscale analysis techniques for point clouds, online optimization, and change-point detection performance analysis Simulations and experiments highlight the robustness and efficacy of the proposed approach in detecting an abrupt change in an otherwise slowly varying low-dimensional manifold

Journal ArticleDOI
TL;DR: This paper addresses the extension of this change detection technique to polarimetric SAR data for monitoring surface water and flooded vegetation and RADARSAT-2 images of Dong Ting Lake demonstrate this curvelet-based change Detection technique applied to wetlands.
Abstract: Due to spatial and temporal variability an effective monitoring system for water resources must consider the use of remote sensing to provide information. Synthetic Aperture Radar (SAR) is useful due to timely data acquisition and sensitivity to surface water and flooded vegetation. The ability to map flooded vegetation is attributed to the double bounce scattering mechanism, often dominant for this target. Dong Ting Lake in China is an ideal site for evaluating SAR data for this application due to annual flooding caused by mountain snow melt causing extensive changes in flooded vegetation. A curvelet-based approach for change detection in SAR imagery works well as it highlights the change and suppresses the speckle noise. This paper addresses the extension of this change detection technique to polarimetric SAR data for monitoring surface water and flooded vegetation. RADARSAT-2 images of Dong Ting Lake demonstrate this curvelet-based change detection technique applied to wetlands although it is ...

Journal ArticleDOI
TL;DR: Results based on laboratory experiments show that a sizable reduction in the data volume is achieved using the proposed approach without a degradation in system performance.
Abstract: We consider sparsity-driven change detection (CD) for human motion indication in through-the-wall radar imaging and urban sensing applications. Stationary targets and clutter are removed via CD, which converts a populated scene into a sparse scene of a few human targets moving inside enclosed structures and behind walls. We establish appropriate CD models for various possible human motions, ranging from translational motions to sudden short movements of the limbs, head, and/or torso. These models permit scene reconstruction within the compressive sensing framework. Results based on laboratory experiments show that a sizable reduction in the data volume is achieved using the proposed approach without a degradation in system performance.

Journal ArticleDOI
TL;DR: This paper gives a log-likelihood justification for two well-known criteria for detecting change in streaming multidimensional data: Kullback-Leibler (K-L) distance and Hotelling's T-square test for equal means (H).
Abstract: Change detection in streaming data relies on a fast estimation of the probability that the data in two consecutive windows come from different distributions. Choosing the criterion is one of the multitude of questions that need to be addressed when designing a change detection procedure. This paper gives a log-likelihood justification for two well-known criteria for detecting change in streaming multidimensional data: Kullback-Leibler (K-L) distance and Hotelling's T-square test for equal means (H). We propose a semiparametric log-likelihood criterion (SPLL) for change detection. Compared to the existing log-likelihood change detectors, SPLL trades some theoretical rigor for computation simplicity. We examine SPLL together with K-L and H on detecting induced change on 30 real data sets. The criteria were compared using the area under the respective Receiver Operating Characteristic (ROC) curve (AUC). SPLL was found to be on the par with H and better than K-L for the nonnormalized data, and better than both on the normalized data.

Journal ArticleDOI
TL;DR: Qualitative and quantitative analyses of the nonlocal means (NLM) denoising algorithm have demonstrated the efficiency of the algorithm in recovering the noise-free change image while preserving the complex structures in urban areas.
Abstract: Multitemporal synthetic aperture radar (SAR) images have been increasingly used in change detection studies. However, the presence of speckle is the main disadvantage of this type of data. To reduce speckle, many local adaptive filters have been developed. Although these filters are effective in reducing speckle in homogeneous areas, their use is often accompanied with the degradation of spatial details and fine structures. In this paper, we investigate a nonlocal means (NLM) denoising algorithm that combines local structures with a global averaging scheme in the context of change detection using multitemporal SAR images. First, the ratio image is logarithmically scaled to convert the multiplicative noise model to an additive model. A multidimensional change image is then constructed using image neighborhood feature vectors. Principle component analysis is then used to reduce the dimensionality of the neighborhood feature vectors. Recursive linear regression combined with fitting-accuracy assessment strategy is developed to determine the number of significant PC components to be retained for similarity weight computation. An intuitive method to estimate the unknown noise variance (necessary to run the NLM algorithm) based on the discarded PC components is also proposed. The efficiency of the method has been assessed using two different bitemporal SAR datasets acquired in Beijing and Shanghai, respectively. For comparison purposes, the algorithm is also tested against some of the most commonly used local adaptive filters. Qualitative and quantitative analyses of the algorithm have demonstrated the efficiency of the algorithm in recovering the noise-free change image while preserving the complex structures in urban areas.

Journal ArticleDOI
TL;DR: A subspace-based change detection (SCD) method for hyperspectral images that gives more accurate detection results, with a lower false alarm rate, compared with other state-of-the-art methods.
Abstract: Remote sensing change detection has played an important role in many applications. Most traditional change detection methods deal with single-band or multispectral remote sensing images. Hyperspectral remote sensing images offer more detailed information on spectral changes so as to present promising change detection performance. The challenge is how to take advantage of the spectral information at such a high dimension. In this paper, we propose a subspace-based change detection (SCD) method for hyperspectral images. Instead of dealing with band-wise changes, the proposed method measures spectral changes. SCD regards the observed pixel in the image of Time 2 as target and constructs the background subspace using the corresponding pixel in the image of Time 1, and additional information. In this paper, two types of additional information, i.e., spatial information in the neighborhood of the corresponding pixel in Time 1, and the spectral information of undesired land-cover types, are used to construct the background subspace for special applications. The subspace distance is calculated to determine whether the target is anomalous with respect to the background subspace. The anomalous pixels are considered as changes. Here, orthogonal subspace projection is employed to calculate the subspace distance, which makes full use of the advantage of the abundant spectral information in hyperspectral imagery, and is also easy to apply. The experimental results using Hyperion data and HJ-1A HSI data indicate that SCD gives more accurate detection results, with a lower false alarm rate, compared with other state-of-the-art methods. SCD with additional information also gives satisfactory results in the experiments, reducing the false alarms caused by misregistration and suppressing the change of undesired land-cover types.

Proceedings ArticleDOI
29 May 2013
TL;DR: This work proposes to perform background subtraction with a small binary descriptor that is named Local Binary Similarity Patterns (LBSP), and shows that this descriptor outperforms color, and that a simple background subtractor using LBSP outperforms many sophisticated state of the art methods in baseline scenarios.
Abstract: In general, the problem of change detection is studied in color space. Most proposed methods aim at dynamically finding the best color thresholds to detect moving objects against a background model. Background models are often complex to handle noise affecting pixels. Because the pixels are considered individually, some changes cannot be detected because it involves groups of pixels and some individual pixels may have the same appearance as the background. To solve this problem, we propose to formulate the problem of background subtraction in feature space. Instead of comparing the color of pixels in the current image with colors in a background model, features in the current image are compared with features in the background model. The use of a feature at each pixel position allows accounting for change affecting groups of pixels, and at the same time adds robustness to local perturbations. With the advent of binary feature descriptors such as BRISK or FREAK, it is now possible to use features in various applications at low computational cost. We thus propose to perform background subtraction with a small binary descriptor that we named Local Binary Similarity Patterns (LBSP). We show that this descriptor outperforms color, and that a simple background subtractor using LBSP outperforms many sophisticated state of the art methods in baseline scenarios.

Proceedings ArticleDOI
27 May 2013
TL;DR: A mixture procedure to monitor parallel streams of data for a change-point that affects only a subset of them, without assuming a spatial structure relating the data streams to one another, is developed.
Abstract: We develop a mixture procedure to monitor parallel streams of data for a change-point that affects only a subset of them, without assuming a spatial structure relating the data streams to one another. Observations are assumed initially to be independent standard normal random variables. After a change-point the observations in a subset of the streams of data have non-zero mean values. The subset and the post-change means are unknown. The procedure we study uses stream specific generalized likelihood ratio statistics, which are combined to form an overall detection statistic in a mixture model that hypothesizes an assumed fraction p 0 of affected data streams. An analytic expression is obtained for the average run length (ARL) when there is no change and is shown by simulations to be very accurate. Similarly, an approximation for the expected detection delay (EDD) after a change-point is also obtained. Numerical examples are given to compare the suggested procedure to other procedures for unstructured problems and in one case where the problem is assumed to have a well defined geometric structure. Finally we discuss sensitivity of the procedure to the assumed value of p 0 and suggest a generalization.

Journal ArticleDOI
05 Jun 2013-ARS
TL;DR: The major techniques that are utilized to detect land use and land cover changes are investigated and it is shown that the most used techniques are post-classification comparison and principle component analysis.
Abstract: The accuracy of change detection on the earth’s surface is important for understanding the relationships and interactions between human and natural phenomena. Remote Sensing and Geographic Information Systems (GIS) have the potential to provide accurate information regarding land use and land cover changes. In this paper, we investigate the major techniques that are utilized to detect land use and land cover changes. Eleven change detection techniques are reviewed. An analysis of the related literature shows that the most used techniques are post-classification comparison and principle component analysis. Post-classification comparison can minimize the impacts of atmospheric and sensor differences between two dates. Image differencing and image ratioing are easy to implement, but at times they do not provide accurate results. Hybrid change detection is a useful technique that makes full use of the benefits of many techniques, but it is complex and depends on the characteristics of the other techniques such as supervised and unsupervised classifications. Change vector analysis is complicated to implement, but it is useful for providing the direction and magnitude of change. Recently, artificial neural networks, chi-square, decision tree and image fusion have been frequently used in change detection. Research on integrating remote sensing data and GIS into change detection has also increased.

Proceedings ArticleDOI
18 Jun 2013
TL;DR: This work presents a host-based malware detection system designed to run at the hypervisor level, monitoring hypervisor and guest operating system sensors and sequentially determining whether the host is infected, and a case study wherein the detection system is used to detect various types of malware on an active web server under heavy computational load.
Abstract: The complex computing systems employed by governments, corporations, and other institutions are frequently targeted by cyber-attacks designed for espionage and sabotage. The malicious software used in such attacks are typically custom-designed or obfuscated to avoid detection by traditional antivirus software. Our goal is to create a malware detection system that can quickly and accurately detect such otherwise difficult-to-detect malware. We pose the problem of malware detection as a multi-channel change-point detection problem, wherein the goal is to identify the point in time when a system changes from a known clean state to an infected state. We present a host-based malware detection system designed to run at the hypervisor level, monitoring hypervisor and guest operating system sensors and sequentially determining whether the host is infected. We present a case study wherein the detection system is used to detect various types of malware on an active web server under heavy computational load.

Journal ArticleDOI
TL;DR: In this article, a review of the state, trends and potential of remote sensing for detecting, mapping and monitoring forest defoliation caused by insects is presented, and the most promising methods for insect defoliations are Spectral Mixture Analysis, best suited for detection due to its sub-pixel recognition enhancing multispectral data, and use of logistic models as function of vegetation index change between two dates.
Abstract: Aim of study: This paper reviews the global research during the last 6 years (2007-2012) on the state, trends and potential of remote sensing for detecting, mapping and monitoring forest defoliation caused by insects. Area of study: The review covers research carried out within different countries in Europe and America. Main results: A nation or region wide monitoring system should be scaled in two levels, one using time-series with moderate to coarse resolutions, and the other with fine or high resolution. Thus, MODIS data is increasingly used for early warning detection, whereas Landsat data is predominant in defoliation damage research. Furthermore, ALS data currently stands as the more promising option for operative detection of defoliation. Vegetation indices based on infrared-medium/near-infrared ratios and on moisture content indicators are of great potential for mapping insect pest defoliation, although NDVI is the most widely used and tested. Research highlights: Among most promising methods for insect defoliation monitoring are Spectral Mixture Analysis, best suited for detection due to its sub-pixel recognition enhancing multispectral data, and use of logistic models as function of vegetation index change between two dates, recommended for predicting defoliation. Key words: vegetation damage; pest outbreak; spectral change detection.

Journal ArticleDOI
TL;DR: The experiments performed on panchromatic QuickBird images related to an urban area show the effectiveness of the proposed technique in detecting changes on the basis of the spatial morphology by preserving geometrical detail.
Abstract: A new approach to change detection in very high resolution remote sensing images based on morphological attribute profiles (APs) is presented. A multiresolution contextual transformation performed by APs allows the extraction of geometrical features related to the structures within the scene at different scales. The temporal changes are detected by comparing the geometrical features extracted from the image of each date. The experiments performed on panchromatic QuickBird images related to an urban area show the effectiveness of the proposed technique in detecting changes on the basis of the spatial morphology by preserving geometrical detail.

Proceedings ArticleDOI
01 Sep 2013
TL;DR: A system for automatically learning segmentations of objects given changes in dense RGB-D maps over the lifetime of a robot by performing a 3-D difference of the scenes to detect changes between mapped regions from multiple traverses.
Abstract: In this paper, we present a system for automatically learning segmentations of objects given changes in dense RGB-D maps over the lifetime of a robot. Using recent advances in RGB-D mapping to construct multiple dense maps, we detect changes between mapped regions from multiple traverses by performing a 3-D difference of the scenes. Our method takes advantage of the free space seen in each map to account for variability in how the maps were created. The resulting changes from the 3-D difference are our discovered objects, which are then used to train multiple segmentation algorithms in the original map. The final objects can then be matched in other maps given their corresponding features and learned segmentation method. If the same object is discovered multiple times in different contexts, the features and segmentation method are refined, incorporating all instances to better learn objects over time. We verify our approach with multiple objects in numerous and varying maps.

Journal ArticleDOI
TL;DR: In this paper, a digital surface model DSM extracted from stereoscopic aerial images, acquired in March 2000, is compared with a DSM derived from airborne light detection and ranging lidar data collected in July 2009.
Abstract: A digital surface model DSM extracted from stereoscopic aerial images, acquired in March 2000, is compared with a DSM derived from airborne light detection and ranging lidar data collected in July 2009. Three densely built-up study areas in the city centre of Ghent, Belgium, are selected, each covering approximately 0.4 km2. The surface models, generated from the two different 3D acquisition methods, are compared qualitatively and quantitatively as to what extent they are suitable in modelling an urban environment, in particular for the 3D reconstruction of buildings. Then the data sets, which are acquired at two different epochs t 1 and t 2, are investigated as to what extent 3D building changes can be detected and modelled over the time interval. A difference model, generated by pixel-wise subtracting of both DSMs, indicates changes in elevation. Filters are proposed to differentiate ‘real’ building changes from false alarms provoked by model noise, outliers, vegetation, etc. A final 3D building change model maps all destructed and newly constructed buildings within the time interval t 2 – t 1. Based on the change model, the surface and volume of the building changes can be quantified.

Journal ArticleDOI
TL;DR: Recently, this article showed that human change detection performance was best explained by a continuous-resource model in which encoding precision is variable across items and trials even at a given set size.
Abstract: Change detection is a classic paradigm that has been used for decades to argue that working memory can hold no more than a fixed number of items ("item-limit models"). Recent findings force us to consider the alternative view that working memory is limited by the precision in stimulus encoding, with mean precision decreasing with increasing set size ("continuous-resource models"). Most previous studies that used the change detection paradigm have ignored effects of limited encoding precision by using highly discriminable stimuli and only large changes. We conducted two change detection experiments (orientation and color) in which change magnitudes were drawn from a wide range, including small changes. In a rigorous comparison of five models, we found no evidence of an item limit. Instead, human change detection performance was best explained by a continuous-resource model in which encoding precision is variable across items and trials even at a given set size. This model accounts for comparison errors in a principled, probabilistic manner. Our findings sharply challenge the theoretical basis for most neural studies of working memory capacity.

Journal ArticleDOI
TL;DR: The result evaluations demonstrate that the applied DSM generation method is well suited for Cartosat-1 imagery, and the extracted height values can largely improve the change detection accuracy, moreover it is shown that the proposed change detection method can be used robustly for both forest and industrial areas.
Abstract: In this paper a novel region-based method is proposed for change detection using space borne panchromatic Cartosat-1 stereo imagery. In the first step, Digital Surface Models (DSMs) from two dates are generated by semi-global matching. The geometric lateral resolution of the DSMs is 5 m × 5 m and the height accuracy is in the range of approximately 3 m (RMSE). In the second step, mean-shift segmentation is applied on the orthorectified images of two dates to obtain initial regions. A region intersection following a merging strategy is proposed to get minimum change regions and multi-level change vectors are extracted for these regions. Finally change detection is achieved by combining these features with weighted change vector analysis. The result evaluations demonstrate that the applied DSM generation method is well suited for Cartosat-1 imagery, and the extracted height values can largely improve the change detection accuracy, moreover it is shown that the proposed change detection method can be used robustly for both forest and industrial areas.

Journal ArticleDOI
TL;DR: Experimental results on simulated changes and true SAR images acquired by the COSMO-SkyMed satellite constellation show that the proposed feature exhibits significantly better discrimination capability than the classical log-ratio (LR).
Abstract: A nonparametric method for unsupervised change detection in multipass synthetic aperture radar (SAR) imagery is described. The method relies on a novel feature capturing the structural change between two SAR images and is robust to the statistical change that may be originated by speckle and coregistration inaccuracies. The proposed method starts from the scatterplot of the amplitude levels in the two images and applies the mean-shift (MS) algorithm to find the modes of the underlying bivariate distribution. If we assume that the two images have been preliminarily coregistered and calibrated on one another, then all the modes lying outside the main diagonal correspond to the structural changes across the two observations. The value of the probability density function (PDF) in any of the off-diagonal modes found by the MS algorithm is translated into a value of conditional information. This value is assigned to all image pixels generating the corresponding cluster in the scatterplot. Thus, a feature is obtained on a per-pixel basis. Experimental results on simulated changes and true SAR images acquired by the COSMO-SkyMed satellite constellation show that the proposed feature exhibits significantly better discrimination capability than the classical log-ratio (LR). Advantages over a preliminary version of the method without MS regularization and over another nonparametric method based on Kullback-Leibler divergence are also demonstrated. The method is robust when it is applied to SAR images with different acquisition angles, whose effects are deemphasized compared to the actual scene changes.