WO2006128252A1 - Messaging method - Google Patents
Messaging method Download PDFInfo
- Publication number
- WO2006128252A1 WO2006128252A1 PCT/AU2006/000760 AU2006000760W WO2006128252A1 WO 2006128252 A1 WO2006128252 A1 WO 2006128252A1 AU 2006000760 W AU2006000760 W AU 2006000760W WO 2006128252 A1 WO2006128252 A1 WO 2006128252A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- data
- peaks
- values
- short message
- data vector
- Prior art date
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/04—Protocols for data compression, e.g. ROHC
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
- H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
Definitions
- This invention relates to a short message format that captures useful information embedded in a data vector of a sequence of symbols or numbers.
- the data vector may represent many different forms of information generated by various electronic and information systems.
- This short message format is particularly useful when bandwidth limited communication links are used to transmit a data set that can be represented as a set of data vectors that is true for essentially all types of data.
- Described herein is an algorithm formulated to be useful for data communications problems associated with bandwidth limited communications links.
- a potential solution to this problem uses a sequence of short messages to transmit a data set that can be divided into a number of data vectors. Each short message captures the essential information embedded in a data vector. A reconstructed data set can then be formed after a number of short messages have been received. The reconstructed data set contains the essential information embedded in the original data set.
- a method of creating a short message for the transmission of information embedded in a data vector the data vector consisting of data points, and the short message has the form
- V M [Vi, V 2 , . . . , V N/ PI, P 2 ,. . . , PN, ⁇ , ⁇ ], where Vi 1 V%. . .,VN are the values of N peaks, Pi, P 2 ,. . .
- PN are their corresponding positions, ⁇ and ⁇ are the mean and standard deviation of the data points contained in the data vector, wherein the method includes the following steps: selecting the largest peak in said data vector, selecting the next largest peak if its position is greater than a predetermined position separation from each of the said previously selected peaks, otherwise, select the next largest peak, and repeat the previous selection steps until the predetermined N peaks have been selected or the list of peaks in said data vector in descending order has been exhausted.
- a plurality of said short messages can be used to reconstruct the value tracks in the data set
- the method of reconstruction after receiving a number of successive short messages comprises, forming a matrix with the number of rows being the number of short messages received and the number of columns being the number of positions, where in each row, the entries whose columns correspond to peaks in the short message are the peak values, while all other entries are set to a predetermined value to represent background values wherein such a matrix contains the value tracks in the data set with all the selected peak values of the original data set.
- Fig. 1 depicts an embodiment of the flow diagram of the method of the invention.
- a purposely-designed short message format can be used to transmit a set of data. Each message summarises the information embedded in a data vector in a compact format that is suitable for applications using bandwidth limited communication links. A sequence of such short messages can be used to reconstruct the data set with the relative values preserved.
- This short message format can be used in conjunction with other data communications algorithms such as those utilising image compression and reconstruction algorithms, which are the subject of a separate patent application in the name of the same applicant, entitled “Matrix Compression Arrangements" and filed on the same day as this specification, and which is incorporated herein by reference.
- This specification provides a design of a very short message that summaries the information provided by a data vector and is so short that it can be used for applications utilising severely bandwidth limited communication links.
- the short message takes the form
- M [V 1 , V 2 ,. . . , V N , PI, Pi, . . . , PN, ⁇ , ⁇
- Vi, Vi,. . ., VN are the values of N peaks
- Pi, P%. . ., PN are their corresponding positions
- ⁇ and ⁇ are the mean and standard deviation of the data points contained in the data vector.
- the mean ⁇ is an indication of the background level and the standard deviation ⁇ is an indication of the background variability.
- a minimum position separation should be predetermined so as to avoid two peaks coming from related data points, which may represent the same source represented by the data points or a common signal source if the data is representative of signals, being chosen.
- the value of N will depend to some degree on the wanted or needed size of the short message and this may be determined by a number of factors that include the capacity of the communication channel that is available at the time and/ or the number of peaks of interest that are required to be communicated in the short message format. The later requirement may sometimes depend on a variable that could change in a short time and be chosen by a processor or which may be determined by a human operator who is capable of determining the peaks of interest.
- the procedure at a minimum, includes the following steps: selecting the largest peak (14), selecting the next largest peak if it passes the position separation test for each of the previously selected peaks (16), otherwise, go to the next one (20), and so on. Stop if N peaks have been selected or the list of peaks in descending order has been exhausted (18). Thus, the message (22) contains at most N peaks.
- the process is illustrated in the flow chart at Fig. 1.
- the step of determining the number of peaks N and the required position separation S (10) is a preliminary step that as described can be determined on an as needs basis or may be predetermined.
- the step of determining all the peaks in the data vector and sorting the value of those peaks in descending order to form a peak vector A (12) is also a preliminary step of data preparation.
- the data vector can represent any data and may in one example represent a signal received at a remote sensor having a variety of characteristic including for example a voltage, current, etc. which fluctuate over time and thus have one or more peaks of which none, one or more may be of particular interest.
- the end user may first assess how much some of the peaks are above the background level with consideration being given to the background variability as well. A large difference in either and both indicates that a value of interest is present which warrants further investigation.
- the end user may also perform a statistical analysis to quantify the significance of the peaks compared to the data contained in the data vector after assuming a commonly used statistical model for the data.
- Normal and exponential distributions may be the ones most suitable for modelling the signal data contained in the data vector.
- the probability density function of a normal distribution with mean ⁇ and standard deviation ⁇ is defined as
- this cumulative probability characterises how significant the value p is.
- M [Vi, Vi, . . , V N , PI, Pi, . . ., PN, ⁇ , ⁇ , a].
- the short message formed in this way is so short that it can be transmitted to an end user quickly even via a bandwidth limited communication channels.
- the end user can examine the peak values taking into account of the mean and variance, which represent the background level and its variability. A statistical analysis to quantify the level of significance of the peaks may also be conducted. With a number of successive short messages, it is possible to form a matrix with the number of rows being the number of short messages received and the number of columns being the number of positions. In each row, the entries whose columns correspond to peaks in the short message are the peak values, while all other entries are set to an appropriate value as described below and will be called the background value.
- m and n be the maximum and minimum values respectively from all the short messages.
- b min ⁇ 4(m -n), 4 n 15 ⁇ . It is then possible to display this matrix as an image, which can be referred to as a reconstructed data set. Value tracks can be visualised in this way with the peak values preserved.
Abstract
Description
Claims
Priority Applications (5)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP06741177A EP1889369A4 (en) | 2005-06-03 | 2006-06-05 | Messaging method |
US11/916,265 US8060548B2 (en) | 2005-06-03 | 2006-06-05 | Messaging method |
AU2006254739A AU2006254739B2 (en) | 2005-06-03 | 2006-06-05 | Messaging method |
NZ564059A NZ564059A (en) | 2005-06-03 | 2006-06-05 | Messaging method |
CA2609863A CA2609863C (en) | 2005-06-03 | 2006-06-05 | Messaging method |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
AU2005902871 | 2005-06-03 | ||
AU2005902871A AU2005902871A0 (en) | 2005-06-03 | Messaging method |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2006128252A1 true WO2006128252A1 (en) | 2006-12-07 |
Family
ID=37481157
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/AU2006/000760 WO2006128252A1 (en) | 2005-06-03 | 2006-06-05 | Messaging method |
Country Status (5)
Country | Link |
---|---|
US (1) | US8060548B2 (en) |
EP (1) | EP1889369A4 (en) |
CA (1) | CA2609863C (en) |
NZ (1) | NZ564059A (en) |
WO (1) | WO2006128252A1 (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP2588890A4 (en) * | 2010-06-30 | 2016-04-13 | Schlumberger Technology Bv | Systems and methods for compressing data and controlling data compression in borehole communication |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP0273820A2 (en) * | 1986-12-12 | 1988-07-06 | Sangamo Weston, Inc. | Data compression apparatus and method for data recorder |
JPH07111458A (en) * | 1993-10-08 | 1995-04-25 | Takayama:Kk | Voice compressing method and device thereof |
WO2003096543A1 (en) * | 2002-05-09 | 2003-11-20 | International Business Machines Corporation | Method and arrangement for data compression according to the lz77 algorithm |
FR2842671A1 (en) * | 2002-07-22 | 2004-01-23 | Inst Nat Rech Inf Automat | ROBUST DIGITAL DATA WITH TRANSMISSION NOISE |
Family Cites Families (16)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CA1128624A (en) * | 1978-10-10 | 1982-07-27 | Henry S. More | Transmitting well logging data |
US6101280A (en) * | 1994-07-04 | 2000-08-08 | Hewlett-Packard Company | Method and apparatus for compression of electronic ink |
US6525722B1 (en) * | 1995-08-04 | 2003-02-25 | Sun Microsystems, Inc. | Geometry compression for regular and irregular mesh structures |
JPH09190592A (en) * | 1996-01-10 | 1997-07-22 | Oki Electric Ind Co Ltd | Transmission method for oceanographic survey data |
US6215910B1 (en) * | 1996-03-28 | 2001-04-10 | Microsoft Corporation | Table-based compression with embedded coding |
US6404923B1 (en) * | 1996-03-29 | 2002-06-11 | Microsoft Corporation | Table-based low-level image classification and compression system |
US6026217A (en) * | 1996-06-21 | 2000-02-15 | Digital Equipment Corporation | Method and apparatus for eliminating the transpose buffer during a decomposed forward or inverse 2-dimensional discrete cosine transform through operand decomposition storage and retrieval |
US6728775B1 (en) * | 1997-03-17 | 2004-04-27 | Microsoft Corporation | Multiple multicasting of multimedia streams |
US6735253B1 (en) * | 1997-05-16 | 2004-05-11 | The Trustees Of Columbia University In The City Of New York | Methods and architecture for indexing and editing compressed video over the world wide web |
US6614428B1 (en) * | 1998-06-08 | 2003-09-02 | Microsoft Corporation | Compression of animated geometry using a hierarchical level of detail coder |
US7194128B1 (en) * | 2000-07-26 | 2007-03-20 | Lockheed Martin Corporation | Data compression using principal components transformation |
US6804400B1 (en) * | 2000-11-01 | 2004-10-12 | Bae Systems Mission Solutions Inc. | Adaptive hyperspectral data compression |
US7302106B2 (en) * | 2003-05-19 | 2007-11-27 | Microsoft Corp. | System and method for ink or handwriting compression |
GB2410123B (en) * | 2003-09-25 | 2006-11-01 | Thermo Finnigan Llc | Method of processing and storing mass spectrometry data |
US7522774B2 (en) * | 2004-03-10 | 2009-04-21 | Sindhara Supermedia, Inc. | Methods and apparatuses for compressing digital image data |
US7342580B1 (en) * | 2004-04-02 | 2008-03-11 | Pacific Data Images Llc | Surface compression based on reference geometry in animation models |
-
2006
- 2006-06-05 WO PCT/AU2006/000760 patent/WO2006128252A1/en active Application Filing
- 2006-06-05 US US11/916,265 patent/US8060548B2/en not_active Expired - Fee Related
- 2006-06-05 CA CA2609863A patent/CA2609863C/en not_active Expired - Fee Related
- 2006-06-05 EP EP06741177A patent/EP1889369A4/en not_active Ceased
- 2006-06-05 NZ NZ564059A patent/NZ564059A/en not_active IP Right Cessation
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP0273820A2 (en) * | 1986-12-12 | 1988-07-06 | Sangamo Weston, Inc. | Data compression apparatus and method for data recorder |
JPH07111458A (en) * | 1993-10-08 | 1995-04-25 | Takayama:Kk | Voice compressing method and device thereof |
WO2003096543A1 (en) * | 2002-05-09 | 2003-11-20 | International Business Machines Corporation | Method and arrangement for data compression according to the lz77 algorithm |
FR2842671A1 (en) * | 2002-07-22 | 2004-01-23 | Inst Nat Rech Inf Automat | ROBUST DIGITAL DATA WITH TRANSMISSION NOISE |
Non-Patent Citations (2)
Title |
---|
DATABASE WPI Week 200418, Derwent World Patents Index; Class U21, AN 2004-182535, XP003004844 * |
PATENT ABSTRACTS OF JAPAN * |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP2588890A4 (en) * | 2010-06-30 | 2016-04-13 | Schlumberger Technology Bv | Systems and methods for compressing data and controlling data compression in borehole communication |
Also Published As
Publication number | Publication date |
---|---|
EP1889369A4 (en) | 2009-04-22 |
EP1889369A1 (en) | 2008-02-20 |
NZ564059A (en) | 2010-10-29 |
US20080215657A1 (en) | 2008-09-04 |
CA2609863A1 (en) | 2006-12-07 |
CA2609863C (en) | 2014-02-18 |
US8060548B2 (en) | 2011-11-15 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN107743103B (en) | Multi-node access detection and channel estimation method of MMTC (multimedia messaging and control) system based on deep learning | |
US8055095B2 (en) | Parallel and adaptive signal processing | |
US8473438B2 (en) | Combined-model data compression | |
US7941276B2 (en) | Systems, methods and apparatus for reconstructing phylogentic trees | |
US11055816B2 (en) | Image processing device, image processing method, and image processing program | |
EP1766911A1 (en) | Discrete universal denoising with reliability information | |
CN111984544B (en) | Device performance test method and device, electronic device and storage medium | |
CN106452626B (en) | Broader frequency spectrum compressed sensing based on multigroup relatively prime sampling | |
KR101284569B1 (en) | Method and apparatus for sparse signal reconstruction over finite fields | |
US20190319642A1 (en) | Device and method for compressing a data stream | |
KR102339723B1 (en) | Method, program, and appratus of decoding based on soft information of a dna storage device | |
WO2006128252A1 (en) | Messaging method | |
US7474793B2 (en) | Methods for compression using a denoiser | |
AU2006254739B2 (en) | Messaging method | |
JP2008504748A (en) | Discrete universal denoising by error correction coding | |
CN115034255A (en) | Signal modulation identification algorithm with attention mechanism time convolution network | |
JP2006333055A (en) | System and method for observation device distributed observation | |
US8358858B2 (en) | Matrix compression arrangements | |
EP1566760A2 (en) | Method and system of replacing missing genotyping data | |
CN110929849A (en) | Neural network model compression method and device | |
JP3933668B2 (en) | Signal processing apparatus, signal processing method, and computer-readable storage medium | |
US20060045218A1 (en) | Discrete denoising using blended counts | |
US8189722B2 (en) | Discrete denoising using blended counts | |
CN115208513B (en) | Method and device for identifying scrambling type of linear block code and computer equipment | |
CN110119636B (en) | Digital circuit, data storage method and device |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
WWE | Wipo information: entry into national phase |
Ref document number: 2609863 Country of ref document: CA Ref document number: 2006254739 Country of ref document: AU |
|
WWE | Wipo information: entry into national phase |
Ref document number: 11916265 Country of ref document: US |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
WWE | Wipo information: entry into national phase |
Ref document number: 564059 Country of ref document: NZ |
|
WWW | Wipo information: withdrawn in national office |
Ref document number: DE |
|
ENP | Entry into the national phase |
Ref document number: 2006254739 Country of ref document: AU Date of ref document: 20060605 Kind code of ref document: A |
|
WWP | Wipo information: published in national office |
Ref document number: 2006254739 Country of ref document: AU |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2006741177 Country of ref document: EP |
|
WWP | Wipo information: published in national office |
Ref document number: 2006741177 Country of ref document: EP |