www.uspto.gov
`
`UNITED STATES DEPARTMENT OF COMMERCE
`United States Patent and TrademarkOffice
`Address; COMMISSIONER FOR PATENTS
`P.O. Box 1450
`Alexandria, Virginia 22313-1450
`
`16/669,769
`
`10/31/2019
`
`Tadamasa TOMA
`
`2019-1839
`
`1095
`
`Pp
`Lind&
`Wenderoth,
`Wenderoth, Lind & Ponack, L.L.P.
`1025 Connecticut Avenue, NW
`Suite 500
`Washington, DC 20036
`
`LIN, JASON Kk
`
`2425
`
`PAPER NUMBER
`
`NOTIFICATION DATE
`
`DELIVERY MODE
`
`04/04/2022
`
`ELECTRONIC
`
`Please find below and/or attached an Office communication concerning this application or proceeding.
`
`The time period for reply, if any, is set in the attached communication.
`
`Notice of the Office communication was sent electronically on above-indicated "Notification Date" to the
`following e-mail address(es):
`eoa@ wenderoth.com
`kmiller@wenderoth.com
`
`PTOL-90A (Rev. 04/07)
`
`

`

`
`
`Disposition of Claims*
`1-8 is/are pending in the application.
`)
`Claim(s)
`5a) Of the above claim(s) ___ is/are withdrawn from consideration.
`C} Claim(s)
`is/are allowed.
`Claim(s) 1-8 is/are rejected.
`(1 Claim(s)__is/are objectedto.
`Cj) Claim(s
`are subjectto restriction and/or election requirement
`S)
`* If any claims have been determined allowable, you maybeeligible to benefit from the Patent Prosecution Highway program at a
`participating intellectual property office for the corresponding application. For more information, please see
`http://www.uspto.gov/patents/init_events/pph/index.jsp or send an inquiry to PPHfeedback@uspto.gov.
`
`) ) ) )
`
`Application Papers
`10) The specification is objected to by the Examiner.
`11)0) The drawing(s) filedon__ is/are: a)(J accepted or b)() objected to by the Examiner.
`Applicant may not request that any objection to the drawing(s) be held in abeyance. See 37 CFR 1.85(a).
`Replacement drawing sheet(s) including the correction is required if the drawing(s) is objected to. See 37 CFR 1.121 (d).
`
`Priority under 35 U.S.C. § 119
`12)1) Acknowledgment is made of a claim for foreign priority under 35 U.S.C. § 119(a)-(d)or (f).
`Certified copies:
`c)Z None ofthe:
`b)() Some**
`a)C All
`1.2 Certified copies of the priority documents have been received.
`2.1.) Certified copies of the priority documents have been received in Application No.
`3.1.) Copies of the certified copies of the priority documents have been receivedin this National Stage
`application from the International Bureau (PCT Rule 17.2(a)).
`* See the attached detailed Office action for a list of the certified copies not received.
`
`Attachment(s)
`
`1)
`
`Notice of References Cited (PTO-892)
`
`2) (J Information Disclosure Statement(s) (PTO/SB/08a and/or PTO/SB/08b)
`Paper No(s)/Mail Date
`U.S. Patent and Trademark Office
`
`3) (J Interview Summary (PTO-413)
`Paper No(s)/Mail Date
`(Qj Other:
`
`4)
`
`PTOL-326 (Rev. 11-13)
`
`Office Action Summary
`
`Part of Paper No./Mail Date 20220329
`
`Application No.
`Applicant(s)
`16/669,769
`TOMAetal.
`
`
`Office Action Summary Art Unit|AIA (FITF) StatusExaminer
`
`JASONKLIN 2425 Yes
`
`
`-- The MAILING DATEofthis communication appears on the cover sheet with the correspondence address --
`Period for Reply
`
`A SHORTENED STATUTORY PERIOD FOR REPLYIS SET TO EXPIRE 3 MONTHS FROM THE MAILING
`DATE OF THIS COMMUNICATION.
`Extensions of time may be available underthe provisions of 37 CFR 1.136(a). In no event, however, may a reply betimely filed after SIX (6) MONTHSfrom the mailing
`date of this communication.
`If NO period for reply is specified above, the maximum statutory period will apply and will expire SIX (6) MONTHSfrom the mailing date of this communication.
`-
`- Failure to reply within the set or extended period for reply will, by statute, cause the application to become ABANDONED (35 U.S.C. § 133}.
`Any reply received by the Office later than three months after the mailing date of this communication, evenif timely filed, may reduce any earned patent term
`adjustment. See 37 CFR 1.704(b).
`
`Status
`
`1) Responsive to communication(s) filed on 10/19/2021.
`C} A declaration(s)/affidavit(s) under 37 CFR 1.130(b) was/werefiled on
`2a)¥) This action is FINAL.
`2b) (J This action is non-final.
`3)02 An election was madeby the applicant in responseto a restriction requirement set forth during the interview
`on
`; the restriction requirement and election have been incorporated into this action.
`4\0) Since this application is in condition for allowance except for formal matters, prosecution as to the merits is
`closed in accordance with the practice under Exparte Quayle, 1935 C.D. 11, 453 O.G. 213.
`
`

`

