50 results about "Text compression" patented technology

A device (110) used for composing, compressing and transmitting messages by way of a data network (100) comprises means (116) for employing predictive text entry during composition of a message (MSG) and compressing the composed message for transmission. Increased redundancy and improved compression efficiency result from having the predictive text entry program (201) suggest character strings (207) derived from a corpus of messages (204) that serves also as a basis for a statistical model (206) used for compression. A messaging system comprising the composition device (110) and a device for receiving and decompressing the message may comprise a messaging (MSG) hub (108) for decompressing messages (MSG) from the composing device and reformatting them, for example as e-mail messages (E-MSG), before transmitting them to the addressee (112, 113, 114, 115) and, conversely, compressing messages from the addressee using a similar corpus of messages (204) before transmitting them to the composing device (110). Peer-to-peer messaging (MSG′) may be provided between two users using similar devices capable of composing, compressing and transmitting messages (110′), and received and decompressing messages (110″).

The invention discloses a screen video encoding and decoding method based on progressive character block compression and an encoding and decoding device thereof. The screen video encoding and decoding method comprises the following steps: obtaining a frame in a screen video, and dividing the frame into M*N macro blocks; dividing each macro block into character blocks or image blocks according to the category; dividing each character block into a plurality of character compression code streams according to a main color and a non-main color; encoding the main color by an index table, and progressively encoding escape colors of the non-main color based on a bit plane; dividing each image block into a plurality of image encoding quality layers by using a progressive image encoding algorithm based on wavelet transform; transmitting the code streams to a receiving terminal according to different quality grades; and decoding and displaying the code stream of each quality layer by the receiving terminal. According to the screen video encoding and decoding method disclosed by the invention, in view of the limitation and defects of traditional character encoders, the progressive character encoding technology of a plurality of quality layers is realized, no support of special equipment is needed, and the screen video encoding and decoding method is applicable to all occasions needing to compress screen images containing characters.

A text message is first parsed into its constituent semantic components such as header fields and body components. Then, different compression methods may be performed on each semantic component depending on the importance of the semantic component, the context of the semantic component, the characteristics of the semantic component, and whether or not the semantic component uses natural language expressions. For example, it is determined what compression method, if any, is to be performed on the semantic component. Each semantic component may be compressed individually. Since text compression takes the unique features of each semantic component into consideration rather than considering the text message as a monolithic text unit, a more intuitive text compression results.

Text compression and encryption is achieved by using a predetermined dictionary not unique to the encoded text to substitute codes for words and phrases thereby obviating transmission of the dictionary along with transmitted encoded text. The codes of the dictionary are made of one or more text characters such that the message, once encoded, continues to be a legitimate text message and can travel through any data transport medium through which a conventional unencoded text message can travel. Non-word characters delimit codes and unencoded words in an encoded message. Advantages include message filtering and maintaining message threads of short messages, including SMS.

The embodiment of the invention provides a file compression method, a file compression device, a file decompression method, a file decompression device, a compressed file searching method and a compressed file searching device. The file compression device comprises a first storage module, a first acquiring module, a first word segmentation module, and a first coding module, wherein the first storage module is used for storing a coding table which records the correspondence between standard character strings and coding identifiers, and each of the standard character strings has a unique coding identifier; the first acquiring module is used for acquiring a part of or all texts in a file to be compressed to form a text to be coded; the first word segmentation module is used for carrying out word segmentation to the text to be coded according to the standard character strings and decomposing the text to be coded to at least one character string to be coded; and the first coding module is used for acquiring a first coding sequence corresponding to the text to be coded by replacing the coding identifiers of the standard character strings with the corresponding at least one character string to be coded according to the correspondence between the standard character strings recorded in the coding table and the coding identifiers. The invention improves compression ratio of the text compression algorithm and convenience of the searching.

The invention is a document picture compressing method based on analysis and characteristic extraction of the content of a document picture, comprising the steps of preprocessing document picture, cutting document picture, compressing character and compressing picture; where the first step accounts the gray value of the document picture and projects to picture boundary, and according to the edge variation of a projection curve and block diagram of gray values, analyzing the content of the document picture and automatically detecting and extracting the characteristic information of the document picture, including character height, picture boundary, attached mark position, pixel gray value, etc.; the second step cuts the document picture into character and picture parts according to the preprocessed result but the color information of the document picture is not influenced; the third step makes gray transform and travel coding on the character part for compressing; the last step makes the damaging compression on the picture part based on discrete cosine transform (DCT).

