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

1. 发明授权

US08407171B2 Method for constraint optimization under box constraints 有权
标题翻译：方框约束下的约束优化方法
公开(公告)号：US08407171B2
公开(公告)日：2013-03-26
申请号：US12853886
申请日：2010-08-10
申请人： Mithun Das Gupta , Jing Xiao , Sanjeev Kumar
发明人： Mithun Das Gupta , Jing Xiao , Sanjeev Kumar
IPC分类号： G06F17/00
CPC分类号： G06F15/18 , G06F17/16
摘要： Similarities between simplex projection with upper bounds and L1 projection are explored. Criteria for a-priori determination of sequence in which various constraints become active are derived, and this sequence is used to develop efficient algorithms for projecting a vector onto the L1-ball while observing box constraints. Three projection methods are presented. The first projection method performs exact projection in O(n2) worst case complexity, where n is the space dimension. Using a novel criteria for ordering constraints, the second projection method has a worst case complexity of O(n log n). The third projection method is a worst case linear time algorithm having O(n) complexity. The upper bounds defined for the projected entries guide the L1-ball projection to more meaningful predictions.
摘要翻译：探讨了单面投影与上界和L1投影之间的相似性。导出先验确定各种约束变为有效的序列的标准，并且该序列用于开发用于在观察盒约束的情况下将向量投影到L1球上的有效算法。提出了三种投影方法。第一种投影方法在O（n2）最差情况复杂度中执行精确投影，其中n是空间维数。使用新颖的排序约束条件，第二种投影方法具有O（n log n）的最差情况复杂度。第三种投影方法是具有O（n）复杂度的最差情况线性时间算法。为投影条目定义的上限将引导L1球投影更有意义的预测。

2. 发明授权

US08285033B2 Bi-affinity filter: a bilateral type filter for color images 有权
标题翻译：双亲过滤器：彩色图像的双边型过滤器
公开(公告)号：US08285033B2
公开(公告)日：2012-10-09
申请号：US12752615
申请日：2010-04-01
申请人： Mithun Das Gupta , Jing Xiao
发明人： Mithun Das Gupta , Jing Xiao
IPC分类号： G06K9/00 , H04N3/14
CPC分类号： G06T5/002 , G06T2207/10024 , G06T2207/20028 , G06T2207/20192
摘要： An edge preserving filter that works on the principle of matting affinity allows a better representation of the range filter term in bilateral class filters. The definition of the affinity term can be relaxed to suit different applications. An approximate bi-affinity filter whose output is shown to be very similar to the traditional bilateral filter is defined. The present technique has the added advantage that no color space changes are required and hence an input image can be handled in its original color space. This is a big benefit over the traditional bilateral filter, which needs conversion to perception based spaces, such as CIELAB, to generate results close to the present invention. The full bi-affinity filter preserves very minute details of the input image, and thus permits an enhanced zooming functionality.
摘要翻译：基于消隐亲和性原理的边缘保留过滤器可以更好地表示双边类过滤器中的范围过滤项。亲和力术语的定义可以放宽以适应不同的应用。定义了一个近似的双亲和滤波器，其输出显示为非常类似于传统的双向滤波器。本技术具有附加的优点，即不需要颜色空间变化，因此可以在其原始颜色空间中处理输入图像。与传统的双边滤波器相比，这是一个很大的好处，它需要转换为基于感知的空间，如CIELAB，以产生接近本发明的结果。完整的双亲和过滤器保留输入图像的非常细小的细节，从而允许增强的缩放功能。

3. 发明申请

US20120041905A1 Supervised Nonnegative Matrix Factorization 有权
标题翻译：监督的非负矩阵分解
公开(公告)号：US20120041905A1
公开(公告)日：2012-02-16
申请号：US12854768
申请日：2010-08-11
申请人： Seung-il Huh , Mithun Das Gupta , Jing Xiao
发明人： Seung-il Huh , Mithun Das Gupta , Jing Xiao
IPC分类号： G06F15/18 , G06F17/16
CPC分类号： G06F17/16 , G06K9/00221 , G06K9/6239
摘要： Supervised nonnegative matrix factorization (SNMF) generates a descriptive part-based representation of data, based on the concept of nonnegative matrix factorization (NMF) aided by the discriminative concept of graph embedding. An iterative procedure that optimizes suggested formulation based on Pareto optimization is presented. The present formulation removes any dependence on combined optimization schemes. Analytical and empirical evidence is presented to show that SNMF has advantages over popular subspace learning techniques as well as current state-of-the-art techniques.
摘要翻译：基于非负矩阵因子分解（NMF）的概念，辅助非线性矩阵分解（SNMF）生成描述性的基于部分的数据表示，由图形嵌入的区分概念辅助。提出了一种基于帕累托优化优化建议公式的迭代过程。本公式消除了对组合优化方案的任何依赖。提出了分析和实证证据，表明SNMF具有优于流行的子空间学习技术以及当前最新技术的优点。

4. 发明授权