`Application/Control Number: 16/669,769
`Art Unit: 2425
`
`Page 2
`
`Notice of Pre-AlA 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.
`
`DETAILED ACTION
`
`1.
`
`This office action is responsive to application No. 16/669,769 filed on 10/19/2021.
`
`Claim(s) 1-8 is/are pending and have been examined.
`
`Double Patenting
`
`2.
`
`Claim(s) 1-8 is/are provisionally rejected on the ground of nonstatutory
`
`obviousness-type double patenting as being unpatentable over claim(s) 1-8 of U.S.
`
`Patent No. 10,499,113 in view of Otsuka (US 2014/0133568). Although the conflicting
`
`claims are notidentical, they are not patentably distinct from each other because they
`
`recite similar subject matter which is obvious over one another.
`
`For example, note the following relationship between the instant application claim
`
`and patented application claims.
`
`Claim(s) 1, 2, 7, and 8 of the instant application corresponds to that of Claim(s)
`
`1, 2, 7, and 8 of patented application except that pending application in claim(s) 1, 2, 7,
`
`and 8 contains additional limitation wherein the plurality of regions overlap each other
`
`on boundaries of the plurality of regions, and respective pieces of encoded data of two
`
`adjacent regions include data on regions overlapping in a boundaryof the two adjacent
`
`regions. In an analogous art, Otsuka teaches wherein a plurality of regions overlap each
`
`other on boundaries of the plurality of regions, and respective pieces of encodeddata of
`
`two adjacent regions include data on regions overlapping in a boundary of the two
`
`adjacent regions (Fig.6, Paragraph 0053 teaches an input image is divided into four
`
`

`

`Application/Control Number: 16/669,769
`Art Unit: 2425
`
`Page 3
`
`divided images, A, B, C, and D in such a manner asto include an overlapped area OL
`
`that spreads over the boundary. The four divided images A, B, C, and D are
`
`respectively encoded by four encoders. From Fig.6, we can see the Divided Images A,
`
`B, C, D each having overlapping area, OL, corresponding to regions in the other divided
`
`images. Paragraph 0054 teaches the encoded data is sent to decoder, respectively
`
`decodedby the four decoders, where the divided images A, B, C, D and the overlapped
`
`area(s), OL, are also decoded). Therefore, it would have been obvious to a person of
`
`ordinary skill in the art to modify the system to include wherein a plurality of regions
`
`overlap each other on boundaries ofthe plurality of regions, and respective pieces of
`
`encoded data of two adjacent regions include data on regions overlapping in a
`
`boundaryof the two adjacentregions, as taught by Otsuka, for the advantage of
`
`providing better processing of content, where an unnatural image due to the difference
`
`in image quality is improved in the periphery of the boundary between the output
`
`images to be composed (Otsuka — Paragraph 0056), providing greater continuity and
`
`blending between regions of divided pictures, resulting in a better overall quality of
`
`content.
`
`Claim 3 of instant application correspondsto claim 3 of patent.
`
`Claim 4 of instant application corresponds to claim 4 of patent.
`
`Claim 5 of instant application correspondsto claim 5 of patent.
`
`Claim 6 of instant application corresponds to claim 6 of patent.
`
`Responseto Arguments
`
`3.
`
`Applicant's arguments with respect to claim(s) 1-8 have been considered but are
`
`moot in view of the new ground(s) of rejection.
`
`

`

`Application/Control Number: 16/669,769
`Art Unit: 2425
`
`Page 4
`
`Claim Rejections - 35 USC § 103
`
`4.
`
`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.
`
`5.
`
`The following is a quotation of 35 U.S.C. 103 which forms the basis for all
`
`obviousnessrejections 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.
`
`6.
`
`The factual inquiries set forth in Graham v. John Deere Co., 383 U.S. 1, 148
`
`USPQ 459 (1966), that are applied 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 presentin the application indicating
`
`obviousness or nonobviousness.
`
`7.
`
`Claim(s) 1-3 and 6-8 is/are rejected under 35 U.S.C. 103 as being unpatentable
`
`over Schierl et al. (US 2015/0208095)in view of Otsuka (US 2014/0133568).
`
`

`

`Application/Control Number: 16/669,769
`Art Unit: 2425
`
`Page 5
`
`Consider claims 1 and 7, Schierl teaches a transmission method and a
`
`transmitting apparatus (Fig.12) comprising:
`
`a divider that divides a picture into a plurality of regions (Fig.12, Paragraph
`
`0204 teaches video content 16 broken into sub-portions of the frames/pictures
`
`18, wherein the sub-portions, may for example, be slices 24 into which the
`
`pictures 18 are partitioned. Paragraph 0323 teaches picture may be divided into
`
`tiles which may compose four quadrants of the picture 110 as indicated with
`
`reference signs 112a-112d. The whole picture 110 may form one tile or may be
`
`segmented into more than one tile);
`
`an encoder (encoder 10-Fig.12) that generates a plurality of pieces of
`
`encoded data that respectively correspond to the plurality of regions by encoding
`
`the plurality of regions such that each of the plurality of regions can be decoded
`
`independently (Paragraph 0204 teaches encoder 10 is configured to encode
`
`video content 16 into a video data stream 22. Encoder is configured to do this in
`
`units of sub-portions of the frames/pictures 18, wherein the sub-portions, may for
`
`example, be slices 24 into which the pictures 18 are partitioned. Paragraph 0205
`
`teaches encoding the video content 16 in units of the sub-portions 24. Paragraph
`
`0321 teaches the payload packets may each encompass one or more slices. The
`
`slices may be independently decodable. Paragraph 0326 teaches tiles are
`
`en/decodable independent from each other. The encoder 10 and decoder 12
`
`may encode/decodea picture sub-dividedinto tiles 112, in parallel, independent
`
`from each other);
`
`

`

`Application/Control Number: 16/669,769
`Art Unit: 2425
`
`Page 6
`
`a packetizer that packetizes the generated plurality of pieces of encoded
`
`data in a plurality of packets such that pieces of encoded data for different
`
`regions are not stored in one packet (Paragraph 0207 teaches putting each slice
`
`data, i.e., each encodedslice, into one payload packet, such as a NAL unit.
`
`Packetization may serve to render the video data stream 22 appropriate for
`
`transmission via a network. Paragraph 0209 teaches one payload packet 32 per
`
`sub-portion 24 into which picture 18 is subdivided. Each payload packet 32
`
`carries a corresponding sub-portion 24. Paragraph 0321 teaches payload
`
`packets may each encompassone or moreslices that may be independently
`
`decodable); and
`
`a transmitter that transmits the plurality of packets (Paragraph 0207
`
`teaches encoding versions of sub-portions 24 into one or more payload packets
`
`of a sequences of packets of video data stream 22, to be rendered suitable for
`
`transmission over a network. Paragraph 0214 teaches decoder 12 receiving the
`
`video data stream 22 by way of a network via which encoder 10 transmits the
`
`video data stream 22 to decoder 12).
`
`Schierl does not explicitly teach wherein the plurality of regions overlap
`
`each other on boundariesof the plurality of regions, and
`
`respective pieces of encoded data of two adjacent regions include data on
`
`regions overlapping in a boundary of the two adjacent regions.
`
`In an analogous art, Otsuka teaches wherein a plurality of regions overlap
`
`each other on boundariesof the plurality of regions, and respective pieces of
`
`encoded data of two adjacent regions include data on regions overlapping in a
`
`

`

`Application/Control Number: 16/669,769
`Art Unit: 2425
`
`Page 7
`
`boundaryof the two adjacent regions (Fig.6, Paragraph 0053 teaches an input
`
`imageis divided into four divided images, A, B, C, and D in such a manner as to
`
`include an overlapped area OL that spreads over the boundary. The four divided
`
`imagesA, B, C, and D are respectively encoded by four encoders. From Fig.6,
`
`we can see the Divided Images A, B, C, D each having overlapping area, OL,
`
`corresponding to regions in the other divided images. Paragraph 0054 teaches
`
`the encoded data is sent to decoder, respectively decoded by the four decoders,
`
`wherethe divided imagesA, B, C, D and the overlapped area(s), OL, are also
`
`decoded).
`
`Therefore, it would have been obvious to a person of ordinary skill in the
`
`art to modify the system of Schierl to include wherein a plurality of regions
`
`overlap each other on boundaries of the plurality of regions, and respective
`
`pieces of encoded data of two adjacent regions include data on regions
`
`overlapping in a boundary of the two adjacent regions, as taught by Otsuka,for
`
`the advantage of providing better processing of content, where an unnatural
`
`image due to the difference in image quality is improved in the periphery of the
`
`boundary between the output images to be composed (Otsuka — Paragraph
`
`0056), providing greater continuity and blending between regions of divided
`
`pictures, resulting in a better overall quality of content.
`
`Consider claim 2, Schierl teaches a reception methodfor a receiving
`
`apparatus (decoder 12-Fig.14) including a plurality of decoders (Paragraph 0214
`
`teaches similar to encoder 10, decoder 12 may beable to perform parallel
`
`

`

`Application/Control Number: 16/669,769
`Art Unit: 2425
`
`Page 8
`
`processing suchas, for example, using tile parallel processing/decoding and/or
`
`WPP parallel processing/decoding. Paragraph 0224 teaches likewise any
`
`decoder such as network entity 68 may decode the tiles 70 in parallel. Paragraph
`
`0326 teaches encoder 10 and decoder 12 may encode/decodea picture sub-
`
`dividedinto tiles 112, in parallel, independent from each other), the reception
`
`method comprising:
`
`receiving a plurality of packets, the plurality of packets being obtained by
`
`packetizing a plurality of pieces of encoded data (Paragraph 0214 teaches a
`
`decoder 12 receives the video data stream 22 by way of a networkvia which
`
`encoder 10 transmits the video data stream 22 to decoder 12. Paragraph 0207
`
`teaches putting each slice data, i.e., each encodedslice, into one payload
`
`packet, such as a NAL unit. Packetization may serve to render the video data
`
`stream 22 appropriate for transmission via a network. Paragraph 0209 teaches
`
`one payload packet 32 per sub-portion 24 into which picture 18 is subdivided.
`
`Each payload packet 32 carries a corresponding sub-portion 24. Paragraph 0321
`
`teaches payload packets may each encompassone or moreslices that may be
`
`independently decodable), the plurality of pieces of encoded data being obtained
`
`by encoding a plurality of regions of a picture such thatthe plurality of regions are
`
`decoded independently (Paragraph 0204 teaches encoder 10 is configured to
`
`encode video content 16 into a video data stream 22. Encoder is configured to do
`
`this in units of sub-portions of the frames/pictures 18, wherein the sub-portions,
`
`may for example, be slices 24 into which the pictures 18 are partitioned.
`
`Paragraph 0205 teaches encoding the video content 16 in units of the sub-
`
`

`

`Application/Control Number: 16/669,769
`Art Unit: 2425
`
`Page 9
`
`portions 24. Paragraph 0321 teaches the payload packets may each encompass
`
`one or moreslices. The slices may be independently decodable. Paragraph 0326
`
`teaches tiles are en/decodable independent from each other. The encoder 10
`
`and decoder 12 may encode/decodea picture sub-divided into tiles 112, in
`
`parallel, independent from each other), and the packetizing being performed
`
`such that pieces of encodeddatafor different regions are not stored in a single
`
`packet (Paragraph 0207 teaches putting each slice data, i.e., each encoded
`
`slice, into one payload packet, such as a NAL unit. Packetization may serve to
`
`render the video data stream 22 appropriate for transmission via a network.
`
`Paragraph 0209 teaches one payload packet 32 per sub-portion 24 into which
`
`picture 18 is subdivided. Each payload packet 32 carries a corresponding sub-
`
`portion 24. Paragraph 0321 teaches payload packets may each encompass one
`
`or moreslices that may be independently decodable);
`
`decoding the plurality of packets in parallel by using the plurality of
`
`decoders (Paragraph 0214 teaches similar to encoder 10, decoder 12 may be
`
`able to perform parallel processing such as, for example, using tile parallel
`
`processing/decoding and/or WPP parallel processing/decoding. Paragraph 0224
`
`teaches likewise any decoder such as network entity 68 may decodethe tiles 70
`
`in parallel. Paragraph 0326 teaches encoder 10 and decoder 12 may
`
`encode/decodea picture sub-dividedinto tiles 112, in parallel, independent from
`
`each other),
`
`wherein the plurality of packets are received as data for the picture in a
`
`same location wherethe plurality of pieces of encoded data are stored
`
`

`

`Application/Control Number: 16/669,769
`Art Unit: 2425
`
`Page 10
`
`(Paragraph 0205 teaches encoding the video content 16 in units of the sub-
`
`portions 24. Paragraph 0207 teaches putting eachslice data, i.e., each encoded
`
`slice, into one payload packet, such as a NAL unit. Paragraph 0209 teaches one
`
`payload packet 32 per sub-portion 24 into which picture 18 is subdivided. Each
`
`payload packet 32 carries a corresponding sub-portion 24. Paragraph 0321
`
`teaches payload packets may each encompassone or moreslices that may be
`
`independently decodable. Paragraph 0354 teaches reception of video data
`
`stream having video content encodedin units of sub-portions, each sub-portion
`
`encodedinto one or more payload packets).
`
`Schierl does not explicitly teach the plurality of regions overlap each other
`
`on boundaries of the plurality of regions, and
`
`respective pieces of encoded data of two adjacent regions include data on
`
`regions overlapping in a boundary of the two adjacent regions.
`
`In an analogous art, Otsuka teachesa plurality of regions overlap each
`
`other on boundaries of the plurality of regions, and respective pieces of encoded
`
`data of two adjacent regions include data on regions overlapping in a boundary
`
`of the two adjacent regions (Fig.6, Paragraph 0053 teaches an input image is
`
`divided into four divided images, A, B, C, and D in such a manner asto include
`
`an overlapped area OL that spreads over the boundary. The four divided images
`
`A, B, C, and D are respectively encoded by four encoders. From Fig.6, we can
`
`see the Divided Images A, B, C, D each having overlapping area, OL,
`
`corresponding to regions in the other divided images. Paragraph 0054 teaches
`
`the encoded data is sent to decoder, respectively decoded by the four decoders,
`
`

`

`Application/Control Number: 16/669,769
`Art Unit: 2425
`
`Page 11
`
`wherethe divided imagesA, B, C, D and the overlapped area(s), OL, are also
`
`decoded).
`
`Therefore, it would have been obvious to a person of ordinary skill in the
`
`art to modify the system of Schierl to include a plurality of regions overlap each
`
`other on boundaries of the plurality of regions, and respective pieces of encoded
`
`data of two adjacent regions include data on regions overlapping in a boundary
`
`of the two adjacent regions, as taught by Otsuka,for the advantage of providing
`
`better processing of content, where an unnatural image due to the difference in
`
`image quality is improvedin the periphery of the boundary between the output
`
`images to be composed (Otsuka — Paragraph 0056), providing greater continuity
`
`and blending between regions of divided pictures, resulting in a better overall
`
`quality of content.
`
`Consider claim 8, Schierl teaches a receiving apparatus (decoder 12-
`
`Fig.14) comprising:
`
`a receiver that receives a plurality of packets, the plurality of packets being
`
`obtained by packetizing a plurality of pieces of encoded data (Paragraph 0214
`
`teaches a decoder 12 receives the video data stream 22 by wayof a network via
`
`which encoder 10 transmits the video data stream 22 to decoder 12. Paragraph
`
`0207 teaches putting each slice data, i.e., each encodedslice, into one payload
`
`packet, such as a NAL unit. Packetization may serve to render the video data
`
`stream 22 appropriate for transmission via a network. Paragraph 0209 teaches
`
`one payload packet 32 per sub-portion 24 into which picture 18 is subdivided.
`
`

`

`Application/Control Number: 16/669,769
`Art Unit: 2425
`
`Page 12
`
`Each payload packet 32 carries a corresponding sub-portion 24. Paragraph 0321
`
`teaches payload packets may each encompassone or moreslices that may be
`
`independently decodable), the plurality of pieces of encoded data being obtained
`
`by encoding a plurality of regions of a picture such thatthe plurality of regions are
`
`decoded independently (Paragraph 0204 teaches encoder 10 is configured to
`
`encode video content 16 into a video data stream 22. Encoder is configured to do
`
`this in units of sub-portions of the frames/pictures 18, wherein the sub-portions,
`
`may for example, be slices 24 into which the pictures 18 are partitioned.
`
`Paragraph 0205 teaches encoding the video content 16 in units of the sub-
`
`portions 24. Paragraph 0321 teaches the payload packets may each encompass
`
`one or moreslices. The slices may be independently decodable. Paragraph 0326
`
`teaches tiles are en/decodable independent from each other. The encoder 10
`
`and decoder 12 may encode/decodea picture sub-divided into tiles 112, in
`
`parallel, independent from each other), the packetizing being performed such
`
`that pieces of encoded data for different regions are not stored in a single packet
`
`(Paragraph 0207 teaches putting each slice data, i.e., each encodedslice, into
`
`one payload packet, such as a NAL unit. Packetization may serve to render the
`
`video data stream 22 appropriate for transmission via a network. Paragraph 0209
`
`teaches one payload packet 32 per sub-portion 24 into which picture 18 is
`
`subdivided. Each payload packet 32 carries a corresponding sub-portion 24.
`
`Paragraph 0321 teaches payload packets may each encompass one or more
`
`slices that may be independently decodable);
`
`

`

`Application/Control Number: 16/669,769
`Art Unit: 2425
`
`Page 13
`
`a plurality of decoders that decode the plurality of packets in parallel
`
`(Paragraph 0214 teaches similar to encoder 10, decoder 12 may be able to
`
`perform parallel processing such as, for example, using tile parallel
`
`processing/decoding and/or WPP parallel processing/decoding. Paragraph 0224
`
`teaches likewise any decoder such as networkentity 68 may decode the tiles 70
`
`in parallel. Paragraph 0326 teaches encoder 10 and decoder 12 may
`
`encode/decodea picture sub-dividedinto tiles 112, in parallel, independent from
`
`each other),
`
`wherein the different packet (Paragraph 0207 teaches encoding versions
`
`of sub-portions 24 into one or more payload packets of a sequences of packets
`
`of video data stream 22, to be rendered suitable for transmission over a network.
`
`Paragraph 0214 teaches decoder 12 receiving the video data stream 22 by way
`
`of a network via which encoder 10 transmits the video data stream 22 to decoder
`
`12. Paragraph 0208 teaches besides payload packets and the timing control
`
`packets interspersed therebetween, other packets of other type may exists as
`
`well, such asfill data packets, picture or sequence parameter set packets, AUE
`
`packets, or the like. Fig.12, Paragraph 0209 teaches payload packet 32 carries a
`
`sub-portion 24 into which picture 18 is subdivided. The encoder is configured to
`
`intersperse into the sequence 34 of packets timing control packets 36) and the
`
`plurality of packets are received as data for the picture in a same location
`
`(Paragraph 0205 teaches encoding the video content 16 in units of the sub-
`
`portions 24. Paragraph 0207 teaches putting eachslice data, i.e., each encoded
`
`slice, into one payload packet, such as a NAL unit. Paragraph 0209 teaches one
`
`

`

`Application/Control Number: 16/669,769
`Art Unit: 2425
`
`Page 14
`
`payload packet 32 per sub-portion 24 into which picture 18 is subdivided. Each
`
`payload packet 32 carries a corresponding sub-portion 24. Paragraph 0321
`
`teaches payload packets may each encompassone or moreslices that may be
`
`independently decodable. Paragraph 0354 teaches reception of video data
`
`stream having video content encodedin units of sub-portions, each sub-portion
`
`encodedinto one or more payload packets).
`
`Schierl does not explicitly teach the plurality of regions overlap each other
`
`on boundaries of the plurality of regions, and
`
`respective pieces of encoded data of two adjacent regions include data on
`
`regions overlapping in a boundary of the two adjacent regions.
`
`In an analogous art, Otsuka teachesa plurality of regions overlap each
`
`other on boundaries of the plurality of regions, and respective pieces of encoded
`
`data of two adjacent regions include data on regions overlapping in a boundary
`
`of the two adjacent regions (Fig.6, Paragraph 0053 teaches an input image is
`
`divided into four divided images, A, B, C, and D in such a manner asto include
`
`an overlapped area OL that spreads over the boundary. The four divided images
`
`A, B, C, and D are respectively encoded by four encoders. From Fig.6, we can
`
`see the Divided Images A, B, C, D each having overlapping area, OL,
`
`corresponding to regions in the other divided images. Paragraph 0054 teaches
`
`the encoded data is sent to decoder, respectively decoded by the four decoders,
`
`wherethe divided imagesA, B, C, D and the overlapped area(s), OL, are also
`
`decoded).
`
`

