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

91. 发明授权

US09378582B2 Rendering of design data 有权
标题翻译：渲染设计数据
公开(公告)号：US09378582B2
公开(公告)日：2016-06-28
申请号：US13562448
申请日：2012-07-31
申请人： Edward Slavin, III , Jan Ernst , Yakup Genc
发明人： Edward Slavin, III , Jan Ernst , Yakup Genc
IPC分类号： G06T15/00 , G06T15/20 , G06T19/00 , G06T9/00
CPC分类号： G06T15/20 , G06T9/001 , G06T9/004 , G06T19/00 , G06T2210/08
摘要： Computer assisted design data is rendered in the cloud. A client-server relationship is provided for 3D rendering. To reduce the burden on the server, the 3D rendering adapts based on the client capabilities. Where possible, some of the 3D rendering is performed by the server and some by the client machine. The 3D rendering by the client machine may be limited to avoid transfer of geometrical data of the CAD data. Different textures or shaders are used for rendering images associated with motion. Dictionary information is accumulated by the client machine to reduce the number of coefficients later transferred to the client machine for 3D rendering. The model represented by the CAD data is used to predict rendered images so that video compression may be performed. The server sparsely renders an image and compressive sensing is used by the client machine to generate the complete image.
摘要翻译：计算机辅助设计数据在云中呈现。为3D渲染提供了客户端 - 服务器关系。为了减轻服务器的负担，3D渲染根据客户端功能进行调整。在可能的情况下，一些3D渲染由服务器执行，有些由客户机执行。可能限制客户端机器的3D渲染，以避免传递CAD数据的几何数据。不同的纹理或着色器用于渲染与运动相关的图像。字典信息由客户机累积以减少稍后传送到客户端机器进行3D渲染的系数数量。由CAD数据表示的模型用于预测渲染图像，从而可以执行视频压缩。服务器稀疏地呈现图像，并且客户机使用压缩感测来生成完整的图像。

92. 发明申请

US20160180586A1 SYSTEM AND METHOD FOR DATA COMPRESSION AND GRID REGENERATION 有权
标题翻译：用于数据压缩和网格再生的系统和方法
公开(公告)号：US20160180586A1
公开(公告)日：2016-06-23
申请号：US14578096
申请日：2014-12-19
申请人： David B. Marks , Blake Peno , Elias Z. K. Ioup , Paul A. Elmore
发明人： David B. Marks , Blake Peno , Elias Z. K. Ioup , Paul A. Elmore
IPC分类号： G06T17/20 , G06T1/20
CPC分类号： G06T17/20 , G06T1/20 , G06T9/001 , G06T17/05 , G06T17/205 , G06T2200/04
摘要： System and method for compressing electronic data such as, for example topological data (altitude/depth) or geospatial data (latitude/longitude) with constrained loss of fidelity. With respect to altitude/depth data, the system and method allow for a mixture of shoreline and deep water to be thinned within the same mesh without appreciable loss of information in either region. System and method retain underlying grid values, opening RTF N functionality for any sphere where original grid positions must be preserved. System and method provide for encryption/decryption of electronic data.
摘要翻译：用于压缩电子数据的系统和方法，例如具有受限制的保真度损失的拓扑数据（高度/深度）或地理空间数据（纬度/经度）。关于高度/深度数据，系统和方法允许海岸线和深水的混合物在同一网格内变薄，而在任何一个区域中都不会有明显的信息丢失。系统和方法保留底层网格值，为必须保留原始网格位置的任何球体打开RTF N功能。系统和方法提供电子数据的加密/解密。

93. 发明申请

US20160071313A1 RELATIVE ENCODING FOR A BLOCK-BASED BOUNDING VOLUME HIERARCHY 有权
标题翻译：基于块的边界体积分数的相对编码
公开(公告)号：US20160071313A1
公开(公告)日：2016-03-10
申请号：US14589910
申请日：2015-01-05
申请人： NVIDIA Corporation
发明人： Samuli Matias Laine , Timo Oskari Aila , Tero Tapani Karras
IPC分类号： G06T15/10 , G06T17/00
CPC分类号： G06T9/40 , G06T9/001 , G06T15/005 , G06T15/04 , G06T15/06 , G06T15/08 , G06T15/10 , G06T15/80 , G06T17/005 , G06T17/10
摘要： A system, method, and computer program product for implementing a tree traversal operation for a tree data structure is disclosed. The method includes the steps of receiving at least a portion of a tree data structure that represents a tree having a plurality of nodes and processing, via a tree traversal operation algorithm executed by a processor, one or more nodes of the tree data structure by intersecting the one or more nodes of the tree data structure with a query data structure. A first node of the tree data structure is associated with a first local coordinate system and a second node of the tree data structure is associated with a second local coordinate system, the first node being an ancestor of the second node, and the first local coordinate system and the second local coordinate system are both specified relative to a global coordinate system.
摘要翻译：公开了一种用于实现树数据结构的树遍历操作的系统，方法和计算机程序产品。该方法包括以下步骤：接收表示具有多个节点的树的树数据结构的至少一部分，并且经由处理器执行的树遍历运算算法，通过相交来处理树数据结构的一个或多个节点具有查询数据结构的树数据结构的一个或多个节点。树数据结构的第一节点与第一局部坐标系相关联，并且树数据结构的第二节点与第二局部坐标系相关联，第一节点是第二节点的祖先，第一局部坐标系统和第二局部坐标系均相对于全局坐标系来指定。

