Source-linked AI summary

Adversarial Training for Adverse Conditions: Robust Metric Localisation using Appearance Transfer

Horia Porav, Will Maddern, Paul Newman

arXiv:1803.03341v1cs.CV

TL;DR

Visual place recognition and metric localisation degrade under strong appearance changes, while mapping every condition is costly. The paper learns bidirectional appearance-transfer generators with differentiable SURF detector and dense descriptor losses, then uses the synthetic images for sparse matching against an existing map. Across adverse conditions, the method improves place recognition and metric localisation and reduces the mapping needed for reliable localisation.

  • Problem

    Strong illumination and seasonal changes break conventional feature matching, making condition-specific mapping costly, difficult, and potentially lower quality.

    Source: §I · p. 1
  • Method

    A two-stage adversarial image-translation network uses differentiable SURF detector and dense descriptor losses to synthesize matching-friendly images from RGB inputs.

    Source: §I · p. 1
  • Results

    The synthetic-image method consistently improves place recognition and metric localisation over baselines across adverse conditions while reducing the mapping needed for reliable localisation.

    Source: §VI · p. 6, A. Quantitative results · p. 6
  • Takeaways & Limitations

    Feature-aware appearance transfer can make traditional sparse matching more robust under adverse conditions using modest target training data.

    Source: §VI · pp. 6, 8

Abstract

from arXiv · show

We present a method of improving visual place recognition and metric localisation under very strong appear- ance change. We learn an invertable generator that can trans- form the conditions of images, e.g. from day to night, summer to winter etc. This image transforming filter is explicitly designed to aid and abet feature-matching using a new loss based on SURF detector and dense descriptor maps. A network is trained to output synthetic images optimised for feature matching given only an input RGB image, and these generated images are used to localize the robot against a previously built map using traditional sparse matching approaches. We benchmark our results using multiple traversals of the Oxford RobotCar Dataset over a year-long period, using one traversal as a map and the other to localise. We show that this method significantly improves place recognition and localisation under changing and adverse conditions, while reducing the number of mapping runs needed to successfully achieve reliable localisation.

I. INTRODUCTION

The paper targets metric localisation when appearance changes make conventional feature matching unreliable and require costly condition-specific mapping. It learns appearance-transferred images optimized for feature matching through differentiable SURF components and uses them in a localization pipeline.

Motivation

  • Appearance changes such as illumination and seasons degrade keypoint matching, often requiring separate maps for sunny, snow, dawn, dusk, rain, and night conditions.Mapping every condition is time consuming, expensive, and may be impossible; adverse-condition data can also reduce map quality.Source: §I · p. 1

Contribution

  • The core contribution is an adversarially trained network that synthesizes images of the same location under different conditions while incorporating differentiable feature detection and description.The approach introduces a loss based on SURF detector response maps and dense descriptor maps.Source: §I · p. 1

Training

  • Stage 1 trains bidirectional image synthesizers on unaligned source and target traversals using cycle consistency, discriminator, detector, and descriptor losses.The method selects a complete source traversal and a small portion of a target traversal without requiring image alignment.Source: §I · p. 1
  • Stage 2 fine-tunes the synthesizers on a small set of metric-6DoF-aligned image pairs using L1 losses on feature detector and descriptor outputs.The aligned subset supplies pixel correspondence unavailable to the unsupervised first stage.Source: §I · p. 1

Localization pipeline

  • The resulting synthetic images feed a stereo localization pipeline that performs place recognition and then sparse keypoint matching to estimate metric pose against retrieved map frames.Results are benchmarked against RTK-GPS ground truth on the Oxford RobotCar Dataset.Source: §I · pp. 1–2

II. RELATED WORK

Prior work addresses appearance transfer, synthetic views, and image-to-image translation, but the paper focuses these ideas on metric localization by preserving feature matching through a two-stage SURF-aware training strategy.

Synthetic views and localization

  • Earlier synthetic-view methods address viewpoint or seasonal appearance changes, but reported poor alignment or degraded point features prevent metric localization.These methods include Google Streetview synthesis and superpixel-vocabulary translation.Source: §II · p. 2