The present disclosure provides methods, computer program products and apparatuses for text compression and decompression wherein a desired compression ratio may be obtained, and the compressed content per se is still in a searchable text form, thereby providing a possibility for searching without decompression and significantly saving storage space and enhancing search efficiency, and in turn, reducing the total cost ownership TCO and providing a better user experience.

The invention provides a text compression method. The method is applied in a HADOOP cluster and a plurality of machine nodes in the HADOOP cluster can use a computing framework MapReduce and execute the text compression method. The method comprises the following steps of: in a Map stage of the MapReduce, extracting sampling phrases from an original text file; in a Reduce stage of the MapReduce, setting a corresponding code for each sampling phrase, wherein a corresponding relationship between the sampling phrases and the codes can serve as a mapping function which is stored in a relationship database; after the mapping function is obtained, integrally compressing the original text file by using the mapping function so as to obtain a compressed file; after a to-be-queried phrase is received, compressing the to-be-queried phrase by using the mapping function so as to obtain a compressed phrase; and searching the compressed phrase in the compressed file. Moreover, the invention provides a text compression device.

The invention discloses an image lossless compression method and system, and belongs to the technical field of image processing. The method comprises: obtaining an original image; calculating the residual error of the original image by adopting an arithmetic coding method, counting the occurrence frequency of each symbol in the residual error, and storing the occurrence frequency into an array counts []; circularly establishing a Huffman tree according to the array counts [], and encoding each leaf node of the Huffman tree by using a length limiting method to obtain a Huffman encoding table; and compressing the residual error of the original image by using the Huffman coding table to obtain coded data for decoding processing. According to the lossless compression method integrating arithmetic coding and the general text compression method, the decoding speed of the general text method is achieved while the compression rate is guaranteed.

The invention relates to a Chinese text compression method. According to the characteristics of a Chinese text, a dictionary compression algorithm is combined with Huffman coding, word segmentation is conducted on the Chinese text, the Chinese text is segmented into a plurality of Chinese word groups, word frequencies are counted, the word groups with high word frequencies are expressed with fewer bits, and the word groups with low word frequencies are expressed with more bits, so that the Chinese text is compressed at a high compression ratio, and the capacity of a processor and memory overhead are both considered; the hardware cost is lowered accordingly.

The invention discloses a data compression algorithm based on semantic analysis. The data compression algorithm is a compression method used for language text files which are generally limited and is aimed to solve the compression problem of a C language source file text, strictness of a grammar format of C language is made use of, C language basic elements serve as basic elements of text compression, coding is carried out in a Huffman coding method, and a C language text compression method, namely a text compression method based on semantic analysis is given. As is shown in experiments, the compression ratio of the method is improved by nearly 1.5 times than that of an original Huffman text compression method.

The embodiment of the invention provides a text compression method and a text compression device, aiming at the problems of large occupied space, low transmission speed and the like in the prior art,and realizing efficient storage and transmission of mass texts by utilizing a high-frequency coding library generated by utilizing a redundant relation of information among mass text data and a big data processing technology. The method comprises the following steps: generating a category label for a source text; searching a corresponding category coding library in a high-frequency coding libraryby utilizing the category label, the high-frequency coding library being a coding library formed by coding data of a high-frequency text block, and dividing the high-frequency text block into one or more category coding libraries according to different categories to which the high-frequency text block belongs; and performing coding serialization on the source text by using the coded data in the category coding library to obtain a compressed text.

The invention discloses a document compression method. The method comprises the following steps of: acquiring a document to be compressed from a memory stack; dividing the document into blocks of different types, wherein the types of the blocks comprise pictures and texts; judging the type of each block in the document in turn; if the type of one block is the picture, compressing the block according to a picture compression algorithm; if the type of one block is the text, compressing the block according to a text compression algorithm; and merging all compressed blocks together to generate a compressed document. By using the method, different compression algorithms can be selected for compression according to the types of the different blocks in the document to be compressed.