94. 发明申请

US20160019714A1 VIEWER OPTIMIZED MODEL COMPRESSION 有权
标题翻译：查看器优化模型压缩
公开(公告)号：US20160019714A1
公开(公告)日：2016-01-21
申请号：US14334465
申请日：2014-07-17
申请人： Empire Technology Development LLC
发明人： Ezekiel Kruglick
IPC分类号： G06T17/00 , G06T9/00
CPC分类号： G06T9/00 , G06T9/001 , G06T17/10
摘要： Technologies may be generally described to provide viewer optimized compression of a model. In some examples, a computing device may receive a request to compress a master model for a viewer. The computing device may determine shape primitives of the master model through use of a shape primitive identification technique such as a random sample consensus (RANSAC) technique. The identified or determined shape primitives may be subtracted from the master model to determine residues of the master model. A processed model may be generated from the residues of the master model and the shape primitives. Visible subsets, visible based on a view cone of the viewer, of the residues and the shape primitives may be selected from the processed model, from which a compressed model may be generated. The processed model may then be used to generate a second view without redetermining the shape primitives.
摘要翻译：通常可以描述技术来提供观看者优化的模型压缩。在一些示例中，计算设备可以接收针对观看者压缩主模型的请求。计算设备可以通过使用诸如随机样本共有（RANSAC）技术的形状原语识别技术来确定主模型的形状基元。可以从主模型中减去识别或确定的形状基元，以确定主模型的残差。可以从主模型和形状基元的残差生成经处理的模型。可以从处理的模型中选择残留物和形状基元的基于观察者的视锥的可见子集，可从中生成压缩模型。然后可以使用经处理的模型来生成第二视图而不重新确定形状基元。

95. 发明授权

US09235920B2 Method and processor for 3D scene representation 有权
标题翻译： 3D场景表示的方法和处理器
公开(公告)号：US09235920B2
公开(公告)日：2016-01-12
申请号：US14366896
申请日：2012-03-07
申请人： Ivana Girdzijauskas , Markus H. Flierl , Pravin Kumar Rana
发明人： Ivana Girdzijauskas , Markus H. Flierl , Pravin Kumar Rana
IPC分类号： G06T15/00 , G06T7/00 , G06T9/00 , H04N13/00 , H04N13/02 , H04N19/597
CPC分类号： G06T15/005 , G06T7/97 , G06T9/001 , G06T2207/10012 , G06T2207/10028 , G06T2207/30168 , G06T2219/2008 , H04N13/161 , H04N13/282 , H04N19/597
摘要： The present invention relates to three dimension (3D) scene representations and in particular to a method and a processor for providing improved 3D scene representations. An objective of the embodiments of the present invention is to improve the determination of consistency among a plurality of projections at a virtual view denoted vF. When determining the consistency, entries of a distance matrix, indicative of distance differences of 3D components between different views for a corresponding segment k when projected to the predefined view (vF) for each segment k, are compared with entries of a threshold matrix. The objective is achieved by assigning each segment k of a 3D component to a cluster based on individual rules for each cluster and one threshold matrix and by determining one threshold matrix for each cluster based on the segments of that cluster.
摘要翻译：本发明涉及三维（3D）场景表示，特别涉及用于提供改进的3D场景表示的方法和处理器。本发明的实施例的目的是改进在虚拟视图中表示为vF的多个投影之间的一致性的确定。当确定一致性时，将针对每个段k投影到预定义视图（vF）时的对应段k的不同视图之间的3D分量的距离差的距离矩阵的条目与阈值矩阵的条目进行比较。目标是通过基于每个集群和一个阈值矩阵的单独规则将3D分量的每个分段k分配给集群，并且通过基于该集群的分段确定每个集群的一个阈值矩阵来实现。

