TRACKING THE URBAN CHAMELEON – TOWARDS A HYBRID CHANGE DETECTION OF GRAFFITI

Colourful and ever-changing: Graffiti can be considered the urban chameleon skin. At the Donaukanal (Eng. Danube Channel), Vienna's central waterway and one of the largest and most active graffiti-scapes worldwide, this metaphor applies like hardly anywhere else. Every day a multitude of graffiti is destroyed by the creation of new works. Recently, efforts have been made to mitigate this constant loss of cultural heritage along the Donaukanal by systematically documenting the graffiti, mainly using photography and photogrammetry. However, keeping track of the newly added works is very time-consuming and often like finding needles in a haystack, considering the large extent and high volatility of the monitored area. Thus, an automated graffiti change detection would significantly reduce the effort and avoid overlooking graffiti.This contribution outlines the main challenges in image-based change detection for cultural heritage and proposes a hybrid graffiti change detection method. The investigated method exploits and combines an established pixel-based change detection algorithm, the Iteratively Multivariate Alteration Detection, with a novel descriptor-based method. The latter relies on image features, rather than pixels as analysis unit and can robustly filter false alarms from the high-performing but noise-prone pixel-based approach. Overall, the results indicate that the proposed method can largely automate image-based change detection of graffiti-scapes. It can uncover graffiti-related changes and robustly distinguish them from other image differences such as shadows but tends to overlook small-scale graffiti, indicating the need for further fine-tuning.</p

Semantic Approach in Image Change Detection

International audienceChange detection is a main issue in various domains, and especially for remote sensing purposes. Indeed, plethora of geospatial images are available and can be used to update geographical databases. In this paper, we propose a classification-based method to detect changes between a database and a more recent image. It is based both on an efficient training point selection and a hierarchical decision process. This allows to take into account the intrinsic heterogeneity of the objects and themes composing a database while limiting false detection rates. The reliability of the designed framework method is first assessed on simulated data, and then successfully applied on very high resolution satellite images and two land-cover databases

A markovian approach to unsupervised change detection with multiresolution and multimodality SAR data

In the framework of synthetic aperture radar (SAR) systems, current satellite missions make it possible to acquire images at very high and multiple spatial resolutions with short revisit times. This scenario conveys a remarkable potential in applications to, for instance, environmental monitoring and natural disaster recovery. In this context, data fusion and change detection methodologies play major roles. This paper proposes an unsupervised change detection algorithmfor the challenging case of multimodal SAR data collected by sensors operating atmultiple spatial resolutions. The method is based on Markovian probabilistic graphical models, graph cuts, linear mixtures, generalized Gaussian distributions, Gram-Charlier approximations, maximum likelihood and minimum mean squared error estimation. It benefits from the SAR images acquired at multiple spatial resolutions and with possibly different modalities on the considered acquisition times to generate an output change map at the finest observed resolution. This is accomplished by modeling the statistics of the data at the various spatial scales through appropriate generalized Gaussian distributions and by iteratively estimating a set of virtual images that are defined on the pixel grid at the finest resolution and would be collected if all the sensors could work at that resolution. A Markov random field framework is adopted to address the detection problem by defining an appropriate multimodal energy function that is minimized using graph cuts

Single-Image Depth Prediction Makes Feature Matching Easier

Good local features improve the robustness of many 3D re-localization and multi-view reconstruction pipelines. The problem is that viewing angle and distance severely impact the recognizability of a local feature. Attempts to improve appearance invariance by choosing better local feature points or by leveraging outside information, have come with pre-requisites that made some of them impractical. In this paper, we propose a surprisingly effective enhancement to local feature extraction, which improves matching. We show that CNN-based depths inferred from single RGB images are quite helpful, despite their flaws. They allow us to pre-warp images and rectify perspective distortions, to significantly enhance SIFT and BRISK features, enabling more good matches, even when cameras are looking at the same scene but in opposite directions.Comment: 14 pages, 7 figures, accepted for publication at the European conference on computer vision (ECCV) 202

Improving the A-Contrario computation of a fundamental matrix in computer vision

