专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

61. 发明授权

US06751352B1 Method and apparatus for generating and decoding a visually significant barcode 有权
标题翻译：用于生成和解码视觉上有意义的条形码的方法和装置
公开(公告)号：US06751352B1
公开(公告)日：2004-06-15
申请号：US09579070
申请日：2000-05-25
申请人： Izhak Baharav , Cormac Herley , Yihong Xu , Jonathan Yen , Timothy Harrison , Doron Shaked , Avraham Levy , Angela K. Hanson , Terry P. Mahoney
发明人： Izhak Baharav , Cormac Herley , Yihong Xu , Jonathan Yen , Timothy Harrison , Doron Shaked , Avraham Levy , Angela K. Hanson , Terry P. Mahoney
IPC分类号： G06K900
CPC分类号： G06K19/06037 , G06K1/121 , G06K19/06028
摘要： A barcode system for generating and decoding a barcode with visual significance. The barcode system of the present invention includes an encoding module for receiving a message and a logo and generating a visually significant barcode based on these inputs. A decoding module is also provided for receiving an acquired version of a visually significant barcode that may have been degraded in a typical document handling channel (e.g., through the printing, scanning, or copying process) and for recovering the message specified by the visually significant barcode.
摘要翻译：一种用于生成和解码具有视觉意义的条形码的条形码系统。本发明的条形码系统包括用于接收消息和标识的编码模块，并且基于这些输入产生视觉上有意义的条形码。还提供了一种解码模块，用于接收在典型的文档处理通道（例如，通过打印，扫描或复制过程）中已被降级的视觉有意义的条形码的获取版本，并且用于恢复由视觉上显着的条码。

62. 发明授权

US06742708B2 Fiducial mark patterns for graphical bar codes 失效
标题翻译：图形条形码的基准标记模式
公开(公告)号：US06742708B2
公开(公告)日：2004-06-01
申请号：US09877517
申请日：2001-06-07
申请人： Doron Shaked , Avi Levy , Jonathan Yen , Chit Wei Saw , Clayton Brian Atkins
发明人： Doron Shaked , Avi Levy , Jonathan Yen , Chit Wei Saw , Clayton Brian Atkins
IPC分类号： G06K710
CPC分类号： G06K19/06037
摘要： Fiducial mark patterns for graphical bar codes (i.e., images that contain inconspicuous graphical modulations that encode embedded information) that are characterized by high detection robustness and good local deformation tracking are described. In one bar coding method, a base image is modulated with a graphical encoding of a message to produce a graphical bar code, and a fiducial mark pattern comprising a plurality of dots arranged to track one or more reference locations and local deformation across the graphical bar code is generated. In another bar coding method, fiducial mark candidates are identified in a fiducial mark pattern, a fiducial mark path is computed based upon one or more of the identified fiducial mark candidates, and one or more reference locations are identified based upon the computed fiducial mark path.
摘要翻译：描述了具有高检测鲁棒性和良好的局部变形跟踪的图形条形码的基准标记图案（即，包含编码嵌入信息的不显眼图形调制的图像）。在一种条形码编码方法中，利用消息的图形编码来调制基本图像以产生图形条形码，以及包括布置成跟踪一个或多个参考位置的多个点的基准标记图案以及横跨图形条的局部变形代码生成。在另一条码编码方法中，以基准标记图案识别基准标记候选，基于所标识的基准标记候选中的一个或多个来计算基准标记路径，并且基于所计算的基准标记路径来识别一个或多个参考位置。

63. 发明授权

US6151025A Method and apparatus for complexity reduction on two-dimensional convolutions for image processing 失效
标题翻译：用于图像处理的二维卷积复杂度降低的方法和装置
公开(公告)号：US6151025A
公开(公告)日：2000-11-21
申请号：US852620
申请日：1997-05-07
申请人： Jonathan Yen , Luca Chiarabini
发明人： Jonathan Yen , Luca Chiarabini
IPC分类号： H04N1/409 , G06T3/40 , G06T5/00 , G06T5/20 , G06T3/20
CPC分类号： G06T5/20
摘要： A method and apparatus are provided for reducing the complexity of two-dimensional linear convolutions. All possible pixel patterns for a row of a pixel array are determined and multiplied by a corresponding row in a convolution kernel matrix. The partial convolution results are stored in a lookup table. In a processing step, each row of an input pixel window is compared to the possible pixel rows. Partial results associated with a matching pixel row are accessed from the lookup table. In one preferred embodiment of the invention, each row of an input pixel window is stored in a line cache. In another, equally preferred embodiment, a hash function is optionally used to derive an index value for each possible pixel row. The partial result associated with an equal index value is accessed. In another, equally preferred embodiment, double buffer stores two consecutive input pixel windows for processing. After each row of the first buffer is processed, the double buffer is shifted by one pixel. After the entire contents of the second buffer have been shifted into the first buffer, the next input pixel window is moved into the second buffer. Thus, the invention requires only one main memory access for each input pixel window. The partial convolution results are preferably calculated in floating point arithmetic and converted to a fixed point precision before they are stored as table entries.
摘要翻译：提供了一种用于降低二维线性卷积的复杂度的方法和装置。确定一行像素阵列的所有可能的像素图案并乘以卷积核心矩阵中的相应行。部分卷积结果存储在查找表中。在处理步骤中，将输入像素窗口的每一行与可能的像素行进行比较。从查找表访问与匹配像素行相关联的部分结果。在本发明的一个优选实施例中，输入像素窗口的每行被存储在行高速缓存中。在另一个，同样优选的实施例中，可选地使用散列函数来导出每个可能的像素行的索引值。访问与索引值相等的部分结果。在另一个同样优选的实施例中，双缓冲器存储用于处理的两个连续的输入像素窗口。在处理第一缓冲器的每一行之后，双缓冲器被移位一个像素。在第二缓冲器的全部内容已被移入第一缓冲器之后，下一个输入像素窗口移动到第二缓冲器中。因此，本发明对于每个输入像素窗口仅需要一个主存储器访问。部分卷积结果优选以浮点算术计算，并在作为表条目存储之前转换为固定点精度。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式