会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 33. 发明申请
    • Generating A Texture From Multiple Images
    • 从多个图像生成纹理
    • US20120133665A1
    • 2012-05-31
    • US13367302
    • 2012-02-06
    • Yonatan WexlerEyal Ofek
    • Yonatan WexlerEyal Ofek
    • G09G5/00
    • G06T15/04
    • A texture is generated using a plurality of images and a geometry that correspond to an object. The geometry is mapped to each of the plurality of images. A graph includes a plurality of nodes corresponding to portions of the images. An edge exists between a first node and a second node if a first portion corresponding to the first node and a second portion corresponding to the second node can be neighboring portions in a resulting image. Ways of forming the resulting image are represented by paths in the graph. Edges and nodes in the graph may have associated costs. A path in the graph having a smallest total cost is determined and represents the resulting image. A texture is generated for the object using the resulting image.
    • 使用多个图像和对应于对象的几何形状来生成纹理。 将几何图形映射到多个图像中的每一个。 图形包括对应于图像的一部分的多个节点。 如果对应于第一节点的第一部分和对应于第二节点的第二部分可以是所得图像中的相邻部分,则在第一节点和第二节点之间存在边缘。 形成所得图像的方法由图中的路径表示。 图中的边和节点可能具有相关成本。 确定具有最小总成本的图中的路径,并且表示所得到的图像。 使用生成的图像为对象生成纹理。
    • 34. 发明申请
    • DATA DRIVEN INTERPOLATION USING GEODESIC AFFINITY
    • 使用地球物理学的数据驱动插值
    • US20110299766A1
    • 2011-12-08
    • US12794982
    • 2010-06-07
    • Yonatan WexlerEyal Ofek
    • Yonatan WexlerEyal Ofek
    • G06K9/32
    • G06T3/4007G06T11/001
    • Often, information regarding images and/or other data may be incomplete. For example, an image may have depth information associated with a portion of the image, but not the entire image. It may be advantageous to extrapolate the values from the known points to the entire image. Accordingly, a dimensional array representing an image (or other data) may be traversed one or more times to generate an interpolated table. The interpolated table may comprise pixels of unknown value, where a pixel of unknown value may be associated with a number of pixels with known values. In this way, values for pixels may be specified based upon values of pixels having known values.
    • 通常,有关图像和/或其他数据的信息可能不完整。 例如,图像可以具有与图像的一部分相关联的深度信息,但不具有整个图像。 将值从已知点外推到整个图像可能是有利的。 因此,可以遍历表示图像(或其他数据)的尺寸数组一次或多次以生成内插表。 内插表可以包括未知值的像素,其中未知值的像素可以与具有已知值的多个像素相关联。 以这种方式,可以基于具有已知值的像素的值来指定像素的值。
    • 37. 发明授权
    • Generating a texture from multiple images
    • 从多个图像生成纹理
    • US08125493B2
    • 2012-02-28
    • US11903070
    • 2007-09-20
    • Yonatan WexlerEyal Ofek
    • Yonatan WexlerEyal Ofek
    • G09G5/00
    • G06T15/04
    • A texture is generated using a plurality of images and a geometry that corresponds to an object. The geometry is mapped to each of the plurality of images. A graph includes a plurality of nodes corresponding to portions of the images. An edge exists between a first node and a second node if a first portion corresponding to the first node and a second portion corresponding to the second node can be neighboring portions in a resulting image. Ways of forming the resulting image are represented by paths in the graph. Edges and nodes in the graph may have associated costs. A path in the graph having a smallest total cost is determined and represents the resulting image. A texture is generated for the object using the resulting image.
    • 使用多个图像和与对象对应的几何形状来生成纹理。 将几何图形映射到多个图像中的每一个。 图形包括对应于图像的一部分的多个节点。 如果对应于第一节点的第一部分和对应于第二节点的第二部分可以是所得图像中的相邻部分,则在第一节点和第二节点之间存在边缘。 形成所得图像的方法由图中的路径表示。 图中的边和节点可能具有相关成本。 确定具有最小总成本的图中的路径,并且表示所得到的图像。 使用生成的图像为对象生成纹理。
    • 39. 发明申请
    • OPTIMAL 2D TEXTURING FROM MULTIPLE IMAGES
    • 从多个图像的最佳二维纹理
    • US20100085371A1
    • 2010-04-08
    • US12244424
    • 2008-10-02
    • Yonatan WexlerEyal OfekBilly Chen
    • Yonatan WexlerEyal OfekBilly Chen
    • G09G5/00
    • G06T15/04G09G5/00G09G5/393G09G5/395G09G5/397G09G2340/0414G09G2340/0421
    • One or more images of an object are obtained. These are then warped onto the object. The object may be divided into sites where sites are overlapping circular regions of the object. For each site, a neighborhood graph may be created where each site is a node in the graph and each pair of sites with overlapping regions is connected by an edge. A list of covers of each site may be created where the list contains all the possible labels for that node. Each image that covers part of the site may be reviewed including all possible shifts up to some number of pixels. A cost may be assigned to each cover and costs for each of the covers may be calculated. The cover with the lowest cost may be selected. If the costs are too high, the resolution may be lowered, one or more possible covers may be selected and then the analysis may be performed using the selected covers at a higher resolution.
    • 获得对象的一个​​或多个图像。 然后将它们扭曲到物体上。 对象可以被分为站点是对象的重叠圆形区域的站点。 对于每个站点,可以创建邻域图,其中每个站点是图中的节点,并且具有重叠区域的每对站点通过边缘连接。 可以创建每个站点的封面列表,其中列表包含该节点的所有可能的标签。 涵盖部分网站的每个图像可能会被审查,包括所有可能的移动,直到一些像素数。 可以分配每个封面的成本,并且可以计算每个封面的成本。 可以选择成本最低的封面。 如果成本太高,则可能降低分辨率,可以选择一个或多个可能的盖子,然后可以使用所选择的盖子以更高分辨率执行分析。