`

`Application/Control Number: 16/669,769
`Art Unit: 2425
`
`Page 15
`
`Therefore, it would have been obvious to a person of ordinary skill in the
`
`art to modify the system of Schierl to include a plurality of regions overlap each
`
`other on boundaries of the plurality of regions, and respective pieces of encoded
`
`data of two adjacent regions include data on regions overlapping in a boundary
`
`of the two adjacent regions, as taught by Otsuka,for the advantage of providing
`
`better processing of content, where an unnatural image due to the difference in
`
`image quality is improvedin the periphery of the boundary between the output
`
`images to be composed (Otsuka — Paragraph 0056), providing greater continuity
`
`and blending between regions of divided pictures, resulting in a better overall
`
`quality of content.
`
`Consider claim 3, Schierl and Otsuka teach further comprising
`
`determining, using header information of a packet, which region among the
`
`plurality of regions correspondsto a piece of data stored in the packet (Schierl-
`
`Paragraph 0231, 0235, 0238, 0241).
`
`Consider claim 6, Schierl and Otsuka teach further comprising
`
`determining one of the plurality of decoders to be used to decode the plurality of
`
`pieces of combined data, respectively, based on at least one of resolution of the
`
`picture, a methodfor dividing the picture into the plurality of regions, and
`
`processing capabilities of the plurality of decoders (Schierl - Paragraph 0214
`
`teaches similar to encoder 10, decoder 12 may be able to perform parallel
`
`processing suchas, for example, using tile parallel processing/decoding and/or
`
`

`

