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 .
This application is a CON of 18/46028, which is a CON of 17/694,474 PAT 11790559, which is a CON of 17/462,901 PAT 11276204. Claims 2-21 are pending.
Information Disclosure Statement
The information disclosure statement (IDS) submitted on 04/09/2025, 08/07/2025 is in compliance with the provisions of 37 CFR 1.97. Accordingly, the information disclosure statements are being considered by the examiner.
Allowable Subject Matter
Claim 6, 13, and 19-21 objected to as being dependent upon a rejected base claim, but would be allowable if rewritten in independent form including all of the limitations of the base claim and any intervening claims.
Claim Rejections - 35 USC § 103
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.
Claim(s) 2-5, and 7-12, 14-18 is/are rejected under 35 U.S.C. 103 as being unpatentable over Bivolarsky et al. (US 2011/0206119, hereafter "Bivolarsky").
Regarding claim 1, Bivolarsy teaches: A computer-implemented method for compressing sparse multidimensional ordered series data, the method comprising:
identifying a plurality of local regions in a multidimensional ordered series data, wherein the data in each local region comprise one or more indexed data sets, each indexed data set comprising an index (n) within a given local region of the sparse multidimensional ordered series data and one or more variables that are indexed by the index (n); ([0073]; [0085], "At Step S2, each block b0 . . . b23 in the frequency domain is assigned an index value derived from one or more of its frequency domain coefficients. For example, the index value may represent the energy of the block. E.g. this may comprise an aggregate over the coefficients of the block, such as a number of zero coefficients, number of non-zero coefficients, or an average or total value of the moduli of the coefficients in each block.")
determining that a level of related content is present between current local region data of current multidimensional ordered series data and corresponding previous local region data of a previous multidimensional ordered series data is (Fig. 1; Fig. 2; [0074], "That is, one or more metrics of a current target block to be encoded are compared to the corresponding metrics of a plurality of other blocks, and a reference block is selected based on a measure of similarity of those metrics.")
wherein the level of related content is considered higher or equal to the threshold if a majority of one or more variables as a function of one or more subsets of the index (n) exist in both the current local region data and the previous local region data;selecting one or more predictors that calculate each of the one or more variables as a function of the one or more subsets of the index (n); (Fig. 1; Fig. 2; [0074], "That is, one or more metrics of a current target block to be encoded are compared to the corresponding metrics of a plurality of other blocks, and a reference block is selected based on a measure of similarity of those metrics.")
adjusting the current local region data by subtracting a scaled predicted related content data based on the previous local region data when the level of related content is higher or equal to the threshold ([0188], "That is, the encoder estimates a local prediction of the scaling to be applied to the selected reference block, subtracts the frequency domain coefficients of the scaled reference block from those of the target block so as to generate a residual (in practice this may just involve comparing the coefficients from shifted positions within the block)")
And encoding the adjusted current local region data, including one or more corresponding scale factors, into a compressed stream. ([0188], "In the case where an estimation of the scaling factor is used in the encoding, the residual will represent only the difference between the scaled prediction and the actual target block, and will be even smaller so require even fewer bits to encode. That is, the encoder estimates a local prediction of the scaling to be applied to the selected reference block, subtracts the frequency domain coefficients of the scaled reference block from those of the target block so as to generate a residual (in practice this may just involve comparing the coefficients from shifted positions within the block), and then encodes the target block in the form of the residual, an indication of the scaling parameter, and an indication of the reference block. The signalled scaling parameter enables the decoder to determine the shift or transition to apply to the frequency domain coefficients of the reference block in order to recreate the predicted version. Adding the frequency domain residual at the decoder then recreates the target block. Alternatively, in a non-lossless case the residual may be omitted from the encoding and decoding altogether.")
Bivolarsky does not expressly disclose deterring the level of correlation to be higher or equal to a threshold.
However, since the reference bloc is used for predicting the current block, ensuring the level of correlation is higher than a certain value would be obvious to someone ordinarily skilled in the art. Therefore, before the effective filing date of the claimed invention, it would have been obvious to a person in the art to yield the invention described in claim 2 from the teachings of Bivolarsky.
Regarding claim 3, Bivolarsky discloses the method of claim 2, but fails to disclose wherein the multidimensional ordered series data is spectrographic data.
However, it is quite obvious that Bivolarsky's method is generic in nature, hence can be used for compressing spectrographic data. Therefore, before the effective filing date of the claimed invention, it would have been obvious to a person having ordinary skill in the art to which the claimed invention pertains to yield the invention as described in claim 3 from the teachings of Bivolarsky.
Regarding claim 4, Bivolarsky discloses the method of claim 2, but fails to disclose wherein the multidimensional ordered series data is mass spectrometry data
However, it is quite obvious that Bivolarsky's method is generic in nature, hence can be used for compressing spectrographic data. Therefore, before the effective filing date of the claimed invention, it would have been obvious to a person having ordinary skill in the art to which the claimed invention pertains to yield the invention as described in claim 3 from the teachings of Bivolarsky.
Regarding claim 5, Bivorlarsky teaches: The method of claim 4, wherein the level of related content is computed from a subset of related peaks present in the current local region data and at least one previous local region data. ([0151], "Further, the sort index need not necessarily be a measure of block energy. Another possibility would be a metric relating to the structure of the block, such as the structural similarity index (SSIM). In other embodiments, multiple metrics could be combined in order to determine the index used for sorting. Furthermore, once the list is sorted, aspects of the invention need not necessarily be limited to finding the best match from amongst the candidates based on bitrate contribution. Other second metrics could be used for this purpose, e.g. a more conventional motion based matching as used in H.264.")
Regarding claim 7, Bivorlarsky teaches: The method of claim 2, wherein an encoder encodes an identifier identifying at least one previous local region data. ([0104], "The identity of the reference block may be represented in the encoded bitstream as an absolute block location within a frame")
Regarding claim 8, Bivorlarsky teaches: The method of claim 2, further comprising processing the plurality of local regions in an order, wherein the steps of selecting the one or more predictors, adjusting the current local region data and encoding the adjusted current local region data are repeated for each local region in the order. ([0120], "Start e.g. with the first block in the current frame/slice in the raster-scan order…")
Regarding claim 9, Bivorlarsky teaches: The method of claim 8, wherein the order is a scan order or raster-scan order. ([0120], "Start e.g. with the first block in the current frame/slice in the raster-scan order…")
Regarding claim 10, Bivorlarsky teaches: The method of claim 8, wherein the order is selected from an order having a highest related content level. ([0119], "The search for the optimal predictor can be made computationally more efficient by pre-ordering the candidates such that potential good candidates are located in the proximity of a specific position in an ordered array")
Regarding claim 11, Bivorlarsky teaches: The method of claim 2, wherein the multidimensional ordered series data is image data. (Fig. 1)
Regarding claim 12, Bivorlarsky teaches: The method of claim 11, wherein the level of related content is computed from a subset of related image features present in the current local region data and the at least one previous local region data. ([0151], "Further, the sort index need not necessarily be a measure of block energy. Another possibility would be a metric relating to the structure of the block, such as the structural similarity index (SSIM). In other embodiments, multiple metrics could be combined in order to determine the index used for sorting. Furthermore, once the list is sorted, aspects of the invention need not necessarily be limited to finding the best match from amongst the candidates based on bitrate contribution. Other second metrics could be used for this purpose, e.g. a more conventional motion based matching as used in H.264.")
Claims 14-16 have been analyzed and are rejected for the reasons outlined above regarding claims 2-5 respectively.
Regarding claim 17, Bivorlarsky teaches: The system of claim 14, further comprising dividing the multidimensional ordered series data into the plurality of local regions, wherein the plurality of local regions are overlapping local regions. (Fig. 14(a); [0212], “Say now that the pixel grid is offset right by approximately half a pixel and down by approximately half a pixel, either because the camera moves slightly or because the scene or object being captured moves relative to the camera. If this movement is known or can be estimated, then it is possible to reconstruct a higher resolution image by superimposing the values captured from the two offset grids. In the example of FIG. 14a this results in four "super-resolution" pixels A, B, C and D for each actual physical pixel of the camera's sensor array. Each super-resolution pixel value may be determined for example by interpolating between the two overlapping real pixel values which contribute to it.”)
Regarding claim 18, Bivorlarsky teaches: The system of claim 14, further comprising dividing the multidimensional ordered series data into the plurality of local regions, wherein the plurality of local regions are non-overlapping local regions. (Fig. 1)
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.
Claim 2-3 is rejected on the ground of nonstatutory double patenting as being unpatentable over claim 8 of U.S. Patent No. 2024/0070923 A1. Although the claims at issue are not identical, they are not patentably distinct from each other.
The patent claims 8 include all of the instant applications claims 2-3. The instant application claims are anticipated by the patent claims and therefore not patentably distinct.
Conclusion
Any inquiry concerning this communication or earlier communications from the examiner should be directed to Jinsu Hwang whose telephone number is (703)756-1370. The examiner can normally be reached Mon -Thu 10am-8am EST.
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, Matthew Bella can be reached at (571) 272-7778. 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.
/JINSU HWANG/Examiner, Art Unit 2667 /MATTHEW C BELLA/Supervisory Patent Examiner, Art Unit 2667