Laboratoire MAP5 (Mathématiques appliquées Paris 5), CNRS UMR8145 Université Paris V - Paris DescartesThe fundamental matrix is a two-view tensor playing a central role in Computer Vision geometry. We address its robust estimation given pairs of matched image features, affected by noise and outliers, which searches for a maximal subset of correct matches and the associated fundamental matrix. Overcoming the broadly used parametric RANSAC method, ORSA follows a probabilistic a contrario approach to look for the set of matches being least expected with respect to a uniform random distribution of image points. ORSA lacks performance when this assumption is clearly violated. We will propose an improvement of the ORSA method, based on its same a contrario framework and the use of a non-parametric estimate of the distribution of image features. The role and estimation of the fundamental matrix and the data SIFT matches will be carefully explained with examples. Our proposal performs significantly well for common scenarios of low inlier ratios and local feature concentrations

Détection indirecte de changements en imagerie satellitaire haute résolution

International audienceDetecting changes between two satellite images generally requires some robustness to different types of variations, such as color, illumination, texture or even resolution. We here present a detection method that avoids direct comparisons between the two images, and can thus be applied to radiometrically different images as well as to time series.Détecter des changements entre deux images satellite requiert en général d'être robuste à différents types de variations, par exemple de couleur, d'éclairement, de texture, voir même de résolution. Nous présentons ici une méthode de détection qui, en s'affranchissant des comparaisons directes entre les deux images, peut s'appliquer à des images radiométriquement différentes, ainsi qu'à des séries temporelles

Descripteurs locaux pour l'imagerie radar et applications

We study here the interest of local features for optical and SAR images. These features, because of their invariances and their dense representation, offer a real interest for the comparison of satellite images acquired under different conditions. While it is easy to apply them to optical images, they offer limited performances on SAR images, because of their multiplicative noise. We propose here an original feature for the comparison of SAR images. This algorithm, called SAR-SIFT, relies on the same structure as the SIFT algorithm (detection of keypoints and extraction of features) and offers better performances for SAR images. To adapt these steps to multiplicative noise, we have developed a differential operator, the Gradient by Ratio, allowing to compute a magnitude and an orientation of the gradient robust to this type of noise. This operator allows us to modify the steps of the SIFT algorithm. We present also two applications for remote sensing based on local features. First, we estimate a global transformation between two SAR images with help of SAR-SIFT. The estimation is realized with help of a RANSAC algorithm and by using the matched keypoints as tie points. Finally, we have led a prospective study on the use of local features for change detection in remote sensing. The proposed method consists in comparing the densities of matched keypoints to the densities of detected keypoints, in order to point out changed areas.Nous étudions ici l’intérêt des descripteurs locaux pour les images satellites optiques et radar. Ces descripteurs, par leurs invariances et leur représentation compacte, offrent un intérêt pour la comparaison d’images acquises dans des conditions différentes. Facilement applicables aux images optiques, ils offrent des performances limitées sur les images radar, en raison de leur fort bruit multiplicatif. Nous proposons ici un descripteur original pour la comparaison d’images radar. Cet algorithme, appelé SAR-SIFT, repose sur la même structure que l’algorithme SIFT (détection de points-clés et extraction de descripteurs) et offre des performances supérieures pour les images radar. Pour adapter ces étapes au bruit multiplicatif, nous avons développé un opérateur différentiel, le Gradient par Ratio, permettant de calculer une norme et une orientation du gradient robustes à ce type de bruit. Cet opérateur nous a permis de modifier les étapes de l’algorithme SIFT. Nous présentons aussi deux applications pour la télédétection basées sur les descripteurs. En premier, nous estimons une transformation globale entre deux images radar à l’aide de SAR-SIFT. L’estimation est réalisée à l’aide d’un algorithme RANSAC et en utilisant comme points homologues les points-clés mis en correspondance. Enfin nous avons mené une étude prospective sur l’utilisation des descripteurs pour la détection de changements en télédétection. La méthode proposée compare les densités de points-clés mis en correspondance aux densités de points-clés détectés pour mettre en évidence les zones de changement