DETAILED ACTION
This Office Action is in response to the Amendment filed on 08/14/2025, wherein claims 1-26 have been cancelled. Claims 27-46 have been examined and are pending.
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 .
Priority
Acknowledgment is made of applicant’s claim for foreign priority under 35 U.S.C. 119 (a)-(d). The certified copy has been filed in parent Application No. EP 19305824.5, filed on 06/24/2019.
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 27, 30, 39 and 41 are rejected on the ground of nonstatutory double patenting as being unpatentable over claims 37, 1, 42 and 31, respectively, of U.S. Patent No. US 12,262,050. Although the claims at issue are not identical, they are not patentably distinct from each other as in table below.
Application No. 19/056,666
US 12,262,050
Claim 27
An apparatus comprising:
one or more processors configured to: determine, from among a plurality of decoded pixels neighboring a block of picture information, a plurality of reference samples;
interpolate a value associated with prediction of a pixel of the block based on the plurality of reference samples and a quadratic model, the quadratic model comprising a portion based on a piecewise linear approximation; and
decode at least a portion of the picture information based on the value.
Claim 39
A method of decoding comprising: determining, from among a plurality of decoded pixels neighboring a block of picture information, a plurality of reference samples;
interpolating a value associated with prediction of a pixel of the block based on the plurality of reference samples and a quadratic model, the quadratic model comprising a portion based on a piecewise linear approximation; and
decoding at least a portion of the picture information based on the value.
Claim 30
The apparatus of claim 27, wherein the one or more processors are further configured to:
determine, from among the plurality of reference samples, two reference samples nearest to a location of a predictor sample, the two reference samples comprising a first reference sample located on a first side of the predictor sample and a second reference sample located on a second side of the predictor sample;
determine an absolute value of a difference between the two reference samples nearest to the location of the predictor sample; and
compare the absolute value of the difference with a threshold value.
Claim 41
The method of claim 39, further comprising:
determining, from among the plurality of reference samples, two reference samples nearest to a location of a predictor sample, the two reference samples comprising a first reference sample located on a first side of the predictor sample and a second reference sample located on a second side of the predictor sample;
determining an absolute value of a difference between the two reference samples nearest to the location of the predictor sample; and
comparing the absolute value of the difference with a threshold value.
Claim 37
Apparatus comprising:
one or more processors configured to determine a value associated with a prediction of a pixel of a block of picture information, the block of picture information having a top and a left, wherein the prediction is based on an intra-prediction along a non-diagonal direction,
determine, from among a plurality of pixels neighboring the block on the top and the left, at least four reference samples for the block based on the non-diagonal direction, and wherein the one or more processors being configured to determine the value comprises the one or more processors being further configured to perform an interpolation based on a quadratic model and the at least four reference samples, the quadratic model comprising a linear portion and a quadratic portion, and the quadratic portion being based on a piecewise linear approximation; and
decode at least a portion of the picture information based on the value.
Claim 1
A method comprising:
determining a value associated with a prediction of a pixel of a block of picture information, the block of picture information having a top and a left, wherein the prediction is based on an intra-prediction along a non-diagonal direction,
determine, from among a plurality of pixels neighboring the block on the top and the left, at least four reference samples for the block based on the non-diagonal direction, and wherein the one or more processors being configured to determine the value comprises the one or more processors being further configured to perform an interpolation based on a quadratic model and the at least four reference samples, the quadratic model comprising a linear portion and a quadratic portion, and the quadratic portion being based on a piecewise linear approximation; and
decoding at least a portion of the picture information based on the value.
Claim 42
The apparatus of claim 41, wherein the one or more processors are further configured to
determine, from among the at least four reference samples, two reference samples nearest to the location of the prediction sample, one on each side of the location of the predictor sample;
determine an absolute of a difference between the values of the two reference samples nearest to the location of the predictor sample; and
compare the absolute value of the difference with threshold value.
Claim 31
The method of claim 30, further comprising:
determining, from among the at least four reference samples, two reference samples nearest to the location of the prediction sample, one on each side of the location of the predictor sample;
determining an absolute of a difference between the values of the two reference samples nearest to the location of the predictor sample; and
comparing the absolute value of the difference with threshold value.
Claim Rejections - 35 USC § 102
The following is a quotation of the appropriate paragraphs of 35 U.S.C. 102 that form the basis for the rejections under this section made in this Office action:
A person shall be entitled to a patent unless –
(a)(1) the claimed invention was patented, described in a printed publication, or in public use, on sale, or otherwise available to the public before the effective filing date of the claimed invention.
Claims 27-29 and 39-40 are rejected under AIA 35 U.S.C. 102(a)(1) as being anticipated by Elyousfi et al. (“Fast Intra Prediction Algorithm for H.264/AVC Based on Quadratic and Gradient Model”) hereinafter Elyousfi.
Regarding claim 27, Elyousfi discloses an apparatus comprising: one or more processors (Elyousfi Page 33, V: processor) configured to:
determine, from among a plurality of decoded pixels neighboring a block of picture information, a plurality of reference samples; interpolate a value associated with prediction of a pixel of the block based on the plurality of reference samples and a quadratic model, the quadratic model comprising a portion based on a piecewise linear approximation; and decode at least a portion of the picture information based on the value (Elyousfi Fig. 2, Pages 29-31, Section IIIA-IIIB: quadratic prediction method using known pixels
Y
x
0
,
Y
0
y
, along top row and left column which are four reference pixels neighboring the unknown block on the top and the left. Quadradic model as in equation (3). Prediction of pixels using the quadradic prediction function and decoded pixels. Pixels of different homogeneity and homogenous area are predicted with different equations (4)-(9) and (6) which have piecewise linear approximation).
Regarding claim 39, Elyousfi discloses a method of decoding comprising:
determining, from among a plurality of decoded pixels neighboring a block of picture information, a plurality of reference samples; interpolating a value associated with prediction of a pixel of the block based on the plurality of reference samples and a quadratic model, the quadratic model comprising a portion based on a piecewise linear approximation; and decoding at least a portion of the picture information based on the value (Elyousfi Fig. 2, Pages 29-31, Section IIIA-IIIB: quadratic prediction method using known pixels
Y
x
0
,
Y
0
y
, along top row and left column which are four reference pixels neighboring the unknown block on the top and the left. Quadradic model as in equation (3). Prediction of pixels using the quadradic prediction function and decoded pixels. Pixels of different homogeneity and homogenous area are predicted with different equations (4)-(9) and (6) which have piecewise linear approximation).
Regarding claims 28 and 40, Elyousfi disclose all limitations of claims 27 and 39, respectively.
Elyousfi discloses the piecewise linear approximation comprises a first linear portion and a second linear portion (Elyousfi Fig. 2, Pages 29-31, Section IIIA-IIIB: Quadradic model as in equation (3). Prediction of pixels using the quadradic prediction function and decoded pixels. Pixels of different homogeneity and homogenous area are predicted with different equations (4)-(9) which has first and second piecewise linear approximation).
Regarding claim 29, Elyousfi disclose all limitations of claim 28.
Elyousfi discloses the first linear portion and the second linear portion extend between at least a first reference sample in the plurality of reference samples and a second reference sample in the plurality of reference samples (Elyousfi Fig. 2, Pages 29-31, Section IIIA-IIIB: quadratic prediction method using known pixels
Y
x
0
,
Y
0
y
, along top row and left column which are four reference pixels neighboring the unknown block on the top and the left).
Claim Rejections - 35 USC § 103
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 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.
The factual inquiries for establishing a background for determining obviousness under 35 U.S.C. 103 are summarized as follows:
1. Determining the scope and contents of the prior art.
2. Ascertaining the differences between the prior art and the claims at issue.
3. Resolving the level of ordinary skill in the pertinent art.
4. Considering objective evidence present in the application indicating obviousness or nonobviousness.
Claims 30-31 and 41-42 are rejected under AIA 35 U.S.C. 103 as being unpatentable over Elyousfi et al. (“Fast Intra Prediction Algorithm for H.264/AVC Based on Quadratic and Gradient Model”) hereinafter Elyousfi, in view of Joshi et al. (US 2015/0023405) hereinafter Joshi.
Regarding claims 30 and 41, Elyousfi disclose all limitations of claims 27 and 39, respectively.
Elyousfi discloses wherein the one or more processors are further configured to: determine, from among the plurality of reference samples, two reference samples nearest to a location of a predictor sample, the two reference samples comprising a first reference sample located on a first side of the predictor sample and a second reference sample located on a second side of the predictor sample (Elyousfi Fig. 2, Pages 29-31, Section IIIA-IIIB: quadratic prediction method using known pixels
Y
x
0
,
Y
0
y
, along top row and left column which are four reference pixels neighboring the unknown block on the top and the left).
Elyousfi does not explicitly disclose determine an absolute value of a difference between the two reference samples nearest to the location of the predictor sample; and compare the absolute value of the difference with a threshold value.
However, Joshi discloses determine an absolute value of a difference between the two reference samples nearest to the location of the predictor sample; and compare the absolute value of the difference with a threshold value (Joshi [0178], [0114], [0148]-[0149]: determine whether to use bilinear interpolation if absolute difference between two reference samples that will be used for prediction is greater than or less than a threshold, wherein the reference samples can be neighboring reference samples).
It would have been obvious to a person of ordinary skill in the art before the effective filing date of the claimed invention to use the system and method, as disclosed by Elyousfi, and further incorporate determining an absolute value of a difference between the two reference samples nearest to the location of the predictor sample; and compare the absolute value of the difference with a threshold value, as taught by Joshi, to use appropriate prediction when needed to improve coding (Joshi [0178], [0148]-[0149]).
Regarding claims 31 and 42, Elyousfi and Joshi disclose all limitations of claims 30 and 41, respectively.
Elyousfi does not explicitly disclose wherein the one or more processors are further configured to: on a condition that the absolute value of the difference is less than the threshold value, interpolate a second value associated with prediction of a second pixel of the block based on a linear interpolation and the two reference samples nearest to the location of the predictor sample.
However, Joshi discloses wherein the one or more processors are further configured to: on a condition that the absolute value of the difference is less than the threshold value, interpolate a second value associated with prediction of a second pixel of the block based on a linear interpolation and the two reference samples nearest to the location of the predictor sample
(Joshi [0178], [0114], [0148]-[0149]: determine to use bilinear neighbor interpolation if absolute difference between two reference samples that will be used for prediction is less than a threshold, hence, linear interpolation using two reference samples as in [0114]).
It would have been obvious to a person of ordinary skill in the art before the effective filing date of the claimed invention to use the system and method, as disclosed by Elyousfi, and further incorporate having wherein the one or more processors are further configured to: on a condition that the absolute value of the difference is less than the threshold value, interpolate a second value associated with prediction of a second pixel of the block based on a linear interpolation and the two reference samples nearest to the location of the predictor sample, as taught by Joshi, to use appropriate prediction when needed to improve coding (Joshi [0178], [0148]-[0149]).
Claims 33, 35 and 44-45 are rejected under AIA 35 U.S.C. 103 as being unpatentable over Elyousfi et al. (“Fast Intra Prediction Algorithm for H.264/AVC Based on Quadratic and Gradient Model”) hereinafter Elyousfi, in view of Bang et al. (US 2021/0289201) hereinafter Bang.
Regarding claims 33 and 44, Elyousfi discloses all limitations of claims 27 and 39, respectively.
Elyousfi discloses wherein the one or more processors are further configured to: determine, from among the plurality of decoded pixels neighboring the block of the picture information, a second plurality of reference samples; interpolate a second value associated with prediction of a second pixel of the block based on the second plurality of reference samples and a quadratic model approximation, the quadratic model approximation employing quadratic term values stored in memory; and decode at least a portion of the picture information based on the second value (Elyousfi Fig. 2, Pages 29-31, Section IIIA-IIIB: quadratic prediction method to predict multiple pixels, hence second pixel, using known pixels
Y
x
0
,
Y
0
y
, along top row and left column which are four reference pixels neighboring the unknown block on the top and the left. Quadradic model as in equation (3). Prediction of pixels using the quadradic prediction function and decoded pixels. Pixels of different homogeneity and homogenous area are predicted with different equations (4)-(9) and (6) which have piecewise linear approximation).
Elyousfi does not explicitly disclose the quadratic model approximation employing quadratic term values stored in memory.
However, Bang discloses the prediction model approximation employing term values stored in memory (Bang [0196]: perdition using linear model when the model parameters are stored as in [0383], [0385]; [0257], [0259], [0266], [0275]: memory is used).
It would have been obvious to a person of ordinary skill in the art before the effective filing date of the claimed invention to use the system and method using quadratic model approximation, as disclosed by Elyousfi, and further incorporate having the quadratic model approximation employing quadratic term values stored in memory, as taught by Bang, for high-efficiency image coding (Bang [0002]).
Regarding claims 35 and 45, Elyousfi discloses all limitations of claims 27 and 39, respectively.
Elyousfi discloses wherein the one or more processors are further configured to: determine, from among the plurality of decoded pixels neighboring the block of the picture information, a second plurality of reference samples; interpolate a second value associated with prediction of a second pixel of the block based on the second plurality of reference samples and a function approximation, the function approximation employing function term values stored in memory; and decode at least a portion of the picture information based on the second value (Elyousfi Fig. 2, Pages 29-31, Section IIIA-IIIB: quadratic prediction method to predict multiple pixels, hence second pixel, using known pixels
Y
x
0
,
Y
0
y
, along top row and left column which are four reference pixels neighboring the unknown block on the top and the left. Quadradic model as in equation (3). Prediction of pixels using the quadradic prediction function and decoded pixels. Pixels of different homogeneity and homogenous area are predicted with different equations (4)-(9) and (6) which have piecewise linear approximation).
Elyousfi does not explicitly disclose the function approximation employing function term values stored in memory.
However, Bang discloses determine, from among the plurality of decoded pixels neighboring the block of the picture information, a second plurality of reference samples; interpolate a second value associated with prediction of a second pixel of the block based on the second plurality of reference samples and a function approximation, the function approximation employing function term values stored in memory; and decode at least a portion of the picture information based on the second value (Bang [0196]: prediction model parameters are stored as in [0383], [0385]; [0257], [0259], [0266], [0275]: memory is used).
It would have been obvious to a person of ordinary skill in the art before the effective filing date of the claimed invention to use the system and method, as disclosed by Elyousfi, and further incorporate having the function approximation employing function term values stored in memory, as taught by Bang, for high-efficiency image coding (Bang [0002]).
Claims 34 and 36 are rejected under AIA 35 U.S.C. 103 as being unpatentable over Elyousfi et al. (“Fast Intra Prediction Algorithm for H.264/AVC Based on Quadratic and Gradient Model”) hereinafter Elyousfi, in view of Bang et al. (US 2021/0289201) hereinafter Bang, further in view of Zhang et al. (US 12,537,938) hereinafter Zhang.
Regarding claim 34, Elyousfi and Bang discloses all limitations of claim 33.
Elyousfi does not explicitly disclose wherein the quadratic term values are stored in an array of 32 elements.
However, Bang discloses the prediction term values are stored in an array of NxM elements (Bang [0384]: the prediction model parameter can be stored in NxM basis).
It would have been obvious to a person of ordinary skill in the art before the effective filing date of the claimed invention to use the system and method having quadratic prediction, as disclosed by Elyousfi, and further incorporate having the quadratic term values are stored in an array of NxM elements, as taught by Bang, for high-efficiency image coding (Bang [0002]).
Furthermore, Zhang discloses prediction term values can include 32 elements (Zhang Col. 31, Table 8-13: table for interpolation filter coefficient for each 1/32 fractional sample position, hence interpolation term values include 32 elements, hence array of 32 elements).
It would have been obvious to a person of ordinary skill in the art before the effective filing date of the claimed invention to use the system and method with quadratic interpolation, as disclosed by Elyousfi and Bang, and further incorporate having stored quadratic term values include 32 elements, hence stored in array of 32 elements, as taught by Zhang, to improve quality of image coding (Zhang Col. 5, lines 1-15).
Regarding claim 36, Elyousfi and Bang discloses all limitations of claim 35.
Elyousfi does not explicitly disclose wherein the function term values are stored in an array of 32 elements.
However, Bang discloses the function term values are stored in an array of NxM elements (Bang [0384]: the prediction model parameter can be stored in NxM basis).
It would have been obvious to a person of ordinary skill in the art before the effective filing date of the claimed invention to use the system and method having quadratic prediction, as disclosed by Elyousfi, and further incorporate having the function term values are stored in an array of NxM elements, as taught by Bang, for high-efficiency image coding (Bang [0002]).
Furthermore, Zhang discloses prediction function term values can include 32 elements (Zhang Col. 31, Table 8-13: table for interpolation filter coefficient for each 1/32 fractional sample position, hence interpolation term values include 32 elements, hence array of 32 elements).
It would have been obvious to a person of ordinary skill in the art before the effective filing date of the claimed invention to use the system and method with quadratic interpolation, as disclosed by Elyousfi and Bang, and further incorporate having stored function term values include 32 elements, hence stored in array of 32 elements, as taught by Zhang, to improve quality of image coding (Zhang Col. 5, lines 1-15).
Claims 37-38 and 46 are rejected under AIA 35 U.S.C. 103 as being unpatentable over Elyousfi et al. (“Fast Intra Prediction Algorithm for H.264/AVC Based on Quadratic and Gradient Model”) hereinafter Elyousfi, in view of Chou et al. (US 7,321,400) hereinafter Chou, further in view of Lin et al. (US 2017/0150180) hereinafter Lin.
Regarding claim 37, Elyousfi disclose all limitations of claim 27.
Elyousfi discloses interpolate a second value associated with prediction of a second pixel of the block based on the plurality of reference samples and the quadratic model; and decode at least a portion of the picture information based on the second value (Elyousfi Fig. 2, Pages 29-31, Section IIIA-IIIB: quadratic prediction method to predict multiple pixels, hence second pixel, using known pixels
Y
x
0
,
Y
0
y
, along top row and left column which are four reference pixels neighboring the unknown block on the top and the left. Quadradic model as in equation (3). Prediction of pixels using the quadradic prediction function and decoded pixels. Pixels of different homogeneity and homogenous area are predicted with different equations (4)-(9) and (6) which have piecewise linear approximation).
Elyousfi does not explicitly disclose interpolate the second value on a condition a flag is identified.
Chou discloses interpolate a second value associated with prediction of a second pixel of the block based on the plurality of reference samples and the quadratic model (Chou Col. 1, lines 59-67: interpolating pixels using interpolation filter including a quadratic filter, hence quadratic model).
Furthermore, Lin discloses on a condition a flag is identified: interpolate a second value associated with prediction of a second pixel of the block based on the plurality of reference samples and the prediction model; and decode at least a portion of the picture information based on the second value (Lin [0024]-[0028]: prediction pixels using different filters including 4-tap filter, bi-linear filter, cubic filter or Gaussian Filter; [0029]-[0030]: a filter flag indicative of the interpolation filter used is included in the bitstream. Hence, interpolating a pixel on a condition a flag is identified).
It would have been obvious to a person of ordinary skill in the art before the effective filing date of the claimed invention to use the system and method having the quadratic prediction model including quadratic filter, as disclosed by Elyousfi and Chou, and further incorporate having on a condition a flag is identified: interpolate a second value associated with prediction of a second pixel of the block based on the plurality of reference samples and the prediction model; and decode at least a portion of the picture information based on the second value, as taught by Lin, for improved adaptive image interpolation and coding efficient and video quality (Chou Col. 2, lines 39-45, Lin [0003]).
Regarding claim 38, Elyousfi and Chou and Lin disclose all limitations of claim 37.
Elyousfi discloses wherein the flag is comprised in at least one of a slice header, a Picture Parameter Set (PPS), or a Sequence Parameter Set (SPS).
However, Lin discloses wherein the flag is comprised in at least one of a slice header, a Picture Parameter Set (PPS), or a Sequence Parameter Set (SPS) (Lin [0029]-[0030]: the filter flag can be in sequence parameter set SPS or picture parameter set PPS).
It would have been obvious to a person of ordinary skill in the art before the effective filing date of the claimed invention to use the system and method having the quadratic prediction model including quadratic filter, as disclosed by Elyousfi and Chou and Lin, and further incorporate having wherein the flag is comprised in at least one of a slice header, a Picture Parameter Set (PPS), or a Sequence Parameter Set (SPS), as taught by Lin, for improved adaptive image interpolation and coding efficient and video quality (Chou Col. 2, lines 39-45, Lin [0003]).
Regarding claim 46, Elyousfi disclose all limitations of claim 39.
Elyousfi discloses interpolating a second value associated with prediction of a second pixel of the block based on the plurality of reference samples and the quadratic model; and decoding at least a portion of the picture information based on the second value (Elyousfi Fig. 2, Pages 29-31, Section IIIA-IIIB: quadratic prediction method to predict multiple pixels, hence second pixel, using known pixels
Y
x
0
,
Y
0
y
, along top row and left column which are four reference pixels neighboring the unknown block on the top and the left. Quadradic model as in equation (3). Prediction of pixels using the quadradic prediction function and decoded pixels. Pixels of different homogeneity and homogenous area are predicted with different equations (4)-(9) and (6) which have piecewise linear approximation).
Elyousfi does not explicitly disclose interpolate the second value on a condition a flag is identified.
Chou discloses interpolate a second value associated with prediction of a second pixel of the block based on the plurality of reference samples and the quadratic model (Chou Col. 1, lines 59-67: interpolating pixels using interpolation filter including a quadratic filter, hence quadratic model).
Furthermore, Lin discloses on a condition a flag is identified in at least one of a slice header, a Picture Parameter Set (PPS), or a Sequence Parameter Set (SPS): interpolating a second value associated with prediction of a second pixel of the block based on the plurality of reference samples and the prediction model; and decoding at least a portion of the picture information based on the second value (Lin [0024]-[0028]: prediction pixels using different filters including 4-tap filter, bi-linear filter, cubic filter or Gaussian Filter; [0029]-[0030]: a filter flag indicative of the interpolation filter used is included in the bitstream. Hence, interpolating a pixel on a condition a flag is identified. The filter flag can be in sequence parameter set SPS or picture parameter set PPS).
It would have been obvious to a person of ordinary skill in the art before the effective filing date of the claimed invention to use the system and method having the quadratic prediction model including quadratic filter, as disclosed by Elyousfi and Chou, and further incorporate having on a condition a flag is identified in at least one of a slice header, a Picture Parameter Set (PPS), or a Sequence Parameter Set (SPS):interpolating a second value associated with prediction of a second pixel of the block based on the plurality of reference samples and the quadratic model; and decoding at least a portion of the picture information based on the second value, as taught by Lin, for improved adaptive image interpolation and coding efficient and video quality (Chou Col. 2, lines 39-45, Lin [0003]).
Allowable Subject Matter
Claims 32 and 43 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.
The following is a statement of reasons for the indication of allowable subject matter:
Regarding claims 32 and 43, the prior arts of record, taken individually or in combination fail to explicitly teach or render obvious within the context of the respective claims the feature of wherein the one or more processors are further configured to: on a condition that the absolute value of the difference is greater than the threshold value, interpolate a second value associated with prediction of a second pixel of the block based on the quadratic model and at least four reference samples in the plurality of reference samples as cited in claims 32 and 43.
Conclusion
Any inquiry concerning this communication or earlier communications from the examiner should be directed to KATHLEEN V NGUYEN whose telephone number is (571)270-0626. The examiner can normally be reached on M-F 9:00am-6: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, Jamie Atala can be reached on 571-272-7384. 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.
/KATHLEEN V NGUYEN/Primary Examiner, Art Unit 2486