US08144925B2 Mapping based message encoding for fast reliable visible watermarking 有权
标题翻译：基于映射的消息编码，实现快速可靠的可见水印
公开(公告)号：US08144925B2
公开(公告)日：2012-03-27
申请号：US12862325
申请日：2010-08-24
申请人： Mithun Das Gupta , Jing Xiao
发明人： Mithun Das Gupta , Jing Xiao
IPC分类号： G06K9/00
CPC分类号： H04N1/32261 , H04N1/32224
摘要： A watermarking system uses two distinct bit patterns to identify three distinct bits, a logic 0 bit, a logic 1 bit, and a marker bit that demarcates message block boundaries. A correct orientation is determining by rotating the input image by 90 degrees and determining which orientation renders the greatest number of valid bits. Bit mapping is used from block to block to predefine a shifting starting position for a watermark message within consecutive message blocks.
摘要翻译：水印系统使用两个不同的位模式来识别三个不同的位，逻辑0位，逻辑1位和标记消息块边界的标记位。通过将输入图像旋转90度并确定哪个方向呈现最大数量的有效位来确定正确的方向。从块到块使用位映射来预定义连续消息块内的水印消息的移位开始位置。

5. 发明申请

US20120041906A1 Supervised Nonnegative Matrix Factorization 有权
标题翻译：监督的非负矩阵分解
公开(公告)号：US20120041906A1
公开(公告)日：2012-02-16
申请号：US12854776
申请日：2010-08-11
申请人： Seung-il Huh , Mithun Das Gupta , Jing Xiao
发明人： Seung-il Huh , Mithun Das Gupta , Jing Xiao
IPC分类号： G06F15/18 , G06F17/11 , G06F17/14 , G06F17/16
CPC分类号： G06F17/16 , G06K9/00221 , G06K9/6239
摘要： Supervised kernel nonnegative matrix factorization generates a descriptive part-based representation of data, based on the concept of kernel nonnegative matrix factorization (kernel NMF) aided by the discriminative concept of graph embedding. An iterative procedure that optimizes suggested formulation based on Pareto optimization is presented. The present formulation removes any dependence on combined optimization schemes.
摘要翻译：基于内核非负矩阵因子分解（核NMF）的概念，受到图形嵌入的区分性概念的帮助，被监督的核非负矩阵因式分解产生了描述性的基于部分的数据表示。提出了一种基于帕累托优化优化建议公式的迭代过程。本公式消除了对组合优化方案的任何依赖。

6. 发明申请

US20120041725A1 Supervised Nonnegative Matrix Factorization 有权
标题翻译：监督的非负矩阵分解
公开(公告)号：US20120041725A1
公开(公告)日：2012-02-16
申请号：US12854781
申请日：2010-08-11
申请人： Seung-il Huh , Mithun Das Gupta , Jing Xiao
发明人： Seung-il Huh , Mithun Das Gupta , Jing Xiao
IPC分类号： G06F17/10
CPC分类号： G06K9/00 , G06F17/16 , G06K9/00275 , G06K9/00288 , G06K9/00308 , G06K9/6239 , G06K9/6252
摘要： Graph embedding is incorporated into nonnegative matrix factorization, NMF, while using the original formulation of graph embedding. Negative values are permitted in the definition of graph embedding without violating the nonnegative requirement of NMF. The factorized matrices of NMF are found by an iterative process.
摘要翻译：图形嵌入被纳入非负矩阵分解，NMF，同时使用图形嵌入的原始公式。在图表嵌入的定义中允许负值，而不会违反NMF的非负性要求。 NMF的分解矩阵是通过迭代过程找到的。

7. 发明申请

US20110200269A1 Fast Approximation For Bilateral Filter 审中-公开
标题翻译：双边滤波器的近似近似
公开(公告)号：US20110200269A1
公开(公告)日：2011-08-18
申请号：US12707903
申请日：2010-02-18
申请人： Mithun Das Gupta , Jing Xiao
发明人： Mithun Das Gupta , Jing Xiao
IPC分类号： G06K9/40 , G06F17/14
CPC分类号： G06T5/20 , G06T5/002 , G06T2207/20028 , G06T2207/20192
摘要： Multiple filters of a bilateral filter are decoupled to form into multple linear filtering operations, which permits faster processing. The bilateral filter is re-presented as an approximate bilateral filter, and subjected to a logarithm whose resultant components are further subjected to a series of Jensen approximations. The errors resulting from each Jensen approximation are collected into a single cumulative error factor, and it is then shown that the cumulative error may be ignored without adversed affect to the result. Thus, the original bilateral filter may be implemented as log(y0)=log(2−ΣgjKj)+log(ΣKjfj)+log(ΣKjgj).
摘要翻译：双向滤波器的多个滤波器被去耦合以形成多个线性滤波操作，这允许更快的处理。双边滤波器被重新呈现为近似的双边滤波器，并且经受对数，其结果分量进一步经受一系列詹森近似。每个Jensen近似产生的误差被收集到单个累积误差因子中，然后显示累积误差可能被忽略，而不会对结果产生影响。因此，原始双边滤波器可以被实现为log（y0）= log（2-＆Sgr; gjKj）+ log（＆Sgr; Kjfj）+ log（＆Sgr; Kjgj）。

