公开(公告)号：US20050110679A1

公开(公告)日：2005-05-26

申请号：US10705104

申请日：2003-11-10

Applicant: Matthew Brand

Inventor： Matthew Brand

IPC: G01C11/00 ,  G01C11/06 ,  G01C9/00 ,  G06F15/00

CPC classification number: G01C11/06

Abstract: A method determines poses of a sensors distributed in an environment. A signal of the environment is acquired by each sensor. Features in each signal that correspond to the features in at least one other signal are identified. Directions between the sensors and the corresponding features are determined. Nullspaces of the directions are used to construct a matrix. A nullspace eigenvector is determined of the matrix, and then the nullspace eigenvector is reconfigured to a matrix specifying the locations of the sensors.

Abstract translation: 一种方法确定在环境中分布的传感器的姿势。 每个传感器获取环境信号。 识别对应于至少一个其他信号中的特征的每个信号中的特征。 确定传感器与相应特征之间的方向。 方向的空格用于构造矩阵。 确定矩阵的零空间特征向量，然后将空空间特征向量重新配置为指定传感器位置的矩阵。

公开(公告)号：US06650335B2

公开(公告)日：2003-11-18

申请号：US09790839

申请日：2001-02-22

Applicant: Matthew Brand

Inventor： Matthew Brand

IPC: G09G500

CPC classification number: G06T15/04

Abstract: A method constructs a super-resolution texture from a sequence of images of a non-rigid three-dimensional object. A shape of the object is represented as a matrix of vertices, and a basis of possible deformations of the object is represented as a matrix of displacements of the 3D points, the matrices of 3D points and displacements form a model of the object in the video. A set of correspondences between the points in model and the object in the images is formed. The points in each image are connected using the set of correspondences to form a triangle texture mesh for each image. Each triangle mesh is warped to a common coordinate system while super-sampling texture in each image. The warped and super-sampled triangle meshes are averaged to produce the super-sampled texture of the object in the image.

Abstract translation: 一种方法从非刚性三维物体的图像序列构建超分辨率纹理。 物体的形状被表示为顶点的矩阵，并且对象的可能变形的基础被表示为3D点的位移矩阵，3D点和位移的矩阵形成视频中对象的模型 。 形成了模型中的点与图像中的对象之间的一组对应关系。 每个图像中的点使用一组对应关系来形成每个图像的三角形纹理网格。 每个三角形网格都变形为一个共同的坐标系，同时对每个图像进行超采样纹理。 将翘曲和超采样三角形网格平均以产生图像中对象的超采样纹理。

公开(公告)号：US06459808B1

公开(公告)日：2002-10-01

申请号：US09358453

申请日：1999-07-21

Applicant: Matthew Brand

Inventor： Matthew Brand

IPC: G06K900

CPC classification number: G06N99/005

Abstract: A method infers a target path in a target system from a cue path. The method learns a target state machine, target probability density functions and an occupancy matrix of the state machine from training target paths. Cue probability density functions are learned from a training cue path and the target occupancy matrix. A cue path is analyzed using the cue probability density functions and the target state machine to produce hidden states of the cue path. The target path is synthesized from the hidden states of the cue path and the target probability density functions.

Abstract translation: 一种方法从提示路径推断目标系统中的目标路径。 该方法从训练目标路径学习目标状态机，目标概率密度函数和状态机的占用矩阵。 从训练提示路径和目标占用矩阵中学习提示概率密度函数。 使用提示概率密度函数和目标状态机分析提示路径，以产生提示路径的隐藏状态。 目标路径由提示路径的隐藏状态和目标概率密度函数合成。

公开(公告)号：US08950555B2

公开(公告)日：2015-02-10

申请号：US13091394

申请日：2011-04-21

Applicant: Matthew Brand

Inventor： Matthew Brand

IPC: B66B1/18 ,  B66B1/24

CPC classification number: B66B1/2458 ,  B66B2201/213 ,  B66B2201/215 ,  B66B2201/222

Abstract: A set of cars in an elevator system are scheduled by assigning passengers to the cars such that a current schedule for each car does not exceed a predetermined maximum number of stops per round trip, and the car is filled as near as possible to a maximum capacity at a predetermined bottleneck.

