Method and system for object antialiasing in an augmented reality experience
US-2024221129-A1 · Jul 4, 2024 · US
US9424630B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9424630-B2 |
| Application number | US-201514922773-A |
| Country | US |
| Kind code | B2 |
| Filing date | Oct 26, 2015 |
| Priority date | Aug 28, 2007 |
| Publication date | Aug 23, 2016 |
| Grant date | Aug 23, 2016 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A method and an apparatus for detecting and removing a false contour, a method and an apparatus for verifying whether a pixel is included in a contour, and a method and an apparatus for calculating simplicity are provided. The method for detecting and removing the false contour includes: verifying whether a pixel of an input video is included in a contour; calculating simplicity of the pixel; determining whether the pixel is included in a false contour based on the simplicity and based on whether the pixel is included in the contour; and removing the false contour from the input video via smoothing with respect to the false contour.
Opening claim text (preview).
What is claimed is: 1. A method for detecting and removing a false contour, comprising: receiving an input video; determining, by a processor, that a pixel of the input video is included in a contour; calculating, by a processor, simplicity of the pixel; determining that the pixel is included in a false contour based on the simplicity and based on the pixel being included in the contour; and removing the false contour from the input video via smoothing with respect to the false contour, wherein the calculating the simplicity of the pixel comprises: determining whether each of at least one difference between adjacent pixels within a search window, including the pixel in a center thereof, is less than a predetermined difference; and calculating the simplicity of the pixel based on the at least one difference between the adjacent pixels when the at least one difference is less than the predetermined difference. 2. The method of claim 1 , wherein the determining that the pixel of the input video is included in the contour comprises: calculating a gradient of each pixel; and determining whether the pixel is included in the contour based on the gradient. 3. The method of claim 2 , wherein the calculating of the gradient of each pixel comprises calculating the gradient using a nonlinear partial differential of an x axis and a nonlinear partial differential of a y axis, which correspond to the pixel, as below: | G|=|Gx|+|Gy|, [Equation 5] where G indicates the gradient, Gx indicates the nonlinear partial differential of the x axis, and the Gy indicates the nonlinear partial differential of the y axis. 4. The method of claim 2 , wherein the determining of whether the pixel is included in the contour based on the gradient comprises determining the pixel is included in the contour when the gradient of the pixel is identical to a longitudinal value or a diagonal value according to a number of a bit loss. 5. The method of claim 2 , wherein the determining that the pixel of the input video is included in the contour further comprises: determining whether a linked pixel to the pixel exists, and the determining of whether the pixel is included in the contour based on the gradient comprises determining the pixel is included in the contour when the gradient of the pixel is identical to the longitudinal value or identical to the diagonal value according to the number of a bit loss and when the linked pixel exists. 6. The method of claim 1 , wherein the search window is an n×n sized pixel group, and wherein the calculating the simplicity of the pixel further comprises: measuring a bond strength between the adjacent pixels according to directions of the adjacent pixels when the at least one difference between the adjacent pixels is less than the predetermined difference; and calculating the simplicity of the pixel based on the bond strength. 7. The method of claim 6 , wherein the adjacent pixels comprise a predetermined pixel within the n×n sized pixel group and a nearest pixel existing in a longitudinal direction or a diagonal direction from the predetermined pixel, and the measuring of the bond strength between the adjacent pixels according to directions of the adjacent pixels comprises measuring a weighted value according to either the longitudinal direction or the diagonal direction between the adjacent pixels as the bond strength. 8. The method of claim 1 , wherein the removing of the false contour from the input video via smoothing with respect to the false contour comprises: determining a smoothing level based on the simplicity and a gradient of the pixel and based on simplicity and a gradient of adjacent pixels; and removing the false contour according to the smoothing level. 9. The method of claim 8 , wherein the removing of the false contour from the input video via smoothing with respect to the false contour comprises removing the false contour with respect to the pixel and the adjacent pixels, using a single smoothing filter from predetermined smoothing filters shown in Equation 6, K 7 × 7 = 1 49 [ 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
Coding unit complexity, e.g. amount of activity or edge presence estimation (H04N19/146 takes precedence) · CPC title
Color image · CPC title
the unit being a pixel · CPC title
involving reduction of coding artifacts, e.g. of blockiness · CPC title
using transform coding · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.