会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明授权
    • Method and apparatus for delta row decompression
    • 三角洲排减压方法和装置
    • US5452405A
    • 1995-09-19
    • US9490
    • 1993-01-25
    • Gary L. Vondran, Jr.
    • Gary L. Vondran, Jr.
    • B41J2/44G06F3/12G06F5/00G06K15/12H03M3/04H03M7/30H04N1/417
    • G06K15/12H03M7/3066G06K2215/0011G06K2215/0014
    • A hardware implementation of a method of decompressing delta row compressed data to uncompressed data having line buffer memory 70 with incrementally advanceable current address 72. Offset counter 78 is used to determine the number of repeating bytes of data stored in line buffer memory 70 for a first row are to be reused in a second row, and replacement counter 76 is used to store the number of sequential replacement data bytes. A RAM controller state machine 84 reads data bytes from line buffer memory 70 to a laser printer engine, and after reading, checks through decompression state machine 82 to determine if a replacement data byte is called for at the current address in the next row of data, writing it in if called for, otherwise, merely incrementally advancing to the next current address in the line buffer memory.
    • 将增量行压缩数据解压缩到具有递增可推进当前地址72的行缓冲存储器70的未压缩数据的方法的硬件实现。偏移计数器78用于确定存储在行缓冲存储器70中的第一数据的重复字节数 行将被重新用于第二行,并且替换计数器76用于存储顺序替换数据字节的数量。 RAM控制器状态机84将数据字节从行缓冲存储器70读取到激光打印机引擎,并且在读取之后,通过解压缩状态机82检查以确定在下一行数据中的当前地址是否调用替换数据字节 ,如果被调用,则将其写入,否则仅仅递增地前进到行缓冲存储器中的下一个当前地址。
    • 5. 发明授权
    • Common non-symmetric pruned radial and non-symmetric pruned tetrahedral
interpolation hardware implementation
    • US6040926A
    • 2000-03-21
    • US989998
    • 1997-12-12
    • Gary L. Vondran, Jr.
    • Gary L. Vondran, Jr.
    • G06T5/00G06T3/40G03F3/08B41B15/00H04N1/46
    • G06T3/4007
    • New interpolation techniques allow improved efficiency and speed in performing color space conversions. A radial interpolation technique accomplishes an interpolation by generating successive sub-cubes. A value of a vertex of the final sub-cube generated is used as the result of the interpolation. Subcubes are generated by averaging a selected vertex value with the vertex values of each of the remaining vertices. A pruned radial interpolation technique employs a subset of the vertex values of the initially selected cube to generate the result of the interpolation, thereby improving upon the efficiency of the radial interpolation. A tetrahedral interpolation technique accomplishes an interpolation by generating successive subcubes. A value of a vertex of the final sub-cube generated is used as the result of the interpolation. Subcubes are generated by applying a mathematical relationship which allows computation of sub-cube vertex values through a series of logical AND, logical OR and averaging operations. A pruned tetrahedral interpolation technique employs a subset of the vertex values of the initially selected cube to generate the result of the interpolation, thereby improving upon the efficiency of the tetrahedral interpolation. A common hardware implementation of pruned radial interpolation and pruned tetrahedral interpolation uses the common hardware structure of the two techniques with multiplexing of the input vertex values to allow performance of either a pruned radial interpolation or a pruned tetrahedral interpolation. Non-symmetric pruned radial and Non-symmetric pruned tetrahedral interpolation permit interpolation using interpolation data values distributed throughout the color space with a resolution that varies according to characteristics of the color space. Multiplexing of the interpolation data values to the non-symmetric pruned radial interpolation hardware and to the non-symmetric pruned tetrahedral interpolation hardware allows for a common hardware implementation.
    • 6. 发明授权
    • Common pruned radial and pruned tetrahedral interpolation hardware
