Mitsubishi Electric Research Laboratories, Inc.

Mitsubishi Electric Research Labs.

Mitsubishi Electric Information Technology Center America, Inc (ita)

Matthew E Brand

Daniel Nikolaev Nikovski

Srikumar Ramalingam

Tyler W Garaas

Andreas F Molisch

Scott Bortoff

Vijay Shilpiekandula

Evdokia V Nikolova

Dietmar Ebner

Daniel Birch

Stefano Di Cairano

Amit Kumar Agrawal

Shmuel Avidan

Tim Marks

Huseyin Erdim

Michael D Mitzenmacher

Rohith Mv

Ziming Zhang

Dongui Chen

Michael Rubenstein

Aydan Aksoylar

Arial Shamir

Sofien Bouaziz

Patrick Pletscher

Petar Maymounkov

Zeyu Kuang

Cibulka Josef

Manohar Srikanth

A camera is provided for reconstructing the surface of the object. The camera includes an optical module configured to spatially separate photons reflected from an object in a scene to form at least two focused and distinctly polarized images on a sensor, wherein the sensor is configured to receive the at least two polarized images on pixels the sensor and generate intensity values of the pixels, and a computing module including a processor and a memory having instructions stored thereon. According to the instructions, the processor computes depth values at points of a surface of the object based on a ratio of the intensity values of the pixels with respect to the at least two polarized images and reconstructs the surface of the object from the computed depth values.

Metalens 3D-from-polarization camera

A data conversion system includes an interface to receive path data, a memory to store a computer-executable program including a lattice full algorithm and a dynamic programming algorithm, a processor, in connection with the memory, configured to execute the computer-executable program. The processor is configured to perform steps including providing a coordinate system including admissible points, forming, from the path data, a target polyline on the coordinate system, wherein the target polyline represents an approximated surface line of an object, dividing the target polyline into line segments, generating a set of rational vectors by approximating slopes of the line segments based on the lattice full algorithm, arranging the rational vectors to form lower convex hull lines arranged on or above corresponding line segments, wherein the lower convex hull lines are arranged onto the admissible points, wherein the admissible points are on or above the corresponding line segments, selecting a set of endpoints of the lower convex hull lines, and forming a final polyline by merging the endpoints based on the dynamic programming algorithm, wherein the final polyline is arranged to lay on or above the target polyline.

System and method for generating optimal lattice tool paths

A computer-based system trains a neural network by solving a double layer optimization problem. The system includes an input interface to receive an input to the neural network and labels of the input to the neural network; a processor to solve a double layer optimization to produce parameters of the neural network, and an output interface to output the parameters of the neural network. The double layer optimization includes an optimization of a first layer subject to an optimization of a second layer. The optimization of the first layer minimizes a difference between an output of the neural network processing the input and the labels of the input to the neural network, the optimization of the second layer minimizes a distance between a non-negative output vector of each layer and a corresponding input vector to each layer. The input vector of a current layer is a linear transformation of the non-negative output vector of the previous layer.

Machine learning via double layer optimization

A lighting apparatus for providing uniform irradiance is provided. The lighting apparatus includes a light source configured to emit rays toward a polygonal target region, and a lens configured to uniformize irradiance from the light source to the target region, wherein sag of the lens and normals along a boundary of the lens are arranged so as to illuminate a perimeter of the target region based on an edge-ray mapping, wherein a lens surface is formed based on polyharmonic spline interpolations so as to smoothly illuminate an interior of the target region, wherein the irradiance is uniformized by argumenting light field tailoring of the lens, wherein the light field tailoring is augmented to maintain to maintain the irradiance perimeter.

Uniform-irradiance extended-source freeforms

Devices, systems and methods including an optic having an optical surface partitioned into a plurality of facets. Wherein a geometry of the plurality of facets are configured to rearrange the rays in an incident light field to form a desired irradiance pattern on a projection surface, partitioned into a plurality of pixels, each of which may receive light from a multiplicity of facets. Wherein the configured geometry of the plurality of facets is corrected to minimize a difference between an observed irradiance pattern and a desired irradiance pattern provided by a user.

