DETAILED ACTION
Notice of Pre-AIA or AIA Status
1. The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA .
Claim Rejections - 35 USC § 103
2. In the event the determination of the status of the application as subject to AIA 35 U.S.C. 102 and 103 (or as subject to pre-AIA 35 U.S.C. 102 and 103) is incorrect, any correction of the statutory basis (i.e., changing from AIA to pre-AIA ) for the rejection will not be considered a new ground of rejection if the prior art relied upon, and the rationale supporting the rejection, would be the same under either status.
The following is a quotation of 35 U.S.C. 103 which forms the basis for all obviousness rejections set forth in this Office action:
A patent for a claimed invention may not be obtained, notwithstanding that the claimed invention is not identically disclosed as set forth in section 102, if the differences between the claimed invention and the prior art are such that the claimed invention as a whole would have been obvious before the effective filing date of the claimed invention to a person having ordinary skill in the art to which the claimed invention pertains. Patentability shall not be negated by the manner in which the invention was made.
Claims 1-21 are rejected under 35 U.S.C. 103 as being unpatentable over Lasserre et al. (WO 2023/193533 A1 will be further referred to as Lass) and further in view of Park et al. (U.S. patent 2022/0337872 A1 will be further referred to as Park).
Regarding claim 1: Lass discloses a method comprising:
selecting, by a computing device based on a motion compensated point cloud and neighborhood configuration of a current edge associated with a video frame (Lass; fig. 10 and paragraphs 0081-0084 and 0090-0098);
a context for coding vertex information of the current edge (Lass; fig. 10 and paragraphs 0081-0084, 0090-0098, and 00103); and
based on the context, decoding the vertex information of the current edge (Lass; figs. 10, 16, and 17 and paragraphs 0081-0084, 0088, 0090-0098, 00103, and 00133).
Lass does not teach the feature of “selecting, by a computing device based on a motion compensated point cloud.” Park teaches the feature of “selecting, by a computing device based on a motion compensated point cloud” (Park; paragraph 0240, 0257, and 0272). It would have been obvious to one ordinary skilled in the art to combine the teaching of Park into the disclosure of Lass because they are analogous in the field of point cloud processing. One ordinary skilled in the art would have been motivated to incorporate the teaching of Park into the disclosure of Lass in order to address latency and encoding/decoding complexity (Park; paragraph 0004).
Regarding claim 2: The method of claim 1, wherein the selecting comprises selecting the context based on occupancies of point locations in the motion compensated point cloud (Lass; paragraphs 00106-00113 and 00119).
Regarding claim 3: The method of claim 1, wherein the selecting comprises selecting the context based on a reduction of occupancies of point locations in the motion compensated point cloud (Park; paragraph 0216).
Regarding claim 4: The method of claim 1, further comprising:
determining compensated vertex information of the current edge (Lass; abstract, fig. 10 and paragraphs 0081-0084 and 0090-0098, especially paragraphs 0081-0082).
Regarding claim 5: The method of claim 4, wherein the vertex information comprises at least one of:
a vertex presence flag (Lass; abstract, fig. 10 and paragraphs 0081-0084 and 0090-0098, especially paragraphs 0081-0082, especially paragraph 0090); or
a vertex position (Lass; abstract, fig. 10 and paragraphs 0081-0084 and 0090-0098, especially paragraphs 0081-0082).
Regarding claim 6: The method of claim 1, wherein the selecting further comprises:
selecting the context based on an association between the neighborhood configuration and the context (Lass; fig. 10 and paragraphs 0081-0084, 0090-0098, and 00103).
Regarding claim 7: The method of claim 1, wherein the selecting further comprises:
selecting the context based on an association between a subset of one or more symbols of the neighborhood configuration and the context (Lass; fig. 10 and paragraphs 0081-0084, 0090-0098, and 00103).
Regarding claim 8: The method of claim 1, further comprising:
based on the vertex information of the current edge, updating an association between a subset of one or more symbols of the neighborhood configuration and a different context (Lass; fig. 10 and paragraphs 0081-0084, 0090-0098, and 00103).
Regarding claim 9: See claims 1 and 5-8. See claim 1 for obvious and motivation statements.
Regarding claim 10: The method of claim 9, wherein each of the point locations are located from the current edge by a distance and in a direction perpendicular to the current edge, wherein the distance is no more than half a minimum distance between any two point locations (Lass; paragraphs 00100-00105).
Regarding claim 11: The method of claim 9, wherein each of the point locations comprise a coordinate along an axis parallel to the current edge, and wherein the coordinates are contained in an edge interval of the current edge (Lass; paragraphs 00100-00105).
Regarding claim 12: The method of claim 9, wherein a quantity of the point locations comprises a product of a length of the current edge (Lass; paragraphs 00100-00105).
Regarding claim 13: The method of claim 9, wherein a quantity of the point locations comprises a product of an augmented length of the current edge (Lass; paragraphs 00100-00105).
Regarding claim 14: see claim 3.
Regarding claim 15: see claim 7.
Regarding claim 16: See claims 1 and 9. See claim 1 for obvious and motivation statements.
Regarding claim 17: The method of claim 16, wherein the vertex position indicates one of two positions between a start point of the current edge and an end point of the current edge (Lass; paragraphs 00090-00105).
Regarding claim 18: The method of claim 16, wherein the vertex position indicates one of two positions comprising a central position and an extreme position (Lass; paragraphs 00090-00105).
Regarding claim 19: The method of claim 16, wherein the vertex position indicates one of two positions comprising a top position and a bottom position (Lass; paragraphs 00090-00105).
Regarding claim 20: The method of claim 16, wherein the determining, selecting, and coding are performed by a decoder (Lass; fig. 9, element 400).
Regarding claim 21: See claim 1.
Contact Information
3. Any inquiry concerning this communication or earlier communications from the examiner should be directed to ANAND BHATNAGAR whose telephone number is (571)272-7416. The examiner can normally be reached on M-F 7:30am-4:00pm.
Examiner interviews are available via telephone, in-person, and video conferencing using a USPTO supplied web-based collaboration tool. To schedule an interview, applicant is encouraged to use the USPTO Automated Interview Request (AIR) at http://www.uspto.gov/interviewpractice.
If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Vu Le can be reached on 571-272-4650. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300.
Information regarding the status of an application may be obtained from the Patent Application Information Retrieval (PAIR) system. Status information for published applications may be obtained from either Private PAIR or Public PAIR. Status information for unpublished applications is available through Private PAIR only.
For more information about the PAIR system, see http://pair-direct.uspto.gov. Should you have questions on access to the Private PAIR system, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative or access to the automated information system, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000.
/ANAND P BHATNAGAR/
Primary Examiner, Art Unit 2668
September 18, 2026
Prosecution Insights