# US 9,438,270 B2 · System and method 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 9,438,270 B2 - Document ID: US9438270B2 - Status: Granted - Kind: B2 - Application number: 14/929,976 - Filed: 2015-11-02 - Published: 2016-03-17 - Granted: 2016-09-06 - 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/US9438270B2 ## 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 system for symbol-space based pattern compression is provided. The method includes identifying a plurality of combinations of symbols in an input sequence, each identified combination of symbols appearing in the input sequence above a predefined threshold, the input sequence having a first length; generating an output sequence having a second length by replacing each identified combination of symbols with a unique symbol, wherein each unique symbol is not a previously used symbol, wherein the second length is shorter than the first length; and storing the output sequence as a data layer. ## Claims ### Claim 1 A method for symbol-space based pattern compression, comprising: identifying a plurality of combinations of symbols in an input sequence, each identified combination of symbols appearing in the input sequence above a predefined threshold, the input sequence having a first length; generating an output sequence having a second length by replacing each identified combination of symbols with a unique symbol, wherein each unique symbol is not a previously used symbol, wherein the second length is shorter than the first length; and storing the output sequence as a data layer. ### Claim 2 (depends on 1) The method of claim 1, further comprising: providing the output sequence as a new input sequence for a subsequent generation of a data layer. ### Claim 3 (depends on 1) The method of claim 1, wherein each combination of symbols having a combination length below a threshold combination length is not identified. ### Claim 4 (depends on 1) The method of claim 1, further comprising: determining whether a first combination of symbols appears within a second combination of symbols, the first combination of symbols having a shorter combination length than the second combination of symbols, wherein the first combination of symbols is not identified if the first combination of symbols appears within the second combination of symbols. ### Claim 5 (depends on 1) The method of claim 1, wherein each symbol is any of: a character, an image, an audio signal, a video signal, and a tangible representation of a signal. ### Claim 6 (depends on 1) The method of claim 1, wherein the input sequence and the plurality of combinations of symbols are signatures. ### Claim 7 (depends on 6) The method of claim 6, further comprising: generating a signature based on an input, wherein the input sequence is the generated signature. ### Claim 8 (depends on 1) A non-transitory computer readable medium having stored thereon instructions for causing one or more processing units to execute the method according to claim 1. ### Claim 9 A system for symbol-space based pattern compression, comprising: a processing unit; and a memory, the memory containing instructions that, when executed by the processing unit, configure the system to: identify a plurality of combinations of symbols in an input sequence, each identified combination of symbols appearing in the input sequence above a predefined threshold, the input sequence having a first length; generate an output sequence having a second length by replacing each identified combination of symbols with a unique symbol, wherein each unique symbol is not a previously used symbol, wherein the second length is shorter than the first length; and store the output sequence as a data layer. ### Claim 10 (depends on 9) The system of claim 9, wherein the system is further configured to: provide the output sequence as a new input sequence for a subsequent generation of a data layer. ### Claim 11 (depends on 9) The system of claim 9, wherein each combination of symbols having a combination length below a threshold combination length is not identified. ### Claim 12 (depends on 9) The system of claim 9, wherein the system is further configured to: determine whether a first combination of symbols appears within a second combination of symbols, the first combination of symbols having a shorter combination length than the second combination of symbols, wherein the first combination of symbols is not identified if the first combination of symbols appears within the second combination of symbols. ### Claim 13 (depends on 9) The system of claim 9, wherein each symbol is any of: a character, an image, an audio signal, a video signal, and a tangible representation of a signal. ### Claim 14 (depends on 9) The system of claim 9, wherein the input sequence and the plurality of combinations of symbols are signatures. ### Claim 15 (depends on 14) The system of claim 14, wherein the system is further configured to: generate a signature based on an input, wherein the input sequence is the generated signature.