# US 2015/0102948 A1 · Multi-layer system for symbol-space based compression of patterns

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2015/0102948 A1
- Document ID: US20150102948A1
- Status: Published application
- Kind: A1
- Application number: 14/573,652
- Filed: 2014-12-17
- Published: 2015-04-16
- Earliest claimed: 2013-02-12
- Assignees: Cortica, Ltd.
- Applicants: Cortica, Ltd.
- Inventors: Igal RAICHELGAUZ; Karina ODINAEV; Yehoshua Y. ZEEVI
- Web page: https://patentgrep.com/patent/US20150102948A1

## CPC

- G06T 9/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)
- H03M 7/30: Compression (speech analysis-synthesis for redundancy reduction G10L19/00; for image communication H04N); Expansion; Suppression of unnecessary data, e.g. redundancy reduction
- H03M 7/3084: {using adaptive string matching, e.g. the Lempel-Ziv method}
- H03M 7/46: Conversion to or from run-length codes, i.e. by representing the number of consecutive digits, or groups of digits, of the same kind by a code word and a digit indicative of that kind
- G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C)

## Abstract

A method and apparatus for symbol-space based compression of patterns are provided. The method comprises generating an output sequence responsive of an input sequence, the input sequence being of a first length and includes a plurality of symbols, by extraction of all common patterns, wherein a common pattern includes at least two symbols and the output sequence is of a second length that is shorter than the first length; and storing in a memory the output sequence as a data layer.

## Claims

### Claim 1

An apparatus for symbol-space based compression of patterns, comprising:
at least one processing unit;
an interface connected to the at least one processing unit, the interface is configured to receive an input sequence, wherein the input sequence is of a first length and includes a plurality of symbols; and
a memory connected to the at least one processing unit, wherein the memory is configured to store a plurality of instructions that when executed by the at least one processing unit, configured the apparatus to:
generate an output sequence responsive of the input sequence, wherein the output sequence is of a second length that is shorter than the first length, the output sequence further contains all common patterns within the input sequence;
provide the output sequence as a data layer; and
output through the interface the output sequence as a new input sequence for a subsequent generation of a new data layer.

### Claim 2 (depends on 1)

The apparatus of claim 1, wherein the common pattern includes at least two symbols of the plurality of symbols.

### Claim 3 (depends on 1)

The apparatus of claim 1, wherein the apparatus is further configured to:
store in the memory the data layer.

### Claim 4 (depends on 1)

The apparatus of claim 1, wherein the apparatus is further configured to:
remove common patterns that are of a length that is below a predefined threshold value.

### Claim 5 (depends on 4)

The apparatus of claim 4, wherein the apparatus is further configured to:
remove of a first common pattern that is included within a second common pattern when the second common pattern is longer than the first common pattern.

### Claim 6 (depends on 1)

The apparatus of claim 1, wherein each symbol of the plurality of symbols is any one of: a character, an image, an audio signal, a video signal, and a representation of a signal in a tangible form.

### Claim 7 (depends on 1)

The apparatus of claim 1, further comprises:
a signature generator communicatively connected to the one at least one processing unit and the memory, wherein the signature generator is configured to generate at least one signature responsive of at least one symbol, wherein the at least one signature is provided to the interface as the input sequence.

### Claim 8 (depends on 1)

The apparatus of claim 1, wherein each generated data layer comprises a collection of symbols used in the data layer.

### Claim 9 (depends on 8)

The apparatus of claim 8, wherein a symbol-space of a generated data layer is smaller than a symbol-space generated for any subsequently generated data-layer.

### Claim 10 (depends on 8)

The apparatus of claim 8, wherein each of the generated data layers is less invariant than any subsequently generated data-layer.

### Claim 11 (depends on 8)

The apparatus of claim 8, wherein each of the generated data layer is at least one of: less repeatable than any subsequently generated data-layer, less de-correlated than any subsequently generated data-layer, and less balanced than any subsequently generated data-layer.

### Claim 12

A method for symbol-space based compression of patterns, comprising:
generating an output sequence responsive of an input sequence, the input sequence being of a first length and includes a plurality of symbols, by extraction of all common patterns, wherein a common pattern includes at least two symbols and the output sequence is of a second length that is shorter than the first length; and
storing in a memory the output sequence as a data layer.

### Claim 13 (depends on 12)

The method of claim 12, further comprising:
providing the output sequence as a new input sequence for a subsequent generation of a data layer.

### Claim 14 (depends on 12)

The method of claim 12, wherein generating of the output sequence further comprises:
removing of common patterns that are of a length that is below a predefined threshold value.

### Claim 15 (depends on 14)

The method of claim 14, wherein the generation of the output sequence further comprises:
removing of a first common pattern that is included within a second common pattern when the second common pattern is longer than the first common pattern.

### Claim 16 (depends on 12)

The method of claim 12, wherein a symbol of the plurality of symbols is any one of: a character, an image, an audio signal, a video signal, and a representation of a signal in a tangible form.

### Claim 17 (depends on 12)

The method of claim 12, further comprising:
generating at least one signature responsive of at least one symbol, wherein the at least one signature is processed as the input sequence.

### Claim 18 (depends on 12)

The method of claim 12, wherein each generated data layer includes a collection of symbols used in the data layer.

### Claim 19 (depends on 18)

The method of claim 18, wherein a symbol-space of a generated data layer is at least one of: smaller than a symbol-space generated for any subsequently generated data-layer, less invariant than any subsequently generated data-layer, less repeatable than any subsequently generated data-layer, less de-correlated than any subsequently generated data-layer, and less balanced than any subsequently generated data-layer.

### Claim 20 (depends on 12)

A non-transitory computer readable medium having stored thereon instructions for causing one or more processing units to execute the method according to claim 12.

### Claim 21

A big-data storage system, comprising:
at least one processing unit configured to provide instructions for generation of a plurality of data layers responsive of an input sequence, wherein each data layer includes a collection of symbols used in the data layer, wherein a symbol-space of each previously generated data layer is smaller than a symbol-space generated for any subsequently generated data-layer; and
a memory communicatively connected to the at least one processing unit for storing therein the plurality of data layers.

### Claim 22 (depends on 21)

The system of claim 21, wherein a symbol in a data layer is any one of: a character, an image, an audio signal, a video signal, a representation of a signal in a tangible form.

### Claim 23 (depends on 21)

The system of claim 21, wherein the symbol includes at least one signature generated by a signature generator for the symbol.

### Claim 24 (depends on 21)

The system of claim 21, wherein each generated data layer is at least one of: less invariant, less repeatable, less de-correlated, and less balanced than any subsequently generated data-layer.