Abstract translation: 通过将乘客分配给汽车来安排电梯系统中的一组汽车，使得每个汽车的当前时间表不超过每次往返的预定最大停止次数，并且轿厢被尽可能地填充到最大容量 处于预定的瓶颈。

公开(公告)号：US20140005822A1

公开(公告)日：2014-01-02

申请号：US13535271

申请日：2012-06-27

Applicant: Tyler W. Garaas ,  Matthew Brand ,  Cibulka Josef

Inventor： Tyler W. Garaas ,  Matthew Brand ,  Cibulka Josef

IPC: B23K26/38 ,  G05B15/02

CPC classification number: B23K26/38 ,  G05B15/02 ,  G05B19/4061 ,  G05B2219/36199 ,  G05B2219/49157

Abstract: Locations in a pattern of a part are evaluated to determine if the locations are interior or exterior to a feature of the pattern. The pattern is used to cut the feature from a material by a laser cutting machine. A location in the feature is rendered into an array stored in a memory so that a value stored at an address in the array corresponding to coordinates of the location is either odd or even as determined by a counting process of the rendering. Then, the location is identified as being interior if the value is odd, and as being exterior if the value is even. The rendering can use modified forms of either rasterization or ray casting.

Abstract translation: 评估部件图案中的位置以确定位置是否是图案特征的内部或外部。 该图案用于通过激光切割机从材料切割特征。 特征中的位置被渲染成存储在存储器中的阵列，使得存储在对应于该位置的坐标的阵列中的地址的值是奇数或偶数，如通过渲染的计数处理所确定的。 然后，如果值是奇数，则将该位置识别为内部，并且如果该值是均匀的，则将其定义为外部。 渲染可以使用光栅化或光线投射的修改形式。

公开(公告)号：US08554343B2

公开(公告)日：2013-10-08

申请号：US12962744

申请日：2010-12-08

Applicant: Matthew Brand ,  Vijay Shilpiekandula ,  Scott A Bortoff

Inventor： Matthew Brand ,  Vijay Shilpiekandula ,  Scott A Bortoff

IPC: G05B13/02

CPC classification number: G05B13/048

Abstract: A method solves a quadratic programming (QP) problem in real-time implementations of model predictive control for automation applications. The method can be implemented for fine-grained parallel solutions. Due to the extreme simplicity of the method, even serial implementations offer considerable speed advantages. The method solves the problem by formulating, over a predetermined time interval, an optimization problem with a quadratic cost function, and linear state and control constraints as a quadratic program for the application. Then, the quadratic program is solved by applying a parallel quadratic programming update law starting from a positive initial estimate to obtain control actions for the application.

Abstract translation: 一种方法解决了自动化应用中模型预测控制的实时实现中的二次规划（QP）问题。 该方法可以实现细粒度并行解决方案。 由于该方法非常简单，即使串行实现也提供了相当快的优势。 该方法通过在预定的时间间隔内通过二次成本函数，线性状态和控制约束作为应用程序的二次方案来制定问题。 然后，通过应用从正初始估计开始的并行二次规划更新定律来求解二次程序，以获得应用的控制动作。

公开(公告)号：US20120206440A1

公开(公告)日：2012-08-16

申请号：US13026750

申请日：2011-02-14

Applicant: Dong Tian ,  Anthony Vetro ,  Matthew Brand

Inventor： Dong Tian ,  Anthony Vetro ,  Matthew Brand

IPC: G06T15/00

CPC classification number: G06T15/205 ,  H04N13/275

Abstract: An image for a virtual view of a scene is generated based on a set of texture images and a corresponding set of depth images acquired of the scene. A set of candidate depth values associated with each pixel of a selected image is determined. For each candidate depth value, a cost that estimates a synthesis quality of the virtual image is determined. The candidate depth value with a least cost is selected to produce an optimal depth value for the pixel. Then, the virtual image is synthesized based on the optimal depth value of each pixel and the texture images.

Abstract translation: 基于一组纹理图像和从该场景获取的对应的一组深度图像来生成用于场景的虚拟视图的图像。 确定与所选图像的每个像素相关联的一组候选深度值。 对于每个候选深度值，确定估计虚拟图像的合成质量的成本。 选择具有最小成本的候选深度值以产生用于像素的最佳深度值。 然后，基于每个像素的最佳深度值和纹理图像来合成虚拟图像。

