Patent application number | Description | Published |
20130137949 | HYPERSPECTRAL IMAGING OF ANGIOGENESIS - The invention is directed to methods and systems of hyperspectral and multispectral imaging of medical tissues. In particular, the invention is directed to new devices, tools and processes for the detection and evaluation of diseases and disorders such as, but not limited to diabetes and peripheral vascular disease and cancer, that incorporate hyperspectral or multispectral imaging. | 05-30-2013 |
20130245455 | HYPERSPECTRAL IMAGING IN DIABETES AND PERIPHERAL VASCULAR DISEASE - The invention is directed to methods and systems of hyperspectral and multispectral imaging of medical tissues. In particular, the invention is directed to new devices, tools and processes for the detection and evaluation of diseases and disorders such as, but not limited to diabetes and peripheral vascular disease, that incorporate hyperspectral or multispectral imaging. | 09-19-2013 |
20140112559 | HYPERSPECTRAL IMAGING IN DIABETES AND PERIPHERAL VASCULAR DISEASE - The invention is directed to methods and systems of hyperspectral and multispectral imaging of medical tissues. In particular, the invention is directed to new devices, tools and processes for the detection and evaluation of diseases and disorders such as, but not limited to diabetes and peripheral vascular disease, that incorporate hyperspectral or multispectral imaging. | 04-24-2014 |
Patent application number | Description | Published |
20100124219 | Method for Routing Packets in Ad-Hoc Networks with Partial Channel State Information - 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=ƒ(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≧ƒ(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. | 05-20-2010 |
20100128703 | Method for Routing Packets in Wireless Ad-Hoc Networks with Probabilistic Delay Guarantees - A method determines an optimal route to deliver a packet from a source node via relay nodes to a destination node in a network. A graph of nodes connected by edges represents possible routes in the network. A probability that the packet arrives at the destination before a deadline time is assigned to each edge. A minimal delay route is selected from the possible routes, and an arrival time for delivering the packet using the minimal delay route is determined. The arrival time is comparing to a deadline time, and the probabilities are scaled accordingly until the minimal delay route is an optimal route. | 05-27-2010 |
20100183242 | Method for Editing Images and Videos - A method edits editing an input image to produce an output image by first partitioning pixels of the input image into sets of adjacent pixels. Then, for each set, a trellis of nodes connected by directed links is defined. Each node corresponds to one of the pixels in the set of pixels, and an action and location of the pixel in the output image. Costs are assigned to the nodes and the links. A least cost path through the trellis is determined, and pixels corresponding to the nodes on the least cost path are edited according to the action and location to form the output image. | 07-22-2010 |
20100329542 | Method for Determining a Location From Images Acquired of an Environment with an Omni-Directional Camera - 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. | 12-30-2010 |
20120118672 | Motion Planning for Elevator Cars Moving Independently in One Elevator Shaft - A method for controlling 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, determines alternately motion plans for the first the second cars wherein each part of a motion plan for the first car is determined for a planning period of the first car, wherein a beginning of the planning period of the first car is determined by an end of the planning period of the second car, and an end of the planning period of the first car is determined by a home position of the first car on the motion plan, wherein the part of the motion plan is determined based on motion constraints, a set of requests, and the motion plan of the second car determined by the beginning of the planning period of the first car. | 05-17-2012 |
20120118673 | Motion Planning for Elevator Cars Moving Independently in One Elevator Shaft - 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. | 05-17-2012 |
20120150324 | Method for Solving Control Problems - 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. | 06-14-2012 |
20120206440 | Method for Generating Virtual Images of Scenes Using Trellis Structures - 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. | 08-16-2012 |
20120281929 | Method for Performing Image Processing Applications Using Quadratic Programming - A method performs an image processing application by expressing the image processing application as a non-negative quadratic program (NNQP) with a quadratic objective, and nonnegativity constraints. A Karush-Kuhn-Tucker condition of the NNQP is expressed as a fixpoint ratio. Then, the fixpoint ratio is determined iteratively until a solution to the image processing application is reached with a desired precision. | 11-08-2012 |
20140005804 | System and Method for Controlling Machines According to Pattern of Contours | 01-02-2014 |
20140005819 | Method and System for Detouring Around Features Cut From Sheet Materials with a Laser Cutter According to a Pattern | 01-02-2014 |
20140005822 | Method and System for Cutting Features From Sheet Materials With a Laser Cutter According to a Pattern | 01-02-2014 |
20140114463 | Determining Trajectories of Redundant Actuators Jointly Tracking Reference Trajectory - A method determines trajectories of redundant actuators of a machine including a first actuator and a second actuator. The method determines a first trajectory of the first actuator tracking a reference trajectory with an error tolerance, wherein the error tolerance is a function of a constraint of the second actuator, and determines a second trajectory of the second actuator based on a difference between the reference trajectory and the first trajectory. | 04-24-2014 |
20140341463 | Method for Reconstructing 3D Lines from 2D Lines in an Image - A method for reconstructing—three-dimensional (3D) lines in a 3D world coordinate system from two-dimensional (2D) lines in a single image of scene detects and clusters the 2D lines using vanishing points. A constraint graph of vertices and edges is generated, wherein the vertices represent the 2D lines, and the edges represents constraints on the 2D lines, then identifying the 3D lines that satisfy the constraints and reconstructing the 3D lines using the identified constraints. | 11-20-2014 |
20140343695 | MPC Controller Using Parallel Quadratic Programming - A method controls an operation of a machine using a model predictive control (MPC). The method determine, in response to receiving a state of the operation of the machine, a dual solution of a dual parametric problem of a parametric form of the MPC using a parallel quadratic programming (PQP) rescaling iteratively a candidate dual solution of the dual parametric problem. The coefficients of the dual parametric problem include data representing dynamics of the machine and constraints on the operation of the machine. A parameter of the dual parametric problem includes the state of the operation of the machine. The method determines a primal solution of a primal problem of the MPC using the dual solution of the dual parametric problem. | 11-20-2014 |
Patent application number | Description | Published |
20100183243 | Method for Temporally Editing Videos - 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. | 07-22-2010 |
20100246473 | Resource Allocation for Rateless Transmissions - Embodiments of the invention describe a method for transmitting 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. | 09-30-2010 |
Patent application number | Description | Published |
20080308361 | Method and System for Determining Instantaneous Peak Power Consumption in Elevator Banks - 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. | 12-18-2008 |
20090148072 | Method and Apparatus for Touching-Up Images - 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. | 06-11-2009 |
20090175171 | METHOD FOR FINDING OPTIMAL PATHS USING A STOCHASTIC NETWORK MODEL - 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. | 07-09-2009 |
20110150320 | Method and System for Localizing in Urban Environments From Omni-Direction Skyline Images - A location and orientation in an environment is determined by acquiring a set of one or more real omni-directional images of an unknown skyline in the environment from an unknown location and an unknown orientation in the environment by an omni-directional camera. A set of virtual omni-directional images is synthesized from a 3D model of the environment, wherein each virtual omni-directional image is associated with a known skyline, a known location and a known orientation. Each real omni-directional image is compared with the set of virtual omni-directional images to determine a best matching virtual omni-directional image with the associated known location and known orientation that correspond to the unknown location and orientation. | 06-23-2011 |
20110211771 | Content Aware Resizing of Images and Videos - 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. | 09-01-2011 |
Patent application number | Description | Published |
20090036381 | TREATMENT OF DIABETES - Compositions and methods are provided for islet neogenesis therapy comprising a member of a group of factors that complement a gastrin/CCK receptor ligand, with formulations, devices and methods for sustained release delivery and for local delivery to target organs. | 02-05-2009 |
20090041731 | Treatment for Diabetes - Methods and compositions for treating diabetes mellitus in a patient in need thereof are provided. The methods include administering to a patient a composition providing a gastrin/CCK receptor ligand, e.g., a gastrin, and/or an epidermal growth factor (EGF) receptor ligand, e.g., TGF-α, in an amount sufficient to effect differentiation of pancreatic islet precursor cells to mature insulin-secreting cells. The composition can be administered systemically or expressed in situ by cells transgenically supplemented with one or both of a gastrin/CCK receptor ligand gene, e.g., a preprogastrin peptide precursor gene and an EGF receptor ligand gene, e.g., a TGF-α gene. The methods also include transplanting into a patient cultured pancreatic islets in which mature insulin-secreting beta cells are proliferated by exposure to a gastrin/CCK receptor ligand and an EGF receptor ligand. | 02-12-2009 |
20090269337 | COMPOSITIONS AND METHODS FOR TREATING DIABETES - Compositions and methods for islet neogenesis therapy comprising an EGF and a gastrin in combination with immune suppression, and for treating or preventing early stage diabetes with a gastrin/CCK receptor ligand and an immunosuppressant are provided. | 10-29-2009 |