-
公开(公告)号：US5016009A
公开(公告)日：1991-05-14
申请号：US297152
申请日：1989-01-13
申请人： Douglas L. Whiting , Glen A. George , Glen E. Ivey
发明人： Douglas L. Whiting , Glen A. George , Glen E. Ivey
CPC分类号： H03M7/3086 , G06T9/005 , H03M7/40 , H03M7/46
摘要： An apparatus and method for converting an input data character stream into a variable length encoded data stream in a data compression system. The data compression system includes a history array means. The history array means has a plurality of entries and each entry of the history array means is for storing a portion of the input data stream. The method for converting the input data character stream includes the following steps. Performing a search in a history array means for the longest data string which matches the input data string. If the matching data string is found within the history buffer means, the next step includes encoding the longest matching data string found by appending to the encoded data stream a tag indicating the longest matching data string was found and a string substitution code. If the matching data string is not found within the history array means, the next step includes encoding the first character of the input data string by appending to the encoded data stream a raw data tag indicating that no matching data string was found and the first character of the input data string.
摘要翻译： 一种用于在数据压缩系统中将输入数据字符流转换为可变长度编码数据流的装置和方法。 数据压缩系统包括历史数组装置。 历史阵列装置具有多个条目，历史阵列装置的每个条目用于存储输入数据流的一部分。 用于转换输入数据字符流的方法包括以下步骤。 在历史数据中执行搜索意味着与输入数据串匹配的最长数据字符串。 如果在历史缓冲器装置内找到匹配数据串，则下一步包括对通过附加到编码数据流而找到的最长匹配数据串进行编码，指示找到最长匹配数据串的标签和字符串替代码。 如果在历史数组装置内没有找到匹配数据串，则下一步骤包括通过附加到编码数据流来编码表示没有匹配的数据串的原始数据标签和第一个字符来编码输入数据串的第一个字符 的输入数据串。
-
122.发明授权Process for compressing and expanding structurally associated multiple-data sequences, and arrangements for implementing the process 失效用于压缩和扩展结构相关的多数据序列的过程，以及用于实现该过程的布置
公开(公告)号：US4903018A
公开(公告)日：1990-02-20
申请号：US40772
申请日：1987-05-18
CPC分类号： H04N1/417 , G06F12/0207 , H03M7/30 , H03M7/46
摘要： A process and data processing system are disclosed for compressing and expanding structurally associated multiple data sequences. The process is particular to data sets in which an analysis is made of the structure in order to identify a characteristic common to a predetermined number of successive data elements of a data sequence. In place of data elements, a code is used which is again decoded during expansion. The common characteristic is obtained by analyzing data elements which have the same order number in a number of data sequences. During expansion, the data elements obtained by decoding the code are ordered in data series on the basis of the order number of these data elements. The data processing system for performing the processes includes a storage matrix (26) and an index storage (28) having line addresses of the storage matrix (26) in an assorted line sequence.
摘要翻译： PCT No.PCT / DE86 / 00289 Sec。 371日期1987年5月18日 102（e）日期1987年5月18日PCT提交1986年7月16日PCT公布。 出版物WO87 / 00714 日本1987年1月29日公开了一种用于压缩和扩展结构相关的多个数据序列的过程和数据处理系统。 该过程对于其中分析结构以便识别数据序列的预定数量的连续数据元素共有的特性的数据集是特别的。 代替数据元素，使用在扩展期间再次解码的代码。 通过分析在多个数据序列中具有相同次序的数据元素来获得共同特征。 在扩展期间，通过对代码进行解码而获得的数据元素根据这些数据元素的顺序数据序列进行排序。 用于执行处理的数据处理系统包括具有分类行序列中的存储矩阵（26）的行地址的存储矩阵（26）和索引存储器（28）。
-
公开(公告)号：US4799242A
公开(公告)日：1989-01-17
申请号：US88771
申请日：1987-08-24
摘要： Bit-serial compression process improved by inclusion of character-repeat (character) mode. During the compression process in a bit serial (bit) mode, using a predictive scheme with code words for each predicted bit, the characters, typically bytes (eight bits), are assembled bit by bit. Each assembled character is compared to the preceding character. When two successive identical characters occur, the process changes to the repeat-character mode wherein successive identical characters are signaled in the same manner as correctly predicted bits. When a different character occurs, the process signals in a manner corresponding to an incorrectly predicted bit. Provisions are made for limitations imposed by finite code spaces, for supplying a data bit when recording a code word associated with an exhausted code space or different characted, and for indicating an identical character has occurred when recording a code word associated with an exhausted code space.
-
公开(公告)号：US4774500A
公开(公告)日：1988-09-27
申请号：US111981
申请日：1987-10-21
申请人： Ronald D. Lichty
发明人： Ronald D. Lichty
CPC分类号： G07F7/1008 , G06Q20/341 , G06Q20/4093 , G06T9/005 , G07B17/0008 , H03M7/46 , G07B2017/00177 , G07B2017/00322 , G07B2017/00395 , G07B2017/00943
摘要： A data compaction method, for writing data in highly compact binary form in a data storage medium using a microprocessor, compresses serially occurring transaction values in a limited memory space by substituting prefix codes for previously occurring values and for commonly occurring previous values. The previous values are listed and updated on tables by the microprocessor so that they are indexed to the prefix codes adaptively to changing local values and changing common values over time. The data compaction method is particularly suitable for an account card having a limited, non-erasable memory used in an automated transaction terminal for maintaining an account record of transactions in frequently recurring amounts. A postage metering terminal is operated by the account card, in which an initial balance has been written and each purchase of postage is recorded. A current balance is recomputed by parsing the previously recorded data. If the current balance is sufficient, the requested value is recorded in compressed form in the card memory, and the terminal is operated to print or dispense the requested postage.
摘要翻译： 使用微处理器在数据存储介质中以非常紧凑的二进制形式写入数据的数据压缩方法通过用先前发生的值替换前缀码和普通的先前值来压缩有限存储器空间中的串行发生的交易值。 以前的值由微处理器在表上列出和更新，使得它们自适应地变换到前缀码，以改变本地值并随着时间改变公共值。 数据压缩方法特别适用于具有在自动交易终端中使用的有限的，不可擦除的存储器的帐户卡，用于维持经常重复的交易量的交易的账户记录。 邮资计费终端由帐户卡操作，其中已经写入初始余额并记录每次购买邮资。 通过解析先前记录的数据重新计算当前余额。 如果当前的余额足够，请求的值以压缩形式记录在卡存储器中，并且终端被操作以打印或分发所请求的邮资。
-
公开(公告)号：US4750043A
公开(公告)日：1988-06-07
申请号：US892114
申请日：1986-08-04
CPC分类号： H04N1/4175 , H03M7/46
摘要： A decoder for two-dimensionally encoded image codes such as modified READ or modified READ codes ensures fast decoding operation by outputting reference codes in parallel while serially discriminating input codes and monitoring the relationship of both codes.
摘要翻译： 用于二维编码的图像代码（诸如经修改的READ或修改的READ）码的解码器通过并行地输出参考码来确保快速解码操作，同时串行地区分输入码并监视两个码的关系。
-
公开(公告)号：US4673987A
公开(公告)日：1987-06-16
申请号：US725970
申请日：1985-04-22
申请人： Kazuhara Toyokawa
发明人： Kazuhara Toyokawa
CPC分类号： H04N19/93
摘要： A coding process for a facsimile transmission system employs block coding and dither matrices of black and white picture elements, wherein each matrix represents a portion of a subject. The subject is scanned to provide gray-scale tone-level data, and the data of continuous tone regions of the subject is represented by standardized patterns in matrix form. A run of identical patterns is counted in the scanning direction and a symbol indicating the number of such repetitions is placed in the code in lieu of the succession of code words representing individual ones of the repeating patterns. A second symbol is inserted into the code to indicate a succession of runs of repeating patterns in the same column now positioned in two or more rows. The second symbol is utilized in lieu of a repetition of code words corresponding to each of the repeated patterns. The two symbols provide for two dimensional compression of the length of the message for improved efficiency of transmission of pictorial data between the subject and a display of an image of the subject.
摘要翻译： 用于传真传输系统的编码过程采用黑白图像元素的块编码和抖动矩阵，其中每个矩阵表示被摄体的一部分。 扫描被摄体以提供灰度级的音量数据，并且以矩阵形式的标准化图案表示被摄体的连续色调区域的数据。 在扫描方向上计算相同图案的运行，并且将代表这样的重复次数的符号放置在代码中，代替表示重复图案中的各个代码字的一系列代码。 第二个符号被插入到代码中，以指示现在位于两行或更多行中的同一列中重复模式的连续运行。 第二符号用于代替与每个重复模式相对应的码字的重复。 两个符号提供消息长度的二维压缩，以提高被摄体与被摄体的图像的显示之间的图形数据的传输效率。
-
公开(公告)号：US4673977A
公开(公告)日：1987-06-16
申请号：US747094
申请日：1985-06-20
CPC分类号： H04N19/93
摘要： A method is disclosed for thresholding the luminance component of color picture elements (pels) prior to compression. The method is most effective when used with discrete color images, such as documents having areas of nominally constant color. The method uses spatial information rather than histogram information to threshold the image data. Each scan line is defined as having a series of pel runs. A pel is considered to be in a run if its luminance is within a certain range of an average luminance based on preceding pels. Each run may end in a transition region wherein the luminance of each pel differs from the luminance of the preceding pel by more than a predetermined amount. Where a transition region is found, a local threshold is set based on the average luminance of the preceding run and of the following pel. All pels in the transition region are assigned a luminance value equal either to the average luminance of the preceding run or the actual luminance of the following pel.
摘要翻译： 公开了一种用于在压缩之前阈值化彩色像素（像素）的亮度分量的方法。 当与离散彩色图像一起使用时，该方法是最有效的，例如具有名义上恒定颜色区域的文档。 该方法使用空间信息而不是直方图信息来阈值图像数据。 每个扫描线被定义为具有一系列像素运行。 如果像素的亮度在基于先前像素的平均亮度的一定范围内，则像素被认为处于运行状态。 每个运行可以在过渡区域中结束，其中每个像素的亮度与先前像素的亮度不同超过预定量。 在找到过渡区域的情况下，基于先前运行的平均亮度和随后的像素设置局部阈值。 向过渡区域中的所有像素分配亮度值，该亮度值等于先前运行的平均亮度或与以下像素的实际亮度相等。
-
128.发明授权Method for converting a bit map of an image to a run length or run end representation 失效将图像的位图转换为游程长度或运行结束表示的方法
公开(公告)号：US4610027A
公开(公告)日：1986-09-02
申请号：US567218
申请日：1983-12-30
摘要： A method for converting an image from a bit map to a run end or run length representation includes the steps of: storing said image as a bit map representation; initializing all variables to be used in the conversion process; converting by table lookup, each run of continuous color to a run representation, storing, in a run representation buffer, as a count value, each run representation; repeating the steps of converting and storing for each run of continuous color to the end of the image.
摘要翻译： 用于将图像从位图转换成游程结束或游程长度表示的方法包括以下步骤：将所述图像存储为位图表示; 初始化转换过程中要使用的所有变量; 通过表查找转换，将连续颜色的每个运行到运行表示，在运行表示缓冲器中存储作为计数值，每个运行表示; 重复将连续颜色的每次运行转换和存储到图像的末尾的步骤。
-
公开(公告)号：US4558302A
公开(公告)日：1985-12-10
申请号：US505638
申请日：1983-06-20
申请人： Terry A. Welch
发明人： Terry A. Welch
CPC分类号： G06T9/005 , H03M7/3088
摘要： A data compressor compresses an input stream of data character signals by storing in a string table strings of data character signals encountered in the input stream. The compressor searches the input stream to determine the longest match to a stored string. Each stored string comprises a prefix string and an extension character where the extension character is the last character in the string and the prefix string comprises all but the extension character. Each string has a code signal associated therewith and a string is stored in the string table by, at least implicitly, storing the code signal for the string, the code signal for the string prefix and the extension character. When the longest match between the input data character stream and the stored strings is determined, the code signal for the longest match is transmitted as the compressed code signal for the encountered string of characters and an extension string is stored in the string table. The prefix of the extended string is the longest match and the extension character of the extended string is the next input data character signal following the longest match. Searching through the string table and entering extended strings therein is effected by a limited search hashing procedure. Decompression is effected by a decompressor that receives the compressed code signals and generates a string table similar to that constructed by the compressor to effect lookup of received code signals so as to recover the data character signals comprising a stored string. The decompressor string table is updated by storing a string having a prefix in accordance with a prior received code signal and an extension character in accordance with the first character of the currently recovered string.
摘要翻译： 数据压缩器通过在字符串表中存储输入流中遇到的数据字符信号的字符串来压缩数据字符信号的输入流。 压缩器搜索输入流以确定与存储的字符串最长的匹配。 每个存储的字符串包括前缀字符串和扩展字符，其中扩展字符是字符串中的最后一个字符，并且前缀字符串包括除扩展字符之外的所有字符。 每个字符串具有与之相关联的代码信号，并且至少隐含地存储字符串的代码信号，字符串前缀和扩展字符的代码信号，将字符串存储在字符串表中。 当确定输入数据字符流和存储字符串之间的最长匹配时，最长匹配的代码信号作为遇到的字符串的压缩代码信号被发送，并且扩展字符串被存储在字符串表中。 扩展字符串的前缀是最长的匹配，扩展字符串的扩展字符是最长匹配之后的下一个输入数据字符信号。 搜索字符串表并在其中输入扩展字符串是通过有限的搜索散列过程实现的。 解压缩由接收压缩代码信号的解压缩器实现，并且生成类似于由压缩器构造的字符串表以实现对接收的代码信号的查找，以便恢复包括存储的串的数据字符信号。 通过根据当前恢复的字符串的第一个字符存储根据先前接收到的代码信号和扩展字符的具有前缀的字符串来更新解压缩器字符串表。
-
公开(公告)号：US4542413A
公开(公告)日：1985-09-17
申请号：US524817
申请日：1983-08-19
申请人： Krishna Rallapalli , Shinkyo Kaku
发明人： Krishna Rallapalli , Shinkyo Kaku
摘要： A high speed facsimile device suitable for integration using present day VLSI technology, for encoding binarily digitized picture information into run length codes. The device receives consecutive blocks of digitized picture data. In the device a run length generator unit, which is responsive to these consecutive blocks of picture data, generates the run lengths of color units in a data block. A combining unit coupled to the run length generator unit combines the run lengths of color units in more than one data block and an encoding unit coupled to the run length generator block and the combining unit generates in a pre-determined code, such as the recommended CCITT T.4 standard, the coded run lengths of color units independent of the data blocks.
摘要翻译： 适用于使用当今VLSI技术进行集成的高速传真设备，用于将二进制数字化的图像信息编码为游程长度代码。 设备接收连续的数字化图像数据块。 在设备中，响应于这些连续的图像数据块的游程长度生成器单元生成数据块中的颜色单元的游程长度。 耦合到游程长度发生器单元的组合单元组合多于一个数据块中的颜色单元的游程长度和耦合到游程长度生成器块的编码单元，并且组合单元以预定的代码生成，例如推荐的 CCITT T.4标准，独立于数据块的颜色单位的编码运行长度。
-
-
-
-
-
-
-
-
-
搜索结果
721 条记录 (耗时 0.026 秒)
