公开(公告)号：US5801648A

公开(公告)日：1998-09-01

申请号：US574436

申请日：1995-12-15

申请人： Noriko Satoh ,  Yoshiyuki Okada ,  Shigeru Yoshida ,  Hironori Yahagi

发明人： Noriko Satoh ,  Yoshiyuki Okada ,  Shigeru Yoshida ,  Hironori Yahagi

IPC分类号： H03M7/42 ,  H03M7/30 ,  H03M7/40

CPC分类号： H03M7/40 ,  H03M7/3084

摘要： A data compressing method involves the use of a data string registering unit for registering a charactor or charactor string and the context and a code information registering unit for registering coding information of the character or character string following the context, the coding information following previous a input data. The data compressing method includes a data string new registering step of, when the input character or character string and the context set is not registering in the string registering unit, register the set in the data string registering unit. The same method also includes a code information new registering step of, when the input character or character string's code information following the context is not registering in the code information registering unit, register the code information in the code information registering unit and a code outputting step of outputting the code following the code information registered in the code information registering unit and a code information updating step of updating the code information registering unit.

摘要翻译： 数据压缩方法涉及使用用于登记字符串或字符串的数据字符串登记单元和上下文，以及用于在上下文之后登记字符或字符串的编码信息的代码信息登记单元，在输入之后的编码信息 数据。 数据压缩方法包括数据串新的登记步骤，当输入字符或字符串和上下文集合未在字符串注册单元中注册时，将该集合注册到数据串登记单元中。 同样的方法还包括代码信息新登记步骤，当输入字符或字符串在上下文之后的代码信息未被注册到代码信息登记单元中时，将代码信息注册到代码信息登记单元中，并且代码输出步骤 输出代码信息登记单元中登记的代码信息的代码，代码信息更新步骤更新代码信息登记单元。

公开(公告)号：US5673042A

公开(公告)日：1997-09-30

申请号：US405209

申请日：1995-03-16

申请人： Shigeru Yoshida ,  Yoshiyuki Okada ,  Yasuhiko Nakano ,  Hironori Yahagi

发明人： Shigeru Yoshida ,  Yoshiyuki Okada ,  Yasuhiko Nakano ,  Hironori Yahagi

IPC分类号： G06F5/00 ,  G06F17/30 ,  G06T9/00 ,  H03M7/30 ,  H03M7/46 ,  H03H7/00

CPC分类号： G06F17/30985 ,  G06T9/005 ,  H03M7/3086

摘要： The present invention relates to a method of and an apparatus for compressing/decompressing data, to improve the compression ratio of sliding-dictionary-type Ziv-Lempel codes. A sliding-dictionary-type data compression method finds a matching character string in a coding character string and in a coded character string stored in a dictionary 101. According to the length of the matching character string, the method chooses a raw data mode that codes the matching character string that must consist of a single character as it is, or a reproduction mode that codes the position and length in the dictionary 101 of the matching character string. The method allocates consecutive numbers to different codes to be prepared under the raw data mode and reproduction mode. The method relates any code prepared under one of the raw data mode and reproduction mode to a corresponding one of the consecutive numbers, codes the number according to a code book, and rearranges the code book to shorten the length of the code of the number.

摘要翻译： 本发明涉及一种用于压缩/解压缩数据的方法和装置，以提高滑动词典型Ziv-Lempel码的压缩率。 滑动字典型数据压缩方法在编码字符串和字典101中存储的编码字符串中找到匹配的字符串。根据匹配字符串的长度，该方法选择编码的原始数据模式 必须由单个字符组成的匹配字符串，或者编码匹配字符串的字典101中的位置和长度的再现模式。 该方法将连续的数字分配给在原始数据模式和再现模式下准备的不同的代码。 该方法将在原始数据模式和再现模式之一下准备的任何代码与相应的一个连续数字相关联，根据代码簿对该编号进行编码，并重新排列代码簿以缩短编号的代码长度。