`Application/Control Number: 16/669,769
`Art Unit: 2425
`
`Page 16
`
`WPP parallel processing/decoding. Paragraph 0224 teaches likewise any
`
`decoder such as network entity 68 may decode the tiles 70 in parallel. Paragraph
`
`0326 teaches encoder 10 and decoder 12 may encode/decodea picture sub-
`
`dividedinto tiles 112, in parallel, independent from each other; Figs.35, 39,
`
`Paragraph 0341-0344; Paragraph 0228-0230).
`
`
`
`8. Claim(s) 4 and5is/are rejected under 35 U.S.C. 103 as being unpatentable over
`
`Schierl et al. (US 2015/0208095), in view of Otsuka (US 2014/0133568), and further in
`
`view of Choi et al. (US 2002/0120885).
`
`Consider claim 4, Schierl and Otsuka teach wherein eachofthe plurality
`
`of pieces of encoded data has a one-to-one correspondence with a basic data
`
`unit, the basic data unit being a unit of data stored in one or more packets,
`
`wherein each of the plurality of pieces of encoded data is stored in the one or
`
`more packets (Schierl - Paragraph 0205 teaches encoding the video content 16
`
`in units of the sub-portions 24. Paragraph 032 teaches the payload packets may
`
`each encompass one or more slices. The slices may be independently
`
`decodable. Paragraph 0207 teaches putting each slice data, i.e., each encoded
`
`slice, into one payload packet, such as a NAL unit. Packetization may serve to
`
`render the video data stream 22 appropriate for transmission via a network;
`
`Paragraph 0228-0230), and
`
`wherein the determining includes determining that a start of payload data
`
`included in a packet having header information that includes: the identification
`
`