The invention discloses a method for predicting human activity positions in a smart home environment. According to data of different human activities collected by a motion sensor mounted in a test bench in the smart home environment, the method based on a period timeliness combined with a text compression algorithm (TimeLeZi and TLZ) is proposed for predicting the positions of the human activities. The method is suitable for being applied to the technical fields of smart homes, pattern recognition and the like. According the to the method for predicting the human activity positions in the smart home environment and based on the TLZ algorithm, compared with a result obtained through an LZ78 model and an ActiveLeZi model method, the predicting result of the method has higher prediction accuracy.

The invention belongs to the technical field of generating two-dimensional code compression through data compression and encryption, and particularly relates to a method and a device for generating a two-dimensional code based on text compression and a method and a device for reading a two-dimensional code based on text compression. In allusion to a problem that an RSA encrypted anti-counterfeiting two-dimensional code is low in generation efficiency, the method provided by the invention improves the generation efficiency of the anti-counterfeiting two-dimensional code through performing compression on a ciphertext and reducing the amount of written information by using the experience of text compression for reference, and the overall performance of the system is improved. Meanwhile, a modular exponentiation operation of large numbers is required to be performed in an RSA encryption algorithm, thereby resulting in high computation complexity, and slowing down the performance of the system. Further research will be conducted on improving the computation complexity of the RSA encryption algorithm in the future.

There is provided a log collection device including: a log receiver that receives a text log from a log generation device; a dictionary generator that generates a compressed dictionary for performing text compression based on the received text log; a dictionary transmitter that transmits the generated compressed dictionary to the log generation device and instructs performing of the compression process using the compressed dictionary on the text log transmitted after the transmission of the compressed dictionary; and a decompression processor that performs a decompression process using the compressed dictionary on the text log received after transmission of the compressed dictionary.

The invention provides a text compression method applicable to texts in non-Latin languages such as Chinese and the like. The method includes the steps: screening words meeting the conditions of a predetermined word length and the occurrence frequency from a text to be compressed; allocating codes to the screened words according to the occurrence frequency of the screened words; and utilizing the allocated codes to compress the text. Correspondingly, the invention provides a text compression device. The text compression method and the text compression device have the advantages that alternative words are extracted from the text to be compressed with one word serving as a unit and are screened according to the occurrence frequency of the alternative words, and then only the words with higher occurrence frequency are kept, so that high-frequency expansion words in data of the texts in non-Latin languages such as Chinese and the like can be effectively extracted, the total number of the coded words in a dictionary is decreased, the texts in non-Latin languages such as Chinese and the like are compressed by the aid of the codes, and the high compression ratio is acquired.

The invention discloses a text compression method based on Gzip hardware, mainly solving the problem current text compression is slow in speed and not high in compression ratio. According to the method provided by the invention, a text to be compressed is read into a text compression processor without delay from two buffers in an alternative reading manner, computing units process simultaneously to compute dictionary storage address and mark effective information, dictionary information is updated by a character string to be processed after the historical character string is found in a dictionary, then matching of the character strings and trimming matching treatment are performed, Huffman coding is performed on the matched compressed text, and finally a code stream of the compressed text is acquired and output. The method provided by the invention is fast in processing speed, high in compression ratio, expandable in occupied resources, and prone to implement different scales of FPGA.

The invention discloses a text compression method, which belongs to an application of a dictionary compression algorithm. The method is based on redundancy and repeatability of texts. The method is implemented on a hardware platform by combining finite-state entropy coding on the basis of a dictionary compression algorithm. Binary file conversion is carried out on the text and dictionary compression of entries is stored by adopting a hash table; finite state entropy coding is used, information before and after compression is stored by using a number, the memory space is saved, and informationis recorded by using a decimal bit, so that the compression rate is high, the self-adaptation is strong, the requirements on the capacity of a processor and the memory overhead are low, and the cost is reduced.

A system and method for compressing files obtains a file to be compressed, divides the file into different sections. The system and method further compresses each section with an image compression algorithm or a text compression algorithm according a type of each section, and connects all compressed sections to obtain a compressed file.

A text message is first parsed into its constituent semantic components such as header fields and body components. Then, different compression methods may be performed on each semantic component depending on the importance of the semantic component, the context of the semantic component, the characteristics of the semantic component, and whether or not the semantic component uses natural language expressions. For example, it is determined what compression method, if any, is to be performed on the semantic component. Each semantic component may be compressed individually. Since text compression takes the unique features of each semantic component into consideration rather than considering the text message as a monolithic text unit, a more intuitive text compression results.