公开(公告)号：US06061398A

公开(公告)日：2000-05-09

申请号：US749330

申请日：1996-11-14

申请人： Noriko Satoh ,  Yoshiyuki Okada ,  Shigeru Yoshida

发明人： Noriko Satoh ,  Yoshiyuki Okada ,  Shigeru Yoshida

IPC分类号： G06F5/00 ,  G06T9/00 ,  H03M7/40 ,  H04B1/66

CPC分类号： H03M7/40 ,  G06T9/005

摘要： A data compression apparatus is capable of compressing data at a high compression rate and at a high speed. A data decompression apparatus is used in combination with this data compression apparatus to decode the compressed data. The data compression apparatus includes a RAM which stores Huffman code trees each of which corresponds to a character string, i.e. "context." A CPU encodes each character which is to be encoded by use of a Huffman code tree corresponding to the context at that time. Each time a character is encoded, the Huffman code tree used is reconstructed so as to account for the encoded character. The data decompression apparatus stores Huffman code trees corresponding to contexts respectively, decodes the code to be decoded by use of a Huffman code tree corresponding to the context (a character string previously decoded). Each time one character is decoded, the Huffman code tree used for decoding is reconstructed so as to account for the decoded character.

摘要翻译： 数据压缩装置能够以高压缩率和高速压缩数据。 数据解压缩装置与该数据压缩装置组合使用以对压缩数据进行解码。 该数据压缩装置包括一个RAM，它存储每一个对应于一个字符串的霍夫曼代码树，即“上下文”。 CPU通过使用与当时上下文相对应的霍夫曼代码树对每个要编码的字符进行编码。 每次对字符进行编码时，重构所使用的霍夫曼代码树，以便考虑编码字符。 数据解压缩装置分别存储对应于上下文的霍夫曼代码树，通过使用与上下文相对应的霍夫曼代码树（先前解码的字符串）对要解码的代码进行解码。 每次解码一个字符时，重构用于解码的霍夫曼码树，以便解释解码的字符。

公开(公告)号：US08045814B2

公开(公告)日：2011-10-25

申请号：US12268057

申请日：2008-11-10

申请人： Junichi Odagiri ,  Hironori Yahagi ,  Shigeru Yoshida

发明人： Junichi Odagiri ,  Hironori Yahagi ,  Shigeru Yoshida

IPC分类号： G06K9/46

CPC分类号： H04N19/90 ,  H04N19/124 ,  H04N19/126 ,  H04N19/14 ,  H04N19/182 ,  H04N19/50

摘要： An image compression device having a prediction unit for predicting a value of a compressing target pixel from peripheral values, and quantizing prediction error between a prediction value of the prediction unit and a value of an actual pixel in a predetermined quantizing step, comprising: a specific pixel level difference evaluation unit sequentially calculating the difference value between the level values as a sum of the prediction values corresponding to each of the compressed pixel immediately before the compressing target pixel and peripheral compressed pixels adjacent to the pixel and the quantization value of the prediction error, and evaluating the sameness of the difference value; and a quantization switching unit controlling the quantization in the quantizing step more precise than the quantizing step used when the difference value continuously indicates the same value as a result of the evaluation by the specific pixel level difference evaluation unit.

摘要翻译： 一种图像压缩装置，具有预测单元，用于从外围值预测压缩对象像素的值，并且在预定量化步骤中量化预测单元的预测值与实际像素的值之间的预测误差，包括： 像素电平差分评估单元，其顺序地计算电平值之间的差值，作为与压缩目标像素之前的压缩像素和与像素相邻的外围压缩像素之间的每个压缩像素的预测值的和与预测误差的量化值 ，并评估差值的相同性; 以及量化切换单元，其在与所述特定像素级差分评估单元的评估结果不同的值连续指示相同的值时，比量化步骤更精确地控制量化步长。

公开(公告)号：US20090052790A1

公开(公告)日：2009-02-26

