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 communication is responsive to the correspondence filled on 8/19/24.
Claims 1-20 are presented for examination.
IDS Considerations
The information disclosure statement (IDS) submitted on 3/15/25 is/are being considered by the examiner as the submission is in compliance with the provisions of 37 CFR 1.97.
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.
Claims 1, 12 and 20 is/are rejected under 35 U.S.C. 103 as being unpatentable over Nakayama (U.S. Pub. No. 20080069464 A1), in view of Huang (U.S. Pub. No. 20190215519 A1).
Regarding to claim 1, 12 and 20:
1. Nakayama teach a method comprising: buffering a lane of pixel data, (Nakayama Fig. 3 [0116] On the other hand, the control unit 150 instructs the resolution converting unit 107 to reduce the horizontal and vertical resolutions of input tile [lane of pixel] data to 1/4, so as to execute resolution conversion of the tile data in the buffer 105. As a result, the resolution converting unit 107 reduces the horizontal and vertical resolutions of the newly input image data to 1/4 (600 dpi) via the buffer 105. As a tile determined as that to be lossy-encoded, 600-dpi data that has undergone the resolution conversion is stored in the memory 111. In this way, the non-encoded data size is reduced to 1/16 to allow the lossy encoding processing within one page time period) wherein the lane comprises a collection of pixel array tiles; (Nakayama [0086] The image data 401 is divided into tiles each having a size of, e.g., 32.times.32 pixels, and these tile data are input. Such image data having a size of 32.times.32 pixels will be merely referred to as tile data hereinafter. The lossless encoding unit 101 lossless-encodes the input tile data to generate lossless encoded data, and outputs the lossless encoded data to a selection unit 109. Also, the lossless encoding unit 101 obtains the aforementioned image attribute information for each tile, and outputs it to the determination unit 103. The determination unit 103 determines based on this image attribute information whether the tile data of interest is to be finally lossless-encoded or lossy-encoded) analyzing the lane of pixel data for sparse data (Nakayama [0140] the number of times of determination indicating that the density [sparse data] (or luminance) difference between two neighboring pixels in a tile is equal to or larger than a predetermined threshold; [0141] the median or variance of a histogram generated to have the density (or luminance) difference between two neighboring pixels in a tile as the horizontal axis;)
Nakayama do not explicitly teach determining, based on the analysis, whether a lossless compression of the lane would be smaller than a predetermined threshold; performing lossless compression on the lane of pixel data if a result of the lossless compression would take up less space than the predetermined threshold of space; and performing lossy compression on the lane of pixel data if a result of the lossless compression would take up more space than the predetermined threshold of space.
However Huang teach and determining, based on the analysis, whether a lossless compression of the lane would be smaller than a predetermined threshold; (Huang Fig. 6 [0007] compressing the k.sup.th compression unit using the predetermined lossless compression algorithm, if the accumulated compression cost does not exceed the accumulated buffer budget by a predefined value; or adjusting a quantization level of a predetermined lossy compression algorithm to maintain that the accumulated compression cost does not exceed the accumulated buffer budget by the predefined value, and compressing the k.sup.th compression unit using the predefined lossy compression algorithm with the adjusted quantization level, if the accumulated compression cost exceeds the accumulated buffer budget by the predefined value; wherein the predetermined lossy compression algorithm is a lossy compression algorithm configured with the quantization level, and the predefined value defines a threshold range by which the accumulated compression cost is allowed to exceed the accumulated buffer budget.)
performing lossless compression on the lane of pixel data if a result of the lossless compression would take up less space than the predetermined threshold of space; and performing lossy compression on the lane of pixel data if a result of the lossless compression would take up more space than the predetermined threshold of space. (Huang Fig. 6 [0067] Based on the comparison between the accumulated compression cost and the accumulated buffer budget [space], it may be determined whether to use a lossless compression algorithm or a lossy compression algorithm to compress the k.sup.th compression unit)
It would have been obvious before the effective filing date of the claimed invention to a person having ordinary skill in the art to modify Nakayama, further incorporating Huang in video/camera technology. One would be motivated to do so, to incorporate performing lossless compression on the lane of pixel data if a result of the lossless compression would take up less space than the predetermined threshold of space; and performing lossy compression on the lane of pixel data if a result of the lossless compression would take up more space than the predetermined threshold of space. This functionality will improve efficiency with predictable results.
Allowable subject matter
Regarding to claim 2-11 and 13-19:
Claims 2-11 and 13-19 is/are 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 because the limitations of these dependent claims are not obvious from the prior art search when all the limitations of independent and intervening claims are taken into account.
Regarding to claim 7 and 18:
7. Nakayama and Huang teach the method of claim 1, further comprising: identifying a set of physical memory hardware components and at least one battery within a resource-constrained computing device; identifying a step of a processing task on the resource-constrained computing device; (Huang Fig. 6)
Following limitation are not taught or obvious from the prior art search when claim 1 and claim 7 are considered as a whole -
predicting a portion of the set of physical memory hardware components that will be used for the step of the processing task and a remainder of the set of physical memory hardware components that will not be used for the step of the processing task; and providing power from the at least one battery to the portion of the set of physical memory hardware components predicted to be used for the step of the processing task while preventing the remainder of the set of physical memory hardware components from consuming the power from the at least one battery.
Conclusion
Any inquiry concerning this communication or earlier communications from the examiner should be directed to NASIM N NIRJHAR whose telephone number is (571) 272-3792. The examiner can normally be reached on Monday - Friday, 8 am to 5 pm ET.
If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, William F Kraig can be reached on (571) 272-8660. 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.
/NASIM N NIRJHAR/Primary Examiner, Art Unit 2896
Prosecution Insights