会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Method for encoding and decoding a digital image
    • 数字图像编码和解码方法
    • US4725815A
    • 1988-02-16
    • US841483
    • 1986-03-19
    • Joan L. MitchellKaren L. AndersonGerald Goertzel
    • Joan L. MitchellKaren L. AndersonGerald Goertzel
    • G06T9/00H04N1/417H03M7/48
    • H04N1/4175G06T9/005
    • A method for encoding and decoding digital image data, includes the steps of: testing the data for a vertical relationship between adjacent lines of the image; generating directly a reference code word representative of the vertical relationship for each successful test; generating by table lookup a run code word for a stream of data bits of common value for each unsuccessful test whereby a data element representing a number of bits in a code word is stored at a predetermined offset from a table entry for the code word; merging the vertical reference code words and the run code words generated by the above steps to form an encoded data stream; testing the encoded data stream for a reference code; decoding directly the vertical relationship from the reference code for each successful test; decoding by table lookup a run of bits of common value by serial examination of said encoded data stream for each unsuccessful test; and storing data decoded by the above steps in a predetermined relationship. A fast algorithm for modifying an image in run representation form before encoding or after decoding is also described.
    • 一种用于对数字图像数据进行编码和解码的方法,包括以下步骤:测试图像的相邻行之间的垂直关系的数据; 直接生成代表每个成功测试的垂直关系的参考代码字; 通过表查找生成用于每个不成功测试的公共值数据位流的运行代码字,由此表示码字中的位数的数据元素以与代码字的表项相对应的预定偏移量被存储; 合并垂直参考码字和通过上述步骤生成的游程码字以形成编码数据流; 测试编码数据流的参考代码; 从每个成功测试的参考代码直接解码垂直关系; 通过针对每个不成功测试对所述编码数据流进行串行检查,通过表查找解码通用值的位; 并以预定关系存储通过上述步骤解码的数据。 还描述了用于在编码之前或解码之后以运行表示形式修改图像的快速算法。
    • 5. 发明授权
    • Two-dimensional image data compression and decompression system
    • 二维图像数据压缩和解压缩系统
    • UST985005I4
    • 1979-08-07
    • US951532
    • 1978-10-16
    • Gerald GoertzelJoan L. Mitchell
    • Gerald GoertzelJoan L. Mitchell
    • G06T9/00H04N1/417H04N7/32H04N11/04
    • H04N11/042H04N1/4175H04N19/93
    • a dual-mode encoding and decoding procedure enables image data to be compressed optionally in one-dimensional (1D) mode or two-dimensional (2D) mode. In 1D mode, color transitions in the image are encoded as run length features only. In 2D mode, the transitions are encoded as vertical correlation features wherever possible, and where this is not possible, the transitions are encoded as run length features. The compression achieved by run length encoding in 2D mode may be enhanced in those instances where the "history line" which precedes the current scan line contains a transition located between points that are vertically aligned with the beginning and end points of the run currently being encoded. Run length counting is suspended for those pels in the current run that could have been referenced to the history transition if the run had ended with any of these pels, thereby enabling the run to be encoded as though it contained fewer pels than its actual length. Compression may be enhanced still further by dynamically interchanging the variable-length bit patterns respectively representing certain vertical correlation and run length prefix codes depending upon whether the preceding transition was encoded as a vertical correlation feature or a run length feature.
    • 6. 发明授权
    • Symmetrical optimized adaptive data compression/transfer/decompression
system
    • 对称优化的自适应数据压缩/传递/解压缩系统
    • US4633490A
    • 1986-12-30
    • US589981
    • 1984-03-15
    • Gerald GoertzelJoan L. Mitchell
    • Gerald GoertzelJoan L. Mitchell
    • H03M7/40H04B1/66
    • H03M7/4006
    • Data compression for transfer (storage or communication) by a continuously adaptive probability decision model, closely approaches the compression entropy limit. Sender and receiver perform symmetrical compression/decompression of binary decision n according to probabilities calculated independently from the transfer sequence of 1 . . . n-1 binary decisions. Sender and receiver dynamically adapt the model probabilities, as a cumulative function of previously presented decisions, for optimal compression/decompression. Adaptive models for sender and receiver are symmetrical, to preserve data identity; transfer optimization is the intent. The source model includes a state generator and an adaptive probability generator, which dynamically modify the coding of decisions according to state, probability and bit signals, and adapt for the next decision. The system calculates probability history for all decisions, including the current decision, but uses probability history for decision n-1 (the penultimately current decision) for encoding decision n (the dynamically current decision). The system, separately at source and destination, reconfigures the compression/expansion algorithm, up to decision n-1, codes each decision in the data stream optimally, according to its own character in relation to the calculated probability history, and dynamically optimizes the current decision according to the transfer optimum of the data stream previously transferred. The receiver operates symmetrically to the sender. Sender and receiver adapt identically, and adapt to the same decision sequence, so that their dynamically reconfigured compression-expansion algorithms remain symmetrical--even though the actual algorithms may change with each decision as a function of dynamic changes in probability history.
    • 通过连续自适应概率决策模型传输(存储或通信)的数据压缩,紧密接近压缩熵限制。 发送方和接收方按照独立于1的传输顺序计算的概率,执行二进制判定n的对称压缩/解压缩。 。 。 n-1二进制决定。 发送方和接收方动态调整模型概率,作为先前提出的决策的累积函数,以获得最佳压缩/解压缩。 发送方和接收方的自适应模型是对称的,以保持数据标识; 转移优化是意图。 源模型包括状态发生器和自适应概率发生器,其根据状态,概率和位信号动态修改决策的编码,并适应下一个决策。 系统计算包括当前决策在内的所有决策的概率历史,但是对决策n(动态当前决策)的决策n-1(最终当前决策)使用概率历史。 该系统在源和目的地分别重新配置压缩/扩展算法,直到判决n-1,根据其自身的特征,根据计算出的概率历史,最佳地对数据流中的每个决策进行编码,并动态优化当前 根据以前传输的数据流的传输优化决定。 接收器对称地发送到发送器。 发送者和接收者适应相同,并且适应相同的决策序列,使得它们的动态重新配置的压缩扩展算法保持对称 - 即使实际的算法可以随着每个决策随概率历史的动态变化而变化。
    • 9. 发明授权
    • System for reproducing multi-level digital images on a bi-level printer
