IP Library Granted Patent US 12,335,474
Granted Patent B2
US 12,335,474 · App. 18/415,282 · Granted Jun 17, 2025

Method and device for encoding or decoding encoding unit of picture outline

Inventors: Min-woo Park (Yongin-si, KR); Bo-ra Jin (Yongin-si, KR); Chan-yul Kim (Seongnam-si, KR); Jung-hye Min (Yongin-si, KR)
Assignee: SAMSUNG ELECTRONICS CO., LTD.
H04N19/119H04N19/14H04N19/167H04N19/172H04N19/176
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,335,474
App. No.
18/415,282
Granted
Jun 17, 2025
Kind
B2
Abstract

Provided are a method and apparatus for encoding or decoding a coding unit on an outline of a picture. An image decoding method and apparatus according to an embodiment determine whether a current coding unit extends across an outline of a picture, by comparing a location of the current coding unit in the picture to at least one of a width and a height of the picture, split the current coding unit in at least one direction into a plurality of coding units based on a shape of the current coding unit upon determining that the current coding unit extends across the outline of the picture, obtain block shape information and split type information of the current coding unit from a bitstream and split the current coding unit into a plurality of coding units based on the block shape information and the split type information upon determining that the current coding unit does not extend across the outline of the picture, and decode a coding unit that is no longer split among the plurality of coding units.

Claims (13)

1. An image decoding method comprising:

when a current coding unit having a square shape includes a region that deviates from a lower boundary of an image, not obtaining, from a bitstream, split type information of the current coding unit, and obtaining a first block and a second block by splitting the current coding unit in a horizontal direction;

when the first block includes a region that deviates from a right boundary of the image, splitting the first block in a vertical direction;

when the current coding unit includes neither the region that deviates from the lower boundary of the image nor the region that deviates from the right boundary of the image, obtaining, from the bitstream, the split type information of the current coding unit and splitting the current coding unit into a plurality of coding units based on the split type information; and

decoding a coding unit that is no longer split among the plurality of coding units.

2. An image encoding method comprising:

when a current coding unit having a square shape includes a region that deviates from a lower boundary of an image, not generating split type information of the current coding unit, and obtaining a first block and a second block by splitting the current coding unit in a horizontal direction;

when the first block includes a region that deviates from a right boundary of the image, splitting the first block in a vertical direction;

when the current coding unit includes neither the region that deviates from the lower boundary of the image nor the region that deviates from the right boundary of the image, generating the split type information of the current coding unit and splitting the current coding unit into a plurality of coding units based on the split type information; and

encoding a coding unit that is no longer split among the plurality of coding units.

3. A device for transmitting a bitstream, the device comprising:

a processor configured to perform the image encoding method of claim 2 ; and

a transmitter configured to transmit the bitstream.

Continuity (3)
Continuation 17882236 · Aug 5, 2022
Continuation 16339270
Related Publication 20240155124A1 · May 9, 2024
References Cited (41)
US 8090154B2 · Cho · 2012 [cited by applicant]
US 9277239B2 · Min et al. · 2016 [cited by applicant]
US 20070253490A1 · Makino · 2007 [cited by applicant]
US 20110103701A1 · Cheon · 2011 [cited by examiner]
US 20130287312A1 · Minezawa et al. · 2013 [cited by applicant]
US 20130315312A1 · Amano et al. · 2013 [cited by applicant]
US 20160373766A1 · Fuldseth · 2016 [cited by examiner]
US 20170244964A1 · Liu et al. · 2017 [cited by applicant]
US 20190075328A1 · Huang et al. · 2019 [cited by applicant]
US 20190246106A1 · Park et al. · 2019 [cited by applicant]
CN 102640492A · 2012 [cited by applicant]
EP 2945379 · 2015 [cited by applicant]
EP 3059708A1 · 2016 [cited by applicant]
EP 3249611B1 · 2019 [cited by applicant]
IN 345430B1 · 2013 [cited by applicant]
JP 2007318726A · 2007 [cited by applicant]
JP 2013509788A · 2013 [cited by applicant]
JP 2015084573A · 2015 [cited by applicant]
KR 1020090055353A · 2009 [cited by applicant]
KR 1020110047697A · 2011 [cited by applicant]
KR 1020140139459A · 2014 [cited by applicant]
WO 2016090568A1 · 2016 [cited by applicant]
Communication dated Nov. 2, 2022 issued by the National Intellectual Property Administration, PRC, in counterpart Chinese Application No. 201680091245.7. [cited by applicant]
Yang F et al., “CTB splittng on frame boundary for arbitrary resolution video”, Oct. 1, 2010, 3. JCT-VC Meeting; 94. MPEG Meeting; (Joint Collaborative Team on Video Coding of ISO/IECJTC1/SC29/WG11 and ITU-T SG.16; Retr… [cited by applicant]
Communication issued Mar. 9, 2022 by the State Intellectual Property Office of People's Republic of China for Chinese Patent Application No. 201680091245.7. [cited by applicant]
Communication issued Oct. 8, 2021 by the Korean Intellectual Property Office in Korean Application No. 10-2021-7021524. [cited by applicant]
Communication issued Sep. 22, 2023 by the Korean Intellectual Property Office in Korean Patent Application No. 10-2023-7002058. [cited by applicant]
Gary J. Sullivan et al., “Overview of the High Efficiency Video Coding (HEVD) Standard”, IEEE Transactions on Circuits and Systems for Video Technology, vol. 22, No. 12, Dec. 1, 2012, pp. 1649-1668, (20 pages total). [cited by applicant]
Communication dated Apr. 7, 2020, issued by the Japanese Patent Office in counterpart Japanese Application No. 2019-519207. [cited by applicant]
Communication dated Aug. 2, 2021 issued by the Korean Intellectual Property Office in Korean Application No. 10-2019-7007378. [cited by applicant]
Communication dated Dec. 5, 2020 issued by the Korean Intellectual Property Office in counterpart Korean Application No. 10-2019-7007378. [cited by applicant]
Communication dated Jul. 14, 2020 from the Japanese Patent Office in application No. 2019-519207. [cited by applicant]
Communication dated Jul. 4, 2019, issued by the European Patent Office in counterpart European Application No. 16918864.6. [cited by applicant]
Communication dated Jul. 5, 2022, issued by the Japan Patent Office in counterpart Japanese Patent Application No. 2021-128196. [cited by applicant]
Communication dated Jun. 28, 2022, issued by the European Patent Office in counterpart European Application No. 16918864.6. [cited by applicant]
Communication dated Jun. 3, 2022, issued by the European Patent Office in counterpart European Application No. 16918864.6. [cited by applicant]
Communication dated Jun. 8, 2021 issued by the Korean Intellectual Property Office in Korean Application No. 10-2019-7007378. [cited by applicant]
X. Li et al., “Multi-Type-Tree”, Joint Video Exploration Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, 4th Meeting, Chengdu, CN, JVET-D0117, Oct. 6, 2016, 5 pages. [cited by applicant]
International Search Report (PCT/ISA/210) & Written Opinion (PCT/ISA/237) dated Jul. 3, 2017 issued by the International Searching Authority in International Application No. PCT/KR2016/011295. [cited by applicant]
Communication issued May 16, 2024 by the Korean Intellectual Property Office in the Korean Patent Application No. 10-2023-7002058. [cited by applicant]
Communication issued May 21, 2024 by the Japanese Patent Office in the Japanese Patent Application No. 2023-40705. [cited by applicant]