8. 发明申请

US20110194726A1 Embedded Message Extraction For Visible Watermarking 有权
标题翻译：嵌入式消息提取可视水印
公开(公告)号：US20110194726A1
公开(公告)日：2011-08-11
申请号：US12701349
申请日：2010-02-05
申请人： Mithun Das Gupta , Jing Xiao
发明人： Mithun Das Gupta , Jing Xiao
IPC分类号： G06K9/00
CPC分类号： G06T1/0021
摘要： A watermarking system uses distinct bit patterns to identify a logic 0, a logic 1, and a marker bit, which demarcates segments of logic bit information. Marker bits, which are printed on both foreground and background areas of an image, outline message blocks. In message extraction, a preprocessing step removes any white boarders, identifies the best defined corner of a message block, crops the image, and rotates the image to place the identified corner at the top-left corner. Message extraction scans the rotated image in window segments of increasing size during multiple cycles. During each cycle, if a bit pattern cannot be identified as a data bit, then the size of the examined bit area is increased and rechecked to see it specifically is a marker bit. If no bit information can be definitively identified, then it is assigned a logic bit value based on a 50% random assignment.
摘要翻译：水印系统使用不同的位模式来识别逻辑0，逻辑1和标记位，其标记逻辑位信息的段。打印在图像的前景和背景区域上的标记位轮廓消息块。在消息提取中，预处理步骤删除任何白色寄宿生，识别消息块的最佳定义角，裁剪图像，并旋转图像以将识别的角落放置在左上角。消息提取在多个周期内以增加大小的窗口段扫描旋转后的图像。在每个周期中，如果位模式不能被识别为数据位，则检查的位区域的大小将被增加并重新检查，以查看它是否具体是标记位。如果不能确定位信息，则根据50％的随机分配给它分配一个逻辑位值。

9. 发明申请

US20110194690A1 Data Adaptive Message Embedding For Visible Watermarking 有权
标题翻译：数据自适应消息嵌入可见水印
公开(公告)号：US20110194690A1
公开(公告)日：2011-08-11
申请号：US12701311
申请日：2010-02-05
申请人： Mithun Das Gupta , Jing Xiao
发明人： Mithun Das Gupta , Jing Xiao
IPC分类号： H04N1/44 , G09C5/00 , G06K9/00
CPC分类号： H04N1/32203 , G06T1/0021 , H04N1/32208 , H04N1/32325 , H04N1/32352
摘要： A watermarking system uses distinct bit patterns to identify a logic 0, a logic 1, and a marker bit, which demarcates segments of logic bit information. Marker bits, which are printed on both foreground and background areas of an image, outline message blocks. In message extraction, a preprocessing step removes any white boarders, identifies the best defined corner of a message block, crops the image, and rotates the image to place the identified corner at the top-left corner. Message extraction scans the rotated image in window segments of increasing size during multiple cycles. During each cycle, if a bit pattern cannot be identified as a data bit, then the size of the examined bit area is increased and rechecked to see it specifically is a marker bit. If no bit information can be definitively identified, then it is assigned a logic bit value based on a 50% random assignment.
摘要翻译：水印系统使用不同的位模式来识别逻辑0，逻辑1和标记位，其标记逻辑位信息的段。打印在图像的前景和背景区域上的标记位轮廓消息块。在消息提取中，预处理步骤删除任何白色寄宿生，识别消息块的最佳定义角，裁剪图像，并旋转图像以将识别的角落放置在左上角。消息提取在多个周期内以增加大小的窗口段扫描旋转后的图像。在每个周期期间，如果位模式不能被识别为数据位，则检查的位区域的大小将被增加并重新检查，以查看其特定的标记位。如果不能确定位信息，则根据50％的随机分配给它分配一个逻辑位值。

10. 发明授权

US08515879B2 Supervised nonnegative matrix factorization 有权
标题翻译：监督的非负矩阵分解
公开(公告)号：US08515879B2
公开(公告)日：2013-08-20
申请号：US12854776
申请日：2010-08-11
申请人： Seung-il Huh , Mithun Das Gupta , Jing Xiao
发明人： Seung-il Huh , Mithun Das Gupta , Jing Xiao
IPC分类号： G06F15/18 , G06F17/11
CPC分类号： G06F17/16 , G06K9/00221 , G06K9/6239
摘要： Supervised kernel nonnegative matrix factorization generates a descriptive part-based representation of data, based on the concept of kernel nonnegative matrix factorization (kernel NMF) aided by the discriminative concept of graph embedding. An iterative procedure that optimizes suggested formulation based on Pareto optimization is presented. The present formulation removes any dependence on combined optimization schemes.
摘要翻译：基于内核非负矩阵因子分解（核NMF）的概念，受到图形嵌入的区分性概念的帮助，被监督的核非负矩阵因式分解产生了描述性的基于部分的数据表示。提出了一种基于帕累托优化优化建议公式的迭代过程。本公式消除了对组合优化方案的任何依赖。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式