Methods and systems for freeform irradiance tailoring for light fields

An optic to transform incident light emitted by a light source to form an irradiation pattern on a projection surface has a freeform surface formed by a union of an aspheric lens and a collection of Cartesian ovals. Each Cartesian oval is a lens focusing the incident light to a point and the collection of Cartesian ovals directs the incident light to a collection of points forming a border of the irradiation pattern. The aspheric lens is a portion of a refractive lens directing the incident light to form an interior of the irradiation pattern. The aspheric lens is combined with the collection of Cartesian ovals to form the union, such that each Cartesian oval shares a radiant focus of the refractive lens and makes a tangential contact with the surface of the aspheric lens at a single point.

Compound optics with freeform optical surface

An optic has a freeform optical surface transforming incident light emitted by a zero-&#xe9;tendue light source to form an irradiation pattern including a caustic of light rays focused along a curve. The transverse thickness of the illuminated curve is determined by the diffraction limit of the wavelength of the incident light.

Freeform optical surface for producing sharp-edged irradiance patterns

An optic has a freeform optical surface transforming incident light emitted by a spatially extended light source into a constellation of images of the spatially extended light source. The images in the constellation are mixed to form a target illumination pattern having a sharp-edge at least along a portion of a boundary. The images include a focused image, and an edge of the focused image participates in forming the sharp-edged boundary the target illumination pattern.

Tailored freeform optical surface

A method determines a sequence for drilling holes in a workpiece according to a pattern by first partitioning the holes in the pattern into packets. A global sequence of the packets is determined by solving a global traveling salesman problem (TSP), and a local sequence of the holes in each packet is determined by solving a local TSP for each packet. Then, the local sequences of the holes are joined according to the global sequence of the packets to determine a complete sequence for drilling the holes.

Method for determining a sequence for drilling holes according to a pattern using global and local optimization

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.

MPC controller using parallel quadratic programming

A method for generating a representation of a polyline formed by a sequence of points determines an overcomplete set of geometric primitives that redundantly fit overlapping sections of the polyline. The overcomplete fitting is performed such that the set includes one or more types of geometric primitives, each fitted to a section of the polyline formed by a subset of the sequence of points. The method determines a local cost of each geometric primitive based on a combination of a fitting error and an encoding cost of the geometric primitive, and determines a join cost of each successive pair of adjacent primitives. Next, the method determines a combination of the geometric primitives forming a connected path along a length of the polyline such that a sum of the local costs of the geometric primitives and the join costs of adjacent primitives in the combination is optimized.

Method for generating representations of polylines using piecewise fitted geometric primitives

A method for generating a trajectory based on an input trajectory formed by points representing spatial coordinates for a numerically controlled (NC) process determines a plurality of sequences of the points and determines, for each sequence, local costs of each point in the input trajectory. Each sequence is formed by removing a unique combination of points from the input trajectory and the local cost of a point for a sequence is determined based on a spatial arrangement of the point with respect to at least some of points in the sequence. For each sequence, a sum of corresponding local costs of each point in the input trajectory is determines and the trajectory is determined based on an optimal sequence with an optimal value of the sum of the local costs.

Method for generating trajectory for numerical control process

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.

Method and system for cutting features from sheet materials with a laser cutter according to a pattern

A method for planning a radiation therapy treatment of a body represented by a volume of voxels determines a radiation dose matrix representing a spatial distribution of a radiation dose of beams of radiation irradiating the volume with homogeneous stopping power. The beams are collimated and are shifted copies of each other at each depth of the volume, and the spatial distribution is determined by calculating cumulative beam-axial doses in a single matrix-matrix multiplication and redistributing the cumulative beam-axial doses to all voxels in the volume using a convolution. Next, a set of correcting operations is applied to the radiation dose matrix to produce a cumulative voxel radiation dose of the volume. Each correcting operation is linear, independent from another correcting operation and has a transform.

System and method for planning a radiation therapy treatment

A method for reconstructing&#x2014;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.

Growing community of inventors

Cambridge, MA, United States of America

Matthew E Brand