公开(公告)号：US07365284B2

公开(公告)日：2008-04-29

申请号：US10989951

申请日：2004-11-15

申请人： Ehud D. Karnin ,  Eugene Walach

发明人： Ehud D. Karnin ,  Eugene Walach

IPC分类号： B07C5/00

CPC分类号： B07C3/00

摘要： An automated mail sorting system including a display for displaying the image of an item of mail belonging to a carrier route, and input device for associating the image with any of a plurality of stations in a walking sequence of the carrier route, and a sorter having a reader for identifying the item of the mail, the sorter for placing the item of mail in a location corresponding to the station in the walking sequence.

摘要翻译： 一种自动邮件分拣系统，包括用于显示属于载体路线的邮件的图像的显示器，以及用于将图像与载体路线的步行顺序中的多个站点中的任一个相关联的输入装置，以及分拣机， 用于识别邮件项目的读取器，用于将邮件项目放置在步行序列中对应于该站点的位置的分类器。

公开(公告)号：US08265788B2

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

申请号：US12045042

申请日：2008-03-10

申请人： Ehud D. Karnin ,  Eugene Walach

发明人： Ehud D. Karnin ,  Eugene Walach

IPC分类号： G06F17/00 ,  G06K9/00 ,  B07C5/00

CPC分类号： B07C3/00

摘要： An automated mail sorting system including a display for displaying the image of an item of mail belonging to a carrier route, and input device for associating the image with any of a plurality of stations in a walking sequence of the carrier route, and a sorter having a reader for identifying the item of mail, to sorter for placing the item of mail in a location corresponding to the station in the walking sequence.

摘要翻译： 一种自动邮件分拣系统，包括用于显示属于载体路线的邮件的图像的显示器，以及用于将图像与载体路线的步行顺序中的多个站点中的任一个相关联的输入装置，以及分拣机， 用于识别邮件项目的读取器，用于将邮件项目放置在与该站台相对应的位置的步行顺序中。

公开(公告)号：US4792954A

公开(公告)日：1988-12-20

申请号：US925433

申请日：1986-10-31

申请人： Ronald B. Arps ,  Ehud D. Karnin

发明人： Ronald B. Arps ,  Ehud D. Karnin

IPC分类号： G06F11/10 ,  H03M7/40 ,  H03M13/00 ,  G06F11/00

CPC分类号： H03M7/4006

摘要： Method and means for detecting any single errors introduced into an arithmetic data compression code string as a result of coding, transmission, or decoding through testing according to a modulo-n function, n being an odd number not equal to +1 or -1, an arithmetic compression coded data stream C'(s) genmerated by n-scaling an arithmetically recursive function that produces a non-scaled arithmetically data compressed code stream C(s) as a number in the semi-open coding range [0,1].

摘要翻译： 用于通过根据模n函数进行编码，传输或解码的结果来检测引入算术数据压缩码串的任何单个错误的方法和装置，n是不等于+1或-1的奇数， 通过对在半开放编码范围[0,1]中的数字产生未经缩放的算术数据压缩码流C的算术递归函数进行n比例缩放的算术压缩编码数据流C' 。

公开(公告)号：US5384567A

公开(公告)日：1995-01-24

申请号：US89211

申请日：1993-07-08

申请人： Martin A. Hassner ,  Ehud D. Karnin ,  Uwe Schwiegelshohn ,  Tetsuya Tamura

发明人： Martin A. Hassner ,  Ehud D. Karnin ,  Uwe Schwiegelshohn ,  Tetsuya Tamura

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

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

摘要： An apparatus and method for executing a sequential data compression algorithm that is especially suitable for use where data compression is required in a device (as distinguished from host) controller. A history buffer compresses an array of i identical horizontal slice units. Each slice unit stores j symbols to define j separate blocks in which the symbols in each slice unit are separated by exactly i symbols. Symbols in a string of i incoming symbols are compared by i comparators in parallel with symbols previously stored in the slice units to identify matching sequences of symbols. A control unit controls execution of the sequential algorithm to condition the comparators to scan symbols in parallel but in each of the blocks sequentially and cause matching sequences and nonmatching sequences of symbols to be stored in the array. The parameters i and j are selected to limit the number of comparators required to achieve a desired degree of efficiency in executing the algorithm based upon a trade-off of algorithm execution speed versus hardware cost. A priority encoder calculates from signals output by the slice units each j,i address in which a matching sequence is identified, but it outputs the address of only one (such as the smallest) of these addresses.