96. 发明授权

US09214042B2 Method for encoding normals of a 3D mesh model, method for decoding normals of a 3D mesh model, encoder and decoder 有权
标题翻译：用于编码3D网格模型的法线的方法，用于解码3D网格模型的法线，编码器和解码器的方法
公开(公告)号：US09214042B2
公开(公告)日：2015-12-15
申请号：US13575228
申请日：2010-01-25
申请人： Kang Ying Cai , Wei Wei Li , Zhi Bo Chen
发明人： Kang Ying Cai , Wei Wei Li , Zhi Bo Chen
IPC分类号： G06T17/00 , G06T17/20 , G06T9/00 , G06T15/50
CPC分类号： G06T9/001 , G06T9/004 , G06T9/008 , G06T15/50 , G06T17/20 , G06T17/205
摘要： A method for encoding vertex orientations, also known as normal components, of a 3D mesh model comprises a first clustering of the normal components, determining for each of the first clusters a sphere sector to which most of its elements belong, mapping normal components to a predefined sector, re-clustering the normal components in the predefined sector into second clusters, determining predictors for the second clusters and encoding a normal component by its residual, a reference to its predictor and data indicating which of said mirror mapping operations were performed. A sphere sector is obtained by dividing a sphere into m equal spherical segments and dividing each of said spherical segments into n equal sectors. The first clustering for the sector mapping and the second clustering for predictive coding result in an improved compression ratio.
摘要翻译：用于编码3D网格模型的顶点取向（也称为正常分量）的方法包括正常分量的第一聚类，为每个第一簇确定其大多数元素所属的球面扇区，将正常分量映射到将预定义扇区中的正常分量重新聚类成第二簇，确定第二簇的预测变量并通过其残差对正态分量进行编码，对其预测器的引用以及指示执行所述镜像映射操作的数据。通过将球划分成m个相等的球形段并将每个所述球形段划分成n个相等的扇区来获得球面扇形。用于扇区映射的第一聚类和用于预测编码的第二聚类导致改进的压缩比。

97. 发明申请

US20150243051A1 WEIGHT BASED IMAGE PROCESSING 有权
标题翻译：基于重量的图像处理
公开(公告)号：US20150243051A1
公开(公告)日：2015-08-27
申请号：US14709821
申请日：2015-05-12
申请人： TELEFONAKTIEBOLAGET L M ERICSSON (PUBL)
发明人： Jacob Ström
IPC分类号： G06T9/00 , H04N19/186 , H04N19/176
CPC分类号： G06T9/00 , G06T9/001 , G06T9/004 , H04N19/105 , H04N19/176 , H04N19/186 , H04N19/593
摘要： In an image-encoding scheme, an input image is decomposed into several image blocks comprising multiple image elements. The image blocks are encoded into encoded block representations. In this encoding, color weights are assigned to the image elements in the block based on their relative positions in the block. At least two color codeword are determined, at least partly based on the color weights. These codewords are representations of at least two color values. The original colors of the image elements are represented by color representations derivable from combinations of the at least two color values weighted by the assigned color weights.
摘要翻译：在图像编码方案中，输入图像被分解为包括多个图像元素的若干图像块。图像块被编码成编码的块表示。在该编码中，基于块中的相对位置，将颜色权重分配给块中的图像元素。至少部分地基于颜色权重来确定至少两个颜色码字。这些码字是至少两个颜色值的表示。图像元素的原始颜色由通过由所分配的颜色权重加权的至少两个颜色值的组合导出的颜色表示来表示。

98. 发明授权

