会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明申请
    • Occlusion Handling in Stero Imaging
    • Stero成像中的闭塞处理
    • US20070086646A1
    • 2007-04-19
    • US11462342
    • 2006-08-03
    • Qiong YangYi DengXiaoou TangXueyin Lin
    • Qiong YangYi DengXiaoou TangXueyin Lin
    • G06K9/00
    • G06K9/20G06K9/6207G06K2209/40G06T7/593G06T2207/10012G06T2207/20016
    • The handling of occlusions in stereo imaging is disclosed. In one implementation, an association between a discontinuity in one stereo image and an occlusion in a second stereo image is utilized. In such an implementation, the first and second stereo images are segmented. A mapping of a discontinuity within the second stereo image is used to form at least part of a boundary of an occlusion in the first stereo image. The mapped discontinuity is found at a boundary between two segments in the second stereo image, and once mapped, divides a segment in the first stereo image into two patches. An energy calculation is made in an iterative manner, alternating with changes to a solution with the disparities and occlusions of the patches. Upon minimization, disparities and occlusions at the patch and pixel level are available.
    • 公开了立体成像中遮挡物的处理。 在一个实现中,利用一个立体图像中的不连续性和第二立体图像中的遮挡之间的关联。 在这种实现中,分割第一和第二立体图像。 使用第二立体图像内的不连续性的映射来形成第一立体图像中的遮挡的边界的至少一部分。 映射的不连续性位于第二立体图像中的两个段之间的边界处,一旦映射,则将第一立体图像中的段划分成两个补丁。 以迭代的方式进行能量计算,并与补丁的差异和闭塞的解决方案的变化交替进行。 在最小化时,可以使用补丁和像素级别的差异和遮挡。
    • 3. 发明授权
    • Occlusion handling in stereo imaging
    • 立体成像中的闭塞处理
    • US08300085B2
    • 2012-10-30
    • US11462342
    • 2006-08-03
    • Qiong YangYi DengXiaoou TangXueyin Lin
    • Qiong YangYi DengXiaoou TangXueyin Lin
    • H04N15/00H04N13/00G06K9/00
    • G06K9/20G06K9/6207G06K2209/40G06T7/593G06T2207/10012G06T2207/20016
    • The handling of occlusions in stereo imaging is disclosed. In one implementation, an association between a discontinuity in one stereo image and an occlusion in a second stereo image is utilized. In such an implementation, the first and second stereo images are segmented. A mapping of a discontinuity within the second stereo image is used to form at least part of a boundary of an occlusion in the first stereo image. The mapped discontinuity is found at a boundary between two segments in the second stereo image, and once mapped, divides a segment in the first stereo image into two patches. An energy calculation is made in an iterative manner, alternating with changes to a solution with the disparities and occlusions of the patches. Upon minimization, disparities and occlusions at the patch and pixel level are available.
    • 公开了立体成像中遮挡物的处理。 在一个实现中,利用一个立体图像中的不连续性和第二立体图像中的遮挡之间的关联。 在这种实现中,分割第一和第二立体图像。 使用第二立体图像内的不连续性的映射来形成第一立体图像中的遮挡的边界的至少一部分。 在第二立体图像中的两个段之间的边界处发现映射的不连续性,并且一旦映射,将第一立体图像中的段划分成两个补丁。 以迭代的方式进行能量计算,并与补丁的差异和闭塞的解决方案的变化交替进行。 在最小化时,可以使用补丁和像素级别的差异和遮挡。
    • 4. 发明授权
    • Active segmentation for groups of images
    • 主动分割图像组
    • US08045800B2
    • 2011-10-25
    • US12025703
    • 2008-02-04
    • Xiaoou TangQiong Yang
    • Xiaoou TangQiong Yang
    • G06K9/34
    • G06K9/342G06K9/38G06K2009/366
    • Systems and methods of segmenting images are disclosed herein. The similarity of images in a set of images is compared. A group of images is selected from the set of images. The images in the group of images are selected based on compared similarities among the images. An informative image is selected from the group of images. User-defined semantic information of the informative image is received. The group of images as a graph is modeled as a graph. Each image in the group of images denotes a node in the graph. Edges of the graph denote a foreground relationship between images or a background relationship between images. One or more images in the group of images are automatically segmented by propagating the semantic information of the informative image to images in the group of images having a corresponding graph node that is related to a graph node corresponding to the informative image. Segmentation results can be refined according to user provided image semantics.
    • 本文公开了分割图像的系统和方法。 比较一组图像中图像的相似度。 从该组图像中选择一组图像。 基于图像中的相似度来选择图像组中的图像。 从图像组中选择信息图像。 收到信息图像的用户定义语义信息。 作为图形的图像组被建模为图形。 图像组中的每个图像表示图中的一个节点。 图的边缘表示图像之间的前景关系或图像之间的背景关系。 通过将信息图像的语义信息传播到具有与对应于信息图像的图形节点相关联的对应图形节点的图像组中的图像来自动分割图像组中的一个或多个图像。 分割结果可以根据用户提供的图像语义进行细化。
    • 7. 发明申请
    • ACTIVE SEGMENTATION FOR GROUPS OF IMAGES
    • 图像组的主动分段
    • US20080304743A1
    • 2008-12-11
    • US12025703
    • 2008-02-04
    • Xiaoou TangQiong Yang
    • Xiaoou TangQiong Yang
    • G06K9/34
    • G06K9/342G06K9/38G06K2009/366
    • Systems and methods of segmenting images are disclosed herein. The similarity of images in a set of images is compared. A group of images is selected from the set of images. The images in the group of images are selected based on compared similarities among the images. An informative image is selected from the group of images. User-defined semantic information of the informative image is received. The group of images as a graph is modeled as a graph. Each image in the group of images denotes a node in the graph. Edges of the graph denote a foreground relationship between images or a background relationship between images. One or more images in the group of images are automatically segmented by propagating the semantic information of the informative image to images in the group of images having a corresponding graph node that is related to a graph node corresponding to the informative image. Segmentation results can be refined according to user provided image semantics.
    • 本文公开了分割图像的系统和方法。 比较一组图像中图像的相似度。 从该组图像中选择一组图像。 基于图像中的相似度来选择图像组中的图像。 从图像组中选择信息图像。 收到信息图像的用户定义语义信息。 作为图形的图像组被建模为图形。 图像组中的每个图像表示图中的一个节点。 图的边缘表示图像之间的前景关系或图像之间的背景关系。 通过将信息图像的语义信息传播到具有与对应于信息图像的图形节点相关联的对应图形节点的图像组中的图像来自动分割图像组中的一个或多个图像。 分割结果可以根据用户提供的图像语义进行细化。
    • 8. 发明申请
    • Progressive cut: interactive object segmentation
    • 渐进切割:交互式对象分割
    • US20080136820A1
    • 2008-06-12
    • US11897224
    • 2007-08-29
    • Qiong YangChao WangMo ChenXiaoou TangZhongfu Ye
    • Qiong YangChao WangMo ChenXiaoou TangZhongfu Ye
    • G06T11/20G06F3/041
    • G06F3/04845G06T7/11G06T7/162G06T7/194G06T11/60G06T2200/24G06T2207/20092
    • Progressive cut interactive object segmentation is described. In one implementation, a system analyzes strokes input by the user during iterative image segmentation in order to model the user's intention for refining segmentation. In the user intention model, the color of each stroke indicates the user's expectation of pixel label change to foreground or background, the location of the stroke indicates the user's region of interest, and the position of the stroke relative to a previous segmentation boundary indicates a segmentation error that the user intends to refine. Overexpansion of pixel label change is controlled by penalizing change outside the user's region of interest while overshrinkage is controlled by modeling the image as an eroded graph. In each iteration, energy consisting of a color term, a contrast term, and a user intention term is minimized to obtain a segmentation map.
    • 描述了渐进切割交互式对象分割。 在一个实现中,系统分析用户在迭代图像分割期间输入的笔画,以便模拟用户的细化细分意图。 在用户意图模型中,每个笔画的颜色表示用户对于前景或背景的像素标签变化的期望,笔画的位置指示用户感兴趣的区域,并且笔画相对于先前分割边界的位置指示 用户打算细化的分段错误。 像素标签变化的过度扩展是通过对用户感兴趣区域之外的变化进行惩罚来控制的,而通过将图像建模为受侵蚀图来控制超损耗。 在每次迭代中,将由颜色项,对比度项和用户意图项组成的能量最小化以获得分割图。
    • 9. 发明申请
    • Directed Graph Embedding
    • 定向图嵌入
    • US20100121792A1
    • 2010-05-13
    • US12521985
    • 2008-01-07
    • Qiong YangMo ChenXiaoou Tang
    • Qiong YangMo ChenXiaoou Tang
    • G06N5/02G06F15/18G06F7/548
    • G06F16/9024
    • Directed graph embedding is described. In one implementation, a system explores the link structure of a directed graph and embeds the vertices of the directed graph into a vector space while preserving affinities that are present among vertices of the directed graph. Such an embedded vector space facilitates general data analysis of the information in the directed graph. Optimal embedding can be achieved by measuring local affinities among vertices via transition probabilities between the vertices, based on a stationary distribution of Markov random walks through the directed graph. For classifying linked web pages represented by a directed graph, the system can train a support vector machine (SVM) classifier, which can operate in a user-selectable number of dimensions.
    • 描述了定向图嵌入。 在一个实现中,系统探索有向图的链接结构,并将有向图的顶点嵌入到向量空间中,同时保留存在于有向图的顶点之间的亲和度。 这样的嵌入向量空间有助于对有向图中的信息的一般数据分析。 基于通过有向图的马尔科夫随机游走的平稳分布,可以通过顶点之间的转移概率来测量顶点之间的局部亲和度来实现最佳嵌入。 为了对由有向图表示的链接的网页进行分类,系统可以训练支持向量机(SVM)分类器,其可以以用户可选择的维数操作。