摘要翻译： 一种用于执行顺序数据压缩算法的装置和方法，其特别适用于在设备（与主机不同）控制器中需要数据压缩的地方。 历史缓冲区压缩i个相同水平切片单元的阵列。 每个片单元存储j个符号以定义其中每个片单元中的符号被精确地i个符号分隔的j个分离块。 i个输入符号的串中的符号被i个比较器与先前存储在片单元中的符号并行地进行比较，以识别符号的匹配序列。 控制单元控制顺序算法的执行，以使比较器平行扫描符号，但在每个块中顺序扫描符号，并使符号的匹配序列和非匹配序列存储在阵列中。 选择参数i和j以限制在基于算法执行速度与硬件成本的折衷来执行算法时实现期望的效率程度所需的比较器的数量。 优先编码器根据由片单元输出的信号计算每个j，i地址，其中标识匹配序列，但是它输出这些地址中只有一个（例如最小的）的地址。

公开(公告)号：US5608396A

公开(公告)日：1997-03-04

申请号：US395343

申请日：1995-02-28

申请人： Joe-Ming Cheng ,  David J. Craft ,  Larry J. Garibay ,  Ehud D. Karnin

发明人： Joe-Ming Cheng ,  David J. Craft ,  Larry J. Garibay ,  Ehud D. Karnin

IPC分类号： G06T9/00 ,  H03M7/30 ,  H03M7/38

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

摘要： A system for compressing digital data at one byte-per-cycle throughput by removing redundancy before storage or transmission. The system includes an improved Ziv-Lempel LZ1 process that uses a history buffer to save the most recent source string symbols for use in encoding the source symbols as "match-length" and "match-offset" tokens. The match-length code symbols are selected from two groups of buckets that are assigned variable-length prefixes for the shorter, more probable match-lengths and a fixed-length prefix code for the longer, less probable match-lengths. This exploits a transition from Laplacian match-length probability distribution to Uniform match-length probability distribution for longer match-lengths. The offset code field length is reduced during start-up to improve start-up compression efficiency during filling of the history buffer. The match-length code book is limited to a maximum value T

摘要翻译： 一种通过在存储或传输之前去除冗余来以一个字节每周期吞吐量压缩数字数据的系统。 该系统包括一个改进的Ziv-Lempel LZ1进程，该进程使用历史缓冲区来保存用于将源符号编码的最新源字符串符号作为“匹配长度”和“匹配偏移”令牌。 匹配长度代码符号从两组桶中选择，分配给可变长度前缀的更短，更可能的匹配长度以及固定长度前缀码用于更长的较少可能的匹配长度。 这利用了从拉普拉斯匹配长度概率分布到长度匹配长度的统一匹配长度概率分布的转换。 在启动期间，偏移码字段长度减小，以提高历史缓冲区填充期间的启动压缩效率。 匹配长度码本被限制在最大值T <256以限制延迟并简化处理。 几个未使用的匹配长度代码插槽被重新分配给“控制代码”，它们可以在运行时插入到压缩数据流中，而不会减慢或中断编码过程。 通过与源数据同时解码和CRC比较，可以快速验证压缩数据，允许根据需要插入纠错“控制代码”，而不会中断或减缓压缩流。

公开(公告)号：US5204756A

公开(公告)日：1993-04-20

申请号：US559734

申请日：1990-07-30

申请人： Dan S. Chevion ,  Ehud D. Karnin ,  Eugeniusz Walach

发明人： Dan S. Chevion ,  Ehud D. Karnin ,  Eugeniusz Walach

IPC分类号： G06T9/00 ,  H04N1/411

CPC分类号： H04N1/411 ,  G06T9/00

摘要： The invention relates to a method for the compression and decompression of binary test images. The method distinguishes between large low-frequency areas and small high-frequency areas in the original frame. For the low-frequency areas, a scheme for lossy compression is used, whereas for the high-frequency areas, a scheme permitting lossless compression is applied. The compression/decompression process involves five stages; namely prefiltering to remove all black patches (e.g. by removing all black pixels, except where they belong to a large black segment), fast evaluation of compressibility by partitioning the images into mutually exclusive segments and applying different compression modes to each segment, connectivity-oriented subsampling to reduce the reslolution in horizontal and vertical directions which cause the image to be segmented into blocks and a 1-pixel representation for each block is determined, lossless compression and decompression where the reduced file is compressed by conventional techniques, and reconstruction by sequence reversal so that lossless decompression will retrieve the subsampled file, expansion of the subsampled file through replacement of each pixel by a block having equal value and postfiltering.