`

`Application/Control Number: 16/669,769
`Art Unit: 2425
`
`Page 17
`
`information, is a start of the piece of encoded data of eachofthe plurality of
`
`regions (Schierl - Paragraph 0235, 0248-0253, 0258, 0262, 0277, 0353, 0355).
`
`Schierl and Otsuka do not explicitly teach header information that
`
`includes: the identification information indicating that (1) only the packetis
`
`included in the basic data unit or (2) a plurality of packets are included in the
`
`basic data unit, and that the packetis a first packet of the basic data unit.
`
`In an analogous art, Choi teaches header information that includes: the
`
`identification information indicating that (1) only the packetis included in the
`
`basic data unit or (2) a plurality of packets are included in the basic data unit, and
`
`that the packetis a first packet of the basic data unit (Fig.1, Paragraph 0023
`
`teaches user data structure includes a header block containing basic index
`
`information. Paragraph 0025 teaches header block 10 includes, a current packet
`
`number block 10C for showing order of the current packets when receiving the
`
`information divided into a number of packets, a last packet number block 10D for
`
`checking the total number of packets, etc. Based on current packet number 10C
`
`and last packet number 10D, identification information provided in header may
`
`provide information regarding the basic data unit. E.g. (1) block 10D may be set
`
`to the numberone, and block 10C set equal to 10D, indicating only one packetin
`
`the basic data unit. (2) block 10D may be set to a number greater than one,
`
`including a plurality of packets, while block 10C for each packetis set to a
`
`corresponding number depending on the packetorder. For block 10C, the packet
`
`header having the lowest numberindicates that the packetis the first packet of
`
`the basic data unit, while the highest numberin block 10C that may be equivalent
`
`

`

`Application/Control Number: 16/669,769
`Art Unit: 2425
`
`Page 18
`
`to the total numberof packets indicated in block 10D, would indicate that that
`
`packetis the last packet of the basic data unit. Further when the numberof block
`
`10C is any number betweenthe lowest and highest number, it indicates that the
`
`packetis a packet other than thefirst and last packet in the basic data unit).
`
`Therefore, it would have been obvious to a person of ordinary skill in the
`
`art to modify the system of Schierl and Otsuka to include header information that
`
`includes: the identification information indicating that (1) only the packetis
`
`included in the basic data unit or (2) a plurality of packets are included in the
`
`basic data unit, and that the packetis a first pac