This disclosure relates generally to sensing systems, methods, and structures. More particularly, it pertains to Raman-based distributed temperature sensing (DTS).
Distributed temperature sensing systems are optoelectronic systems that measure temperatures by means of optical fibers functioning as linear sensors. Generally, temperatures are recorded along the optical sensor cable as a continuous profile. As is known, such systems provide a high accuracy of temperature determination over great distances and may exhibit the ability to locate temperatures to a spatial resolution of 1 m with an accuracy to within ±0.01° C. over measurement distances greater than 30 km. As a consequence, such systems have found widespread use in contemporary applications including: oil and gas exploration and production, power cable and transmission line monitoring, fire detection, industrial surveillance, integrity of liquid natural gas (LNG) carriers and terminals, temperature monitoring in plant and process engineering including transmission pipelines, and ecological monitoring including stream temperature, and groundwater detection—among others.
Given the utility and importance of DTS systems and methods, improvements thereto would be a welcome addition to the art.
An advance in the art is made according to aspects of the present disclosure directed to an improved method for Raman based Distributed temperature sensing (DTS) system utilizing a novel recovery method to improve the spatial resolution of the DTS system. The method is based on a linear DTS model and weighted total variation. Of further advantage, an enhanced method which automatically detects and recovers any hot regions along the fiber, is described—with the novel recovery method as its core.
In sharp contrast to the prior art, DTS system(s) employing our novel methods may advantageously achieve correct reconstruction with a temperature profile down to 10 cm in length—which is equivalent to improving the spatial resolution to about 5 cm.
As will become readily apparent to those skilled in the art, systems and methods according to the present disclosure are: simple and robust with less uncertainty and errors; eliminate unwanted noise through the use of a weighted regularization parameter method, ensuring the accurate temperature recovers; recover accurate temperatures for short lengths of fiber by matching recovered and measured response shapes with auto-tuning methods; and are readily implementable in a DTS.
A more complete understanding of the present disclosure may be realized by reference to the accompanying drawing in which:
The illustrative embodiments are described more fully by the Figures and detailed description. Embodiments according to this disclosure may, however, be embodied in various forms and are not limited to specific or illustrative embodiments described in the drawing and detailed description.
The following merely illustrates the principles of the disclosure. It will thus be appreciated that those skilled in the art will be able to devise various arrangements which, although not explicitly described or shown herein, embody the principles of the disclosure and are included within its spirit and scope.
Furthermore, all examples and conditional language recited herein are intended to be only for pedagogical purposes to aid the reader in understanding the principles of the disclosure and the concepts contributed by the inventor(s) to furthering the art and are to be construed as being without limitation to such specifically recited examples and conditions.
Moreover, all statements herein reciting principles, aspects, and embodiments of the disclosure, as well as specific examples thereof, are intended to encompass both structural and functional equivalents thereof. Additionally, it is intended that such equivalents include both currently known equivalents as well as equivalents developed in the future, i.e., any elements developed that perform the same function, regardless of structure.
Thus, for example, it will be appreciated by those skilled in the art that any block diagrams herein represent conceptual views of illustrative circuitry embodying the principles of the disclosure.
Unless otherwise explicitly specified herein, the FIGs comprising the drawing are not drawn to scale.
By way of some additional background, we begin by noting that spatial resolution is generally understood to be a spatial distance between the 10% and 90% levels of the response to a temperature step. As shown in
From a hardware point of view, several studies for improvement in spatial resolution of DTS system have been presented in the literature (See, e.g., João Paulo Bazzo, Daniel Rodrigues Pipa, Cicero Martelli, Erlon Vagner da Silva, and Jean Carlos Cardozo da Silva. Improving Spatial Resolution of Raman DTS Using Total Variation Deconvolution. IEEE Sensors Journal, 16(11):4425-4430, 2016; Stephen Boyd, Neal Parikh, Eric Chu, Borja Peleato, and Jonathan Eckstein. Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers. Foundations and Trends® in Machine Learning, 3(1):1-122, 2011; and Stanley H Chan, Ramsin Khoshabeh, Kristofor B Gibson, Philip E Gill, and Truong Q Nguyen. An Augmented Lagrangian Method for Total Variation Video Restoration. IEEE Transactions on Image Processing, 20(11):3097-3111, 2011.)
Note, however, such techniques oftentimes exhibit a higher cost, or other complications including equipment design and/or undesirable performance characteristics including an increase in the response time and in uncertainty of measurement.
Another alternative approach to improving spatial resolution involves using signal processing techniques. More particularly, proposals have been made to use a deconvolution algorithm for improving the spatial resolution of a commercial Raman DTS system. The algorithm uses a linear model for the DTS system, which was empirically determined, and a total variation reconstruction approach to estimate hot regions with lengths shorter than 1 m. Such techniques have shown promise for providing enhancement in DTS spatial resolution without increasing equipment costs—without requiring physical changes in the device. Notwithstanding such promise, improvements remain necessary as such approaches have suffered from at least the following drawbacks:
Generally speaking—and as will be appreciated by those skilled in the art, a profile reconstruction problem is an inverse problem, therefore we need to learn the system first and then solve the inverse problem. Thus, the process needs to be divided into two parts: system identification and signal recovery. And while our general approach is built upon the linear system and deconvolution theory, we advantageously have developed new and improved algorithms and procedures to better identify the system in both temperature and length spaces and more accurately recover the real temperature profiles.
Specifically, the new algorithms and procedures are in the following areas:
Moreover, we developed an algorithm to recover arbitrary temperature profile by finding all the hot regions and using the recovery algorithm to recover each small piece of signal locally.
An illustrative DTS system used in our work is a breadboard 1064 nm system illustratively shown in
System Identification
The modeling of the DTS system is based on a linear system theory, which may be understood by examination of
g(z)=h(z)*f(z) (1)
Since we only need to recover the signal on what we measured, we can just consider the sampling points in the measurement, thus the discretized DTS is used rather than the continuous system.
As will be understood by those skilled in the art, convolution is a linear operation, therefore it can be expressed using a matrix-vector notation, and thus the DTS system is represented as:
where g is a vector formed by the sensor data (DTS readings), H is the sensitivity matrix, assembled from the DTS impulse response, f is a vector representing the actual temperature profile.
Now, we need to solve an optimization problem defined by:
minH∥−Hf∥2 (4)
Noticing the diagonal-constant structure of matrixH, see
h=[hn−1, . . . ,h1,h0,h−1, . . . ,h−n+1]T (5)
and rewrite the program as
minh∥g−Fh∥2 (6)
where
Then this is just a least-squares problem, a closed-form solution could be given by:
ĥ=(FTF)−1FTg. (8)
The system is characterized by H, so H should be as robust as possible, and the error ∥g−Hf∥2 should be minimized when H is applied to different input signal f. This is like the training process in machine learning, the more training data g we have, the more training data g we have, the more generalized H would be, and then the matrix H will be more applicable to approximate the system in different cases. For each measurement g, we'd like to minimize ∥g−Hf∥2, after measurement of m signals g1, g2, . . . , gm, the objective function we want to minimize is Σi=1m∥gi−Fih∥. Since this is an unconstrained convex program, by considering the optimality condition
F
1
T(F1h−g1)+ . . . +FmT(Fmh−gm)=0 (9)
and following (9), we can generalize the solution as
ĥ=(Σi=1mFiTFi)−1(Σi=1mFiTgi) (10)
where fi's constituting Fi's are artificially generated as the recovery results corresponding to gi's to train the system matrix H.
Note: The direct inverse of Σi+1mFiTFi could be problematic, while iterative methods like GMRES and MINRES could be used to find approximate inverse. Here, we use GMRES in our calculation once direct inverse doesn't work.
This procedure avoids turning the system into dual (wave number/frequency) domain by Laplace transform and turning it back to primal (space/time) domain by the inverse transform. In solving the transfer function, we need to specify the number of zeros and poles, this increases the error and uncertainty by introducing these two kinds of parameters.
For example, we use signals with length of 20 cm, 50 cm and 1.5 m as training data, see
In the following,
In
{circumflex over (f)}=argminf∥g−Hf∥1+λ∥Df∥1 (11)
where {circumflex over (f)} is the reconstructed signal, λ is the regularization parameter which controls the sensitivity of solution to noise, and D is a finite difference matrix
To solve this program, we use Alternating Direction Method of Multipliers (ADMM), which solves this problem by splitting it into 3 sub-problems and each one is easier than the original one, then the solution is given by solving sub-problems iteratively.
We note that ADMM is a simple but powerful algorithm that is well suited to distributed convex optimization, and in particular to problems arising in applied statistics and machine learning with large datasets and high-dimensional data. It takes the form of a decomposition-coordination procedure, in which the solutions to small local subproblems are coordinated to find a solution to a large global problem. ADMM can be viewed as an attempt to blend the benefits of dual decomposition and augmented Lagrangian methods for constrained optimization. The optimization problem is solved by transforming the original unconstrained minimization problem (9) to an equivalent constrained minimization problem (13). An augmented Lagrangian method is used to handle the constraints, and an alternating direction method is used to iteratively and solutions to the subproblems.
By introducing two variables r and u, we modify the problem as an ADMM form
The augmented Lagrangian is given by
Here, variable z is the Lagrange multiplier associated with constraint r=Hf−g, and variable y is the Lagrange multiplier associated with the constraint u=Df. Parameters ρo and ρr are two regularization parameters. Subscripts “o” and “r” stand for objective and regularization, respectively. For each iteration, do the following steps, until convergence criteria are achieved.
ADMM Iterations
(1) u-Subproblem
Optimality condition gives
−ρoHT(r−Hf+g)−ρrDT(u−Df)+HTz+DTy=0 (16)
then f-update is
(2) u-Subproblem
u-update is
u
k+1
=T
λ/ρ
(D fk+1+
where Tλ(⋅) is the term-by-term soft-thresholding operator
(3) r-Subproblem
r-update is
r
k+1
=T
1/ρ
(Hfk+1−g+
(4) y-Update and z-Update
k+1
=
k−(uk+1−Dfk+1) (23)
k+1
=
k−(rk+1−Hfk+1+g) (24)
These recovery results show that when the coil is short, we need a small parameter λ to make the highest temperature in reconstructed signal to be accurate, but this will introduce a lot of noise to the reconstruction signal. Since λ controls the difference between two adjacent points fi±1−fi, i.e. the increment at each point, when λ is small, it allows a huge increment at each point, including both the area of interests and other regions at room temperature. Therefore, λ=0.02 helps increase the highest temperature and gives a better recovery at the hot region in
We believe this results from that we use a uniform λ to control the increment everywhere along the fiber. If a varying λ is used, this problem might be solved. Thus, we put different weights on elements of f according to their values in g as follows:
For room temperature (assuming to be 23° C.), the weight is U, for maximum in g, the weight is L, and for other value t, a linear interpolation is used to give a weight w
Then matrix D is rewritten into a weighted version
Solving the weighted total variation problem
{circumflex over (f)}=argminf∥g−Hf∥1+λ∥Wf∥1 (27)
gives the reconstruction {circumflex over (f)}. Detailed recovery algorithm is shown in Algorithm 2.
signal to recover
system matrix
finite difference matrix
k+1 =
k+1 =
Comparing
Next, we show more results on reconstruction of signals with low temperature. The system matrix H is trained by 9 signals with length of 20 cm, 50 cm and 1.5 m, and at 2.1° C., 50° C. and 85° C. Signals to be reconstructed are at 10° C. with different length. The results are shown in
In the preceding discussion, we have described our signal recovery algorithm, which can be applied to various cases. In the next, we are going to depict the whole process when dealing with signals from real applications.
In real applications, there might be many hot or cold regions along the fiber, therefore we firstly want to detect all the meaningful peaks and troughs along the fiber and solve the inverse problem locally and then combine the reconstruction signals together. By reconstructing peak signals locally, we could both avoid reconstruct room temperature signals and reduce the computation time significantly.
Since we need to calculate the inverse of a matrix in (26), and we know the complexity of matrix inverse is O(n3), where n is the number of rows of the matrix, therefore we simplify the calculation by reducing n, i.e. size of the signal. Moreover, because the size of matrix H and length of the signal should match, if we want to recover the whole signal directly, we must have learnt a matrix with size as large as the signal length.
Computation of a very large matrix H is always time-consuming. Most importantly, signals with different length favor different parameters, so a unified set of parameters will not be suitable for every peak signal. If we recover each peak signal locally, then we could find the best parameters λ and U specifically for this signal.
Briefly speaking, this localization idea underlies the following reasons: 1) computation time; 2) size of matrix H and length of the signal should match; 3) no need to recover signal with temperature at room temperature; and 4) reconstruct each peak signal with best parameters.
In what follows, we describe algorithms used in Algorithm 7 Auto tuning, in which we basically search for best parameters λ and U that could give a recovery matching the actual temperature profile very well. Our searching guidelines are as follows:
Note: When l≤50 cm, the tuning process is much more complicated, since we're searching for both best λ and U, but it's basically like what we do for only one parameter λ for longer length. Details are in MATLAB code AutoTuning.m. Combining all efforts above, we could do the following steps to reconstruct an arbitrary signal.
We could test our reconstruction procedure on signal with single hot source as shown in
Multiple hot sources are shown in
Note that with respect to
The reconstruction in
In Table 1, we list experiments performed to test our whole process reconstruction procedure.
Furthermore, we'd like to test the whole process on signals with multiple peaks. Source separation is a good scenario where we could test our method. When two adjacent hot regions are close, the measurement could merge to be only one peak, due to the low-pass characteristics of the DTS system. For example, the measurement (in red) shown in
Based on auto division (using MATLAB peak analysis), we could find two peaks in the signals with separation >50 cm, see the prominence (p in [pks,locs,w,p]=findpeaks(signal,‘Annotate’,‘extents’);) plot in
Consequently, a signal with 2 peaks should be cut into two pieces and padded with value at the end point to have 2000 points, which is the size of the system matrix H in the experiments. After recovery of each peak, the two constructions should be combined to serve as the reconstruction of original signal. See
Upon determining a response g(z) to a stimulus (input) f(z), we note that the response is obtained by a convolution of the DTS impulse response h(z) with input f(z) such that g(z)=h(z)*f(z). Realizing that the sensitivity matrix H, is assembled by the impulse responses and a Toeplitz matrix, and directly obtaining H from the measured responses and the corresponding inputs with the optimization is converted to a least squares problem. This advantageously simplifies the process and introduces less uncertainty and errors. It may be implemented in two dimensional space including length and temperature.
The measured responses exhibit an accuracy that is limited by the DTS spatial resolution, accordingly a weighted variation penalization in regulation is employed to stabilize and improve the results.
An alternating direction method of multipliers (ADMM) is employed in the reconstruction process by splitting the problem into at least 3 sub problems wherein each one of the individual problems are easier to solver than an original, undivided problem, then solving the subproblems iteratively to obtain the solution. We note that by introducing a weighted regularization parameter, lambda, along the whole length and employing additional tuning parameters, unwanted noise is eliminated.
Finally, by targeting a minimum value and matching the recovered and measured response shapes (i.e., matching maximum values, areas, full width, half maximum) through an auto tuning mechanism, we ensure that more accurate recovered temperature values are obtained even for short lengths. As will be appreciated and understood, by eliminating reduced noise and temperature accuracy for short temperature profiles, superior temperature results are obtained.
In this disclosure, we have described a novel deconvolution algorithm to improve the spatial resolution of DTS system. Operationally, a linear model for the DTS and a weighted total variation reconstruction model to recover temperature signals from raw DTS signal was advantageously employed. We further describe a much simplified method of system identification to learn a matrix representing the DTS system. Advantageously, a weighted total variation is introduced to stabilize the reconstruction and reduce noise amplification. Moreover, we disclosed an entire process to re-construct arbitrary signal by using recovery algorithm for each peak signal locally with auto-tuned best parameters.
Accordingly, our results show that it's possible to correctly measure temperature variations in lengths as short as 10 cm. This is a significant improvement compared with the spatial resolution of 1 m determined by the hardware and the current state of the art.
Of particular significance, our recovery algorithm is good enough to reconstruct any signal with ideal parameters. We note that we can find best parameters by searching in an empirically predetermined parameter space.
At this point, while we have presented this disclosure using some specific examples, those skilled in the art will recognize that our teachings are not so limited. Accordingly, this disclosure should be only limited by the scope of the claims attached hereto.
This application claims the benefit of Untied States Provisional Patent Application Ser. No. 62/622,204 filed 26 Jan. 2018 the entire contents of which is incorporated by reference as if set forth at length herein.
Number | Date | Country | |
---|---|---|---|
62622204 | Jan 2018 | US |