US09111333B2 Predictive position encoding 有权
标题翻译：预测位置编码
公开(公告)号：US09111333B2
公开(公告)日：2015-08-18
申请号：US14356233
申请日：2011-11-07
申请人： Wenfei Jiang , Kangying Cai , Teng Ma
发明人： Wenfei Jiang , Kangying Cai , Teng Ma
IPC分类号： G06T9/00 , G06T17/00 , G06T17/20 , G06T9/40
CPC分类号： G06T9/001 , G06T9/005 , G06T9/40 , G06T17/005 , G06T17/205 , G06T2207/20021
摘要： A method and apparatus for position coding of three dimensional mesh models are described including estimating a symbol probability of a non-empty-child-cell Cl,k, where Ql,k denotes the kth cell at layer l, wherein the symbol probability is estimated based on an accuracy of a fitted plane P, sub-dividing the non-empty-child-cell to produce a sub-cell, if the non-empty-child-cell has more than one vertex, determining if there are more unprocessed non-empty-child-cells at layer l, if there are no more unprocessed non-empty-child-cells at layer l, determining if all non-empty-child-cells at layer l have only one vertex and a distance between the center of the sub-cell and a point inside the sub-cell is less than or equal to a first threshold and entropy coding symbols representing a position of the non-empty-child-cells, if all non-empty-child-cells at layer l have only one vertex and the distance between the center of the sub-cell and the point inside the sub-cell is less than or equal to the first threshold.
摘要翻译：描述了用于三维网格模型的位置编码的方法和装置，包括估计非空子单元Cl的k的符号概率，其中，Q1，k表示第l层的第k个单元，其中估计符号概率基于拟合平面P的精度，如果非空子子单元具有多于一个顶点，则将非空子单元分割以产生子单元，确定是否存在更多未处理的非单元，如果层l上没有更多未处理的非空子小区，则确定层l上的所有非空小子单元是否只有一个顶点和中心之间的距离并且子单元内的点小于或等于第一阈值，并且如果在层上的所有非空子子单元都表示非空子子单元的位置，则熵编码表示非空子单元的位置的符号 l只有一个顶点，子单元的中心与子单元内的点之间的距离小于或等于到第一个阈值。

99. 发明申请

US20150229880A1 Video Share Model-Based Video Fixing 有权
标题翻译：视频分享基于模型的视频固定
公开(公告)号：US20150229880A1
公开(公告)日：2015-08-13
申请号：US14690556
申请日：2015-04-20
申请人： AT&T Intellectual Property II, L.P.
发明人： James Pratt , Sarah Everett , Marc Sullivan
IPC分类号： H04N7/14 , H04L29/06
CPC分类号： H04N7/147 , G06T9/001 , H04L65/602 , H04L65/80 , H04N19/14 , H04N19/17 , H04N19/40 , H04N19/46 , H04N21/234336 , H04N21/41407 , H04N21/4312 , H04N21/4314 , H04N21/631
摘要： Systems and methods for model-based video fixing are disclosed. A video can be retrieved and analyzed to determine if any portion of the video can be represented by a model. If a portion that can be modeled is identified, a model that approximates the portion can be specified, the portion can be removed from the video, and instructions for modeling the video can be formatted. The video and the instructions can be transmitted to a receiving device, which can synthesize the model and the received video to generate a model-based video. Systems for providing the model-based video fixing are also disclosed.
摘要翻译：公开了基于模型的视频固定的系统和方法。可以检索和分析视频以确定视频的任何部分是否可以由模型表示。如果可以建模的部分被识别，则可以指定近似该部分的模型，该部分可以从视频中移除，并且可以格式化用于对视频进行建模的指令。视频和指令可以被发送到接收设备，其可以合成模型和接收的视频以生成基于模型的视频。还公开了用于提供基于模型的视频固定的系统。

100. 发明授权

US09064345B2 Compressing data representing computer animated hair 有权
标题翻译：压缩表示计算机动画头发的数据
公开(公告)号：US09064345B2
公开(公告)日：2015-06-23
申请号：US13830943
申请日：2013-03-14
申请人： DreamWorks Animation LLC
发明人： Mark Jeffrey Matthews
IPC分类号： G06K9/00 , G06T13/40 , G06T9/00
CPC分类号： G06T13/40 , G06T9/001 , G06T9/008
摘要： Data representing animated hair in a computer generated imagery (CGI) scene may be compressed by treating hair data as arrays of parameters. Hair data parameters may include control vertices, hair color, hair radius, and the like. A principal component analysis (PCA) may be performed on the arrays of hair data. PCA may yield new basis vectors, varying in length, with the largest basis vector corresponding to a new dimension with the largest variance in hair data. The hair data may be quantized based on the varying lengths of new basis vectors. The number of bits allocated for quantizing each new dimension corresponding to each new basis vector may be determined based on the relative lengths of new basis vectors, with more bits allocated to dimensions corresponding to longer basis vectors. The quantized hair data may be bit-packed and then compressed using lossless entropy encoding.
摘要翻译：在计算机生成的图像（CGI）场景中表示动画头发的数据可以通过将头发数据视为参数数组来压缩。头发数据参数可以包括控制顶点，头发颜色，头发半径等。可以对头发数据阵列执行主成分分析（PCA）。 PCA可以产生长度不同的新的基本向量，其中对应于毛发数据中最大方差的新维度的最大基本向量。毛发数据可以基于新的基本向量的变化长度量化。可以基于新的基本向量的相对长度来确定分配用于量化对应于每个新的基本向量的每个新维度的比特数，其中更多比特被分配给对应于较长基本向量的维度。量化头发数据可以是位打包的，然后使用无损熵编码进行压缩。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式