Appearance transfer

  • Appearance-transfer approaches include local affine color transforms, neural style transfer, and unsupervised image-to-image translation based on paired generators and cycle consistency.The related translation literature includes and VAE-GAN methods using unaligned images.Source: §II · p. 2

Paper’s approach

  • This paper builds its detection and matching pipeline on SURF and trains generators in two stages: unpaired cycle-consistent transfer followed by fine-tuning on aligned data.The second stage separately fine-tunes the generators using well-aligned image pairs.Source: §III · p. 2

Architectures

  • The method’s supporting architecture includes a cycle-consistency network for unregistered appearance transfer and a fine-tuning network for detector- and descriptor-layer alignment.The generator uses a UResNet design, while the discriminator is a five-layer CNN producing a spatial real/fake map.Source: §III · pp. 2–3, Figure 2 · p. 3, Figure 3 · p. 3

A. SURF Detector Response Map

The differentiable SURF detector response map approximates Hessian determinants from image convolutions, providing a feature-detection signal that can participate in generator training.

SURF response construction

  • For each scale, SURF approximates the Hessian determinant by combining convolutional response maps for X, Y, and diagonal second-order derivatives.The response maps are denoted Lxx(σ), Lyy(σ), and Lxy(σ).Source: A. SURF Detector Response Map · pp. 3–4
  • The detector response is computed as det(Happrox) = Lxx ◦Lyy −0.81 ∗Lxy ◦Lxy.The operation uses the Hadamard product between corresponding response maps.Source: A. SURF Detector Response Map · p. 4

B. Dense SURF Descriptors

The dense SURF descriptor is implemented with convolutional HAAR responses and precomputed offsets and Gaussian weights, yielding normalized per-pixel descriptor stacks through which gradients can pass.

Descriptor construction

  • The dense descriptor method uses a fast convolutional construction adapted from OpenSURF so descriptor losses remain differentiable.The method computes descriptors for each of N selected scales.Source: B. Dense SURF Descriptors · p. 4
  • For each scale, the implementation precomputes neighbour offsets, scale-specific Gaussian weights, neighbourhood weights, and HAAR-like X/Y box filters.These components organize the 81 sampled responses used for each descriptor.Source: B. Dense SURF Descriptors · p. 4
  • The input is convolved with HAAR filters, and 81 weighted wavelet-response copies are stacked before being offset across each descriptor neighbourhood.The operations are applied separately for the X and Y directions.Source: B. Dense SURF Descriptors · p. 4

Descriptor output

  • The method sums raw and absolute responses along the stack direction, applies neighbourhood-specific weights, and stacks four resulting matrices per neighbourhood.The final descriptor is a normalized 64-layer H ×W matrix stack for each scale.Source: B. Dense SURF Descriptors · p. 4

Training efficiency

  • Training computes SURF losses only over the first five scales because most features are detected below scale 10 without significant observed performance loss.The authors suggest smaller neighbourhoods may experience more uniform appearance changes across conditions.Source: B. Dense SURF Descriptors · p. 5

C. Losses

The training objectives combine adversarial, reconstruction, feature-detector, and dense-descriptor losses to make synthetic images useful for matching. Generator and discriminator objectives are optimized during training, with a separate fine-tuning stage for aligned targets.

C. Losses

  • Cycle consistency is enforced both between input and reconstructed images and between their SURF detector and dense descriptor maps.Source: C. Losses · p. 5
  • The generators are trained with adversarial, reconstruction, SURF detector, and dense descriptor losses, while discriminators have their own objective.The complete generator objective is combined with discriminator and fine-tuning objectives.Source: C. Losses · p. 5
  • The fine-tuning stage uses aligned target images together with synthetic and input images to define additional losses.Source: C. Losses · p. 5

IV. EXPERIMENTAL SETUP

The experiments use Oxford RobotCar traversals spanning up to one year and five day-to-condition pairs. Training uses all day images plus roughly 20% of the paired condition, leaving 80% for benchmarking, with a separate aligned dataset for fine-tuning.

