Automated wavelet-based data compression systems and methods

Patent metadata

Field	Value
Publication number	US-10638013-B2
Application number	US-201715618753-A
Country	US
Kind code	B2
Filing date	Jun 9, 2017
Priority date	Jun 9, 2016
Publication date	Apr 28, 2020
Grant date	Apr 28, 2020

Abstract

Systems and methods for processing online data are disclosed. One such method includes receiving a plurality of data points in a time-series at a short term storage. The method also includes calculating at least one approximation coefficient based on the plurality of data points using a wavelet transform, including calculating a highest level approximation coefficient, and calculating estimated value based on the highest level approximation coefficient. The method further includes calculating differences between the estimated value and the plurality of data points of the short term storage, and determining whether a maximum difference among the calculated differences is less than a predetermined threshold. The method further includes, based on the maximum difference being greater than or equal to the predetermined threshold, storing the oldest data point of the short term storage in a long term storage.

First claim

The invention claimed is:

1. A system for compressing time-series data, the system comprising: a processor; a memory communicatively connected to the processor, wherein the memory includes a short term storage and a long term storage, and wherein the memory storing computer-executable instructions which, when executed, cause the processor to perform: (a) receiving a plurality of data points in a time-series at a current tree in the short term storage; (b) calculating at least one approximation coefficient based on the plurality of data points using a wavelet transform, including calculating a highest level approximation coefficient; (c) calculating an estimated value based on the highest level approximation coefficient; (d) calculating differences between the estimated value and the plurality of data points of the short term storage; (e) comparing whether a maximum difference among the calculated differences is less than a predetermined threshold; and (f) based on the maximum difference being greater than or equal to the predetermined threshold, preparing a compressed data set by storing the oldest data point in the time-series of the short term storage in the long term storage, discarding the oldest half of the data points in the time-series and coefficients from the short term storage, and retaining the newest half of the data points in the short term storage; and receiving one or more new data points into a new tree and repeating steps (b)-(e); (g) based on the maximum difference being less than the predetermined threshold, determining whether a tree size of the current tree is less than a preset maximum tree size; (g)(1) if the tree size of the current tree is less than the preset maximum tree size, receiving one or more new data points into a new tree and repeating steps (b)-(e), and (g)(2) if the tree size of the current tree is equal to the preset maximum tree size, preparing the compressed data set by storing the oldest data point in the time-series of the short term storage in the long terra storage and discarding all coefficients and all data points in the current tree in the short term storage; and receiving one or more new data points into a new tree and repeating steps (b)-(e).

2. The system of claim 1 , wherein receiving the plurality of data points in the time-series includes receiving a selection of a data tag associated with a data stream including the plurality of data points in the time-series.

3. The system of claim 1 , wherein the predetermined threshold is based on accuracy of a source of the plurality of data points.

4. The system of claim 1 , wherein the plurality of data points represents output of a sensor associated with an industrial process.

5. The system of claim 4 , wherein the industrial process comprises a hydrocarbon production process in operation at a hydrocarbon production facility.

6. The system of claim 1 , wherein the preset maximum tree size is eight data points.

7. The system of claim 1 , wherein the plurality of data points and the one or more new data points correspond to a same tag.

8. The system of claim 1 , wherein the wavelet transform comprises a Haar wavelet transform.

9. A computer-implemented method of compressing time-series data, the method comprising: (a) receiving a plurality of data points in a time-series at a current tree in a short term storage; (b) calculating at least one approximation coefficient based on the plurality of data points using a wavelet transform, including calculating a highest level approximation coefficient; (c) calculating an estimated value based on the highest level approximation coefficient; (d) calculating differences between the estimated value and the plurality of data points of the short term storage; (e) comparing whether a maximum difference among the calculated differences is less than a predetermined threshold; and (f) based on the maximum difference being greater than or equal to the predetermined threshold, preparing a compressed data set by storing the oldest data point in the time-series of the short term storage in a long term storage, discarding the oldest half of the data points in the time-series and coefficients from the short term storage, and retaining the newest half of the data points in the short term storage; and receiving one or more new data points into a new tree and repeating steps (b)-(e); (g) based on the maximum difference being less than the predetermined threshold, determining whether a tree size of the current tree is less than a preset maximum tree size; (g)(1) if the tree size of the current tree is less than the preset maximum tree size, receiving one or more new data points into a new tree and repeating steps (b)-(e), and (g)(2) if the tree size of the current tree is equal to the preset maximum tree size, preparing the compressed data set by storing the oldest data point in the time-series of the short term storage in the long term storage and discarding all coefficients and all data points in the current tree in the short term storage; and receiving one or more new data points into a new tree and repeating steps (b)-(e).

10. The method of claim 9 , wherein the predetermined threshold is based on accuracy of a source of the plurality of data points.

11. A system for compressing time-series data generated by a hydrocarbon production facility, the system comprising: a processor; a memory communicatively connected to the processor, wherein the memory includes a short term storage and a long term storage, and wherein the memory storing computer-executable instructions which, when executed, cause the processor to perform: (a) receiving a selection of a data tag associated with a data stream including a plurality of data points in a time-series at a current tree in the short term storage, wherein the data tag is associated with a sensor in a hydrocarbon production facility; (b) calculating at least one approximation coefficient based on the plurality of data points using a wavelet transform, including calculating a highest level approximation coefficient; (c) calculating an estimated value based on the highest level approximation coefficient; (d) calculating differences between the estimated value and the plurality of data points of the short term storage; (e) comparing whether a maximum difference among the calculated differences is less than a predetermined threshold, wherein the predetermined threshold is based on accuracy of the sensor; and (f) based on the maximum difference being greater than or equal to the predetermined threshold, preparing a compressed data set by storing the oldest data point in the time-series of the short terra storage in the long terra storage, discarding the oldest half of the data points in the time-series and coefficients from the short term storage, and retaining the newest half of the data points in the short term storage; and receiving one or more new data points into a new tree and repeating steps (b)-(e); (g) based on the maximum difference being less than the predetermined threshold, determining whether a tree size of the current tree is less than a preset maximum tree size; (g)(1) if the tree size of the current tree is less than the preset maximum tree size, receiving one or more new data points into a new tree and repeating steps (b)-(e), and (g)(2) if the tree size of the current tree is equal to the preset maximum tree size, preparing the compressed data set by storing the oldest data point in the time-series of the short term storage in the long term storage and discarding all coefficients and all data points in the current tree in the short term storage; and receiving one or more new data points into a new tree and repeating steps (b)-(e).

12. The syste

Assignees

• Chevron Usa Inc

Inventors

• Deshpande Alisha
• Brenskelle Lisa Ann

Classifications

• H04N19/63

  using sub-band based transform, e.g. wavelets · CPC title

• H04L27/0004

  using wavelets · CPC title

• H04N1/41

  Bandwidth or redundancy reduction (by scanning H04N1/17 {; methods or arrangements for coding, decoding, compressing or decompressing digital video signals H04N19/00}) · CPC title

• G06T9/00

  Image coding (bandwidth or redundancy reduction for static pictures H04N1/41; coding or decoding of static colour picture signals H04N1/64; methods or arrangements for coding, decoding, compressing or decompressing digital video signals H04N19/00) · CPC title

• H04N1/3217 Primary

  using wavelet transforms · CPC title