Stmicroelectronics S.r.l.

Stmicroelectronics Gmbh

Massimiliano Barone

Danilo Pietro Pau

Pierluigi Gardella

Simon Goda

Edoardo Gallizio

Stephen Hill

Daniele Lavigna

Pier Luigi Gardella

Gary Sweet

Andrea Lorenzo Vitali

Daniele Alfonso

Mirko Falchetto

Naomi Petrushevsky

Eli Yaser

Massimo Ratti

Daniele Sirtori

Antonio Griseta

Mathieu Robart

Davide Terruzzi

Bruno Poutet

Gary James Sweet

Stephen Adrian Hill

Simon James Goda

Disclosed herein is a laser projection system including a laser projector emitting a laser beam, a movable mirror apparatus reflecting the laser beam toward a surface, and a graphics processing unit (GPU). The GPU is configured to receive video data, estimate a varying speed of movement of the movable mirror apparatus for different positions of the laser beam across the surface, and process the video data based upon the estimated varying speed of movement. An application specific integrated circuit (ASIC) receives the processed video data, and to generate a beam position control signal based upon required or desired movement of the movable mirror apparatus. A laser driver controls the laser projector as a function of the processed video data, and a mirror controller controls the movable mirror apparatus as a function of the beam position control signal.

Calculation of beam speed and position in a laser projection system using a graphics processing unit

A depth map is generated from at least a first and a second image. A plurality of reference pixels are selected in the first image. A cost function is used to associate each reference pixel with a respective pixel in the second image. A masking operation is used to identify a subset of pixels in a block of pixels surrounding a reference pixel and the cost function is based on the identified subset of pixels. A disparity between each reference pixel and the respective pixel in said second image is determined, and a depth value is determined for each reference pixel as a function of the respective disparity. A depth map is generated based on the determined depth values.

Depth map generation method, related system and computer program product

A depth map is generated from at least a first and a second image. Generally, a plurality of reference pixels are selected in the first image and associated with respective pixels in the second image. Next, the disparity between each reference pixel and the respective pixel in said second image is determined, and for each reference pixel a depth value as a function of the respective disparity. In particular, each reference pixel is associated with a respective pixel in the second image via a matching and a filtering operation. The matching operation selects for each reference pixel a plurality of candidate pixels in the second image and associates with each candidate pixel a respective cost function value and a respective disparity value.

Method for generating a depth map, related system and computer program product

A depth map is generated from at least a first and a second image. A plurality of reference pixels in the first image are selected and associated with respective pixels in the second image. A disparity between each reference pixel and the respective pixel in said second image is determined, and a depth value is determined as a function of the respective disparity. The plurality of reference pixels is selected based on detected contours in the first image.

The disclosure relates to a graphics module for rendering a bidimensional scene on a display screen comprising a graphics pipeline of the sort-middle type, said graphics pipeline comprising: a first processing module configured to clip a span-type input primitive received from a rasterizer module into sub-span type primitives to be associated to respective macro-blocks corresponding to portions of the screen, and to store said sub-span type primitives in a scene buffer; a second processing module configured to reconstruct the span-type input primitive starting from said sub-span type primitives, the second processing module being further intended to implement a culling operation of sub-span type primitives of the occluded type.

Rendering module for bidimensional graphics

A system renders a primitive of an image to be displayed, for instance in a mobile 3D graphic pipeline, the primitive including a set of pixels. The system locates the pixels in the area of the primitive, generates, for each pixel located in the area, a set of associated sub-pixels, borrows a set of sub-pixels from neighboring pixels, subjects the set of associated sub-pixels and the borrowed set of pixels to adaptive filtering to create an adaptively filtered set of sub-pixels, and further filters the adaptively filtered set of sub-pixels to compute a final pixel for display. Preferably, the set of associated sub-pixels fulfills at least one of the following: the set includes two associated sub-pixels and the set includes associated sub-pixels placed on pixel edges.

Method and system for signal processing, for instance for mobile 3D graphic pipelines, and computer program product therefor