IV. EXPERIMENTAL SETUP

  • Six Oxford RobotCar traversals collected up to one year apart form five condition pairs: day-night, day-snow, day-dawn, day-sun, and day-rain.RTK-GPS ground truth was filtered by discarding points with translation standard deviation above 25cm.Source: §IV · p. 5
  • Training uses the entire day traversal and approximately 20% of the paired condition, while the remaining 80% benchmarks synthetic-image performance.Source: §IV · p. 5
  • Aligned fine-tuning pairs have little or no viewpoint rotation, with small rotational differences corrected by affine warping using RTK-GPS poses.Source: §IV · p. 5

A. Training

Training alternates discriminator and generator updates during cycle consistency, using Adam with specified loss weights and a small batch size.

A. Training

  • Each iteration first trains the discriminator on real target and previously generated images, then trains the generators to minimize Lgen.Source: A. Training · p. 5
  • Adam training uses an initial learning rate of 0.0002 and batch size 1.Source: A. Training · p. 5
  • The reported loss weights are λrec = 8, λdet = 2, λdesc = 2, and λadv = 1.Source: A. Training · p. 5

B. Localisation

The trained generators translate map and query traversals between day and target conditions before localisation. Evaluation uses a feature-based topological localiser followed by geometric verification and reprojection-error optimization.

B. Localisation

  • GAB transforms all day map frames into target-condition frames, while GBA transforms five target conditions into day-condition frames.Source: B. Localisation · p. 5
  • The localisation system uses the experience-based navigation system of to evaluate synthetic images against a previously built map.Source: B. Localisation · p. 5
  • Localisation proceeds with a feature-based topological localiser, RANSAC geometric verification, and nonlinear minimization of inlier reprojection errors.Source: B. Localisation · p. 5

V. RESULTS

The method improves metric localisation across adverse appearance changes, with synthetic images increasing accuracy, localisation rates, and matching robustness over raw or RGB-only alternatives.

  • The stage-1 synthetic images significantly improved localisation accuracy, and stage-2 fine-tuning produced a further increase over raw and RGB-only images.Source: A. Quantitative results · p. 6
  • Localisation rates improved across transformed conditions, often by a factor of 2, while metric errors were reduced.Source: A. Quantitative results · p. 6
  • The best solution produced a large improvement in day-night translation and rotation accuracy compared with raw images and RGB-only outputs.Source: A. Quantitative results · p. 6, Figure 7 · p. 6
  • Real-to-synthetic matching produced significantly more inliers than real-to-real matching as distance travelled increased.Source: A. Quantitative results · p. 6
  • Synthetic images significantly reduced the distance travelled before re-localisation after a localisation failure, whereas RGB-only outputs offered little robustness improvement.Source: A. Quantitative results · p. 6

B. Qualitative results

Qualitative and system-level evidence shows that appearance transfer restores feature matches in difficult scenes while fitting naturally as a front end to existing localisation systems.

  • Appearance transfer recovered matches in locations where raw-image matching failed or produced very few inliers.The transformed images reconstructed feature-relevant details such as window frames.Source: B. Qualitative results · p. 6, Figure 10 · p. 7
  • The method's quantitative robustness is consistent with its qualitative goal of improving matching under adverse appearance changes.Source: §VI · p. 6, B. Qualitative results · p. 6
  • Qualitative comparisons show more inlier matches when transformed live frames are matched against real map images under different conditions.Source: Figure 10 · p. 7
  • The system processes image streams outside the localisation pipeline, allowing it to serve as an offline or online front end to existing systems.Source: §VI · p. 8

VII. FUTURE WORK

Future work should handle continuous illumination and weather variation rather than discrete condition categories, ideally with one generator model.

  • Future work could model continuous illumination and weather changes instead of binning conditions into discrete categories.Source: §VII · p. 8
  • A single generator model is proposed as an ideal way to handle those continuous condition changes.Source: §VII · p. 8
Loading 1803.03341v1…