Rendering via ray-depth field intersection
AssigneeOtoy, Inc.
InventorHsuan-Yueh Peng
Life of this patent
Estimating the term…
Abstract
A rendering procedure determines that a voting process should be employed during non-geometric rendering when a wide range needs to be searched. During the voting process, a candidate point is initially identified along with a plurality of neighbors. The neighbors' real depth estimates and the deviations of their respective real depth estimates from the candidate point and votes for the real depth estimates are obtained. The minimum deviation among the deviations is identified. Other real depth estimate deviations are compared with the minimum deviation to identify if they lie in a predetermined deviation range. Based on the comparison of the other real depth estimate deviations with the minimum deviation the point to render the pixel is selected.
Claims19
A method, implemented by a processor of a computing device, comprising:
- receiving a direction of a ray from an origin, an initial candidate point at which the ray will likely intersect a virtual object surface, and a plurality of neighbors of the candidate point,
- wherein the candidate point is for a rendering point to render a pixel of a video frame to be displayed on a display device, the video frame representing a scene from a given spatial location in an environment;
- receiving an upper bound and a lower bound for a neighborhood to search for the rendering point to render the pixel;
- determining a range between the upper bound and the lower bound;
- employing a voting process for identification of the rendering point if the range is greater than a range threshold;
- and
- if the range not greater than the range threshold, identifying the rendering point via an iterative process that does not comprise the voting process.
A computing apparatus comprising:
- a processor;
- a non-transitory processor readable storage medium comprising programming logic, the programming logic comprising:
- ray receiving logic that receives a direction of a ray from an origin, an initial candidate point at which the ray will likely intersect a virtual object surface, and a plurality of neighbors of the initial candidate point,
- wherein the candidate point is for a rendering point to render a pixel of a video frame to be displayed on a display device, the video frame representing a scene from a given spatial location in an environment;
- range receiving logic that receives an upper bound and a lower bound for a neighborhood to search for the rendering point to render the pixel;
- range determining logic that determines a range between the upper bound and the lower bound;
- and
- point identifying logic that employs a voting process for identification of the point if the range is greater than a range threshold, and if the range is not greater than the range threshold, identifies the point for rendering the pixel via an iterative process that does not comprise the voting process.
Non-transitory computer-readable storage medium comprising processor-executable instructions for:
- receiving a direction of a ray from an origin, an initial candidate point at which the ray will likely intersect a virtual object surface, and a plurality of neighbors of the candidate point,
- wherein the candidate point is for a rendering point to render a pixel of a video frame to be displayed on a display device, the video frame representing a scene from a given spatial location in an environment;
- receiving an upper bound and a lower bound for a neighborhood to search for the rendering point to render the pixel;
- determining a range between the upper bound and the lower bound;
- employing a voting process for identification of the point if the range is greater than a range threshold;
- and
- identifying the point for rendering the pixel via an iterative process that does not comprise the voting process if the range is not greater than the range threshold.
Dependencies are inferred from the claim text.