公开(公告)号：US5142283A

公开(公告)日：1992-08-25

申请号：US555560

申请日：1990-07-19

申请人： Dan S. Chevion ,  Ehud D. Karnin ,  Eugeniusz Walach

发明人： Dan S. Chevion ,  Ehud D. Karnin ,  Eugeniusz Walach

IPC分类号： H03M7/40

CPC分类号： H03M7/4006 ,  Y10S706/90

摘要： A method for substituting interpolated values for ambiguous symbols in an arithmetically encoded symbol string, symbols in the unencoded original string being drawn from a Markov source and a finite alphabet. Ambiguity of a symbol is defined as where its symbol occurrence statistic lies outside of a predetermined range. Interpolation involves selectively combining the occurrence statistics of symbols adjacent the ambiguous symbol and recursively and arithmetically encoding the combined statistics. The method otherwise encodes unambiguous symbols in a conventional arithmetic manner. The decoding duals are also described.

公开(公告)号：US4884131A

公开(公告)日：1989-11-28

申请号：US231934

申请日：1988-08-15

申请人： Dan S. Chevion ,  Ehud D. Karnin ,  Eugeniusz Walach

发明人： Dan S. Chevion ,  Ehud D. Karnin ,  Eugeniusz Walach

IPC分类号： G06T9/00 ,  H04N13/00

CPC分类号： H04N13/0059 ,  G06T9/004 ,  H04N19/597 ,  H04N13/0239 ,  H04N13/0434

摘要： A method and apparatus for transmitting and receiving 3-dimensional video images of a scene using conventional video transmission channels. The method requires the production of two images of the scene obtained from slightly different viewing angles, the images being sampled so as to generate for each image sets of component picture elements which are then sub-sampled according to a predetermined pattern, so as to form first and second sets of signals for each image. Both sets of signals corresponding to one of the images are transmitted to enable a conventional receiver to display a 2-dimensional image. A second set of signals for the other image is predicted both at the transmitter and at a modified receiver, enabling a correction signal corresponding to the difference between the predicted and actual signals to be transmitted to the modified receiver which regenerates the actual signals and displays them together with the corresponding first set of signals of the first image.

公开(公告)号：US5182656A

公开(公告)日：1993-01-26

申请号：US559813

申请日：1990-07-30

申请人： Dan S. Chevion ,  Ehud D. Karnin ,  Eugeniusz Walach

发明人： Dan S. Chevion ,  Ehud D. Karnin ,  Eugeniusz Walach

IPC分类号： G06T9/00 ,  H04N1/411

CPC分类号： H04N1/4115

摘要： This method relates to the compression of information contained in filled-in forms (O) by separate handling of the corresponding empty forms (CP) and of the information written into them (VP). Samples of the empty forms are pre-scanned, the data obtained digitized and stored in a computer memory to create a forms library. The original, filled-in form (O) to be compressed is then scanned, the data obtained digitized and the retrieved representation of the empty form (CP) is then subtracted, the difference being the digital representation of the filled-in information (VP), which may now be compressed by conventional methods or, preferably, by an adaptive compression scheme using at least two compression ratios depending on the relative content of black pixels in the data to be compressed.

公开(公告)号：US4989000A

公开(公告)日：1991-01-29

申请号：US368473

申请日：1989-06-19

申请人： Dan S. Chevion ,  Ehud D. Karnin ,  Eugeniusz Walach

发明人： Dan S. Chevion ,  Ehud D. Karnin ,  Eugeniusz Walach

IPC分类号： H03M7/40

CPC分类号： H03M7/4006

摘要： An improved method of generating a compressed representation of a source data string, each symbol of which is taken from a finite set of m+1 symbols, a.sub.o to a.sub.m. The method is based on an arithmetic coding procedure wherein the source data string is recursively generated as successive subintervals within a predetermined interval. The width of each subinterval is theoretically equal to the width of the previous subinterval multiplied by the probability of the current symbol. The improvement derives from approximating the width of the previous subinterval so that the approximation can be achieved by a single SHIFT and ADD operation using a suitable shift register.