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

1. 发明授权

US08155048B2 Resource allocation for rateless transmissions 有权
标题翻译：无源传输的资源分配
公开(公告)号：US08155048B2
公开(公告)日：2012-04-10
申请号：US12413504
申请日：2009-03-27
申请人： Matthew E. Brand
发明人： Matthew E. Brand
IPC分类号： H04B7/14
CPC分类号： H04B7/2606 , H04W40/08 , Y02D70/22 , Y02D70/324 , Y02D70/449
摘要： A method transmits a message of a source entropy from a source node, via a set of relay nodes, to a destination node, the set of relay nodes includes a node and a next node connected by a wireless link, wherein the next node is guaranteed to receive accumulated nats from one or more previous transmissions of the message, in which a transmission of the message from the node to the next node includes determining the accumulated nats guaranteed to be received by the next node; calculating minimal nats of the message to be transmitted from the node to the next node, such that a sum of the minimal nats and the accumulated nats is not less than the source entropy; and transmitting the message having the minimal nats from the node to the next node.
摘要翻译：一种方法是将来自源节点的源熵的消息经由一组中继节点发送到目的节点，该中继节点包括一个节点和一个由无线链路连接的下一个节点，其中下一个节点被保证从所述消息的一个或多个先前传输接收累积的nats，其中从所述节点到所述下一个节点的所述消息的传输包括确定保证由所述下一个节点接收的累积的nats; 计算要从节点发送到下一个节点的消息的最小值，使得最小燕麦和累积的猫的总和不小于源熵; 以及将具有最小nats的消息从所述节点发送到所述下一个节点。

2. 发明授权

US07756021B2 Method for finding minimal cost paths under uncertainty 有权
标题翻译：在不确定性下找到最小成本路径的方法
公开(公告)号：US07756021B2
公开(公告)日：2010-07-13
申请号：US11493198
申请日：2006-07-26
申请人： Evdokia V. Nikolova , Matthew E. Brand
发明人： Evdokia V. Nikolova , Matthew E. Brand
IPC分类号： H04J1/16 , H04J3/14
CPC分类号： H04L45/12 , H04L45/121
摘要： A computer implemented method finds a path having a minimal expected cost through a network of nodes connected by arcs, in which the path is from a source node to a destination node, and in which a traversal time for traversing each arc is a random variable. An expected cost of traversing each possible path from the source node to the destination node is determined as an average value of a nonlinear cost function applied to each possible total travel time for traversing the path. The expected cost is weighted according to a probability of each possible total travel time. For each node in the network and for each possible time to start, a particular path from the source node to the node having a minimal expected cost and an optimal time to start on that path is determined.
摘要翻译：计算机实现的方法通过由弧连接的节点网络找到具有最小预期成本的路径，其中路径从源节点到目的地节点，并且其中遍历每个弧的遍历时间是随机变量。将从源节点到目的地节点的每个可能路径的预期成本确定为应用于遍历路径的每个可能的总行进时间的非线性成本函数的平均值。预期成本根据每个可能的总旅行时间的概率加权。对于网络中的每个节点以及每个可能的时间开始，确定从源节点到具有最小预期成本的节点和在该路径上开始的最佳时间的特定路径。

3. 发明授权

US07359550B2 Incremental singular value decomposition of incomplete data 有权
标题翻译：不完全数据的增量奇异值分解
公开(公告)号：US07359550B2
公开(公告)日：2008-04-15
申请号：US10124902
申请日：2002-04-18
申请人： Matthew E. Brand
发明人： Matthew E. Brand
IPC分类号： G06K9/00
CPC分类号： G06K9/6247 , G06F17/16 , G10L25/48
摘要： A method models data values acquired by measuring a natural phenomena. Samples are acquired of the natural phenomena, each sample is arranged as a vector c of the data values. Some of the data values may be missing. The vectors c are decomposed into five matrices, respectively, a subspace Upxr, singular values srxl, an encoding Vqxr, a subspace rotation U′rxr, an encoding transform V′rxr, where p indicates the number of discrete data values in each sample, q is a number of samples, and r is a rank of a decomposition of the data values. The five matrices can then be multiplied according to UU′diag(s)V′TVT to obtain a best linear approximation of the natural phenomena for any value of r less than both p and q, where T is a matrix transpose operator.
摘要翻译：一种通过测量自然现象获得的数据值的方法。样本是自然现象的获取，每个样本被排列成数据值的向量c。某些数据值可能会丢失。向量c分别被分解为五个矩阵，子空间U pxr，奇异值s x，x x，x n，子空间旋转其中p表示每个样本中的离散数据值的数量，q是样本数，r是秩的数据值的分解。然后，可以根据UU'diag（s）V'T V T来乘以五个矩阵以获得对于r的任何值的自然现象的最佳线性近似比较p和q，其中^{T 是矩阵转置运算符。}

4. 发明授权

