Publication

Optimizing Image Denoising for Long-Range Brillouin Distributed Fiber Sensing

Abstract

Linear and nonlinear two-dimensional image processing approaches are analyzed with the aim of removing noise from data acquired by distributed optical fiber sensors based on Brillouin optical time-domain analysis (BOTDA). The impact of the filter parameters on the denoised data is analyzed, especially for the nonlinear image denoising method called non-local means (NLM). In particular, an optimization procedure to find the optimal parameters of the NLM method for BOTDA data denoising is proposed. The described optimization procedure has enabled, to the best of our knowledge, the first experimental demonstration of a conventional BOTDA scheme (i.e. with no modifications in the layout) capable of measuring along a 100 km sensing range over a 200 km fiber-loop, using a spatial resolution of 2 m, a frequency sampling step of 1 MHz and reaching a frequency uncertainty of 0.77 MHz with 2’000 averaged time-domain traces. The experimental sensing performance here achieved has been evaluated with a figure-of-merit (FoM) of 225’000. This is the highest FoM reached without hardware sophistication in BOTDA sensing.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.