申请号：US12268057

申请日：2008-11-10

申请人： Junichi Odagiri ,  Hironori Yahagi ,  Shigeru Yoshida

发明人： Junichi Odagiri ,  Hironori Yahagi ,  Shigeru Yoshida

IPC分类号： H04N7/26

CPC分类号： H04N19/90 ,  H04N19/124 ,  H04N19/126 ,  H04N19/14 ,  H04N19/182 ,  H04N19/50

摘要： An image compression device having a prediction unit for predicting a value of a compressing target pixel from peripheral values, and quantizing prediction error between a prediction value of the prediction unit and a value of an actual pixel in a predetermined quantizing step, comprising: a specific pixel level difference evaluation unit sequentially calculating the difference value between the level values as a sum of the prediction values corresponding to each of the compressed pixel immediately before the compressing target pixel and peripheral compressed pixels adjacent to the pixel and the quantization value of the prediction error, and evaluating the sameness of the difference value; and a quantization switching unit controlling the quantization in the quantizing step more precise than the quantizing step used when the difference value continuously indicates the same value as a result of the evaluation by the specific pixel level difference evaluation unit.

摘要翻译： 一种图像压缩装置，具有预测单元，用于从外围值预测压缩对象像素的值，并且在预定量化步骤中量化预测单元的预测值与实际像素的值之间的预测误差，包括： 像素电平差分评估单元，其顺序地计算电平值之间的差值，作为与压缩目标像素之前的压缩像素和与像素相邻的外围压缩像素之间的每个压缩像素的预测值的和与预测误差的量化值 ，并评估差值的相同性; 以及量化切换单元，其在与所述特定像素级差分评估单元的评估结果不同的值连续指示相同的值时，比量化步骤更精确地控制量化步长。

公开(公告)号：US20090052530A1

公开(公告)日：2009-02-26

申请号：US12267975

申请日：2008-11-10

申请人： Junichi Odagiri ,  Hironori Yahagi ,  Shigeru Yoshida

发明人： Junichi Odagiri ,  Hironori Yahagi ,  Shigeru Yoshida

IPC分类号： H04N7/12

CPC分类号： H04N19/436 ,  H04N19/105 ,  H04N19/11 ,  H04N19/14 ,  H04N19/16 ,  H04N19/182 ,  H04N19/593

摘要： A quantizer quantizes a “prediction error” as a difference value between a pixel X to be compressed and a prediction value X′. A variable-length encoder inputs a quantization number obtained from a quantization table of the quantizer, and outputs a variable-length code (compressed code). A prediction value candidate calculation module calculates candidates 1 through k for a prediction value on the basis of peripheral pixels A, C, and B, and transmits them to a multiplexer (MPX). A prediction value determination module determines a prediction value among the candidates 1 through k for a prediction value on the basis of an intermediate value correspondence table and an intermediate value—image format correspondence table depending on an image format, and transmits a control signal to the multiplexer (MPX). The multiplexer (MPX) outputs one of the candidates 1 through k for a prediction value as a prediction value X′.

摘要翻译： 量化器将“预测误差”量化为要压缩的像素X与预测值X'之间的差值。 可变长度编码器输入从量化器的量化表获得的量化数，并输出可变长度码（压缩码）。 预测值候补计算模块基于周边像素A，C和B计算候选1至k的预测值，并将其发送到多路复用器（MPX）。 预测值确定模块根据中间值对应表和取决于图像格式的中间值图像格式对应表来确定候选1至k中的预测值，并将控制信号发送到 多路复用器（MPX）。 复用器（MPX）将候选1到k之一作为预测值输出作为预测值X'。

公开(公告)号：US08311107B2

公开(公告)日：2012-11-13

申请号：US12267975

申请日：2008-11-10

申请人： Junichi Odagiri ,  Hironori Yahagi ,  Shigeru Yoshida

发明人： Junichi Odagiri ,  Hironori Yahagi ,  Shigeru Yoshida

