DETAILED ACTION
Notice of Pre-AIA or AIA Status
The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA .
The Examiner contacted the applicant’s representative Joseph L. Ulvr on 19th August, 2026 to address the current double patenting rejection, but was not able to get a response.
Claim Objections
Claim 5 is objected to because of the following informalities:
Claim 5 recites the limitation(s): “The method of clam 1” on PG(s). 1, Line(s) 27; examiner suggests amending this to: “The method of claim 1”.Appropriate correction is required.
Double Patenting
The nonstatutory double patenting rejection is based on a judicially created doctrine grounded in public policy (a policy reflected in the statute) so as to prevent the unjustified or improper timewise extension of the “right to exclude” granted by a patent and to prevent possible harassment by multiple assignees. A nonstatutory double patenting rejection is appropriate where the conflicting claims are not identical, but at least one examined application claim is not patentably distinct from the reference claim(s) because the examined application claim is either anticipated by, or would have been obvious over, the reference claim(s). See, e.g., In re Berg, 140 F.3d 1428, 46 USPQ2d 1226 (Fed. Cir. 1998); In re Goodman, 11 F.3d 1046, 29 USPQ2d 2010 (Fed. Cir. 1993); In re Longi, 759 F.2d 887, 225 USPQ 645 (Fed. Cir. 1985); In re Van Ornum, 686 F.2d 937, 214 USPQ 761 (CCPA 1982); In re Vogel, 422 F.2d 438, 164 USPQ 619 (CCPA 1970); In re Thorington, 418 F.2d 528, 163 USPQ 644 (CCPA 1969).
A timely filed terminal disclaimer in compliance with 37 CFR 1.321(c) or 1.321(d) may be used to overcome an actual or provisional rejection based on nonstatutory double patenting provided the reference application or patent either is shown to be commonly owned with the examined application, or claims an invention made as a result of activities undertaken within the scope of a joint research agreement. See MPEP § 717.02 for applications subject to examination under the first inventor to file provisions of the AIA as explained in MPEP § 2159. See MPEP § 2146 et seq. for applications not subject to examination under the first inventor to file provisions of the AIA . A terminal disclaimer must be signed in compliance with 37 CFR 1.321(b).
The filing of a terminal disclaimer by itself is not a complete reply to a nonstatutory double patenting (NSDP) rejection. A complete reply requires that the terminal disclaimer be accompanied by a reply requesting reconsideration of the prior Office action. Even where the NSDP rejection is provisional the reply must be complete. See MPEP § 804, subsection I.B.1. For a reply to a non-final Office action, see 37 CFR 1.111(a). For a reply to final Office action, see 37 CFR 1.113(c). A request for reconsideration while not provided for in 37 CFR 1.113(c) may be filed after final for consideration. See MPEP §§ 706.07(e) and 714.13.
The USPTO Internet website contains terminal disclaimer forms which may be used. Please visit www.uspto.gov/patent/patents-forms. The actual filing date of the application in which the form is filed determines what form (e.g., PTO/SB/25, PTO/SB/26, PTO/AIA /25, or PTO/AIA /26) should be used. A web-based eTerminal Disclaimer may be filled out completely online using web-screens. An eTerminal Disclaimer that meets all requirements is auto-processed and approved immediately upon submission. For more information about eTerminal Disclaimers, refer to www.uspto.gov/patents/apply/applying-online/eterminal-disclaimer.
Claims 1-20 are rejected on the ground of nonstatutory double patenting as being unpatentable over Claims 2-11, 13-14, and 16-23 of Application 17/771,196 (now is U.S. Patent No. US 12236651 B2). Although the claims at issue are not identical, they are not patentably distinct from each other.
Claims 1, 11, and 20 of Instant (Child) Application 18/960,592 are determined to be obvious in light of Claims 2, 13, and 14 of Parent Application 17/771,196 (now is U.S. Patent No. US 12236651 B2) based on reasons below for having similar limitations.
Instant (Child) Application 18/960,592: Claims 1, 11, 20
Parent Application 17/771,196: Claims 2, 13, 14
1. A method of encoding a point cloud to generate a bitstream of compressed point cloud data representing a three-dimensional location of an object, the point cloud being represented by a tree and being generated by a plurality of beam emitters, the method comprising: a) encoding a first coordinate and a second coordinate of a point belonging to a current node of the tree, and computing a radius from the first and second encoded coordinates; b) determining a beam angle of a probing beam emitter, among the plurality of beam emitters, assumed to have acquired the point; c) initializing a range of values to all possible values for a third coordinate of the point; d) selecting a lower value and an upper value within the range of values, the lower value being selected from the lower half of the range and the upper value being selected from the upper half of the range; e) computing a lower angle based on the lower value and the radius, and computing an upper angle based on the upper value and the radius; f) selecting an angular context based on the lower angle, the upper angle and the beam angle; and g) entropy coding information representative of the third coordinate of the point based on the angular context to generate the bitstream of compressed point cloud data.
1. A method of decoding a bitstream of compressed point cloud data representing a three-dimensional location of an object, for generating a point cloud data, the compressed point cloud being represented by a tree and being generated by a device comprising a plurality of beam emitters, the method comprising: a) decoding a first coordinate and a second coordinate of a point belonging to a current node of the tree, and computing a radius from the first and second decoded coordinates; b) determining a beam angle of a probing beam emitter, among the plurality of beam emitters, assumed to have acquired the point; c) initializing a range of values to all possible values for a third coordinate of the point; d) selecting a lower value and an upper value within the range of values, the lower value being selected from the lower half of the range and the upper value being selected from the upper half of the range; e) computing a lower angle based on the lower value and the radius, and computing an upper angle based on the upper value and the radius; f) selecting an angular context based on the lower angle, the upper angle and the beam angle; and g) decoding information, from the bitstream, representative of the third coordinate based on the angular context.
11. An encoder for encoding a point cloud to generate a bitstream of compressed point cloud data, representing a three-dimensional location of a physical object, the point cloud being generated by a device comprising a plurality of beam emitters, the encoder comprising: a processor; a memory; an encoding application containing instructions executable by the processor that, when executed, cause the processor to: a) encode a first coordinate and a second coordinate of a point belonging to a current node of the tree, and computing a radius from the first and second encoded coordinates; b) determine a beam angle of a probing beam emitter, among the plurality of beam emitters, assumed to have acquired the point; c) initialize a range of values to all possible values for a third coordinate of the point; d) select a lower value and an upper value within the range of values, the lower value being selected from the lower half of the range and the upper value being selected from the upper half of the range; e) compute a lower angle based on the lower value and the radius, and computing an upper angle based on the upper value and the radius; f) select an angular context based on the lower angle, the upper angle and the beam angle; and g) entropy code information representative of the third coordinate of the point based on the angular context to generate the bitstream of compressed point cloud data.
11. A decoder for decoding a bitstream of compressed point cloud data to produce a reconstructed point cloud representing a three-dimensional location of a physical object, the point cloud being represented by a tree and generated by a device comprising a plurality of beam emitters, the decoder comprising: a processor; a memory; and a decoding application containing instructions executable by the processor that, when executed, cause the processor to: a) decode a first coordinate and a second coordinate of a point belonging to a current node of the tree, and compute a radius from the first and second decoded coordinates; b) determine a beam angle of a probing beam emitter, among the plurality of beam emitters, assumed to have acquired the point; c) initialize a range of values to all possible values for a third coordinate of the point; d) select a lower value and an upper value within the range of values, the lower value being selected from the lower half of the range and the upper value being selected from the upper half of the range; e) compute a lower angle based on the lower value and the radius, and computing an upper angle based on the upper value and the radius; f) select an angular context based on the lower angle, the upper angle and the beam angle; and g) decoding information, from the bitstream, representative of the third coordinate based on the angular context.
20. A non-transitory computer readable medium having stored thereon executable code for execution by a processor of an encoder for encoding a point cloud to generate a bitstream of compressed point cloud data representing a three-dimensional location of an object, the point cloud being represented by a tree and being generated by a plurality of beam emitters, the executable code comprising instructions for: a) encoding a first coordinate and a second coordinate of a point belonging to a current node of the tree, and computing a radius from the first and second encoded coordinates; b) determining a beam angle of a probing beam emitter, among the plurality of beam emitters, assumed to have acquired the point; c) initializing a range of values to all possible values for a third coordinate of the point; d) selecting a lower value and an upper value within the range of values, the lower value being selected from the lower half of the range and the upper value being selected from the upper half of the range; e) computing a lower angle based on the lower value and the radius, and computing an upper angle based on the upper value and the radius; f) selecting an angular context based on the lower angle, the upper angle and the beam angle; and g) entropy coding information representative of the third coordinate of the point based on the angular context to generate the bitstream of compressed point cloud data.
14. A non-transitory processor-readable medium storing processor-executable instructions for decoding a bitstream of compressed point cloud data to produce a reconstructed point cloud representing a three-dimensional location of a physical object, the point cloud being represented by a tree and generated by a device comprising a plurality of beam emitters, that, when executed by a processor, cause the processor to: a) decode a first coordinate and a second coordinate of a point belonging to a current node of the tree, and compute a radius from the first and second decoded coordinates; b) determine a beam angle of a probing beam emitter, among the plurality of beam emitters, assumed to have acquired the point; c) initialize a range of values to all possible values for a third coordinate of the point; d) select a lower value and an upper value within the range of values, the lower value being selected from the lower half of the range and the upper value being selected from the upper half of the range; e) compute a lower angle based on the lower value and the radius, and computing an upper angle based on the upper value and the radius; f) select an angular context based on the lower angle, the upper angle and the beam angle; and g) decode information, from the bitstream, representative of the third coordinate based on the angular context.
Although the claims at issue are not identical, they are not patentably distinct from each other. Claims 1, 11, and 20 of Instant Application 18/960,592 and Claims 2, 13, and 14 of Parent Application 17/771,196 (now is U.S. Patent No. US 12236651 B2) discloses nearly every single limitations that are identical to each other, except the instant (child) application discloses encoding a bitstream, whereas the parent application discloses decoding a bitstream. Although the parent case includes differing limitations “decoding information, from the bitstream, representative of the third coordinate based on the angular context” compared to the limitations of the instant application: “entropy coding information representative of the third coordinate of the point based on the angular context to generate the bitstream of compressed point cloud data”, the limitations of the parent application can be fully anticipated by the instant application based on the similarities between Claims 1, 11, and 20 of Instant Application 18/960,592 and Claims 2, 13, and 14 of Parent Application 17/771,196 (now is U.S. Patent No. US 12236651 B2).
Claims 2 and 12 of Instant (Child) Application 18/960,592 are determined to be obvious in light of Claims 3 and 16 of Parent Application 17/771,196 (now is U.S. Patent No. US 12236651 B2) based on reasons below for having similar limitations.
Instant (Child) Application 18/960,592: Claims 2 and 12
Parent Application 17/771,196: Claims 3 and 16
2. The method of claim 1, further comprising: h) updating the range of values depending on the coded information representative of the third coordinate; wherein steps d) to h) are repeated until the range of values comprises a single possible value.
3. The method of claim 2, further comprising: h) updating the range of values depending on the coded information representative of the third coordinate; wherein steps d) to h) are repeated until the range of values comprises a single possible value.
12. The encoder of claim 11, wherein the processer is further caused to: h) update the range of values depending on the coded information representative of the third coordinate; wherein steps d) to h) are repeated until the range of values comprises a single possible value.
16. The decoder of claim 13, wherein the processer is further caused to: h) update the range of values depending on the coded information representative of the third coordinate; wherein the processor repeats d) to h) until the range of values comprises a single possible value.
Claims 2 and 12 of Instant Application 18/960,592 recites effectively the same elements as Claims 3 and 16 of Parent Application 17/771,196 (now is U.S. Patent No. US 12236651 B2), differing only in the type of coder (i.e., encoder vs. decoder). For the same reasons given with respect to Claims 1, 11, and 20 of Instant Application 18/960,592 and Claims 2, 13, and 14 of Parent Application 17/771,196 (now is U.S. Patent No. US 12236651 B2), substituting the decoder for an encoder is an obvious variation. Therefore, Claims 2 and 12 of Instant (Child) Application 18/960,592 and Claims 3 and 16 of Parent Application 17/771,196 (now is U.S. Patent No. US 12236651 B2) are not patentably distinct.
Claims 3 and 13 of Instant (Child) Application 18/960,592 are determined to be obvious in light of Claims 4 and 17 of Parent Application 17/771,196 (now is U.S. Patent No. US 12236651 B2) based on reasons below for having similar limitations.
Instant (Child) Application 18/960,592: Claims 3 and 13
Parent Application 17/771,196: Claims 4 and 17
3. The method of claim 1, wherein the beam angle is corrected to account for a position of the probing beam emitter.
4. The method of claim 2, wherein the beam angle is corrected to account for a position of the probing beam emitter.
13. The encoder of claim 11, wherein the beam angle is corrected to account for a position of the probing beam emitter.
17. The decoder of claim 13, wherein the beam angle is corrected to account for a position of the probing beam emitter.
Claims 3 and 13 of Instant Application 18/960,592 recites effectively the same elements as Claims 4 and 17 of Parent Application 17/771,196 (now is U.S. Patent No. US 12236651 B2), differing only in the type of coder (i.e., encoder vs. decoder). For the same reasons given with respect to Claims 1, 11, and 20 of Instant Application 18/960,592 and Claims 2, 13, and 14 of Parent Application 17/771,196 (now is U.S. Patent No. US 12236651 B2), substituting the decoder for an encoder is an obvious variation. Therefore, Claims 3 and 13 of Instant (Child) Application 18/960,592 and Claims 4 and 17 of Parent Application 17/771,196 (now is U.S. Patent No. US 12236651 B2) are not patentably distinct.
Claim 10 of Instant (Child) Application 18/960,592 is determined to be obvious in light of Claim 11 of Parent Application 17/771,196 (now is U.S. Patent No. US 12236651 B2) based on reasons below for having similar limitations.
Instant (Child) Application 18/960,592: Claim 10
Parent Application 17/771,196: Claim 11
10. The method of claim 3, wherein the position of the probing beam emitter is included in the bitstream.
11. The method of claim 4, wherein the position of the probing beam emitter is included in the bitstream.
Claims 4 and 14 of Instant (Child) Application 18/960,592 are determined to be obvious in light of Claims 5 and 18 of Parent Application 17/771,196 (now is U.S. Patent No. US 12236651 B2) based on reasons below for having similar limitations.
Instant (Child) Application 18/960,592: Claims 4 and 14
Parent Application 17/771,196: Claims 5 and 18
4. The method of claim 1, further comprising, prior to step a): determining that the current node is eligible for Inferred Direct Coding Mode (IDCM) and that a current node corresponds exclusively with the probing beam emitter.
5. The method of claim 2, further comprising, prior to step a): determining that the current node is eligible for Inferred Direct Coding Mode (IDCM) and that a current node corresponds exclusively with the probing beam emitter.
14. The encoder of claim 11, wherein the processer is further caused to, prior to step a): determine that the current node is eligible for Inferred Direct Coding Mode (IDCM) and that a current node corresponds exclusively with the probing beam emitter.
18. The decoder of claim 13, wherein the processor is further caused to, prior to step a): determine that the current node is eligible for Inferred Direct Coding Mode (IDCM) and that a current node corresponds exclusively with the probing beam emitter.
Claims 4 and 14 of Instant Application 18/960,592 recites effectively the same elements as Claims 5 and 18 of Parent Application 17/771,196 (now is U.S. Patent No. US 12236651 B2), differing only in the type of coder (i.e., encoder vs. decoder). For the same reasons given with respect to Claims 1, 11, and 20 of Instant Application 18/960,592 and Claims 2, 13, and 14 of Parent Application 17/771,196 (now is U.S. Patent No. US 12236651 B2), substituting the decoder for an encoder is an obvious variation. Therefore, Claims 4 and 14 of Instant (Child) Application 18/960,592 and Claims 5 and 18 of Parent Application 17/771,196 (now is U.S. Patent No. US 12236651 B2) are not patentably distinct.
Claims 5 and 15 of Instant (Child) Application 18/960,592 are determined to be obvious in light of Claims 6 and 19 of Parent Application 17/771,196 (now is U.S. Patent No. US 12236651 B2) based on reasons below for having similar limitations.
Instant (Child) Application 18/960,592: Claims 5 and 15
Parent Application 17/771,196: Claims 6 and 19
5. The method of clam 1, wherein the current node is a node of a predicted point tree.
6. The method of claim 2, wherein the current node is a node of a predicted point tree.
15. The encoder of claim 11, wherein the current node is a node of a predicted point tree.
19. The decoder of claim 13, wherein the current node is a node of a predicted point tree.
Claims 5 and 15 of Instant Application 18/960,592 recites effectively the same elements as Claims 6 and 19 of Parent Application 17/771,196 (now is U.S. Patent No. US 12236651 B2), differing only in the type of coder (i.e., encoder vs. decoder). For the same reasons given with respect to Claims 1, 11, and 20 of Instant Application 18/960,592 and Claims 2, 13, and 14 of Parent Application 17/771,196 (now is U.S. Patent No. US 12236651 B2), substituting the decoder for an encoder is an obvious variation. Therefore, Claims 5 and 15 of Instant (Child) Application 18/960,592 and Claims 6 and 19 of Parent Application 17/771,196 (now is U.S. Patent No. US 12236651 B2) are not patentably distinct.
Claims 6 and 16 of Instant (Child) Application 18/960,592 are determined to be obvious in light of Claims 7 and 20 of Parent Application 17/771,196 (now is U.S. Patent No. US 12236651 B2) based on reasons below for having similar limitations.
Instant (Child) Application 18/960,592: Claims 6 and 16
Parent Application 17/771,196: Claims 7 and 20
6. The method of claim 5, further comprising determining predictive coordinates for the point associated with the current node and wherein the first, second and third coordinates are residual coordinates of the point respective to the predictive coordinates.
7. The method of claim 6, further comprising determining predictive coordinates for the point associated with the current node and wherein the first, second and third coordinates are residual coordinates of the point respective to the predictive coordinates.
16. The encoder of claim 15, wherein the processer is further caused to determine predictive coordinates for the point associated with the current node and wherein the first, second and third coordinates are residual coordinates of the point respective to the predictive coordinates.
20. The decoder of claim 13, wherein the processor is further caused to determine predictive coordinates for the point associated with the current node and wherein the first, second and third coordinates are residual coordinates of the point respective to the predictive coordinates.
Claims 6 and 16 of Instant Application 18/960,592 recites effectively the same elements as Claims 7 and 20 of Parent Application 17/771,196 (now is U.S. Patent No. US 12236651 B2), differing only in the type of coder (i.e., encoder vs. decoder). For the same reasons given with respect to Claims 1, 11, and 20 of Instant Application 18/960,592 and Claims 2, 13, and 14 of Parent Application 17/771,196 (now is U.S. Patent No. US 12236651 B2), substituting the decoder for an encoder is an obvious variation. Therefore, Claims 6 and 16 of Instant (Child) Application 18/960,592 and Claims 7 and 20 of Parent Application 17/771,196 (now is U.S. Patent No. US 12236651 B2) are not patentably distinct.
Claims 7 and 17 of Instant (Child) Application 18/960,592 are determined to be obvious in light of Claims 8 and 21 of Parent Application 17/771,196 (now is U.S. Patent No. US 12236651 B2) based on reasons below for having similar limitations.
Instant (Child) Application 18/960,592: Claims 7 and 17
Parent Application 17/771,196: Claims 8 and 21
7. The method of claim 6, wherein the range of values to all possible values for a third coordinate is initialized by: determining the length of the range based on information coded in the bitstream; and determining the center of the range as the third coordinate of predictive coordinates.
8. The method of claim 7, wherein the range of values to all possible values for a third coordinate is initialized by: determining the length of the range based on information coded in the bitstream; and determining the center of the range as the third coordinate of predictive coordinates.
17. The encoder of claim 16, wherein the range of values to all possible values for a third coordinate is initialized by: determining the length of the range based on information coded in the bitstream; and determining the center of the range as the third coordinate of predictive coordinates.
21. The decoder of claim 20, wherein the range of values to all possible values for a third coordinate is initialized by: determining the length of the range based on information coded in the bitstream; and determining the center of the range as the third coordinate of predictive coordinates.
Claims 7 and 17 of Instant Application 18/960,592 recites effectively the same elements as Claims 8 and 21 of Parent Application 17/771,196 (now is U.S. Patent No. US 12236651 B2), differing only in the type of coder (i.e., encoder vs. decoder). For the same reasons given with respect to Claims 1, 11, and 20 of Instant Application 18/960,592 and Claims 2, 13, and 14 of Parent Application 17/771,196 (now is U.S. Patent No. US 12236651 B2), substituting the decoder for an encoder is an obvious variation. Therefore, Claims 7 and 17 of Instant (Child) Application 18/960,592 and Claims 8 and 21 of Parent Application 17/771,196 (now is U.S. Patent No. US 12236651 B2) are not patentably distinct.
Claims 8 and 18 of Instant (Child) Application 18/960,592 are determined to be obvious in light of Claims 9 and 22 of Parent Application 17/771,196 (now is U.S. Patent No. US 12236651 B2) based on reasons below for having similar limitations.
Instant (Child) Application 18/960,592: Claims 8 and 18
Parent Application 17/771,196: Claims 9 and 22
8. The method of claim 1, wherein the lower value is selected to correspond to one quarter up the range and the upper value is selected to correspond to three quarters up the range.
9. The method of claim 2, wherein the lower value is selected to correspond to one quarter up the range and the upper value is selected to correspond to three quarters up the range.
18. The encoder of claim 11, wherein the lower value is selected to correspond to one quarter up the range and the upper value is selected to correspond to three quarters up the range.
22. The decoder of claim 13, wherein the lower value is selected to correspond to one quarter up the range and the upper value is selected to correspond to three quarters up the range.
Claims 8 and 18 of Instant Application 18/960,592 recites effectively the same elements as Claims 9 and 22 of Parent Application 17/771,196 (now is U.S. Patent No. US 12236651 B2), differing only in the type of coder (i.e., encoder vs. decoder). For the same reasons given with respect to Claims 1, 11, and 20 of Instant Application 18/960,592 and Claims 2, 13, and 14 of Parent Application 17/771,196 (now is U.S. Patent No. US 12236651 B2), substituting the decoder for an encoder is an obvious variation. Therefore, Claims 8 and 18 of Instant (Child) Application 18/960,592 and Claims 9 and 22 of Parent Application 17/771,196 (now is U.S. Patent No. US 12236651 B2) are not patentably distinct.
Claims 9 and 19 of Instant (Child) Application 18/960,592 are determined to be obvious in light of Claims 10 and 23 of Parent Application 17/771,196 (now is U.S. Patent No. US 12236651 B2) based on reasons below for having similar limitations.
Instant (Child) Application 18/960,592: Claims 9 and 19
Parent Application 17/771,196: Claims 10 and 23
9. The method of claim 1, wherein the beam angle of the probing beam emitter is included in the bitstream.
10. The method of claim 2, wherein the beam angle of the probing beam emitter is included in the bitstream.
19. The encoder of claim 11, wherein the beam angle of the probing beam emitter is included in the bitstream.
23. The decoder of claim 13, wherein the beam angle of the probing beam emitter is included in the bitstream.
Claims 9 and 19 of Instant Application 18/960,592 recites effectively the same elements as Claims 10 and 23 of Parent Application 17/771,196 (now is U.S. Patent No. US 12236651 B2), differing only in the type of coder (i.e., encoder vs. decoder). For the same reasons given with respect to Claims 1, 11, and 20 of Instant Application 18/960,592 and Claims 2, 13, and 14 of Parent Application 17/771,196 (now is U.S. Patent No. US 12236651 B2), substituting the decoder for an encoder is an obvious variation. Therefore, Claims 9 and 19 of Instant (Child) Application 18/960,592 and Claims 10 and 23 of Parent Application 17/771,196 (now is U.S. Patent No. US 12236651 B2) are not patentably distinct.
Allowable Subject Matter
Claims 1-20 would be allowable when the double patent rejection above is overcome.
The following is a statement of reasons for the indication of allowable subject matter: in Claim 1, the prior art of Chou et al. (US 20170347100 A1) teaches “A method of encoding a point cloud to generate a bitstream of compressed point cloud data representing a three-dimensional location of an object, the point cloud being represented by a tree and being generated by a plurality of beam emitters ([0037]: teaches a method; [0098]: teaches an encoder compressing geometry <read on 3D location of object> for point cloud data; [0032]: teaches for point cloud data, the input devices may be a set of depth cameras or similar devices <read on beam emitters> that capture video input used to derive point cloud data; [0054]: teaches an encoder receiving point cloud data from the input buffer, which then produces encoded data, where the encoder includes an octtree coder 320 <read on tree>; [0055]: teaches the octtree coder 320 compresses geometry data), the method comprising:…” Chou also teaches “a) encoding a first coordinate and a second coordinate of a point belonging to a current node of the tree ([0114]: teaches using a number of bits to encode geometry data (i.e., to indicate where the occupied points <read on first and second coordinates> are), where a unit cube <read on current node> can be sliced into two pieces through a planar cut)…” Chou also teaches “c) initializing a range of values to all possible values for a third coordinate of the point ([0224]: teaches a plurality of buckets associated with a range of multiple sub-bands (i.e., range of weights) <read on range of values>; [0208]: teaches a weight coefficient including
w
l
a
,
x
a
,
y
a
,
z
a
, where variables
x
a
,
y
a
, and
z
a
are being interpreted as possible third coordinate values for a point)…” Chou also teaches “d) selecting a lower value and an upper value within the range of values, the lower value being selected from the lower half of the range and the upper value being selected from the upper half of the range (FIG. 21 teaches selecting a group of points <read on lower and upper values> with at least one occupied point; [0209]: teaches
N
occupied points in a point cloud data and variable
n
indicating a coefficient index, where the coefficient index is in the range of
0
≦
n
<read on lower half of range> and
n
<
N
m
<read on upper half of range>)…” Chou also teaches “g) entropy coding information representative of the third coordinate of the point based on the angular context to generate the bitstream of compressed point cloud data ([0058]: teaches entropy coders 380 entropy coding quantized transform coefficients <read on entropy coding information> and encoding general control data, QP values, and other side information; FIG. 5 teaches storing encoded data as part of a bitstream).” Claims 11 and 20 are similar in scope to Claim 1, and they are taught under similar rationale.
However, Claims 1-20 are in indication of allowable subject matter because the prior art(s) fail to teach or suggest, either alone or in combination, in Claim 1: “computing a radius from the first and second encoded coordinates”, “b) determining a beam angle of a probing beam emitter, among the plurality of beam emitters, assumed to have acquired the point”, “e) computing a lower angle based on the lower value and the radius, and computing an upper angle based on the upper value and the radius”, and “f) selecting an angular context based on the lower angle, the upper angle and the beam angle”. The claimed invention highlights the use of angles and selected angular context based on said angles. Claims 11 and 20 are similar in scope to Claim 1, and they are taught under similar rationale.
As allowable subject matter has been indicated, applicant's reply must either comply with all formal requirements or specifically traverse each requirement not complied with. See 37 CFR 1.111(b) and MPEP § 707.07(a).
Conclusion
The prior art made of record and not relied upon is considered pertinent to applicant's disclosure.
Dussan (US 20160047903 A1) discloses LIDAR and radar point cloud compression techniques; and
Lukac et al. (US 9734595 B2) discloses an implementation of fast, near-lossless compression of 3D meshes and point cloud data.
Any inquiry concerning this communication or earlier communications from the examiner should be directed to KARL TRUONG whose telephone number is (703)756-5915. The examiner can normally be reached 10:30 AM - 7:30 PM.
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, Kent Chang can be reached at (571) 272-7667. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300.
Information regarding the status of published or unpublished applications may be obtained from Patent Center. Unpublished application information in Patent Center is available to registered users. To file and manage patent submissions in Patent Center, visit: https://patentcenter.uspto.gov. Visit https://www.uspto.gov/patents/apply/patent-center for more information about Patent Center and https://www.uspto.gov/patents/docx for information about filing in DOCX format. For additional questions, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000.
/K.D.T./Examiner, Art Unit 2614
/KENT W CHANG/Supervisory Patent Examiner, Art Unit 2614
Prosecution Insights