会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Data compressing method, data compressing apparatus, data decompressing
method and data decompressing apparatus
    • 数据压缩方法,数据压缩装置,数据解压缩方法和数据解压缩装置
    • US5801648A
    • 1998-09-01
    • US574436
    • 1995-12-15
    • Noriko SatohYoshiyuki OkadaShigeru YoshidaHironori Yahagi
    • Noriko SatohYoshiyuki OkadaShigeru YoshidaHironori Yahagi
    • H03M7/42H03M7/30H03M7/40
    • H03M7/40H03M7/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.
    • 数据压缩方法涉及使用用于登记字符串或字符串的数据字符串登记单元和上下文,以及用于在上下文之后登记字符或字符串的编码信息的代码信息登记单元,在输入之后的编码信息 数据。 数据压缩方法包括数据串新的登记步骤,当输入字符或字符串和上下文集合未在字符串注册单元中注册时,将该集合注册到数据串登记单元中。 同样的方法还包括代码信息新登记步骤,当输入字符或字符串在上下文之后的代码信息未被注册到代码信息登记单元中时,将代码信息注册到代码信息登记单元中,并且代码输出步骤 输出代码信息登记单元中登记的代码信息的代码,代码信息更新步骤更新代码信息登记单元。
    • 2. 发明授权
    • Method of and an apparatus for compressing/decompressing data
    • 用于压缩/解压缩数据的方法和装置
    • US5673042A
    • 1997-09-30
    • US405209
    • 1995-03-16
    • Shigeru YoshidaYoshiyuki OkadaYasuhiko NakanoHironori Yahagi
    • Shigeru YoshidaYoshiyuki OkadaYasuhiko NakanoHironori Yahagi
    • G06F5/00G06F17/30G06T9/00H03M7/30H03M7/46H03H7/00
    • G06F17/30985G06T9/005H03M7/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中的位置和长度的再现模式。 该方法将连续的数字分配给在原始数据模式和再现模式下准备的不同的代码。 该方法将在原始数据模式和再现模式之一下准备的任何代码与相应的一个连续数字相关联,根据代码簿对该编号进行编码,并重新排列代码簿以缩短编号的代码长度。
    • 3. 发明授权
    • Method of and apparatus for compressing and restoring data
    • 压缩和恢复数据的方法和装置
    • US06061398A
    • 2000-05-09
    • US749330
    • 1996-11-14
    • Noriko SatohYoshiyuki OkadaShigeru Yoshida
    • Noriko SatohYoshiyuki OkadaShigeru Yoshida
    • G06F5/00G06T9/00H03M7/40H04B1/66
    • H03M7/40G06T9/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通过使用与当时上下文相对应的霍夫曼代码树对每个要编码的字符进行编码。 每次对字符进行编码时,重构所使用的霍夫曼代码树,以便考虑编码字符。 数据解压缩装置分别存储对应于上下文的霍夫曼代码树,通过使用与上下文相对应的霍夫曼代码树(先前解码的字符串)对要解码的代码进行解码。 每次解码一个字符时,重构用于解码的霍夫曼码树,以便解释解码的字符。
    • 4. 发明授权
    • Image compression device, compressing method, storage medium, image decompression device, decompressing method, and storage medium
    • 图像压缩装置,压缩方法,存储介质,图像解压缩装置,解压缩方法和存储介质
    • US08045814B2
    • 2011-10-25
    • US12268057
    • 2008-11-10
    • Junichi OdagiriHironori YahagiShigeru Yoshida
    • Junichi OdagiriHironori YahagiShigeru Yoshida
    • G06K9/46
    • H04N19/90H04N19/124H04N19/126H04N19/14H04N19/182H04N19/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.
    • 一种图像压缩装置,具有预测单元,用于从外围值预测压缩对象像素的值,并且在预定量化步骤中量化预测单元的预测值与实际像素的值之间的预测误差,包括: 像素电平差分评估单元,其顺序地计算电平值之间的差值,作为与压缩目标像素之前的压缩像素和与像素相邻的外围压缩像素之间的每个压缩像素的预测值的和与预测误差的量化值 ,并评估差值的相同性; 以及量化切换单元,其在与所述特定像素级差分评估单元的评估结果不同的值连续指示相同的值时,比量化步骤更精确地控制量化步长。
    • 5. 发明申请
    • IMAGE COMPRESSION DEVICE, COMPRESSING METHOD, STORAGE MEDIUM, IMAGE DECOMPRESSION DEVICE, DECOMPRESSING METHOD, AND STORAGE MEDIUM
    • 图像压缩装置,压缩方法,存储介质,图像解码装置,解压缩方法和存储介质
    • US20090052790A1
    • 2009-02-26
    • US12268057
    • 2008-11-10
    • Junichi OdagiriHironori YahagiShigeru Yoshida
    • Junichi OdagiriHironori YahagiShigeru Yoshida
    • H04N7/26
    • H04N19/90H04N19/124H04N19/126H04N19/14H04N19/182H04N19/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.
    • 一种图像压缩装置,具有预测单元,用于从外围值预测压缩对象像素的值,并且在预定量化步骤中量化预测单元的预测值与实际像素的值之间的预测误差,包括: 像素电平差分评估单元,其顺序地计算电平值之间的差值,作为与压缩目标像素之前的压缩像素和与像素相邻的外围压缩像素之间的每个压缩像素的预测值的和与预测误差的量化值 ,并评估差值的相同性; 以及量化切换单元,其在与所述特定像素级差分评估单元的评估结果不同的值连续指示相同的值时,比量化步骤更精确地控制量化步长。
    • 8. 发明授权
    • Method and apparatus for compressing data string
    • 压缩数据串的方法和装置
    • US06563956B1
    • 2003-05-13
    • US09348163
    • 1999-07-07
    • Noriko SatohShigeru Yoshida
    • Noriko SatohShigeru Yoshida
    • G06K936
    • 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.
    • 本发明提供一种数据压缩方法,其中将要压缩的数据串的多个连续字符设置为要搜索的字符串。 代表所设置的字符串的位串的位被分配给至少两个码字。 因此,生成第一和第二搜索码字。 这些第一和第二码字被用作阵列地址。 准备第一和第二阵列表,其中预先输入关于所设置的字符串的过去出现位置的信息作为其内容。 当从要压缩的字符串生成第一和第二码字时,通过使用这些码字作为阵列的地址来查找第一和第二阵列表。 当查找这些表的结果相互匹配时,发现设置的字符串在过去发生。 因此,根据获得的阵列内容获得关于所设置的字符串的过去发生位置信息的信息。 然后,对该信息进行编码,进行数据压缩。 因此,在不降低搜索速度的情况下,获得表的所需内存量大大降低,同时获得所设置的字符串的过去发生位置的信息。
    • 9. 发明授权
    • Method and apparatus for compressing data string
    • 压缩数据串的方法和装置
    • US06876774B2
    • 2005-04-05
    • US10230236
    • 2002-08-29
    • Noriko SatohShigeru Yoshida
    • Noriko SatohShigeru Yoshida
    • G06F5/00G06K9/36G06K9/72H03M7/30H03M7/38H03M7/40
    • 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.
    • 本发明提供一种数据压缩方法,其中将要压缩的数据串的多个连续字符设置为要搜索的字符串。 代表所设置的字符串的位串的位被分配给至少两个码字。 因此,生成第一和第二搜索码字。 这些第一和第二码字被用作阵列地址。 准备第一和第二阵列表,其中预先输入所设置的字符串的过去出现位置的信息作为其内容。 当从要压缩的字符串生成第一和第二码字时,通过使用这些码字作为阵列的地址来查找第一和第二阵列表。 当查找这些表的结果相互匹配时,发现设置的字符串在过去发生。 因此,根据获得的阵列内容获得关于所设置的字符串的过去发生位置信息的信息。 然后,对该信息进行编码,进行数据压缩。 因此,在不降低搜索速度的情况下,获得表的所需内存量大大降低,同时获得所设置的字符串的过去发生位置的信息。