The invention discloses a Tibetan text compression algorithm, which is characterized by performing statistical analysis on Tibetan text in a 20G Tibetan webpage, establishing a mapping dictionary of aTiCA algorithm, and mapping the Tibetan text consisting of codes into a coding method to compress the Tibetan text according to the mapping dictionary. In this process, the text to be compressed needs to be scanned, the filtered Tibetan text is compressed according to an initial position interval of each section of Tibetan, each Tibetan position interval screened in the step 1 is traversed, Tibetan character strings in each interval are segmented into Tibetan characters through utilizing syllable symbols of Tibetan, and finally the Tibetan characters formed by one or more Tibetan components are mapped into codes, thereby completing compression of the Tibetan text. According to the dictionary, the Tibetan text compression algorithm TiCA provided by the invention is completed, and the robustness of the TiCA algorithm is improved. Experiments prove that an excellent effect is achieved no matter in the aspect of compression ratio or in the aspect of time consumption.

A method of transmitting communication information employing a coding scheme being defined by a character set. The characters of the character set are encoded into codewords of a sequence of bits, the codewords being of varying length. The characters are divided into at least two categories. The categories may be a first category of shifted characters and a second category of unshifted characters. Where a shifted character is encountered during encoding a shift codeword is inserted in the sequence of bits. This allows each category to use overlapping codewords. Then the sequence is converted to ASCII characters to be transmitted.

The invention relates to a high performance geography markup language (GML) multi-document stream compression information processing method, which includes the following steps that 1 an input device inputs GML multi-document data to a GML document analyzer; 2 the GML document analyzer uses simple API for XML (SAX) to analyze the multi-document data; 3 an event processing module compresses structural information in the multi-document data through a dynamic structure compression algorithm to be stored in a structural container, spatial data in the multi-document data are compressed through a spatial data incremental compression algorithm to be stored in a spatial data container, and attribute data, text value and current document information data in the multi-document data are stored in an attribute container, a text container and a document information container respectively; and 4 data in all containers are compressed through a text compression tool Gzip as a background compression tool to obtain an integrated independent compression document of the document. Compared with the prior art, the high performance GML multi-document stream compression information processing method has the advantages of being high in compression rate, short in compressing time and uncompressing time, convenient to use and the like.

The invention discloses a short message compression communication method which comprises the steps of compressing a to-be-transmitted message to short message compressed data by a short message transmitting end through a text compression algorithm; generating the CRC check bit of the short message compressed data by the short message transmitting end; transmitting the short message compressed data and the CRC check bit to a short message receiving end by the short message transmitting end; if the short message receiving end has a decompression function, performing the following steps of verifying the short message compressed data by the short message receiving end by means of the received CRC check bit; and if verification passes, decompressing the received short message compressed data by means of a decompression algorithm, and obtaining a short message content which is transmitted by the short message transmitting end. The short message compression communication method according to the invention reduces an additional cost in transmitting a long text message by a user and improves user experience. The invention further discloses a short message compression communication system.

The invention discloses image code compression and decoding methods and devices. The image code compression method comprises the steps of: identifying an image to be compressed to obtain a text imageportion; performing a preset transformation on a first type of components in the text image portion to obtain low frequency components and high frequency components corresponding to the first type ofcomponents; and coding the low frequency components and a second type of components in the text image portion through a first preset coding algorithm, and coding the high frequency components througha second preset coding algorithm to obtain an image compression code stream. The methods and the devices solve the technical problem of low code compression efficiency due to the consideration of whole block-based correlation of the text compression scheme.

The invention relates to the technical field of artificial intelligence, and provides a semantic text compression method, a semantic text compression device, computer equipment and a computer readable storage medium. The semantic text compression method comprises the following steps: performing noise recognition on a semantic text input by a user by utilizing a pre-trained noise recognition model; performing noise reduction processing on the semantic text based on the noise recognition result to obtain a to-be-compressed text; then based on the part-of-speech of each to-be-compressed segmented word in the to-be-compressed text, calling a statement compression tool to perform statement compression on the to-be-compressed text to obtain the preliminarily compressed text. Since the semantic text is firstly subjected to noise reduction processing and then subjected to statement compression, the interference of noise on the content of the preliminarily compressed text can be avoided, and finally, the preliminarily compressed text is subjected to text restoration according to a preset restoration strategy to obtain a target compressed text. The content accuracy of the target compressed text is improved while the semantic text input by the user is compressed.