Event Detection in Optical Signals via Domain Adaptation

Antonino Maria Rizzo1, Luca Magri1, Pietro Invernizzi2, Enrico Sozio2, Gabriele Aquaro2, Stefano Binetti2, Cesare Alippi1,3, Giacomo Boracchi1
1Politecnico di Milano, 2Cisco Photonics, 3UniversitΓ  della Svizzera Italiana

Abstract

Data-driven models trained in an end-to-end manner can reliably detect events within optical signals. Unfortunately, event detection models poorly generalize when monitoring signals collected from devices with different acquisition procedures. We overcome this limitation by presenting a novel domain adaptation solution for event detection networks that enables inference across multiple types of devices. Rather than training a black-box detection network, we decouple event localization and classification tasks. Localization is performed by the Interval Proposal Algorithm (IPA), which leverages signal processing techniques to localize candidate events and derive context features. These events are then standardized and fed to a feature extractor to obtain morphological features. By combining domain-specific context features with domain-invariant morphological features, the classifier achieves good generalization capabilities through different domains. Our method can successfully detect events in OTDR traces achieving a mAP@0.5 of 75.33% on traces from the source domain and generalizing well (mAP@0.5 of 69.27%) on traces from the target domain, despite being trained solely from the source domain.

Paper Poster Publication Image

Introduction

Detection networks are used to identify events within OTDR traces allowing the monitoring of fiber links.

Publication Image

Two distinct types of OTDR devices analyzing the same fiber span might provide extremely different traces.

Publication Image

We designed an event-detection network that generalizes well on traces from different devices, avoiding the need for retraining (Domain Adaptation).

Problem Formulation

Key Intuitions

Proposed Method

Interval Proposal Algorithm

The Interval Proposal Algorithm localizes tentative events. It is composed of three stages:

  1. Peak Detection. Find peaks in the trace.
  2. Interval Estimation.
    1. For each peak, crop two windows around the peak.
    2. Use samples in the windows to fit two lines
    3. The left-limit is the right-most inlier of the left-hand model, the right- limit is the left-most inlier of righ-hand model.
  3. Context features. Extract domain-specific information e.g., power magnitude, or positional encoding of the events.

Publication Image
Event Standardization

This stage removes device-specific features. Resize the candidate event windows to be fixed-size and normalize in [βˆ’1, 1].

Feature Extractor and Classifier