implementation
    • US6028683A
    • 2000-02-22
    • US990016
    • 1997-12-12
    • Gary L. Vondran, Jr.
    • Gary L. Vondran, Jr.
    • G06T5/00G06T3/40H04N1/60G03F3/08B41B15/00H04N1/46
    • G06T3/4007H04N1/6016
    • New interpolation techniques allow improved efficiency and speed in performing color space conversions. A radial interpolation technique accomplishes an interpolation by generating successive sub-cubes. A value of a vertex of the final sub-cube generated is used as the result of the interpolation. Sub-cubes are generated by averaging a selected vertex value with the vertex values of each of the remaining vertices. A pruned radial interpolation technique employs a subset of the vertex values of the initially selected cube to generate the result of the interpolation, thereby improving upon the efficiency of the radial interpolation. A tetrahedral interpolation technique accomplishes an interpolation by generating successive sub-cubes. A value of a vertex of the final sub-cube generated is used as the result of the interpolation. Sub-cubes are generated by applying a mathematical relationship which allows computation of sub-cube vertex values through a series of logical AND, logical OR and averaging operations. A pruned tetrahedral interpolation technique employs a subset of the vertex values of the initially selected cube to generate the result of the interpolation, thereby improving upon the efficiency of the tetrahedral interpolation. A common hardware implementation of pruned radial interpolation and pruned tetrahedral interpolation uses the common hardware structure of the two techniques with multiplexing of the input vertex values to allow performance of either a pruned radial interpolation or a pruned tetrahedral interpolation. Non-symmetric pruned radial and Non-symmetric pruned tetrahedral interpolation permit interpolation using interpolation data values distributed throughout the color space with a resolution that varies according to characteristics of the color space. Multiplexing of the interpolation data values to the non-symmetric pruned radial interpolation hardware and to the non-symmetric pruned tetrahedral interpolation hardware allows for a common hardware implementation.
    • 8. 发明授权
    • Radial and pruned radial interpolation
    • US6040925A
    • 2000-03-21
    • US989929
    • 1997-12-12
    • Gary L. Vondran, Jr.Giuseppe Desoli
    • Gary L. Vondran, Jr.Giuseppe Desoli
    • G06T3/40H04N1/60G03F3/08B41B15/00H04N1/46
    • G06T3/4007H04N1/6019
    • New interpolation techniques allow improved efficiency and speed in performing color space conversions. A radial interpolation technique accomplishes an interpolation by generating successive sub-cubes. A value of a vertex of the final sub-cube generated is used as the result of the interpolation. Sub-cubes are generated by averaging a selected vertex value with the vertex values of each of the remaining vertices. A pruned radial interpolation technique employs a subset of the vertex values of the initially selected cube to generate the result of the interpolation, thereby improving upon the efficiency of the radial interpolation. A tetrahedral interpolation technique accomplishes an interpolation by generating successive sub-cubes. A value of a vertex of the final sub-cube generated is used as the result of the interpolation. Sub-cubes are generated by applying a mathematical relationship which allows computation of sub-cube vertex values through a series of logical AND, logical OR and averaging operations. A pruned tetrahedral interpolation technique employs a subset of the vertex values of the initially selected cube to generate the result of the interpolation, thereby improving upon the efficiency of the tetrahedral interpolation. A common hardware implementation of pruned radial interpolation and pruned tetrahedral interpolation uses the common hardware structure of the two techniques with multiplexing of the input vertex values to allow performance of either a pruned radial interpolation or a pruned tetrahedral interpolation. Non-symmetric pruned radial and Non-symmetric pruned tetrahedral interpolation permit interpolation using interpolation data values distributed throughout the color space with a resolution that varies according to characteristics of the color space. Multiplexing of the interpolation data values to the non-symmetric pruned radial interpolation hardware and to the non-symmetric pruned tetrahedral interpolation hardware allows for a common hardware implementation.
    • 9. 发明授权
    • Tetrahedral and pruned tetrahedral interpolation
    • US06031642A
    • 2000-02-29
    • US989961
    • 1997-12-12
    • Gary L. Vondran, Jr.
    • Gary L. Vondran, Jr.
    • G06T3/40G03F3/08B41B15/00H04N1/46
    • G06T3/4007
    • New interpolation techniques allow improved efficiency and speed in performing color space conversions. A radial interpolation technique accomplishes an interpolation by generating successive subcubes. A value of a vertex of the final subcube generated is used as the result of the interpolation. Subcubes are generated by averaging a selected vertex value with the vertex values of each of the remaining vertices. A pruned radial interpolation technique employs a subset of the vertex values of the initially selected cube to generate the result of the interpolation, thereby improving upon the efficiency of the radial interpolation. A tetrahedral interpolation technique accomplishes an interpolation by generating successive subcubes. A value of a vertex of the final subcube generated is used as the result of the interpolation. Subcubes are generated by applying a mathematical relationship which allows computation of subcube vertex values through a series of logical AND, logical OR and averaging operations. A pruned tetrahedral interpolation technique employs a subset of the vertex values of the initially selected cube to generate the result of the interpolation, thereby improving upon the efficiency of the tetrahedral interpolation. A common hardware implementation of pruned radial interpolation and pruned tetrahedral interpolation uses the common hardware structure of the two techniques with multiplexing of the input vertex values to allow performance of either a pruned radial interpolation or a pruned tetrahedral interpolation. Non-symmetric pruned radial and Non-symmetric pruned tetrahedral interpolation permit interpolation using interpolation data values distributed throughout the color space with a resolution that varies according to characteristics of the color space. Multiplexing of the interpolation data values to the non-symmetric pruned radial interpolation hardware and to the non-symmetric pruned tetrahedral interpolation hardware allows for a common hardware implementation.
    • 10. 发明授权
    • Non-symmetric radial and non-symmetric pruned radial interpolation
    • US5966474A
    • 1999-10-12
    • US989962
    • 1997-12-12
    • Gary L. Vondran, Jr.
    • Gary L. Vondran, Jr.
    • G06T3/40H04N1/60G05B19/04H09N1/46
    • G06T3/4007H04N1/6019
    • New interpolation techniques allow improved efficiency and speed in performing color space conversions. A radial interpolation technique accomplishes an interpolation by generating successive subcubes. A value of a vertex of the final subcube generated is used as the result of the interpolation. Subcubes are generated by averaging a selected vertex value with the vertex values of each of the remaining vertices. A pruned radial interpolation technique employs a subset of the vertex values of the initially selected cube to generate the result of the interpolation, thereby improving upon the efficiency of the radial interpolation. A tetrahedral interpolation technique accomplishes an interpolation by generating successive subcubes. A value of a vertex of the final subcube generated is used as the result of the interpolation. Subcubes are generated by applying a mathmatical relationship which allows computation of subcube vertex values through a series of logical AND, logical OR and averaging operations. A pruned tetrahedral interpolation technique employs a subset of the vertex values of the initially selected cube to generate the result of the interpolation, thereby improving upon the efficiency of the tetrahedral interpolation. A common hardware implementation of pruned radial interpolation and pruned tetrahedral interpolation uses the common hardware structure of the two techniques with multiplexing of the input vertex values to allow performance of either a pruned radial interpolation or a pruned tetrahedral interpolation. Non-symmetric pruned radial and Non-symmetric pruned tetrahedral interpolation permit interpolation using interpolation data values distributed throughout the color space with a resolution that varies according to characteristics of the color space. Multiplexing of the interpolation data values to the non-symmetric pruned radial interpolation hardware and to the non-symmetric pruned tetrahedral interpolation hardware allows for a common hardware implementation.