A rasterizing method calculates an attribute (C) of a pixel having coordinates (X, Y) based on the coordinates (X, Y), (X, Y), (X, Y) of vertices of a primitive in a screen space, Z coordinates Z, Zand Zof said vertices into the three-dimensional space, and attributes C, C, Cof said vertices. The method defines a vertex (X, Y) as reference, the attribute (C) with the formula: 

Rasterizing method

A method detects border tiles or border pixels of a primitive corresponding to an object to be displayed on a display screen. The detecting includes: calculating the number of border tiles or pixels covered by an edge of the primitive; identifying a plurality of vertices that divide the edge in a plurality of segments of equal length; calculating coordinates of the vertices; and associating a tile or pixel with the coordinates of each vertex. The number of vertices for the edge is greater than or equal to the number of border tiles or pixels.

Method for detecting border tiles or border pixels of a primitive for tile-based rendering

A graphic system includes a pipelined graphic engine for generating image frames for display. The pipelined graphic engine includes a geometric processing stage for performing motion extraction, and a rendering stage for generating full image frames at a first frame rate for display at a second frame rate. The second frame rate is higher than the first frame rate. A motion encoder stage receives motion information from the geometric processing stage, and produces an interpolated frame signal representative of interpolated frames. A motion compensation stage receives the interpolated frame signal from the motion encoder stage, and the full image frames from the rendering stage for generating the interpolated frames. A preferred application is in graphic systems that operate in association with smart displays through a wireless connection, such as in mobile phones.

Graphic system comprising a pipelined graphic engine, pipelining method and computer program product

A system renders a primitive of an image to be displayed, for instance in a mobile 3D graphic pipeline, the primitive including a set of pixels. The system locates the pixels in the area of the primitive, generates, for each pixel located in the area, a set of associated sub-pixels, borrows a set of sub-pixels from neighboring pixels, subjects the set of associated sub-pixels and the borrowed set of pixels to adaptive filtering to create an adaptively filtered set of sub-pixels, and further filters the adaptively filtered set of sub-pixels to compute a final pixel for display. Preferably, the set of associated sub-pixels fulfils at least one of the following: the set includes two associated sub-pixels and the set includes associated sub-pixels placed on pixel edges.

An antialiasing method includes: providing a first fragment; computing a first coverage area representing a portion of the first fragment covered by a first primitive; providing a second fragment juxtaposed to the first fragment and at least partially covered by a second primitive; processing the first coverage area to obtain a corrected coverage area indicative of a visible first fragment portion resulting from the juxtaposition of the fragments; and applying an antialiasing procedure based on the corrected coverage area.

Graphic antialiasing method and graphic system employing the method

A dither matrix is applied to a high-resolution image to compare the value of each of the pixels that compose it with a threshold value of the matrix and to obtain an output value of the matrix (Dither matrix value) from each comparison. To each pixel value of the image there is applied an algorithm involving simple but displacement operation, namely shifts to the left and shifts to the right. The pixel values of a low-resolution image are output from the applied algorithm.

Method of processing a digital image by means of ordered dithering technique description

A digital video image is compressed by determining for a group of adjacent pixels the global error values that result from the available combinations of truncation and integration of data strings associated with the group of pixels. A combination of truncation and integration that produces a minimum global error value is identified and used to control compression of the individual strings of data associated with the group of pixels.

Method and system for processing image signals and computer program product therefor

A method for texture compressing images having a plurality of color components (R, G, B) includes defining color representatives for use in encoding by defining groups of colors for each color component (R,G,B), and selecting a representative median color for the group. Each group ideally includes 3 to 15 increasing colors. The method includes computing, for each group, an error between each member of the group and the representative median color of the group. Typically, the error is computed as the sum of the absolute differences (SAD) between each member of the group and the representative median color of the group.

Methods and apparatus for texture compression and computer program product therefor

A method for texture compressing images having a plurality of color components (R, G, B), includes decomposing the images in sub-blocks each including only one color component. At least one first predictor is defined for each sub-block and a respective set of prediction differences is computed for each sub-block. Then the prediction differences for each sub-block are sorted, and a look-up prediction differences palette is set up by defining a look-up prediction error palette. A predetermined code is associated with each column of the error palette.

Growing community of inventors

Bresso, Italy

Massimiliano Barone