# US 2026/0101068 A1 · Method and apparatus for reconstructing 360-degree image according to projection format

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2026/0101068 A1
- Document ID: US20260101068A1
- Status: Published application
- Kind: A1
- Application number: 19/414,703
- Filed: 2025-12-10
- Published: 2026-04-09
- Earliest claimed: 2016-10-04
- Assignees: B1 Institute of Image Technology, Inc.
- Applicants: B1 Institute of Image Technology, Inc.
- Inventors: Ki Baek KIM
- Web page: https://patentgrep.com/patent/US20260101068A1

## CPC

- H04N 19/105: Selection of the reference unit for prediction within a chosen coding or prediction mode, e.g. adaptive choice of position and number of pixels used for prediction
- H04N 19/88: involving rearrangement of data among different coding units, e.g. shuffling, interleaving, scrambling or permutation of pixel data or permutation of transform coefficient data among different blocks
- G06T 3/08: Projecting images onto non-planar surfaces, e.g. geodetic screens
- G06T 3/40: Scaling of whole images or parts thereof, e.g. expanding or contracting
- H04N 11/28: {involving bandwidth reduction, e.g. subsampling}
- H04N 19/103: Selection of coding mode or of prediction mode
- H04N 19/11: among a plurality of spatial predictive coding modes
- H04N 19/117: Filters, e.g. for pre-processing or post-processing (sub-band filter banks H04N19/635)
- H04N 19/119: Adaptive subdivision aspects, e.g. subdivision of a picture into rectangular or non-rectangular coding blocks
- H04N 19/124: Quantisation
- H04N 19/129: Scanning of coding units, e.g. zig-zag scan of transform coefficients or flexible macroblock ordering [FMO]
- H04N 19/13: Adaptive entropy coding, e.g. adaptive variable length coding [AVLC] or context adaptive binary arithmetic coding [CABAC]
- H04N 19/132: Sampling, masking or truncation of coding units, e.g. adaptive resampling, frame skipping, frame interpolation or high-frequency transform coefficient masking
- H04N 19/134: characterised by the element, parameter or criterion affecting or controlling the adaptive coding
- H04N 19/159: Prediction type, e.g. intra-frame, inter-frame or bidirectional frame prediction
- H04N 19/167: Position within a video image, e.g. region of interest [ROI]
- H04N 19/17: the unit being an image region, e.g. an object
- H04N 19/174: the region being a slice, e.g. a line of blocks or a group of blocks
- H04N 19/176: the region being a block, e.g. a macroblock
- H04N 19/18: the unit being a set of transform coefficients
- H04N 19/186: the unit being a colour or a chrominance component
- H04N 19/30: using hierarchical techniques, e.g. scalability (H04N19/63 takes precedence)
- H04N 19/31: in the temporal domain
- H04N 19/33: in the spatial domain
- H04N 19/44: Decoders specially adapted therefor, e.g. video decoders which are asymmetric with respect to the encoder
- H04N 19/503: involving temporal prediction (adaptive coding with adaptive selection between spatial and temporal predictive coding H04N19/107; adaptive coding with adaptive selection among a plurality of temporal predictive coding modes H04N19/109)
- H04N 19/51: Motion estimation or motion compensation
- H04N 19/527: Global motion vector estimation
- H04N 19/55: Motion estimation with spatial constraints, e.g. at image or region borders
- H04N 19/563: Motion estimation with padding, i.e. with filling of non-object values in an arbitrarily shaped picture block or region for estimation purposes
- H04N 19/59: involving spatial sub-sampling or interpolation, e.g. alteration of picture size or resolution
- H04N 19/597: specially adapted for multi-view video sequence encoding
- H04N 19/61: in combination with predictive coding
- H04N 19/625: using discrete cosine transform [DCT]
- H04N 19/70: characterised by syntax aspects related to video coding, e.g. related to compression standards
- H04N 19/80: Details of filtering operations specially adapted for video compression, e.g. for pixel interpolation (H04N19/635, H04N19/86 take precedence)
- H04N 19/82: involving filtering within a prediction loop
- H04N 19/85: using pre-processing or post-processing specially adapted for video compression
- H04N 19/86: involving reduction of coding artifacts, e.g. of blockiness
- H04N 19/96: Tree coding, e.g. quad-tree coding
- H04N 23/698: for achieving an enlarged field of view, e.g. panoramic image capture
- H04N 19/45: {performing compensation of the inverse transform mismatch, e.g. Inverse Discrete Cosine Transform [IDCT] mismatch}
- H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION
- G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL

## Abstract

Disclosed are methods and apparatuses for image data encoding/decoding. A method for decoding a 360-degree image includes the steps of: receiving a bitstream obtained by encoding a 360-degree image; generating a prediction image by making reference to syntax information obtained from the received bitstream; adding the generated prediction image to a residual image obtained by dequantizing and inverse-transforming the bitstream, so as to obtain a decoded image; and reconstructing the decoded image into a 360-degree image according to a projection format. Therefore, the performance of image data compression can be improved.

## Claims

### Claim 1

A method for processing an image, the method comprising:
receiving a bitstream for the image;
obtaining a decoded image by decoding the bitstream;
determining a mode for reconstructing the decoded image based on reconstruction-related information included in the bitstream; and
reconstructing the decoded image based on the mode,
wherein the image is obtained based on a prediction block and a residual block for a block included in the image, and
wherein the mode comprises a plurality of candidate modes including flipping, rotating and a combination of the flipping and the rotating.

### Claim 2 (depends on 1)

The method of claim 1, wherein whether to reconstruct the decoded image is determined based on the reconstruction-related information.

### Claim 3 (depends on 1)

The method of claim 1, wherein the reconstructing the decoded image comprises rearranging pixels in the decoded image.

### Claim 4 (depends on 3)

The method of claim 3, wherein the rearranging is performed based on a size of the decoded image before the rearranging and a size of the decoded image after the rearranging.

### Claim 5 (depends on 4)

The method of claim 4, wherein the rearranging is performed using a ratio of the size of the decoded image before the rearranging to the size of the decoded image after the rearranging.

### Claim 6

A method for processing an image, the method comprising:
encoding the image into a bitstream;
determining a mode for reconstructing a decoded image which is obtained by decoding the bitstream; and
encoding the mode based on reconstruction-related information into the bitstream,
wherein the image is encoded based on a prediction block and a residual block for a block included in the image, and
wherein the mode comprises a plurality of candidate modes including flipping, rotating and a combination of the flipping and the rotating.

### Claim 7

A method for transmitting a bitstream, the method comprising:
encoding the image into a bitstream;
determining a mode for reconstructing a decoded image which is obtained by decoding the bitstream;
encoding the mode based on reconstruction-related information into the bitstream; and
transmitting the bitstream,
wherein the image is encoded based on a prediction block and a residual block for a block included in the image, and
wherein the mode comprises a plurality of candidate modes including flipping, rotating and a combination of the flipping and the rotating.