US08380010B2 Content aware resizing of images and videos 有权
标题翻译：内容意识到调整图像和视频的大小
公开(公告)号：US08380010B2
公开(公告)日：2013-02-19
申请号：US12671531
申请日：2008-11-12
申请人： Michael Rubenstein , Arial Shamir , Shmuel Avidan , Matthew E. Brand
发明人： Michael Rubenstein , Arial Shamir , Shmuel Avidan , Matthew E. Brand
IPC分类号： G06K9/32 , G06K15/02
CPC分类号： G06T3/0012
摘要： A method resizes input images by first constructing a grid graph. The grid graph includes one node for each pixel in the input image, and adjacent nodes in the grid graph are connected by arcs. Each arc is directed and has an associated cost. A cut is applied to the arcs of the grid graph using a cost function. A seam of pixels is determined from the cut so that coordinates of the pixels in the seam enforce monotonicity and connectivity constraints. Then, the input image is resized according to the seam to produce an output image while minimizing a change of energy in the output image when compared with the input image.
摘要翻译：通过首先构建网格图来调整输入图像的大小。网格图包括输入图像中每个像素的一个节点，网格图中的相邻节点通过弧连接。每个弧都被定向并具有相关的成本。使用成本函数对网格图的弧进行切割。从切割确定像素的接缝，使得接缝中的像素的坐标实现单调性和连接性约束。然后，根据接缝调整输入图像的大小，以产生输出图像，同时最小化与输入图像相比时输出图像中的能量变化。

5. 发明授权

US08290298B2 Method for temporally editing videos 有权
标题翻译：暂时编辑影片的方法
公开(公告)号：US08290298B2
公开(公告)日：2012-10-16
申请号：US12413744
申请日：2009-03-30
申请人： Matthew E. Brand
发明人： Matthew E. Brand
IPC分类号： G06K9/36 , G06K9/03
CPC分类号： G06T3/0093 , G11B27/034 , G11B27/036
摘要： A method edits an input video to produce an output video. Pixels of the input video are partitioned into sets of pixels, wherein the pixels in the sets are adjacent, and for each set of pixels performing the following steps. A trellis having nodes connected by directed links is constructed. Each node corresponds to one of the pixels in the set of pixels, and each node is associated with an action and location of the pixel in the output image. Costs are assigned to the nodes and the links, wherein the costs are on apparent motion in the input video. A least cost path is determined through the trellis. Then, for each node on the path, apply the action associated the node to the corresponding pixel in the input video to edit the corresponding pixel at the location in the output video associated with the node.
摘要翻译：一种方法编辑输入视频以产生输出视频。输入视频的像素被划分为像素集合，其中集合中的像素是相邻的，并且对于执行以下步骤的每组像素。构建了具有通过定向链路连接的节点的网格。每个节点对应于像素集合中的像素之一，并且每个节点与输出图像中的像素的动作和位置相关联。成本被分配给节点和链路，其中成本在输入视频中是明显的运动。通过网格确定最低成本路径。然后，对于路径上的每个节点，将与节点相关联的动作应用于输入视频中的对应像素，以编辑与节点相关联的输出视频中的位置处的对应像素。

6. 发明授权

US08160396B2 Method and apparatus for touching-up images 有权
标题翻译：触摸图像的方法和装置
公开(公告)号：US08160396B2
公开(公告)日：2012-04-17
申请号：US11951422
申请日：2007-12-06
申请人： Matthew E. Brand , Patrick Pletscher
发明人： Matthew E. Brand , Patrick Pletscher
IPC分类号： G06K9/62 , G06K9/40 , G06K9/32
CPC分类号： G06K9/6297 , H04N5/23229
摘要： A method and camera apparatus touches up a source image to produce a target image. The source image is partitioned into non-overlapping tiles of pixels. Each tile is labeled. A probability distribution of the labels is inferred, in which the probability distribution is a conditional random field. Weights are determined from the conditional random field. Then, each tile of the source image is transformed according to the weights to produce a corresponding tile of a target image. The transforming maximizes a conditional likelihood of the target image given the source image, while marginalizing over all possible labelings of the source image.
摘要翻译：方法和相机装置触摸源图像以产生目标图像。源图像被分割成不重叠的像素块。每个瓷砖都贴上标签。推测标签的概率分布，其中概率分布是条件随机场。权重由条件随机字段决定。然后，根据权重来变换源图像的每个块，以产生目标图像的相应块。变换使源图像的目标图像的条件似然值最大化，同时边缘化源图像的所有可能的标记。

7. 发明申请

US20090175171A1 METHOD FOR FINDING OPTIMAL PATHS USING A STOCHASTIC NETWORK MODEL 有权
标题翻译：使用STOCHASTIC网络模型寻找最佳方法的方法
公开(公告)号：US20090175171A1
公开(公告)日：2009-07-09
申请号：US11512849
申请日：2006-08-30
申请人： Evdokia V. Nikolova , Matthew E. Brand , Michael Mitzenmacher
发明人： Evdokia V. Nikolova , Matthew E. Brand , Michael Mitzenmacher
IPC分类号： H04J3/14
CPC分类号： H04L45/12 , H04L45/121 , H04L45/122 , H04L45/14
摘要： A method finds an optimal path from a source to a destination. The possible paths from the source to the destination are represented as a stochastic graph of nodes connected by edges. Each edge has an independent probability distribution over a cost of the edge. A constraint for reaching the destination is defined. The graph is reduced to a relatively small set of deterministic minimum cost problems, which can be solved to determine an optimal path that maximizes a probability of reaching the destination within the constraint.
摘要翻译：一种方法找到从源到目标的最佳路径。从源到目的地的可能路径被表示为通过边连接的节点的随机图。每个边缘在边缘成本上具有独立的概率分布。定义到达目的地的约束。该图被减少到相对小的一组确定性最小成本问题，其可以被解决以确定最大化在约束内到达目的地的概率的最优路径。

