-
1.发明授权System and method for recognizing scanned objects with deformable volumetric templates 有权用可变形体积模板识别扫描对象的系统和方法公开(公告)号：US06259815B1
公开(公告)日：2001-07-10
申请号：US09262376
申请日：1999-03-04
IPC分类号： G06K968
CPC分类号： G06K9/6206
摘要： A method recognizes three-dimensional physical objects using three-dimensional deformable templates. A particular object is scanned with a camera to generate volumetric data representing the object. The volumetric data is compared to each of a plurality of three-dimensional deformable templates stored in a database to obtain a score for each comparison. The deforming of the template is done by optimizing an objective function.
摘要翻译： 一种使用三维可变形模板识别三维物体的方法。 用相机扫描特定物体以产生表示物体的体积数据。 将体积数据与存储在数据库中的多个三维可变形模板中的每一个进行比较，以获得每个比较的得分。 通过优化目标函数来完成模板的变形。
-
公开(公告)号：US06741245B1
公开(公告)日：2004-05-25
申请号：US09298739
申请日：1999-04-23
IPC分类号： G06T1700
CPC分类号： G06T15/20 , A63F2300/6018 , A63H33/042 , B33Y80/00
摘要： A method for decorating a virtual world model first builds a physical model from a plurality of building blocks. Each building block includes a microcontroller coupled to a plurality of connectors. The connectros are for physically and electronically connecting the blocks in a three-dimensional structure to form the model. An arrangement of the blocks in the model is derived by connecting the model to a host computer. The arrangement is expressed as a set of logical axioms. The set of logical axioms is processed by a logic program to identify large scale structural elements of the model, and decorative attributes are assigned to the large. scale structural elements.
摘要翻译： 用于装饰虚拟世界模型的方法首先从多个构建块构建物理模型。 每个构建块包括耦合到多个连接器的微控制器。 连接器用于物理和电子连接三维结构中的块以形成模型。 通过将模型连接到主机来获得模型中的块的排列。 该安排被表达为一组逻辑公理。 一组逻辑公理由逻辑程序处理，以识别模型的大规模结构元素，并将装饰属性分配给大型。 规模结构要素。
-
公开(公告)号：US06526375B1
公开(公告)日：2003-02-25
申请号：US09298235
申请日：1999-04-23
IPC分类号： G06F944
CPC分类号： H05K7/1459 , B33Y50/00 , G06F15/803 , H01R13/514
摘要： In a self-configuring store-and-forward computer network, a plurality of processors are each housed in an enclosure having a top surface and a bottom surface. Each processor has an associated block identification number. An array of m by n radially symmetric connectors are arranged on the top surface and on the bottom surface of each enclosure. Each connector has an associated connector identification number. The connectors physically and electronically couple the plurality of processors as a three-dimensional structure. Communications controller in each of the processors exchange the block and connector identification numbers between the processors and a host computer to determine an ordered list of connector numbers that is used to route messages between any of the processors and the host computer.
摘要翻译： 在自配置存储和转发计算机网络中，多个处理器分别容纳在具有顶表面和底表面的外壳中。 每个处理器具有关联的块标识号。 在每个外壳的顶表面和底表面上布置了由n个径向对称连接器组成的阵列。 每个连接器都具有相关联的连接器标识号。 所述连接器以三维结构物理和电子方式耦合所述多个处理器。 每个处理器中的通信控制器在处理器和主计算机之间交换块和连接器标识号，以确定用于在任何处理器和主计算机之间路由消息的连接器号的有序列表。
-
公开(公告)号：US06466227B1
公开(公告)日：2002-10-15
申请号：US09388337
申请日：1999-09-01
IPC分类号： G09G500
CPC分类号： G06T1/20
摘要： A programmable visualization apparatus processes graphical data. The apparatus includes a central processing unit for executing a visualization application and a scheduler. A third level of memory is connected to the central processing unit. The third level of memory stores the graphical data. The graphical data is partitioned into a plurality of blocks. A second level of memory is connected to the central processing unit by a system bus. The second level of memory stores a sub-set of the plurality of blocks. A first level of memory is connected to the second level of memory by a memory bus. The scheduler stores an ordered list of blocks in the first level memory. A processor element is connected to the first level of memory by a processor bus. A dispatcher is connected to the first, the second, and the third memories and the processor element. The dispatcher transfers blocks from the third, to the second, and from the second to the third level memories according to the order of the list of blocks.
摘要翻译： 可编程可视化装置处理图形数据。 该装置包括用于执行可视化应用程序和调度器的中央处理单元。 第三级存储器连接到中央处理器。 第三级存储器存储图形数据。 图形数据被分割成多个块。 第二级存储器通过系统总线连接到中央处理单元。 第二级存储器存储多个块的子集。 第一级存储器通过存储器总线连接到第二级存储器。 调度器将有序的块列表存储在第一级存储器中。 处理器元件通过处理器总线连接到第一级存储器。 调度器连接到第一，第二和第三存储器和处理器元件。 调度器根据块列表的顺序将块从第三层传送到第二层，从第二层到第三层的存储器。
-
公开(公告)号：US5748844A
公开(公告)日：1998-05-05
申请号：US333728
申请日：1994-11-03
申请人： Joseph W. Marks
发明人： Joseph W. Marks
CPC分类号： G06F17/509 , G06F17/5072 , Y10S706/919 , Y10S706/921
摘要： A system is disclosed for computing an initial partition of a graph comprising nodes and the edges that connect the nodes. In one embodiment this initial partition is presented for subsequent use by the Kernighan-Lin system of graph partitioning. The Subject System uses a combination of a seed-growth heuristic and a stochastic-search process to compute an initial partition. The seed-growth heuristic builds a partition by iteratively augmenting an initial set of seed nodes. The search process searches for good sets of seed nodes to use. The resulting combination of seed-growth heuristic, stochastic-search process, and the Kernighan-Lin algorithm constitutes a superior system for partitioning graphs. The Subject System can be applied to graph-partitioning problems that arise in circuit design, computer architecture, routing in computer networks, database design, distributed and parallel processing, and many other domains.
摘要翻译： 公开了一种用于计算包括节点和连接节点的边缘的图的初始分区的系统。 在一个实施例中，该初始分区被呈现给Kernighan-Lin系统的图划分的后续使用。 主题系统使用种子生长启发式和随机搜索过程的组合来计算初始分区。 种子生长启发式通过迭代地增加初始的种子节点集来构建分区。 搜索过程搜索要使用的好组种子节点。 所得到的种子生长启发式，随机搜索过程和Kernighan-Lin算法的组合构成了用于分区图的优越系统。 主题系统可以应用于电路设计，计算机架构，计算机网络中的路由，数据库设计，分布式和并行处理等许多领域中出现的图形分割问题。
-
公开(公告)号：US06832129B2
公开(公告)日：2004-12-14
申请号：US10374194
申请日：2003-02-26
IPC分类号： G06F1700
CPC分类号： B65B57/10 , Y10S414/114
摘要： A method packs input rectangles into a target rectangle. The rectangles are permuted into one or more an ordered list according to dimensions of the rectangles, e.g., width, height, perimeter, and area. The rectangles are then marked as unaccepted. A next unaccepted rectangle is selected from the ordered list beginning with a first rectangle in the list. Accepting the next rectangle if it is the last unaccepted rectangles, and otherwise, accepting the next rectangle with a probability p, and marking the next rectangle as accepted, and repeating the steps until all rectangles have been accepted.
摘要翻译： 方法将输入矩形包装到目标矩形中。 根据矩形的尺寸，例如宽度，高度，周长和面积，矩形被排列成一个或多个有序列表。 然后将矩形标记为不接受。 从列表中的第一个矩形开始的有序列表中选择下一个不接受的矩形。 接受下一个矩形，如果它是最后一个未被接受的矩形，否则，接受下一个矩形概率p，并将下一个矩形标记为接受，并重复步骤，直到所有矩形都被接受。
-
7.发明授权Interactive heuristic search and visualization for solving combinatorial optimization problems 失效用于求解组合优化问题的交互式启发式搜索和可视化公开(公告)号：US06826549B1
公开(公告)日：2004-11-30
申请号：US09433422
申请日：1999-11-04
申请人： Joseph W. Marks , Neal B. Lesh , David Ratajczak
发明人： Joseph W. Marks , Neal B. Lesh , David Ratajczak
IPC分类号： G06F1700
CPC分类号： G06T11/206
摘要： A system enables an interactively guided heuristic search for solving a combinatorial optimization problem. The system initially performs a hill-climbing search on the combinatorial optimization problem to obtain a solution using initial default parameters. The current solution and the combinatorial optimization problem are visualized on an optimization table, a table-top display device. The parameters are altered based on the visualization of the combinatorial optimization problem and the current solution. Then, the searching, visualizing, and setting are repeated until the solution is selected as an acceptable solution of the combinatorial optimization problem. During the repeating, the parameters can be a set of probabilities, and in which case the search is a random perturbation-based search. Alternatively, the parameters can be a set of priorities, in which case the search is an exhaustive local search.
摘要翻译： 一个系统能够进行交互式引导的启发式搜索来求解组合优化问题。 系统首先对组合优化问题进行爬山搜索，以获得使用初始默认参数的解决方案。 当前的解决方案和组合优化问题在优化表，桌面显示设备上可视化。 基于组合优化问题的可视化和当前的解决方案，参数被改变。 然后，重复搜索，可视化和设置，直到选择解为组合优化问题的可接受的解决方案。 在重复时，参数可以是一组概率，在这种情况下，搜索是基于随机扰动的搜索。 或者，参数可以是一组优先级，在这种情况下，搜索是详尽的本地搜索。
-
8.发明授权Temporal and spatial coherent ray tracing for rendering scenes with sampled and geometry data 失效使用采样和几何数据渲染场景的时间和空间相干光线跟踪公开(公告)号：US06556200B1
公开(公告)日：2003-04-29
申请号：US09388338
申请日：1999-09-01
IPC分类号： G06T1550
摘要： A method traces rays through graphical data. The method partitions the graphical data into a plurality of blocks according to a scheduling grid. For each block, a ray queue is generated. Each entry in the ray queue representing a ray to be traced through the block. The ray queues are ordered spatially and temporally using a dependency graph. The rays are traced through the blocks according to the ordered list.
摘要翻译： 一种方法通过图形数据跟踪光线。 该方法根据调度网格将图形数据分割成多个块。 对于每个块，生成射线队列。 射线队列中的每个条目表示要通过块追踪的射线。 射线队列使用依赖图在空间和时间上排序。 根据有序列表，光线通过块进行跟踪。
-
公开(公告)号：US5553214A
公开(公告)日：1996-09-03
申请号：US111153
申请日：1993-08-24
CPC分类号： G06T11/00
摘要： A system for delineating partially- or fully-bounded areal regions of a map utilizes deformable templates, which it dynamically expands and contorts to conform to the boundaries of the regions. The system segments the map into a number of cells, with each cell relating, for example, to a pixel. The system then defines an "energy" field for the floor plan by assigning cells corresponding to boundary edges predetermined minimum energy values, cells corresponding to boundary interiors predetermined maximum energy values, and each non-boundary cell an energy value defined by the distance of the cell from the closest boundary edge cell. The system then iteratively manipulates a template over a selected region of the floor plan in an attempt to minimize the "potential" of the template, which is defined by a potential function that includes a "total energy score" and various size and test terms that encourage desired template deformations. The system determines the total energy score, by (i) scan converting the template sides, (ii) weighting the energy values of the cells through which the sides pass based on the lengths of the sides passing through the cells, and (iii) summing the scores. After determining the potential for all possible new locations for each of the vertices, the system selects next locations for each of the vertices and, as necessary, moves the vertices to these next locations to complete an iteration. At various times, the system raises the energy field and updates the template by altering the number of vertices. The system ends its manipulations of the template when it has performed a predetermined number of iterations or, in an energy field at its ceiling values, either the template vertices do not move between iterations or the potential of the template does not change. A user may then edit the template to conform the template more closely to the selected region. A user may also specify certain constraints on template deformation. In response, the system uses a modified potential function for controlling the deformation of the template.
-
10.发明授权Apparatus for determining the structure of a hypermedia document using graph partitioning 失效用于使用图形划分来确定超媒体文档的结构的装置
公开(公告)号：US5546517A
公开(公告)日：1996-08-13
申请号：US350656
申请日：1994-12-07
CPC分类号： G06F17/30014
摘要： Apparatus for determining the structure of a hypermedia document containingext and graphics that are to be laid out on several linked pages includes a system that specifies the assignment of text and graphics to pages and the links between the pages via a reduction to graph partitioning and the use of optimization techniques for graph partitioning. In one embodiment, display items and relations between these display items are listed along with a measure of their importance. These factors are captured in terms of numeric weights for edges between nodes in the associated graph to permit the system to assign display items to pages, and determine which pages should be linked, so that a user can move between pages in the most efficient manner. In a further embodiment, to accommodate limited display area that restricts the number of display items and page links that can be displayed simultaneously, the system can take into account multistage page moves that allow the user to access display items on different pages in sequence by moving from one page to another via links on other pages, through the use of "stepping-stone" nodes in the associated graph that record possible traversal routes in the document that are not represented in other formulations of the hypermedia-document-layout task.
摘要翻译： 用于确定包含要在多个链接页面上布置的文本和图形的超媒体文档的结构的装置包括一个系统，其通过减少到图形划分来指定文本和图形到页面和页面之间的链接的分配，以及 使用图分割的优化技术。 在一个实施例中，显示项目和这些显示项目之间的关系以及其重要性的度量被列出。 这些因素是根据关联图中的节点之间的边缘的数字权重来获取的，以允许系统将显示项目分配给页面，并确定应链接哪些页面，以便用户可以以最有效的方式在页面之间移动。 在另一个实施例中，为了适应限制可同时显示的显示项目和页面链接的数量的有限显示区域，系统可以考虑允许用户通过移动来顺序地访问不同页面上的显示项目的多页面移动 通过使用关联图中的“踏脚石”节点来记录其他页面上的链接，从而在文档中记录可能的遍历路由，这些路径在超媒体文档布局任务的其他配方中未被表示。
-
-
-
-
-
-
-
-
-
搜索结果
11 条记录 (耗时 0.021 秒)