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 office action is in response application filed 07/12/2024 in which the claims 9-15 are pending.
Claim Objections
Claim 10 objected to because of the following informalities:
Claim 10 recites: The image decoding method of claim 9, wherein the rearrangement type includes a type in which the sub-sub-regions are rearranged side-by-bide.
Appropriate correction is required.
Information Disclosure Statement
The information disclosure statement (IDS) submitted on 06/25/2026, 03/19/2026, 02/11/2026, 11/13/2025, 11/07/2025, 09/12/2025, 05/14/2025, 01/17/2025, 11/12/2024, 09/09/2024, 08/02/2024, 07/12/2024 are in compliance with the provisions of 37 CFR 1.97. Accordingly, the information disclosure statement is being considered by the examiner.
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 9-15 are provisionally rejected on the ground of nonstatutory double patenting as being unpatentable over claims 1-7 of copending Application No. 19/569,342 in view of Hanhart et al. (US 2019/0200023). Although the claims are not identical, they are not patentably distinct from each other because the examined application claim is obvious over the conflicting copending claim
The difference between the instant and conflicting copending claim is the addition of limitation “generating a prediction block by predicting a current block in a picture; decoding the picture based on the prediction block” in the instant claim. See the table below. However Hanhart discloses generating a prediction block by predicting a current block in a picture; decoding the picture based on the prediction block (Para[0068] & Fig. 7 teaches The coding mode and prediction information are sent to either the spatial prediction unit 260 (if intra coded) or the temporal prediction unit 262 (if inter coded) to form the prediction block.. The prediction block and the residual block are then added together at 226).
It would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to utilize limitation in the method of the conflicting patent claim, to obtain reconstructed video block to properly reconstruct the 360-video from the decoded 2D planar video, the geometry and frame packing parameters should be available to the decoder to unpack the data and project it back from the 2D space to the 3D space
This is a provisional nonstatutory double patenting rejection.
Co-pending application:19/569,342
Instant application:18/771,226
1. An image decoding method, comprising: generating a residual block of a current block from a bitstream; decoding a picture including the current block based on the residual block; obtaining, from a bitstream, rearrangement information related to rearranging sub-regions in a picture; and rearranging the sub-regions based on the rearrangement information, wherein the rearrangement information includes rearrangement type information indicating a rearrangement type, flipping information for the sub-regions, and information related to interpolation of the sub-regions, and wherein the bitstream includes projection information for mapping the picture to a three-dimensional coordinate system.
9. An image decoding method, comprising: generating a prediction block by predicting a current block in a picture; decoding the picture based on the prediction block; obtaining, from a bitstream, rearrangement information related to rearranging sub-regions in the decoded picture; and rearranging the sub-regions based on the rearrangement information, wherein the rearrangement information includes rearrangement type information indicating a rearrangement type and flipping information for the sub-regions, and wherein the bitstream includes projection information for mapping the decoded picture to a three-dimensional coordinate system.
2. The image decoding method of claim 1, wherein the rearrangement type includes a type in which the sub-sub-regions are rearranged side-by-bide.
10. The image decoding method of claim 9, wherein the rearrangement type includes a type in which the sub-sub-regions are rearranged side-by-bide.
3. The image decoding method of claim 1, wherein the rearrangement type includes a type in which the sub-sub-regions are rearranged in a top-bottom.
11. The image decoding method of claim 9, wherein the rearrangement type includes a type in which the sub-sub-regions are rearranged in a top-bottom.
4. The image decoding method of claim 1, wherein the flipping information includes information indicating whether flipping is applied to the sub-regions.
12.The image decoding method of claim 9, wherein the flipping information includes information indicating whether flipping is applied to the sub-regions.
5. The image decoding method of claim 1, wherein the flipping information includes information indicating a sub-region to which flipping is applied among the sub-regions.
13.The image decoding method of claim 9, wherein the flipping information includes information indicating a sub-region to which flipping is applied among the sub-regions.
6. An image encoding method, comprising: generating a residual block of a current block based on a prediction block of the current block; encoding a picture including the current block based on the residual block; encoding rearrangement information related to rearranging sub-regions in a picture; encoding projection information for mapping the picture to a three-dimensional coordinate system; and generating a bitstream comprising the rearrangement information and the projection information, wherein the rearrangement information includes rearrangement type information indicating a rearrangement type, flipping information for the sub-regions, and information related to interpolation of the sub-regions.
14. An image encoding method, comprising: generating a prediction block by predicting a current block in a picture; encoding the picture based on the prediction block;
encoding rearrangement information related to rearranging sub-regions in the picture; encoding projection information for mapping the picture to a three-dimensional coordinate system; and generating a bitstream comprising the rearrangement information and the projection information, wherein the rearrangement information includes rearrangement type information indicating a rearrangement type and flipping information for the sub-regions.
7. A method for transmitting a bitstream, comprising: generating a residual block of a current block based on a prediction block of the current block; encoding a picture including the current block based on the residual block; encoding rearrangement information related to rearranging sub-regions in a picture; encoding projection information for mapping the picture to a three-dimensional coordinate system; and generating the bitstream comprising the rearrangement information and the projection information; and transmitting the bitstream, wherein the rearrangement information includes rearrangement type information indicating a rearrangement type, flipping information for the sub-regions, and information related to interpolation of the sub-regions.
15. A method for transmitting a bitstream, comprising: generating a prediction block by predicting a current block in a picture; encoding the picture based on the prediction block;
encoding rearrangement information related to rearranging sub-regions in the picture; encoding projection information for mapping the picture to a three-dimensional coordinate system; generating the bitstream comprising the rearrangement information and the projection information; and transmitting the bitstream, wherein the rearrangement information includes rearrangement type information indicating a rearrangement type and flipping information for the sub-regions.
Claims 9-15 are provisionally rejected on the ground of nonstatutory double patenting as being unpatentable over claims 1-7 of copending Application No. 19/573,614 in view of Hanhart et al. (US 2019/0200023). Although the claims are not identical, they are not patentably distinct from each other because the examined application claim is obvious over the conflicting copending claim
The difference between the instant and conflicting copending claim is the addition of limitation “generating a prediction block by predicting a current block in a picture; decoding the picture based on the prediction block” in the instant claim. See the table below. However Hanhart discloses generating a prediction block by predicting a current block in a picture; decoding the picture based on the prediction block (Para[0068] & Fig. 7 teaches The coding mode and prediction information are sent to either the spatial prediction unit 260 (if intra coded) or the temporal prediction unit 262 (if inter coded) to form the prediction block.. The prediction block and the residual block are then added together at 226).
It would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to utilize limitation in the method of the conflicting patent claim, to obtain reconstructed video block to properly reconstruct the 360-video from the decoded 2D planar video, the geometry and frame packing parameters should be available to the decoder to unpack the data and project it back from the 2D space to the 3D space
This is a provisional nonstatutory double patenting rejection.
Instant applicaiton:19/569,342
Co-pending application:19/573,614
9. An image decoding method, comprising: generating a prediction block by predicting a current block in a picture; decoding the picture based on the prediction block; obtaining, from a bitstream, rearrangement information related to rearranging sub-regions in the decoded picture; and rearranging the sub-regions based on the rearrangement information, wherein the rearrangement information includes rearrangement type information indicating a rearrangement type and flipping information for the sub-regions, and wherein the bitstream includes projection information for mapping the decoded picture to a three-dimensional coordinate system.
1. An image decoding method, comprising:
obtaining, from a bitstream, rearrangement information related to rearranging sub-regions in a picture; and rearranging the sub-regions based on the rearrangement information, wherein the rearrangement information includes rearrangement type information indicating a rearrangement type and flipping information for the sub-regions,
and wherein the bitstream includes projection information for mapping the picture to a three-dimensional coordinate system.
10. The image decoding method of claim 9, wherein the rearrangement type includes a type in which the sub-sub-regions are rearranged side-by-bide.
2. The image decoding method of claim 1, wherein the rearrangement type includes a type in which the sub-sub-regions are rearranged side-by-bide.
11. The image decoding method of claim 9, wherein the rearrangement type includes a type in which the sub-sub-regions are rearranged in a top-bottom.
3. The image decoding method of claim 1, wherein the rearrangement type includes a type in which the sub-sub-regions are rearranged in a top-bottom.
12. The image decoding method of claim 9, wherein the flipping information includes information indicating whether flipping is applied to the sub-regions.
4. The image decoding method of claim 1, wherein the flipping information includes information indicating whether flipping is applied to the sub-regions.
13. The image decoding method of claim 9, wherein the flipping information includes information indicating a sub-region to which flipping is applied among the sub-regions.
5. The image decoding method of claim 1, wherein the flipping information includes information indicating a sub-region to which flipping is applied among the sub-regions.
14. An image encoding method, comprising: generating a prediction block by predicting a current block in a picture; encoding the picture based on the prediction block; encoding rearrangement information related to rearranging sub-regions in the picture; encoding projection information for mapping the picture to a three-dimensional coordinate system; and generating a bitstream comprising the rearrangement information and the projection information, wherein the rearrangement information includes rearrangement type information indicating a rearrangement type and flipping information for the sub-regions.
6. An image encoding method, comprising:
encoding rearrangement information related to rearranging sub-regions in a picture; encoding projection information for mapping the picture to a three-dimensional coordinate system; and generating a bitstream comprising the rearrangement information and the projection information, wherein the rearrangement information includes rearrangement type information indicating a rearrangement type and flipping information for the sub-regions.
15. A method for transmitting a bitstream, comprising: generating a prediction block by predicting a current block in a picture; encoding the picture based on the prediction block; encoding rearrangement information related to rearranging sub-regions in the picture; encoding projection information for mapping the picture to a three-dimensional coordinate system; generating the bitstream comprising the rearrangement information and the projection information; and transmitting the bitstream, wherein the rearrangement information includes rearrangement type information indicating a rearrangement type and flipping information for the sub-regions.
7. A method for transmitting a bitstream, comprising:
encoding rearrangement information related to rearranging sub-regions in a picture; encoding projection information for mapping the picture to a three-dimensional coordinate system; and generating the bitstream comprising the rearrangement information and the projection information; and transmitting the bitstream, wherein the rearrangement information includes rearrangement type information indicating a rearrangement type and flipping information for the sub-regions.
Claims 9-15 are provisionally rejected on the ground of nonstatutory double patenting as being unpatentable over claims 1-7 of copending Application No. 19/662,454 in view of Hanhart et al. (US 2019/0200023). Although the claims are not identical, they are not patentably distinct from each other because the examined application claim is obvious over the conflicting copending claim
The difference between the instant and conflicting copending claim is the addition of limitation “generating a prediction block by predicting a current block in a picture; decoding the picture based on the prediction block” in the instant claim. See the table below. However Hanhart discloses generating a prediction block by predicting a current block in a picture; decoding the picture based on the prediction block (Para[0068] & Fig. 7 teaches The coding mode and prediction information are sent to either the spatial prediction unit 260 (if intra coded) or the temporal prediction unit 262 (if inter coded) to form the prediction block.. The prediction block and the residual block are then added together at 226).
It would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to utilize limitation in the method of the conflicting patent claim, to obtain reconstructed video block to properly reconstruct the 360-video from the decoded 2D planar video, the geometry and frame packing parameters should be available to the decoder to unpack the data and project it back from the 2D space to the 3D space
This is a provisional nonstatutory double patenting rejection.
Instant applicaiton:18/771,226
Co-pending application:19/662,454
9. An image decoding method, comprising: generating a prediction block by predicting a current block in a picture; decoding the picture based on the prediction block; obtaining, from a bitstream, rearrangement information related to rearranging sub-regions in the decoded picture; and rearranging the sub-regions based on the rearrangement information, wherein the rearrangement information includes rearrangement type information indicating a rearrangement type and flipping information for the sub-regions, and wherein the bitstream includes projection information for mapping the decoded picture to a three-dimensional coordinate system.
1. An image decoding method, comprising: generating a residual block of a current block in a picture from a bitstream; decoding the picture based on the residual block; obtaining, from a bitstream, rearrangement information related to rearranging sub-regions in the decoded picture; and rearranging the sub-regions based on the rearrangement information, wherein the rearrangement information includes rearrangement type information indicating a rearrangement type and flipping information for the sub-regions, and wherein the bitstream includes projection information for mapping the decoded picture to a three-dimensional coordinate system.
10. The image decoding method of claim 9, wherein the rearrangement type includes a type in which the sub-sub-regions are rearranged side-by-bide.
2. The image decoding method of claim 1, wherein the rearrangement type includes a type in which the sub-sub-regions are rearranged side-by-bide.
11. The image decoding method of claim 9, wherein the rearrangement type includes a type in which the sub-sub-regions are rearranged in a top-bottom.
3. The image decoding method of claim 1, wherein the rearrangement type includes a type in which the sub-sub-regions are rearranged in a top-bottom.
12. The image decoding method of claim 9, wherein the flipping information includes information indicating whether flipping is applied to the sub-regions.
4. The image decoding method of claim 1, wherein the flipping information includes information indicating whether flipping is applied to the sub-regions.
13. The image decoding method of claim 9, wherein the flipping information includes information indicating a sub-region to which flipping is applied among the sub-regions.
5. The image decoding method of claim 1, wherein the flipping information includes information indicating a sub-region to which flipping is applied among the sub-regions.
14. An image encoding method, comprising: generating a prediction block by predicting a current block in a picture; encoding the picture based on the prediction block; encoding rearrangement information related to rearranging sub-regions in the picture; encoding projection information for mapping the picture to a three-dimensional coordinate system; and generating a bitstream comprising the rearrangement information and the projection information, wherein the rearrangement information includes rearrangement type information indicating a rearrangement type and flipping information for the sub-regions.
6. An image encoding method, comprising: generating a residual block of a current block in a picture; encoding the picture based on the residual block; encoding rearrangement information related to rearranging sub-regions in the picture; encoding projection information for mapping the picture to a three-dimensional coordinate system; and generating a bitstream comprising the rearrangement information and the projection information,
wherein the rearrangement information includes rearrangement type information indicating a rearrangement type and flipping information for the sub-regions.
15. A method for transmitting a bitstream, comprising: generating a prediction block by predicting a current block in a picture; encoding the picture based on the prediction block; encoding rearrangement information related to rearranging sub-regions in the picture; encoding projection information for mapping the picture to a three-dimensional coordinate system; generating the bitstream comprising the rearrangement information and the projection information; and transmitting the bitstream, wherein the rearrangement information includes rearrangement type information indicating a rearrangement type and flipping information for the sub-regions.
7. A method for transmitting a bitstream, comprising: generating a residual block of a current block in a picture; encoding the picture based on the residual block;
encoding rearrangement information related to rearranging sub-regions in the picture; encoding projection information for mapping the picture to a three-dimensional coordinate system;
generating the bitstream comprising the rearrangement information and the projection information;
and transmitting the bitstream, wherein the rearrangement information includes rearrangement type information indicating a rearrangement type and flipping information for the sub-regions.
Claim Rejections - 35 USC § 102
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 (i.e., changing from AIA to pre-AIA ) 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 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)(2) the claimed invention was described in a patent issued under section 151, or in an application for patent published or deemed published under section 122(b), in which the patent or application, as the case may be, names another inventor and was effectively filed before the effective filing date of the claimed invention.
Claims 9-15 are rejected under 35 U.S.C. 102(a)(2) as being anticipated by Hanhart et al. (US 2019/0200023 A1).
Regarding claim 9, Hanhart discloses an image decoding method, comprising: generating a prediction block by predicting a current block in a picture; decoding the picture based on the prediction block (Para[0068] & Fig. 7 teaches The coding mode and prediction information are sent to either the spatial prediction unit 260 (if intra coded) or the temporal prediction unit 262 (if inter coded) to form the prediction block.. The prediction block and the residual block are then added together at 226); obtaining, from a bitstream, rearrangement information related to rearranging sub-regions in the decoded picture (Para[0011] teaches syntax elements may be used to specify a projection geometry and/or to specify an arrangement of faces in a frame-packed picture using a grid system. Faces can have different size and/or orientation. In some embodiments, face arrangement on a 2-D plane may have various characteristics, such as constant face width/height along each column/row. 360-Degree Video Property Signaling at Video Level. Para[0077] teaches each picture may be coded in a different projection geometry or with the same geometry but with different face arrangements, sizes, or quality); and rearranging the sub-regions based on the rearrangement information, wherein the rearrangement information includes rearrangement type information indicating a rearrangement type and flipping information for the sub-regions (claim 1 teaches method of decoding 360-degree video encoded in a bitstream, the method comprising: receiving a bitstream encoding a 2D planar video, the bitstream including parameters identifying a projection geometry type having a plurality of faces, the parameters including, for at least one of the faces, an indication of an amount of rotation of the respective face; and mapping the 2D planar video to a 360-degree video using the identified projection geometry format. para[0111] teaches faces may be arranged with different orientations, para0156] teaches FIGS. 14A and 14B illustrate exemplary alternative arrangements of faces in a frame-packed picture. FIGS. 14A and 14B each illustrate arrangements of six faces, such as may be used in conjunction with a cubemap projection, Para[0103] and table 6 teaches face_rotation_idc syntax element Para[0105] teaches face_vertical_flip_flag. Para[0112] & Table teaches rotation may be combined with a vertical flip (or, in some embodiments, a horizontal flip) & Table teaches face_vertical_flip_flag, and wherein the bitstream includes projection information for mapping the decoded picture to a three-dimensional coordinate system (Para[0130] teaches parameters may be used to map a sample from its location in the frame-packed picture to the corresponding location in the 3D geometry. This information may be exploited by advanced 360-video coding to achieve better compression efficiency. For example, the codec may exploit redundant information between neighboring faces in the 3D representation that are not collocated in the frame-packed picture).
Regarding claim 10, Hanhart discloses the image decoding method of claim 9, wherein the rearrangement type includes a type in which the sub-sub-regions are rearranged side-by-bide (Para[0061] teaches There are different frame packing configurations, such as 3×2 and 4×3. In the 3×2 configuration, the 6 faces are packed into 2 rows, with 3 faces in one row. In the 4×3 configuration, the 4 faces PX, NZ, NX, PZ are packed into one row (e.g., the center row), and the faces PY and NY are separately packed into two different rows (e.g., the top and bottom rows). The example of FIG. 2C makes use of 4×3 frame packing that corresponds to the equirectangular picture in FIG. 1C).
Regarding claim 11, Hanhart discloses the image decoding method of claim 9, wherein the rearrangement type includes a type in which the sub-sub-regions are rearranged in a top-bottom (Para[0061] teaches there are different frame packing configurations, such as 3×2 and 4×3. In the 3×2 configuration, the 6 faces are packed into 2 rows, with 3 faces in one row. In the 4×3 configuration, the 4 faces PX, NZ, NX, PZ are packed into one row (e.g., the center row), and the faces PY and NY are separately packed into two different rows (e.g., the top and bottom rows).
Regarding claim 12, Hanhart discloses The image decoding method of claim 9, wherein the flipping information includes information indicating whether flipping is applied to the sub-regions (Para[0105] face_vertical_flip_flag[i][j]: specifies whether the face located at the i-th row and j-th column in the frame packed picture is flipped vertically after rotation & Para[0112] teaches face_vertical_flip_flag& Table & Fig. 9C & FIG. 10E: 0° rotation followed by vertical flip; FIG. 10F: 90° rotation followed by vertical flip; FIG. 10G: 180° rotation followed by vertical flip; FIG. 10H: 270° rotation followed by vertical flip).
Regarding claim 13, Hanhart discloses the image decoding method of claim 9, wherein the flipping information includes information indicating a sub-region to which flipping is applied among the sub-regions (Para[0105] face_vertical_flip_flag[i][j]: specifies whether the face located at the i-th row and j-th column in the frame packed picture is flipped vertically after rotation & Para[0112] teaches face_vertical_flip_flag& Table [& Fig. 9C & FIG. 10E: 0° rotation followed by vertical flip; FIG. 10F: 90° rotation followed by vertical flip; FIG. 10G: 180° rotation followed by vertical flip; FIG. 10H: 270° rotation followed by vertical flip).
.
Regarding claim 14, Hanhart discloses the an image encoding method, comprising: generating a prediction block by predicting a current block in a picture; encoding the picture based on the prediction block (Fig. 6 & Para[0067] teaches the prediction block is then subtracted from the current video block (116); and the prediction residual is de-correlated using transform (104) and quantized (106) to achieve the target bit-rate. The quantized residual coefficients are inverse quantized (110) and inverse transformed (112) to form the reconstructed residual, which is then added back to the prediction block (126) to form the reconstructed video block); encoding rearrangement information related to rearranging sub-regions in the picture (Para[0011] teaches syntax elements may be used to specify a projection geometry and/or to specify an arrangement of faces in a frame-packed picture using a grid system. Faces can have different size and/or orientation. In some embodiments, face arrangement on a 2-D plane may have various characteristics, such as constant face width/height along each column/row. 360-Degree Video Property Signaling at Video Level. Para[0077] teaches each picture may be coded in a different projection geometry or with the same geometry but with different face arrangements, sizes, or quality); encoding projection information for mapping the picture to a three-dimensional coordinate system (Para[0130] teaches parameters may be used to map a sample from its location in the frame-packed picture to the corresponding location in the 3D geometry. This information may be exploited by advanced 360-video coding to achieve better compression efficiency. For example, the codec may exploit redundant information between neighboring faces in the 3D representation that are not collocated in the frame-packed picture); and generating a bitstream comprising the rearrangement information and the projection information (Abstract teaches an encoder selects a projection format and maps the 360-degree video to a 2D planar video using the selected projection format. The encoder encodes the 2D planar video in a bitstream and further signals, in the bitstream, parameters identifying the projection format);, wherein the rearrangement information includes rearrangement type information indicating a rearrangement type and flipping information for the sub-regions (para[0009] & claim 14 teaches encoding 360-degree video, an encoder selects a projection format, wherein the projection format includes information such as a geometry type and/or geometry orientation. The encoder maps the 360-degree video to a 2D planar video using the selected projection format. The encoder encodes the 2D planar video in a bitstream and further signals, in the bitstream, parameters identifying the projection format. Various geometry types may be used and may be signaled in the bitstream, including equirectangular, cubemap, equal-area, octahedron, icosahedron, cylinder, and user-specified polygon. For geometries types that are associated with a plurality of faces, frame-packing parameters may be signaled to identify the positions and/or orientations of those faces in the 2D planar video. Different faces may be encoded with different sizes and/or different levels of quality. Para[0075], Para[0111] teaches faces may be arranged with different orientations, para0156] teaches FIGS. 14A and 14B illustrate exemplary alternative arrangements of faces in a frame-packed picture. FIGS. 14A and 14B each illustrate arrangements of six faces, such as may be used in conjunction with a cubemap projection, Para[0103] and table 6 teaches face_rotation_idc syntax element Para[0105] teaches face_vertical_flip_flag. Para[0112] & Table teaches rotation may be combined with a vertical flip (or, in some embodiments, a horizontal flip) & Table teaches face_vertical_flip_flag).
Regarding claim 15, Hanhart discloses a method for transmitting a bitstream (para[0009] teaches the encoder encodes the 2D planar video in a bitstream and further signals, in the bitstream, parameters identifying the projection format. Various geometry types may be used and may be signaled in the bitstream, including equirectangular, cubemap, equal-area, octahedron, icosahedron, cylinder, and user-specified polygon. For geometries types that are associated with a plurality of faces, frame-packing parameters may be signaled to identify the positions and/or orientations of those faces in the 2D planar video. Different faces may be encoded with different sizes and/or different levels of quality), comprising: generating a prediction block by predicting a current block in a picture; encoding the picture based on the prediction block (Fig. 6 & Para[0067] teaches the prediction block is then subtracted from the current video block (116); and the prediction residual is de-correlated using transform (104) and quantized (106) to achieve the target bit-rate. The quantized residual coefficients are inverse quantized (110) and inverse transformed (112) to form the reconstructed residual, which is then added back to the prediction block (126) to form the reconstructed video block); encoding rearrangement information related to rearranging sub-regions in the picture Para[0011] teaches syntax elements may be used to specify a projection geometry and/or to specify an arrangement of faces in a frame-packed picture using a grid system. Faces can have different size and/or orientation. In some embodiments, face arrangement on a 2-D plane may have various characteristics, such as constant face width/height along each column/row. 360-Degree Video Property Signaling at Video Level. Para[0077] teaches each picture may be coded in a different projection geometry or with the same geometry but with different face arrangements, sizes, or quality); encoding projection information for mapping the picture to a three-dimensional coordinate system (Para[0130] teaches parameters may be used to map a sample from its location in the frame-packed picture to the corresponding location in the 3D geometry. This information may be exploited by advanced 360-video coding to achieve better compression efficiency. For example, the codec may exploit redundant information between neighboring faces in the 3D representation that are not collocated in the frame-packed picture); generating the bitstream comprising the rearrangement information and the projection information (Abstract teaches an encoder selects a projection format and maps the 360-degree video to a 2D planar video using the selected projection format. The encoder encodes the 2D planar video in a bitstream and further signals, in the bitstream, parameters identifying the projection format); and transmitting the bitstream, wherein the rearrangement information includes rearrangement type information indicating a rearrangement type and flipping information for the sub-regions (para[0009] & claim 14 teaches encoding 360-degree video, an encoder selects a projection format, wherein the projection format includes information such as a geometry type and/or geometry orientation. The encoder maps the 360-degree video to a 2D planar video using the selected projection format. The encoder encodes the 2D planar video in a bitstream and further signals, in the bitstream, parameters identifying the projection format. Various geometry types may be used and may be signaled in the bitstream, including equirectangular, cubemap, equal-area, octahedron, icosahedron, cylinder, and user-specified polygon. For geometries types that are associated with a plurality of faces, frame-packing parameters may be signaled to identify the positions and/or orientations of those faces in the 2D planar video. Different faces may be encoded with different sizes and/or different levels of quality. Para[0075], Para[0111] teaches faces may be arranged with different orientations, para0156] teaches FIGS. 14A and 14B illustrate exemplary alternative arrangements of faces in a frame-packed picture. FIGS. 14A and 14B each illustrate arrangements of six faces, such as may be used in conjunction with a cubemap projection, Para[0103] and table 6 teaches face_rotation_idc syntax element Para[0105] teaches face_vertical_flip_flag. Para[0112] & Table teaches rotation may be combined with a vertical flip (or, in some embodiments, a horizontal flip) & Table teaches face_vertical_flip_flag).
Conclusion
The prior art made of record and not relied upon is considered pertinent to applicant's disclosure.
Abbas et al. (US 2017/0295356 A1) discloses encoding the image , a facet may be encoded independent from other portions of the image (other facets). The encoded version of the facet may be transformed to obtain transformed portions. The transformation may include rotation, flipping (horizontally or vertically).
Any inquiry concerning this communication or earlier communications from the examiner should be directed to ROWINA J CATTUNGAL whose telephone number is (571)270-5922. The examiner can normally be reached Monday-Thursday 7:30am-6pm.
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, Brian Pendleton can be reached at (571) 272-7527. 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.
/ROWINA J CATTUNGAL/Primary Examiner, Art Unit 2425
Prosecution Insights