IPC分类号： H04N7/12

CPC分类号： H04N19/436 ,  H04N19/105 ,  H04N19/11 ,  H04N19/14 ,  H04N19/16 ,  H04N19/182 ,  H04N19/593

摘要： A quantizer quantizes a “prediction error” as a difference value between a pixel X to be compressed and a prediction value X′. A variable-length encoder inputs a quantization number obtained from a quantization table of the quantizer, and outputs a variable-length code (compressed code). A prediction value candidate calculation module calculates candidates 1 through k for a prediction value on the basis of peripheral pixels A, C, and B, and transmits them to a multiplexer (MPX). A prediction value determination module determines a prediction value among the candidates 1 through k for a prediction value on the basis of an intermediate value correspondence table and an intermediate value—image format correspondence table depending on an image format, and transmits a control signal to the multiplexer (MPX). The multiplexer (MPX) outputs one of the candidates 1 through k for a prediction value as a prediction value X′.

摘要翻译： 量化器将预测误差量化为要压缩的像素X与预测值X'之间的差值。 可变长度编码器输入从量化器的量化表获得的量化数，并输出可变长度码（压缩码）。 预测值候补计算模块基于周边像素A，C和B计算候选1至k的预测值，并将其发送到多路复用器（MPX）。 预测值确定模块根据中间值对应表和取决于图像格式的中间值图像格式对应表来确定候选1至k中的预测值，并将控制信号发送到 多路复用器（MPX）。 复用器（MPX）将候选1到k之一作为预测值输出作为预测值X'。

公开(公告)号：US06563956B1

公开(公告)日：2003-05-13

申请号：US09348163

申请日：1999-07-07

申请人： Noriko Satoh ,  Shigeru Yoshida

发明人： Noriko Satoh ,  Shigeru Yoshida

IPC分类号： G06K936

CPC分类号： H03M7/3084

摘要： The present invention provides a data compression method in which a plurality of consecutive characters of a data string to be compressed are set as a character string to be searched for. Bits of a bit string representing the set character string are allocated to at least two codewords. Thus, first and second searching codewords are generated. These first and second codewords are used as array addresses. Fist and second array tables are prepared, in which information on the past occurrence positions of the set character string is previously entered as the contents thereof. When the first and second codewords are generated from the character string to be compressed, the first and second array tables are looked up by using these codewords as the addresses of the arrays. When results of looking up these tables match with each other, it is found that the set character string occurred in the past. Thus, information on the past occurrence position information of the set character string is obtained according to the obtained array content. Then, this information is encoded, so that data compression is performed. Thus, the amount of memory needed for the tables is significantly reduced, while information on the past occurrence position of the set character string is obtained without reducing a searching speed.

摘要翻译： 本发明提供一种数据压缩方法，其中将要压缩的数据串的多个连续字符设置为要搜索的字符串。 代表所设置的字符串的位串的位被分配给至少两个码字。 因此，生成第一和第二搜索码字。 这些第一和第二码字被用作阵列地址。 准备第一和第二阵列表，其中预先输入关于所设置的字符串的过去出现位置的信息作为其内容。 当从要压缩的字符串生成第一和第二码字时，通过使用这些码字作为阵列的地址来查找第一和第二阵列表。 当查找这些表的结果相互匹配时，发现设置的字符串在过去发生。 因此，根据获得的阵列内容获得关于所设置的字符串的过去发生位置信息的信息。 然后，对该信息进行编码，进行数据压缩。 因此，在不降低搜索速度的情况下，获得表的所需内存量大大降低，同时获得所设置的字符串的过去发生位置的信息。

公开(公告)号：US06876774B2

公开(公告)日：2005-04-05

申请号：US10230236

申请日：2002-08-29

申请人： Noriko Satoh ,  Shigeru Yoshida

发明人： Noriko Satoh ,  Shigeru Yoshida