8. 发明申请

US20080308361A1 Method and System for Determining Instantaneous Peak Power Consumption in Elevator Banks 有权
标题翻译：确定电梯银行瞬时峰值功耗的方法和系统
公开(公告)号：US20080308361A1
公开(公告)日：2008-12-18
申请号：US11761683
申请日：2007-06-12
申请人： Daniel N. Nikovski , Matthew E. Brand
发明人： Daniel N. Nikovski , Matthew E. Brand
IPC分类号： B66B1/18
CPC分类号： B66B1/2458 , B66B2201/102 , B66B2201/211 , B66B2201/212 , B66B2201/216 , B66B2201/222 , Y02B50/122
摘要： A method and system determine peak power consumption over time by a bank of elevator for servicing a set of passenger hall calls and delivery requests, and selecting elevator schedules that keep peak power consumption below a predetermined threshold. For each car in response to receiving a hall call, a set of all possible paths to service all hall calls assigned to the car are determined, in which each path includes a set of all possible segments. A peak power consumption for each possible segment is also determined. The peak power consumptions for the set of all possible segments for each time instant are added to determine a total peak power consumption for each time instant, and a particular path is selected as a schedule to operate the bank of elevator cars, if the total peak power consumption for any instant in time while operating according to the selected schedule is below a predetermined threshold.
摘要翻译：一种方法和系统确定由电梯组提供的用于服务一组乘客大厅呼叫和递送请求的时间的峰值功率消耗，以及选择使峰值功率消耗低于预定阈值的电梯时间表。对于每个轿厢响应于接收到一个门厅呼叫，确定一组所有可能的路径来服务分配给轿厢的所有门厅呼叫，其中每个路径包括一组所有可能的段。每个可能的段的峰值功率消耗也被确定。添加每个时刻的所有可能段的集合的峰值功率消耗以确定每个时刻的总峰值功耗，并且选择特定路径作为操作电梯轿厢组的调度，如果总峰值根据所选择的时间表操作时的任何时刻的功率消耗低于预定阈值。

9. 发明申请

US20080025222A1 Method for finding minimal cost paths under uncertainty 有权
标题翻译：在不确定性下找到最小成本路径的方法
公开(公告)号：US20080025222A1
公开(公告)日：2008-01-31
申请号：US11493198
申请日：2006-07-26
申请人： Evdokia V. Nikolova , Matthew E. Brand
发明人： Evdokia V. Nikolova , Matthew E. Brand
IPC分类号： H04J3/14 , H04L12/28
CPC分类号： H04L45/12 , H04L45/121
摘要： A computer implemented method finds a path having a minimal expected cost through a network of nodes connected by arcs, in which the path is from a source node to a destination node, and in which a traversal time for traversing each arc is a random variable. An expected cost of traversing each possible path from the source node to the destination node is determined as an average value of a nonlinear cost function applied to each possible total travel time for traversing the path. The expected cost is weighted according to a probability of each possible total travel time. For each node in the network and for each possible time to start, a particular path from the source node to the node having a minimal expected cost and an optimal time to start on that path is determined.
摘要翻译：计算机实现的方法通过由弧连接的节点网络找到具有最小预期成本的路径，其中路径从源节点到目的地节点，并且其中遍历每个弧的遍历时间是随机变量。将从源节点到目的地节点的每个可能路径的预期成本确定为应用于遍历路径的每个可能的总行进时间的非线性成本函数的平均值。预期成本根据每个可能的总旅行时间的概率加权。对于网络中的每个节点以及每个可能的时间开始，确定从源节点到具有最小预期成本的节点和在该路径上开始的最佳时间的特定路径。

10. 发明授权

US07006944B2 Method for determining poses of sensors 有权
标题翻译：确定传感器姿态的方法
公开(公告)号：US07006944B2
公开(公告)日：2006-02-28
申请号：US10705104
申请日：2003-11-10
申请人： Matthew E. Brand
发明人： Matthew E. Brand
IPC分类号： G01C17/00 , G01S3/02
CPC分类号： G01C11/06
摘要： 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.
摘要翻译：一种方法确定在环境中分布的传感器的姿势。每个传感器获取环境信号。识别对应于至少一个其他信号中的特征的每个信号中的特征。确定传感器与相应特征之间的方向。方向的空格用于构造矩阵。确定矩阵的零空间特征向量，然后将空空间特征向量重新配置为指定传感器位置的矩阵。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式