公开(公告)号：US20120118673A1

公开(公告)日：2012-05-17

申请号：US12948057

申请日：2010-11-17

Applicant: Matthew Brand

Inventor： Matthew Brand

IPC: B66B1/18

CPC classification number: B66B1/2466 ,  B66B5/0031

Abstract: A motion of a first car and a second car in a multi-car elevator system, wherein the first car and the second car move independently in an elevator shaft, is controlled by generating a command to move the first car according to a first deceleration curve, if a relationship between a position and a velocity of the first car corresponds to a value on the first deceleration curve; and by generating a command to move the second car according to a second deceleration curve, if a relationship between position and a velocity of the second car corresponds to a value on the second deceleration curve, wherein a distance between the first and the second deceleration curve is equals or greater than a minimum distance.

Abstract translation: 第一轿厢和第二轿厢在多轿厢电梯系统中的运动，其中第一轿厢和第二轿厢在电梯井中独立地移动，通过产生根据第一减速曲线移动第一轿厢的命令来控制 如果第一轿厢的位置和速度之间的关系对应于第一减速曲线上的值， 并且如果第二轿厢的位置与速度的关系对应于第二减速曲线上的值，则通过产生用于根据第二减速曲线移动第二轿厢的命令，其中，第一和第二减速曲线之间的距离 等于或大于最小距离。

公开(公告)号：US20100329542A1

公开(公告)日：2010-12-30

申请号：US12495655

申请日：2009-06-30

Applicant: Srikumar Ramalingam ,  Matthew Brand ,  Sofien Bouaziz

Inventor： Srikumar Ramalingam ,  Matthew Brand ,  Sofien Bouaziz

IPC: G06K9/00 ,  H04N7/18

CPC classification number: G06K9/00704 ,  G01C21/3602 ,  G06K9/00208 ,  G06T7/162 ,  G06T7/194 ,  G06T7/80 ,  G06T2207/20016 ,  G06T2207/30244

Abstract: A location and orientation in an environment is determined by first acquiring a real omni-directional image of an unknown skyline in the environment. A set of virtual omni-directional images of known skylines are synthesized from a 3D model of the environment, wherein each virtual omni-directional image is associated with a known location and orientation. The real omni-directional image with each virtual omni-directional images to determine a best matching virtual omni-directional image with the associated known location and orientation.

Abstract translation: 通过首先在环境中获取未知天际线的真正全方位图像来确定环境中的位置和方位。 已知天际线的一组虚拟全方向图像是从环境的3D模型合成的，其中每个虚拟全向图像与已知的位置和取向相关联。 使用每个虚拟全方位图像的真正全方位图像，以确定与相关联的已知位置和方向的最佳匹配虚拟全方位图像。

公开(公告)号：US07822029B2

公开(公告)日：2010-10-26

申请号：US12271200

申请日：2008-11-14

Applicant: Matthew Brand ,  Andreas F. Molisch

Inventor： Matthew Brand ,  Andreas F. Molisch

IPC: H04L12/56

CPC classification number: H04W40/08 ,  Y02D70/22 ,  Y02D70/324

Abstract: A method routs a packet from a source node, via relay nodes, to a destination node. The nodes are connected by wireless links x. A channel power gain γ is measured for each link x. Resource trade-off curves y=f(x) are constructed for each link x from the channel power gains γ, wherein y represents a set of resources. A hyperbolic upper bound h/x+c is fitted to each resource curve, such that h/x+c≧f(x), wherein h is a scale factor, and c is an offset. A route with an optimal resource allocation is selected according to the hyperbolic upper bounds. Then, the packet is transmitted from the source node to the destination node using the route.

Abstract translation: 方法将来自源节点的分组经由中继节点路由到目的地节点。 节点通过无线链路x连接。 对于每个链路x测量信道功率增益γ。 对于来自信道功率增益γ的每个链路x构造资源权衡曲线y = f（x），其中y表示一组资源。 双曲线上限h / x + c适合于每个资源曲线，使得h / x +c≥f（x），其中h是比例因子，c是偏移。 根据双曲线上限选择具有最佳资源分配的路由。 然后，使用该路由从源节点向目的地节点发送分组。