IPC分类号： G06F5/00 ,  G06K9/36 ,  G06K9/72 ,  H03M7/30 ,  H03M7/38 ,  H03M7/40

CPC分类号： H03M7/3084

摘要： The present invention provides a data compression method in which a plurality of consecutive characters of a data string to be compressed are set as a character string to be searched for. Bits of a bit string representing the set character string are allocated to at least two codewords. Thus, first and second searching codewords are generated. These first and second codewords are used as array addresses. First and second array tables are prepared, in which information on the past occurrence positions of the set character string is previously entered as the contents thereof. When the first and second codewords are generated from the character string to be compressed, the first and second array tables are looked up by using these codewords as the addresses of the arrays. When results of looking up these tables match with each other, it is found that the set character string occurred in the past. Thus, information on the past occurrence position information of the set character string is obtained according to the obtained array content. Then, this information is encoded, so that data compression is performed. Thus, the amount of memory needed for the tables is significantly reduced, while information on the past occurrence position of the set character string is obtained without reducing a searching speed.

摘要翻译： 本发明提供一种数据压缩方法，其中将要压缩的数据串的多个连续字符设置为要搜索的字符串。 代表所设置的字符串的位串的位被分配给至少两个码字。 因此，生成第一和第二搜索码字。 这些第一和第二码字被用作阵列地址。 准备第一和第二阵列表，其中预先输入所设置的字符串的过去出现位置的信息作为其内容。 当从要压缩的字符串生成第一和第二码字时，通过使用这些码字作为阵列的地址来查找第一和第二阵列表。 当查找这些表的结果相互匹配时，发现设置的字符串在过去发生。 因此，根据获得的阵列内容获得关于所设置的字符串的过去发生位置信息的信息。 然后，对该信息进行编码，进行数据压缩。 因此，在不降低搜索速度的情况下，获得表的所需内存量大大降低，同时获得所设置的字符串的过去发生位置的信息。

公开(公告)号：US06925527B2

公开(公告)日：2005-08-02

申请号：US10294551

申请日：2002-11-15

申请人： Yoshiyuki Okada ,  Masanaga Tokuyo ,  Shigeru Yoshida ,  Hiroyuki Shimoi ,  Naoaki Okayasu

发明人： Yoshiyuki Okada ,  Masanaga Tokuyo ,  Shigeru Yoshida ,  Hiroyuki Shimoi ,  Naoaki Okayasu

IPC分类号： G06F3/06 ,  G06F12/08 ,  G11B20/10 ,  H03M7/30 ,  G06F13/00

CPC分类号： G06F3/0601 ,  G06F12/0866 ,  G06F2003/0697 ,  G06F2212/312 ,  G06F2212/401

摘要： A method of managing compressed data including a cache segment generating operation generating cache segments each representing data that is obtained by assembling plural pieces of data requested of writing, and a compressed segment generating operation generating compressed segments each representing data that is obtained by compressing each of the cache segments generated in said cache segment generating operation. The method also includes a compressed segment allocating operation allocating each of the compressed segments generated in said compressed segment generating operation to one or more compression sectors each representing a buffer having a predetermined length, and a compression sector recording operation recording each of the compression sectors, on a disk storage device, to which at least one compressed segment is allocated in said compressed segment allocating operation.

摘要翻译： 一种管理压缩数据的方法，包括：高速缓存段产生操作，产生各自表示通过组合写入请求的多个数据而获得的数据的高速缓存段;以及压缩段生成操作，生成压缩段，每个压缩段表示通过压缩每个 在所述高速缓存段生成操作中生成的高速缓存段。 该方法还包括压缩段分配操作，将在所述压缩段生成操作中生成的每个压缩段分配给一个或多个压缩扇区，每个压缩扇区表示具有预定长度的缓冲器，以及压缩扇区记录操作，记录每个压缩扇区， 在磁盘存储设备中，在所述压缩段分配操作中至少分配一个压缩段。