of fixed dot size
    • 用于在固定点大小的双层打印机上再现多级数字图像的系统
    • US4654721A
    • 1987-03-31
    • US722898
    • 1985-04-12
    • Gerald GoertzelGerhard R. Thompson
    • Gerald GoertzelGerhard R. Thompson
    • G06F3/12B41J2/52G06K15/10H04N1/40H04N1/405
    • H04N1/4052H04N1/4055
    • A system for producing improved halftone images from continuous tone input images, the pixels of which have been digitized as gray scale values, using a printer having the capability to print a set of output pel patterns producing a respective set of discrete gray scale values, is disclosed. Blocks of pel patterns with discrete gray scale values approximating the gray scale values of the input pixels are selected for printing, and the error in a first block due to the difference between the gray scale value associated with the block and the gray scale value of the corresponding input pixel, is determined. To diffuse this error it is distributed to at least two adjacent blocks using a random number generator to determine the distribution such that a random fraction of said error is distributed to one block and the remainder is distributed to the other block. This error diffusion process is carried through the adjacent blocks taking into account the error fraction already assigned. For edge enhancement the brightness gradient surrounding each input pixel is determined and a threshold value is set below which said gradient is classified as small and above which it is classified as large. When said gradient is small, the selected discrete pattern is printed for the pixel, and when said gradient is large, the pel pattern is altered and the block representing the pixel is printed biasing the pels therein toward the darker input pixels.
    • 使用具有打印产生相应的一组离散灰度值的一组输出像素图案的能力的打印机,将其像素数字化为灰度值的连续色调输入图像生成改进的半色调图像的系统是 披露 选择具有近似输入像素的灰度值的离散灰度值的像素图案块,用于打印,并且由于与块相关联的灰度值与灰度级值之间的差异而导致的第一块中的误差 确定相应的输入像素。 为了扩散该误差,使用随机数发生器将其分配给至少两个相邻块,以确定分布,使得所述误差的随机分数分布到一个块,并将剩余部分分配给另一个块。 考虑到已经分配的误差分数,该误差扩散过程通过相邻的块进行。 对于边缘增强,确定围绕每个输入像素的亮度梯度,并且设置阈值,在该阈值之下,所述梯度被分类为小并且高于该阈值被分类为较大。 当所述梯度小时,针对像素打印所选择的离散图案,并且当所述梯度大时,更改像素图案,并且打印表示像素的块,以将其中的像素偏压到较暗的输入像素。
    • 10. 发明授权
    • Asynchronous, hierarchical loop communication system with independent
local station control of access to inbound time portions without
central control
    • 异步,分层环路通信系统,具有独立的本地站控制,无需中央控制即可访问入站时间部分
    • US4028667A
    • 1977-06-07
    • US643711
    • 1975-12-22
    • Franklin Charles BreslauGerald Goertzel
    • Franklin Charles BreslauGerald Goertzel
    • H04L12/46H04J3/08G06F3/04
    • H04L12/4637
    • A CPU communicates via an indirect memory access channel (IMA) to many devices on a high speed loop and an asynchronous low speed loop. The IMA connects to a loop adaptor (LAD) which connects to the primary parallel loop. A low speed serial loop is coupled to the primary loop through a general device adaptor and another LAD. The time of the loops is broken down into frames divided into inbound and outbound halves. Each half frame carries address and control data. The address in each frame is highly variable depending upon demand by devices and the allocation of service is controlled by interrupt signals by devices on the loops which can demand service whenever an empty or free inbound frame passes by their inputs as indicated by signals known as free bit signals, which are suppressed as soon as a device seizes a free inbound frame.
    • CPU通过间接存储器访问通道(IMA)与高速环路和异步低速环路上的许多设备进行通信。 IMA连接到连接到主并行环路的环路适配器(LAD)。 低速串行环路通过一般的设备适配器和另一个LAD耦合到主回路。 循环的时间被分解成分为入站和出站两半的框架。 每半帧传送地址和控制数据。 每个帧中的地址根据设备的需求而高度可变,并且由循环中的设备的中断信号控制服务分配,每当空闲或空闲入站帧通过其输入时,可以要求服务,如被称为自由的信号所示 一旦设备占用了自由入站框架,它们就被抑制。