Abstract: 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.

Abstract: A system for processing a three-dimensional (3D) image may include a processor and a memory cooperating therewith configured to extract a subject for a given image frame from a plurality of image frames and generate first and second image-point subject models based upon a previous image frame and a next image frame, respectively. The processor may also perform a first iterative closed points (ICP) algorithm on the first and second image-point subject models producing common points, remove not common points to define updated first and second image-point subject models, and perform, based upon the common points, a second ICP algorithm on the updated first and second image-point subject models to define further updated first and second image-point subject models. The processor may further generate a 3D image based upon the further updated first image-point subject model and the further updated second image-point subject model after performing the second ICP algorithm.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: A rasterizing method calculates an attribute (C) of a pixel having coordinates (X, Y) based on the coordinates (X0, Y0), (X1, Y1), (X2, Y2) of vertices of a primitive in a screen space, Z coordinates Z0, Z1 and Z2 of said vertices into the three-dimensional space, and attributes C0, C1, C2 of said vertices.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: A graphics module for the rendering of a bidimensional scene on a displaying screen is described, comprising a sort-middle-type graphics pipeline, said graphics pipeline comprising: a first rasterizer module so configured as to convert an edge-type input primitive received by a path processing module into a primitive of active-edge-type; a first processing module so configured as to associate said primitive of active-edge-type to respective macro-blocks corresponding to portions of the screen and to store said primitive of active-edge-type into a scene buffer; a second processing module so configured as to read said scene buffer and to provide said primitive of active-edge-type to a second rasterizer module.

Abstract: 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.

Abstract: 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.

Abstract: A rasterizing method calculates an attribute (C) of a pixel having coordinates (X, Y) based on the coordinates (X0, Y0), (X1, Y1), (X2, Y2) of vertices of a primitive in a screen space, Z coordinates Z0, Z1 and Z2 of said vertices into the three-dimensional space, and attributes C0, C1, C2 of said vertices.