AS Pseudo Claim Charting Due Diligence US10250913B2

Purpose: Invalidity Analysis

Patent: US10250913B2
Filed: 2010-04-13
Issued: 2019-04-02
Patent Holder: (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC
Inventor(s): Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand

Title: Coding of a spatial sampling of a two-dimensional information signal using sub-division

Abstract: Coding schemes for coding a spatially sampled information signal using sub-division and coding schemes for coding a sub-division or a multitree structure are described, wherein representative embodiments relate to picture and/or video coding applications.

Refer to: Unified Patents PATROLL Contests

Refer to: Fraunhoffer / GE Video - US 10,250,913 (Video Codecs) and Litigation Background (Deadline: August 31, 2020)

Refer to: Pseudo Claim Charts Prepared by Apex Standards for other PATROLL Contests

Disclaimer: The promise of Apex Standards Pseudo Claim Charting (PCC) [ Request Form ] is not to replace expert opinion but to provide due diligence and transparency prior to high precision charting. PCC conducts aggressive mapping (based on Broadest Reasonable, Ordinary or Customary Interpretation and Multilingual Translation) between a target patent's claim elements and other documents (potential technical standard specification or prior arts in the same or across different jurisdictions), therefore allowing for a top-down, apriori evaluation, with which, stakeholders can assess standard essentiality (potential strengths) or invalidity (potential weaknesses) quickly and effectively before making complex, high-value decisions. PCC is designed to relieve initial burden of proof via an exhaustive listing of contextual semantic mapping as potential building blocks towards a litigation-ready work product. Stakeholders may then use the mapping to modify upon shortlisted PCC or identify other relevant materials in order to formulate strategy and achieve further purposes.

Click on references to view corresponding claim charts.

Non-Patent Literature

WIPO Prior Art

EP Prior Art

US Prior Art

CN Prior Art

JP Prior Art

KR Prior Art

Ground	References	Owner of the Reference	Title	Semantic Mapping	Challenged Claims
Ground	References	Owner of the Reference	Title	Semantic Mapping	1	2	3	4	5	6	7	8	9	10	11	12	13	14	15	16
1	IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY. 4 (2): 181-194 APR 1994 (Hotter, 1994)	Robert Bosch GmbH	OPTIMIZATION AND EFFICIENCY OF AN OBJECT-ORIENTED ANALYSIS-SYNTHESIS CODER	▪ rectangular blocks ≈ rectangular blocks ▪ first set, second set ≈ parameter sets	X	X	X	X		X		X	X			X	X	X
2	IEEE TRANSACTIONS ON IMAGE PROCESSING. 2 (4): 481-498 OCT 1993 (Zakhor, 1993)	University of California, Berkeley	Edge-based 3-D Camera Motion Estimation With Application To Video Coding	▪ order hierarchy level ≈ computational complexity ▪ prediction coding, prediction signal ≈ local motion ▪ first traversal ≈ more gene	X	X										X	X	X
3	APPLICATIONS OF DIGITAL IMAGE PROCESSING XXVII, PTS 1AND 2. 5558: 454-474 Part 1&2 2004 (Sullivan, 2004)	Microsoft Corporation	The H.264/AVC Advanced Video Coding Standard: Overview And Introduction To The Fidelity Range Extensions	▪ syntax elements ≈ video coding ▪ video information ≈ hard disk	X							X	X			X	X	X
4	APPLICATIONS OF DIGITAL IMAGE PROCESSING XXIII. 4115: 384-395 2000 (Liang, 2000)	Johns Hopkins University	Fast Multiplierless Approximation Of The DCT With The Lifting Scheme	▪ neighboring subset ≈ different complexities ▪ root region ≈ mean square error	X	X		X								X	X	X
5	IEEE TRANSACTIONS ON CONSUMER ELECTRONICS. 44 (1): 200-205 FEB 1998 (Liu, 1998)	National Taiwan University	A Java-based MPEG-4 Like Video Codec	▪ computer program ≈ digital storage ▪ second subdivision, second subset ≈ video encoder	X								X			X	X	X	X	X
6	VISUAL COMMUNICATIONS AND IMAGE PROCESSING 97, PTS 1-2. 3024: 953-963 Part 1 & 2 1997 (Ferman, 1997)	University of Rochester	Object-based Indexing Of MPEG-4 Compressed Video	▪ information samples using prediction coding ≈ global motion ▪ data stream ≈ video object ▪ rectangular blocks ≈ th frame	X		X				X	X	X	X		X	X	X
7	THIRTIETH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS & COMPUTERS, VOLS 1 AND 2. : 943-947 1997 (Mehrotra, 1997)	Stanford University	Adaptive Coding Using Finite State Hierarchical Table Lookup Vector Quantization With Variable Block Sizes	▪ information samples using prediction coding ≈ reduce encoding complexity ▪ prediction signal ≈ adjacent blocks	X	X										X	X	X
8	IEEE TRANSACTIONS ON IMAGE PROCESSING. 4 (7): 896-908 JUL 1995 (Yang, 1995)	Northwestern University	PROJECTION-BASED SPATIALLY ADAPTIVE RECONSTRUCTION OF BLOCK-TRANSFORM COMPRESSED IMAGES	▪ order hierarchy level ≈ computational complexity ▪ spatial domain ≈ statistical properties ▪ transform coding ≈ transform coding	X									X		X	X	X
9	SIGNAL PROCESSING-IMAGE COMMUNICATION. 7 (4-6): 581-592 NOV 1995 (Yang, 1995)	Seoul National University	MOTION-COMPENSATED WAVELET TRANSFORM CODER FOR VERY-LOW BIT-RATE VISUAL TELEPHONY	▪ quadtree partitioning ≈ tree structure ▪ maximum hierarchy ≈ input vectors	X			X			X				X	X	X	X
10	JOURNAL OF VLSI SIGNAL PROCESSING. 7 (1-2): 7-16 FEB 1994 (Dean, 1994)	Stanford University	SELF-TIMED LOGIC USING CURRENT-SENSING COMPLETION DETECTION (CSCD)	▪ order hierarchy levels ≈ improved performance ▪ data stream ≈ data stream	X						X	X	X	X		X	X	X
11	PROCEEDINGS OF THE IEEE. 81 (9): 1326-1341 SEP 1993 (Cosman, 1993)	University of Washington, Stanford University	USING VECTOR QUANTIZATION FOR IMAGE-PROCESSING	▪ rectangular blocks ≈ image processing operation ▪ order hierarchy level ≈ computational complexity			X
12	IEEE TRANSACTIONS ON IMAGE PROCESSING. 1 (4): 477-487 OCT 1992 (Huang, 1992)	Audio Digital Imaging Inc	Prioritized DCT For Compression And Progressive Transmission Of Images	▪ first hierarchy level ≈ discrete cosine transform ▪ spatial domain ≈ coding technique ▪ second subdivision, intermediate subdivision ≈ entropy coding	X			X					X			X	X	X
13	IEEE TRANSACTIONS ON CONSUMER ELECTRONICS. 38 (3): 325-340 AUG 1992 (Netravali, 1992)	AT&T Bell Labs	A CODEC FOR HDTV	▪ intra-prediction mode ≈ transmission modes ▪ transform coding ≈ transform coding	X	X								X		X	X	X
14	IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY. 1 (1): 147-155 MAR 1991 (Lei, 1991)	Bellcore (Bell Communications Research), University of Washington	An Entropy Coding System For Digital HDTV Applications	▪ second subdivision information, first subdivision information ≈ parallel process ▪ second subdivision, intermediate subdivision ≈ entropy coding	X			X		X			X			X	X	X
15	US20100061450A1 (Kazushi Sato, 2010)	(Original Assignee) Sony Corp (Current Assignee) Sony Corp	Method and apparatus for coding image information, method and apparatus for decoding image information, method and apparatus for coding and decoding image information, and system of coding and transmitting image information	▪ computer program ≈ computer program ▪ first subdivision ≈ default value ▪ second subdivision information ≈ block basis	X			X		X			X			X	X	X	X	X
16	WO2010039733A2 (Peisong Chen, 2010)	(Original Assignee) Qualcomm Incorporated	Video coding with large macroblocks	▪ second subdivision, second subset ≈ video encoder ▪ first set ≈ different one	X	X	X	X		X			X			X	X	X
17	US20100086029A1 (Peisong Chen, 2010)	(Original Assignee) Qualcomm Inc (Current Assignee) Velos Media LLC	Video coding with large macroblocks	▪ second subdivision, second subset ≈ video encoder ▪ first set ≈ different one	X	X	X	X		X			X			X	X	X
18	US20100086031A1 (Peisong Chen, 2010)	(Original Assignee) Qualcomm Inc (Current Assignee) Velos Media LLC	Video coding with large macroblocks	▪ rectangular blocks ≈ type syntax information ▪ second subdivision, second subset ≈ video encoder	X		X						X			X	X	X
19	CN101493890A (侯小笛, 2009)	(Original Assignee) 上海交通大学	基于特征的动态视觉注意区域提取方法	▪ second subdivision, first subdivision ≈ 的权重 ▪ first subset ≈ 的滤波 ▪ order hierarchy levels ≈ 第二步	X			X		X			X			X	X	X
20	US20090080521A1 (Detlev Marpe, 2009)	(Original Assignee) Fraunhofer Gesellschaft zur Forderung der Angewandten Forschung eV (Current Assignee) Fraunhofer Gesellschaft zur Forderung der Angewandten Forschung eV	Video frame encoding and decoding	▪ spatial domain transform coding ≈ different probability ▪ second set ≈ following steps ▪ prediction coding, syntax elements ≈ same slice	X	X						X	X			X	X	X
21	US20090129465A1 (Polin Lai, 2009)	(Original Assignee) Thomson Licensing SAS (Current Assignee) InterDigital Madison Patent Holdings Inc	Methods and apparatus for adaptive reference filtering (arf) of bi-predictive pictures in multi-view coded video	▪ rectangular blocks ≈ one reference picture, single reference ▪ first subdivision information ≈ prediction direction ▪ hierarchy level ≈ high level syntax ▪ syntax elements ≈ syntax element ▪ first set, second set ≈ first one, first set	X	X	X	X	X	X	X	X	X			X	X	X
22	CN101510865A (M·P·A·泰勒, 2009)	(Original Assignee) 索尼株式会社	数据处理设备及方法	▪ respective partition ≈ 的数据处理 ▪ first maximum region ≈ 的整数	X		X	X								X	X	X
23	WO2009051719A2 (Oscar Divorra Escoda, 2009)	(Original Assignee) Thomson Licensing	Methods and apparatus for video encoding and decoding geometically partitioned super blocks	▪ transform coding ≈ deblocking filtering ▪ hierarchy level ≈ high level syntax ▪ quadtree partitioning ≈ partition size ▪ syntax elements ≈ video coding ▪ order hierarchy levels ≈ slice level	X			X	X	X	X	X	X	X	X	X	X	X
24	US20090180552A1 (Mohammed Z. Visharam, 2009)	(Original Assignee) Sony Corp; Sony Electronics Inc (Current Assignee) Sony Corp ; Sony Electronics Inc	Video coding system using texture analysis and synthesis in a scalable coding framework	▪ next intra-prediction cycle ≈ performing addition ▪ syntax elements ≈ performing texture, video coding ▪ neighboring subset ≈ various categories ▪ computer program ≈ computer program ▪ root region ≈ said method ▪ spatial domain transform coding ≈ T blocks	X	X		X				X	X			X	X	X	X	X
25	US20090154567A1 (Shaw-Min Lei, 2009)	(Original Assignee) MediaTek Inc (Current Assignee) MediaTek Inc	In-loop fidelity enhancement for video compression	▪ transform coding ≈ prediction residue ▪ data stream ≈ entropy decoding ▪ second subdivision, intermediate subdivision ≈ entropy coding ▪ first set ≈ cost function	X	X	X	X		X	X	X	X	X		X	X	X
26	US20100046626A1 (Chengjie Tu, 2010)	(Original Assignee) Microsoft Corp (Current Assignee) Microsoft Technology Licensing LLC	Entropy coding/decoding of hierarchically organized data	▪ first set ≈ software instructions ▪ prediction coding ≈ coded block pattern ▪ spatial domain transform coding ≈ different context ▪ partition rule ≈ coding data ▪ information samples using prediction coding ≈ plural sets	X	X	X	X		X			X			X	X	X
27	US20090096643A1 (Yuan-Teng Chang, 2009)	(Original Assignee) Industrial Technology Research Institute ITRI (Current Assignee) Industrial Technology Research Institute ITRI	System and Method for Context-Based Adaptive Binary Arithematic Encoding and Decoding	▪ syntax elements ≈ second syntax element, syntax elements ▪ respective root ≈ second lookup table, first lookup table ▪ first maximum region size, second maximum region size ≈ calculating device ▪ partition rule ≈ first calculating	X		X	X				X	X			X	X	X
28	CN101682770A (叶琰, 2010)	(Original Assignee) 高通股份有限公司	视频块预测模式的自适应译码	▪ prediction signal ≈ 余预测 ▪ quadtree partitioning technique ≈ 的变换		X									X
29	US20090296017A1 (Shin Itoh, 2009)	(Original Assignee) Sharp Corp (Current Assignee) Sharp Corp	Line light source device, plane light emission device, plane light source device, and liquid crystal display	▪ partition indication flag ≈ crystal display ▪ first maximum region size ≈ surface regions ▪ maximum hierarchy level ≈ side surfaces	X		X	X		X	X					X	X	X
30	US20080310504A1 (Yan Ye, 2008)	(Original Assignee) Qualcomm Inc (Current Assignee) Velos Media LLC	Adaptive coefficient scanning for video coding	▪ data stream ≈ entropy decoding ▪ second subdivision, intermediate subdivision ≈ entropy coding ▪ syntax elements ≈ video coding	X						X	X	X	X		X	X	X
31	CN101682763A (奥斯卡·迪沃拉埃斯科达, 2010)	(Original Assignee) 汤姆森许可贸易公司	支持针对片数据的多通路视频语法结构的方法和设备	▪ second maximum region sizes ≈ 至少一个语法元素 ▪ intra-prediction mode, next intra-prediction cycle ≈ 编码标准 ▪ quadtree partitioning ≈ 显式编码 ▪ video information ≈ 视频信号 ▪ spatial domain transform coding ≈ 法结构中 ▪ second maximum region ≈ 种方法 ▪ spatial domain ≈ 的设备	X	X									X	X	X	X
32	WO2008156548A1 (Oscar Divorra Escoda, 2008)	(Original Assignee) Thomson Licensing	Methods and apparatus supporting multi-pass video syntax structure for slice data	▪ hierarchy level ≈ high level syntax ▪ syntax elements ≈ video coding	X			X	X	X	X	X	X			X	X	X
33	WO2009092455A2 (Jacob STRÖM, 2009)	(Original Assignee) Telefonaktiebolaget Lm Ericsson (Publ)	Prediction-based image processing	▪ video information ≈ respective color ▪ computer program ≈ classifying step ▪ root region ≈ said method	X			X								X	X	X	X	X
34	WO2009092454A1 (Jacob STRÖM, 2009)	(Original Assignee) Telefonaktiebolaget Lm Ericsson (Publ)	Prediction-based image processing	▪ first subdivision information ≈ prediction direction ▪ second maximum region size ≈ positive integer ▪ data stream generator ≈ first difference ▪ intermediate subdivision ≈ generating step ▪ root region ≈ said method ▪ respective partition ≈ two times	X			X		X			X			X	X	X
35	US20090273706A1 (Chengjie Tu, 2009)	(Original Assignee) Microsoft Corp (Current Assignee) Microsoft Technology Licensing LLC	Multi-level representation of reordered transform coefficients	▪ video information ≈ video information ▪ data stream ≈ entropy decoding ▪ second subdivision, intermediate subdivision ≈ entropy coding ▪ first subset ≈ first subset ▪ order hierarchy levels ≈ lower level ▪ second set ≈ second set ▪ first set ≈ first set	X	X	X	X		X	X	X	X	X		X	X	X
36	US20090080536A1 (Chang-Jin Lee, 2009)	(Original Assignee) Samsung Electronics Co Ltd (Current Assignee) Samsung Electronics Co Ltd	Image processing apparatus, display apparatus, display system and control method thereof	▪ prediction coding, prediction signal ≈ user input unit ▪ spatial domain transform coding ≈ user interface	X	X										X	X	X
37	WO2008127072A1 (Hae-Chul Choi, 2008)	(Original Assignee) Electronics And Telecommunications Research Institute; Industry-Academia Cooperation Group Of Sejong University	Color video scalability encoding and decoding method and device thereof	▪ computer program ≈ readable recording medium ▪ data stream ≈ entropy decoding ▪ second maximum region, second maximum region sizes ≈ decoding device	X						X	X	X	X		X	X	X	X	X
38	CN101682769A (奥斯卡·迪沃拉埃斯科达, 2010)	(Original Assignee) 汤姆森特许公司	用于视频编码和解码的跳过-直接模式的取决于环境的合并的方法和装置	▪ video information ≈ 视频信号 ▪ quadtree partitioning ≈ 显式编码 ▪ second maximum region ≈ 种方法	X										X	X	X	X
39	WO2008128898A1 (Yongying Gao, 2008)	(Original Assignee) Thomson Licensing	Method and apparatus for encoding video data, method and apparatus for decoding encoded video data and encoded video signal	▪ spatial domain, spatial domain transform coding ≈ different color, color space ▪ second subdivision, intermediate subdivision ≈ entropy coding, residual data ▪ data stream ≈ different bit ▪ prediction signal ≈ encoding mode	X	X					X	X	X	X		X	X	X
40	US20090238279A1 (Chengjie Tu, 2009)	(Original Assignee) Microsoft Corp (Current Assignee) Microsoft Technology Licensing LLC	Motion-compensated prediction of inter-layer residuals	▪ second maximum region, second maximum region sizes ≈ picture basis ▪ information samples ≈ second sample, first sample	X		X						X	X		X	X	X
41	US20090175333A1 (Shih-Ta Hsiang, 2009)	(Original Assignee) Motorola Solutions Inc (Current Assignee) Google Technology Holdings LLC	Method and apparatus for highly scalable intraframe video coding	▪ syntax elements ≈ syntax element, video coding ▪ data stream ≈ different bit ▪ neighboring subset ≈ pixel value	X	X					X	X	X	X		X	X	X
42	US20080165855A1 (Xianglin Wang, 2008)	(Original Assignee) Nokia Oyj (Current Assignee) Nokia Technologies Oy	inter-layer prediction for extended spatial scalability in video coding	▪ data stream generator ≈ absolute difference ▪ computer program ≈ computer program ▪ second subdivision, first subdivision ≈ same reference, video frame	X			X		X			X			X	X	X	X	X
43	US20090152357A1 (Yiwu Lei, 2009)	(Original Assignee) 3M Innovative Properties Co (Current Assignee) Thales DIS France SA	Document verification using dynamic document identification framework	▪ readable digital storage ≈ electronic information ▪ first traversal order ≈ spectrum image															X	X
44	WO2008071542A1 (Yuwen Wu, 2008)	(Original Assignee) Thomson Licensing	Method and apparatus for encoding and/or decoding video data using adaptive prediction order for spatial and bit depth prediction	▪ transform coding, information samples ≈ inverse transformation ▪ quadtree partitioning, prediction coding ≈ residual information ▪ video information ≈ video information ▪ partition rules ≈ predefined rule ▪ intermediate subdivision ≈ residual data	X		X	X	X				X	X	X	X	X	X
45	CN101395922A (全柄文, 2009)	(Original Assignee) Lg电子株式会社	用于解码/编码视频信号的方法及装置	▪ maximum hierarchy level, first hierarchy level ≈ 水平方向, 包括水平 ▪ video information ≈ 视频信号 ▪ first maximum region size ≈ 一种解码	X		X	X	X	X	X					X	X	X
46	US20090003441A1 (Shunichi Sekiguchi, 2009)	(Original Assignee) Mitsubishi Electric Corp (Current Assignee) Mitsubishi Electric Corp	Image encoding device, image decoding device, image encoding method and image decoding method	▪ first subdivision, first subdivision information ≈ image generating unit ▪ maximum hierarchy, maximum hierarchy level ≈ color component ▪ second maximum region, second maximum region sizes ≈ decoding device ▪ first maximum region ≈ components a	X		X	X	X	X	X		X			X	X	X
47	US20090003448A1 (Shunichi Sekiguchi, 2009)	(Original Assignee) Mitsubishi Electric Corp (Current Assignee) Mitsubishi Electric Corp	Image encoding device, image decoding device, image encoding method and image decoding method	▪ first subdivision, first subdivision information ≈ image generating unit ▪ maximum hierarchy, maximum hierarchy level ≈ color component ▪ second maximum region, second maximum region sizes ≈ decoding device ▪ first maximum region ≈ components a	X		X	X	X	X	X		X			X	X	X
48	US20080095238A1 (Hsi-Jung Wu, 2008)	(Original Assignee) Apple Inc (Current Assignee) Apple Inc	Scalable video coding with filtering of lower layers	▪ transform coding ≈ deblocking filtering ▪ second subdivision, second subset ≈ determined size ▪ data stream, data stream generator ≈ order r	X						X	X	X	X		X	X	X
49	US20080089417A1 (Yiliang Bao, 2008)	(Original Assignee) Qualcomm Inc (Current Assignee) Qualcomm Inc	Video coding with adaptive filtering for motion compensated prediction	▪ information samples using prediction coding, second subdivision ≈ fractional pixel, video block ▪ computer program ≈ computer program ▪ second maximum region ≈ first filter ▪ syntax elements ≈ video coding	X	X		X		X		X	X			X	X	X	X	X
50	WO2009041843A1 (Vsevolod Yurievich Mokrushin, 2009)	(Original Assignee) Vsevolod Yurievich Mokrushin	Method of encoding digital signals (variants), method of decoding digital signals (variants), device for implementation thereof (variants), and system for image transmission via limited throughput communication channels (variants)	▪ order hierarchy level ≈ hierarchical tree structure ▪ first hierarchy level ≈ discrete cosine transform ▪ transform coding, information samples ≈ inverse transformation ▪ second maximum region, second maximum region sizes ≈ decoding device ▪ prediction coding ≈ receiving input ▪ quadtree partitioning, quadtree partitioning technique ≈ coding one ▪ respective partition, maximum hierarchy level ≈ d line	X		X	X			X		X	X	X	X	X	X
51	CN101507280A (奥斯卡·迪沃拉·埃斯科达, 2009)	(Original Assignee) 汤姆逊许可公司	用于降低分辨率划分的方法和装置	▪ rectangular blocks ≈ 至少一个块 ▪ intra-prediction mode, next intra-prediction cycle ≈ 编码标准 ▪ respective root ≈ 中的一个 ▪ intermediate subdivision ≈ 模块进行 ▪ video information ≈ 视频信号 ▪ second maximum region ≈ 种方法 ▪ maximum hierarchy ≈ 连接的 ▪ quadtree partitioning technique ≈ 而能够 ▪ neighboring subset ≈ 一组块	X	X	X	X			X		X		X	X	X	X
52	WO2008027192A2 (Oscar Divorra Escoda, 2008)	(Original Assignee) Thomson Licensing	Methods and apparatus for reduced resolution partitioning	▪ hierarchy level ≈ high level syntax ▪ prediction coding, transform coding ≈ adaptive tree, scan order ▪ syntax elements ≈ video coding ▪ order hierarchy levels ≈ slice level	X			X	X	X	X	X	X	X		X	X	X
53	US20090196517A1 (Oscar Divorra Escoda, 2009)	(Original Assignee) Oscar Divorra Escoda; Peng Yin (Current Assignee) InterDigital VC Holdings Inc	Method and apparatus for reduced resolution partitioning	▪ hierarchy level ≈ high level syntax ▪ prediction coding, transform coding ≈ adaptive tree, scan order ▪ syntax elements ≈ video coding ▪ order hierarchy levels ≈ slice level	X			X	X	X	X	X	X	X		X	X	X
54	US20080049834A1 (Thomas Holcomb, 2008)	(Original Assignee) Microsoft Corp (Current Assignee) Microsoft Technology Licensing LLC	Sub-block transform coding of prediction residuals	▪ rectangular blocks ≈ motion prediction ▪ second subdivision, second subset ≈ video encoder, video frame ▪ intermediate subdivision ≈ residual data	X		X	X		X			X			X	X	X
55	CN101502119A (奥斯卡·迪沃拉·埃斯科达, 2009)	(Original Assignee) 汤姆逊许可公司	用于视频编码的自适应几何分割方法和设备	▪ intra-prediction mode, next intra-prediction cycle ≈ 编码标准 ▪ video information ≈ 视频信号 ▪ second maximum region ≈ 种方法 ▪ quadtree partitioning technique ≈ 的变换	X	X									X	X	X	X
56	CN101502120A (奥斯卡·迪沃拉·埃斯科达, 2009)	(Original Assignee) 汤姆逊许可公司	用于视频解码的自适应几何分割方法和设备	▪ intra-prediction mode, next intra-prediction cycle ≈ 编码标准 ▪ video information ≈ 视频信号 ▪ second maximum region ≈ 种方法 ▪ quadtree partitioning technique ≈ 的变换	X	X									X	X	X	X
57	US20090196342A1 (Oscar Divorra Escoda, 2009)	(Original Assignee) Oscar Divorra Escoda; Peng Yin (Current Assignee) Thomson Licensing DTV SAS	Adaptive Geometric Partitioning For Video Encoding	▪ prediction coding ≈ spatial neighboring block ▪ transform coding ≈ deblocking filtering ▪ partition rule ≈ different partitions ▪ quadtree partitioning ≈ based partitioning ▪ hierarchy level ≈ high level syntax ▪ spatial domain transform coding ≈ different context ▪ syntax elements ≈ syntax element, video coding ▪ respective partition, maximum hierarchy level ≈ d line	X		X	X	X	X	X	X	X	X	X	X	X	X
58	CN101106711A (李云松, 2008)	(Original Assignee) 西安电子科技大学	基于码率预分配的jpeg2000自适应率控制系统及方法	▪ intermediate subdivision ≈ 模块进行 ▪ first traversal order ≈ 已经编码									X
59	US20080298694A1 (Yong-Hwan Kim, 2008)	(Original Assignee) Korea Electronics Technology Institute (Current Assignee) Korea Electronics Technology Institute	Method for Coding RGB Color Space Signal	▪ first hierarchy level ≈ discrete cosine transform ▪ quadtree partitioning, prediction coding ≈ residual information, coding one ▪ rectangular blocks ≈ reference index ▪ spatial domain, transform coding ≈ color space ▪ second maximum region size ≈ low pass	X		X	X						X	X	X	X	X
60	JP2008311781A (Chunsen Bun, 2008)	(Original Assignee) Ntt Docomo Inc; 株式会社エヌ・ティ・ティ・ドコモ	動画像符号化装置、動画像復号化装置、動画像符号化方法、動画像復号化方法、動画像符号化プログラム及び動画像復号化プログラム	▪ first traversal order ≈ 画像符号化方法 ▪ maximum hierarchy ≈ 復元ステップ ▪ maximum hierarchy level ≈ フレーム ▪ syntax elements ≈ か一方	X			X			X	X	X			X	X	X
61	US20070248274A1 (Senthil Govindaswamy, 2007)	(Original Assignee) Qualcomm Inc (Current Assignee) Qualcomm Inc	Systems and methods using parameter selection in data compression and decompression	▪ computer program ≈ computer program ▪ respective partition ≈ sound system				X											X	X
62	CN101018333A (张兆扬, 2007)	(Original Assignee) 上海大学; 上海广电（集团）有限公司中央研究院	空域可分级信噪比精细可分级视频编码方法	▪ quadtree partitioning ≈ 纹理信息 ▪ maximum hierarchy level, first hierarchy level ≈ 一比特	X			X	X	X	X				X	X	X	X
63	CN101366283A (鲍易亮, 2009)	(Original Assignee) 高通股份有限公司	具有精细粒度空间可缩放性的视频编码	▪ video information ≈ 一种视频编码方法 ▪ prediction signal ≈ 第一预测块 ▪ second maximum region ≈ 种方法	X	X										X	X	X
64	CN101385351A (全柄文, 2009)	(Original Assignee) Lg电子株式会社	用于视频信号的层间预测方法	▪ maximum hierarchy level, first hierarchy level ≈ 水平方向 ▪ respective root ≈ 中的一个 ▪ respective partition ≈ 不同画面 ▪ video information ≈ 视频信号	X			X	X	X	X					X	X	X
65	US20090225846A1 (Edouard Francois, 2009)	(Original Assignee) Edouard Francois; Vincent Bottreau; Patrick Lopez; Vieron Jerome; Ying Chen	Inter-Layer Motion Prediction Method	▪ information samples using prediction coding ≈ low resolution image ▪ second set ≈ following steps ▪ second maximum region sizes ≈ same dimensions ▪ second subdivision, second subset ≈ video encoder ▪ syntax elements ≈ video coding ▪ data stream ≈ data stream ▪ rectangular blocks ≈ frame mode	X	X	X				X	X	X	X		X	X	X
66	US20070230574A1 (Stephane Valente, 2007)	(Original Assignee) Koninklijke Philips NV (Current Assignee) Entropic Communications LLC	Method and Device for Encoding Digital Video Data	▪ second set ≈ following steps ▪ root region ≈ said method	X	X		X				X				X	X	X
67	US20070115154A1 (In-cheol Park, 2007)	(Original Assignee) Samsung Electronics Co Ltd (Current Assignee) Samsung Electronics Co Ltd	Method of decoding bin values using pipeline architecture and decoding device therefor	▪ second maximum region size ≈ positive integer ▪ computer program ≈ computer program ▪ data stream ≈ comparing unit ▪ syntax elements ≈ syntax element	X						X	X	X	X		X	X	X	X	X
68	US20070110153A1 (Dae-sung Cho, 2007)	(Original Assignee) Samsung Electronics Co Ltd (Current Assignee) Samsung Electronics Co Ltd	Method, medium, and apparatus encoding and/or decoding an image using the same coding mode across components	▪ prediction coding, transform coding ≈ arithmetic decoding apparatus ▪ prediction signal, syntax elements ≈ processing element ▪ second subdivision, second subset ≈ determined size, block basis ▪ first maximum region ≈ components a	X	X	X					X	X	X		X	X	X
69	CN1976458A (李培根, 2007)	(Original Assignee) 三星电子株式会社	利用层间相关性编码层内标记的方法、及解码方法和设备	▪ respective root, respective root region ≈ 用于从输入 ▪ respective partition ≈ 标记进行 ▪ information samples using prediction coding ≈ 运动预测 ▪ maximum hierarchy level, first hierarchy level ≈ 一比特 ▪ spatial domain ≈ 的设备	X			X	X	X	X					X	X	X
70	CN1960491A (刘志, 2007)	(Original Assignee) 上海大学	基于h.264压缩域运动对象实时分割方法	▪ prediction coding, prediction signal ≈ 运动矢量之差, 的匹配 ▪ order hierarchy levels using respective partition rules ≈ 进行对象	X	X										X	X	X
71	US20070005795A1 (Ruben Gonzalez, 2007)	(Original Assignee) Activesky Inc (Current Assignee) Activesky Inc	Object oriented video system	▪ second subdivision, second set ≈ unique identifiers, video encoder ▪ root regions ≈ compressed media ▪ prediction signal ≈ respective video ▪ computer program ≈ computer program ▪ video information ≈ generated image ▪ prediction coding ≈ receiving input ▪ data stream ≈ bit streams ▪ partition rule ≈ coding data ▪ partition rules ≈ one object ▪ intra-prediction mode ≈ low power	X	X	X	X	X	X	X	X	X	X		X	X	X	X	X
72	US20070160133A1 (Yiliang Bao, 2007)	(Original Assignee) Qualcomm Inc (Current Assignee) Qualcomm Inc	Video coding with fine granularity spatial scalability	▪ syntax elements ≈ syntax element, video coding ▪ first subdivision ≈ default value ▪ quadtree partitioning, quadtree partitioning technique ≈ coding one ▪ transform coding ≈ code one	X			X		X		X	X	X	X	X	X	X
73	US20080086545A1 (Gary P. Fatt, 2008)	(Original Assignee) Motorola Solutions Inc (Current Assignee) Motorola Solutions Inc	Network configuration using configuration parameter inheritance	▪ data stream ≈ computer readable medium ▪ spatial domain transform coding ≈ user interface ▪ first subdivision, first subdivision information ≈ one second ▪ second set ≈ second set ▪ first set ≈ first set	X	X	X	X		X	X	X	X	X		X	X	X
74	US20100014590A1 (Peter Lionel Smith, 2010)	(Original Assignee) Electrosonic Ltd (Current Assignee) RGB Systems Inc	Image data processing	▪ maximum hierarchy, quadtree partitioning ≈ subsequent transformations, tree structure ▪ second subdivision information ≈ respective data ▪ first maximum region size ≈ repeating step ▪ data stream, data stream generator ≈ equal length, data stream	X		X	X	X	X	X	X	X	X	X	X	X	X
75	US20060268988A1 (Shijun Sun, 2006)	(Original Assignee) Shijun Sun; Shawmin Lei; Hiroyuki Katata (Current Assignee) Dolby Laboratories Licensing Corp	Adaptive filtering based upon boundary strength	▪ second subdivision ≈ same reference ▪ root region ≈ said method	X			X								X	X	X
76	US20070018994A1 (Masahiro Sekine, 2007)	(Original Assignee) Toshiba Corp (Current Assignee) Toshiba Corp	Texture encoding apparatus, texture decoding apparatus, method, and program	▪ data stream ≈ computer readable medium ▪ transform coding ≈ macro block	X						X	X	X	X		X	X	X
77	US20070053441A1 (Xianglin Wang, 2007)	(Original Assignee) Nokia Oyj (Current Assignee) Nokia Oyj	Method and apparatus for update step in video coding using motion compensated temporal filtering	▪ second set ≈ bitstream representative ▪ prediction signal ≈ adjacent blocks ▪ program code ≈ program code ▪ root region ≈ said method ▪ readable digital storage ≈ said video	X	X		X				X				X	X	X	X	X
78	US20070086516A1 (Bae-keun Lee, 2007)	(Original Assignee) Samsung Electronics Co Ltd (Current Assignee) Samsung Electronics Co Ltd	Method of encoding flags in layer using inter-layer correlation, method and apparatus for decoding coded flags	▪ rectangular blocks ≈ motion prediction ▪ data stream ≈ entropy decoding ▪ second subdivision, intermediate subdivision ≈ entropy coding ▪ root regions ≈ R values	X		X	X		X	X	X	X	X		X	X	X
79	CN101047733A (唐志雄, 2007)	(Original Assignee) 华为技术有限公司	短信处理方法以及装置	▪ intermediate subdivision ≈ 模块进行 ▪ second subset ≈ 进行读									X
80	US20060215919A1 (Sridhar Srinivasan, 2006)	(Original Assignee) Microsoft Corp (Current Assignee) Microsoft Technology Licensing LLC	Spatial extrapolation of pixel values in intraframe video coding and decoding	▪ first maximum region ≈ causal neighborhood ▪ first subdivision, second subdivision ≈ processing blocks, video frame ▪ data stream ≈ entropy decoding ▪ neighboring subset ≈ pixel value	X	X	X	X		X	X	X	X	X		X	X	X
81	US20090080535A1 (Peng Yin, 2009)	(Original Assignee) Thomson Licensing SAS (Current Assignee) Thomson Licensing SAS	Method and apparatus for weighted prediction for scalable video coding	▪ syntax elements, prediction coding ≈ picture order count, same slice ▪ second subdivision information ≈ block basis	X							X	X			X	X	X
82	CN101189641A (I·戈里, 2008)	(Original Assignee) 布雷克成像有限公司	编码数字图像的像素或体素的方法及处理数字图像的方法	▪ intra-prediction mode, next intra-prediction cycle ≈ 来确定的 ▪ first subdivision information ≈ 相对位置 ▪ second subdivision, first subdivision ≈ 的权重 ▪ first hierarchy level, hierarchy level ≈ 以确定 ▪ maximum hierarchy ≈ 连接的 ▪ first subset ≈ 的滤波 ▪ quadtree partitioning technique ≈ 的变换	X	X		X	X	X	X		X		X	X	X	X
83	CN1917647A (李培根, 2007)	(Original Assignee) 三星电子株式会社	自适应地选择用于熵编码的上下文模型的方法和设备	▪ first subdivision, first subdivision information ≈ 解码残差 ▪ intra-prediction mode, next intra-prediction cycle ≈ 使用根据 ▪ video information ≈ 视频信号 ▪ information samples using prediction coding ≈ 该编码器	X	X		X		X			X			X	X	X
84	US20060233251A1 (Wooshik Kim, 2006)	(Original Assignee) Samsung Electronics Co Ltd (Current Assignee) Samsung Electronics Co Ltd	Moving picture coding/decoding method and apparatus	▪ computer program ≈ readable recording medium, computer program ▪ first subdivision information ≈ prediction direction ▪ intra-prediction mode, prediction coding ≈ prediction modes ▪ quadtree partitioning, quadtree partitioning technique ≈ prediction unit ▪ first maximum region ≈ components a	X	X	X	X		X			X		X	X	X	X	X	X
85	US20060233254A1 (Bae-keun Lee, 2006)	(Original Assignee) Samsung Electronics Co Ltd (Current Assignee) Samsung Electronics Co Ltd	Method and apparatus for adaptively selecting context model for entropy coding	▪ prediction coding ≈ coded block pattern ▪ data stream ≈ entropy decoding ▪ second subdivision, intermediate subdivision ≈ entropy coding, video encoder	X						X	X	X	X		X	X	X
86	CN101416399A (D·Y·帕夫洛夫, 2009)	(Original Assignee) 英特尔公司	用于执行分层解码的分层解码器和方法	▪ first maximum region size ≈ 一种解码 ▪ maximum hierarchy ≈ 以便允许 ▪ spatial domain, spatial domain transform coding ≈ 将存储	X		X	X			X					X	X	X	X	X
87	US20090037791A1 (Dmitri Yurievich Pavlov, 2009)	(Original Assignee) Intel Corp (Current Assignee) Intel Corp	Layered decoder and method for performing layered decoding	▪ respective partition, respective partition rules ≈ data storage system ▪ syntax elements ≈ storage element ▪ second set ≈ current data ▪ data stream ≈ parity check ▪ second subdivision information ≈ code blocks	X	X		X	X		X	X	X	X		X	X	X
88	US20060262216A1 (Jiefu Zhai, 2006)	(Original Assignee) Jiefu Zhai; Ying Chen (Current Assignee) InterDigital Madison Patent Holdings Inc	Method and apparatus for encoding video pictures, and method and apparatus for decoding video pictures	▪ quadtree partitioning, prediction coding ≈ residual information ▪ video information ≈ second video data	X										X	X	X	X
89	US20070237224A1 (Rathish Krishnan, 2007)	(Original Assignee) Sony Corp; Sony Electronics Inc (Current Assignee) Sony Corp ; Sony Electronics Inc	Method of reducing computations in intra-prediction and mode decision processes in a digital video encoder	▪ intra-prediction mode, next intra-prediction cycle ≈ intra-prediction mode ▪ first subdivision ≈ plane prediction	X	X	X	X		X			X			X	X	X
90	US20060198444A1 (Takahisa Wada, 2006)	(Original Assignee) Toshiba Corp (Current Assignee) Toshiba Corp	Moving picture processor, method for processing a moving picture, and computer program product for executing an application for a moving picture processor	▪ computer program ≈ computer program ▪ first maximum region size, root region ≈ second minimum, first minimum	X		X	X								X	X	X	X	X
91	CN101213840A (热罗姆·维耶龙, 2008)	(Original Assignee) 汤姆森许可贸易公司	从低分辨率图像导出高分辨率图像的编码信息的方法以及实现该方法的编码和解码设备	▪ maximum hierarchy level, first hierarchy level ≈ 水平方向 ▪ first traversal ≈ 一部分和 ▪ data stream ≈ 数据流中 ▪ video information ≈ 视频信号 ▪ spatial domain transform coding ≈ 为单个数 ▪ second subdivision ≈ 第二编 ▪ spatial domain ≈ 的设备 ▪ quadtree partitioning ≈ 块尺寸	X			X	X	X	X	X	X	X	X	X	X	X
92	US20090028245A1 (Jerome Vieron, 2009)	(Original Assignee) THOMAS LICENSING (Current Assignee) THOMAS LICENSING ; Thomson Licensing DTV SAS	Method for Deriving Coding Information for High Resolution Pictures from Low Resolution Pictures and Coding and Decoding Devices Implementing Said Method	▪ information samples using prediction coding ≈ low resolution image ▪ order hierarchy level ≈ following equations, said first part ▪ second set ≈ following steps ▪ rectangular blocks ≈ reference index ▪ second subdivision, second subset ≈ video encoder ▪ data stream ≈ data stream ▪ root region ≈ said method	X	X	X	X			X	X	X	X		X	X	X
93	US20080267291A1 (Jerome Vieron, 2008)	(Original Assignee) Joseph J Laks Thomson Licensing LLC (Current Assignee) Joseph J Laks Thomson Licensing LLC	Method for Deriving Coding Information for High Resolution Images from Low Resolution Images and Coding and Decoding Devices Implementing Said Method	▪ order hierarchy level ≈ following equations, said first part ▪ second set ≈ following steps ▪ rectangular blocks ≈ reference index ▪ data stream ≈ data stream ▪ root region ≈ said method ▪ first subdivision ≈ one image	X	X	X	X		X	X	X	X	X		X	X	X
94	US20060209959A1 (Shijun Sun, 2006)	(Original Assignee) Sharp Laboratories of America Inc (Current Assignee) Dolby Laboratories Licensing Corp	Methods and systems for extended spatial scalability with picture-level adaptation	▪ order hierarchy level ≈ following equations ▪ root region ≈ said method	X			X								X	X	X
95	US20060126955A1 (Sridhar Srinivasan, 2006)	(Original Assignee) Microsoft Corp (Current Assignee) Microsoft Technology Licensing LLC	Spatial extrapolation of pixel values in intraframe video coding and decoding	▪ first hierarchy level ≈ discrete cosine transform ▪ spatial domain ≈ frequency transform ▪ second subdivision, first subdivision ≈ video frame ▪ video information ≈ first count	X			X		X			X			X	X	X
96	US20060153295A1 (Xianglin Wang, 2006)	(Original Assignee) Nokia Oyj (Current Assignee) Nokia Oyj	Method and system for inter-layer prediction mode coding in scalable video coding	▪ prediction coding ≈ coded block pattern ▪ second subdivision, second subset ≈ video encoder ▪ syntax elements ≈ video coding ▪ program code ≈ program code ▪ root region ≈ said method	X			X				X	X			X	X	X	X	X
97	US20060153300A1 (Xianglin Wang, 2006)	(Original Assignee) Nokia Oyj (Current Assignee) Nokia Oyj	Method and system for motion vector prediction in scalable video coding	▪ data stream generator ≈ first difference ▪ second subdivision, first subdivision ≈ same reference, video frame ▪ syntax elements ≈ video coding ▪ program code ≈ program code ▪ root region ≈ said method	X			X		X		X	X			X	X	X	X	X
98	US20060089832A1 (Juha Ojanpera, 2006)	(Original Assignee) Juha Ojanpera (Current Assignee) Provenance Asset Group LLC ; Nokia USA Inc	Method for improving the coding efficiency of an audio signal	▪ respective partition ≈ error information ▪ computer program ≈ computer program				X											X	X
99	US20060120448A1 (Woo-jin Han, 2006)	(Original Assignee) Samsung Electronics Co Ltd (Current Assignee) Samsung Electronics Co Ltd	Method and apparatus for encoding/decoding multi-layer video using DCT upsampling	▪ first hierarchy level ≈ discrete cosine transform ▪ second subdivision, second subset ≈ determined size, video encoder	X			X					X			X	X	X
100	US20060120454A1 (Seung Park, 2006)	(Original Assignee) LG Electronics Inc (Current Assignee) LG Electronics Inc	Method and apparatus for encoding/decoding video signal using motion vectors of pictures in base layer	▪ spatial domain transform coding ≈ recording information ▪ second subdivision, first subdivision ≈ video frame ▪ neighboring subset ≈ pixel value	X	X		X		X			X			X	X	X
101	EP1696674A2 (So-Young Kim, 2006)	(Original Assignee) Samsung Electronics Co Ltd (Current Assignee) Samsung Electronics Co Ltd	Color image encoding and decoding method and apparatus using a correlation between chrominance components	▪ data stream generator ≈ absolute difference ▪ rectangular blocks ≈ motion prediction ▪ first subdivision, first subdivision information ≈ determined order ▪ data stream ≈ entropy decoding ▪ computer program ≈ computer program ▪ second subdivision, second subset ≈ determined size, entropy coding ▪ first maximum region ≈ components a	X		X	X		X	X	X	X	X		X	X	X	X	X
102	US20090147866A1 (Xiaoming She, 2009)	(Original Assignee) Panasonic Corp (Current Assignee) INVT SPE LLC	Communication apparatus, communication system, and communication method	▪ information samples using prediction coding ≈ estimation result ▪ video information, information samples ≈ determined time ▪ second subdivision information ≈ frequency axis ▪ first subdivision information ≈ time domain ▪ partition rule ≈ coding data	X		X	X		X			X	X		X	X	X
103	US20090304090A1 (Giovanni Cordara, 2009)	(Original Assignee) Telecom Italia SpA (Current Assignee) Telecom Italia SpA	Method for Scalable Video Coding	▪ computer program ≈ computer program ▪ second set ≈ following steps ▪ next intra-prediction cycle ≈ comprising two ▪ syntax elements ≈ video coding	X	X						X	X			X	X	X	X	X
104	CN1728833A (金海光, 2006)	(Original Assignee) 学校法人大洋学园; 三星电子株式会社	用于可伸缩编码和解码彩色视频的方法和设备	▪ second set ≈ 在其上记录 ▪ quadtree partitioning ≈ 纹理信息 ▪ first maximum region size ≈ 一种解码 ▪ spatial domain ≈ 的设备	X	X	X					X			X	X	X	X
105	US20060013308A1 (Hae-Kwang Kim, 2006)	(Original Assignee) Samsung Electronics Co Ltd; Sejong University Industry-Academy Cooperation Group (Current Assignee) Samsung Electronics Co Ltd ; Sejong University Industry-Academy Cooperation Group	Method and apparatus for scalably encoding and decoding color video	▪ data stream ≈ chrominance components ▪ first maximum region ≈ components a	X		X				X	X	X	X		X	X	X
106	US20060002474A1 (Oscar Chi-Lim Au, 2006)	(Original Assignee) Hong Kong University of Science and Technology HKUST (Current Assignee) Hong Kong University of Science and Technology HKUST	Efficient multi-block motion estimation for video compression	▪ data stream generator ≈ absolute difference ▪ root region ≈ said method	X			X								X	X	X
107	CN1957617A (S·瓦伦特, 2007)	(Original Assignee) 皇家飞利浦电子股份有限公司	用于编码数字视频数据的方法和设备	▪ spatial domain transform coding ≈ 一种编码设备 ▪ data stream ≈ 多个参考	X						X	X	X	X		X	X	X
108	CN1691087A (阿尔佛雷德·V·阿拉西亚, 2005)	(Original Assignee) 图形安全系统公司	用于解码数字编码图像的系统和方法	▪ respective root ≈ 中的一个 ▪ quadtree partitioning technique ≈ 辅助图像 ▪ respective partition, respective partition rules ≈ 服务器 ▪ second subdivision ≈ 第二编	X			X							X	X	X	X
109	US20060233262A1 (Justin Ridge, 2006)	(Original Assignee) Nokia Oyj (Current Assignee) Nokia Oyj	Signaling of bit stream ordering in scalable video coding	▪ computer program ≈ computer program ▪ maximum hierarchy, maximum hierarchy level ≈ color component ▪ syntax elements ≈ syntax element	X			X	X	X	X	X	X			X	X	X	X	X
110	KR20060079051A (김소영, 2006)	(Original Assignee) 삼성전자주식회사	색차 성분의 상관관계를 이용한 컬러 영상의 부호화,복호화 방법 및 그 장치	▪ spatial domain transform coding ≈ 선택부를 ▪ second maximum region size ≈ 역변환부 ▪ equal size ≈ 성분은	X				X							X	X	X
111	US20050286759A1 (Charles Zitnick, 2005)	(Original Assignee) Microsoft Corp (Current Assignee) Microsoft Technology Licensing LLC	Interactive viewpoint video system and process employing overlapping images of a scene captured from viewpoints forming a grid	▪ computer program ≈ computer program ▪ data stream, data stream generator ≈ video streams ▪ first traversal ≈ more gene	X						X	X	X	X		X	X	X	X	X
112	US20060083309A1 (Heiko Schwarz, 2006)	(Original Assignee) Fraunhofer Gesellschaft zur Forderung der Angewandten Forschung eV (Current Assignee) Fraunhofer Gesellschaft zur Forderung der Angewandten Forschung eV	Apparatus and method for generating a coded video sequence by using an intermediate layer motion data prediction	▪ transform coding ≈ first quantization parameter ▪ data stream ≈ computer readable medium ▪ spatial domain ≈ coded video sequence ▪ prediction signal ≈ prediction signal ▪ computer program ≈ computer program ▪ first set ≈ cost function	X	X	X	X		X	X	X	X	X		X	X	X	X	X
113	CN1717047A (朴晟俊, 2006)	(Original Assignee) Lg电子株式会社	用于运动图像数据流业务的数据流文件、方法和系统	▪ next intra-prediction cycle ≈ 预定周期, 时间周期 ▪ respective partition, respective partition rules ≈ 服务器		X		X
114	CN1780278A (佘小明, 2006)	(Original Assignee) 松下电器产业株式会社	子载波通信系统中自适应调制与编码方法和设备	▪ quadtree partitioning technique ≈ 参数选择 ▪ intermediate subdivision ≈ 子步骤									X		X
115	US20050114093A1 (Sang-Chang Cha, 2005)	(Original Assignee) Samsung Electronics Co Ltd (Current Assignee) Samsung Electronics Co Ltd	Method and apparatus for motion estimation using variable block size of hierarchy structure	▪ first hierarchy ≈ lower hierarchy ▪ prediction signal ≈ adjacent blocks		X		X
116	CN1589022A (苑泽生, 2005)	(Original Assignee) 中芯联合（北京）微电子有限公司	多模式运动估计中由朝向树决定的宏块分割模式选择方法	▪ maximum hierarchy level, first hierarchy level ≈ 水平方向, 一水平 ▪ data stream ≈ 多个参考 ▪ video information ≈ 视频信号 ▪ maximum hierarchy ≈ 在权利 ▪ prediction signal ≈ 余预测	X	X		X	X	X	X	X	X	X		X	X	X
117	US20050213655A1 (Dominique Thoreau, 2005)	(Original Assignee) Thomson Licensing SAS (Current Assignee) InterDigital Madison Patent Holdings Inc	Device and method for compressing digital images	▪ first hierarchy level ≈ discrete cosine transform ▪ maximum hierarchy level, hierarchy level ≈ square root ▪ partition rules ≈ linear form	X			X	X	X	X					X	X	X
118	EP1507415A2 (Dae-Sung Cho, 2005)	(Original Assignee) Samsung Electronics Co Ltd (Current Assignee) Samsung Electronics Co Ltd	Video encoding/decoding apparatus and method for color image	▪ first hierarchy level ≈ discrete cosine transform ▪ prediction coding ≈ coded block pattern ▪ first subdivision ≈ plane prediction ▪ data stream ≈ entropy decoding ▪ computer program ≈ computer program ▪ quadtree partitioning, quadtree partitioning technique ≈ prediction unit ▪ second subdivision, second subset ≈ video encoder ▪ prediction signal ≈ encoding mode ▪ intra-prediction mode ≈ tap length	X	X		X		X	X	X	X	X	X	X	X	X	X	X
119	JP2005039841A (Daisei Cho, 2005)	(Original Assignee) Samsung Electronics Co Ltd; 三星電子株式会社	カラー平面間予測を利用した無損失映像符号化／復号化方法及び装置	▪ equal size ≈ 所定サイズ ▪ maximum hierarchy level, order hierarchy level ≈ ＲＧＢ	X			X	X		X					X	X	X
120	JP2005039842A (Daisei Cho, 2005)	(Original Assignee) Samsung Electronics Co Ltd; 三星電子株式会社	カラー映像のためのビデオ符号化／復号化装置およびその方法	▪ recursive multi- tree partitioning ≈ 前記フィルタリング ▪ spatial domain, spatial domain transform coding ≈ 離散コサイン変換 ▪ first set, first hierarchy level ≈ うち所定 ▪ second subdivision ≈ 行うこと ▪ maximum hierarchy level ≈ フレーム ▪ video information ≈ 選択部	X	X	X	X		X	X		X			X	X	X
121	US20050013370A1 (Woo-shik Kim, 2005)	(Original Assignee) Samsung Electronics Co Ltd (Current Assignee) Samsung Electronics Co Ltd	Lossless image encoding/decoding method and apparatus using inter-color plane prediction	▪ data stream ≈ computer readable medium ▪ first subdivision information ≈ prediction direction, first generating ▪ rectangular blocks ≈ motion prediction ▪ second subdivision, second subset ≈ determined size ▪ spatial domain, spatial domain transform coding ≈ different color ▪ quadtree partitioning, quadtree partitioning technique ≈ prediction unit ▪ prediction signal ≈ encoding mode ▪ video information ≈ second line	X	X	X	X		X	X	X	X	X	X	X	X	X
122	CN1595990A (赵海武, 2005)	(Original Assignee) 上海广电（集团）有限公司中央研究院	基于图像切片结构的帧场自适应编码方法	▪ intermediate subdivision ≈ 的一个作为 ▪ respective root ≈ 中的一个 ▪ first maximum region ≈ 的整数	X		X						X			X	X	X
123	US20090103602A1 (Yi Xiong, 2009)	(Original Assignee) Digital Accelerator Corp (Current Assignee) ETIIP HOLDINGS Inc ; Digital Accelerator Corp	Overcomplete basis transform-based motion residual frame coding method and apparatus for video compression	▪ data stream ≈ computer readable medium ▪ computer program ≈ computer program ▪ first maximum region size ≈ repeating step ▪ information samples using prediction coding ≈ highest energy ▪ root region ≈ said method	X		X	X			X	X	X	X		X	X	X	X	X
124	WO2004086302A1 (Yi Xiong, 2004)	(Original Assignee) Digital Accelerator Corporation	Overcomplete basis transform-based motion residual frame coding method and apparatus for video compression	▪ data stream ≈ computer readable medium ▪ computer program ≈ computer program ▪ first maximum region size ≈ repeating step ▪ information samples using prediction coding ≈ highest energy ▪ root region ≈ said method	X		X	X			X	X	X	X		X	X	X	X	X
125	US20050200630A1 (Glenn Evans, 2005)	(Original Assignee) Microsoft Corp (Current Assignee) Microsoft Technology Licensing LLC	Image formats for video capture, processing and display	▪ transform coding, spatial domain ≈ chroma component, color space ▪ data stream ≈ different bit ▪ first subdivision, first subdivision information ≈ first unit ▪ second subdivision, second subdivision information ≈ second un	X			X		X	X	X	X	X		X	X	X
126	US20070036215A1 (Feng Pan, 2007)	(Original Assignee) Agency for Science Technology and Research, Singapore (Current Assignee) Agency for Science Technology and Research, Singapore	Fast mode decision algorithm for intra prediction for advanced video coding	▪ data stream ≈ computer readable medium, chrominance components ▪ first subdivision ≈ plane prediction ▪ program code ≈ program code ▪ root region ≈ said method ▪ maximum hierarchy level, hierarchy level ≈ one edge	X			X	X	X	X	X	X	X		X	X	X	X	X
127	CN1549206A (朴仁圭, 2004)	(Original Assignee) 三星电子株式会社; 财团法人索尔大学校产学协力财团	对三维对象数据进行编码和解码的方法及装置	▪ respective partition ≈ 标记进行 ▪ readable digital storage ≈ 结构数据 ▪ partition indication flag ≈ 预测部分				X		X									X	X
128	US20050114298A1 (Wei Fan, 2005)	(Original Assignee) International Business Machines Corp (Current Assignee) SAP SE	System and method for indexing weighted-sequences in large databases	▪ first traversal ≈ first traversal ▪ second set ≈ generate one ▪ first hierarchy ≈ new sequence	X	X		X				X				X	X	X
129	US7254533B1 (Marwan A. Jabri, 2007)	(Original Assignee) Dilithium Networks Pty Ltd (Current Assignee) Onmobile Global Ltd	Method and apparatus for a thin CELP voice codec	▪ prediction coding, spatial domain transform coding ≈ spectral frequency ▪ first set ≈ second function ▪ program code ≈ program code	X	X	X	X		X			X			X	X	X	X	X
130	JP2004129260A (Chang-Yeong Kim, 2004)	(Original Assignee) Samsung Electronics Co Ltd; 三星電子株式会社	色相の空間予測符号化を利用した映像の符号化及び復号化方法及び装置	▪ quadtree partitioning, quadtree partitioning technique ≈ 前記予測モード ▪ equal size ≈ 所定サイズ ▪ video information ≈ 選択部 ▪ program code ≈ 計算部	X				X						X	X	X	X	X	X
131	US20040062445A1 (Woo-shik Kim, 2004)	(Original Assignee) Samsung Electronics Co Ltd (Current Assignee) Samsung Electronics Co Ltd	Image coding method and apparatus using spatial predictive coding of chrominance and image decoding method and apparatus	▪ transform coding ≈ respective prediction ▪ second subdivision, second subset ≈ determined size ▪ program code ≈ program code	X								X	X		X	X	X	X	X
132	CN1637782A (冯前进, 2005)	(Original Assignee) 中国人民解放军第一军医大学	基于小波变换的预测四叉树图像压缩及解压方法	▪ maximum hierarchy level, first hierarchy level ≈ 一比特 ▪ first subdivision information ≈ 动态的 ▪ order hierarchy levels ≈ 第二步	X			X	X	X	X		X			X	X	X
133	CN1672177A (S·戈文达斯瓦米, 2005)	(Original Assignee) 高通股份有限公司	数据压缩和解压缩中的参数选择	▪ intermediate subdivision ≈ 的一个作为 ▪ respective root ≈ 中的一个 ▪ quadtree partitioning technique ≈ 参数选择 ▪ second maximum region ≈ 种方法 ▪ partition indication flag ≈ 一个所	X					X			X		X	X	X	X
134	US20050013376A1 (Doni Dattani, 2005)	(Original Assignee) LSI Corp (Current Assignee) Avago Technologies General IP Singapore Pte Ltd	Intra 4 x 4 modes 3, 7 and 8 availability determination intra estimation and compensation	▪ intra-prediction mode, prediction coding ≈ prediction modes ▪ second set ≈ generate one ▪ partition rule ≈ second group ▪ respective partition, maximum hierarchy level ≈ d line	X	X	X	X			X	X				X	X	X
135	US7154952B2 (Alexandros Tourapis, 2006)	(Original Assignee) Microsoft Corp (Current Assignee) Microsoft Technology Licensing LLC	Timestamp-independent motion vector prediction for predictive (P) and bidirectionally predictive (B) pictures	▪ prediction coding ≈ motion vector predictor ▪ intermediate subdivision ≈ spatially neighboring ▪ first maximum region, first subdivision ≈ weighting function	X		X	X		X			X			X	X	X
136	US20040028049A1 (Ernest Wan, 2004)	(Original Assignee) Canon Inc (Current Assignee) Canon Inc	XML encoding scheme	▪ computer program ≈ computer program ▪ partition rule, partition rules ≈ coding formats, data types ▪ root region ≈ said method	X			X	X	X						X	X	X	X	X
137	US20040194008A1 (Harinath Garudadri, 2004)	(Original Assignee) Qualcomm Inc (Current Assignee) Qualcomm Inc	Method, apparatus, and system for encoding and decoding side information for multimedia transmission	▪ prediction coding, transform coding ≈ reconstructed block ▪ respective partition ≈ error information ▪ intermediate subdivision ≈ residual data	X			X					X	X		X	X	X
138	US20040184662A1 (Kerry Kravec, 2004)	(Original Assignee) International Business Machines Corp (Current Assignee) Facebook Inc	Method and apparatus for performing fast closest match in pattern recognition	▪ first maximum region size ≈ repeating step ▪ root region ≈ first minimum	X		X	X								X	X	X
139	US20030179940A1 (Chih-Lung Lin, 2003)	(Original Assignee) Microsoft Corp (Current Assignee) Microsoft Technology Licensing LLC	Efficient macroblock header coding for video compression	▪ data stream ≈ computer readable medium, video object ▪ prediction coding ≈ coded block pattern ▪ second subdivision, first subdivision ≈ video frame ▪ intra-prediction mode ≈ color value	X	X		X		X	X	X	X	X		X	X	X
140	US20030123545A1 (Adityo Prakash, 2003)	(Original Assignee) Pulsent Corp (Current Assignee) Altera Corp	Segment-based encoding system using segment hierarchies	▪ intra-prediction mode ≈ color value ▪ quadtree partitioning, quadtree partitioning technique ≈ coding one ▪ second set ≈ second set ▪ first set ≈ first set	X	X	X	X		X		X	X		X	X	X	X
141	US20030138150A1 (Sridhar Srinivasan, 2003)	(Original Assignee) Microsoft Corp (Current Assignee) Microsoft Technology Licensing LLC	Spatial extrapolation of pixel values in intraframe video coding and decoding	▪ first hierarchy level ≈ discrete cosine transform ▪ first maximum region ≈ causal neighborhood ▪ first subdivision ≈ processing blocks ▪ data stream ≈ entropy decoding ▪ second subdivision ≈ more context ▪ video information ≈ first count	X		X	X		X	X	X	X	X		X	X	X
142	US20030152146A1 (Chih-Lung Lin, 2003)	(Original Assignee) Microsoft Corp (Current Assignee) Microsoft Technology Licensing LLC	Motion compensation loop with filtering	▪ second subdivision, second subset ≈ video encoder ▪ neighboring subset ≈ pixel value	X	X							X			X	X	X
143	US20030156646A1 (Pohsiang Hsu, 2003)	(Original Assignee) Microsoft Corp (Current Assignee) Microsoft Technology Licensing LLC	Multi-resolution motion estimation and compensation	▪ rectangular blocks ≈ motion prediction ▪ information samples using prediction coding, second subdivision ≈ frame basis, video encoder	X		X						X			X	X	X
144	US20030156648A1 (Thomas Holcomb, 2003)	(Original Assignee) Microsoft Corp (Current Assignee) Microsoft Technology Licensing LLC	Sub-block transform coding of prediction residuals	▪ first traversal ≈ method further comprises selecting ▪ prediction coding, prediction signal ≈ rate-distortion performance ▪ rectangular blocks ≈ motion prediction ▪ spatial domain ≈ spatial domain ▪ second subdivision, second subset ≈ video encoder ▪ first set ≈ cost function ▪ data stream ≈ different bit	X	X	X	X		X	X	X	X	X		X	X	X
145	CN101448162A (S·斯里尼瓦杉, 2009)	(Original Assignee) 微软公司	处理视频图像的方法	▪ partition indication flag ≈ 还包括一个, 信息指示 ▪ neighboring subset ≈ 码模式中选 ▪ respective root ≈ 中的一个 ▪ quadtree partitioning, quadtree partitioning technique ≈ 块信息 ▪ data stream generator ≈ 视频信	X	X				X					X	X	X	X
146	US20050018770A1 (Dirk Adolph, 2005)	(Original Assignee) Thomson Licensing SAS (Current Assignee) Thomson Licensing SAS	Transcoding mpeg bittstreams for adding sub-picture content	▪ information samples ≈ bus interface ▪ readable digital storage ≈ said video	X		X						X	X		X	X	X	X	X
147	JP2004135252A (Kazufumi Sato, 2004)	(Original Assignee) Sony Corp; ソニー株式会社	符号化処理方法、符号化装置及び復号化装置	▪ quadtree partitioning, quadtree partitioning technique ≈ 量子化パラメータ値 ▪ intra-prediction mode ≈ 予測モード ▪ program code ≈ 上記コード ▪ second subdivision ≈ ブロック ▪ video information ≈ データ	X	X									X	X	X	X	X	X
148	US20030021485A1 (Vijayalakshmi Raveendran, 2003)	(Original Assignee) Qualcomm Inc (Current Assignee) Qualcomm Inc	Apparatus and method for encoding digital image data in a lossless manner	▪ first hierarchy level ≈ discrete cosine transform ▪ spatial domain ≈ coding technique ▪ prediction coding ≈ encoding signal ▪ intermediate subdivision ≈ residual data ▪ second subdivision information, information samples using prediction coding ≈ frame basis	X			X					X			X	X	X
149	US20030076881A1 (Kozo Akiyoshi, 2003)	(Original Assignee) Monolith Co Ltd (Current Assignee) Monolith Co Ltd	Method and apparatus for coding and decoding image data	▪ transform coding ≈ independent frames ▪ computer program ≈ computer program ▪ first set ≈ second function ▪ second subdivision information ≈ acquired image ▪ first subdivision ≈ frame region	X	X	X	X		X			X	X		X	X	X	X	X
150	US20030198290A1 (Andrew Millin, 2003)	(Original Assignee) Dynamic Digital Depth Pty Ltd (Current Assignee) DYNAMIC DIGITAL DEPTH RESEARCH Pty Ltd ; Dynamic Digital Depth Pty Ltd	Image encoding system	▪ data stream ≈ chrominance components ▪ root region ≈ said method ▪ respective partition, maximum hierarchy level ≈ d line	X		X	X			X	X	X	X		X	X	X
151	KR20030065606A (양송철, 2003)	(Original Assignee) 양송철	개인 자동독립코드를 이용한 멀티트리구조의 보너스 적립순환 시스템과 그 방법	▪ quadtree partitioning ≈ 트리구조를 ▪ maximum hierarchy ≈ 최상위 ▪ first traversal order ≈ 단계별	X			X			X				X	X	X	X
152	US20030156652A1 (Adrian Wise, 2003)	(Original Assignee) Wise Adrian P.; Sotheran Martin W.; Robbins William P.; Jones Anthony M.; Finch Helen R.; Boyd Kevin J.; Claydon Anthony Peter J. (Current Assignee) Chartoleaux KG LLC	Multistandard video decoder and decompression system for processing encoded bit streams including a video formatter and methods relating thereto	▪ first hierarchy level ≈ discrete cosine transform ▪ video information ≈ second video data, first video data ▪ second set ≈ second set ▪ first set ≈ first set	X	X	X	X		X		X	X			X	X	X
153	US20020009233A1 (Beatrice Pesquet-Popescu, 2002)	(Original Assignee) Koninklijke Philips NV (Current Assignee) Funai Electric Co Ltd	Color encoding and decoding method	▪ first set ≈ respective levels ▪ prediction signal ≈ lowest frequency ▪ second set ≈ following steps ▪ second maximum region size ≈ given number ▪ root region ≈ said method	X	X	X	X								X	X	X
154	US20020181745A1 (Shane Hu, 2002)	(Original Assignee) Micron Technology Inc (Current Assignee) Micron Technology Inc	Multi-modal motion estimation for video sequences	▪ data stream generator ≈ absolute difference ▪ first hierarchy level ≈ higher levels				X									X
155	US20010039487A1 (Richard Hammersley, 2001)	(Original Assignee) Schlumberger Technology Corp (Current Assignee) Schlumberger Technology Corp	Distributed multiresoluton geometry modeling system and method	▪ first hierarchy level, hierarchy level ≈ multiple levels, higher levels ▪ order hierarchy levels ≈ lower level, high level	X			X	X	X	X					X	X	X
156	US20020106019A1 (Navin Chaddha, 2002)	(Original Assignee) Microsoft Corp (Current Assignee) Microsoft Technology Licensing LLC	Method and apparatus for implementing motion detection in video compression	▪ computer program ≈ computer program ▪ hierarchy level, order hierarchy level ≈ binary tree	X			X	X	X	X					X	X	X	X	X
157	US20010004404A1 (Osamu Itokawa, 2001)	(Original Assignee) Canon Inc (Current Assignee) Canon Inc	Image processing apparatus and method, and storage medium therefor	▪ order hierarchy levels ≈ lowest priority ▪ prediction signal ≈ image pickup ▪ program code ≈ program code		X													X	X
158	JP2000350207A (Mi Michael Bi, 2000)	(Original Assignee) Matsushita Electric Ind Co Ltd; 松下電器産業株式会社	低解像度ビデオ復号化のための一般化直交変換方法および装置	▪ data stream generator ≈ ビデオビットストリーム ▪ spatial domain, spatial domain transform coding ≈ 離散コサイン変換, 周波数ドメイン ▪ second subdivision ≈ ブロック ▪ data stream ≈ バッファ ▪ maximum hierarchy level ≈ フレーム, 前記正 ▪ program code ≈ マッピン ▪ first set, second set ≈ アップ	X	X	X	X		X	X	X	X	X		X	X	X	X	X
159	US6408097B1 (Tetsujiro Kondo, 2002)	(Original Assignee) Sony Corp (Current Assignee) Sony Corp	Picture coding apparatus and method thereof	▪ intermediate subdivision ≈ generating step ▪ neighboring subset ≈ pixel value		X							X
160	US6269192B1 (Iraj Sodagar, 2001)	(Original Assignee) Sharp Corp; Sarnoff Corp (Current Assignee) Sharp Corp ; MediaTek Inc	Apparatus and method for multiscale zerotree entropy encoding	▪ prediction coding ≈ probability model ▪ first subdivision ≈ order model ▪ root region ≈ said method	X			X		X			X			X	X	X
161	US6067574A (Hong-Yi Tzeng, 2000)	(Original Assignee) Nokia of America Corp (Current Assignee) Nokia of America Corp	High speed routing using compressed tree process	▪ first subdivision, first subdivision information ≈ determined order ▪ first maximum region size ≈ repeating step ▪ data stream ≈ different bit	X		X	X		X	X	X	X	X		X	X	X	X	X
162	US5809270A (William Philip Robbins, 1998)	(Original Assignee) Discovision Associates (Current Assignee) Coases Investments Bros LLC	Inverse quantizer	▪ first hierarchy level ≈ discrete cosine transform ▪ program code ≈ data word				X											X	X
163	US6057884A (Xuemin Chen, 2000)	(Original Assignee) Arris Technology Inc (Current Assignee) Google Technology Holdings LLC	Temporal and spatial scaleable coding for video object planes	▪ order hierarchy levels ≈ higher priority ▪ data stream ≈ data stream ▪ root region ≈ said method	X			X			X	X	X	X		X	X	X
164	US6005981A (Hak-Leong Ng, 1999)	(Original Assignee) National Semiconductor Corp (Current Assignee) National Semiconductor Corp	Quadtree-structured coding of color images and intra-coded images	▪ spatial domain, spatial domain transform coding ≈ code vectors ▪ first maximum region ≈ components a ▪ second subdivision information ≈ coded blocks	X		X									X	X	X
165	US20100046906A1 (Katsuhiro Kanamori, 2010)	(Original Assignee) Panasonic Corp (Current Assignee) Panasonic Corp	Image Processing Method, Image Recording Method, Image Processing Device and Image File Format	▪ rectangular blocks ≈ filtering process ▪ maximum hierarchy, maximum hierarchy level ≈ color component ▪ first maximum region ≈ components a ▪ respective partition ≈ data record	X		X	X	X	X	X					X	X	X
166	WO2010039731A2 (Peisong Chen, 2010)	(Original Assignee) Qualcomm Incorporated	Video coding with large macroblocks	▪ second subdivision, second subset ≈ video encoder ▪ quadtree partitioning, quadtree partitioning technique ≈ coding one ▪ transform coding ≈ code one	X								X	X	X	X	X	X
167	US20100086030A1 (Peisong Chen, 2010)	(Original Assignee) Qualcomm Inc (Current Assignee) Velos Media LLC	Video coding with large macroblocks	▪ second subdivision, second subset ≈ video encoder ▪ quadtree partitioning, quadtree partitioning technique ≈ coding one ▪ transform coding ≈ code one	X								X	X	X	X	X	X
168	US20100086049A1 (Yan Ye, 2010)	(Original Assignee) Qualcomm Inc (Current Assignee) Qualcomm Inc	Video coding using transforms bigger than 4x4 and 8x8	▪ first hierarchy level ≈ discrete cosine transform ▪ prediction coding ≈ coded block pattern ▪ data stream ≈ entropy decoding ▪ quadtree partitioning, quadtree partitioning technique ≈ prediction unit, partition size ▪ second subdivision, first subdivision ≈ video frame	X			X		X	X	X	X	X	X	X	X	X
169	WO2009158113A2 (Shankar Regunathan, 2009)	(Original Assignee) Microsoft Corporation	Adaptive quantization for enhancement layer video coding	▪ intermediate subdivision ≈ spatially neighboring ▪ transform coding, spatial domain transform coding ≈ digital media data ▪ video information ≈ respective color ▪ second maximum region, second maximum region sizes ≈ picture basis	X								X	X		X	X	X
170	JP2009246972A (Kwang-Pyo Choi, 2009)	(Original Assignee) Samsung Electronics Co Ltd; Sungkyunkwan Univ Foundation For Corporate Collaboration; 三星電子株式会社ＳａｍｓｕｎｇＥｌｅｃｔｒｏｎｉｃｓＣｏ．，Ｌｔｄ．; 成均▲館▼大學校産學協力團	動きベクトル情報の符号化／復号化方法及び装置	▪ intra-prediction mode ≈ 予測モード ▪ maximum hierarchy level ≈ フレーム ▪ data stream, data stream generator ≈ ビット	X	X		X			X	X	X	X		X	X	X
171	WO2009091383A2 (Purvin Bibhas Pandit, 2009)	(Original Assignee) Thomson Licensing	Video and depth coding	▪ hierarchy level ≈ high level syntax ▪ transform coding ≈ chroma component ▪ syntax elements ≈ syntax element	X			X	X	X	X	X	X	X		X	X	X
172	WO2009018277A1 (Manjirnath Chatterjee, 2009)	(Original Assignee) Palm, Inc.	Application management framework for web applications	▪ computer program ≈ computer program ▪ spatial domain transform coding ≈ user interface ▪ first set ≈ more event	X	X	X	X		X			X			X	X	X	X	X
173	US20090262840A1 (Chung-Jr Jan, 2009)	(Original Assignee) Novatek Microelectronics Corp (Current Assignee) Novatek Microelectronics Corp	Synchronization Signal Extraction Device and Related Method	▪ root region ≈ second input terminal ▪ prediction signal ≈ first switch	X	X		X								X	X	X
174	US20090175334A1 (Yan Ye, 2009)	(Original Assignee) Qualcomm Inc (Current Assignee) Qualcomm Inc	Adaptive coding of video block header information	▪ prediction coding, information samples using prediction coding ≈ predicted prediction block ▪ second maximum region, second maximum region sizes ≈ decoding device ▪ quadtree partitioning, quadtree partitioning technique ≈ prediction unit	X										X	X	X	X

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY. 4 (2): 181-194 APR 1994 Publication Year: 1994 OPTIMIZATION AND EFFICIENCY OF AN OBJECT-ORIENTED ANALYSIS-SYNTHESIS CODER Robert Bosch GmbH Hotter
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set (parameter sets) of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set (parameter sets) of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	OPTIMIZATION AND EFFICIENCY OF AN OBJECT-ORIENTED ANALYSIS-SYNTHESIS CODER . In this paper , an object-oriented analysis-synthesis coder is presented the first time in its entity concentrating on an optimal relationship of its components image analysis , image synthesis and parameter coding and on a comparison of its coding efficiency to block-oriented hybrid coding . As block-oriented hybrid coder , the RM8 of the CCITT is used . The presented object-oriented analysis-synthesis coder is based on the source model of moving flexible 2D-objects and encodes arbitrarily shaped objects instead of rectangular blocks . The objects are described by three parameter sets (first set, second set) defining their motion , shape and colour (colour parameters denoting luminance as well as chrominance values of the object surface) . The parameter sets of each object are obtained by image analysis and coded by an object dependent parameter coding . Using the coded parameter sets , an image can be reconstructed by model-based image synthesis . Experimental results show that transmitting shape information and allowing small position errors (geometrical distortions) avoid the mosquito and blocking artefacts of a block-oriented coder . Furthermore , important image areas such as facial areas can be reconstructed with an image quality improvement up to 4 dB using the image analysis . As a whole , the reconstructed image of an object-oriented analysis-synthesis coder appears sharper compared to block-oriented hybrid coding .
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set (parameter sets) of sub-regions : compute a prediction signal based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset of the second set (parameter sets) of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	OPTIMIZATION AND EFFICIENCY OF AN OBJECT-ORIENTED ANALYSIS-SYNTHESIS CODER . In this paper , an object-oriented analysis-synthesis coder is presented the first time in its entity concentrating on an optimal relationship of its components image analysis , image synthesis and parameter coding and on a comparison of its coding efficiency to block-oriented hybrid coding . As block-oriented hybrid coder , the RM8 of the CCITT is used . The presented object-oriented analysis-synthesis coder is based on the source model of moving flexible 2D-objects and encodes arbitrarily shaped objects instead of rectangular blocks . The objects are described by three parameter sets (first set, second set) defining their motion , shape and colour (colour parameters denoting luminance as well as chrominance values of the object surface) . The parameter sets of each object are obtained by image analysis and coded by an object dependent parameter coding . Using the coded parameter sets , an image can be reconstructed by model-based image synthesis . Experimental results show that transmitting shape information and allowing small position errors (geometrical distortions) avoid the mosquito and blocking artefacts of a block-oriented coder . Furthermore , important image areas such as facial areas can be reconstructed with an image quality improvement up to 4 dB using the image analysis . As a whole , the reconstructed image of an object-oriented analysis-synthesis coder appears sharper compared to block-oriented hybrid coding .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set (parameter sets) of root regions such that the first set of root regions are rectangular blocks (rectangular blocks) of a size determined by the first maximum region size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	OPTIMIZATION AND EFFICIENCY OF AN OBJECT-ORIENTED ANALYSIS-SYNTHESIS CODER . In this paper , an object-oriented analysis-synthesis coder is presented the first time in its entity concentrating on an optimal relationship of its components image analysis , image synthesis and parameter coding and on a comparison of its coding efficiency to block-oriented hybrid coding . As block-oriented hybrid coder , the RM8 of the CCITT is used . The presented object-oriented analysis-synthesis coder is based on the source model of moving flexible 2D-objects and encodes arbitrarily shaped objects instead of rectangular blocks (rectangular blocks) . The objects are described by three parameter sets (first set, second set) defining their motion , shape and colour (colour parameters denoting luminance as well as chrominance values of the object surface) . The parameter sets of each object are obtained by image analysis and coded by an object dependent parameter coding . Using the coded parameter sets , an image can be reconstructed by model-based image synthesis . Experimental results show that transmitting shape information and allowing small position errors (geometrical distortions) avoid the mosquito and blocking artefacts of a block-oriented coder . Furthermore , important image areas such as facial areas can be reconstructed with an image quality improvement up to 4 dB using the image analysis . As a whole , the reconstructed image of an object-oriented analysis-synthesis coder appears sharper compared to block-oriented hybrid coding .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set (parameter sets) of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	OPTIMIZATION AND EFFICIENCY OF AN OBJECT-ORIENTED ANALYSIS-SYNTHESIS CODER . In this paper , an object-oriented analysis-synthesis coder is presented the first time in its entity concentrating on an optimal relationship of its components image analysis , image synthesis and parameter coding and on a comparison of its coding efficiency to block-oriented hybrid coding . As block-oriented hybrid coder , the RM8 of the CCITT is used . The presented object-oriented analysis-synthesis coder is based on the source model of moving flexible 2D-objects and encodes arbitrarily shaped objects instead of rectangular blocks . The objects are described by three parameter sets (first set, second set) defining their motion , shape and colour (colour parameters denoting luminance as well as chrominance values of the object surface) . The parameter sets of each object are obtained by image analysis and coded by an object dependent parameter coding . Using the coded parameter sets , an image can be reconstructed by model-based image synthesis . Experimental results show that transmitting shape information and allowing small position errors (geometrical distortions) avoid the mosquito and blocking artefacts of a block-oriented coder . Furthermore , important image areas such as facial areas can be reconstructed with an image quality improvement up to 4 dB using the image analysis . As a whole , the reconstructed image of an object-oriented analysis-synthesis coder appears sharper compared to block-oriented hybrid coding .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision information includes a partition indication flag indicating whether any of the first set (parameter sets) of root regions or the sub-regions at the first or higher-order hierarchy level is sub-divided .	OPTIMIZATION AND EFFICIENCY OF AN OBJECT-ORIENTED ANALYSIS-SYNTHESIS CODER . In this paper , an object-oriented analysis-synthesis coder is presented the first time in its entity concentrating on an optimal relationship of its components image analysis , image synthesis and parameter coding and on a comparison of its coding efficiency to block-oriented hybrid coding . As block-oriented hybrid coder , the RM8 of the CCITT is used . The presented object-oriented analysis-synthesis coder is based on the source model of moving flexible 2D-objects and encodes arbitrarily shaped objects instead of rectangular blocks . The objects are described by three parameter sets (first set, second set) defining their motion , shape and colour (colour parameters denoting luminance as well as chrominance values of the object surface) . The parameter sets of each object are obtained by image analysis and coded by an object dependent parameter coding . Using the coded parameter sets , an image can be reconstructed by model-based image synthesis . Experimental results show that transmitting shape information and allowing small position errors (geometrical distortions) avoid the mosquito and blocking artefacts of a block-oriented coder . Furthermore , important image areas such as facial areas can be reconstructed with an image quality improvement up to 4 dB using the image analysis . As a whole , the reconstructed image of an object-oriented analysis-synthesis coder appears sharper compared to block-oriented hybrid coding .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements associated with the first or second set (parameter sets) of sub-regions from the data stream in a depth-first traversal order .	OPTIMIZATION AND EFFICIENCY OF AN OBJECT-ORIENTED ANALYSIS-SYNTHESIS CODER . In this paper , an object-oriented analysis-synthesis coder is presented the first time in its entity concentrating on an optimal relationship of its components image analysis , image synthesis and parameter coding and on a comparison of its coding efficiency to block-oriented hybrid coding . As block-oriented hybrid coder , the RM8 of the CCITT is used . The presented object-oriented analysis-synthesis coder is based on the source model of moving flexible 2D-objects and encodes arbitrarily shaped objects instead of rectangular blocks . The objects are described by three parameter sets (first set, second set) defining their motion , shape and colour (colour parameters denoting luminance as well as chrominance values of the object surface) . The parameter sets of each object are obtained by image analysis and coded by an object dependent parameter coding . Using the coded parameter sets , an image can be reconstructed by model-based image synthesis . Experimental results show that transmitting shape information and allowing small position errors (geometrical distortions) avoid the mosquito and blocking artefacts of a block-oriented coder . Furthermore , important image areas such as facial areas can be reconstructed with an image quality improvement up to 4 dB using the image analysis . As a whole , the reconstructed image of an object-oriented analysis-synthesis coder appears sharper compared to block-oriented hybrid coding .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set (parameter sets) of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	OPTIMIZATION AND EFFICIENCY OF AN OBJECT-ORIENTED ANALYSIS-SYNTHESIS CODER . In this paper , an object-oriented analysis-synthesis coder is presented the first time in its entity concentrating on an optimal relationship of its components image analysis , image synthesis and parameter coding and on a comparison of its coding efficiency to block-oriented hybrid coding . As block-oriented hybrid coder , the RM8 of the CCITT is used . The presented object-oriented analysis-synthesis coder is based on the source model of moving flexible 2D-objects and encodes arbitrarily shaped objects instead of rectangular blocks . The objects are described by three parameter sets (first set, second set) defining their motion , shape and colour (colour parameters denoting luminance as well as chrominance values of the object surface) . The parameter sets of each object are obtained by image analysis and coded by an object dependent parameter coding . Using the coded parameter sets , an image can be reconstructed by model-based image synthesis . Experimental results show that transmitting shape information and allowing small position errors (geometrical distortions) avoid the mosquito and blocking artefacts of a block-oriented coder . Furthermore , important image areas such as facial areas can be reconstructed with an image quality improvement up to 4 dB using the image analysis . As a whole , the reconstructed image of an object-oriented analysis-synthesis coder appears sharper compared to block-oriented hybrid coding .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set (parameter sets) of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set (parameter sets) of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	OPTIMIZATION AND EFFICIENCY OF AN OBJECT-ORIENTED ANALYSIS-SYNTHESIS CODER . In this paper , an object-oriented analysis-synthesis coder is presented the first time in its entity concentrating on an optimal relationship of its components image analysis , image synthesis and parameter coding and on a comparison of its coding efficiency to block-oriented hybrid coding . As block-oriented hybrid coder , the RM8 of the CCITT is used . The presented object-oriented analysis-synthesis coder is based on the source model of moving flexible 2D-objects and encodes arbitrarily shaped objects instead of rectangular blocks . The objects are described by three parameter sets (first set, second set) defining their motion , shape and colour (colour parameters denoting luminance as well as chrominance values of the object surface) . The parameter sets of each object are obtained by image analysis and coded by an object dependent parameter coding . Using the coded parameter sets , an image can be reconstructed by model-based image synthesis . Experimental results show that transmitting shape information and allowing small position errors (geometrical distortions) avoid the mosquito and blocking artefacts of a block-oriented coder . Furthermore , important image areas such as facial areas can be reconstructed with an image quality improvement up to 4 dB using the image analysis . As a whole , the reconstructed image of an object-oriented analysis-synthesis coder appears sharper compared to block-oriented hybrid coding .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set (parameter sets) of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set (parameter sets) of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	OPTIMIZATION AND EFFICIENCY OF AN OBJECT-ORIENTED ANALYSIS-SYNTHESIS CODER . In this paper , an object-oriented analysis-synthesis coder is presented the first time in its entity concentrating on an optimal relationship of its components image analysis , image synthesis and parameter coding and on a comparison of its coding efficiency to block-oriented hybrid coding . As block-oriented hybrid coder , the RM8 of the CCITT is used . The presented object-oriented analysis-synthesis coder is based on the source model of moving flexible 2D-objects and encodes arbitrarily shaped objects instead of rectangular blocks . The objects are described by three parameter sets (first set, second set) defining their motion , shape and colour (colour parameters denoting luminance as well as chrominance values of the object surface) . The parameter sets of each object are obtained by image analysis and coded by an object dependent parameter coding . Using the coded parameter sets , an image can be reconstructed by model-based image synthesis . Experimental results show that transmitting shape information and allowing small position errors (geometrical distortions) avoid the mosquito and blocking artefacts of a block-oriented coder . Furthermore , important image areas such as facial areas can be reconstructed with an image quality improvement up to 4 dB using the image analysis . As a whole , the reconstructed image of an object-oriented analysis-synthesis coder appears sharper compared to block-oriented hybrid coding .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set (parameter sets) of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set (parameter sets) of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	OPTIMIZATION AND EFFICIENCY OF AN OBJECT-ORIENTED ANALYSIS-SYNTHESIS CODER . In this paper , an object-oriented analysis-synthesis coder is presented the first time in its entity concentrating on an optimal relationship of its components image analysis , image synthesis and parameter coding and on a comparison of its coding efficiency to block-oriented hybrid coding . As block-oriented hybrid coder , the RM8 of the CCITT is used . The presented object-oriented analysis-synthesis coder is based on the source model of moving flexible 2D-objects and encodes arbitrarily shaped objects instead of rectangular blocks . The objects are described by three parameter sets (first set, second set) defining their motion , shape and colour (colour parameters denoting luminance as well as chrominance values of the object surface) . The parameter sets of each object are obtained by image analysis and coded by an object dependent parameter coding . Using the coded parameter sets , an image can be reconstructed by model-based image synthesis . Experimental results show that transmitting shape information and allowing small position errors (geometrical distortions) avoid the mosquito and blocking artefacts of a block-oriented coder . Furthermore , important image areas such as facial areas can be reconstructed with an image quality improvement up to 4 dB using the image analysis . As a whole , the reconstructed image of an object-oriented analysis-synthesis coder appears sharper compared to block-oriented hybrid coding .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	IEEE TRANSACTIONS ON IMAGE PROCESSING. 2 (4): 481-498 OCT 1993 Publication Year: 1993 Edge-based 3-D Camera Motion Estimation With Application To Video Coding University of California, Berkeley Zakhor, Lari
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding (local motion) and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	Edge-based 3-D Camera Motion Estimation With Application To Video Coding . The evolution of an image sequence obtained by a real camera from a real scene can be conceptually separated into two parts : 1) motion of the camera and 2) motion of the objects in a scene . Most existing motion estimation algorithms use the block matching algorithm (BMA) to model both the camera motion and local motion (prediction coding, prediction signal, information samples using prediction coding) due to the objects . In doing so , successive frames are divided into small blocks and the movement of each block is approximately modeled by a translation , thus resulting in one motion vector per block . In this paper , we propose two classes of algorithms for modeling camera motion in video sequences captured by a camera . The first class can be applied in situations where there is no camera translation and the motion of camera can be adequately modeled by zoom , pan , and rotation parameters . The second class is more general in that it can be applied to situations where the camera is undergoing a translational motion , as well as a rotation and zoom and pan . This class uses seven parameters to describe the motion of the camera and requires the depth map to be known at the receiver . The salient feature of both of our algorithms is that the camera motion is estimated using binary matching of the edges in successive frames . In doing so , we show that unlike local motion estimation , edge matching can be sufficient in estimating camera motion parameters . Finally , we compare the rate distortion characteristics of our algorithms with that of the BMA and show that we can achieve similar performance characteristics as BMA , with reduced computational complexity .
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal (local motion) based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset of the second set of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	Edge-based 3-D Camera Motion Estimation With Application To Video Coding . The evolution of an image sequence obtained by a real camera from a real scene can be conceptually separated into two parts : 1) motion of the camera and 2) motion of the objects in a scene . Most existing motion estimation algorithms use the block matching algorithm (BMA) to model both the camera motion and local motion (prediction coding, prediction signal, information samples using prediction coding) due to the objects . In doing so , successive frames are divided into small blocks and the movement of each block is approximately modeled by a translation , thus resulting in one motion vector per block . In this paper , we propose two classes of algorithms for modeling camera motion in video sequences captured by a camera . The first class can be applied in situations where there is no camera translation and the motion of camera can be adequately modeled by zoom , pan , and rotation parameters . The second class is more general in that it can be applied to situations where the camera is undergoing a translational motion , as well as a rotation and zoom and pan . This class uses seven parameters to describe the motion of the camera and requires the depth map to be known at the receiver . The salient feature of both of our algorithms is that the camera motion is estimated using binary matching of the edges in successive frames . In doing so , we show that unlike local motion estimation , edge matching can be sufficient in estimating camera motion parameters . Finally , we compare the rate distortion characteristics of our algorithms with that of the BMA and show that we can achieve similar performance characteristics as BMA , with reduced computational complexity .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding (local motion) and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	Edge-based 3-D Camera Motion Estimation With Application To Video Coding . The evolution of an image sequence obtained by a real camera from a real scene can be conceptually separated into two parts : 1) motion of the camera and 2) motion of the objects in a scene . Most existing motion estimation algorithms use the block matching algorithm (BMA) to model both the camera motion and local motion (prediction coding, prediction signal, information samples using prediction coding) due to the objects . In doing so , successive frames are divided into small blocks and the movement of each block is approximately modeled by a translation , thus resulting in one motion vector per block . In this paper , we propose two classes of algorithms for modeling camera motion in video sequences captured by a camera . The first class can be applied in situations where there is no camera translation and the motion of camera can be adequately modeled by zoom , pan , and rotation parameters . The second class is more general in that it can be applied to situations where the camera is undergoing a translational motion , as well as a rotation and zoom and pan . This class uses seven parameters to describe the motion of the camera and requires the depth map to be known at the receiver . The salient feature of both of our algorithms is that the camera motion is estimated using binary matching of the edges in successive frames . In doing so , we show that unlike local motion estimation , edge matching can be sufficient in estimating camera motion parameters . Finally , we compare the rate distortion characteristics of our algorithms with that of the BMA and show that we can achieve similar performance characteristics as BMA , with reduced computational complexity .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding (local motion) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	Edge-based 3-D Camera Motion Estimation With Application To Video Coding . The evolution of an image sequence obtained by a real camera from a real scene can be conceptually separated into two parts : 1) motion of the camera and 2) motion of the objects in a scene . Most existing motion estimation algorithms use the block matching algorithm (BMA) to model both the camera motion and local motion (prediction coding, prediction signal, information samples using prediction coding) due to the objects . In doing so , successive frames are divided into small blocks and the movement of each block is approximately modeled by a translation , thus resulting in one motion vector per block . In this paper , we propose two classes of algorithms for modeling camera motion in video sequences captured by a camera . The first class can be applied in situations where there is no camera translation and the motion of camera can be adequately modeled by zoom , pan , and rotation parameters . The second class is more general in that it can be applied to situations where the camera is undergoing a translational motion , as well as a rotation and zoom and pan . This class uses seven parameters to describe the motion of the camera and requires the depth map to be known at the receiver . The salient feature of both of our algorithms is that the camera motion is estimated using binary matching of the edges in successive frames . In doing so , we show that unlike local motion estimation , edge matching can be sufficient in estimating camera motion parameters . Finally , we compare the rate distortion characteristics of our algorithms with that of the BMA and show that we can achieve similar performance characteristics as BMA , with reduced computational complexity .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding (local motion) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	Edge-based 3-D Camera Motion Estimation With Application To Video Coding . The evolution of an image sequence obtained by a real camera from a real scene can be conceptually separated into two parts : 1) motion of the camera and 2) motion of the objects in a scene . Most existing motion estimation algorithms use the block matching algorithm (BMA) to model both the camera motion and local motion (prediction coding, prediction signal, information samples using prediction coding) due to the objects . In doing so , successive frames are divided into small blocks and the movement of each block is approximately modeled by a translation , thus resulting in one motion vector per block . In this paper , we propose two classes of algorithms for modeling camera motion in video sequences captured by a camera . The first class can be applied in situations where there is no camera translation and the motion of camera can be adequately modeled by zoom , pan , and rotation parameters . The second class is more general in that it can be applied to situations where the camera is undergoing a translational motion , as well as a rotation and zoom and pan . This class uses seven parameters to describe the motion of the camera and requires the depth map to be known at the receiver . The salient feature of both of our algorithms is that the camera motion is estimated using binary matching of the edges in successive frames . In doing so , we show that unlike local motion estimation , edge matching can be sufficient in estimating camera motion parameters . Finally , we compare the rate distortion characteristics of our algorithms with that of the BMA and show that we can achieve similar performance characteristics as BMA , with reduced computational complexity .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	APPLICATIONS OF DIGITAL IMAGE PROCESSING XXVII, PTS 1AND 2. 5558: 454-474 Part 1&2 2004 Publication Year: 2004 The H.264/AVC Advanced Video Coding Standard: Overview And Introduction To The Fidelity Range Extensions Microsoft Corporation Sullivan, Topiwala, Luthra, Tescher
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information (hard disk) , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	The H . 264/AVC Advanced Video Coding Standard : Overview And Introduction To The Fidelity Range Extensions . H . 264/MPEG-4 AVC is the latest international video coding standard . It was jointly developed by the Video Coding Experts Group (VCEG) of the ITU-T and the Moving Picture Experts Group (MPEG) of ISO/IEC . It uses state-of-the-art coding tools and provides enhanced coding efficiency for a wide range of applications , including video telephony , video conferencing , TV , storage (DVD and/or hard disk (video information) based , especially high-definition DVD) , streaming video , digital video authoring , digital cinema , and many others . The work on a new set of extensions to this standard has recently been completed . These extensions , known as the Fidelity Range Extensions (FRExt) , provide a number of enhanced capabilities relative to the base specification as approved in the Spring of 2003 . In this paper , an overview of this standard is provided , including the highlights of the capabilities of the new FRExt features . Some comparisons with the existing MPEG-2 and MPEG-4 Part 2 standards are also provided .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements (video coding) associated with the first or second set of sub-regions from the data stream in a depth-first traversal order .	The H . 264/AVC Advanced Video Coding Standard : Overview And Introduction To The Fidelity Range Extensions . H . 264/MPEG-4 AVC is the latest international video coding (syntax elements) standard . It was jointly developed by the Video Coding Experts Group (VCEG) of the ITU-T and the Moving Picture Experts Group (MPEG) of ISO/IEC . It uses state-of-the-art coding tools and provides enhanced coding efficiency for a wide range of applications , including video telephony , video conferencing , TV , storage (DVD and/or hard disk based , especially high-definition DVD) , streaming video , digital video authoring , digital cinema , and many others . The work on a new set of extensions to this standard has recently been completed . These extensions , known as the Fidelity Range Extensions (FRExt) , provide a number of enhanced capabilities relative to the base specification as approved in the Spring of 2003 . In this paper , an overview of this standard is provided , including the highlights of the capabilities of the new FRExt features . Some comparisons with the existing MPEG-2 and MPEG-4 Part 2 standards are also provided .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements (video coding) of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	The H . 264/AVC Advanced Video Coding Standard : Overview And Introduction To The Fidelity Range Extensions . H . 264/MPEG-4 AVC is the latest international video coding (syntax elements) standard . It was jointly developed by the Video Coding Experts Group (VCEG) of the ITU-T and the Moving Picture Experts Group (MPEG) of ISO/IEC . It uses state-of-the-art coding tools and provides enhanced coding efficiency for a wide range of applications , including video telephony , video conferencing , TV , storage (DVD and/or hard disk based , especially high-definition DVD) , streaming video , digital video authoring , digital cinema , and many others . The work on a new set of extensions to this standard has recently been completed . These extensions , known as the Fidelity Range Extensions (FRExt) , provide a number of enhanced capabilities relative to the base specification as approved in the Spring of 2003 . In this paper , an overview of this standard is provided , including the highlights of the capabilities of the new FRExt features . Some comparisons with the existing MPEG-2 and MPEG-4 Part 2 standards are also provided .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information (hard disk) , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	The H . 264/AVC Advanced Video Coding Standard : Overview And Introduction To The Fidelity Range Extensions . H . 264/MPEG-4 AVC is the latest international video coding standard . It was jointly developed by the Video Coding Experts Group (VCEG) of the ITU-T and the Moving Picture Experts Group (MPEG) of ISO/IEC . It uses state-of-the-art coding tools and provides enhanced coding efficiency for a wide range of applications , including video telephony , video conferencing , TV , storage (DVD and/or hard disk (video information) based , especially high-definition DVD) , streaming video , digital video authoring , digital cinema , and many others . The work on a new set of extensions to this standard has recently been completed . These extensions , known as the Fidelity Range Extensions (FRExt) , provide a number of enhanced capabilities relative to the base specification as approved in the Spring of 2003 . In this paper , an overview of this standard is provided , including the highlights of the capabilities of the new FRExt features . Some comparisons with the existing MPEG-2 and MPEG-4 Part 2 standards are also provided .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information (hard disk) into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	The H . 264/AVC Advanced Video Coding Standard : Overview And Introduction To The Fidelity Range Extensions . H . 264/MPEG-4 AVC is the latest international video coding standard . It was jointly developed by the Video Coding Experts Group (VCEG) of the ITU-T and the Moving Picture Experts Group (MPEG) of ISO/IEC . It uses state-of-the-art coding tools and provides enhanced coding efficiency for a wide range of applications , including video telephony , video conferencing , TV , storage (DVD and/or hard disk (video information) based , especially high-definition DVD) , streaming video , digital video authoring , digital cinema , and many others . The work on a new set of extensions to this standard has recently been completed . These extensions , known as the Fidelity Range Extensions (FRExt) , provide a number of enhanced capabilities relative to the base specification as approved in the Spring of 2003 . In this paper , an overview of this standard is provided , including the highlights of the capabilities of the new FRExt features . Some comparisons with the existing MPEG-2 and MPEG-4 Part 2 standards are also provided .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information (hard disk) into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	The H . 264/AVC Advanced Video Coding Standard : Overview And Introduction To The Fidelity Range Extensions . H . 264/MPEG-4 AVC is the latest international video coding standard . It was jointly developed by the Video Coding Experts Group (VCEG) of the ITU-T and the Moving Picture Experts Group (MPEG) of ISO/IEC . It uses state-of-the-art coding tools and provides enhanced coding efficiency for a wide range of applications , including video telephony , video conferencing , TV , storage (DVD and/or hard disk (video information) based , especially high-definition DVD) , streaming video , digital video authoring , digital cinema , and many others . The work on a new set of extensions to this standard has recently been completed . These extensions , known as the Fidelity Range Extensions (FRExt) , provide a number of enhanced capabilities relative to the base specification as approved in the Spring of 2003 . In this paper , an overview of this standard is provided , including the highlights of the capabilities of the new FRExt features . Some comparisons with the existing MPEG-2 and MPEG-4 Part 2 standards are also provided .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	APPLICATIONS OF DIGITAL IMAGE PROCESSING XXIII. 4115: 384-395 2000 Publication Year: 2000 Fast Multiplierless Approximation Of The DCT With The Lifting Scheme Johns Hopkins University Liang, Tran, Tescher
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region (mean square error) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	Fast Multiplierless Approximation Of The DCT With The Lifting Scheme . In this paper , we present a systematic approach to design two families of fast multiplierless approximations of the DCT with the lifting scheme , based on two kinds of factorizations of the DCT matrix with Givens rotations . A scaled lifting structure is proposed to reduce the complexity of the transform . Analytical values of all lifting parameters are derived , from which dyadic values with different accuracies can be obtained through finite-length approximations . This enables low-cost and fast implementations with only shift and addition operations . Besides , a sensitivity analysis is developed for the scaled lifting structure , which shows that for certain rotation angles , a permuted version of it is more robust to truncation errors . Numerous approximation examples with different complexities are presented for the 8-point and 16-point DCT . As the complexity increases , more accurate approximation of the floating DCT can be obtained in terms of coding gains , frequency responses , and mean square error (root region) s of DCT coefficients . Hence the lifting-based fast transform can be easily tailored to meet the demands of different applications , making it suitable for hardware and software implementations in real-time and mobile computing applications .
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset (different complexities) of the second set of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	Fast Multiplierless Approximation Of The DCT With The Lifting Scheme . In this paper , we present a systematic approach to design two families of fast multiplierless approximations of the DCT with the lifting scheme , based on two kinds of factorizations of the DCT matrix with Givens rotations . A scaled lifting structure is proposed to reduce the complexity of the transform . Analytical values of all lifting parameters are derived , from which dyadic values with different accuracies can be obtained through finite-length approximations . This enables low-cost and fast implementations with only shift and addition operations . Besides , a sensitivity analysis is developed for the scaled lifting structure , which shows that for certain rotation angles , a permuted version of it is more robust to truncation errors . Numerous approximation examples with different complexities (neighboring subset) are presented for the 8-point and 16-point DCT . As the complexity increases , more accurate approximation of the floating DCT can be obtained in terms of coding gains , frequency responses , and mean square errors of DCT coefficients . Hence the lifting-based fast transform can be easily tailored to meet the demands of different applications , making it suitable for hardware and software implementations in real-time and mobile computing applications .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region (mean square error) into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	Fast Multiplierless Approximation Of The DCT With The Lifting Scheme . In this paper , we present a systematic approach to design two families of fast multiplierless approximations of the DCT with the lifting scheme , based on two kinds of factorizations of the DCT matrix with Givens rotations . A scaled lifting structure is proposed to reduce the complexity of the transform . Analytical values of all lifting parameters are derived , from which dyadic values with different accuracies can be obtained through finite-length approximations . This enables low-cost and fast implementations with only shift and addition operations . Besides , a sensitivity analysis is developed for the scaled lifting structure , which shows that for certain rotation angles , a permuted version of it is more robust to truncation errors . Numerous approximation examples with different complexities are presented for the 8-point and 16-point DCT . As the complexity increases , more accurate approximation of the floating DCT can be obtained in terms of coding gains , frequency responses , and mean square error (root region) s of DCT coefficients . Hence the lifting-based fast transform can be easily tailored to meet the demands of different applications , making it suitable for hardware and software implementations in real-time and mobile computing applications .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region (mean square error) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	Fast Multiplierless Approximation Of The DCT With The Lifting Scheme . In this paper , we present a systematic approach to design two families of fast multiplierless approximations of the DCT with the lifting scheme , based on two kinds of factorizations of the DCT matrix with Givens rotations . A scaled lifting structure is proposed to reduce the complexity of the transform . Analytical values of all lifting parameters are derived , from which dyadic values with different accuracies can be obtained through finite-length approximations . This enables low-cost and fast implementations with only shift and addition operations . Besides , a sensitivity analysis is developed for the scaled lifting structure , which shows that for certain rotation angles , a permuted version of it is more robust to truncation errors . Numerous approximation examples with different complexities are presented for the 8-point and 16-point DCT . As the complexity increases , more accurate approximation of the floating DCT can be obtained in terms of coding gains , frequency responses , and mean square error (root region) s of DCT coefficients . Hence the lifting-based fast transform can be easily tailored to meet the demands of different applications , making it suitable for hardware and software implementations in real-time and mobile computing applications .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region (mean square error) of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	Fast Multiplierless Approximation Of The DCT With The Lifting Scheme . In this paper , we present a systematic approach to design two families of fast multiplierless approximations of the DCT with the lifting scheme , based on two kinds of factorizations of the DCT matrix with Givens rotations . A scaled lifting structure is proposed to reduce the complexity of the transform . Analytical values of all lifting parameters are derived , from which dyadic values with different accuracies can be obtained through finite-length approximations . This enables low-cost and fast implementations with only shift and addition operations . Besides , a sensitivity analysis is developed for the scaled lifting structure , which shows that for certain rotation angles , a permuted version of it is more robust to truncation errors . Numerous approximation examples with different complexities are presented for the 8-point and 16-point DCT . As the complexity increases , more accurate approximation of the floating DCT can be obtained in terms of coding gains , frequency responses , and mean square error (root region) s of DCT coefficients . Hence the lifting-based fast transform can be easily tailored to meet the demands of different applications , making it suitable for hardware and software implementations in real-time and mobile computing applications .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region (mean square error) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	Fast Multiplierless Approximation Of The DCT With The Lifting Scheme . In this paper , we present a systematic approach to design two families of fast multiplierless approximations of the DCT with the lifting scheme , based on two kinds of factorizations of the DCT matrix with Givens rotations . A scaled lifting structure is proposed to reduce the complexity of the transform . Analytical values of all lifting parameters are derived , from which dyadic values with different accuracies can be obtained through finite-length approximations . This enables low-cost and fast implementations with only shift and addition operations . Besides , a sensitivity analysis is developed for the scaled lifting structure , which shows that for certain rotation angles , a permuted version of it is more robust to truncation errors . Numerous approximation examples with different complexities are presented for the 8-point and 16-point DCT . As the complexity increases , more accurate approximation of the floating DCT can be obtained in terms of coding gains , frequency responses , and mean square error (root region) s of DCT coefficients . Hence the lifting-based fast transform can be easily tailored to meet the demands of different applications , making it suitable for hardware and software implementations in real-time and mobile computing applications .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	IEEE TRANSACTIONS ON CONSUMER ELECTRONICS. 44 (1): 200-205 FEB 1998 Publication Year: 1998 A Java-based MPEG-4 Like Video Codec National Taiwan University Liu, Tsai, Wu
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (video encoder) information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	A Java-based MPEG-4 Like Video Codec . The MPEG-4 specification was developed in response to the growing need for a coding method that can facilitate dynamic access to audiovisual objects for various applications such as digital storage media , internet , various forms of wired or wireless communication etc . , Although the specification is still in the working draft stage , the concepts and technologies of the specification are very encouraging and will inspire a lot of creative works In the multimedia applications , This paper is devoted to the rsoftware implementation of the video part of MPEG-4 , We develop a prototype of MPEG4-like video encoder (second subdivision, second subset, second subdivision information) and a prototype of Java-based video decoder , which can be executed on Internet , in the client-server model by using Java Applet , The prototype can show us the strong functionality of MPEG-4 that includes user interactivity and object scalability , etc .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset (video encoder) of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	A Java-based MPEG-4 Like Video Codec . The MPEG-4 specification was developed in response to the growing need for a coding method that can facilitate dynamic access to audiovisual objects for various applications such as digital storage media , internet , various forms of wired or wireless communication etc . , Although the specification is still in the working draft stage , the concepts and technologies of the specification are very encouraging and will inspire a lot of creative works In the multimedia applications , This paper is devoted to the rsoftware implementation of the video part of MPEG-4 , We develop a prototype of MPEG4-like video encoder (second subdivision, second subset, second subdivision information) and a prototype of Java-based video decoder , which can be executed on Internet , in the client-server model by using Java Applet , The prototype can show us the strong functionality of MPEG-4 that includes user interactivity and object scalability , etc .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (video encoder) information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	A Java-based MPEG-4 Like Video Codec . The MPEG-4 specification was developed in response to the growing need for a coding method that can facilitate dynamic access to audiovisual objects for various applications such as digital storage media , internet , various forms of wired or wireless communication etc . , Although the specification is still in the working draft stage , the concepts and technologies of the specification are very encouraging and will inspire a lot of creative works In the multimedia applications , This paper is devoted to the rsoftware implementation of the video part of MPEG-4 , We develop a prototype of MPEG4-like video encoder (second subdivision, second subset, second subdivision information) and a prototype of Java-based video decoder , which can be executed on Internet , in the client-server model by using Java Applet , The prototype can show us the strong functionality of MPEG-4 that includes user interactivity and object scalability , etc .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (video encoder) information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	A Java-based MPEG-4 Like Video Codec . The MPEG-4 specification was developed in response to the growing need for a coding method that can facilitate dynamic access to audiovisual objects for various applications such as digital storage media , internet , various forms of wired or wireless communication etc . , Although the specification is still in the working draft stage , the concepts and technologies of the specification are very encouraging and will inspire a lot of creative works In the multimedia applications , This paper is devoted to the rsoftware implementation of the video part of MPEG-4 , We develop a prototype of MPEG4-like video encoder (second subdivision, second subset, second subdivision information) and a prototype of Java-based video decoder , which can be executed on Internet , in the client-server model by using Java Applet , The prototype can show us the strong functionality of MPEG-4 that includes user interactivity and object scalability , etc .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (video encoder) information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	A Java-based MPEG-4 Like Video Codec . The MPEG-4 specification was developed in response to the growing need for a coding method that can facilitate dynamic access to audiovisual objects for various applications such as digital storage media , internet , various forms of wired or wireless communication etc . , Although the specification is still in the working draft stage , the concepts and technologies of the specification are very encouraging and will inspire a lot of creative works In the multimedia applications , This paper is devoted to the rsoftware implementation of the video part of MPEG-4 , We develop a prototype of MPEG4-like video encoder (second subdivision, second subset, second subdivision information) and a prototype of Java-based video decoder , which can be executed on Internet , in the client-server model by using Java Applet , The prototype can show us the strong functionality of MPEG-4 that includes user interactivity and object scalability , etc .
US10250913B2 CLAIM 15 . A non-transitory computer readable digital storage medium having stored thereon a computer program (digital storage) having a program code for performing , when running on a computer , a method according to claim 12 .	A Java-based MPEG-4 Like Video Codec . The MPEG-4 specification was developed in response to the growing need for a coding method that can facilitate dynamic access to audiovisual objects for various applications such as digital storage (computer program) media , internet , various forms of wired or wireless communication etc . , Although the specification is still in the working draft stage , the concepts and technologies of the specification are very encouraging and will inspire a lot of creative works In the multimedia applications , This paper is devoted to the rsoftware implementation of the video part of MPEG-4 , We develop a prototype of MPEG4-like video encoder and a prototype of Java-based video decoder , which can be executed on Internet , in the client-server model by using Java Applet , The prototype can show us the strong functionality of MPEG-4 that includes user interactivity and object scalability , etc .
US10250913B2 CLAIM 16 . A non-transitory computer readable digital storage medium having stored thereon a computer program (digital storage) having a program code for performing , when running on a computer , a method according to claim 14 .	A Java-based MPEG-4 Like Video Codec . The MPEG-4 specification was developed in response to the growing need for a coding method that can facilitate dynamic access to audiovisual objects for various applications such as digital storage (computer program) media , internet , various forms of wired or wireless communication etc . , Although the specification is still in the working draft stage , the concepts and technologies of the specification are very encouraging and will inspire a lot of creative works In the multimedia applications , This paper is devoted to the rsoftware implementation of the video part of MPEG-4 , We develop a prototype of MPEG4-like video encoder and a prototype of Java-based video decoder , which can be executed on Internet , in the client-server model by using Java Applet , The prototype can show us the strong functionality of MPEG-4 that includes user interactivity and object scalability , etc .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	VISUAL COMMUNICATIONS AND IMAGE PROCESSING 97, PTS 1-2. 3024: 953-963 Part 1 & 2 1997 Publication Year: 1997 Object-based Indexing Of MPEG-4 Compressed Video University of Rochester Ferman, Gunsel, Tekalp, Biemond, Delp
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream (video object) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding (global motion) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	Object-based Indexing Of MPEG-4 Compressed Video . The MPEG-4 object-based coding standard , designed as a common platform for all multimedia applications , is inherently well-suited for video indexing applications . To fully exploit the advantages offered by MPEG-4 , however , a reconsideration of existing indexing strategies is required . This paper proposes anew object-based framework for video indexing and retrieval that treats as the basic indexing unit the object itself , where changes in content are detected through observations made on the objects in the video sequence . We present a temporal segmentation algorithm that is designed to automatically extract key frames for each video object (data stream) in an MPEG-4 compressed sequence based on the prediction mode chosen by the encoder for individual macroblocks . An extension to the existing MPEG-4 syntax is presented for conducting and facilitating vast database searches . The data presented in the proposed ''indexing field'' are : the birth and death frames of individual objects , global motion (information samples using prediction coding) characteristics/camera operations observed in the scene , representative key frames that capture the major transformations each object undergoes , and the dominant motion characteristics of each object throughout its lifetime . We present the validity of the proposed scheme by results obtained on several MPEG-4 test sequences .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set of root regions such that the first set of root regions are rectangular blocks (th frame) of a size determined by the first maximum region size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	Object-based Indexing Of MPEG-4 Compressed Video . The MPEG-4 object-based coding standard , designed as a common platform for all multimedia applications , is inherently well-suited for video indexing applications . To fully exploit the advantages offered by MPEG-4 , however , a reconsideration of existing indexing strategies is required . This paper proposes anew object-based framework for video indexing and retrieval that treats as the basic indexing unit the object itself , where changes in content are detected through observations made on the objects in the video sequence . We present a temporal segmentation algorithm that is designed to automatically extract key frames for each video object in an MPEG-4 compressed sequence based on the prediction mode chosen by the encoder for individual macroblocks . An extension to the existing MPEG-4 syntax is presented for conducting and facilitating vast database searches . The data presented in the proposed ''indexing field'' are : the birth and death frame (rectangular blocks) s of individual objects , global motion characteristics/camera operations observed in the scene , representative key frames that capture the major transformations each object undergoes , and the dominant motion characteristics of each object throughout its lifetime . We present the validity of the proposed scheme by results obtained on several MPEG-4 test sequences .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level from the data stream (video object) .	Object-based Indexing Of MPEG-4 Compressed Video . The MPEG-4 object-based coding standard , designed as a common platform for all multimedia applications , is inherently well-suited for video indexing applications . To fully exploit the advantages offered by MPEG-4 , however , a reconsideration of existing indexing strategies is required . This paper proposes anew object-based framework for video indexing and retrieval that treats as the basic indexing unit the object itself , where changes in content are detected through observations made on the objects in the video sequence . We present a temporal segmentation algorithm that is designed to automatically extract key frames for each video object (data stream) in an MPEG-4 compressed sequence based on the prediction mode chosen by the encoder for individual macroblocks . An extension to the existing MPEG-4 syntax is presented for conducting and facilitating vast database searches . The data presented in the proposed ''indexing field'' are : the birth and death frames of individual objects , global motion characteristics/camera operations observed in the scene , representative key frames that capture the major transformations each object undergoes , and the dominant motion characteristics of each object throughout its lifetime . We present the validity of the proposed scheme by results obtained on several MPEG-4 test sequences .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements associated with the first or second set of sub-regions from the data stream (video object) in a depth-first traversal order .	Object-based Indexing Of MPEG-4 Compressed Video . The MPEG-4 object-based coding standard , designed as a common platform for all multimedia applications , is inherently well-suited for video indexing applications . To fully exploit the advantages offered by MPEG-4 , however , a reconsideration of existing indexing strategies is required . This paper proposes anew object-based framework for video indexing and retrieval that treats as the basic indexing unit the object itself , where changes in content are detected through observations made on the objects in the video sequence . We present a temporal segmentation algorithm that is designed to automatically extract key frames for each video object (data stream) in an MPEG-4 compressed sequence based on the prediction mode chosen by the encoder for individual macroblocks . An extension to the existing MPEG-4 syntax is presented for conducting and facilitating vast database searches . The data presented in the proposed ''indexing field'' are : the birth and death frames of individual objects , global motion characteristics/camera operations observed in the scene , representative key frames that capture the major transformations each object undergoes , and the dominant motion characteristics of each object throughout its lifetime . We present the validity of the proposed scheme by results obtained on several MPEG-4 test sequences .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream (video object) , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	Object-based Indexing Of MPEG-4 Compressed Video . The MPEG-4 object-based coding standard , designed as a common platform for all multimedia applications , is inherently well-suited for video indexing applications . To fully exploit the advantages offered by MPEG-4 , however , a reconsideration of existing indexing strategies is required . This paper proposes anew object-based framework for video indexing and retrieval that treats as the basic indexing unit the object itself , where changes in content are detected through observations made on the objects in the video sequence . We present a temporal segmentation algorithm that is designed to automatically extract key frames for each video object (data stream) in an MPEG-4 compressed sequence based on the prediction mode chosen by the encoder for individual macroblocks . An extension to the existing MPEG-4 syntax is presented for conducting and facilitating vast database searches . The data presented in the proposed ''indexing field'' are : the birth and death frames of individual objects , global motion characteristics/camera operations observed in the scene , representative key frames that capture the major transformations each object undergoes , and the dominant motion characteristics of each object throughout its lifetime . We present the validity of the proposed scheme by results obtained on several MPEG-4 test sequences .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream (video object) , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	Object-based Indexing Of MPEG-4 Compressed Video . The MPEG-4 object-based coding standard , designed as a common platform for all multimedia applications , is inherently well-suited for video indexing applications . To fully exploit the advantages offered by MPEG-4 , however , a reconsideration of existing indexing strategies is required . This paper proposes anew object-based framework for video indexing and retrieval that treats as the basic indexing unit the object itself , where changes in content are detected through observations made on the objects in the video sequence . We present a temporal segmentation algorithm that is designed to automatically extract key frames for each video object (data stream) in an MPEG-4 compressed sequence based on the prediction mode chosen by the encoder for individual macroblocks . An extension to the existing MPEG-4 syntax is presented for conducting and facilitating vast database searches . The data presented in the proposed ''indexing field'' are : the birth and death frames of individual objects , global motion characteristics/camera operations observed in the scene , representative key frames that capture the major transformations each object undergoes , and the dominant motion characteristics of each object throughout its lifetime . We present the validity of the proposed scheme by results obtained on several MPEG-4 test sequences .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream (video object) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding (global motion) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	Object-based Indexing Of MPEG-4 Compressed Video . The MPEG-4 object-based coding standard , designed as a common platform for all multimedia applications , is inherently well-suited for video indexing applications . To fully exploit the advantages offered by MPEG-4 , however , a reconsideration of existing indexing strategies is required . This paper proposes anew object-based framework for video indexing and retrieval that treats as the basic indexing unit the object itself , where changes in content are detected through observations made on the objects in the video sequence . We present a temporal segmentation algorithm that is designed to automatically extract key frames for each video object (data stream) in an MPEG-4 compressed sequence based on the prediction mode chosen by the encoder for individual macroblocks . An extension to the existing MPEG-4 syntax is presented for conducting and facilitating vast database searches . The data presented in the proposed ''indexing field'' are : the birth and death frames of individual objects , global motion (information samples using prediction coding) characteristics/camera operations observed in the scene , representative key frames that capture the major transformations each object undergoes , and the dominant motion characteristics of each object throughout its lifetime . We present the validity of the proposed scheme by results obtained on several MPEG-4 test sequences .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream (video object) generator configured to : encode the array of information samples using prediction coding (global motion) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	Object-based Indexing Of MPEG-4 Compressed Video . The MPEG-4 object-based coding standard , designed as a common platform for all multimedia applications , is inherently well-suited for video indexing applications . To fully exploit the advantages offered by MPEG-4 , however , a reconsideration of existing indexing strategies is required . This paper proposes anew object-based framework for video indexing and retrieval that treats as the basic indexing unit the object itself , where changes in content are detected through observations made on the objects in the video sequence . We present a temporal segmentation algorithm that is designed to automatically extract key frames for each video object (data stream) in an MPEG-4 compressed sequence based on the prediction mode chosen by the encoder for individual macroblocks . An extension to the existing MPEG-4 syntax is presented for conducting and facilitating vast database searches . The data presented in the proposed ''indexing field'' are : the birth and death frames of individual objects , global motion (information samples using prediction coding) characteristics/camera operations observed in the scene , representative key frames that capture the major transformations each object undergoes , and the dominant motion characteristics of each object throughout its lifetime . We present the validity of the proposed scheme by results obtained on several MPEG-4 test sequences .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding (global motion) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream (video object) the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	Object-based Indexing Of MPEG-4 Compressed Video . The MPEG-4 object-based coding standard , designed as a common platform for all multimedia applications , is inherently well-suited for video indexing applications . To fully exploit the advantages offered by MPEG-4 , however , a reconsideration of existing indexing strategies is required . This paper proposes anew object-based framework for video indexing and retrieval that treats as the basic indexing unit the object itself , where changes in content are detected through observations made on the objects in the video sequence . We present a temporal segmentation algorithm that is designed to automatically extract key frames for each video object (data stream) in an MPEG-4 compressed sequence based on the prediction mode chosen by the encoder for individual macroblocks . An extension to the existing MPEG-4 syntax is presented for conducting and facilitating vast database searches . The data presented in the proposed ''indexing field'' are : the birth and death frames of individual objects , global motion (information samples using prediction coding) characteristics/camera operations observed in the scene , representative key frames that capture the major transformations each object undergoes , and the dominant motion characteristics of each object throughout its lifetime . We present the validity of the proposed scheme by results obtained on several MPEG-4 test sequences .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	THIRTIETH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS & COMPUTERS, VOLS 1 AND 2. : 943-947 1997 Publication Year: 1997 Adaptive Coding Using Finite State Hierarchical Table Lookup Vector Quantization With Variable Block Sizes Stanford University Mehrotra, Chaddha, Gray, Singh
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding (reduce encoding complexity) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	Adaptive Coding Using Finite State Hierarchical Table Lookup Vector Quantization With Variable Block Sizes . In this paper we present an algorithm for performing adaptive vector quantization with memory . By using memory between adjacent blocks which are encoded , we can take advantage of the correlation between adjacent blocks of pixels to reduce redundancy . We use finite state vector quantization to provide the memory . To further improve performance by exploiting nonstationarities in the image , we use variable block sizes in the encoding . This is done by using a quadtree data structure to represent an encoding based on using variable block sizes . To reduce encoding complexity (information samples using prediction coding) , hierarchical table lookup schemes are used to replace all the full search encoders .
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal (adjacent blocks) based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset of the second set of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	Adaptive Coding Using Finite State Hierarchical Table Lookup Vector Quantization With Variable Block Sizes . In this paper we present an algorithm for performing adaptive vector quantization with memory . By using memory between adjacent blocks (prediction signal) which are encoded , we can take advantage of the correlation between adjacent blocks of pixels to reduce redundancy . We use finite state vector quantization to provide the memory . To further improve performance by exploiting nonstationarities in the image , we use variable block sizes in the encoding . This is done by using a quadtree data structure to represent an encoding based on using variable block sizes . To reduce encoding complexity , hierarchical table lookup schemes are used to replace all the full search encoders .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding (reduce encoding complexity) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	Adaptive Coding Using Finite State Hierarchical Table Lookup Vector Quantization With Variable Block Sizes . In this paper we present an algorithm for performing adaptive vector quantization with memory . By using memory between adjacent blocks which are encoded , we can take advantage of the correlation between adjacent blocks of pixels to reduce redundancy . We use finite state vector quantization to provide the memory . To further improve performance by exploiting nonstationarities in the image , we use variable block sizes in the encoding . This is done by using a quadtree data structure to represent an encoding based on using variable block sizes . To reduce encoding complexity (information samples using prediction coding) , hierarchical table lookup schemes are used to replace all the full search encoders .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding (reduce encoding complexity) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	Adaptive Coding Using Finite State Hierarchical Table Lookup Vector Quantization With Variable Block Sizes . In this paper we present an algorithm for performing adaptive vector quantization with memory . By using memory between adjacent blocks which are encoded , we can take advantage of the correlation between adjacent blocks of pixels to reduce redundancy . We use finite state vector quantization to provide the memory . To further improve performance by exploiting nonstationarities in the image , we use variable block sizes in the encoding . This is done by using a quadtree data structure to represent an encoding based on using variable block sizes . To reduce encoding complexity (information samples using prediction coding) , hierarchical table lookup schemes are used to replace all the full search encoders .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding (reduce encoding complexity) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	Adaptive Coding Using Finite State Hierarchical Table Lookup Vector Quantization With Variable Block Sizes . In this paper we present an algorithm for performing adaptive vector quantization with memory . By using memory between adjacent blocks which are encoded , we can take advantage of the correlation between adjacent blocks of pixels to reduce redundancy . We use finite state vector quantization to provide the memory . To further improve performance by exploiting nonstationarities in the image , we use variable block sizes in the encoding . This is done by using a quadtree data structure to represent an encoding based on using variable block sizes . To reduce encoding complexity (information samples using prediction coding) , hierarchical table lookup schemes are used to replace all the full search encoders .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	IEEE TRANSACTIONS ON IMAGE PROCESSING. 4 (7): 896-908 JUL 1995 Publication Year: 1995 PROJECTION-BASED SPATIALLY ADAPTIVE RECONSTRUCTION OF BLOCK-TRANSFORM COMPRESSED IMAGES Northwestern University Yang, Galatsanos, Katsaggelos
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding (transform coding) ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	PROJECTION-BASED SPATIALLY ADAPTIVE RECONSTRUCTION OF BLOCK-TRANSFORM COMPRESSED IMAGES . At the present time , block-transform coding (transform coding) is probably the most popular approach for image compression , For this approach , the compressed images are decoded using only the transmitted transform data , In this paper , we formulate image decoding as an image recovery problem , According to this approach , the decoded image is reconstructed using not only the transmitted data but , in addition , the prior knowledge that images before compression do not display between-block discontinuities . A spatially adaptive image recovery algorithm is proposed based on the theory of projections onto convex sets . Apart from the data constraint set , this algorithm uses another new constraint set that enforces between-block smoothness , The novelty of this set is that it captures both the local statistical properties of the image and the human perceptual characteristics , A simplified spatially adaptive recovery algorithm is also proposed , and the analysis of its computational complexity Is presented , Numerical experiments are shown that demonstrate that the proposed algorithms work better than both the JPEG deblocking recommendation and our previous projection-based image decoding approach .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding (transform coding) to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	PROJECTION-BASED SPATIALLY ADAPTIVE RECONSTRUCTION OF BLOCK-TRANSFORM COMPRESSED IMAGES . At the present time , block-transform coding (transform coding) is probably the most popular approach for image compression , For this approach , the compressed images are decoded using only the transmitted transform data , In this paper , we formulate image decoding as an image recovery problem , According to this approach , the decoded image is reconstructed using not only the transmitted data but , in addition , the prior knowledge that images before compression do not display between-block discontinuities . A spatially adaptive image recovery algorithm is proposed based on the theory of projections onto convex sets . Apart from the data constraint set , this algorithm uses another new constraint set that enforces between-block smoothness , The novelty of this set is that it captures both the local statistical properties of the image and the human perceptual characteristics , A simplified spatially adaptive recovery algorithm is also proposed , and the analysis of its computational complexity Is presented , Numerical experiments are shown that demonstrate that the proposed algorithms work better than both the JPEG deblocking recommendation and our previous projection-based image decoding approach .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding (transform coding) ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	PROJECTION-BASED SPATIALLY ADAPTIVE RECONSTRUCTION OF BLOCK-TRANSFORM COMPRESSED IMAGES . At the present time , block-transform coding (transform coding) is probably the most popular approach for image compression , For this approach , the compressed images are decoded using only the transmitted transform data , In this paper , we formulate image decoding as an image recovery problem , According to this approach , the decoded image is reconstructed using not only the transmitted data but , in addition , the prior knowledge that images before compression do not display between-block discontinuities . A spatially adaptive image recovery algorithm is proposed based on the theory of projections onto convex sets . Apart from the data constraint set , this algorithm uses another new constraint set that enforces between-block smoothness , The novelty of this set is that it captures both the local statistical properties of the image and the human perceptual characteristics , A simplified spatially adaptive recovery algorithm is also proposed , and the analysis of its computational complexity Is presented , Numerical experiments are shown that demonstrate that the proposed algorithms work better than both the JPEG deblocking recommendation and our previous projection-based image decoding approach .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding (transform coding) in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	PROJECTION-BASED SPATIALLY ADAPTIVE RECONSTRUCTION OF BLOCK-TRANSFORM COMPRESSED IMAGES . At the present time , block-transform coding (transform coding) is probably the most popular approach for image compression , For this approach , the compressed images are decoded using only the transmitted transform data , In this paper , we formulate image decoding as an image recovery problem , According to this approach , the decoded image is reconstructed using not only the transmitted data but , in addition , the prior knowledge that images before compression do not display between-block discontinuities . A spatially adaptive image recovery algorithm is proposed based on the theory of projections onto convex sets . Apart from the data constraint set , this algorithm uses another new constraint set that enforces between-block smoothness , The novelty of this set is that it captures both the local statistical properties of the image and the human perceptual characteristics , A simplified spatially adaptive recovery algorithm is also proposed , and the analysis of its computational complexity Is presented , Numerical experiments are shown that demonstrate that the proposed algorithms work better than both the JPEG deblocking recommendation and our previous projection-based image decoding approach .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding (transform coding) in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	PROJECTION-BASED SPATIALLY ADAPTIVE RECONSTRUCTION OF BLOCK-TRANSFORM COMPRESSED IMAGES . At the present time , block-transform coding (transform coding) is probably the most popular approach for image compression , For this approach , the compressed images are decoded using only the transmitted transform data , In this paper , we formulate image decoding as an image recovery problem , According to this approach , the decoded image is reconstructed using not only the transmitted data but , in addition , the prior knowledge that images before compression do not display between-block discontinuities . A spatially adaptive image recovery algorithm is proposed based on the theory of projections onto convex sets . Apart from the data constraint set , this algorithm uses another new constraint set that enforces between-block smoothness , The novelty of this set is that it captures both the local statistical properties of the image and the human perceptual characteristics , A simplified spatially adaptive recovery algorithm is also proposed , and the analysis of its computational complexity Is presented , Numerical experiments are shown that demonstrate that the proposed algorithms work better than both the JPEG deblocking recommendation and our previous projection-based image decoding approach .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	SIGNAL PROCESSING-IMAGE COMMUNICATION. 7 (4-6): 581-592 NOV 1995 Publication Year: 1995 MOTION-COMPENSATED WAVELET TRANSFORM CODER FOR VERY-LOW BIT-RATE VISUAL TELEPHONY Seoul National University Yang, Lee, Lee
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy (input vectors) level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	MOTION-COMPENSATED WAVELET TRANSFORM CODER FOR VERY-LOW BIT-RATE VISUAL TELEPHONY . This paper proposes a new motion-compensated wavelet transform video coder for very low bit-rate visual telephony . The proposed coder sequentially employs : (1) selective motion estimation on the wavelet transform domain , (2) motion-compensated prediction (MCP) of wavelet coefficients , and (3) selective entropy-constrained vector quantization (ECVQ) of the resultant MCP errors . The selective schemes in motion estimation and in quantization , which efficiently exploit the characteristic of image sequences in a visual telephony , considerably reduce the computational burden . The coder also employs a tree structure encoding to represent efficiently which blocks were encoded . In addition , in order to reduce the number of ECVQ codebooks and the image dependency of their performance , we introduce a preprocessing of signals which normalizes input vectors (maximum hierarchy) of ECVQ . Simulation results show that our video coder provides good PSNR (peak-to-peak signal-to-noise ratio) performance and efficient rate control .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy (input vectors) level is reached .	MOTION-COMPENSATED WAVELET TRANSFORM CODER FOR VERY-LOW BIT-RATE VISUAL TELEPHONY . This paper proposes a new motion-compensated wavelet transform video coder for very low bit-rate visual telephony . The proposed coder sequentially employs : (1) selective motion estimation on the wavelet transform domain , (2) motion-compensated prediction (MCP) of wavelet coefficients , and (3) selective entropy-constrained vector quantization (ECVQ) of the resultant MCP errors . The selective schemes in motion estimation and in quantization , which efficiently exploit the characteristic of image sequences in a visual telephony , considerably reduce the computational burden . The coder also employs a tree structure encoding to represent efficiently which blocks were encoded . In addition , in order to reduce the number of ECVQ codebooks and the image dependency of their performance , we introduce a preprocessing of signals which normalizes input vectors (maximum hierarchy) of ECVQ . Simulation results show that our video coder provides good PSNR (peak-to-peak signal-to-noise ratio) performance and efficient rate control .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy (input vectors) level from the data stream .	MOTION-COMPENSATED WAVELET TRANSFORM CODER FOR VERY-LOW BIT-RATE VISUAL TELEPHONY . This paper proposes a new motion-compensated wavelet transform video coder for very low bit-rate visual telephony . The proposed coder sequentially employs : (1) selective motion estimation on the wavelet transform domain , (2) motion-compensated prediction (MCP) of wavelet coefficients , and (3) selective entropy-constrained vector quantization (ECVQ) of the resultant MCP errors . The selective schemes in motion estimation and in quantization , which efficiently exploit the characteristic of image sequences in a visual telephony , considerably reduce the computational burden . The coder also employs a tree structure encoding to represent efficiently which blocks were encoded . In addition , in order to reduce the number of ECVQ codebooks and the image dependency of their performance , we introduce a preprocessing of signals which normalizes input vectors (maximum hierarchy) of ECVQ . Simulation results show that our video coder provides good PSNR (peak-to-peak signal-to-noise ratio) performance and efficient rate control .
US10250913B2 CLAIM 11 . The decoder according to claim 1 , wherein the recursive multi-tree partitioning includes a quadtree partitioning (tree structure) technique .	MOTION-COMPENSATED WAVELET TRANSFORM CODER FOR VERY-LOW BIT-RATE VISUAL TELEPHONY . This paper proposes a new motion-compensated wavelet transform video coder for very low bit-rate visual telephony . The proposed coder sequentially employs : (1) selective motion estimation on the wavelet transform domain , (2) motion-compensated prediction (MCP) of wavelet coefficients , and (3) selective entropy-constrained vector quantization (ECVQ) of the resultant MCP errors . The selective schemes in motion estimation and in quantization , which efficiently exploit the characteristic of image sequences in a visual telephony , considerably reduce the computational burden . The coder also employs a tree structure (quadtree partitioning) encoding to represent efficiently which blocks were encoded . In addition , in order to reduce the number of ECVQ codebooks and the image dependency of their performance , we introduce a preprocessing of signals which normalizes input vectors of ECVQ . Simulation results show that our video coder provides good PSNR (peak-to-peak signal-to-noise ratio) performance and efficient rate control .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy (input vectors) level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	MOTION-COMPENSATED WAVELET TRANSFORM CODER FOR VERY-LOW BIT-RATE VISUAL TELEPHONY . This paper proposes a new motion-compensated wavelet transform video coder for very low bit-rate visual telephony . The proposed coder sequentially employs : (1) selective motion estimation on the wavelet transform domain , (2) motion-compensated prediction (MCP) of wavelet coefficients , and (3) selective entropy-constrained vector quantization (ECVQ) of the resultant MCP errors . The selective schemes in motion estimation and in quantization , which efficiently exploit the characteristic of image sequences in a visual telephony , considerably reduce the computational burden . The coder also employs a tree structure encoding to represent efficiently which blocks were encoded . In addition , in order to reduce the number of ECVQ codebooks and the image dependency of their performance , we introduce a preprocessing of signals which normalizes input vectors (maximum hierarchy) of ECVQ . Simulation results show that our video coder provides good PSNR (peak-to-peak signal-to-noise ratio) performance and efficient rate control .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy (input vectors) level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	MOTION-COMPENSATED WAVELET TRANSFORM CODER FOR VERY-LOW BIT-RATE VISUAL TELEPHONY . This paper proposes a new motion-compensated wavelet transform video coder for very low bit-rate visual telephony . The proposed coder sequentially employs : (1) selective motion estimation on the wavelet transform domain , (2) motion-compensated prediction (MCP) of wavelet coefficients , and (3) selective entropy-constrained vector quantization (ECVQ) of the resultant MCP errors . The selective schemes in motion estimation and in quantization , which efficiently exploit the characteristic of image sequences in a visual telephony , considerably reduce the computational burden . The coder also employs a tree structure encoding to represent efficiently which blocks were encoded . In addition , in order to reduce the number of ECVQ codebooks and the image dependency of their performance , we introduce a preprocessing of signals which normalizes input vectors (maximum hierarchy) of ECVQ . Simulation results show that our video coder provides good PSNR (peak-to-peak signal-to-noise ratio) performance and efficient rate control .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy (input vectors) level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	MOTION-COMPENSATED WAVELET TRANSFORM CODER FOR VERY-LOW BIT-RATE VISUAL TELEPHONY . This paper proposes a new motion-compensated wavelet transform video coder for very low bit-rate visual telephony . The proposed coder sequentially employs : (1) selective motion estimation on the wavelet transform domain , (2) motion-compensated prediction (MCP) of wavelet coefficients , and (3) selective entropy-constrained vector quantization (ECVQ) of the resultant MCP errors . The selective schemes in motion estimation and in quantization , which efficiently exploit the characteristic of image sequences in a visual telephony , considerably reduce the computational burden . The coder also employs a tree structure encoding to represent efficiently which blocks were encoded . In addition , in order to reduce the number of ECVQ codebooks and the image dependency of their performance , we introduce a preprocessing of signals which normalizes input vectors (maximum hierarchy) of ECVQ . Simulation results show that our video coder provides good PSNR (peak-to-peak signal-to-noise ratio) performance and efficient rate control .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	JOURNAL OF VLSI SIGNAL PROCESSING. 7 (1-2): 7-16 FEB 1994 Publication Year: 1994 SELF-TIMED LOGIC USING CURRENT-SENSING COMPLETION DETECTION (CSCD) Stanford University Dean, Dill, Horowitz
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream (data stream) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	SELF-TIMED LOGIC USING CURRENT-SENSING COMPLETION DETECTION (CSCD) . This article proposes a completion-detection method for efficiently implementing Boolean functions as self-timed logic structures . Current-Sensing Completion Detection , CSCD , allows self-timed circuits to be designed using single-rail variable encoding (one signal wire per logic variable) and implemented in about the same silicon area as an equivalent synchronous implementation . Compared to dual-rail encoding methods , CSCD can reduce the number of signal wires and transistors used by approximately 50% . CSCD implementations improved performance over equivalent dual-rail designs because of : (1) reduced parasitic capacitance , (2) removal of spacer tokens in the data stream (data stream) , and (3) computation state similarity of consecutive data variables . Several CSCD configurations are described and evaluated and transistor-level implementations are provided for comparison .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level from the data stream (data stream) .	SELF-TIMED LOGIC USING CURRENT-SENSING COMPLETION DETECTION (CSCD) . This article proposes a completion-detection method for efficiently implementing Boolean functions as self-timed logic structures . Current-Sensing Completion Detection , CSCD , allows self-timed circuits to be designed using single-rail variable encoding (one signal wire per logic variable) and implemented in about the same silicon area as an equivalent synchronous implementation . Compared to dual-rail encoding methods , CSCD can reduce the number of signal wires and transistors used by approximately 50% . CSCD implementations improved performance over equivalent dual-rail designs because of : (1) reduced parasitic capacitance , (2) removal of spacer tokens in the data stream (data stream) , and (3) computation state similarity of consecutive data variables . Several CSCD configurations are described and evaluated and transistor-level implementations are provided for comparison .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements associated with the first or second set of sub-regions from the data stream (data stream) in a depth-first traversal order .	SELF-TIMED LOGIC USING CURRENT-SENSING COMPLETION DETECTION (CSCD) . This article proposes a completion-detection method for efficiently implementing Boolean functions as self-timed logic structures . Current-Sensing Completion Detection , CSCD , allows self-timed circuits to be designed using single-rail variable encoding (one signal wire per logic variable) and implemented in about the same silicon area as an equivalent synchronous implementation . Compared to dual-rail encoding methods , CSCD can reduce the number of signal wires and transistors used by approximately 50% . CSCD implementations improved performance over equivalent dual-rail designs because of : (1) reduced parasitic capacitance , (2) removal of spacer tokens in the data stream (data stream) , and (3) computation state similarity of consecutive data variables . Several CSCD configurations are described and evaluated and transistor-level implementations are provided for comparison .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream (data stream) , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	SELF-TIMED LOGIC USING CURRENT-SENSING COMPLETION DETECTION (CSCD) . This article proposes a completion-detection method for efficiently implementing Boolean functions as self-timed logic structures . Current-Sensing Completion Detection , CSCD , allows self-timed circuits to be designed using single-rail variable encoding (one signal wire per logic variable) and implemented in about the same silicon area as an equivalent synchronous implementation . Compared to dual-rail encoding methods , CSCD can reduce the number of signal wires and transistors used by approximately 50% . CSCD implementations improved performance over equivalent dual-rail designs because of : (1) reduced parasitic capacitance , (2) removal of spacer tokens in the data stream (data stream) , and (3) computation state similarity of consecutive data variables . Several CSCD configurations are described and evaluated and transistor-level implementations are provided for comparison .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream (data stream) , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	SELF-TIMED LOGIC USING CURRENT-SENSING COMPLETION DETECTION (CSCD) . This article proposes a completion-detection method for efficiently implementing Boolean functions as self-timed logic structures . Current-Sensing Completion Detection , CSCD , allows self-timed circuits to be designed using single-rail variable encoding (one signal wire per logic variable) and implemented in about the same silicon area as an equivalent synchronous implementation . Compared to dual-rail encoding methods , CSCD can reduce the number of signal wires and transistors used by approximately 50% . CSCD implementations improved performance over equivalent dual-rail designs because of : (1) reduced parasitic capacitance , (2) removal of spacer tokens in the data stream (data stream) , and (3) computation state similarity of consecutive data variables . Several CSCD configurations are described and evaluated and transistor-level implementations are provided for comparison .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream (data stream) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	SELF-TIMED LOGIC USING CURRENT-SENSING COMPLETION DETECTION (CSCD) . This article proposes a completion-detection method for efficiently implementing Boolean functions as self-timed logic structures . Current-Sensing Completion Detection , CSCD , allows self-timed circuits to be designed using single-rail variable encoding (one signal wire per logic variable) and implemented in about the same silicon area as an equivalent synchronous implementation . Compared to dual-rail encoding methods , CSCD can reduce the number of signal wires and transistors used by approximately 50% . CSCD implementations improved performance over equivalent dual-rail designs because of : (1) reduced parasitic capacitance , (2) removal of spacer tokens in the data stream (data stream) , and (3) computation state similarity of consecutive data variables . Several CSCD configurations are described and evaluated and transistor-level implementations are provided for comparison .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream (data stream) generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	SELF-TIMED LOGIC USING CURRENT-SENSING COMPLETION DETECTION (CSCD) . This article proposes a completion-detection method for efficiently implementing Boolean functions as self-timed logic structures . Current-Sensing Completion Detection , CSCD , allows self-timed circuits to be designed using single-rail variable encoding (one signal wire per logic variable) and implemented in about the same silicon area as an equivalent synchronous implementation . Compared to dual-rail encoding methods , CSCD can reduce the number of signal wires and transistors used by approximately 50% . CSCD implementations improved performance over equivalent dual-rail designs because of : (1) reduced parasitic capacitance , (2) removal of spacer tokens in the data stream (data stream) , and (3) computation state similarity of consecutive data variables . Several CSCD configurations are described and evaluated and transistor-level implementations are provided for comparison .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream (data stream) the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	SELF-TIMED LOGIC USING CURRENT-SENSING COMPLETION DETECTION (CSCD) . This article proposes a completion-detection method for efficiently implementing Boolean functions as self-timed logic structures . Current-Sensing Completion Detection , CSCD , allows self-timed circuits to be designed using single-rail variable encoding (one signal wire per logic variable) and implemented in about the same silicon area as an equivalent synchronous implementation . Compared to dual-rail encoding methods , CSCD can reduce the number of signal wires and transistors used by approximately 50% . CSCD implementations improved performance over equivalent dual-rail designs because of : (1) reduced parasitic capacitance , (2) removal of spacer tokens in the data stream (data stream) , and (3) computation state similarity of consecutive data variables . Several CSCD configurations are described and evaluated and transistor-level implementations are provided for comparison .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	PROCEEDINGS OF THE IEEE. 81 (9): 1326-1341 SEP 1993 Publication Year: 1993 USING VECTOR QUANTIZATION FOR IMAGE-PROCESSING University of Washington, Stanford University Cosman, Oehler, Riskin, Gray
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set of root regions such that the first set of root regions are rectangular blocks (image processing operation) of a size determined by the first maximum region size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	USING VECTOR QUANTIZATION FOR IMAGE-PROCESSING . Image compression is the process of reducing the number of bits required to represent an image . Vector quantization , the mapping of pixel intensity vectors into binary vectors indexing a limited number of possible reproductions , is a popular image compression algorithm . Compression has traditionally been done with little regard for image processing operation (rectangular blocks) s that may precede or follow the compression step . Recent work has used vector quantization both to simplify image processing tasks-such as enhancement , classification , halftoning , and edge detection-and to reduce the computational complexity by performing them simultaneously with the compression . After briefly reviewing the fundamental ideas of vector quantization , we present a survey of vector quantization algorithms that perform image processing .

US10250913B2

Filed: 2010-04-13 Issued: 2019-04-02

Coding of a spatial sampling of a two-dimensional information signal using sub-division

(Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC

Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand

PROCEEDINGS OF THE IEEE. 81 (9): 1326-1341 SEP 1993

Publication Year: 1993

USING VECTOR QUANTIZATION FOR IMAGE-PROCESSING

University of Washington, Stanford University

Cosman, Oehler, Riskin, Gray

US10250913B2
CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set of root regions such that the first set of root regions are rectangular blocks (image processing operation) of a size determined by the first maximum region size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .

USING VECTOR QUANTIZATION FOR IMAGE-PROCESSING . Image compression is the process of reducing the number of bits required to represent an image . Vector quantization , the mapping of pixel intensity vectors into binary vectors indexing a limited number of possible reproductions , is a popular image compression algorithm . Compression has traditionally been done with little regard for image processing operation (rectangular blocks) s that may precede or follow the compression step . Recent work has used vector quantization both to simplify image processing tasks-such as enhancement , classification , halftoning , and edge detection-and to reduce the computational complexity by performing them simultaneously with the compression . After briefly reviewing the fundamental ideas of vector quantization , we present a survey of vector quantization algorithms that perform image processing .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	IEEE TRANSACTIONS ON IMAGE PROCESSING. 1 (4): 477-487 OCT 1992 Publication Year: 1992 Prioritized DCT For Compression And Progressive Transmission Of Images Audio Digital Imaging Inc Huang, Dreizen, Galatsanos
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (entropy coding) information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	Prioritized DCT For Compression And Progressive Transmission Of Images . In this paper a new approach based on the block discrete cosine transform (DCT) for compression and progressive transmission of images is presented . The novelty of this approach is that the transform coefficients of all image blocks are coded and transmitted in absolute magnitude order . The resulting ordered-by-magnitude transmission is accomplished without sacrificing coding efficiency by using partition priority coding (PPC a new source coding method that allows the transmission of an ordered data source without coding overhead due to prioritization . Using this approach , coding and transmission are adaptive to the characteristics of each individual image , and therefore , very efficient . Another advantage of this approach is its high progression effectiveness . Since the largest transform coefficients that capture the most important characteristics of images are coded and transmitted first , this method is well suited for progressive image transmission (PIT) . Further compression of the image data is achieved by utilizing multiple distribution entropy coding (second subdivision, intermediate subdivision) (MDEC . MDEC is a new coding technique based on arithmetic coding . Experiments are presented where the new DCT approach was tested . It is shown that it compares favorably with previously reported DCT and subband image codecs and is also very effective for PIT .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level (discrete cosine transform) according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	Prioritized DCT For Compression And Progressive Transmission Of Images . In this paper a new approach based on the block discrete cosine transform (first hierarchy level) (DCT) for compression and progressive transmission of images is presented . The novelty of this approach is that the transform coefficients of all image blocks are coded and transmitted in absolute magnitude order . The resulting ordered-by-magnitude transmission is accomplished without sacrificing coding efficiency by using partition priority coding (PPC a new source coding method that allows the transmission of an ordered data source without coding overhead due to prioritization . Using this approach , coding and transmission are adaptive to the characteristics of each individual image , and therefore , very efficient . Another advantage of this approach is its high progression effectiveness . Since the largest transform coefficients that capture the most important characteristics of images are coded and transmitted first , this method is well suited for progressive image transmission (PIT) . Further compression of the image data is achieved by utilizing multiple distribution entropy coding (MDEC . MDEC is a new coding technique based on arithmetic coding . Experiments are presented where the new DCT approach was tested . It is shown that it compares favorably with previously reported DCT and subband image codecs and is also very effective for PIT .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision (entropy coding) of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	Prioritized DCT For Compression And Progressive Transmission Of Images . In this paper a new approach based on the block discrete cosine transform (DCT) for compression and progressive transmission of images is presented . The novelty of this approach is that the transform coefficients of all image blocks are coded and transmitted in absolute magnitude order . The resulting ordered-by-magnitude transmission is accomplished without sacrificing coding efficiency by using partition priority coding (PPC a new source coding method that allows the transmission of an ordered data source without coding overhead due to prioritization . Using this approach , coding and transmission are adaptive to the characteristics of each individual image , and therefore , very efficient . Another advantage of this approach is its high progression effectiveness . Since the largest transform coefficients that capture the most important characteristics of images are coded and transmitted first , this method is well suited for progressive image transmission (PIT) . Further compression of the image data is achieved by utilizing multiple distribution entropy coding (second subdivision, intermediate subdivision) (MDEC . MDEC is a new coding technique based on arithmetic coding . Experiments are presented where the new DCT approach was tested . It is shown that it compares favorably with previously reported DCT and subband image codecs and is also very effective for PIT .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (entropy coding) information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	Prioritized DCT For Compression And Progressive Transmission Of Images . In this paper a new approach based on the block discrete cosine transform (DCT) for compression and progressive transmission of images is presented . The novelty of this approach is that the transform coefficients of all image blocks are coded and transmitted in absolute magnitude order . The resulting ordered-by-magnitude transmission is accomplished without sacrificing coding efficiency by using partition priority coding (PPC a new source coding method that allows the transmission of an ordered data source without coding overhead due to prioritization . Using this approach , coding and transmission are adaptive to the characteristics of each individual image , and therefore , very efficient . Another advantage of this approach is its high progression effectiveness . Since the largest transform coefficients that capture the most important characteristics of images are coded and transmitted first , this method is well suited for progressive image transmission (PIT) . Further compression of the image data is achieved by utilizing multiple distribution entropy coding (second subdivision, intermediate subdivision) (MDEC . MDEC is a new coding technique based on arithmetic coding . Experiments are presented where the new DCT approach was tested . It is shown that it compares favorably with previously reported DCT and subband image codecs and is also very effective for PIT .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (entropy coding) information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	Prioritized DCT For Compression And Progressive Transmission Of Images . In this paper a new approach based on the block discrete cosine transform (DCT) for compression and progressive transmission of images is presented . The novelty of this approach is that the transform coefficients of all image blocks are coded and transmitted in absolute magnitude order . The resulting ordered-by-magnitude transmission is accomplished without sacrificing coding efficiency by using partition priority coding (PPC a new source coding method that allows the transmission of an ordered data source without coding overhead due to prioritization . Using this approach , coding and transmission are adaptive to the characteristics of each individual image , and therefore , very efficient . Another advantage of this approach is its high progression effectiveness . Since the largest transform coefficients that capture the most important characteristics of images are coded and transmitted first , this method is well suited for progressive image transmission (PIT) . Further compression of the image data is achieved by utilizing multiple distribution entropy coding (second subdivision, intermediate subdivision) (MDEC . MDEC is a new coding technique based on arithmetic coding . Experiments are presented where the new DCT approach was tested . It is shown that it compares favorably with previously reported DCT and subband image codecs and is also very effective for PIT .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (entropy coding) information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	Prioritized DCT For Compression And Progressive Transmission Of Images . In this paper a new approach based on the block discrete cosine transform (DCT) for compression and progressive transmission of images is presented . The novelty of this approach is that the transform coefficients of all image blocks are coded and transmitted in absolute magnitude order . The resulting ordered-by-magnitude transmission is accomplished without sacrificing coding efficiency by using partition priority coding (PPC a new source coding method that allows the transmission of an ordered data source without coding overhead due to prioritization . Using this approach , coding and transmission are adaptive to the characteristics of each individual image , and therefore , very efficient . Another advantage of this approach is its high progression effectiveness . Since the largest transform coefficients that capture the most important characteristics of images are coded and transmitted first , this method is well suited for progressive image transmission (PIT) . Further compression of the image data is achieved by utilizing multiple distribution entropy coding (second subdivision, intermediate subdivision) (MDEC . MDEC is a new coding technique based on arithmetic coding . Experiments are presented where the new DCT approach was tested . It is shown that it compares favorably with previously reported DCT and subband image codecs and is also very effective for PIT .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	IEEE TRANSACTIONS ON CONSUMER ELECTRONICS. 38 (3): 325-340 AUG 1992 Publication Year: 1992 A CODEC FOR HDTV AT&T Bell Labs Netravali, Petajan, Knauer, Faryar, Kustka, Matthews, Safranek
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding (transform coding) ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	A CODEC FOR HDTV . A high quality digital video codec has been developed for the Zenith/AT& ; T HDTV system which adaptively selects between two transmission modes with differing rates and robustness . The codec works on an image progressively scanned with 1575 scan lines every 1/30th of a second and achieves a compression ratio of approximately 50 to 1 . The high compression ratio facilitates robust transmission of the compressed HDTV signal within an NTSC taboo channel Transparent image quality is achieved using motion compensated transform coding (transform coding) coupled with a perceptual criterion to determine the quantization accuracy required for each transform coefficient . The codec has been designed to minimize complexity and memory in the receiver .
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal based on an intra-prediction mode (transmission modes) associated with the sub-region and reconstructed samples of a neighboring subset of the second set of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	A CODEC FOR HDTV . A high quality digital video codec has been developed for the Zenith/AT& ; T HDTV system which adaptively selects between two transmission modes (intra-prediction mode) with differing rates and robustness . The codec works on an image progressively scanned with 1575 scan lines every 1/30th of a second and achieves a compression ratio of approximately 50 to 1 . The high compression ratio facilitates robust transmission of the compressed HDTV signal within an NTSC taboo channel Transparent image quality is achieved using motion compensated transform coding coupled with a perceptual criterion to determine the quantization accuracy required for each transform coefficient . The codec has been designed to minimize complexity and memory in the receiver .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding (transform coding) to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	A CODEC FOR HDTV . A high quality digital video codec has been developed for the Zenith/AT& ; T HDTV system which adaptively selects between two transmission modes with differing rates and robustness . The codec works on an image progressively scanned with 1575 scan lines every 1/30th of a second and achieves a compression ratio of approximately 50 to 1 . The high compression ratio facilitates robust transmission of the compressed HDTV signal within an NTSC taboo channel Transparent image quality is achieved using motion compensated transform coding (transform coding) coupled with a perceptual criterion to determine the quantization accuracy required for each transform coefficient . The codec has been designed to minimize complexity and memory in the receiver .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding (transform coding) ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	A CODEC FOR HDTV . A high quality digital video codec has been developed for the Zenith/AT& ; T HDTV system which adaptively selects between two transmission modes with differing rates and robustness . The codec works on an image progressively scanned with 1575 scan lines every 1/30th of a second and achieves a compression ratio of approximately 50 to 1 . The high compression ratio facilitates robust transmission of the compressed HDTV signal within an NTSC taboo channel Transparent image quality is achieved using motion compensated transform coding (transform coding) coupled with a perceptual criterion to determine the quantization accuracy required for each transform coefficient . The codec has been designed to minimize complexity and memory in the receiver .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding (transform coding) in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	A CODEC FOR HDTV . A high quality digital video codec has been developed for the Zenith/AT& ; T HDTV system which adaptively selects between two transmission modes with differing rates and robustness . The codec works on an image progressively scanned with 1575 scan lines every 1/30th of a second and achieves a compression ratio of approximately 50 to 1 . The high compression ratio facilitates robust transmission of the compressed HDTV signal within an NTSC taboo channel Transparent image quality is achieved using motion compensated transform coding (transform coding) coupled with a perceptual criterion to determine the quantization accuracy required for each transform coefficient . The codec has been designed to minimize complexity and memory in the receiver .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding (transform coding) in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	A CODEC FOR HDTV . A high quality digital video codec has been developed for the Zenith/AT& ; T HDTV system which adaptively selects between two transmission modes with differing rates and robustness . The codec works on an image progressively scanned with 1575 scan lines every 1/30th of a second and achieves a compression ratio of approximately 50 to 1 . The high compression ratio facilitates robust transmission of the compressed HDTV signal within an NTSC taboo channel Transparent image quality is achieved using motion compensated transform coding (transform coding) coupled with a perceptual criterion to determine the quantization accuracy required for each transform coefficient . The codec has been designed to minimize complexity and memory in the receiver .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY. 1 (1): 147-155 MAR 1991 Publication Year: 1991 An Entropy Coding System For Digital HDTV Applications Bellcore (Bell Communications Research), University of Washington Lei, Sun
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (entropy coding) information (parallel process) , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information (parallel process) are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	An Entropy Coding System For Digital HDTV Applications . Run-length coding (RLC) and variable-length coding (VLC) are widely used techniques for lossless data compression A high-speed entropy coding (second subdivision, intermediate subdivision) system using these two techniques is considered for digital high definition television (HDTV) applications . Traditionally , VLC decoding is Implemented through a tree-searching algorithm as the Input bits are received serially . For HDTV applications , it is very difficult to Implement a real-time VLC decoder of this kind due to the very high data rate required . In this paper , we introduce a parallel structured VLC decoder which decodes each codeword in one dock cycle regardless of its length . The required dock rate of the decoder is thus lower and parallel process (second subdivision information, first subdivision information) ing architectures become easy to adopt in the entropy coding system . The parallel entropy coder and decoder will be Implemented in two experimental prototype chips which are designed to encode and decode more than 52 million samples/s . Some related system Issues , such as the synchronization of variable-length codewords and error concealment , are also discussed In this paper .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information (parallel process) indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	An Entropy Coding System For Digital HDTV Applications . Run-length coding (RLC) and variable-length coding (VLC) are widely used techniques for lossless data compression A high-speed entropy coding system using these two techniques is considered for digital high definition television (HDTV) applications . Traditionally , VLC decoding is Implemented through a tree-searching algorithm as the Input bits are received serially . For HDTV applications , it is very difficult to Implement a real-time VLC decoder of this kind due to the very high data rate required . In this paper , we introduce a parallel structured VLC decoder which decodes each codeword in one dock cycle regardless of its length . The required dock rate of the decoder is thus lower and parallel process (second subdivision information, first subdivision information) ing architectures become easy to adopt in the entropy coding system . The parallel entropy coder and decoder will be Implemented in two experimental prototype chips which are designed to encode and decode more than 52 million samples/s . Some related system Issues , such as the synchronization of variable-length codewords and error concealment , are also discussed In this paper .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision information (parallel process) includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level is sub-divided .	An Entropy Coding System For Digital HDTV Applications . Run-length coding (RLC) and variable-length coding (VLC) are widely used techniques for lossless data compression A high-speed entropy coding system using these two techniques is considered for digital high definition television (HDTV) applications . Traditionally , VLC decoding is Implemented through a tree-searching algorithm as the Input bits are received serially . For HDTV applications , it is very difficult to Implement a real-time VLC decoder of this kind due to the very high data rate required . In this paper , we introduce a parallel structured VLC decoder which decodes each codeword in one dock cycle regardless of its length . The required dock rate of the decoder is thus lower and parallel process (second subdivision information, first subdivision information) ing architectures become easy to adopt in the entropy coding system . The parallel entropy coder and decoder will be Implemented in two experimental prototype chips which are designed to encode and decode more than 52 million samples/s . Some related system Issues , such as the synchronization of variable-length codewords and error concealment , are also discussed In this paper .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision information (parallel process) , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision (entropy coding) of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	An Entropy Coding System For Digital HDTV Applications . Run-length coding (RLC) and variable-length coding (VLC) are widely used techniques for lossless data compression A high-speed entropy coding (second subdivision, intermediate subdivision) system using these two techniques is considered for digital high definition television (HDTV) applications . Traditionally , VLC decoding is Implemented through a tree-searching algorithm as the Input bits are received serially . For HDTV applications , it is very difficult to Implement a real-time VLC decoder of this kind due to the very high data rate required . In this paper , we introduce a parallel structured VLC decoder which decodes each codeword in one dock cycle regardless of its length . The required dock rate of the decoder is thus lower and parallel process (second subdivision information, first subdivision information) ing architectures become easy to adopt in the entropy coding system . The parallel entropy coder and decoder will be Implemented in two experimental prototype chips which are designed to encode and decode more than 52 million samples/s . Some related system Issues , such as the synchronization of variable-length codewords and error concealment , are also discussed In this paper .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (entropy coding) information (parallel process) , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information (parallel process) are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	An Entropy Coding System For Digital HDTV Applications . Run-length coding (RLC) and variable-length coding (VLC) are widely used techniques for lossless data compression A high-speed entropy coding (second subdivision, intermediate subdivision) system using these two techniques is considered for digital high definition television (HDTV) applications . Traditionally , VLC decoding is Implemented through a tree-searching algorithm as the Input bits are received serially . For HDTV applications , it is very difficult to Implement a real-time VLC decoder of this kind due to the very high data rate required . In this paper , we introduce a parallel structured VLC decoder which decodes each codeword in one dock cycle regardless of its length . The required dock rate of the decoder is thus lower and parallel process (second subdivision information, first subdivision information) ing architectures become easy to adopt in the entropy coding system . The parallel entropy coder and decoder will be Implemented in two experimental prototype chips which are designed to encode and decode more than 52 million samples/s . Some related system Issues , such as the synchronization of variable-length codewords and error concealment , are also discussed In this paper .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information (parallel process) , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (entropy coding) information (parallel process) and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	An Entropy Coding System For Digital HDTV Applications . Run-length coding (RLC) and variable-length coding (VLC) are widely used techniques for lossless data compression A high-speed entropy coding (second subdivision, intermediate subdivision) system using these two techniques is considered for digital high definition television (HDTV) applications . Traditionally , VLC decoding is Implemented through a tree-searching algorithm as the Input bits are received serially . For HDTV applications , it is very difficult to Implement a real-time VLC decoder of this kind due to the very high data rate required . In this paper , we introduce a parallel structured VLC decoder which decodes each codeword in one dock cycle regardless of its length . The required dock rate of the decoder is thus lower and parallel process (second subdivision information, first subdivision information) ing architectures become easy to adopt in the entropy coding system . The parallel entropy coder and decoder will be Implemented in two experimental prototype chips which are designed to encode and decode more than 52 million samples/s . Some related system Issues , such as the synchronization of variable-length codewords and error concealment , are also discussed In this paper .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information (parallel process) ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (entropy coding) information (parallel process) and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	An Entropy Coding System For Digital HDTV Applications . Run-length coding (RLC) and variable-length coding (VLC) are widely used techniques for lossless data compression A high-speed entropy coding (second subdivision, intermediate subdivision) system using these two techniques is considered for digital high definition television (HDTV) applications . Traditionally , VLC decoding is Implemented through a tree-searching algorithm as the Input bits are received serially . For HDTV applications , it is very difficult to Implement a real-time VLC decoder of this kind due to the very high data rate required . In this paper , we introduce a parallel structured VLC decoder which decodes each codeword in one dock cycle regardless of its length . The required dock rate of the decoder is thus lower and parallel process (second subdivision information, first subdivision information) ing architectures become easy to adopt in the entropy coding system . The parallel entropy coder and decoder will be Implemented in two experimental prototype chips which are designed to encode and decode more than 52 million samples/s . Some related system Issues , such as the synchronization of variable-length codewords and error concealment , are also discussed In this paper .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20100061450A1 Filed: 2009-11-17 Issued: 2010-03-11 Method and apparatus for coding image information, method and apparatus for decoding image information, method and apparatus for coding and decoding image information, and system of coding and transmitting image information (Original Assignee) Sony Corp (Current Assignee) Sony Corp Kazushi Sato, Osamu Sunohara, Teruhiko Suzuki, Peter Kuhn, Yoichi Yagasaki, Kuniaki Takahashi
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information (block basis) , and a maximum hierarchy level wherein the first maximum region size and the first subdivision (default value) information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20100061450A1 CLAIM 1 . An image information encoding method for encoding image information in an image encoding apparatus , the method comprising : dividing an input image signal into blocks , performing , in a transform unit in the image encoding apparatus , an orthogonal transform on the blocks on a block-by-block basis (second subdivision information) , and quantizing , in a quantization unit in the image encoding apparatus , resultant orthogonal transform coefficients such that a quantization parameter is weighted by an addition operation that adds the weight by addition , and the quantization is performed on each chroma and luma component of the transform coefficients using said weighted quantization parameter , each said chroma and luma component being weighted by a different quantization parameter . US20100061450A1 CLAIM 3 . The image information encoding method according to claim 2 , wherein intraframe coding or interframe coding is selected for each of macroblocks and as default value (first subdivision) s of an array W(i , j) , an array W intra(i , j) is used for intraframe-coded macroblocks and an array W inter(i , j) for interframe-coded macroblocks .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision (default value) information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20100061450A1 CLAIM 3 . The image information encoding method according to claim 2 , wherein intraframe coding or interframe coding is selected for each of macroblocks and as default value (first subdivision) s of an array W(i , j) , an array W intra(i , j) is used for intraframe-coded macroblocks and an array W inter(i , j) for interframe-coded macroblocks .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision (default value) information includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level is sub-divided .	US20100061450A1 CLAIM 3 . The image information encoding method according to claim 2 , wherein intraframe coding or interframe coding is selected for each of macroblocks and as default value (first subdivision) s of an array W(i , j) , an array W intra(i , j) is used for intraframe-coded macroblocks and an array W inter(i , j) for interframe-coded macroblocks .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision (default value) information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20100061450A1 CLAIM 3 . The image information encoding method according to claim 2 , wherein intraframe coding or interframe coding is selected for each of macroblocks and as default value (first subdivision) s of an array W(i , j) , an array W intra(i , j) is used for intraframe-coded macroblocks and an array W inter(i , j) for interframe-coded macroblocks .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information (block basis) , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision (default value) information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20100061450A1 CLAIM 1 . An image information encoding method for encoding image information in an image encoding apparatus , the method comprising : dividing an input image signal into blocks , performing , in a transform unit in the image encoding apparatus , an orthogonal transform on the blocks on a block-by-block basis (second subdivision information) , and quantizing , in a quantization unit in the image encoding apparatus , resultant orthogonal transform coefficients such that a quantization parameter is weighted by an addition operation that adds the weight by addition , and the quantization is performed on each chroma and luma component of the transform coefficients using said weighted quantization parameter , each said chroma and luma component being weighted by a different quantization parameter . US20100061450A1 CLAIM 3 . The image information encoding method according to claim 2 , wherein intraframe coding or interframe coding is selected for each of macroblocks and as default value (first subdivision) s of an array W(i , j) , an array W intra(i , j) is used for intraframe-coded macroblocks and an array W inter(i , j) for interframe-coded macroblocks .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision (default value) information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information (block basis) and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20100061450A1 CLAIM 1 . An image information encoding method for encoding image information in an image encoding apparatus , the method comprising : dividing an input image signal into blocks , performing , in a transform unit in the image encoding apparatus , an orthogonal transform on the blocks on a block-by-block basis (second subdivision information) , and quantizing , in a quantization unit in the image encoding apparatus , resultant orthogonal transform coefficients such that a quantization parameter is weighted by an addition operation that adds the weight by addition , and the quantization is performed on each chroma and luma component of the transform coefficients using said weighted quantization parameter , each said chroma and luma component being weighted by a different quantization parameter . US20100061450A1 CLAIM 3 . The image information encoding method according to claim 2 , wherein intraframe coding or interframe coding is selected for each of macroblocks and as default value (first subdivision) s of an array W(i , j) , an array W intra(i , j) is used for intraframe-coded macroblocks and an array W inter(i , j) for interframe-coded macroblocks .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision (default value) information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information (block basis) and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20100061450A1 CLAIM 1 . An image information encoding method for encoding image information in an image encoding apparatus , the method comprising : dividing an input image signal into blocks , performing , in a transform unit in the image encoding apparatus , an orthogonal transform on the blocks on a block-by-block basis (second subdivision information) , and quantizing , in a quantization unit in the image encoding apparatus , resultant orthogonal transform coefficients such that a quantization parameter is weighted by an addition operation that adds the weight by addition , and the quantization is performed on each chroma and luma component of the transform coefficients using said weighted quantization parameter , each said chroma and luma component being weighted by a different quantization parameter . US20100061450A1 CLAIM 3 . The image information encoding method according to claim 2 , wherein intraframe coding or interframe coding is selected for each of macroblocks and as default value (first subdivision) s of an array W(i , j) , an array W intra(i , j) is used for intraframe-coded macroblocks and an array W inter(i , j) for interframe-coded macroblocks .
US10250913B2 CLAIM 15 . A non-transitory computer readable digital storage medium having stored thereon a computer program (computer program) having a program code for performing , when running on a computer , a method according to claim 12 .	US20100061450A1 CLAIM 9 . A computer readable storage medium encoded with a computer program (computer program) , which when executed by an image encoding apparatus causes the image encoding apparatus to implement an image information encoding method for encoding image information in an image encoding apparatus , the method comprising : dividing an input image signal into blocks , performing , in a transform unit in the image encoding apparatus , an orthogonal transform on the blocks on a block-by-block basis , and quantizing , in a quantization unit in the image encoding apparatus , resultant orthogonal transform coefficients such that a quantization parameter is weighted by an addition operation that adds the weight by addition , and the quantization is performed on each chroma and luma component of the transform coefficients using said weighted quantization parameter , each said chroma and luma component being weighted by a different quantization parameter .
US10250913B2 CLAIM 16 . A non-transitory computer readable digital storage medium having stored thereon a computer program (computer program) having a program code for performing , when running on a computer , a method according to claim 14 .	US20100061450A1 CLAIM 9 . A computer readable storage medium encoded with a computer program (computer program) , which when executed by an image encoding apparatus causes the image encoding apparatus to implement an image information encoding method for encoding image information in an image encoding apparatus , the method comprising : dividing an input image signal into blocks , performing , in a transform unit in the image encoding apparatus , an orthogonal transform on the blocks on a block-by-block basis , and quantizing , in a quantization unit in the image encoding apparatus , resultant orthogonal transform coefficients such that a quantization parameter is weighted by an addition operation that adds the weight by addition , and the quantization is performed on each chroma and luma component of the transform coefficients using said weighted quantization parameter , each said chroma and luma component being weighted by a different quantization parameter .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	WO2010039733A2 Filed: 2009-09-29 Issued: 2010-04-08 Video coding with large macroblocks (Original Assignee) Qualcomm Incorporated Peisong Chen, Yan Ye, Marta Karczewicz
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (video encoder) information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set (different one) of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	WO2010039733A2 CLAIM 1 . A method comprising : encoding , with a video encoder (second subdivision, second subset, second subdivision information) , a video block having a size of more than 16x16 pixels ; generating block-type syntax information that indicates the size of the block ; and generating a coded block pattern value for the encoded block , wherein the coded block pattern value indicates whether the encoded block includes at least one non-zero coefficient . WO2010039733A2 CLAIM 3 . The method of claim 1 , further comprising : when the encoded block does not include at least one non-zero coefficient , generating a single bit for the coded block pattern value and setting the value of the single bit to zero ; and when the encoded block includes at least one non-zero coefficient , generating a first bit of the coded block pattern value and setting the first bit to one , generating four partition bits for the coded block pattern value , each of the four partition bits corresponding to a different one (first set) of four equally-sized partitions of the encoded block , and setting the four partition bits to respective values representing whether the corresponding one of the four equally-sized partitions includes at least one non-zero coefficient .
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set (different one) of sub-regions : compute a prediction signal based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset of the second set of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	WO2010039733A2 CLAIM 3 . The method of claim 1 , further comprising : when the encoded block does not include at least one non-zero coefficient , generating a single bit for the coded block pattern value and setting the value of the single bit to zero ; and when the encoded block includes at least one non-zero coefficient , generating a first bit of the coded block pattern value and setting the first bit to one , generating four partition bits for the coded block pattern value , each of the four partition bits corresponding to a different one (first set) of four equally-sized partitions of the encoded block , and setting the four partition bits to respective values representing whether the corresponding one of the four equally-sized partitions includes at least one non-zero coefficient .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set (different one) of root regions such that the first set of root regions are rectangular blocks of a size determined by the first maximum region size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	WO2010039733A2 CLAIM 3 . The method of claim 1 , further comprising : when the encoded block does not include at least one non-zero coefficient , generating a single bit for the coded block pattern value and setting the value of the single bit to zero ; and when the encoded block includes at least one non-zero coefficient , generating a first bit of the coded block pattern value and setting the first bit to one , generating four partition bits for the coded block pattern value , each of the four partition bits corresponding to a different one (first set) of four equally-sized partitions of the encoded block , and setting the four partition bits to respective values representing whether the corresponding one of the four equally-sized partitions includes at least one non-zero coefficient .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set (different one) of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	WO2010039733A2 CLAIM 3 . The method of claim 1 , further comprising : when the encoded block does not include at least one non-zero coefficient , generating a single bit for the coded block pattern value and setting the value of the single bit to zero ; and when the encoded block includes at least one non-zero coefficient , generating a first bit of the coded block pattern value and setting the first bit to one , generating four partition bits for the coded block pattern value , each of the four partition bits corresponding to a different one (first set) of four equally-sized partitions of the encoded block , and setting the four partition bits to respective values representing whether the corresponding one of the four equally-sized partitions includes at least one non-zero coefficient .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision information includes a partition indication flag indicating whether any of the first set (different one) of root regions or the sub-regions at the first or higher-order hierarchy level is sub-divided .	WO2010039733A2 CLAIM 3 . The method of claim 1 , further comprising : when the encoded block does not include at least one non-zero coefficient , generating a single bit for the coded block pattern value and setting the value of the single bit to zero ; and when the encoded block includes at least one non-zero coefficient , generating a first bit of the coded block pattern value and setting the first bit to one , generating four partition bits for the coded block pattern value , each of the four partition bits corresponding to a different one (first set) of four equally-sized partitions of the encoded block , and setting the four partition bits to respective values representing whether the corresponding one of the four equally-sized partitions includes at least one non-zero coefficient .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset (video encoder) of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set (different one) of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	WO2010039733A2 CLAIM 1 . A method comprising : encoding , with a video encoder (second subdivision, second subset, second subdivision information) , a video block having a size of more than 16x16 pixels ; generating block-type syntax information that indicates the size of the block ; and generating a coded block pattern value for the encoded block , wherein the coded block pattern value indicates whether the encoded block includes at least one non-zero coefficient . WO2010039733A2 CLAIM 3 . The method of claim 1 , further comprising : when the encoded block does not include at least one non-zero coefficient , generating a single bit for the coded block pattern value and setting the value of the single bit to zero ; and when the encoded block includes at least one non-zero coefficient , generating a first bit of the coded block pattern value and setting the first bit to one , generating four partition bits for the coded block pattern value , each of the four partition bits corresponding to a different one (first set) of four equally-sized partitions of the encoded block , and setting the four partition bits to respective values representing whether the corresponding one of the four equally-sized partitions includes at least one non-zero coefficient .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (video encoder) information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set (different one) of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	WO2010039733A2 CLAIM 1 . A method comprising : encoding , with a video encoder (second subdivision, second subset, second subdivision information) , a video block having a size of more than 16x16 pixels ; generating block-type syntax information that indicates the size of the block ; and generating a coded block pattern value for the encoded block , wherein the coded block pattern value indicates whether the encoded block includes at least one non-zero coefficient . WO2010039733A2 CLAIM 3 . The method of claim 1 , further comprising : when the encoded block does not include at least one non-zero coefficient , generating a single bit for the coded block pattern value and setting the value of the single bit to zero ; and when the encoded block includes at least one non-zero coefficient , generating a first bit of the coded block pattern value and setting the first bit to one , generating four partition bits for the coded block pattern value , each of the four partition bits corresponding to a different one (first set) of four equally-sized partitions of the encoded block , and setting the four partition bits to respective values representing whether the corresponding one of the four equally-sized partitions includes at least one non-zero coefficient .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set (different one) of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (video encoder) information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	WO2010039733A2 CLAIM 1 . A method comprising : encoding , with a video encoder (second subdivision, second subset, second subdivision information) , a video block having a size of more than 16x16 pixels ; generating block-type syntax information that indicates the size of the block ; and generating a coded block pattern value for the encoded block , wherein the coded block pattern value indicates whether the encoded block includes at least one non-zero coefficient . WO2010039733A2 CLAIM 3 . The method of claim 1 , further comprising : when the encoded block does not include at least one non-zero coefficient , generating a single bit for the coded block pattern value and setting the value of the single bit to zero ; and when the encoded block includes at least one non-zero coefficient , generating a first bit of the coded block pattern value and setting the first bit to one , generating four partition bits for the coded block pattern value , each of the four partition bits corresponding to a different one (first set) of four equally-sized partitions of the encoded block , and setting the four partition bits to respective values representing whether the corresponding one of the four equally-sized partitions includes at least one non-zero coefficient .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set (different one) of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (video encoder) information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	WO2010039733A2 CLAIM 1 . A method comprising : encoding , with a video encoder (second subdivision, second subset, second subdivision information) , a video block having a size of more than 16x16 pixels ; generating block-type syntax information that indicates the size of the block ; and generating a coded block pattern value for the encoded block , wherein the coded block pattern value indicates whether the encoded block includes at least one non-zero coefficient . WO2010039733A2 CLAIM 3 . The method of claim 1 , further comprising : when the encoded block does not include at least one non-zero coefficient , generating a single bit for the coded block pattern value and setting the value of the single bit to zero ; and when the encoded block includes at least one non-zero coefficient , generating a first bit of the coded block pattern value and setting the first bit to one , generating four partition bits for the coded block pattern value , each of the four partition bits corresponding to a different one (first set) of four equally-sized partitions of the encoded block , and setting the four partition bits to respective values representing whether the corresponding one of the four equally-sized partitions includes at least one non-zero coefficient .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20100086029A1 Filed: 2009-09-18 Issued: 2010-04-08 Video coding with large macroblocks (Original Assignee) Qualcomm Inc (Current Assignee) Velos Media LLC Peisong Chen, Yan Ye, Marta Karczewicz
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (video encoder) information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set (different one) of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20100086029A1 CLAIM 1 . A method comprising : encoding , with a video encoder (second subdivision, second subset, second subdivision information) , a video block having a size of more than 16×16 pixels ; generating block-type syntax information that indicates the size of the block ; and generating a coded block pattern value for the encoded block , wherein the coded block pattern value indicates whether the encoded block includes at least one non-zero coefficient . US20100086029A1 CLAIM 3 . The method of claim 1 , further comprising : when the encoded block does not include at least one non-zero coefficient , generating a single bit for the coded block pattern value and setting the value of the single bit to zero ; and when the encoded block includes at least one non-zero coefficient , generating a first bit of the coded block pattern value and setting the first bit to one , generating four partition bits for the coded block pattern value , each of the four partition bits corresponding to a different one (first set) of four equally-sized partitions of the encoded block , and setting the four partition bits to respective values representing whether the corresponding one of the four equally-sized partitions includes at least one non-zero coefficient .
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set (different one) of sub-regions : compute a prediction signal based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset of the second set of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	US20100086029A1 CLAIM 3 . The method of claim 1 , further comprising : when the encoded block does not include at least one non-zero coefficient , generating a single bit for the coded block pattern value and setting the value of the single bit to zero ; and when the encoded block includes at least one non-zero coefficient , generating a first bit of the coded block pattern value and setting the first bit to one , generating four partition bits for the coded block pattern value , each of the four partition bits corresponding to a different one (first set) of four equally-sized partitions of the encoded block , and setting the four partition bits to respective values representing whether the corresponding one of the four equally-sized partitions includes at least one non-zero coefficient .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set (different one) of root regions such that the first set of root regions are rectangular blocks of a size determined by the first maximum region size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	US20100086029A1 CLAIM 3 . The method of claim 1 , further comprising : when the encoded block does not include at least one non-zero coefficient , generating a single bit for the coded block pattern value and setting the value of the single bit to zero ; and when the encoded block includes at least one non-zero coefficient , generating a first bit of the coded block pattern value and setting the first bit to one , generating four partition bits for the coded block pattern value , each of the four partition bits corresponding to a different one (first set) of four equally-sized partitions of the encoded block , and setting the four partition bits to respective values representing whether the corresponding one of the four equally-sized partitions includes at least one non-zero coefficient .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set (different one) of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20100086029A1 CLAIM 3 . The method of claim 1 , further comprising : when the encoded block does not include at least one non-zero coefficient , generating a single bit for the coded block pattern value and setting the value of the single bit to zero ; and when the encoded block includes at least one non-zero coefficient , generating a first bit of the coded block pattern value and setting the first bit to one , generating four partition bits for the coded block pattern value , each of the four partition bits corresponding to a different one (first set) of four equally-sized partitions of the encoded block , and setting the four partition bits to respective values representing whether the corresponding one of the four equally-sized partitions includes at least one non-zero coefficient .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision information includes a partition indication flag indicating whether any of the first set (different one) of root regions or the sub-regions at the first or higher-order hierarchy level is sub-divided .	US20100086029A1 CLAIM 3 . The method of claim 1 , further comprising : when the encoded block does not include at least one non-zero coefficient , generating a single bit for the coded block pattern value and setting the value of the single bit to zero ; and when the encoded block includes at least one non-zero coefficient , generating a first bit of the coded block pattern value and setting the first bit to one , generating four partition bits for the coded block pattern value , each of the four partition bits corresponding to a different one (first set) of four equally-sized partitions of the encoded block , and setting the four partition bits to respective values representing whether the corresponding one of the four equally-sized partitions includes at least one non-zero coefficient .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset (video encoder) of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set (different one) of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20100086029A1 CLAIM 1 . A method comprising : encoding , with a video encoder (second subdivision, second subset, second subdivision information) , a video block having a size of more than 16×16 pixels ; generating block-type syntax information that indicates the size of the block ; and generating a coded block pattern value for the encoded block , wherein the coded block pattern value indicates whether the encoded block includes at least one non-zero coefficient . US20100086029A1 CLAIM 3 . The method of claim 1 , further comprising : when the encoded block does not include at least one non-zero coefficient , generating a single bit for the coded block pattern value and setting the value of the single bit to zero ; and when the encoded block includes at least one non-zero coefficient , generating a first bit of the coded block pattern value and setting the first bit to one , generating four partition bits for the coded block pattern value , each of the four partition bits corresponding to a different one (first set) of four equally-sized partitions of the encoded block , and setting the four partition bits to respective values representing whether the corresponding one of the four equally-sized partitions includes at least one non-zero coefficient .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (video encoder) information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set (different one) of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20100086029A1 CLAIM 1 . A method comprising : encoding , with a video encoder (second subdivision, second subset, second subdivision information) , a video block having a size of more than 16×16 pixels ; generating block-type syntax information that indicates the size of the block ; and generating a coded block pattern value for the encoded block , wherein the coded block pattern value indicates whether the encoded block includes at least one non-zero coefficient . US20100086029A1 CLAIM 3 . The method of claim 1 , further comprising : when the encoded block does not include at least one non-zero coefficient , generating a single bit for the coded block pattern value and setting the value of the single bit to zero ; and when the encoded block includes at least one non-zero coefficient , generating a first bit of the coded block pattern value and setting the first bit to one , generating four partition bits for the coded block pattern value , each of the four partition bits corresponding to a different one (first set) of four equally-sized partitions of the encoded block , and setting the four partition bits to respective values representing whether the corresponding one of the four equally-sized partitions includes at least one non-zero coefficient .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set (different one) of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (video encoder) information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20100086029A1 CLAIM 1 . A method comprising : encoding , with a video encoder (second subdivision, second subset, second subdivision information) , a video block having a size of more than 16×16 pixels ; generating block-type syntax information that indicates the size of the block ; and generating a coded block pattern value for the encoded block , wherein the coded block pattern value indicates whether the encoded block includes at least one non-zero coefficient . US20100086029A1 CLAIM 3 . The method of claim 1 , further comprising : when the encoded block does not include at least one non-zero coefficient , generating a single bit for the coded block pattern value and setting the value of the single bit to zero ; and when the encoded block includes at least one non-zero coefficient , generating a first bit of the coded block pattern value and setting the first bit to one , generating four partition bits for the coded block pattern value , each of the four partition bits corresponding to a different one (first set) of four equally-sized partitions of the encoded block , and setting the four partition bits to respective values representing whether the corresponding one of the four equally-sized partitions includes at least one non-zero coefficient .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set (different one) of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (video encoder) information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20100086029A1 CLAIM 1 . A method comprising : encoding , with a video encoder (second subdivision, second subset, second subdivision information) , a video block having a size of more than 16×16 pixels ; generating block-type syntax information that indicates the size of the block ; and generating a coded block pattern value for the encoded block , wherein the coded block pattern value indicates whether the encoded block includes at least one non-zero coefficient . US20100086029A1 CLAIM 3 . The method of claim 1 , further comprising : when the encoded block does not include at least one non-zero coefficient , generating a single bit for the coded block pattern value and setting the value of the single bit to zero ; and when the encoded block includes at least one non-zero coefficient , generating a first bit of the coded block pattern value and setting the first bit to one , generating four partition bits for the coded block pattern value , each of the four partition bits corresponding to a different one (first set) of four equally-sized partitions of the encoded block , and setting the four partition bits to respective values representing whether the corresponding one of the four equally-sized partitions includes at least one non-zero coefficient .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20100086031A1 Filed: 2009-09-18 Issued: 2010-04-08 Video coding with large macroblocks (Original Assignee) Qualcomm Inc (Current Assignee) Velos Media LLC Peisong Chen, Yan Ye, Marta Karczewicz
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (video encoder) information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20100086031A1 CLAIM 1 . A method comprising : receiving , with a digital video encoder (second subdivision, second subset, second subdivision information) , a video coding unit ; determining a first rate-distortion metric for encoding the video coding unit using first video blocks with sizes of 16×16 pixels ; determining a second rate-distortion metric for encoding the video coding unit using second video blocks with sizes of more than 16×16 pixels ; encoding the video coding unit using the first video blocks when the first rate-distortion metric is less than second rate-distortion metric ; and encoding the video coding unit using the second video blocks when the second rate-distortion metric is less than the first rate-distortion metric .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set of root regions such that the first set of root regions are rectangular blocks (type syntax information) of a size determined by the first maximum region size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	US20100086031A1 CLAIM 2 . The method of claim 1 , further comprising generating an encoded video bitstream comprising block-type syntax information (rectangular blocks) indicating the size of the blocks used to encode the video coding unit .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset (video encoder) of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20100086031A1 CLAIM 1 . A method comprising : receiving , with a digital video encoder (second subdivision, second subset, second subdivision information) , a video coding unit ; determining a first rate-distortion metric for encoding the video coding unit using first video blocks with sizes of 16×16 pixels ; determining a second rate-distortion metric for encoding the video coding unit using second video blocks with sizes of more than 16×16 pixels ; encoding the video coding unit using the first video blocks when the first rate-distortion metric is less than second rate-distortion metric ; and encoding the video coding unit using the second video blocks when the second rate-distortion metric is less than the first rate-distortion metric .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (video encoder) information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20100086031A1 CLAIM 1 . A method comprising : receiving , with a digital video encoder (second subdivision, second subset, second subdivision information) , a video coding unit ; determining a first rate-distortion metric for encoding the video coding unit using first video blocks with sizes of 16×16 pixels ; determining a second rate-distortion metric for encoding the video coding unit using second video blocks with sizes of more than 16×16 pixels ; encoding the video coding unit using the first video blocks when the first rate-distortion metric is less than second rate-distortion metric ; and encoding the video coding unit using the second video blocks when the second rate-distortion metric is less than the first rate-distortion metric .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (video encoder) information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20100086031A1 CLAIM 1 . A method comprising : receiving , with a digital video encoder (second subdivision, second subset, second subdivision information) , a video coding unit ; determining a first rate-distortion metric for encoding the video coding unit using first video blocks with sizes of 16×16 pixels ; determining a second rate-distortion metric for encoding the video coding unit using second video blocks with sizes of more than 16×16 pixels ; encoding the video coding unit using the first video blocks when the first rate-distortion metric is less than second rate-distortion metric ; and encoding the video coding unit using the second video blocks when the second rate-distortion metric is less than the first rate-distortion metric .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (video encoder) information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20100086031A1 CLAIM 1 . A method comprising : receiving , with a digital video encoder (second subdivision, second subset, second subdivision information) , a video coding unit ; determining a first rate-distortion metric for encoding the video coding unit using first video blocks with sizes of 16×16 pixels ; determining a second rate-distortion metric for encoding the video coding unit using second video blocks with sizes of more than 16×16 pixels ; encoding the video coding unit using the first video blocks when the first rate-distortion metric is less than second rate-distortion metric ; and encoding the video coding unit using the second video blocks when the second rate-distortion metric is less than the first rate-distortion metric .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	CN101493890A Filed: 2009-02-26 Issued: 2009-07-29 基于特征的动态视觉注意区域提取方法 (Original Assignee) 上海交通大学侯小笛, 祁航, 张丽清, 祝文骏
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (的权重) information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision (的权重) information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN101493890A CLAIM 4、根据权利要求1所述的基于特征的动态视觉注意区域提取方法，其特征是，所述第三步，具体如下： ①根据所得到出的各个特征的增量编码长度指标，划分显著特征集合SF： SF＝{i\|ICL(pi)＞0} ②依照预测编码原则，在各个特征之间重新分配能量，对于显著特征集合内的特征i，分配权重di，i∈SF：而对于非显著特征，定义其权重 ③那么对于图片小块xk，其显著度定义为mk：其中di为②步中所分配给第i个特征的权重 (second subdivision, first subdivision) ； ④有了各个图片小块的显著度之后，通过重构基A，生成整幅图片的显著地图M：其中Ak表示重构基A的第k个列向量。
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision (的权重) information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	CN101493890A CLAIM 4、根据权利要求1所述的基于特征的动态视觉注意区域提取方法，其特征是，所述第三步，具体如下： ①根据所得到出的各个特征的增量编码长度指标，划分显著特征集合SF： SF＝{i\|ICL(pi)＞0} ②依照预测编码原则，在各个特征之间重新分配能量，对于显著特征集合内的特征i，分配权重di，i∈SF：而对于非显著特征，定义其权重 ③那么对于图片小块xk，其显著度定义为mk：其中di为②步中所分配给第i个特征的权重 (second subdivision, first subdivision) ； ④有了各个图片小块的显著度之后，通过重构基A，生成整幅图片的显著地图M：其中Ak表示重构基A的第k个列向量。
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision (的权重) information includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level is sub-divided .	CN101493890A CLAIM 4、根据权利要求1所述的基于特征的动态视觉注意区域提取方法，其特征是，所述第三步，具体如下： ①根据所得到出的各个特征的增量编码长度指标，划分显著特征集合SF： SF＝{i\|ICL(pi)＞0} ②依照预测编码原则，在各个特征之间重新分配能量，对于显著特征集合内的特征i，分配权重di，i∈SF：而对于非显著特征，定义其权重 ③那么对于图片小块xk，其显著度定义为mk：其中di为②步中所分配给第i个特征的权重 (second subdivision, first subdivision) ； ④有了各个图片小块的显著度之后，通过重构基A，生成整幅图片的显著地图M：其中Ak表示重构基A的第k个列向量。
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset (的滤波) of syntax elements of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision (的权重) information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	CN101493890A CLAIM 2、根据权利要求1所述的基于特征的动态视觉注意区域提取方法，其特征是，所述的第一步，具体如下： ①将训练图片分成若干个m×m像素大小的RGB彩色小块，并将每个小块向量化，对自然图片进行采样，得到大量的m×m的RGB彩色小块，将其作为训练样本，m的取值是8，16或32，m为每个RGB彩色小块的边长； ②通过标准的独立成分分析方法，训练出基函数(A，W)，基函数的个数为m×m×3＝3m2，即其中wi为第i个滤波基函数，A的大小与W一样，1≤i≤3m2，A，W是ICA方法训练出来的基函数； ③对于任意一幅图片X，将其分成n个m×m的RGB小块，形成采样矩阵X＝[x1，x2，…xn]，其中xk是第k个图像块的向量化表示，1≤k≤n，对xk进行线性变换其中W是训练好的滤波 (first subset) 基函数，则Sk为基函数的对应系数，也就是图片小块xk的特征，sk，i为第i基函数对应系数，即为第i个特征的值，对所有的xk都做同样的处理，得到X的特征S＝[S1，S2， . . . ，Sn]，n是输入图片X被分成RGB小块的个数，其值是由输入图片X的大小和m的取值所确定的。 CN101493890A CLAIM 4、根据权利要求1所述的基于特征的动态视觉注意区域提取方法，其特征是，所述第三步，具体如下： ①根据所得到出的各个特征的增量编码长度指标，划分显著特征集合SF： SF＝{i\|ICL(pi)＞0} ②依照预测编码原则，在各个特征之间重新分配能量，对于显著特征集合内的特征i，分配权重di，i∈SF：而对于非显著特征，定义其权重 ③那么对于图片小块xk，其显著度定义为mk：其中di为②步中所分配给第i个特征的权重 (second subdivision, first subdivision) ； ④有了各个图片小块的显著度之后，通过重构基A，生成整幅图片的显著地图M：其中Ak表示重构基A的第k个列向量。
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (的权重) information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision (的权重) information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN101493890A CLAIM 4、根据权利要求1所述的基于特征的动态视觉注意区域提取方法，其特征是，所述第三步，具体如下： ①根据所得到出的各个特征的增量编码长度指标，划分显著特征集合SF： SF＝{i\|ICL(pi)＞0} ②依照预测编码原则，在各个特征之间重新分配能量，对于显著特征集合内的特征i，分配权重di，i∈SF：而对于非显著特征，定义其权重 ③那么对于图片小块xk，其显著度定义为mk：其中di为②步中所分配给第i个特征的权重 (second subdivision, first subdivision) ； ④有了各个图片小块的显著度之后，通过重构基A，生成整幅图片的显著地图M：其中Ak表示重构基A的第k个列向量。
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision (的权重) information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (的权重) information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN101493890A CLAIM 4、根据权利要求1所述的基于特征的动态视觉注意区域提取方法，其特征是，所述第三步，具体如下： ①根据所得到出的各个特征的增量编码长度指标，划分显著特征集合SF： SF＝{i\|ICL(pi)＞0} ②依照预测编码原则，在各个特征之间重新分配能量，对于显著特征集合内的特征i，分配权重di，i∈SF：而对于非显著特征，定义其权重 ③那么对于图片小块xk，其显著度定义为mk：其中di为②步中所分配给第i个特征的权重 (second subdivision, first subdivision) ； ④有了各个图片小块的显著度之后，通过重构基A，生成整幅图片的显著地图M：其中Ak表示重构基A的第k个列向量。
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision (的权重) information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (的权重) information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN101493890A CLAIM 4、根据权利要求1所述的基于特征的动态视觉注意区域提取方法，其特征是，所述第三步，具体如下： ①根据所得到出的各个特征的增量编码长度指标，划分显著特征集合SF： SF＝{i\|ICL(pi)＞0} ②依照预测编码原则，在各个特征之间重新分配能量，对于显著特征集合内的特征i，分配权重di，i∈SF：而对于非显著特征，定义其权重 ③那么对于图片小块xk，其显著度定义为mk：其中di为②步中所分配给第i个特征的权重 (second subdivision, first subdivision) ； ④有了各个图片小块的显著度之后，通过重构基A，生成整幅图片的显著地图M：其中Ak表示重构基A的第k个列向量。

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20090080521A1 Filed: 2008-11-26 Issued: 2009-03-26 Video frame encoding and decoding (Original Assignee) Fraunhofer Gesellschaft zur Forderung der Angewandten Forschung eV (Current Assignee) Fraunhofer Gesellschaft zur Forderung der Angewandten Forschung eV Detlev Marpe, Heiko Schwarz, Thomas Wiegand
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding (same slice) and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set (following steps) of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20090080521A1 CLAIM 1 . A method for encoding a video signal representing at least one video frame , with at least one video frame being composed of picture samples , the picture samples belonging either to a first or a second field being captured at different time instants , the video frame being spatially divided up into macroblock pair regions , each macroblock pair region being associated with a top and bottom macroblock , the method comprising the following steps (second set) : deciding , for each macroblock pair region , as to whether same is of a first or a second distribution type ; assigning , for each macroblock pair region , each of the pixel samples in the respective macroblock pair region to a respective one of the top and bottom macroblock of the respective macroblock pair region , in accordance with the distribution type of the respective macroblock pair region ; pre-coding the video signal into a pre-coded video signal , the pre-coding comprising the sub-step of pre-coding a current macroblock of the top and bottom macroblock associated with a current macroblock pair region of the macroblock pair regions to obtain a current syntax element being a type indicator specifying a partitioning of the current macroblock used for motion description ; determining , for the current syntax element , a neighboring macroblock at least based upon as to whether the current macroblock pair region is of a first or second distribution type ; assigning one of at least two context models to the current syntax element based on a type indicator of the neighboring macroblock , wherein each context model is associated with a different probability estimation ; and arithmetically encoding the syntax element into a coded bit stream based on the probability estimation with which the assigned context model is associated . US20090080521A1 CLAIM 15 . Method according to claim 5 , wherein the step of assigning one of at least two context models is performed such that the assignment is based on an availability of the neighboring macroblock indicating as to whether the predetermined macroblock and the neighboring macroblock belong to the same slice (prediction coding, syntax elements, information samples using prediction coding) of the video frame or to different slices of the video frame .
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset of the second set (following steps) of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	US20090080521A1 CLAIM 1 . A method for encoding a video signal representing at least one video frame , with at least one video frame being composed of picture samples , the picture samples belonging either to a first or a second field being captured at different time instants , the video frame being spatially divided up into macroblock pair regions , each macroblock pair region being associated with a top and bottom macroblock , the method comprising the following steps (second set) : deciding , for each macroblock pair region , as to whether same is of a first or a second distribution type ; assigning , for each macroblock pair region , each of the pixel samples in the respective macroblock pair region to a respective one of the top and bottom macroblock of the respective macroblock pair region , in accordance with the distribution type of the respective macroblock pair region ; pre-coding the video signal into a pre-coded video signal , the pre-coding comprising the sub-step of pre-coding a current macroblock of the top and bottom macroblock associated with a current macroblock pair region of the macroblock pair regions to obtain a current syntax element being a type indicator specifying a partitioning of the current macroblock used for motion description ; determining , for the current syntax element , a neighboring macroblock at least based upon as to whether the current macroblock pair region is of a first or second distribution type ; assigning one of at least two context models to the current syntax element based on a type indicator of the neighboring macroblock , wherein each context model is associated with a different probability estimation ; and arithmetically encoding the syntax element into a coded bit stream based on the probability estimation with which the assigned context model is associated .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements (same slice) associated with the first or second set (following steps) of sub-regions from the data stream in a depth-first traversal order .	US20090080521A1 CLAIM 1 . A method for encoding a video signal representing at least one video frame , with at least one video frame being composed of picture samples , the picture samples belonging either to a first or a second field being captured at different time instants , the video frame being spatially divided up into macroblock pair regions , each macroblock pair region being associated with a top and bottom macroblock , the method comprising the following steps (second set) : deciding , for each macroblock pair region , as to whether same is of a first or a second distribution type ; assigning , for each macroblock pair region , each of the pixel samples in the respective macroblock pair region to a respective one of the top and bottom macroblock of the respective macroblock pair region , in accordance with the distribution type of the respective macroblock pair region ; pre-coding the video signal into a pre-coded video signal , the pre-coding comprising the sub-step of pre-coding a current macroblock of the top and bottom macroblock associated with a current macroblock pair region of the macroblock pair regions to obtain a current syntax element being a type indicator specifying a partitioning of the current macroblock used for motion description ; determining , for the current syntax element , a neighboring macroblock at least based upon as to whether the current macroblock pair region is of a first or second distribution type ; assigning one of at least two context models to the current syntax element based on a type indicator of the neighboring macroblock , wherein each context model is associated with a different probability estimation ; and arithmetically encoding the syntax element into a coded bit stream based on the probability estimation with which the assigned context model is associated . US20090080521A1 CLAIM 15 . Method according to claim 5 , wherein the step of assigning one of at least two context models is performed such that the assignment is based on an availability of the neighboring macroblock indicating as to whether the predetermined macroblock and the neighboring macroblock belong to the same slice (prediction coding, syntax elements, information samples using prediction coding) of the video frame or to different slices of the video frame .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements (same slice) of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20090080521A1 CLAIM 15 . Method according to claim 5 , wherein the step of assigning one of at least two context models is performed such that the assignment is based on an availability of the neighboring macroblock indicating as to whether the predetermined macroblock and the neighboring macroblock belong to the same slice (prediction coding, syntax elements, information samples using prediction coding) of the video frame or to different slices of the video frame .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding (same slice) and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set (following steps) of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20090080521A1 CLAIM 1 . A method for encoding a video signal representing at least one video frame , with at least one video frame being composed of picture samples , the picture samples belonging either to a first or a second field being captured at different time instants , the video frame being spatially divided up into macroblock pair regions , each macroblock pair region being associated with a top and bottom macroblock , the method comprising the following steps (second set) : deciding , for each macroblock pair region , as to whether same is of a first or a second distribution type ; assigning , for each macroblock pair region , each of the pixel samples in the respective macroblock pair region to a respective one of the top and bottom macroblock of the respective macroblock pair region , in accordance with the distribution type of the respective macroblock pair region ; pre-coding the video signal into a pre-coded video signal , the pre-coding comprising the sub-step of pre-coding a current macroblock of the top and bottom macroblock associated with a current macroblock pair region of the macroblock pair regions to obtain a current syntax element being a type indicator specifying a partitioning of the current macroblock used for motion description ; determining , for the current syntax element , a neighboring macroblock at least based upon as to whether the current macroblock pair region is of a first or second distribution type ; assigning one of at least two context models to the current syntax element based on a type indicator of the neighboring macroblock , wherein each context model is associated with a different probability estimation ; and arithmetically encoding the syntax element into a coded bit stream based on the probability estimation with which the assigned context model is associated . US20090080521A1 CLAIM 15 . Method according to claim 5 , wherein the step of assigning one of at least two context models is performed such that the assignment is based on an availability of the neighboring macroblock indicating as to whether the predetermined macroblock and the neighboring macroblock belong to the same slice (prediction coding, syntax elements, information samples using prediction coding) of the video frame or to different slices of the video frame .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set (following steps) of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding (same slice) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20090080521A1 CLAIM 1 . A method for encoding a video signal representing at least one video frame , with at least one video frame being composed of picture samples , the picture samples belonging either to a first or a second field being captured at different time instants , the video frame being spatially divided up into macroblock pair regions , each macroblock pair region being associated with a top and bottom macroblock , the method comprising the following steps (second set) : deciding , for each macroblock pair region , as to whether same is of a first or a second distribution type ; assigning , for each macroblock pair region , each of the pixel samples in the respective macroblock pair region to a respective one of the top and bottom macroblock of the respective macroblock pair region , in accordance with the distribution type of the respective macroblock pair region ; pre-coding the video signal into a pre-coded video signal , the pre-coding comprising the sub-step of pre-coding a current macroblock of the top and bottom macroblock associated with a current macroblock pair region of the macroblock pair regions to obtain a current syntax element being a type indicator specifying a partitioning of the current macroblock used for motion description ; determining , for the current syntax element , a neighboring macroblock at least based upon as to whether the current macroblock pair region is of a first or second distribution type ; assigning one of at least two context models to the current syntax element based on a type indicator of the neighboring macroblock , wherein each context model is associated with a different probability estimation ; and arithmetically encoding the syntax element into a coded bit stream based on the probability estimation with which the assigned context model is associated . US20090080521A1 CLAIM 15 . Method according to claim 5 , wherein the step of assigning one of at least two context models is performed such that the assignment is based on an availability of the neighboring macroblock indicating as to whether the predetermined macroblock and the neighboring macroblock belong to the same slice (prediction coding, syntax elements, information samples using prediction coding) of the video frame or to different slices of the video frame .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set (following steps) of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding (same slice) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20090080521A1 CLAIM 1 . A method for encoding a video signal representing at least one video frame , with at least one video frame being composed of picture samples , the picture samples belonging either to a first or a second field being captured at different time instants , the video frame being spatially divided up into macroblock pair regions , each macroblock pair region being associated with a top and bottom macroblock , the method comprising the following steps (second set) : deciding , for each macroblock pair region , as to whether same is of a first or a second distribution type ; assigning , for each macroblock pair region , each of the pixel samples in the respective macroblock pair region to a respective one of the top and bottom macroblock of the respective macroblock pair region , in accordance with the distribution type of the respective macroblock pair region ; pre-coding the video signal into a pre-coded video signal , the pre-coding comprising the sub-step of pre-coding a current macroblock of the top and bottom macroblock associated with a current macroblock pair region of the macroblock pair regions to obtain a current syntax element being a type indicator specifying a partitioning of the current macroblock used for motion description ; determining , for the current syntax element , a neighboring macroblock at least based upon as to whether the current macroblock pair region is of a first or second distribution type ; assigning one of at least two context models to the current syntax element based on a type indicator of the neighboring macroblock , wherein each context model is associated with a different probability estimation ; and arithmetically encoding the syntax element into a coded bit stream based on the probability estimation with which the assigned context model is associated . US20090080521A1 CLAIM 15 . Method according to claim 5 , wherein the step of assigning one of at least two context models is performed such that the assignment is based on an availability of the neighboring macroblock indicating as to whether the predetermined macroblock and the neighboring macroblock belong to the same slice (prediction coding, syntax elements, information samples using prediction coding) of the video frame or to different slices of the video frame .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20090129465A1 Filed: 2008-11-10 Issued: 2009-05-21 Methods and apparatus for adaptive reference filtering (arf) of bi-predictive pictures in multi-view coded video (Original Assignee) Thomson Licensing SAS (Current Assignee) InterDigital Madison Patent Holdings Inc Polin Lai, Purvin Bibhas Pandit, Peng Yin
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level (high level syntax) wherein the first maximum region size and the first subdivision information (prediction direction) are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set (first one, first set, second set) of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set (first one, first set, second set) of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20090129465A1 CLAIM 3 . The apparatus of claim 2 , wherein the information from the current picture and the two reference pictures in the two reference lists comprises at least one of three sets of information , the first set (first set, second set (first set, second set) ) of information comprising at least one prediction direction (first subdivision information) for different blocks within the current picture , the second set of information comprising at least one of motion information and disparity information between the current picture and the two reference pictures in the two reference lists , and the third set of information comprising at least one of intensity information and color information between the current picture and the two reference picture in the two reference lists . US20090129465A1 CLAIM 6 . The apparatus of claim 1 , wherein said encoder (100) classifies blocks in the current picture based upon three classes , wherein the blocks in the current picture classified in a first one (first set, second set) of the three classes select reference pictures from a first reference list , blocks in the current picture classified in a second one of the three classes select reference pictures from a second reference list , and blocks in the current picture classified in a third one of the three classes select an average predictor based on the reference pictures from both the first reference list and the second reference list . US20090129465A1 CLAIM 11 . The apparatus of claim 1 , wherein said encoder (100) signals , using at least one high level syntax (hierarchy level) element , at least one of filters that are used for a first reference list , filters that are used for a second reference list , and filters that are used for both the first and the second reference lists .
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set (first one, first set, second set) of sub-regions : compute a prediction signal based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset of the second set (first one, first set, second set) of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	US20090129465A1 CLAIM 3 . The apparatus of claim 2 , wherein the information from the current picture and the two reference pictures in the two reference lists comprises at least one of three sets of information , the first set (first set, second set (first set, second set) ) of information comprising at least one prediction direction for different blocks within the current picture , the second set of information comprising at least one of motion information and disparity information between the current picture and the two reference pictures in the two reference lists , and the third set of information comprising at least one of intensity information and color information between the current picture and the two reference picture in the two reference lists . US20090129465A1 CLAIM 6 . The apparatus of claim 1 , wherein said encoder (100) classifies blocks in the current picture based upon three classes , wherein the blocks in the current picture classified in a first one (first set, second set) of the three classes select reference pictures from a first reference list , blocks in the current picture classified in a second one of the three classes select reference pictures from a second reference list , and blocks in the current picture classified in a third one of the three classes select an average predictor based on the reference pictures from both the first reference list and the second reference list .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set (first one, first set, second set) of root regions such that the first set of root regions are rectangular blocks (one reference picture, single reference) of a size determined by the first maximum region size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	US20090129465A1 CLAIM 1 . An apparatus , comprising : an encoder (100) for encoding a current picture as a bi-predictive picture , wherein said encoder performs adaptive filtering of at least one reference picture (rectangular blocks) to respectively obtain at least one filtered reference picture , and bi-predictively codes the current picture using the at least one filtered reference picture , the at least one reference picture being a picture wherein at least one sample thereof is used for inter-prediction either of subsequent to the least one sample being applied to an in-loop filter or in an absence of the at least one sample being applied to an in-loop filter , and wherein reference filter coefficients for the adaptive filtering are determined responsive to at least one of luma values and chroma values of pixels grouped based on at least one of depth and disparity and motion . US20090129465A1 CLAIM 3 . The apparatus of claim 2 , wherein the information from the current picture and the two reference pictures in the two reference lists comprises at least one of three sets of information , the first set (first set, second set (first set, second set) ) of information comprising at least one prediction direction for different blocks within the current picture , the second set of information comprising at least one of motion information and disparity information between the current picture and the two reference pictures in the two reference lists , and the third set of information comprising at least one of intensity information and color information between the current picture and the two reference picture in the two reference lists . US20090129465A1 CLAIM 6 . The apparatus of claim 1 , wherein said encoder (100) classifies blocks in the current picture based upon three classes , wherein the blocks in the current picture classified in a first one (first set, second set) of the three classes select reference pictures from a first reference list , blocks in the current picture classified in a second one of the three classes select reference pictures from a second reference list , and blocks in the current picture classified in a third one of the three classes select an average predictor based on the reference pictures from both the first reference list and the second reference list . US20090129465A1 CLAIM 10 . The apparatus of claim 1 , wherein said encoder (100) performs an initial disparity estimation using only a single reference (rectangular blocks) list from among two reference lists when only the single reference list includes mismatches with respect to the current picture , partitions the current picture into regions suffering from different types of mismatches , estimates at least one filter for each of the regions , and applies the at least one filter with respect to the single reference list used in the initial disparity estimation , wherein the current picture is encoded as the bi-predictive picture using the single reference list having at least one filtered reference picture corresponding thereto and another reference list .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set (first one, first set, second set) of root regions , determine whether the first subdivision information (prediction direction) indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level (high level syntax) according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20090129465A1 CLAIM 3 . The apparatus of claim 2 , wherein the information from the current picture and the two reference pictures in the two reference lists comprises at least one of three sets of information , the first set (first set, second set (first set, second set) ) of information comprising at least one prediction direction (first subdivision information) for different blocks within the current picture , the second set of information comprising at least one of motion information and disparity information between the current picture and the two reference pictures in the two reference lists , and the third set of information comprising at least one of intensity information and color information between the current picture and the two reference picture in the two reference lists . US20090129465A1 CLAIM 6 . The apparatus of claim 1 , wherein said encoder (100) classifies blocks in the current picture based upon three classes , wherein the blocks in the current picture classified in a first one (first set, second set) of the three classes select reference pictures from a first reference list , blocks in the current picture classified in a second one of the three classes select reference pictures from a second reference list , and blocks in the current picture classified in a third one of the three classes select an average predictor based on the reference pictures from both the first reference list and the second reference list . US20090129465A1 CLAIM 11 . The apparatus of claim 1 , wherein said encoder (100) signals , using at least one high level syntax (hierarchy level) element , at least one of filters that are used for a first reference list , filters that are used for a second reference list , and filters that are used for both the first and the second reference lists .
US10250913B2 CLAIM 5 . The decoder according to claim 4 , wherein the divider is configured to , in accordance with the partition rules associated with the first and higher-order hierarchy levels , sub-divide into sub-regions of equal size , such that there are an equal number of sub-regions at each hierarchy level (high level syntax) .	US20090129465A1 CLAIM 11 . The apparatus of claim 1 , wherein said encoder (100) signals , using at least one high level syntax (hierarchy level) element , at least one of filters that are used for a first reference list , filters that are used for a second reference list , and filters that are used for both the first and the second reference lists .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision information (prediction direction) includes a partition indication flag indicating whether any of the first set (first one, first set, second set) of root regions or the sub-regions at the first or higher-order hierarchy level (high level syntax) is sub-divided .	US20090129465A1 CLAIM 3 . The apparatus of claim 2 , wherein the information from the current picture and the two reference pictures in the two reference lists comprises at least one of three sets of information , the first set (first set, second set (first set, second set) ) of information comprising at least one prediction direction (first subdivision information) for different blocks within the current picture , the second set of information comprising at least one of motion information and disparity information between the current picture and the two reference pictures in the two reference lists , and the third set of information comprising at least one of intensity information and color information between the current picture and the two reference picture in the two reference lists . US20090129465A1 CLAIM 6 . The apparatus of claim 1 , wherein said encoder (100) classifies blocks in the current picture based upon three classes , wherein the blocks in the current picture classified in a first one (first set, second set) of the three classes select reference pictures from a first reference list , blocks in the current picture classified in a second one of the three classes select reference pictures from a second reference list , and blocks in the current picture classified in a third one of the three classes select an average predictor based on the reference pictures from both the first reference list and the second reference list . US20090129465A1 CLAIM 11 . The apparatus of claim 1 , wherein said encoder (100) signals , using at least one high level syntax (hierarchy level) element , at least one of filters that are used for a first reference list , filters that are used for a second reference list , and filters that are used for both the first and the second reference lists .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level (high level syntax) from the data stream .	US20090129465A1 CLAIM 11 . The apparatus of claim 1 , wherein said encoder (100) signals , using at least one high level syntax (hierarchy level) element , at least one of filters that are used for a first reference list , filters that are used for a second reference list , and filters that are used for both the first and the second reference lists .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements (syntax element) associated with the first or second set (first one, first set, second set) of sub-regions from the data stream in a depth-first traversal order .	US20090129465A1 CLAIM 3 . The apparatus of claim 2 , wherein the information from the current picture and the two reference pictures in the two reference lists comprises at least one of three sets of information , the first set (first set, second set (first set, second set) ) of information comprising at least one prediction direction for different blocks within the current picture , the second set of information comprising at least one of motion information and disparity information between the current picture and the two reference pictures in the two reference lists , and the third set of information comprising at least one of intensity information and color information between the current picture and the two reference picture in the two reference lists . US20090129465A1 CLAIM 6 . The apparatus of claim 1 , wherein said encoder (100) classifies blocks in the current picture based upon three classes , wherein the blocks in the current picture classified in a first one (first set, second set) of the three classes select reference pictures from a first reference list , blocks in the current picture classified in a second one of the three classes select reference pictures from a second reference list , and blocks in the current picture classified in a third one of the three classes select an average predictor based on the reference pictures from both the first reference list and the second reference list . US20090129465A1 CLAIM 11 . The apparatus of claim 1 , wherein said encoder (100) signals , using at least one high level syntax element (syntax elements) , at least one of filters that are used for a first reference list , filters that are used for a second reference list , and filters that are used for both the first and the second reference lists .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements (syntax element) of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision information (prediction direction) , spatially neighboring ones of the first set (first one, first set, second set) of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20090129465A1 CLAIM 3 . The apparatus of claim 2 , wherein the information from the current picture and the two reference pictures in the two reference lists comprises at least one of three sets of information , the first set (first set, second set (first set, second set) ) of information comprising at least one prediction direction (first subdivision information) for different blocks within the current picture , the second set of information comprising at least one of motion information and disparity information between the current picture and the two reference pictures in the two reference lists , and the third set of information comprising at least one of intensity information and color information between the current picture and the two reference picture in the two reference lists . US20090129465A1 CLAIM 6 . The apparatus of claim 1 , wherein said encoder (100) classifies blocks in the current picture based upon three classes , wherein the blocks in the current picture classified in a first one (first set, second set) of the three classes select reference pictures from a first reference list , blocks in the current picture classified in a second one of the three classes select reference pictures from a second reference list , and blocks in the current picture classified in a third one of the three classes select an average predictor based on the reference pictures from both the first reference list and the second reference list . US20090129465A1 CLAIM 11 . The apparatus of claim 1 , wherein said encoder (100) signals , using at least one high level syntax element (syntax elements) , at least one of filters that are used for a first reference list , filters that are used for a second reference list , and filters that are used for both the first and the second reference lists .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level (high level syntax) , wherein the first maximum region size and the first subdivision information (prediction direction) are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set (first one, first set, second set) of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set (first one, first set, second set) of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20090129465A1 CLAIM 3 . The apparatus of claim 2 , wherein the information from the current picture and the two reference pictures in the two reference lists comprises at least one of three sets of information , the first set (first set, second set (first set, second set) ) of information comprising at least one prediction direction (first subdivision information) for different blocks within the current picture , the second set of information comprising at least one of motion information and disparity information between the current picture and the two reference pictures in the two reference lists , and the third set of information comprising at least one of intensity information and color information between the current picture and the two reference picture in the two reference lists . US20090129465A1 CLAIM 6 . The apparatus of claim 1 , wherein said encoder (100) classifies blocks in the current picture based upon three classes , wherein the blocks in the current picture classified in a first one (first set, second set) of the three classes select reference pictures from a first reference list , blocks in the current picture classified in a second one of the three classes select reference pictures from a second reference list , and blocks in the current picture classified in a third one of the three classes select an average predictor based on the reference pictures from both the first reference list and the second reference list . US20090129465A1 CLAIM 11 . The apparatus of claim 1 , wherein said encoder (100) signals , using at least one high level syntax (hierarchy level) element , at least one of filters that are used for a first reference list , filters that are used for a second reference list , and filters that are used for both the first and the second reference lists .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set (first one, first set, second set) of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information (prediction direction) , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set (first one, first set, second set) of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level (high level syntax) ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20090129465A1 CLAIM 3 . The apparatus of claim 2 , wherein the information from the current picture and the two reference pictures in the two reference lists comprises at least one of three sets of information , the first set (first set, second set (first set, second set) ) of information comprising at least one prediction direction (first subdivision information) for different blocks within the current picture , the second set of information comprising at least one of motion information and disparity information between the current picture and the two reference pictures in the two reference lists , and the third set of information comprising at least one of intensity information and color information between the current picture and the two reference picture in the two reference lists . US20090129465A1 CLAIM 6 . The apparatus of claim 1 , wherein said encoder (100) classifies blocks in the current picture based upon three classes , wherein the blocks in the current picture classified in a first one (first set, second set) of the three classes select reference pictures from a first reference list , blocks in the current picture classified in a second one of the three classes select reference pictures from a second reference list , and blocks in the current picture classified in a third one of the three classes select an average predictor based on the reference pictures from both the first reference list and the second reference list . US20090129465A1 CLAIM 11 . The apparatus of claim 1 , wherein said encoder (100) signals , using at least one high level syntax (hierarchy level) element , at least one of filters that are used for a first reference list , filters that are used for a second reference list , and filters that are used for both the first and the second reference lists .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set (first one, first set, second set) of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information (prediction direction) ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set (first one, first set, second set) of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level (high level syntax) ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20090129465A1 CLAIM 3 . The apparatus of claim 2 , wherein the information from the current picture and the two reference pictures in the two reference lists comprises at least one of three sets of information , the first set (first set, second set (first set, second set) ) of information comprising at least one prediction direction (first subdivision information) for different blocks within the current picture , the second set of information comprising at least one of motion information and disparity information between the current picture and the two reference pictures in the two reference lists , and the third set of information comprising at least one of intensity information and color information between the current picture and the two reference picture in the two reference lists . US20090129465A1 CLAIM 6 . The apparatus of claim 1 , wherein said encoder (100) classifies blocks in the current picture based upon three classes , wherein the blocks in the current picture classified in a first one (first set, second set) of the three classes select reference pictures from a first reference list , blocks in the current picture classified in a second one of the three classes select reference pictures from a second reference list , and blocks in the current picture classified in a third one of the three classes select an average predictor based on the reference pictures from both the first reference list and the second reference list . US20090129465A1 CLAIM 11 . The apparatus of claim 1 , wherein said encoder (100) signals , using at least one high level syntax (hierarchy level) element , at least one of filters that are used for a first reference list , filters that are used for a second reference list , and filters that are used for both the first and the second reference lists .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	CN101510865A Filed: 2008-10-30 Issued: 2009-08-19 数据处理设备及方法 (Original Assignee) 索尼株式会社 M·P·A·泰勒, S·A·阿通西里, T·约科卡瓦, M·亚马莫托
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region (的整数) size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN101510865A CLAIM 2 . 如权利要求l所述的数据处理设备，其中，当所述LDPC码的奇偶比特数M为非质数值、P和q是所述奇偶比特数M的两个除l和M以外的约数以致于这两个约数P和q的乘积等于所述奇偶比特数M、 K为所述LDPC码的信息比特数、x为大于等于O且小于P的整数 (first maximum region) 、并且y为大于等于O且小于q的整数时，所述奇偶交织器将包括所述LDPC码的从第K+1至第K+M码比特的奇偶比特中的第K+qx+y+1码比特交织到第K+Py+x+l码比特位置。
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set of root regions such that the first set of root regions are rectangular blocks of a size determined by the first maximum region (的整数) size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	CN101510865A CLAIM 2 . 如权利要求l所述的数据处理设备，其中，当所述LDPC码的奇偶比特数M为非质数值、P和q是所述奇偶比特数M的两个除l和M以外的约数以致于这两个约数P和q的乘积等于所述奇偶比特数M、 K为所述LDPC码的信息比特数、x为大于等于O且小于P的整数 (first maximum region) 、并且y为大于等于O且小于q的整数时，所述奇偶交织器将包括所述LDPC码的从第K+1至第K+M码比特的奇偶比特中的第K+qx+y+1码比特交织到第K+Py+x+l码比特位置。
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition (的数据处理) rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	CN101510865A CLAIM 1 . 一种用于通过正交频分复用(OFDM)符号的预定数量子载波信号传输数据比特的数据处理 (respective partition) 设备，所述数据处理设备包括奇偶交织器，可操作成对通过根据低密度奇偶校验(LDPC)码的奇偶校验矩阵对所述数据比特进行LDPC编码所获得的LDPC编码数据比特执行奇偶交织，使得所述LDPC编码数据比特的奇偶比特被交织到不同奇偶比特位置，所述奇偶校验矩阵包括与LDPC码的奇偶比特对应的奇偶矩阵，所述奇偶矩阵具有阶梯式结构，映射单元，用于将所述已奇偶交织比特映射到与所述OFDM子载波信号的调制方案的调制符号对应的数据符号，符号交织器，配置为可操作成将用于映射到所述OFDM子载波信号的所述预定数量数据符号读入到符号交织器存储器，并从所述符号交织器存储器读出用于所述OFDM子载波的所述数据符号以实现所述映射，所述读出具有不同于所述读入的顺序，所述顺序根据地址集合确定，具有在所述OFDM符号的所述子载波信号上交织所述数据符号的作用，地址生成器，可操作成生成所述地址集合，对所述输入符号的每个输入符号生成地址以指示要把所述数据符号映射到其上的所述子载波信号之一，所述地址生成器包括线性反馈移位寄存器，包括预定数量的寄存器级并且可操作成根据生成多项式来生成伪随机比特序列，置换电路，可操作成接收所述移位寄存器级的内容并根据置换码置换所述寄存器级中存在的比特以形成所述OFDM子载波之一的地址，以及控制单元，结合地址校验电路可操作成在生成的地址超过预定最大有效地址时重新生成地址，其中所述预定最大有效地址大约为三万两千，所述线性反馈移位寄存器具有十四个寄存器级，所述线性反馈移位寄存器的生成多项式为并且所述置换码依照下表根据所述第n寄存器级中存在的比特与附加比特形成第i个数据符号的十五位地址Ri[n]：
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region (的整数) size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN101510865A CLAIM 2 . 如权利要求l所述的数据处理设备，其中，当所述LDPC码的奇偶比特数M为非质数值、P和q是所述奇偶比特数M的两个除l和M以外的约数以致于这两个约数P和q的乘积等于所述奇偶比特数M、 K为所述LDPC码的信息比特数、x为大于等于O且小于P的整数 (first maximum region) 、并且y为大于等于O且小于q的整数时，所述奇偶交织器将包括所述LDPC码的从第K+1至第K+M码比特的奇偶比特中的第K+qx+y+1码比特交织到第K+Py+x+l码比特位置。
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region (的整数) size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN101510865A CLAIM 2 . 如权利要求l所述的数据处理设备，其中，当所述LDPC码的奇偶比特数M为非质数值、P和q是所述奇偶比特数M的两个除l和M以外的约数以致于这两个约数P和q的乘积等于所述奇偶比特数M、 K为所述LDPC码的信息比特数、x为大于等于O且小于P的整数 (first maximum region) 、并且y为大于等于O且小于q的整数时，所述奇偶交织器将包括所述LDPC码的从第K+1至第K+M码比特的奇偶比特中的第K+qx+y+1码比特交织到第K+Py+x+l码比特位置。
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region (的整数) size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN101510865A CLAIM 2 . 如权利要求l所述的数据处理设备，其中，当所述LDPC码的奇偶比特数M为非质数值、P和q是所述奇偶比特数M的两个除l和M以外的约数以致于这两个约数P和q的乘积等于所述奇偶比特数M、 K为所述LDPC码的信息比特数、x为大于等于O且小于P的整数 (first maximum region) 、并且y为大于等于O且小于q的整数时，所述奇偶交织器将包括所述LDPC码的从第K+1至第K+M码比特的奇偶比特中的第K+qx+y+1码比特交织到第K+Py+x+l码比特位置。

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	WO2009051719A2 Filed: 2008-10-15 Issued: 2009-04-23 Methods and apparatus for video encoding and decoding geometically partitioned super blocks (Original Assignee) Thomson Licensing Oscar Divorra Escoda, Peng Yin
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level (high level syntax) wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding (deblocking filtering) ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	WO2009051719A2 CLAIM 6 . The apparatus of claim 1 , further comprising a deblocking filter (365) for performing deblocking filtering (transform coding) in consideration of the geometric partitioning . WO2009051719A2 CLAIM 7 . The apparatus of claim 1 , wherein said encoder (300) signals a use of the geometric partitions at at least one of a high level syntax (hierarchy level) level , a sequence level , a picture level , a slice level , and a block level .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level (high level syntax) according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	WO2009051719A2 CLAIM 7 . The apparatus of claim 1 , wherein said encoder (300) signals a use of the geometric partitions at at least one of a high level syntax (hierarchy level) level , a sequence level , a picture level , a slice level , and a block level .
US10250913B2 CLAIM 5 . The decoder according to claim 4 , wherein the divider is configured to , in accordance with the partition rules associated with the first and higher-order hierarchy levels , sub-divide into sub-regions of equal size , such that there are an equal number of sub-regions at each hierarchy level (high level syntax) .	WO2009051719A2 CLAIM 7 . The apparatus of claim 1 , wherein said encoder (300) signals a use of the geometric partitions at at least one of a high level syntax (hierarchy level) level , a sequence level , a picture level , a slice level , and a block level .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision information includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level (high level syntax) is sub-divided .	WO2009051719A2 CLAIM 7 . The apparatus of claim 1 , wherein said encoder (300) signals a use of the geometric partitions at at least one of a high level syntax (hierarchy level) level , a sequence level , a picture level , a slice level , and a block level .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level (high level syntax) from the data stream .	WO2009051719A2 CLAIM 7 . The apparatus of claim 1 , wherein said encoder (300) signals a use of the geometric partitions at at least one of a high level syntax (hierarchy level) level , a sequence level , a picture level , a slice level , and a block level .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements (video coding) associated with the first or second set of sub-regions from the data stream in a depth-first traversal order .	WO2009051719A2 CLAIM 2 . The apparatus of claim 1 , wherein the geometric partitioning is enabled for use at partition sizes larger than a base partitioning size of a given video coding (syntax elements) standard or video coding recommendation used to encode the image data .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements (video coding) of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	WO2009051719A2 CLAIM 2 . The apparatus of claim 1 , wherein the geometric partitioning is enabled for use at partition sizes larger than a base partitioning size of a given video coding (syntax elements) standard or video coding recommendation used to encode the image data .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding (deblocking filtering) to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	WO2009051719A2 CLAIM 6 . The apparatus of claim 1 , further comprising a deblocking filter (365) for performing deblocking filtering (transform coding) in consideration of the geometric partitioning .
US10250913B2 CLAIM 11 . The decoder according to claim 1 , wherein the recursive multi-tree partitioning includes a quadtree partitioning (partition size) technique .	WO2009051719A2 CLAIM 2 . The apparatus of claim 1 , wherein the geometric partitioning is enabled for use at partition size (quadtree partitioning) s larger than a base partitioning size of a given video coding standard or video coding recommendation used to encode the image data .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level (high level syntax) , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding (deblocking filtering) ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	WO2009051719A2 CLAIM 6 . The apparatus of claim 1 , further comprising a deblocking filter (365) for performing deblocking filtering (transform coding) in consideration of the geometric partitioning . WO2009051719A2 CLAIM 7 . The apparatus of claim 1 , wherein said encoder (300) signals a use of the geometric partitions at at least one of a high level syntax (hierarchy level) level , a sequence level , a picture level , a slice level , and a block level .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level (high level syntax) ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding (deblocking filtering) in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	WO2009051719A2 CLAIM 6 . The apparatus of claim 1 , further comprising a deblocking filter (365) for performing deblocking filtering (transform coding) in consideration of the geometric partitioning . WO2009051719A2 CLAIM 7 . The apparatus of claim 1 , wherein said encoder (300) signals a use of the geometric partitions at at least one of a high level syntax (hierarchy level) level , a sequence level , a picture level , a slice level , and a block level .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level (high level syntax) ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding (deblocking filtering) in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	WO2009051719A2 CLAIM 6 . The apparatus of claim 1 , further comprising a deblocking filter (365) for performing deblocking filtering (transform coding) in consideration of the geometric partitioning . WO2009051719A2 CLAIM 7 . The apparatus of claim 1 , wherein said encoder (300) signals a use of the geometric partitions at at least one of a high level syntax (hierarchy level) level , a sequence level , a picture level , a slice level , and a block level .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20090180552A1 Filed: 2008-09-22 Issued: 2009-07-16 Video coding system using texture analysis and synthesis in a scalable coding framework (Original Assignee) Sony Corp; Sony Electronics Inc (Current Assignee) Sony Corp ; Sony Electronics Inc Mohammed Z. Visharam, Ali Tabatabai
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20090180552A1 CLAIM 9 . A method as recited in claim 1 , wherein said method (root region) is performed in response to execution of programming on a computer configured for processing high-definition video signals .
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset (various categories) of the second set of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle (performing addition) .	US20090180552A1 CLAIM 5 . A method as recited in claim 4 , further comprising determining non-acceptable blocks which are marginally non-acceptable and performing addition (next intra-prediction cycle) al synthesis processing on these blocks to bring these blocks to an acceptable level of visual quality . US20090180552A1 CLAIM 10 . A method of efficiently coding a high-resolution video sequence , comprising : spatial downsampling of a high-resolution video sequence received as input to obtain downsampled video having a lower spatial resolution video signal ; coding of a base-layer of said downsampled video utilizing conventional video coding ; performing texture analysis of said downsampled video into texture blocks (T blocks) upon which texture synthesis can be performed , and non-texture blocks (NT blocks) upon which alternate non-textural coding is to be performed ; performing texture classification of T blocks into various categories (neighboring subset) varying from highly rigid to non-rigid so that effective synthesis techniques can be performed dependent upon the classification ; obtaining structural information from said base-layer ; performing texture synthesis in response to said structural information ; performing texture quality assessment of texture blocks to classify visual acceptability of synthesized areas as acceptable , non-acceptable and marginally non-acceptable ; wherein determining of acceptably synthesized blocks is performed by quality assessor programming which utilizes iterative processing toward bringing marginally non-acceptable blocks up to an acceptable level of visual quality ; coding an enhancement-layer in response to structure analysis of the base-layer for acceptably synthesized blocks and using said alternate non-textural coding for unacceptably synthesized blocks ; and outputting at least one bit stream containing the coded base-layer and the enhancement-layer .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region (said method) into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20090180552A1 CLAIM 9 . A method as recited in claim 1 , wherein said method (root region) is performed in response to execution of programming on a computer configured for processing high-definition video signals .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements (performing texture, video coding) associated with the first or second set of sub-regions from the data stream in a depth-first traversal order .	US20090180552A1 CLAIM 1 . A method of efficiently coding a high-resolution video sequence , comprising : spatial downsampling of a high-resolution video sequence received as input to obtain downsampled video having a lower spatial resolution video signal ; coding of a base-layer of said downsampled video utilizing conventional video coding (syntax elements) ; performing texture (syntax elements) analysis and classification from said downsampled video ; determining structural information from said decoded base-layer ; performing texture synthesis on blocks , which are determined to be texture synthesis compatible , in response to said structural information ; coding an enhancement-layer in response to structure analysis of the base-layer for acceptably synthesized blocks and using a traditional scalable coding framework for unacceptably synthesized blocks ; and outputting at least one bit stream containing the coded base-layer and enhancement-layer .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements (performing texture, video coding) of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20090180552A1 CLAIM 1 . A method of efficiently coding a high-resolution video sequence , comprising : spatial downsampling of a high-resolution video sequence received as input to obtain downsampled video having a lower spatial resolution video signal ; coding of a base-layer of said downsampled video utilizing conventional video coding (syntax elements) ; performing texture (syntax elements) analysis and classification from said downsampled video ; determining structural information from said decoded base-layer ; performing texture synthesis on blocks , which are determined to be texture synthesis compatible , in response to said structural information ; coding an enhancement-layer in response to structure analysis of the base-layer for acceptably synthesized blocks and using a traditional scalable coding framework for unacceptably synthesized blocks ; and outputting at least one bit stream containing the coded base-layer and enhancement-layer .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20090180552A1 CLAIM 9 . A method as recited in claim 1 , wherein said method (root region) is performed in response to execution of programming on a computer configured for processing high-definition video signals .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20090180552A1 CLAIM 9 . A method as recited in claim 1 , wherein said method (root region) is performed in response to execution of programming on a computer configured for processing high-definition video signals .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20090180552A1 CLAIM 9 . A method as recited in claim 1 , wherein said method (root region) is performed in response to execution of programming on a computer configured for processing high-definition video signals .
US10250913B2 CLAIM 15 . A non-transitory computer readable digital storage medium having stored thereon a computer program (computer program) having a program code for performing , when running on a computer , a method according to claim 12 .	US20090180552A1 CLAIM 20 . A computer-readable media containing a computer program (computer program) executable on a computer configured for processing high-resolution video and causing the computer to generate scalable coding in response to steps , comprising : spatial downsampling of a high-resolution video sequence received as input to obtain downsampled video having a lower spatial resolution video signal ; coding of a base-layer of said downsampled video into a decoded base layer utilizing non-textural video coding ; performing texture analysis and classification ; determining structural information from said decoded base-layer ; performing texture synthesis on blocks , which are determined to be texture synthesis compatible , in response to receipt said structural information obtained from said decoded base layer ; coding an enhancement-layer in response to structural information from the base-layer for blocks which were acceptably synthesized , and using a non-textural coding framework for blocks which were not synthesized or for which acceptable synthesized results were not obtained ; and outputting at least one bit stream containing the coded base-layer and the enhancement-layer .
US10250913B2 CLAIM 16 . A non-transitory computer readable digital storage medium having stored thereon a computer program (computer program) having a program code for performing , when running on a computer , a method according to claim 14 .	US20090180552A1 CLAIM 20 . A computer-readable media containing a computer program (computer program) executable on a computer configured for processing high-resolution video and causing the computer to generate scalable coding in response to steps , comprising : spatial downsampling of a high-resolution video sequence received as input to obtain downsampled video having a lower spatial resolution video signal ; coding of a base-layer of said downsampled video into a decoded base layer utilizing non-textural video coding ; performing texture analysis and classification ; determining structural information from said decoded base-layer ; performing texture synthesis on blocks , which are determined to be texture synthesis compatible , in response to receipt said structural information obtained from said decoded base layer ; coding an enhancement-layer in response to structural information from the base-layer for blocks which were acceptably synthesized , and using a non-textural coding framework for blocks which were not synthesized or for which acceptable synthesized results were not obtained ; and outputting at least one bit stream containing the coded base-layer and the enhancement-layer .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20090154567A1 Filed: 2008-09-04 Issued: 2009-06-18 In-loop fidelity enhancement for video compression (Original Assignee) MediaTek Inc (Current Assignee) MediaTek Inc Shaw-Min Lei, Yu-Wen Huang, Xun Guo
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream (entropy decoding) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (entropy coding) information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding (prediction residue) ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set (cost function) of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20090154567A1 CLAIM 1 . An encoder for receiving a video frame and performing encoding processes to generate an encoded bitstream , the encoder comprising : a fidelity enhancement block , for performing a fidelity enhancement technique on processed data utilizing a quad-tree partition , and generating fidelity enhancement information comprising at least one parameter associated with a quad-tree partition structure ; and an entropy coding (second subdivision, intermediate subdivision) block , coupled to the fidelity enhancement block , for encoding the fidelity enhancement information , and embedding the encoded fidelity enhancement information into the encoded bitstream . US20090154567A1 CLAIM 5 . The encoder of claim 1 , further comprising : a prediction block , for performing prediction on the video frame to generate prediction residue (transform coding) s and prediction information ; a transform and quantization block , coupled to the prediction block , for performing transform and quantization processes on the prediction residues ; and a reconstruction loop , coupled between the transform and quantization block and the prediction block , for reconstructing the video frame according to the prediction residues , the information from the transform and quantization block ; wherein the entropy coding block is coupled to the transform and quantization block , and the fidelity enhancement block is in the reconstruction loop . US20090154567A1 CLAIM 12 . The method of claim 11 , wherein the step of utilizing a quad-tree partition method to determine how to partition the video frame further comprises : utilizing a top-down splitting algorithm or a bottom-up merging algorithm and comparing a cost function (first set) result for determining how to partition the video frame . US20090154567A1 CLAIM 18 . A decoder for receiving a bitstream to generate a video frame , comprising : an entropy decoding (data stream) unit , for decoding the bitstream to generate residues and fidelity enhancement information , wherein the fidelity enhancement information comprises at least one parameter associated with a quad-tree partition structure ; and a reconstruction loop , coupled to the entropy decoding unit , for reconstructing the video frame from the residues , wherein the reconstruction loop comprises : a fidelity enhancement block , for receiving the fidelity enhancement information from the entropy decoding unit , and performing fidelity enhancement according to the quad-tree partition structure derived from the fidelity enhancement information .
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set (cost function) of sub-regions : compute a prediction signal based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset of the second set of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	US20090154567A1 CLAIM 12 . The method of claim 11 , wherein the step of utilizing a quad-tree partition method to determine how to partition the video frame further comprises : utilizing a top-down splitting algorithm or a bottom-up merging algorithm and comparing a cost function (first set) result for determining how to partition the video frame .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set (cost function) of root regions such that the first set of root regions are rectangular blocks of a size determined by the first maximum region size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	US20090154567A1 CLAIM 12 . The method of claim 11 , wherein the step of utilizing a quad-tree partition method to determine how to partition the video frame further comprises : utilizing a top-down splitting algorithm or a bottom-up merging algorithm and comparing a cost function (first set) result for determining how to partition the video frame .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set (cost function) of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20090154567A1 CLAIM 12 . The method of claim 11 , wherein the step of utilizing a quad-tree partition method to determine how to partition the video frame further comprises : utilizing a top-down splitting algorithm or a bottom-up merging algorithm and comparing a cost function (first set) result for determining how to partition the video frame .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision information includes a partition indication flag indicating whether any of the first set (cost function) of root regions or the sub-regions at the first or higher-order hierarchy level is sub-divided .	US20090154567A1 CLAIM 12 . The method of claim 11 , wherein the step of utilizing a quad-tree partition method to determine how to partition the video frame further comprises : utilizing a top-down splitting algorithm or a bottom-up merging algorithm and comparing a cost function (first set) result for determining how to partition the video frame .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level from the data stream (entropy decoding) .	US20090154567A1 CLAIM 18 . A decoder for receiving a bitstream to generate a video frame , comprising : an entropy decoding (data stream) unit , for decoding the bitstream to generate residues and fidelity enhancement information , wherein the fidelity enhancement information comprises at least one parameter associated with a quad-tree partition structure ; and a reconstruction loop , coupled to the entropy decoding unit , for reconstructing the video frame from the residues , wherein the reconstruction loop comprises : a fidelity enhancement block , for receiving the fidelity enhancement information from the entropy decoding unit , and performing fidelity enhancement according to the quad-tree partition structure derived from the fidelity enhancement information .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements associated with the first or second set of sub-regions from the data stream (entropy decoding) in a depth-first traversal order .	US20090154567A1 CLAIM 18 . A decoder for receiving a bitstream to generate a video frame , comprising : an entropy decoding (data stream) unit , for decoding the bitstream to generate residues and fidelity enhancement information , wherein the fidelity enhancement information comprises at least one parameter associated with a quad-tree partition structure ; and a reconstruction loop , coupled to the entropy decoding unit , for reconstructing the video frame from the residues , wherein the reconstruction loop comprises : a fidelity enhancement block , for receiving the fidelity enhancement information from the entropy decoding unit , and performing fidelity enhancement according to the quad-tree partition structure derived from the fidelity enhancement information .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream (entropy decoding) , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set (cost function) of sub-regions to obtain an intermediate subdivision (entropy coding) of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20090154567A1 CLAIM 1 . An encoder for receiving a video frame and performing encoding processes to generate an encoded bitstream , the encoder comprising : a fidelity enhancement block , for performing a fidelity enhancement technique on processed data utilizing a quad-tree partition , and generating fidelity enhancement information comprising at least one parameter associated with a quad-tree partition structure ; and an entropy coding (second subdivision, intermediate subdivision) block , coupled to the fidelity enhancement block , for encoding the fidelity enhancement information , and embedding the encoded fidelity enhancement information into the encoded bitstream . US20090154567A1 CLAIM 12 . The method of claim 11 , wherein the step of utilizing a quad-tree partition method to determine how to partition the video frame further comprises : utilizing a top-down splitting algorithm or a bottom-up merging algorithm and comparing a cost function (first set) result for determining how to partition the video frame . US20090154567A1 CLAIM 18 . A decoder for receiving a bitstream to generate a video frame , comprising : an entropy decoding (data stream) unit , for decoding the bitstream to generate residues and fidelity enhancement information , wherein the fidelity enhancement information comprises at least one parameter associated with a quad-tree partition structure ; and a reconstruction loop , coupled to the entropy decoding unit , for reconstructing the video frame from the residues , wherein the reconstruction loop comprises : a fidelity enhancement block , for receiving the fidelity enhancement information from the entropy decoding unit , and performing fidelity enhancement according to the quad-tree partition structure derived from the fidelity enhancement information .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream (entropy decoding) , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding (prediction residue) to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	US20090154567A1 CLAIM 5 . The encoder of claim 1 , further comprising : a prediction block , for performing prediction on the video frame to generate prediction residue (transform coding) s and prediction information ; a transform and quantization block , coupled to the prediction block , for performing transform and quantization processes on the prediction residues ; and a reconstruction loop , coupled between the transform and quantization block and the prediction block , for reconstructing the video frame according to the prediction residues , the information from the transform and quantization block ; wherein the entropy coding block is coupled to the transform and quantization block , and the fidelity enhancement block is in the reconstruction loop . US20090154567A1 CLAIM 18 . A decoder for receiving a bitstream to generate a video frame , comprising : an entropy decoding (data stream) unit , for decoding the bitstream to generate residues and fidelity enhancement information , wherein the fidelity enhancement information comprises at least one parameter associated with a quad-tree partition structure ; and a reconstruction loop , coupled to the entropy decoding unit , for reconstructing the video frame from the residues , wherein the reconstruction loop comprises : a fidelity enhancement block , for receiving the fidelity enhancement information from the entropy decoding unit , and performing fidelity enhancement according to the quad-tree partition structure derived from the fidelity enhancement information .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream (entropy decoding) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (entropy coding) information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding (prediction residue) ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set (cost function) of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20090154567A1 CLAIM 1 . An encoder for receiving a video frame and performing encoding processes to generate an encoded bitstream , the encoder comprising : a fidelity enhancement block , for performing a fidelity enhancement technique on processed data utilizing a quad-tree partition , and generating fidelity enhancement information comprising at least one parameter associated with a quad-tree partition structure ; and an entropy coding (second subdivision, intermediate subdivision) block , coupled to the fidelity enhancement block , for encoding the fidelity enhancement information , and embedding the encoded fidelity enhancement information into the encoded bitstream . US20090154567A1 CLAIM 5 . The encoder of claim 1 , further comprising : a prediction block , for performing prediction on the video frame to generate prediction residue (transform coding) s and prediction information ; a transform and quantization block , coupled to the prediction block , for performing transform and quantization processes on the prediction residues ; and a reconstruction loop , coupled between the transform and quantization block and the prediction block , for reconstructing the video frame according to the prediction residues , the information from the transform and quantization block ; wherein the entropy coding block is coupled to the transform and quantization block , and the fidelity enhancement block is in the reconstruction loop . US20090154567A1 CLAIM 12 . The method of claim 11 , wherein the step of utilizing a quad-tree partition method to determine how to partition the video frame further comprises : utilizing a top-down splitting algorithm or a bottom-up merging algorithm and comparing a cost function (first set) result for determining how to partition the video frame . US20090154567A1 CLAIM 18 . A decoder for receiving a bitstream to generate a video frame , comprising : an entropy decoding (data stream) unit , for decoding the bitstream to generate residues and fidelity enhancement information , wherein the fidelity enhancement information comprises at least one parameter associated with a quad-tree partition structure ; and a reconstruction loop , coupled to the entropy decoding unit , for reconstructing the video frame from the residues , wherein the reconstruction loop comprises : a fidelity enhancement block , for receiving the fidelity enhancement information from the entropy decoding unit , and performing fidelity enhancement according to the quad-tree partition structure derived from the fidelity enhancement information .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set (cost function) of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (entropy coding) information and a maximum hierarchy level ; and a data stream (entropy decoding) generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding (prediction residue) in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20090154567A1 CLAIM 1 . An encoder for receiving a video frame and performing encoding processes to generate an encoded bitstream , the encoder comprising : a fidelity enhancement block , for performing a fidelity enhancement technique on processed data utilizing a quad-tree partition , and generating fidelity enhancement information comprising at least one parameter associated with a quad-tree partition structure ; and an entropy coding (second subdivision, intermediate subdivision) block , coupled to the fidelity enhancement block , for encoding the fidelity enhancement information , and embedding the encoded fidelity enhancement information into the encoded bitstream . US20090154567A1 CLAIM 5 . The encoder of claim 1 , further comprising : a prediction block , for performing prediction on the video frame to generate prediction residue (transform coding) s and prediction information ; a transform and quantization block , coupled to the prediction block , for performing transform and quantization processes on the prediction residues ; and a reconstruction loop , coupled between the transform and quantization block and the prediction block , for reconstructing the video frame according to the prediction residues , the information from the transform and quantization block ; wherein the entropy coding block is coupled to the transform and quantization block , and the fidelity enhancement block is in the reconstruction loop . US20090154567A1 CLAIM 12 . The method of claim 11 , wherein the step of utilizing a quad-tree partition method to determine how to partition the video frame further comprises : utilizing a top-down splitting algorithm or a bottom-up merging algorithm and comparing a cost function (first set) result for determining how to partition the video frame . US20090154567A1 CLAIM 18 . A decoder for receiving a bitstream to generate a video frame , comprising : an entropy decoding (data stream) unit , for decoding the bitstream to generate residues and fidelity enhancement information , wherein the fidelity enhancement information comprises at least one parameter associated with a quad-tree partition structure ; and a reconstruction loop , coupled to the entropy decoding unit , for reconstructing the video frame from the residues , wherein the reconstruction loop comprises : a fidelity enhancement block , for receiving the fidelity enhancement information from the entropy decoding unit , and performing fidelity enhancement according to the quad-tree partition structure derived from the fidelity enhancement information .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set (cost function) of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (entropy coding) information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding (prediction residue) in accordance with the second set of sub-regions ; and inserting into a data stream (entropy decoding) the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20090154567A1 CLAIM 1 . An encoder for receiving a video frame and performing encoding processes to generate an encoded bitstream , the encoder comprising : a fidelity enhancement block , for performing a fidelity enhancement technique on processed data utilizing a quad-tree partition , and generating fidelity enhancement information comprising at least one parameter associated with a quad-tree partition structure ; and an entropy coding (second subdivision, intermediate subdivision) block , coupled to the fidelity enhancement block , for encoding the fidelity enhancement information , and embedding the encoded fidelity enhancement information into the encoded bitstream . US20090154567A1 CLAIM 5 . The encoder of claim 1 , further comprising : a prediction block , for performing prediction on the video frame to generate prediction residue (transform coding) s and prediction information ; a transform and quantization block , coupled to the prediction block , for performing transform and quantization processes on the prediction residues ; and a reconstruction loop , coupled between the transform and quantization block and the prediction block , for reconstructing the video frame according to the prediction residues , the information from the transform and quantization block ; wherein the entropy coding block is coupled to the transform and quantization block , and the fidelity enhancement block is in the reconstruction loop . US20090154567A1 CLAIM 12 . The method of claim 11 , wherein the step of utilizing a quad-tree partition method to determine how to partition the video frame further comprises : utilizing a top-down splitting algorithm or a bottom-up merging algorithm and comparing a cost function (first set) result for determining how to partition the video frame . US20090154567A1 CLAIM 18 . A decoder for receiving a bitstream to generate a video frame , comprising : an entropy decoding (data stream) unit , for decoding the bitstream to generate residues and fidelity enhancement information , wherein the fidelity enhancement information comprises at least one parameter associated with a quad-tree partition structure ; and a reconstruction loop , coupled to the entropy decoding unit , for reconstructing the video frame from the residues , wherein the reconstruction loop comprises : a fidelity enhancement block , for receiving the fidelity enhancement information from the entropy decoding unit , and performing fidelity enhancement according to the quad-tree partition structure derived from the fidelity enhancement information .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20100046626A1 Filed: 2008-08-22 Issued: 2010-02-25 Entropy coding/decoding of hierarchically organized data (Original Assignee) Microsoft Corp (Current Assignee) Microsoft Technology Licensing LLC Chengjie Tu, Shankar Regunathan, Shijun Sun, Chih-Lung Lin
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding (coded block pattern) and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set (software instructions) of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20100046626A1 CLAIM 9 . The method of claim 1 wherein : in a first stage , the set is a macroblock , the set symbol of the macroblock is for a coded block pattern (prediction coding) of the macroblock , and the symbol combination code indicates a luma block type and chroma block type for luma blocks and chroma blocks of the macroblock ; and in a later stage for each of the luma blocks and the chroma blocks of the macroblock , the set is the block , the set symbol of the block is block type of the block , and the data values in the block are quantized transform coefficients . US20100046626A1 CLAIM 10 . One or more storage media storing computer software instructions (first set) for causing a computer system to perform a method of encoding data as a set that has a hierarchy of subsets with set symbols , the method comprising : receiving data values ; and encoding the data values as a set , including : evaluating the data values of the set ; selectively encoding a symbol combination code that indicates respective set symbols of plural subsets of the set ; and for each of the plural subsets considered as a new set , selectively repeating the evaluating , the selective encoding and the selective repeating for the new set . US20100046626A1 CLAIM 19 . A video decoder comprising : a processor ; and one or more storage media storing computer software instructions for causing a computer system to perform a method of decoding quantized transform coefficients in plural sets (information samples using prediction coding) , each of the plural sets having a set symbol and plural subsets with set symbols , wherein the method includes , for each of the plural sets , reconstructing the set by : evaluating a set symbol of the set ; selectively variable length decoding a symbol combination code that indicates respective set symbols of plural subsets of the set , including skipping the variable length decoding when the set symbol of the set is a first symbol element and otherwise performing the variable length decoding ; assigning the respective set symbols to the plural subsets of the set ; and for each of the plural subsets considered as a new set , repeating the reconstructing for the new set when the subset has multiple data values .
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set (software instructions) of sub-regions : compute a prediction signal based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset of the second set of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	US20100046626A1 CLAIM 10 . One or more storage media storing computer software instructions (first set) for causing a computer system to perform a method of encoding data as a set that has a hierarchy of subsets with set symbols , the method comprising : receiving data values ; and encoding the data values as a set , including : evaluating the data values of the set ; selectively encoding a symbol combination code that indicates respective set symbols of plural subsets of the set ; and for each of the plural subsets considered as a new set , selectively repeating the evaluating , the selective encoding and the selective repeating for the new set .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set (software instructions) of root regions such that the first set of root regions are rectangular blocks of a size determined by the first maximum region size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	US20100046626A1 CLAIM 10 . One or more storage media storing computer software instructions (first set) for causing a computer system to perform a method of encoding data as a set that has a hierarchy of subsets with set symbols , the method comprising : receiving data values ; and encoding the data values as a set , including : evaluating the data values of the set ; selectively encoding a symbol combination code that indicates respective set symbols of plural subsets of the set ; and for each of the plural subsets considered as a new set , selectively repeating the evaluating , the selective encoding and the selective repeating for the new set .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set (software instructions) of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule (coding data) associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20100046626A1 CLAIM 1 . A method of decoding data (partition rule) encoded as a set that has a hierarchy of subsets with set symbols , the method comprising : receiving encoded data ; and using the encoded data , reconstructing data values encoded as a set , including : evaluating a set symbol of the set ; selectively decoding a symbol combination code that indicates respective set symbols of plural subsets of the set ; assigning the respective set symbols to the plural subsets of the set ; and for each of the plural subsets considered as a new set , selectively repeating the reconstructing for the new set . US20100046626A1 CLAIM 10 . One or more storage media storing computer software instructions (first set) for causing a computer system to perform a method of encoding data as a set that has a hierarchy of subsets with set symbols , the method comprising : receiving data values ; and encoding the data values as a set , including : evaluating the data values of the set ; selectively encoding a symbol combination code that indicates respective set symbols of plural subsets of the set ; and for each of the plural subsets considered as a new set , selectively repeating the evaluating , the selective encoding and the selective repeating for the new set .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision information includes a partition indication flag indicating whether any of the first set (software instructions) of root regions or the sub-regions at the first or higher-order hierarchy level is sub-divided .	US20100046626A1 CLAIM 10 . One or more storage media storing computer software instructions (first set) for causing a computer system to perform a method of encoding data as a set that has a hierarchy of subsets with set symbols , the method comprising : receiving data values ; and encoding the data values as a set , including : evaluating the data values of the set ; selectively encoding a symbol combination code that indicates respective set symbols of plural subsets of the set ; and for each of the plural subsets considered as a new set , selectively repeating the evaluating , the selective encoding and the selective repeating for the new set .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set (software instructions) of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20100046626A1 CLAIM 10 . One or more storage media storing computer software instructions (first set) for causing a computer system to perform a method of encoding data as a set that has a hierarchy of subsets with set symbols , the method comprising : receiving data values ; and encoding the data values as a set , including : evaluating the data values of the set ; selectively encoding a symbol combination code that indicates respective set symbols of plural subsets of the set ; and for each of the plural subsets considered as a new set , selectively repeating the evaluating , the selective encoding and the selective repeating for the new set .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding (coded block pattern) and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set (software instructions) of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20100046626A1 CLAIM 9 . The method of claim 1 wherein : in a first stage , the set is a macroblock , the set symbol of the macroblock is for a coded block pattern (prediction coding) of the macroblock , and the symbol combination code indicates a luma block type and chroma block type for luma blocks and chroma blocks of the macroblock ; and in a later stage for each of the luma blocks and the chroma blocks of the macroblock , the set is the block , the set symbol of the block is block type of the block , and the data values in the block are quantized transform coefficients . US20100046626A1 CLAIM 10 . One or more storage media storing computer software instructions (first set) for causing a computer system to perform a method of encoding data as a set that has a hierarchy of subsets with set symbols , the method comprising : receiving data values ; and encoding the data values as a set , including : evaluating the data values of the set ; selectively encoding a symbol combination code that indicates respective set symbols of plural subsets of the set ; and for each of the plural subsets considered as a new set , selectively repeating the evaluating , the selective encoding and the selective repeating for the new set . US20100046626A1 CLAIM 19 . A video decoder comprising : a processor ; and one or more storage media storing computer software instructions for causing a computer system to perform a method of decoding quantized transform coefficients in plural sets (information samples using prediction coding) , each of the plural sets having a set symbol and plural subsets with set symbols , wherein the method includes , for each of the plural sets , reconstructing the set by : evaluating a set symbol of the set ; selectively variable length decoding a symbol combination code that indicates respective set symbols of plural subsets of the set , including skipping the variable length decoding when the set symbol of the set is a first symbol element and otherwise performing the variable length decoding ; assigning the respective set symbols to the plural subsets of the set ; and for each of the plural subsets considered as a new set , repeating the reconstructing for the new set when the subset has multiple data values .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set (software instructions) of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding (coded block pattern) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20100046626A1 CLAIM 9 . The method of claim 1 wherein : in a first stage , the set is a macroblock , the set symbol of the macroblock is for a coded block pattern (prediction coding) of the macroblock , and the symbol combination code indicates a luma block type and chroma block type for luma blocks and chroma blocks of the macroblock ; and in a later stage for each of the luma blocks and the chroma blocks of the macroblock , the set is the block , the set symbol of the block is block type of the block , and the data values in the block are quantized transform coefficients . US20100046626A1 CLAIM 10 . One or more storage media storing computer software instructions (first set) for causing a computer system to perform a method of encoding data as a set that has a hierarchy of subsets with set symbols , the method comprising : receiving data values ; and encoding the data values as a set , including : evaluating the data values of the set ; selectively encoding a symbol combination code that indicates respective set symbols of plural subsets of the set ; and for each of the plural subsets considered as a new set , selectively repeating the evaluating , the selective encoding and the selective repeating for the new set . US20100046626A1 CLAIM 19 . A video decoder comprising : a processor ; and one or more storage media storing computer software instructions for causing a computer system to perform a method of decoding quantized transform coefficients in plural sets (information samples using prediction coding) , each of the plural sets having a set symbol and plural subsets with set symbols , wherein the method includes , for each of the plural sets , reconstructing the set by : evaluating a set symbol of the set ; selectively variable length decoding a symbol combination code that indicates respective set symbols of plural subsets of the set , including skipping the variable length decoding when the set symbol of the set is a first symbol element and otherwise performing the variable length decoding ; assigning the respective set symbols to the plural subsets of the set ; and for each of the plural subsets considered as a new set , repeating the reconstructing for the new set when the subset has multiple data values .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set (software instructions) of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding (coded block pattern) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20100046626A1 CLAIM 9 . The method of claim 1 wherein : in a first stage , the set is a macroblock , the set symbol of the macroblock is for a coded block pattern (prediction coding) of the macroblock , and the symbol combination code indicates a luma block type and chroma block type for luma blocks and chroma blocks of the macroblock ; and in a later stage for each of the luma blocks and the chroma blocks of the macroblock , the set is the block , the set symbol of the block is block type of the block , and the data values in the block are quantized transform coefficients . US20100046626A1 CLAIM 10 . One or more storage media storing computer software instructions (first set) for causing a computer system to perform a method of encoding data as a set that has a hierarchy of subsets with set symbols , the method comprising : receiving data values ; and encoding the data values as a set , including : evaluating the data values of the set ; selectively encoding a symbol combination code that indicates respective set symbols of plural subsets of the set ; and for each of the plural subsets considered as a new set , selectively repeating the evaluating , the selective encoding and the selective repeating for the new set . US20100046626A1 CLAIM 19 . A video decoder comprising : a processor ; and one or more storage media storing computer software instructions for causing a computer system to perform a method of decoding quantized transform coefficients in plural sets (information samples using prediction coding) , each of the plural sets having a set symbol and plural subsets with set symbols , wherein the method includes , for each of the plural sets , reconstructing the set by : evaluating a set symbol of the set ; selectively variable length decoding a symbol combination code that indicates respective set symbols of plural subsets of the set , including skipping the variable length decoding when the set symbol of the set is a first symbol element and otherwise performing the variable length decoding ; assigning the respective set symbols to the plural subsets of the set ; and for each of the plural subsets considered as a new set , repeating the reconstructing for the new set when the subset has multiple data values .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20090096643A1 Filed: 2008-08-11 Issued: 2009-04-16 System and Method for Context-Based Adaptive Binary Arithematic Encoding and Decoding (Original Assignee) Industrial Technology Research Institute ITRI (Current Assignee) Industrial Technology Research Institute ITRI Yuan-Teng Chang
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size (calculating device) and the first subdivision information are associated with prediction coding and the second maximum region size (calculating device) and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root (second lookup table, first lookup table) region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20090096643A1 CLAIM 1 . A system for context-based adaptive binary arithmetic encoding and decoding , the system comprising : a calculating device (first maximum region size, second maximum region size) configured to calculate an index value for one of a first bin to be encoded and a second bin to be decoded ; a memory device to store context models in cluster , wherein the index value for one of the first bin and the second bin is related to one of the context models ; and a binary arithmetic unit configured to serve as one of an encoder for encoding the first bin based on the one context model and a decoder for decoding the second bin based on the one context model . US20090096643A1 CLAIM 10 . The system of claim 9 further comprising : a first lookup table (respective root) configured to generate a first value of a second variable in response to the one context model ; a second lookup table (respective root) configured to generate a second value of the second variable in response to the updated context model ; and a multiplexer to select one of the first value and the second value .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set of root regions such that the first set of root regions are rectangular blocks of a size determined by the first maximum region size (calculating device) , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	US20090096643A1 CLAIM 1 . A system for context-based adaptive binary arithmetic encoding and decoding , the system comprising : a calculating device (first maximum region size, second maximum region size) configured to calculate an index value for one of a first bin to be encoded and a second bin to be decoded ; a memory device to store context models in cluster , wherein the index value for one of the first bin and the second bin is related to one of the context models ; and a binary arithmetic unit configured to serve as one of an encoder for encoding the first bin based on the one context model and a decoder for decoding the second bin based on the one context model .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule (first calculating) associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20090096643A1 CLAIM 7 . The system of claim 1 further comprising a first buffer to store information from a top block and a second buffer to store information from a left block , wherein the calculating device includes a first calculating (partition rule) module configured to calculate a first variable based on the information from the first buffer and the second buffer .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements (second syntax element, syntax elements) associated with the first or second set of sub-regions from the data stream in a depth-first traversal order .	US20090096643A1 CLAIM 11 . The system of claim 1 , wherein the memory device includes a first register bank to store a context model cluster for a syntax element “last significant coeff flag” (LSCF) , and a second register bank to store context model clusters for other syntax elements (syntax elements) . US20090096643A1 CLAIM 26 . A method of context-based adaptive binary arithmetic encoding and decoding in a pipeline flow , the method comprising : reading context models related to a first syntax element , obtaining information from at least one neighbor block and calculating a variable based on the information from the at least one neighbor block at a first clock cycle ; calculating a first index value for a first bin of the first syntax element based on the variable and loading one of the context models for the first bin of the first syntax element based on said first index value at a second clock cycle ; reading context models related to a second syntax element (syntax elements) at the second clock cycle , wherein the first syntax element and the second syntax element occur in pair in data processing ; decoding the first bin of the first syntax element based on the one context model related to the first bin of the first syntax element and obtaining a value of the first bin of the first syntax element at a third clock cycle ; calculating a first index value for a first bin of the second syntax element based on the variable and loading one of the context models for the first bin of the second syntax element based on said first index value at the third clock cycle in response to one level of the value of the first bin of the first syntax element ; and calculating a second index value for a second bin of the first syntax element based on the variable and loading one of the context models for the second bin of the first syntax element based on said second index value at the third clock cycle in response to the other one level of the value of the first bin of the first syntax element .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements (second syntax element, syntax elements) of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20090096643A1 CLAIM 11 . The system of claim 1 , wherein the memory device includes a first register bank to store a context model cluster for a syntax element “last significant coeff flag” (LSCF) , and a second register bank to store context model clusters for other syntax elements (syntax elements) . US20090096643A1 CLAIM 26 . A method of context-based adaptive binary arithmetic encoding and decoding in a pipeline flow , the method comprising : reading context models related to a first syntax element , obtaining information from at least one neighbor block and calculating a variable based on the information from the at least one neighbor block at a first clock cycle ; calculating a first index value for a first bin of the first syntax element based on the variable and loading one of the context models for the first bin of the first syntax element based on said first index value at a second clock cycle ; reading context models related to a second syntax element (syntax elements) at the second clock cycle , wherein the first syntax element and the second syntax element occur in pair in data processing ; decoding the first bin of the first syntax element based on the one context model related to the first bin of the first syntax element and obtaining a value of the first bin of the first syntax element at a third clock cycle ; calculating a first index value for a first bin of the second syntax element based on the variable and loading one of the context models for the first bin of the second syntax element based on said first index value at the third clock cycle in response to one level of the value of the first bin of the first syntax element ; and calculating a second index value for a second bin of the first syntax element based on the variable and loading one of the context models for the second bin of the first syntax element based on said second index value at the third clock cycle in response to the other one level of the value of the first bin of the first syntax element .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size (calculating device) and the first subdivision information are associated with prediction coding and the second maximum region size (calculating device) and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root (second lookup table, first lookup table) region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20090096643A1 CLAIM 1 . A system for context-based adaptive binary arithmetic encoding and decoding , the system comprising : a calculating device (first maximum region size, second maximum region size) configured to calculate an index value for one of a first bin to be encoded and a second bin to be decoded ; a memory device to store context models in cluster , wherein the index value for one of the first bin and the second bin is related to one of the context models ; and a binary arithmetic unit configured to serve as one of an encoder for encoding the first bin based on the one context model and a decoder for decoding the second bin based on the one context model . US20090096643A1 CLAIM 10 . The system of claim 9 further comprising : a first lookup table (respective root) configured to generate a first value of a second variable in response to the one context model ; a second lookup table (respective root) configured to generate a second value of the second variable in response to the updated context model ; and a multiplexer to select one of the first value and the second value .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size (calculating device) , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size (calculating device) , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root (second lookup table, first lookup table) region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20090096643A1 CLAIM 1 . A system for context-based adaptive binary arithmetic encoding and decoding , the system comprising : a calculating device (first maximum region size, second maximum region size) configured to calculate an index value for one of a first bin to be encoded and a second bin to be decoded ; a memory device to store context models in cluster , wherein the index value for one of the first bin and the second bin is related to one of the context models ; and a binary arithmetic unit configured to serve as one of an encoder for encoding the first bin based on the one context model and a decoder for decoding the second bin based on the one context model . US20090096643A1 CLAIM 10 . The system of claim 9 further comprising : a first lookup table (respective root) configured to generate a first value of a second variable in response to the one context model ; a second lookup table (respective root) configured to generate a second value of the second variable in response to the updated context model ; and a multiplexer to select one of the first value and the second value .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size (calculating device) ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size (calculating device) ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root (second lookup table, first lookup table) region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20090096643A1 CLAIM 1 . A system for context-based adaptive binary arithmetic encoding and decoding , the system comprising : a calculating device (first maximum region size, second maximum region size) configured to calculate an index value for one of a first bin to be encoded and a second bin to be decoded ; a memory device to store context models in cluster , wherein the index value for one of the first bin and the second bin is related to one of the context models ; and a binary arithmetic unit configured to serve as one of an encoder for encoding the first bin based on the one context model and a decoder for decoding the second bin based on the one context model . US20090096643A1 CLAIM 10 . The system of claim 9 further comprising : a first lookup table (respective root) configured to generate a first value of a second variable in response to the one context model ; a second lookup table (respective root) configured to generate a second value of the second variable in response to the updated context model ; and a multiplexer to select one of the first value and the second value .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	CN101682770A Filed: 2008-06-12 Issued: 2010-03-24 视频块预测模式的自适应译码 (Original Assignee) 高通股份有限公司叶琰, 马尔塔·卡切维奇
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal (余预测) based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset of the second set of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	CN101682770A CLAIM 12 . 根据权利要求1所述的方法，其中基于所述译码单元的一个或一个以上先前经编码视频块的预测模式对所述当前视频块的所述预测模式进行编码包含：对表示所述预测模式的第一位进行编码以指示所述当前块的所述预测模式与所述一个或一个以上先前经编码视频块的所述预测模式中的任一者不相同；从所述多个预测模式中移除所述一个或一个以上先前经编码视频块的至少所述预测模式；当所述译码单元的所述先前经编码视频块中的两者或两者以上具有相同预测模式时，移除并非所述一个或一个以上先前经编码视频块的预测模式的至少一个额外预测模式；在所述多个预测模式的剩余预测 (prediction signal) 模式当中临时重新布置预测模式识别符；以及对识别对应于所述当前视频块的所述预测模式的所述预测模式识别符的码字进行编码。
US10250913B2 CLAIM 11 . The decoder according to claim 1 , wherein the recursive multi-tree partitioning includes a quadtree partitioning technique (的变换) .	CN101682770A CLAIM 9 . 根据权利要求4所述的方法，其进一步包含存储各自符合所述预测模式中的一者的多个方向性变换，其中所述多个方向性变换中的每一者包含大小为A^xA^的变换 (quadtree partitioning technique) 矩阵，其中W为所述视频块的维度。

CN101682770A

Filed: 2008-06-12 Issued: 2010-03-24

视频块预测模式的自适应译码

(Original Assignee) 高通股份有限公司

叶琰, 马尔塔·卡切维奇

US10250913B2
CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal (余预测) based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset of the second set of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .

CN101682770A
CLAIM 12 . 根据权利要求1所述的方法，其中基于所述译码单元的一个或一个以上先前经编码视频块的预测模式对所述当前视频块的所述预测模式进行编码包含：对表示所述预测模式的第一位进行编码以指示所述当前块的所述预测模式与所述一个或一个以上先前经编码视频块的所述预测模式中的任一者不相同；从所述多个预测模式中移除所述一个或一个以上先前经编码视频块的至少所述预测模式；当所述译码单元的所述先前经编码视频块中的两者或两者以上具有相同预测模式时，移除并非所述一个或一个以上先前经编码视频块的预测模式的至少一个额外预测模式；在所述多个预测模式的剩余预测 (prediction signal) 模式当中临时重新布置预测模式识别符；以及对识别对应于所述当前视频块的所述预测模式的所述预测模式识别符的码字进行编码。

US10250913B2
CLAIM 11 . The decoder according to claim 1 , wherein the recursive multi-tree partitioning includes a quadtree partitioning technique (的变换) .

CN101682770A
CLAIM 9 . 根据权利要求4所述的方法，其进一步包含存储各自符合所述预测模式中的一者的多个方向性变换，其中所述多个方向性变换中的每一者包含大小为A^xA^的变换 (quadtree partitioning technique) 矩阵，其中W为所述视频块的维度。

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20090296017A1 Filed: 2008-06-11 Issued: 2009-12-03 Line light source device, plane light emission device, plane light source device, and liquid crystal display (Original Assignee) Sharp Corp (Current Assignee) Sharp Corp Shin Itoh, Masato Sumikawa, Yoshinobu Nakamura, Masahiro Ikehara, Tsukasa Inoguchi
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level (side surfaces) wherein the first maximum region size (surface regions) and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20090296017A1 CLAIM 7 . A line light source device as claimed in claim 1 , wherein the first recesses each have a plurality of protrusions or the first recesses each have a rough surface section having a surface finish rougher than that of the resin surface regions (first maximum region size) aligning with the light emission elements in the direction of the normal . US20090296017A1 CLAIM 11 . A line light source device as claimed in claim 1 , wherein a light emission end of each of the light emission elements with respect to the direction of the normal has a generally trapezoidal shape in a section in the longitudinal direction , and directions of normals to side surfaces (maximum hierarchy level) of the end of the light emission element with respect to the longitudinal direction are slanted relative to the direction of the normal to the surface of the board .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set of root regions such that the first set of root regions are rectangular blocks of a size determined by the first maximum region size (surface regions) , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	US20090296017A1 CLAIM 7 . A line light source device as claimed in claim 1 , wherein the first recesses each have a plurality of protrusions or the first recesses each have a rough surface section having a surface finish rougher than that of the resin surface regions (first maximum region size) aligning with the light emission elements in the direction of the normal .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level (side surfaces) is reached .	US20090296017A1 CLAIM 11 . A line light source device as claimed in claim 1 , wherein a light emission end of each of the light emission elements with respect to the direction of the normal has a generally trapezoidal shape in a section in the longitudinal direction , and directions of normals to side surfaces (maximum hierarchy level) of the end of the light emission element with respect to the longitudinal direction are slanted relative to the direction of the normal to the surface of the board .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision information includes a partition indication flag (crystal display) indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level is sub-divided .	US20090296017A1 CLAIM 13 . A liquid crystal display (partition indication flag) comprising the plane light emission device as claimed in claim 12 .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level (side surfaces) from the data stream .	US20090296017A1 CLAIM 11 . A line light source device as claimed in claim 1 , wherein a light emission end of each of the light emission elements with respect to the direction of the normal has a generally trapezoidal shape in a section in the longitudinal direction , and directions of normals to side surfaces (maximum hierarchy level) of the end of the light emission element with respect to the longitudinal direction are slanted relative to the direction of the normal to the surface of the board .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level (side surfaces) , wherein the first maximum region size (surface regions) and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20090296017A1 CLAIM 7 . A line light source device as claimed in claim 1 , wherein the first recesses each have a plurality of protrusions or the first recesses each have a rough surface section having a surface finish rougher than that of the resin surface regions (first maximum region size) aligning with the light emission elements in the direction of the normal . US20090296017A1 CLAIM 11 . A line light source device as claimed in claim 1 , wherein a light emission end of each of the light emission elements with respect to the direction of the normal has a generally trapezoidal shape in a section in the longitudinal direction , and directions of normals to side surfaces (maximum hierarchy level) of the end of the light emission element with respect to the longitudinal direction are slanted relative to the direction of the normal to the surface of the board .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size (surface regions) , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level (side surfaces) ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20090296017A1 CLAIM 7 . A line light source device as claimed in claim 1 , wherein the first recesses each have a plurality of protrusions or the first recesses each have a rough surface section having a surface finish rougher than that of the resin surface regions (first maximum region size) aligning with the light emission elements in the direction of the normal . US20090296017A1 CLAIM 11 . A line light source device as claimed in claim 1 , wherein a light emission end of each of the light emission elements with respect to the direction of the normal has a generally trapezoidal shape in a section in the longitudinal direction , and directions of normals to side surfaces (maximum hierarchy level) of the end of the light emission element with respect to the longitudinal direction are slanted relative to the direction of the normal to the surface of the board .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size (surface regions) ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level (side surfaces) ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20090296017A1 CLAIM 7 . A line light source device as claimed in claim 1 , wherein the first recesses each have a plurality of protrusions or the first recesses each have a rough surface section having a surface finish rougher than that of the resin surface regions (first maximum region size) aligning with the light emission elements in the direction of the normal . US20090296017A1 CLAIM 11 . A line light source device as claimed in claim 1 , wherein a light emission end of each of the light emission elements with respect to the direction of the normal has a generally trapezoidal shape in a section in the longitudinal direction , and directions of normals to side surfaces (maximum hierarchy level) of the end of the light emission element with respect to the longitudinal direction are slanted relative to the direction of the normal to the surface of the board .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20080310504A1 Filed: 2008-06-04 Issued: 2008-12-18 Adaptive coefficient scanning for video coding (Original Assignee) Qualcomm Inc (Current Assignee) Velos Media LLC Yan Ye, Marta Karczewicz
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream (entropy decoding) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (entropy coding) information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20080310504A1 CLAIM 1 . A method of coding video data , the method comprising : scanning coefficient values of a first video block using a coefficient scan order ; collecting statistics associated with at least a portion of the coefficient values ; adjusting the coefficient scan order in accordance with the collected statistics ; scanning coefficient values of at least one subsequent video block using the adjusted coefficient scan order when the at least one subsequent video block exists in a coding unit of the first video block ; and entropy coding (second subdivision, intermediate subdivision) the coefficient values . US20080310504A1 CLAIM 12 . The method of claim 1 , wherein : scanning the coefficient values of the first video block comprises generating a two-dimensional block of coefficient values from a one-dimensional vector of coefficient values based on the coefficient scan order ; and entropy coding comprises entropy decoding (data stream) the one-dimensional vector prior to scanning the coefficient values .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level from the data stream (entropy decoding) .	US20080310504A1 CLAIM 12 . The method of claim 1 , wherein : scanning the coefficient values of the first video block comprises generating a two-dimensional block of coefficient values from a one-dimensional vector of coefficient values based on the coefficient scan order ; and entropy coding comprises entropy decoding (data stream) the one-dimensional vector prior to scanning the coefficient values .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements (video coding) associated with the first or second set of sub-regions from the data stream (entropy decoding) in a depth-first traversal order .	US20080310504A1 CLAIM 12 . The method of claim 1 , wherein : scanning the coefficient values of the first video block comprises generating a two-dimensional block of coefficient values from a one-dimensional vector of coefficient values based on the coefficient scan order ; and entropy coding comprises entropy decoding (data stream) the one-dimensional vector prior to scanning the coefficient values . US20080310504A1 CLAIM 29 . A computer-readable medium upon which is stored instructions that upon execution in a video coding (syntax elements) device cause the device to code video blocks , wherein the instructions cause the device to : scan coefficient values of a first video block using a coefficient scan order ; collect statistics associated with at least a portion of the coefficient values ; adjust the coefficient scan order in accordance with the collected statistics ; scan coefficient values of at least one subsequent video block using the adjusted coefficient scan order when the at least one subsequent video block exists in a coding unit of the first video block ; and entropy code the coefficient values .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements (video coding) of the data stream (entropy decoding) , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision (entropy coding) of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20080310504A1 CLAIM 1 . A method of coding video data , the method comprising : scanning coefficient values of a first video block using a coefficient scan order ; collecting statistics associated with at least a portion of the coefficient values ; adjusting the coefficient scan order in accordance with the collected statistics ; scanning coefficient values of at least one subsequent video block using the adjusted coefficient scan order when the at least one subsequent video block exists in a coding unit of the first video block ; and entropy coding (second subdivision, intermediate subdivision) the coefficient values . US20080310504A1 CLAIM 12 . The method of claim 1 , wherein : scanning the coefficient values of the first video block comprises generating a two-dimensional block of coefficient values from a one-dimensional vector of coefficient values based on the coefficient scan order ; and entropy coding comprises entropy decoding (data stream) the one-dimensional vector prior to scanning the coefficient values . US20080310504A1 CLAIM 29 . A computer-readable medium upon which is stored instructions that upon execution in a video coding (syntax elements) device cause the device to code video blocks , wherein the instructions cause the device to : scan coefficient values of a first video block using a coefficient scan order ; collect statistics associated with at least a portion of the coefficient values ; adjust the coefficient scan order in accordance with the collected statistics ; scan coefficient values of at least one subsequent video block using the adjusted coefficient scan order when the at least one subsequent video block exists in a coding unit of the first video block ; and entropy code the coefficient values .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream (entropy decoding) , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	US20080310504A1 CLAIM 12 . The method of claim 1 , wherein : scanning the coefficient values of the first video block comprises generating a two-dimensional block of coefficient values from a one-dimensional vector of coefficient values based on the coefficient scan order ; and entropy coding comprises entropy decoding (data stream) the one-dimensional vector prior to scanning the coefficient values .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream (entropy decoding) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (entropy coding) information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20080310504A1 CLAIM 1 . A method of coding video data , the method comprising : scanning coefficient values of a first video block using a coefficient scan order ; collecting statistics associated with at least a portion of the coefficient values ; adjusting the coefficient scan order in accordance with the collected statistics ; scanning coefficient values of at least one subsequent video block using the adjusted coefficient scan order when the at least one subsequent video block exists in a coding unit of the first video block ; and entropy coding (second subdivision, intermediate subdivision) the coefficient values . US20080310504A1 CLAIM 12 . The method of claim 1 , wherein : scanning the coefficient values of the first video block comprises generating a two-dimensional block of coefficient values from a one-dimensional vector of coefficient values based on the coefficient scan order ; and entropy coding comprises entropy decoding (data stream) the one-dimensional vector prior to scanning the coefficient values .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (entropy coding) information and a maximum hierarchy level ; and a data stream (entropy decoding) generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20080310504A1 CLAIM 1 . A method of coding video data , the method comprising : scanning coefficient values of a first video block using a coefficient scan order ; collecting statistics associated with at least a portion of the coefficient values ; adjusting the coefficient scan order in accordance with the collected statistics ; scanning coefficient values of at least one subsequent video block using the adjusted coefficient scan order when the at least one subsequent video block exists in a coding unit of the first video block ; and entropy coding (second subdivision, intermediate subdivision) the coefficient values . US20080310504A1 CLAIM 12 . The method of claim 1 , wherein : scanning the coefficient values of the first video block comprises generating a two-dimensional block of coefficient values from a one-dimensional vector of coefficient values based on the coefficient scan order ; and entropy coding comprises entropy decoding (data stream) the one-dimensional vector prior to scanning the coefficient values .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (entropy coding) information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream (entropy decoding) the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20080310504A1 CLAIM 1 . A method of coding video data , the method comprising : scanning coefficient values of a first video block using a coefficient scan order ; collecting statistics associated with at least a portion of the coefficient values ; adjusting the coefficient scan order in accordance with the collected statistics ; scanning coefficient values of at least one subsequent video block using the adjusted coefficient scan order when the at least one subsequent video block exists in a coding unit of the first video block ; and entropy coding (second subdivision, intermediate subdivision) the coefficient values . US20080310504A1 CLAIM 12 . The method of claim 1 , wherein : scanning the coefficient values of the first video block comprises generating a two-dimensional block of coefficient values from a one-dimensional vector of coefficient values based on the coefficient scan order ; and entropy coding comprises entropy decoding (data stream) the one-dimensional vector prior to scanning the coefficient values .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	CN101682763A Filed: 2008-05-29 Issued: 2010-03-24 支持针对片数据的多通路视频语法结构的方法和设备 (Original Assignee) 汤姆森许可贸易公司奥斯卡·迪沃拉埃斯科达, 尹鹏, 普尔温·比贝哈斯·潘迪特
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information (视频信号) , information related to first and second maximum region (种方法) sizes (至少一个语法元素) , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN101682763A CLAIM 1、一种设备，包括：编码器(300)，用于对与图像的至少一部分的至少两个分块有关的至少一个语法数据元素进行编码，其中，所述至少一个语法元素 (second maximum region sizes) 被编码在多通路语法结构内，所述至少一个语法元素属于给定的数据类，并且所述编码器在对下个数据类进行编码之前对关于所述图像的至少所述部分的所有分块的所述至少一个语法数据元素进行编码，其中，关于比所述下个类更早编码的在先编码数据类，包括所述下个类在内的在后编码数据类具有因果相依性和非因果相依性当中的至少一个的显式编码和隐式编码当中的至少一个。 CN101682763A CLAIM 7、一种方法 (second maximum region) ，包括：对于与图像的至少一部分的至少两个分块相关的至少一个语法数据元素进行编码，其中，所述至少一个语法元素被编码在多通路语法结构内，所述至少一个语法元素属于给定的数据类，并且所述编码步骤在对下个数据类进行编码之前对关于所述图像的至少所述部分的所有分块的所述至少一个语法数据元素进行编码，其中，关于比所述下个类更早编码的在先编码数据类，包括所述下个类在内的在后编码数据类具有因果相依性和非因果相依性当中的至少一个的显式编码和隐式编码当中的至少一个(515、530、545)。 CN101682763A CLAIM 25、一种其上编码了视频信号 (video information) 数据的存储介质，包括：与图像的至少一部分的至少两个分块有关的至少一个语法数据元素，其中，所述至少一个语法元素被编码在多通路语法结构内，所述至少一个语法元素属于给定的数据类，并且在对下个数据类进行解码之前对关于所述图像的至少所述部分的所有分块的所述至少一个语法数据元素进行编码，其中，关于比所述下个类更早编码的在先编码数据类，包括所述下个类在内的在后编码数据类具有因果相依性和非因果相依性当中的至少一个的显式编码和隐式编码当中的至少一个。
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal based on an intra-prediction mode (编码标准) associated with the sub-region and reconstructed samples of a neighboring subset of the second set of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle (编码标准) .	CN101682763A CLAIM 2、根据权利要求1所述的设备，其中，编码器(300)是现有视频编码标准 (intra-prediction mode, next intra-prediction cycle) 或视频编码推荐标准的现有编码器的扩展版本。
US10250913B2 CLAIM 11 . The decoder according to claim 1 , wherein the recursive multi-tree partitioning includes a quadtree partitioning (显式编码) technique .	CN101682763A CLAIM 1、一种设备，包括：编码器(300)，用于对与图像的至少一部分的至少两个分块有关的至少一个语法数据元素进行编码，其中，所述至少一个语法元素被编码在多通路语法结构内，所述至少一个语法元素属于给定的数据类，并且所述编码器在对下个数据类进行编码之前对关于所述图像的至少所述部分的所有分块的所述至少一个语法数据元素进行编码，其中，关于比所述下个类更早编码的在先编码数据类，包括所述下个类在内的在后编码数据类具有因果相依性和非因果相依性当中的至少一个的显式编码 (quadtree partitioning) 和隐式编码当中的至少一个。
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information (视频信号) , information related to first and second maximum region (种方法) sizes (至少一个语法元素) , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN101682763A CLAIM 1、一种设备，包括：编码器(300)，用于对与图像的至少一部分的至少两个分块有关的至少一个语法数据元素进行编码，其中，所述至少一个语法元素 (second maximum region sizes) 被编码在多通路语法结构内，所述至少一个语法元素属于给定的数据类，并且所述编码器在对下个数据类进行编码之前对关于所述图像的至少所述部分的所有分块的所述至少一个语法数据元素进行编码，其中，关于比所述下个类更早编码的在先编码数据类，包括所述下个类在内的在后编码数据类具有因果相依性和非因果相依性当中的至少一个的显式编码和隐式编码当中的至少一个。 CN101682763A CLAIM 7、一种方法 (second maximum region) ，包括：对于与图像的至少一部分的至少两个分块相关的至少一个语法数据元素进行编码，其中，所述至少一个语法元素被编码在多通路语法结构内，所述至少一个语法元素属于给定的数据类，并且所述编码步骤在对下个数据类进行编码之前对关于所述图像的至少所述部分的所有分块的所述至少一个语法数据元素进行编码，其中，关于比所述下个类更早编码的在先编码数据类，包括所述下个类在内的在后编码数据类具有因果相依性和非因果相依性当中的至少一个的显式编码和隐式编码当中的至少一个(515、530、545)。 CN101682763A CLAIM 25、一种其上编码了视频信号 (video information) 数据的存储介质，包括：与图像的至少一部分的至少两个分块有关的至少一个语法数据元素，其中，所述至少一个语法元素被编码在多通路语法结构内，所述至少一个语法元素属于给定的数据类，并且在对下个数据类进行解码之前对关于所述图像的至少所述部分的所有分块的所述至少一个语法数据元素进行编码，其中，关于比所述下个类更早编码的在先编码数据类，包括所述下个类在内的在后编码数据类具有因果相依性和非因果相依性当中的至少一个的显式编码和隐式编码当中的至少一个。
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information (视频信号) into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region (种方法) size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes (至少一个语法元素) and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN101682763A CLAIM 1、一种设备，包括：编码器(300)，用于对与图像的至少一部分的至少两个分块有关的至少一个语法数据元素进行编码，其中，所述至少一个语法元素 (second maximum region sizes) 被编码在多通路语法结构内，所述至少一个语法元素属于给定的数据类，并且所述编码器在对下个数据类进行编码之前对关于所述图像的至少所述部分的所有分块的所述至少一个语法数据元素进行编码，其中，关于比所述下个类更早编码的在先编码数据类，包括所述下个类在内的在后编码数据类具有因果相依性和非因果相依性当中的至少一个的显式编码和隐式编码当中的至少一个。 CN101682763A CLAIM 7、一种方法 (second maximum region) ，包括：对于与图像的至少一部分的至少两个分块相关的至少一个语法数据元素进行编码，其中，所述至少一个语法元素被编码在多通路语法结构内，所述至少一个语法元素属于给定的数据类，并且所述编码步骤在对下个数据类进行编码之前对关于所述图像的至少所述部分的所有分块的所述至少一个语法数据元素进行编码，其中，关于比所述下个类更早编码的在先编码数据类，包括所述下个类在内的在后编码数据类具有因果相依性和非因果相依性当中的至少一个的显式编码和隐式编码当中的至少一个(515、530、545)。 CN101682763A CLAIM 25、一种其上编码了视频信号 (video information) 数据的存储介质，包括：与图像的至少一部分的至少两个分块有关的至少一个语法数据元素，其中，所述至少一个语法元素被编码在多通路语法结构内，所述至少一个语法元素属于给定的数据类，并且在对下个数据类进行解码之前对关于所述图像的至少所述部分的所有分块的所述至少一个语法数据元素进行编码，其中，关于比所述下个类更早编码的在先编码数据类，包括所述下个类在内的在后编码数据类具有因果相依性和非因果相依性当中的至少一个的显式编码和隐式编码当中的至少一个。
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information (视频信号) into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region (种方法) size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes (至少一个语法元素) and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN101682763A CLAIM 1、一种设备，包括：编码器(300)，用于对与图像的至少一部分的至少两个分块有关的至少一个语法数据元素进行编码，其中，所述至少一个语法元素 (second maximum region sizes) 被编码在多通路语法结构内，所述至少一个语法元素属于给定的数据类，并且所述编码器在对下个数据类进行编码之前对关于所述图像的至少所述部分的所有分块的所述至少一个语法数据元素进行编码，其中，关于比所述下个类更早编码的在先编码数据类，包括所述下个类在内的在后编码数据类具有因果相依性和非因果相依性当中的至少一个的显式编码和隐式编码当中的至少一个。 CN101682763A CLAIM 7、一种方法 (second maximum region) ，包括：对于与图像的至少一部分的至少两个分块相关的至少一个语法数据元素进行编码，其中，所述至少一个语法元素被编码在多通路语法结构内，所述至少一个语法元素属于给定的数据类，并且所述编码步骤在对下个数据类进行编码之前对关于所述图像的至少所述部分的所有分块的所述至少一个语法数据元素进行编码，其中，关于比所述下个类更早编码的在先编码数据类，包括所述下个类在内的在后编码数据类具有因果相依性和非因果相依性当中的至少一个的显式编码和隐式编码当中的至少一个(515、530、545)。 CN101682763A CLAIM 25、一种其上编码了视频信号 (video information) 数据的存储介质，包括：与图像的至少一部分的至少两个分块有关的至少一个语法数据元素，其中，所述至少一个语法元素被编码在多通路语法结构内，所述至少一个语法元素属于给定的数据类，并且在对下个数据类进行解码之前对关于所述图像的至少所述部分的所有分块的所述至少一个语法数据元素进行编码，其中，关于比所述下个类更早编码的在先编码数据类，包括所述下个类在内的在后编码数据类具有因果相依性和非因果相依性当中的至少一个的显式编码和隐式编码当中的至少一个。

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	WO2008156548A1 Filed: 2008-05-29 Issued: 2008-12-24 Methods and apparatus supporting multi-pass video syntax structure for slice data (Original Assignee) Thomson Licensing Oscar Divorra Escoda, Peng Yin, Purvin Bibhas. Pandit
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level (high level syntax) wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	WO2008156548A1 CLAIM 4 . The apparatus of claim 1 , wherein a use of the multi-pass syntax structure is enabled or disabled using at least one syntax data field in a high level syntax (hierarchy level) element .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level (high level syntax) according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	WO2008156548A1 CLAIM 4 . The apparatus of claim 1 , wherein a use of the multi-pass syntax structure is enabled or disabled using at least one syntax data field in a high level syntax (hierarchy level) element .
US10250913B2 CLAIM 5 . The decoder according to claim 4 , wherein the divider is configured to , in accordance with the partition rules associated with the first and higher-order hierarchy levels , sub-divide into sub-regions of equal size , such that there are an equal number of sub-regions at each hierarchy level (high level syntax) .	WO2008156548A1 CLAIM 4 . The apparatus of claim 1 , wherein a use of the multi-pass syntax structure is enabled or disabled using at least one syntax data field in a high level syntax (hierarchy level) element .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision information includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level (high level syntax) is sub-divided .	WO2008156548A1 CLAIM 4 . The apparatus of claim 1 , wherein a use of the multi-pass syntax structure is enabled or disabled using at least one syntax data field in a high level syntax (hierarchy level) element .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level (high level syntax) from the data stream .	WO2008156548A1 CLAIM 4 . The apparatus of claim 1 , wherein a use of the multi-pass syntax structure is enabled or disabled using at least one syntax data field in a high level syntax (hierarchy level) element .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements (video coding) associated with the first or second set of sub-regions from the data stream in a depth-first traversal order .	WO2008156548A1 CLAIM 2 . The apparatus of claim 1 , wherein the encoder (300) is an extended version of an existing encoder of an existing video coding (syntax elements) standard or video coding recommendation .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements (video coding) of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	WO2008156548A1 CLAIM 2 . The apparatus of claim 1 , wherein the encoder (300) is an extended version of an existing encoder of an existing video coding (syntax elements) standard or video coding recommendation .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level (high level syntax) , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	WO2008156548A1 CLAIM 4 . The apparatus of claim 1 , wherein a use of the multi-pass syntax structure is enabled or disabled using at least one syntax data field in a high level syntax (hierarchy level) element .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level (high level syntax) ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	WO2008156548A1 CLAIM 4 . The apparatus of claim 1 , wherein a use of the multi-pass syntax structure is enabled or disabled using at least one syntax data field in a high level syntax (hierarchy level) element .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level (high level syntax) ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	WO2008156548A1 CLAIM 4 . The apparatus of claim 1 , wherein a use of the multi-pass syntax structure is enabled or disabled using at least one syntax data field in a high level syntax (hierarchy level) element .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	WO2009092455A2 Filed: 2008-05-21 Issued: 2009-07-30 Prediction-based image processing (Original Assignee) Telefonaktiebolaget Lm Ericsson (Publ) Jacob STRÖM, Per Wennersten, Tomas AKENINE-MÖLLER, Jim Rasmusson
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information (respective color) , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	WO2009092455A2 CLAIM 1 . A method of compressing a block of multiple pixels each comprising a respective color (video information) having multiple color components , said method (root region) comprising the steps of : - providing , for at least one pixel of said block , a first prediction of a first color component of said at least one pixel by : a) calculating said first prediction based on a first weighted combination of a first color component of a first neighboring pixel in said block and a first color component of a second neighboring pixel in said block employing non-zero weights if a magnitude difference between said first color components of said neighboring pixels is smaller than a threshold ; b) selecting said first prediction to be based on one of a second different , weighted combination of said first color components of said neighboring pixels and a third different , weighted combination of said first color components of said neighboring pixels if said magnitude difference is not smaller than said threshold ; and c) providing a guiding bit associated with said selected one of said second weighted combination and said third weighted combination if said magnitude difference is not smaller than said threshold ; - calculating a first prediction error based on said first color component of said at least one pixel and said first prediction ; and determining a first encoded representation of said first prediction error , wherein a compressed representation of said block comprises said first encoded representation and said optional guiding bit .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region (said method) into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	WO2009092455A2 CLAIM 1 . A method of compressing a block of multiple pixels each comprising a respective color having multiple color components , said method (root region) comprising the steps of : - providing , for at least one pixel of said block , a first prediction of a first color component of said at least one pixel by : a) calculating said first prediction based on a first weighted combination of a first color component of a first neighboring pixel in said block and a first color component of a second neighboring pixel in said block employing non-zero weights if a magnitude difference between said first color components of said neighboring pixels is smaller than a threshold ; b) selecting said first prediction to be based on one of a second different , weighted combination of said first color components of said neighboring pixels and a third different , weighted combination of said first color components of said neighboring pixels if said magnitude difference is not smaller than said threshold ; and c) providing a guiding bit associated with said selected one of said second weighted combination and said third weighted combination if said magnitude difference is not smaller than said threshold ; - calculating a first prediction error based on said first color component of said at least one pixel and said first prediction ; and determining a first encoded representation of said first prediction error , wherein a compressed representation of said block comprises said first encoded representation and said optional guiding bit .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information (respective color) , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	WO2009092455A2 CLAIM 1 . A method of compressing a block of multiple pixels each comprising a respective color (video information) having multiple color components , said method (root region) comprising the steps of : - providing , for at least one pixel of said block , a first prediction of a first color component of said at least one pixel by : a) calculating said first prediction based on a first weighted combination of a first color component of a first neighboring pixel in said block and a first color component of a second neighboring pixel in said block employing non-zero weights if a magnitude difference between said first color components of said neighboring pixels is smaller than a threshold ; b) selecting said first prediction to be based on one of a second different , weighted combination of said first color components of said neighboring pixels and a third different , weighted combination of said first color components of said neighboring pixels if said magnitude difference is not smaller than said threshold ; and c) providing a guiding bit associated with said selected one of said second weighted combination and said third weighted combination if said magnitude difference is not smaller than said threshold ; - calculating a first prediction error based on said first color component of said at least one pixel and said first prediction ; and determining a first encoded representation of said first prediction error , wherein a compressed representation of said block comprises said first encoded representation and said optional guiding bit .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information (respective color) into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	WO2009092455A2 CLAIM 1 . A method of compressing a block of multiple pixels each comprising a respective color (video information) having multiple color components , said method (root region) comprising the steps of : - providing , for at least one pixel of said block , a first prediction of a first color component of said at least one pixel by : a) calculating said first prediction based on a first weighted combination of a first color component of a first neighboring pixel in said block and a first color component of a second neighboring pixel in said block employing non-zero weights if a magnitude difference between said first color components of said neighboring pixels is smaller than a threshold ; b) selecting said first prediction to be based on one of a second different , weighted combination of said first color components of said neighboring pixels and a third different , weighted combination of said first color components of said neighboring pixels if said magnitude difference is not smaller than said threshold ; and c) providing a guiding bit associated with said selected one of said second weighted combination and said third weighted combination if said magnitude difference is not smaller than said threshold ; - calculating a first prediction error based on said first color component of said at least one pixel and said first prediction ; and determining a first encoded representation of said first prediction error , wherein a compressed representation of said block comprises said first encoded representation and said optional guiding bit .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information (respective color) into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	WO2009092455A2 CLAIM 1 . A method of compressing a block of multiple pixels each comprising a respective color (video information) having multiple color components , said method (root region) comprising the steps of : - providing , for at least one pixel of said block , a first prediction of a first color component of said at least one pixel by : a) calculating said first prediction based on a first weighted combination of a first color component of a first neighboring pixel in said block and a first color component of a second neighboring pixel in said block employing non-zero weights if a magnitude difference between said first color components of said neighboring pixels is smaller than a threshold ; b) selecting said first prediction to be based on one of a second different , weighted combination of said first color components of said neighboring pixels and a third different , weighted combination of said first color components of said neighboring pixels if said magnitude difference is not smaller than said threshold ; and c) providing a guiding bit associated with said selected one of said second weighted combination and said third weighted combination if said magnitude difference is not smaller than said threshold ; - calculating a first prediction error based on said first color component of said at least one pixel and said first prediction ; and determining a first encoded representation of said first prediction error , wherein a compressed representation of said block comprises said first encoded representation and said optional guiding bit .
US10250913B2 CLAIM 15 . A non-transitory computer readable digital storage medium having stored thereon a computer program (classifying step) having a program code for performing , when running on a computer , a method according to claim 12 .	WO2009092455A2 CLAIM 8 . The method according to claim 7 , wherein said classifying step (computer program) comprises the steps of : classifying a pixel of said block as being predictive of said start component value if a magnitude difference between a first color component of said pixel and said start component value is smaller than a magnitude difference between said first color component said pixel and a first color component in said block differing the most from said start component value ; and classifying said pixel of said block as being predictive of said start component value if a magnitude difference between said first color component of said pixel and said start component value is not smaller than a magnitude difference between said first color component said pixel and said first color component in said block differing the most from said start component value .
US10250913B2 CLAIM 16 . A non-transitory computer readable digital storage medium having stored thereon a computer program (classifying step) having a program code for performing , when running on a computer , a method according to claim 14 .	WO2009092455A2 CLAIM 8 . The method according to claim 7 , wherein said classifying step (computer program) comprises the steps of : classifying a pixel of said block as being predictive of said start component value if a magnitude difference between a first color component of said pixel and said start component value is smaller than a magnitude difference between said first color component said pixel and a first color component in said block differing the most from said start component value ; and classifying said pixel of said block as being predictive of said start component value if a magnitude difference between said first color component of said pixel and said start component value is not smaller than a magnitude difference between said first color component said pixel and said first color component in said block differing the most from said start component value .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	WO2009092454A1 Filed: 2008-05-06 Issued: 2009-07-30 Prediction-based image processing (Original Assignee) Telefonaktiebolaget Lm Ericsson (Publ) Jacob STRÖM, Per Wennersten
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information (prediction direction) are associated with prediction coding and the second maximum region size (positive integer) and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	WO2009092454A1 CLAIM 1 . A method of compressing a block of multiple pixels each comprising a respective depth value , said method (root region) comprising the steps of : selecting a start depth value of the multiple depth values in said block , said start depth value belonging to a first depth value plane ; selecting a restart depth value of said multiple depths values in said block , said restart depth value belonging to a second depth value plane ; generating , for at least a portion of said multiple pixels , a respective plane representation indicative of which plane of said first and second depth value planes said at least a portion of said multiple pixels belong to ; selecting , for at least one pixel in said block , a pixel set of at least one other pixel in said block based on plane representations of said at least one pixel and said pixel set ; providing a prediction of a depth value of said at least one pixel based on the at least one depth value of said selected pixel set ; estimating a prediction error based on said depth value of said at least one pixel and said prediction ; and determining an encoded representation of said prediction error , wherein a compressed representation of said block comprises a representation of said start depth value , a representation of said restart value and said encoded representation of said prediction error . WO2009092454A1 CLAIM 4 . The method according to any of the claims 1 to 3 , wherein said determining step comprises the steps of : - modifying said prediction error to get a positive prediction error ; and Golomb-Rice encoding said positive prediction error to get said encoded representation of said prediction error by : searching for a value k , where k is zero or a positive integer (second maximum region size) ; providing a number / equal to k if said selected pixel set comprises multiple pixels and otherwise based on wx k + h , where Ii is a predefined constant and w is a predefined weight ; dividing said positive prediction error by 2' ; to form a quotient and a remainder ; and unary encoding said quotient , wherein said encoded representation of said prediction error comprises a representation of said remainder and said unary encoded quotient , and said compressed representation of said block comprises a representation of k . WO2009092454A1 CLAIM 7 . The method according to any of the claims 1 to 6 , wherein said step of selecting said pixel set comprises selecting said pixel set to comprise a first neighboring pixel present in a first prediction direction (first subdivision information) in said block (300) relative said at least one pixel , a second neighboring pixel present in a second prediction direction in said block relative said at least one pixel and a third neighboring pixel present in a third prediction direction in said block relative said at least one pixel if said first , second and third neighboring pixels belong to a same depth value plane as said at least one pixel as determined based on said plane representations .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information (prediction direction) indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region (said method) into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition (two times) rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	WO2009092454A1 CLAIM 1 . A method of compressing a block of multiple pixels each comprising a respective depth value , said method (root region) comprising the steps of : selecting a start depth value of the multiple depth values in said block , said start depth value belonging to a first depth value plane ; selecting a restart depth value of said multiple depths values in said block , said restart depth value belonging to a second depth value plane ; generating , for at least a portion of said multiple pixels , a respective plane representation indicative of which plane of said first and second depth value planes said at least a portion of said multiple pixels belong to ; selecting , for at least one pixel in said block , a pixel set of at least one other pixel in said block based on plane representations of said at least one pixel and said pixel set ; providing a prediction of a depth value of said at least one pixel based on the at least one depth value of said selected pixel set ; estimating a prediction error based on said depth value of said at least one pixel and said prediction ; and determining an encoded representation of said prediction error , wherein a compressed representation of said block comprises a representation of said start depth value , a representation of said restart value and said encoded representation of said prediction error . WO2009092454A1 CLAIM 7 . The method according to any of the claims 1 to 6 , wherein said step of selecting said pixel set comprises selecting said pixel set to comprise a first neighboring pixel present in a first prediction direction (first subdivision information) in said block (300) relative said at least one pixel , a second neighboring pixel present in a second prediction direction in said block relative said at least one pixel and a third neighboring pixel present in a third prediction direction in said block relative said at least one pixel if said first , second and third neighboring pixels belong to a same depth value plane as said at least one pixel as determined based on said plane representations . WO2009092454A1 CLAIM 10 . The method according to claim 9 , where said step of providing said prediction comprises calculating said prediction to be equal to two times (respective partition) a depth value of said first neighboring pixel subtracted by a depth value of said second pixel .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision information (prediction direction) includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level is sub-divided .	WO2009092454A1 CLAIM 7 . The method according to any of the claims 1 to 6 , wherein said step of selecting said pixel set comprises selecting said pixel set to comprise a first neighboring pixel present in a first prediction direction (first subdivision information) in said block (300) relative said at least one pixel , a second neighboring pixel present in a second prediction direction in said block relative said at least one pixel and a third neighboring pixel present in a third prediction direction in said block relative said at least one pixel if said first , second and third neighboring pixels belong to a same depth value plane as said at least one pixel as determined based on said plane representations .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision information (prediction direction) , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision (generating step) of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	WO2009092454A1 CLAIM 3 . The method according to claim 1 or 2 , wherein said generating step (intermediate subdivision) comprises the steps of : determining a first difference between a depth value of a pixel and said start depth value ; determining a second difference between said depth value of said pixel and a depth value of said block differing most from said start depth value ; and generating said plane representation to be indicative of said first depth value plane if an absolute value of said first difference is smaller than an absolute value of said second difference and otherwise generating said plane representation to be indicative of said second depth value plane . WO2009092454A1 CLAIM 7 . The method according to any of the claims 1 to 6 , wherein said step of selecting said pixel set comprises selecting said pixel set to comprise a first neighboring pixel present in a first prediction direction (first subdivision information) in said block (300) relative said at least one pixel , a second neighboring pixel present in a second prediction direction in said block relative said at least one pixel and a third neighboring pixel present in a third prediction direction in said block relative said at least one pixel if said first , second and third neighboring pixels belong to a same depth value plane as said at least one pixel as determined based on said plane representations .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information (prediction direction) are associated with prediction coding and the second maximum region size (positive integer) and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	WO2009092454A1 CLAIM 1 . A method of compressing a block of multiple pixels each comprising a respective depth value , said method (root region) comprising the steps of : selecting a start depth value of the multiple depth values in said block , said start depth value belonging to a first depth value plane ; selecting a restart depth value of said multiple depths values in said block , said restart depth value belonging to a second depth value plane ; generating , for at least a portion of said multiple pixels , a respective plane representation indicative of which plane of said first and second depth value planes said at least a portion of said multiple pixels belong to ; selecting , for at least one pixel in said block , a pixel set of at least one other pixel in said block based on plane representations of said at least one pixel and said pixel set ; providing a prediction of a depth value of said at least one pixel based on the at least one depth value of said selected pixel set ; estimating a prediction error based on said depth value of said at least one pixel and said prediction ; and determining an encoded representation of said prediction error , wherein a compressed representation of said block comprises a representation of said start depth value , a representation of said restart value and said encoded representation of said prediction error . WO2009092454A1 CLAIM 4 . The method according to any of the claims 1 to 3 , wherein said determining step comprises the steps of : - modifying said prediction error to get a positive prediction error ; and Golomb-Rice encoding said positive prediction error to get said encoded representation of said prediction error by : searching for a value k , where k is zero or a positive integer (second maximum region size) ; providing a number / equal to k if said selected pixel set comprises multiple pixels and otherwise based on wx k + h , where Ii is a predefined constant and w is a predefined weight ; dividing said positive prediction error by 2' ; to form a quotient and a remainder ; and unary encoding said quotient , wherein said encoded representation of said prediction error comprises a representation of said remainder and said unary encoded quotient , and said compressed representation of said block comprises a representation of k . WO2009092454A1 CLAIM 7 . The method according to any of the claims 1 to 6 , wherein said step of selecting said pixel set comprises selecting said pixel set to comprise a first neighboring pixel present in a first prediction direction (first subdivision information) in said block (300) relative said at least one pixel , a second neighboring pixel present in a second prediction direction in said block relative said at least one pixel and a third neighboring pixel present in a third prediction direction in said block relative said at least one pixel if said first , second and third neighboring pixels belong to a same depth value plane as said at least one pixel as determined based on said plane representations .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information (prediction direction) , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size (positive integer) , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator (first difference) configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	WO2009092454A1 CLAIM 1 . A method of compressing a block of multiple pixels each comprising a respective depth value , said method (root region) comprising the steps of : selecting a start depth value of the multiple depth values in said block , said start depth value belonging to a first depth value plane ; selecting a restart depth value of said multiple depths values in said block , said restart depth value belonging to a second depth value plane ; generating , for at least a portion of said multiple pixels , a respective plane representation indicative of which plane of said first and second depth value planes said at least a portion of said multiple pixels belong to ; selecting , for at least one pixel in said block , a pixel set of at least one other pixel in said block based on plane representations of said at least one pixel and said pixel set ; providing a prediction of a depth value of said at least one pixel based on the at least one depth value of said selected pixel set ; estimating a prediction error based on said depth value of said at least one pixel and said prediction ; and determining an encoded representation of said prediction error , wherein a compressed representation of said block comprises a representation of said start depth value , a representation of said restart value and said encoded representation of said prediction error . WO2009092454A1 CLAIM 2 . The method according to claim 1 , wherein said step of selecting said restart depth value comprises the steps of : - identifying a depth value of said multiple depth values in said block differing most from said start depth value ; determining , for at least a portion of said multiple pixels , a respective first difference (data stream generator) between a depth value of a pixel and said start depth value ; determining , for said at least a portion of said multiple pixels , a respective second difference between said depth value of said pixel and said identified depth value ; and selecting said restart depth value based on said determined first and second differences . WO2009092454A1 CLAIM 4 . The method according to any of the claims 1 to 3 , wherein said determining step comprises the steps of : - modifying said prediction error to get a positive prediction error ; and Golomb-Rice encoding said positive prediction error to get said encoded representation of said prediction error by : searching for a value k , where k is zero or a positive integer (second maximum region size) ; providing a number / equal to k if said selected pixel set comprises multiple pixels and otherwise based on wx k + h , where Ii is a predefined constant and w is a predefined weight ; dividing said positive prediction error by 2' ; to form a quotient and a remainder ; and unary encoding said quotient , wherein said encoded representation of said prediction error comprises a representation of said remainder and said unary encoded quotient , and said compressed representation of said block comprises a representation of k . WO2009092454A1 CLAIM 7 . The method according to any of the claims 1 to 6 , wherein said step of selecting said pixel set comprises selecting said pixel set to comprise a first neighboring pixel present in a first prediction direction (first subdivision information) in said block (300) relative said at least one pixel , a second neighboring pixel present in a second prediction direction in said block relative said at least one pixel and a third neighboring pixel present in a third prediction direction in said block relative said at least one pixel if said first , second and third neighboring pixels belong to a same depth value plane as said at least one pixel as determined based on said plane representations .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information (prediction direction) ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size (positive integer) ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	WO2009092454A1 CLAIM 1 . A method of compressing a block of multiple pixels each comprising a respective depth value , said method (root region) comprising the steps of : selecting a start depth value of the multiple depth values in said block , said start depth value belonging to a first depth value plane ; selecting a restart depth value of said multiple depths values in said block , said restart depth value belonging to a second depth value plane ; generating , for at least a portion of said multiple pixels , a respective plane representation indicative of which plane of said first and second depth value planes said at least a portion of said multiple pixels belong to ; selecting , for at least one pixel in said block , a pixel set of at least one other pixel in said block based on plane representations of said at least one pixel and said pixel set ; providing a prediction of a depth value of said at least one pixel based on the at least one depth value of said selected pixel set ; estimating a prediction error based on said depth value of said at least one pixel and said prediction ; and determining an encoded representation of said prediction error , wherein a compressed representation of said block comprises a representation of said start depth value , a representation of said restart value and said encoded representation of said prediction error . WO2009092454A1 CLAIM 4 . The method according to any of the claims 1 to 3 , wherein said determining step comprises the steps of : - modifying said prediction error to get a positive prediction error ; and Golomb-Rice encoding said positive prediction error to get said encoded representation of said prediction error by : searching for a value k , where k is zero or a positive integer (second maximum region size) ; providing a number / equal to k if said selected pixel set comprises multiple pixels and otherwise based on wx k + h , where Ii is a predefined constant and w is a predefined weight ; dividing said positive prediction error by 2' ; to form a quotient and a remainder ; and unary encoding said quotient , wherein said encoded representation of said prediction error comprises a representation of said remainder and said unary encoded quotient , and said compressed representation of said block comprises a representation of k . WO2009092454A1 CLAIM 7 . The method according to any of the claims 1 to 6 , wherein said step of selecting said pixel set comprises selecting said pixel set to comprise a first neighboring pixel present in a first prediction direction (first subdivision information) in said block (300) relative said at least one pixel , a second neighboring pixel present in a second prediction direction in said block relative said at least one pixel and a third neighboring pixel present in a third prediction direction in said block relative said at least one pixel if said first , second and third neighboring pixels belong to a same depth value plane as said at least one pixel as determined based on said plane representations .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20090273706A1 Filed: 2008-05-02 Issued: 2009-11-05 Multi-level representation of reordered transform coefficients (Original Assignee) Microsoft Corp (Current Assignee) Microsoft Technology Licensing LLC Chengjie Tu, Shankar Regunathan, Shijun Sun, Chih-Lung Lin
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream (entropy decoding) representing encoded video information (video information) , information related to first and second maximum region sizes , first and second subdivision (entropy coding) information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set (first set) of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set (second set) of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20090273706A1 CLAIM 1 . One or more storage media storing instructions which , when executed on a computer , cause the computer to perform a method of encoding video , the method comprising : selecting one of a plurality of scan orders ; outputting information indicating the selected scan order in a bit stream ; applying the selected scan order to reorder plural frequency coefficients of a block ; entropy coding (second subdivision, intermediate subdivision) the reordered plural frequency coefficients using a multi-level nested-set representation of the reordered frequency coefficients , including : representing a first set (first set) of one or more of the reordered plural frequency coefficients as a summary representation with a first symbol at a first level of the multi-level nested-set representation ; and entropy coding the first symbol and a second symbol at the first level of the multi-level nested-set representation ; and outputting the entropy coded frequency coefficients in the bit stream . US20090273706A1 CLAIM 6 . The one or more storage media of claim 1 wherein the entropy coding further comprises : representing a second set (second set) of one or more of the reordered plural frequency coefficients as a summary representation with the second symbol at the first level of the multi-level nested-set representation , wherein the entropy coding the first symbol and the second symbol includes jointly coding the first symbol and the second symbol using Huffman coding . US20090273706A1 CLAIM 11 . A method of reconstructing video , the method comprising : receiving in a bit stream entropy encoded video information (video information) for plural frequency coefficients ; entropy decoding (data stream) the entropy encoded video information , including : entropy decoding a first symbol and a second symbol at a first level of a multi-level nested-set representation of the plural frequency coefficients , wherein the first symbol represents a first set of one or more of the plural frequency coefficients ; and entropy decoding a first sub-symbol at a second level lower than the first level of the multi-level nested-set representation of the plural frequency coefficients , wherein the first sub-symbol represents a first subset of one or more of the frequency coefficients of the first set ; determining a scan order for the plural frequency coefficients ; reordering the plural frequency coefficients according to the determined scan order ; and using the reordered frequency coefficients to reconstruct the video .
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set (first set) of sub-regions : compute a prediction signal based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset of the second set (second set) of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	US20090273706A1 CLAIM 1 . One or more storage media storing instructions which , when executed on a computer , cause the computer to perform a method of encoding video , the method comprising : selecting one of a plurality of scan orders ; outputting information indicating the selected scan order in a bit stream ; applying the selected scan order to reorder plural frequency coefficients of a block ; entropy coding the reordered plural frequency coefficients using a multi-level nested-set representation of the reordered frequency coefficients , including : representing a first set (first set) of one or more of the reordered plural frequency coefficients as a summary representation with a first symbol at a first level of the multi-level nested-set representation ; and entropy coding the first symbol and a second symbol at the first level of the multi-level nested-set representation ; and outputting the entropy coded frequency coefficients in the bit stream . US20090273706A1 CLAIM 6 . The one or more storage media of claim 1 wherein the entropy coding further comprises : representing a second set (second set) of one or more of the reordered plural frequency coefficients as a summary representation with the second symbol at the first level of the multi-level nested-set representation , wherein the entropy coding the first symbol and the second symbol includes jointly coding the first symbol and the second symbol using Huffman coding .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set (first set) of root regions such that the first set of root regions are rectangular blocks of a size determined by the first maximum region size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	US20090273706A1 CLAIM 1 . One or more storage media storing instructions which , when executed on a computer , cause the computer to perform a method of encoding video , the method comprising : selecting one of a plurality of scan orders ; outputting information indicating the selected scan order in a bit stream ; applying the selected scan order to reorder plural frequency coefficients of a block ; entropy coding the reordered plural frequency coefficients using a multi-level nested-set representation of the reordered frequency coefficients , including : representing a first set (first set) of one or more of the reordered plural frequency coefficients as a summary representation with a first symbol at a first level of the multi-level nested-set representation ; and entropy coding the first symbol and a second symbol at the first level of the multi-level nested-set representation ; and outputting the entropy coded frequency coefficients in the bit stream .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set (first set) of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20090273706A1 CLAIM 1 . One or more storage media storing instructions which , when executed on a computer , cause the computer to perform a method of encoding video , the method comprising : selecting one of a plurality of scan orders ; outputting information indicating the selected scan order in a bit stream ; applying the selected scan order to reorder plural frequency coefficients of a block ; entropy coding the reordered plural frequency coefficients using a multi-level nested-set representation of the reordered frequency coefficients , including : representing a first set (first set) of one or more of the reordered plural frequency coefficients as a summary representation with a first symbol at a first level of the multi-level nested-set representation ; and entropy coding the first symbol and a second symbol at the first level of the multi-level nested-set representation ; and outputting the entropy coded frequency coefficients in the bit stream .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision information includes a partition indication flag indicating whether any of the first set (first set) of root regions or the sub-regions at the first or higher-order hierarchy level is sub-divided .	US20090273706A1 CLAIM 1 . One or more storage media storing instructions which , when executed on a computer , cause the computer to perform a method of encoding video , the method comprising : selecting one of a plurality of scan orders ; outputting information indicating the selected scan order in a bit stream ; applying the selected scan order to reorder plural frequency coefficients of a block ; entropy coding the reordered plural frequency coefficients using a multi-level nested-set representation of the reordered frequency coefficients , including : representing a first set (first set) of one or more of the reordered plural frequency coefficients as a summary representation with a first symbol at a first level of the multi-level nested-set representation ; and entropy coding the first symbol and a second symbol at the first level of the multi-level nested-set representation ; and outputting the entropy coded frequency coefficients in the bit stream .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level from the data stream (entropy decoding) .	US20090273706A1 CLAIM 11 . A method of reconstructing video , the method comprising : receiving in a bit stream entropy encoded video information for plural frequency coefficients ; entropy decoding (data stream) the entropy encoded video information , including : entropy decoding a first symbol and a second symbol at a first level of a multi-level nested-set representation of the plural frequency coefficients , wherein the first symbol represents a first set of one or more of the plural frequency coefficients ; and entropy decoding a first sub-symbol at a second level lower than the first level of the multi-level nested-set representation of the plural frequency coefficients , wherein the first sub-symbol represents a first subset of one or more of the frequency coefficients of the first set ; determining a scan order for the plural frequency coefficients ; reordering the plural frequency coefficients according to the determined scan order ; and using the reordered frequency coefficients to reconstruct the video .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements associated with the first or second set (second set) of sub-regions from the data stream (entropy decoding) in a depth-first traversal order .	US20090273706A1 CLAIM 6 . The one or more storage media of claim 1 wherein the entropy coding further comprises : representing a second set (second set) of one or more of the reordered plural frequency coefficients as a summary representation with the second symbol at the first level of the multi-level nested-set representation , wherein the entropy coding the first symbol and the second symbol includes jointly coding the first symbol and the second symbol using Huffman coding . US20090273706A1 CLAIM 11 . A method of reconstructing video , the method comprising : receiving in a bit stream entropy encoded video information for plural frequency coefficients ; entropy decoding (data stream) the entropy encoded video information , including : entropy decoding a first symbol and a second symbol at a first level of a multi-level nested-set representation of the plural frequency coefficients , wherein the first symbol represents a first set of one or more of the plural frequency coefficients ; and entropy decoding a first sub-symbol at a second level lower than the first level of the multi-level nested-set representation of the plural frequency coefficients , wherein the first sub-symbol represents a first subset of one or more of the frequency coefficients of the first set ; determining a scan order for the plural frequency coefficients ; reordering the plural frequency coefficients according to the determined scan order ; and using the reordered frequency coefficients to reconstruct the video .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset (first subset) of syntax elements of the data stream (entropy decoding) , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set (first set) of sub-regions to obtain an intermediate subdivision (entropy coding) of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20090273706A1 CLAIM 1 . One or more storage media storing instructions which , when executed on a computer , cause the computer to perform a method of encoding video , the method comprising : selecting one of a plurality of scan orders ; outputting information indicating the selected scan order in a bit stream ; applying the selected scan order to reorder plural frequency coefficients of a block ; entropy coding (second subdivision, intermediate subdivision) the reordered plural frequency coefficients using a multi-level nested-set representation of the reordered frequency coefficients , including : representing a first set (first set) of one or more of the reordered plural frequency coefficients as a summary representation with a first symbol at a first level of the multi-level nested-set representation ; and entropy coding the first symbol and a second symbol at the first level of the multi-level nested-set representation ; and outputting the entropy coded frequency coefficients in the bit stream . US20090273706A1 CLAIM 8 . The one or more storage media of claim 1 wherein the first set includes at least one non-zero coefficient value , and wherein the entropy coding further comprises : representing a first subset (first subset) of one or more of the frequency coefficients of the first set as a summary representation with a first sub-symbol at a second level of the multi-level nested-set representation lower than the first level . US20090273706A1 CLAIM 11 . A method of reconstructing video , the method comprising : receiving in a bit stream entropy encoded video information for plural frequency coefficients ; entropy decoding (data stream) the entropy encoded video information , including : entropy decoding a first symbol and a second symbol at a first level of a multi-level nested-set representation of the plural frequency coefficients , wherein the first symbol represents a first set of one or more of the plural frequency coefficients ; and entropy decoding a first sub-symbol at a second level lower than the first level of the multi-level nested-set representation of the plural frequency coefficients , wherein the first sub-symbol represents a first subset of one or more of the frequency coefficients of the first set ; determining a scan order for the plural frequency coefficients ; reordering the plural frequency coefficients according to the determined scan order ; and using the reordered frequency coefficients to reconstruct the video .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream (entropy decoding) , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	US20090273706A1 CLAIM 11 . A method of reconstructing video , the method comprising : receiving in a bit stream entropy encoded video information for plural frequency coefficients ; entropy decoding (data stream) the entropy encoded video information , including : entropy decoding a first symbol and a second symbol at a first level of a multi-level nested-set representation of the plural frequency coefficients , wherein the first symbol represents a first set of one or more of the plural frequency coefficients ; and entropy decoding a first sub-symbol at a second level lower than the first level of the multi-level nested-set representation of the plural frequency coefficients , wherein the first sub-symbol represents a first subset of one or more of the frequency coefficients of the first set ; determining a scan order for the plural frequency coefficients ; reordering the plural frequency coefficients according to the determined scan order ; and using the reordered frequency coefficients to reconstruct the video .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream (entropy decoding) representing encoded video information (video information) , information related to first and second maximum region sizes , first and second subdivision (entropy coding) information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set (first set) of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set (second set) of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20090273706A1 CLAIM 1 . One or more storage media storing instructions which , when executed on a computer , cause the computer to perform a method of encoding video , the method comprising : selecting one of a plurality of scan orders ; outputting information indicating the selected scan order in a bit stream ; applying the selected scan order to reorder plural frequency coefficients of a block ; entropy coding (second subdivision, intermediate subdivision) the reordered plural frequency coefficients using a multi-level nested-set representation of the reordered frequency coefficients , including : representing a first set (first set) of one or more of the reordered plural frequency coefficients as a summary representation with a first symbol at a first level of the multi-level nested-set representation ; and entropy coding the first symbol and a second symbol at the first level of the multi-level nested-set representation ; and outputting the entropy coded frequency coefficients in the bit stream . US20090273706A1 CLAIM 6 . The one or more storage media of claim 1 wherein the entropy coding further comprises : representing a second set (second set) of one or more of the reordered plural frequency coefficients as a summary representation with the second symbol at the first level of the multi-level nested-set representation , wherein the entropy coding the first symbol and the second symbol includes jointly coding the first symbol and the second symbol using Huffman coding . US20090273706A1 CLAIM 11 . A method of reconstructing video , the method comprising : receiving in a bit stream entropy encoded video information (video information) for plural frequency coefficients ; entropy decoding (data stream) the entropy encoded video information , including : entropy decoding a first symbol and a second symbol at a first level of a multi-level nested-set representation of the plural frequency coefficients , wherein the first symbol represents a first set of one or more of the plural frequency coefficients ; and entropy decoding a first sub-symbol at a second level lower than the first level of the multi-level nested-set representation of the plural frequency coefficients , wherein the first sub-symbol represents a first subset of one or more of the frequency coefficients of the first set ; determining a scan order for the plural frequency coefficients ; reordering the plural frequency coefficients according to the determined scan order ; and using the reordered frequency coefficients to reconstruct the video .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information (video information) into a first set (first set) of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set (second set) of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (entropy coding) information and a maximum hierarchy level ; and a data stream (entropy decoding) generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20090273706A1 CLAIM 1 . One or more storage media storing instructions which , when executed on a computer , cause the computer to perform a method of encoding video , the method comprising : selecting one of a plurality of scan orders ; outputting information indicating the selected scan order in a bit stream ; applying the selected scan order to reorder plural frequency coefficients of a block ; entropy coding (second subdivision, intermediate subdivision) the reordered plural frequency coefficients using a multi-level nested-set representation of the reordered frequency coefficients , including : representing a first set (first set) of one or more of the reordered plural frequency coefficients as a summary representation with a first symbol at a first level of the multi-level nested-set representation ; and entropy coding the first symbol and a second symbol at the first level of the multi-level nested-set representation ; and outputting the entropy coded frequency coefficients in the bit stream . US20090273706A1 CLAIM 6 . The one or more storage media of claim 1 wherein the entropy coding further comprises : representing a second set (second set) of one or more of the reordered plural frequency coefficients as a summary representation with the second symbol at the first level of the multi-level nested-set representation , wherein the entropy coding the first symbol and the second symbol includes jointly coding the first symbol and the second symbol using Huffman coding . US20090273706A1 CLAIM 11 . A method of reconstructing video , the method comprising : receiving in a bit stream entropy encoded video information (video information) for plural frequency coefficients ; entropy decoding (data stream) the entropy encoded video information , including : entropy decoding a first symbol and a second symbol at a first level of a multi-level nested-set representation of the plural frequency coefficients , wherein the first symbol represents a first set of one or more of the plural frequency coefficients ; and entropy decoding a first sub-symbol at a second level lower than the first level of the multi-level nested-set representation of the plural frequency coefficients , wherein the first sub-symbol represents a first subset of one or more of the frequency coefficients of the first set ; determining a scan order for the plural frequency coefficients ; reordering the plural frequency coefficients according to the determined scan order ; and using the reordered frequency coefficients to reconstruct the video .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information (video information) into a first set (first set) of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set (second set) of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (entropy coding) information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream (entropy decoding) the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20090273706A1 CLAIM 1 . One or more storage media storing instructions which , when executed on a computer , cause the computer to perform a method of encoding video , the method comprising : selecting one of a plurality of scan orders ; outputting information indicating the selected scan order in a bit stream ; applying the selected scan order to reorder plural frequency coefficients of a block ; entropy coding (second subdivision, intermediate subdivision) the reordered plural frequency coefficients using a multi-level nested-set representation of the reordered frequency coefficients , including : representing a first set (first set) of one or more of the reordered plural frequency coefficients as a summary representation with a first symbol at a first level of the multi-level nested-set representation ; and entropy coding the first symbol and a second symbol at the first level of the multi-level nested-set representation ; and outputting the entropy coded frequency coefficients in the bit stream . US20090273706A1 CLAIM 6 . The one or more storage media of claim 1 wherein the entropy coding further comprises : representing a second set (second set) of one or more of the reordered plural frequency coefficients as a summary representation with the second symbol at the first level of the multi-level nested-set representation , wherein the entropy coding the first symbol and the second symbol includes jointly coding the first symbol and the second symbol using Huffman coding . US20090273706A1 CLAIM 11 . A method of reconstructing video , the method comprising : receiving in a bit stream entropy encoded video information (video information) for plural frequency coefficients ; entropy decoding (data stream) the entropy encoded video information , including : entropy decoding a first symbol and a second symbol at a first level of a multi-level nested-set representation of the plural frequency coefficients , wherein the first symbol represents a first set of one or more of the plural frequency coefficients ; and entropy decoding a first sub-symbol at a second level lower than the first level of the multi-level nested-set representation of the plural frequency coefficients , wherein the first sub-symbol represents a first subset of one or more of the frequency coefficients of the first set ; determining a scan order for the plural frequency coefficients ; reordering the plural frequency coefficients according to the determined scan order ; and using the reordered frequency coefficients to reconstruct the video .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20090080536A1 Filed: 2008-04-22 Issued: 2009-03-26 Image processing apparatus, display apparatus, display system and control method thereof (Original Assignee) Samsung Electronics Co Ltd (Current Assignee) Samsung Electronics Co Ltd Chang-Jin Lee, Sun-ho YANG
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding (user input unit) and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20090080536A1 CLAIM 10 . A display apparatus which has a display unit , comprising : a user input unit (prediction coding, prediction signal) which is provided to input a distance from an image processing apparatus supplying an image signal ; a UI (user interface) generator which generates UI information ; a wireless communicator ; and a controller which controls the UI generator to display a distance input window on the display unit if a control signal is received through the user input unit to input the distance , and controls the wireless communicator to transmit the inputted distance to the image processing apparatus .
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal (user input unit) based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset of the second set of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	US20090080536A1 CLAIM 10 . A display apparatus which has a display unit , comprising : a user input unit (prediction coding, prediction signal) which is provided to input a distance from an image processing apparatus supplying an image signal ; a UI (user interface) generator which generates UI information ; a wireless communicator ; and a controller which controls the UI generator to display a distance input window on the display unit if a control signal is received through the user input unit to input the distance , and controls the wireless communicator to transmit the inputted distance to the image processing apparatus .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding (user input unit) and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20090080536A1 CLAIM 10 . A display apparatus which has a display unit , comprising : a user input unit (prediction coding, prediction signal) which is provided to input a distance from an image processing apparatus supplying an image signal ; a UI (user interface) generator which generates UI information ; a wireless communicator ; and a controller which controls the UI generator to display a distance input window on the display unit if a control signal is received through the user input unit to input the distance , and controls the wireless communicator to transmit the inputted distance to the image processing apparatus .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding (user input unit) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20090080536A1 CLAIM 10 . A display apparatus which has a display unit , comprising : a user input unit (prediction coding, prediction signal) which is provided to input a distance from an image processing apparatus supplying an image signal ; a UI (user interface) generator which generates UI information ; a wireless communicator ; and a controller which controls the UI generator to display a distance input window on the display unit if a control signal is received through the user input unit to input the distance , and controls the wireless communicator to transmit the inputted distance to the image processing apparatus .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding (user input unit) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20090080536A1 CLAIM 10 . A display apparatus which has a display unit , comprising : a user input unit (prediction coding, prediction signal) which is provided to input a distance from an image processing apparatus supplying an image signal ; a UI (user interface) generator which generates UI information ; a wireless communicator ; and a controller which controls the UI generator to display a distance input window on the display unit if a control signal is received through the user input unit to input the distance , and controls the wireless communicator to transmit the inputted distance to the image processing apparatus .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	WO2008127072A1 Filed: 2008-04-16 Issued: 2008-10-23 Color video scalability encoding and decoding method and device thereof (Original Assignee) Electronics And Telecommunications Research Institute; Industry-Academia Cooperation Group Of Sejong University Hae-Chul Choi, Jie Jia, Hae-Kwang Kim, Jeong-Ju Yoo
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream (entropy decoding) representing encoded video information , information related to first and second maximum region (decoding device) sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	WO2008127072A1 CLAIM 15 . The color video scalability decoding method of claim 14 , wherein said decoding a chrominance image block includes : generating a residual chrominance image block having λ 0' ; for all coefficients if a color coded block pattern value is λ 0' ; , and generating a residual chrominance image block by performing entropy decoding (data stream) and inverse quantization on information of an encoded residual chrominance image bock included in the bitstream if the color coded block pattern value is not λ 0' ; ; generating a chrominance image block of the enhancement layer by compensating motion of the residual chrominance image block using the motion information and a reference image ; and combining a chrominance image block of the enhancement layer and a luminance image block of the lower layer . WO2008127072A1 CLAIM 18 . A color video scalability decoding device (second maximum region, second maximum region sizes) comprising : a receiver for receiving a bitstream ; and a decoder for determining whether the received bitstream includes an enhancement layer having a color format different from a color format of a lower layer and decoding a chrominance image block of the enhancement layer by using lower layer information of the lower layer .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level from the data stream (entropy decoding) .	WO2008127072A1 CLAIM 15 . The color video scalability decoding method of claim 14 , wherein said decoding a chrominance image block includes : generating a residual chrominance image block having λ 0' ; for all coefficients if a color coded block pattern value is λ 0' ; , and generating a residual chrominance image block by performing entropy decoding (data stream) and inverse quantization on information of an encoded residual chrominance image bock included in the bitstream if the color coded block pattern value is not λ 0' ; ; generating a chrominance image block of the enhancement layer by compensating motion of the residual chrominance image block using the motion information and a reference image ; and combining a chrominance image block of the enhancement layer and a luminance image block of the lower layer .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements associated with the first or second set of sub-regions from the data stream (entropy decoding) in a depth-first traversal order .	WO2008127072A1 CLAIM 15 . The color video scalability decoding method of claim 14 , wherein said decoding a chrominance image block includes : generating a residual chrominance image block having λ 0' ; for all coefficients if a color coded block pattern value is λ 0' ; , and generating a residual chrominance image block by performing entropy decoding (data stream) and inverse quantization on information of an encoded residual chrominance image bock included in the bitstream if the color coded block pattern value is not λ 0' ; ; generating a chrominance image block of the enhancement layer by compensating motion of the residual chrominance image block using the motion information and a reference image ; and combining a chrominance image block of the enhancement layer and a luminance image block of the lower layer .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream (entropy decoding) , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	WO2008127072A1 CLAIM 15 . The color video scalability decoding method of claim 14 , wherein said decoding a chrominance image block includes : generating a residual chrominance image block having λ 0' ; for all coefficients if a color coded block pattern value is λ 0' ; , and generating a residual chrominance image block by performing entropy decoding (data stream) and inverse quantization on information of an encoded residual chrominance image bock included in the bitstream if the color coded block pattern value is not λ 0' ; ; generating a chrominance image block of the enhancement layer by compensating motion of the residual chrominance image block using the motion information and a reference image ; and combining a chrominance image block of the enhancement layer and a luminance image block of the lower layer .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream (entropy decoding) , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	WO2008127072A1 CLAIM 15 . The color video scalability decoding method of claim 14 , wherein said decoding a chrominance image block includes : generating a residual chrominance image block having λ 0' ; for all coefficients if a color coded block pattern value is λ 0' ; , and generating a residual chrominance image block by performing entropy decoding (data stream) and inverse quantization on information of an encoded residual chrominance image bock included in the bitstream if the color coded block pattern value is not λ 0' ; ; generating a chrominance image block of the enhancement layer by compensating motion of the residual chrominance image block using the motion information and a reference image ; and combining a chrominance image block of the enhancement layer and a luminance image block of the lower layer .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream (entropy decoding) representing encoded video information , information related to first and second maximum region (decoding device) sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	WO2008127072A1 CLAIM 15 . The color video scalability decoding method of claim 14 , wherein said decoding a chrominance image block includes : generating a residual chrominance image block having λ 0' ; for all coefficients if a color coded block pattern value is λ 0' ; , and generating a residual chrominance image block by performing entropy decoding (data stream) and inverse quantization on information of an encoded residual chrominance image bock included in the bitstream if the color coded block pattern value is not λ 0' ; ; generating a chrominance image block of the enhancement layer by compensating motion of the residual chrominance image block using the motion information and a reference image ; and combining a chrominance image block of the enhancement layer and a luminance image block of the lower layer . WO2008127072A1 CLAIM 18 . A color video scalability decoding device (second maximum region, second maximum region sizes) comprising : a receiver for receiving a bitstream ; and a decoder for determining whether the received bitstream includes an enhancement layer having a color format different from a color format of a lower layer and decoding a chrominance image block of the enhancement layer by using lower layer information of the lower layer .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region (decoding device) size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream (entropy decoding) generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	WO2008127072A1 CLAIM 15 . The color video scalability decoding method of claim 14 , wherein said decoding a chrominance image block includes : generating a residual chrominance image block having λ 0' ; for all coefficients if a color coded block pattern value is λ 0' ; , and generating a residual chrominance image block by performing entropy decoding (data stream) and inverse quantization on information of an encoded residual chrominance image bock included in the bitstream if the color coded block pattern value is not λ 0' ; ; generating a chrominance image block of the enhancement layer by compensating motion of the residual chrominance image block using the motion information and a reference image ; and combining a chrominance image block of the enhancement layer and a luminance image block of the lower layer . WO2008127072A1 CLAIM 18 . A color video scalability decoding device (second maximum region, second maximum region sizes) comprising : a receiver for receiving a bitstream ; and a decoder for determining whether the received bitstream includes an enhancement layer having a color format different from a color format of a lower layer and decoding a chrominance image block of the enhancement layer by using lower layer information of the lower layer .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region (decoding device) size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream (entropy decoding) the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	WO2008127072A1 CLAIM 15 . The color video scalability decoding method of claim 14 , wherein said decoding a chrominance image block includes : generating a residual chrominance image block having λ 0' ; for all coefficients if a color coded block pattern value is λ 0' ; , and generating a residual chrominance image block by performing entropy decoding (data stream) and inverse quantization on information of an encoded residual chrominance image bock included in the bitstream if the color coded block pattern value is not λ 0' ; ; generating a chrominance image block of the enhancement layer by compensating motion of the residual chrominance image block using the motion information and a reference image ; and combining a chrominance image block of the enhancement layer and a luminance image block of the lower layer . WO2008127072A1 CLAIM 18 . A color video scalability decoding device (second maximum region, second maximum region sizes) comprising : a receiver for receiving a bitstream ; and a decoder for determining whether the received bitstream includes an enhancement layer having a color format different from a color format of a lower layer and decoding a chrominance image block of the enhancement layer by using lower layer information of the lower layer .
US10250913B2 CLAIM 15 . A non-transitory computer readable digital storage medium having stored thereon a computer program (readable recording medium) having a program code for performing , when running on a computer , a method according to claim 12 .	WO2008127072A1 CLAIM 35 . A computer-readable recording medium (computer program) storing a program for performing a color video scalability encoding method comprising : encoding a chrominance image block of an enhancement layer by using lower layer information , wherein in said encoding a chrominance image block , a color coded block pattern value is generated according to a pattern of quantization coefficients of a residual chrominance image block generated using the lower layer information .
US10250913B2 CLAIM 16 . A non-transitory computer readable digital storage medium having stored thereon a computer program (readable recording medium) having a program code for performing , when running on a computer , a method according to claim 14 .	WO2008127072A1 CLAIM 35 . A computer-readable recording medium (computer program) storing a program for performing a color video scalability encoding method comprising : encoding a chrominance image block of an enhancement layer by using lower layer information , wherein in said encoding a chrominance image block , a color coded block pattern value is generated according to a pattern of quantization coefficients of a residual chrominance image block generated using the lower layer information .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	CN101682769A Filed: 2008-04-09 Issued: 2010-03-24 用于视频编码和解码的跳过-直接模式的取决于环境的合并的方法和装置 (Original Assignee) 汤姆森特许公司奥斯卡·迪沃拉埃斯科达, 尹澎
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information (视频信号) , information related to first and second maximum region (种方法) sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN101682769A CLAIM 7 . —种方法 (second maximum region) ，其包括：使用帧分区和分区合并程序来联合编码图像区域的分区，其中所述分区中的使用具有隐式编码规则的编码模式的任何给定的一个分区受到使用与用于具有显式编码规则的编码模式的合并规则不同的合并规则的、与所述分区中的另一个分区的合并（500、 700)。 CN101682769A CLAIM 25 . —种在其上对视频信号 (video information) 数据进行编码的存储介质，其包括：使用帧分区和分区合并程序来联合编码的图像区域的分区，其中所述分区中的使用具有隐式编码规则的编码模式的任何给定的一个分区受到使用与用于具有显式编码规则的编码模式的合并规则不同的合并规则的、与所述分区中的另一个分区的合并。
US10250913B2 CLAIM 11 . The decoder according to claim 1 , wherein the recursive multi-tree partitioning includes a quadtree partitioning (显式编码) technique .	CN101682769A CLAIM 1 . 一种装置，其包括：编码器(300)，其用于使用帧分区和分区合并程序来联合编码图像区域的分区，其中所述分区中的使用具有隐式编码规则的编码模式的任何给定的一个分区受到使用与用于具有显式编码 (quadtree partitioning) 规则的编码模式的合并规则不同的合并规则的、与所述分区中的另一个分区的合并。
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information (视频信号) , information related to first and second maximum region (种方法) sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN101682769A CLAIM 7 . —种方法 (second maximum region) ，其包括：使用帧分区和分区合并程序来联合编码图像区域的分区，其中所述分区中的使用具有隐式编码规则的编码模式的任何给定的一个分区受到使用与用于具有显式编码规则的编码模式的合并规则不同的合并规则的、与所述分区中的另一个分区的合并（500、 700)。 CN101682769A CLAIM 25 . —种在其上对视频信号 (video information) 数据进行编码的存储介质，其包括：使用帧分区和分区合并程序来联合编码的图像区域的分区，其中所述分区中的使用具有隐式编码规则的编码模式的任何给定的一个分区受到使用与用于具有显式编码规则的编码模式的合并规则不同的合并规则的、与所述分区中的另一个分区的合并。
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information (视频信号) into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region (种方法) size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN101682769A CLAIM 7 . —种方法 (second maximum region) ，其包括：使用帧分区和分区合并程序来联合编码图像区域的分区，其中所述分区中的使用具有隐式编码规则的编码模式的任何给定的一个分区受到使用与用于具有显式编码规则的编码模式的合并规则不同的合并规则的、与所述分区中的另一个分区的合并（500、 700)。 CN101682769A CLAIM 25 . —种在其上对视频信号 (video information) 数据进行编码的存储介质，其包括：使用帧分区和分区合并程序来联合编码的图像区域的分区，其中所述分区中的使用具有隐式编码规则的编码模式的任何给定的一个分区受到使用与用于具有显式编码规则的编码模式的合并规则不同的合并规则的、与所述分区中的另一个分区的合并。
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information (视频信号) into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region (种方法) size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN101682769A CLAIM 7 . —种方法 (second maximum region) ，其包括：使用帧分区和分区合并程序来联合编码图像区域的分区，其中所述分区中的使用具有隐式编码规则的编码模式的任何给定的一个分区受到使用与用于具有显式编码规则的编码模式的合并规则不同的合并规则的、与所述分区中的另一个分区的合并（500、 700)。 CN101682769A CLAIM 25 . —种在其上对视频信号 (video information) 数据进行编码的存储介质，其包括：使用帧分区和分区合并程序来联合编码的图像区域的分区，其中所述分区中的使用具有隐式编码规则的编码模式的任何给定的一个分区受到使用与用于具有显式编码规则的编码模式的合并规则不同的合并规则的、与所述分区中的另一个分区的合并。

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	WO2008128898A1 Filed: 2008-04-09 Issued: 2008-10-30 Method and apparatus for encoding video data, method and apparatus for decoding encoded video data and encoded video signal (Original Assignee) Thomson Licensing Yongying Gao, Yuwen Wu, Ingo Doser
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream (different bit) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (entropy coding, residual data) information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding (different color, color space, skip mode) and the second maximum region size and the second subdivision information are associated with transform coding (different color, color space, skip mode) ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	WO2008128898A1 CLAIM 1 . Method for encoding video data comprising base layer (BL) data and enhancement layer (EL) data , wherein the base layer and enhancement layer data comprise a plurality of color channels (Y , Cr , Cb , R , G , B) and wherein base layer and enhancement layer data have different bit (data stream) depth , comprising steps of encoding (201y , 201cr , 201cb) the base layer data ; - predicting (200) the enhancement layer data from the base layer data separately for the color channels ; and encoding the enhancement layer data separately for the color channels (R , G , B) , based on said predicted enhancement layer data ; wherein in at least one mode each enhancement layer color channel (R , G , B) is predicted jointly (200) from all available base layer color channels , the method further comprising for at least one of the enhancement layer color channels the further steps of - generating residual data (second subdivision, intermediate subdivision) (R res , B res , G res) being the difference between original enhancement layer color channel (REL , G E L , B EL) and predicted color channel data ; encoding (202r , 202g , 202b) the original enhancement layer color channel data ; - encoding (203r , 203g , 203b , 204r , 204g , 204b) the residual data ; - selecting (RDO r , RDO g , RDO b) for the at least one enhancement layer color channel either the encoded original enhancement layer color channel data , the residual data or the encoded residual data , wherein the selection is independent from the selection of other enhancement layer color channels ; and providing as enhancement layer output data the selected enhancement layer color channel data and an indication of the selected encoding mode referring to said enhancement layer color channel . WO2008128898A1 CLAIM 2 . Method according to claim 1 , wherein the base layer and enhancement layer use different color (spatial domain, spatial domain transform coding, transform coding, prediction coding) encoding (Y , CR , CB , R , G , B) and the inter-layer prediction (200) further comprises color space (spatial domain, spatial domain transform coding, transform coding, prediction coding) conversion for both Intra- and Inter-coding . WO2008128898A1 CLAIM 4 . Method according to one of the previous claims , wherein the encoding of the residual comprises entropy coding (second subdivision, intermediate subdivision) (204r , 204g , 204b) . WO2008128898A1 CLAIM 5 . Method according to one of the previous claims , wherein an additional encoding mode for enhancement layer color channel data comprises skip mode (spatial domain, spatial domain transform coding, transform coding, prediction coding) (405) on macro-block level , wherein in skip mode the enhancement layer data contains no bits for the respective macro-block .
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal (encoding mode) based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset of the second set of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	WO2008128898A1 CLAIM 1 . Method for encoding video data comprising base layer (BL) data and enhancement layer (EL) data , wherein the base layer and enhancement layer data comprise a plurality of color channels (Y , Cr , Cb , R , G , B) and wherein base layer and enhancement layer data have different bit depth , comprising steps of encoding (201y , 201cr , 201cb) the base layer data ; - predicting (200) the enhancement layer data from the base layer data separately for the color channels ; and encoding the enhancement layer data separately for the color channels (R , G , B) , based on said predicted enhancement layer data ; wherein in at least one mode each enhancement layer color channel (R , G , B) is predicted jointly (200) from all available base layer color channels , the method further comprising for at least one of the enhancement layer color channels the further steps of - generating residual data (R res , B res , G res) being the difference between original enhancement layer color channel (REL , G E L , B EL) and predicted color channel data ; encoding (202r , 202g , 202b) the original enhancement layer color channel data ; - encoding (203r , 203g , 203b , 204r , 204g , 204b) the residual data ; - selecting (RDO r , RDO g , RDO b) for the at least one enhancement layer color channel either the encoded original enhancement layer color channel data , the residual data or the encoded residual data , wherein the selection is independent from the selection of other enhancement layer color channels ; and providing as enhancement layer output data the selected enhancement layer color channel data and an indication of the selected encoding mode (prediction signal) referring to said enhancement layer color channel .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level from the data stream (different bit) .	WO2008128898A1 CLAIM 1 . Method for encoding video data comprising base layer (BL) data and enhancement layer (EL) data , wherein the base layer and enhancement layer data comprise a plurality of color channels (Y , Cr , Cb , R , G , B) and wherein base layer and enhancement layer data have different bit (data stream) depth , comprising steps of encoding (201y , 201cr , 201cb) the base layer data ; - predicting (200) the enhancement layer data from the base layer data separately for the color channels ; and encoding the enhancement layer data separately for the color channels (R , G , B) , based on said predicted enhancement layer data ; wherein in at least one mode each enhancement layer color channel (R , G , B) is predicted jointly (200) from all available base layer color channels , the method further comprising for at least one of the enhancement layer color channels the further steps of - generating residual data (R res , B res , G res) being the difference between original enhancement layer color channel (REL , G E L , B EL) and predicted color channel data ; encoding (202r , 202g , 202b) the original enhancement layer color channel data ; - encoding (203r , 203g , 203b , 204r , 204g , 204b) the residual data ; - selecting (RDO r , RDO g , RDO b) for the at least one enhancement layer color channel either the encoded original enhancement layer color channel data , the residual data or the encoded residual data , wherein the selection is independent from the selection of other enhancement layer color channels ; and providing as enhancement layer output data the selected enhancement layer color channel data and an indication of the selected encoding mode referring to said enhancement layer color channel .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements associated with the first or second set of sub-regions from the data stream (different bit) in a depth-first traversal order .	WO2008128898A1 CLAIM 1 . Method for encoding video data comprising base layer (BL) data and enhancement layer (EL) data , wherein the base layer and enhancement layer data comprise a plurality of color channels (Y , Cr , Cb , R , G , B) and wherein base layer and enhancement layer data have different bit (data stream) depth , comprising steps of encoding (201y , 201cr , 201cb) the base layer data ; - predicting (200) the enhancement layer data from the base layer data separately for the color channels ; and encoding the enhancement layer data separately for the color channels (R , G , B) , based on said predicted enhancement layer data ; wherein in at least one mode each enhancement layer color channel (R , G , B) is predicted jointly (200) from all available base layer color channels , the method further comprising for at least one of the enhancement layer color channels the further steps of - generating residual data (R res , B res , G res) being the difference between original enhancement layer color channel (REL , G E L , B EL) and predicted color channel data ; encoding (202r , 202g , 202b) the original enhancement layer color channel data ; - encoding (203r , 203g , 203b , 204r , 204g , 204b) the residual data ; - selecting (RDO r , RDO g , RDO b) for the at least one enhancement layer color channel either the encoded original enhancement layer color channel data , the residual data or the encoded residual data , wherein the selection is independent from the selection of other enhancement layer color channels ; and providing as enhancement layer output data the selected enhancement layer color channel data and an indication of the selected encoding mode referring to said enhancement layer color channel .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream (different bit) , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision (entropy coding, residual data) of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	WO2008128898A1 CLAIM 1 . Method for encoding video data comprising base layer (BL) data and enhancement layer (EL) data , wherein the base layer and enhancement layer data comprise a plurality of color channels (Y , Cr , Cb , R , G , B) and wherein base layer and enhancement layer data have different bit (data stream) depth , comprising steps of encoding (201y , 201cr , 201cb) the base layer data ; - predicting (200) the enhancement layer data from the base layer data separately for the color channels ; and encoding the enhancement layer data separately for the color channels (R , G , B) , based on said predicted enhancement layer data ; wherein in at least one mode each enhancement layer color channel (R , G , B) is predicted jointly (200) from all available base layer color channels , the method further comprising for at least one of the enhancement layer color channels the further steps of - generating residual data (second subdivision, intermediate subdivision) (R res , B res , G res) being the difference between original enhancement layer color channel (REL , G E L , B EL) and predicted color channel data ; encoding (202r , 202g , 202b) the original enhancement layer color channel data ; - encoding (203r , 203g , 203b , 204r , 204g , 204b) the residual data ; - selecting (RDO r , RDO g , RDO b) for the at least one enhancement layer color channel either the encoded original enhancement layer color channel data , the residual data or the encoded residual data , wherein the selection is independent from the selection of other enhancement layer color channels ; and providing as enhancement layer output data the selected enhancement layer color channel data and an indication of the selected encoding mode referring to said enhancement layer color channel . WO2008128898A1 CLAIM 4 . Method according to one of the previous claims , wherein the encoding of the residual comprises entropy coding (second subdivision, intermediate subdivision) (204r , 204g , 204b) .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream (different bit) , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding (different color, color space, skip mode) to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	WO2008128898A1 CLAIM 1 . Method for encoding video data comprising base layer (BL) data and enhancement layer (EL) data , wherein the base layer and enhancement layer data comprise a plurality of color channels (Y , Cr , Cb , R , G , B) and wherein base layer and enhancement layer data have different bit (data stream) depth , comprising steps of encoding (201y , 201cr , 201cb) the base layer data ; - predicting (200) the enhancement layer data from the base layer data separately for the color channels ; and encoding the enhancement layer data separately for the color channels (R , G , B) , based on said predicted enhancement layer data ; wherein in at least one mode each enhancement layer color channel (R , G , B) is predicted jointly (200) from all available base layer color channels , the method further comprising for at least one of the enhancement layer color channels the further steps of - generating residual data (R res , B res , G res) being the difference between original enhancement layer color channel (REL , G E L , B EL) and predicted color channel data ; encoding (202r , 202g , 202b) the original enhancement layer color channel data ; - encoding (203r , 203g , 203b , 204r , 204g , 204b) the residual data ; - selecting (RDO r , RDO g , RDO b) for the at least one enhancement layer color channel either the encoded original enhancement layer color channel data , the residual data or the encoded residual data , wherein the selection is independent from the selection of other enhancement layer color channels ; and providing as enhancement layer output data the selected enhancement layer color channel data and an indication of the selected encoding mode referring to said enhancement layer color channel . WO2008128898A1 CLAIM 2 . Method according to claim 1 , wherein the base layer and enhancement layer use different color (spatial domain, spatial domain transform coding, transform coding, prediction coding) encoding (Y , CR , CB , R , G , B) and the inter-layer prediction (200) further comprises color space (spatial domain, spatial domain transform coding, transform coding, prediction coding) conversion for both Intra- and Inter-coding . WO2008128898A1 CLAIM 5 . Method according to one of the previous claims , wherein an additional encoding mode for enhancement layer color channel data comprises skip mode (spatial domain, spatial domain transform coding, transform coding, prediction coding) (405) on macro-block level , wherein in skip mode the enhancement layer data contains no bits for the respective macro-block .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream (different bit) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (entropy coding, residual data) information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding (different color, color space, skip mode) and the second maximum region size and the second subdivision information are associated with transform coding (different color, color space, skip mode) ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	WO2008128898A1 CLAIM 1 . Method for encoding video data comprising base layer (BL) data and enhancement layer (EL) data , wherein the base layer and enhancement layer data comprise a plurality of color channels (Y , Cr , Cb , R , G , B) and wherein base layer and enhancement layer data have different bit (data stream) depth , comprising steps of encoding (201y , 201cr , 201cb) the base layer data ; - predicting (200) the enhancement layer data from the base layer data separately for the color channels ; and encoding the enhancement layer data separately for the color channels (R , G , B) , based on said predicted enhancement layer data ; wherein in at least one mode each enhancement layer color channel (R , G , B) is predicted jointly (200) from all available base layer color channels , the method further comprising for at least one of the enhancement layer color channels the further steps of - generating residual data (second subdivision, intermediate subdivision) (R res , B res , G res) being the difference between original enhancement layer color channel (REL , G E L , B EL) and predicted color channel data ; encoding (202r , 202g , 202b) the original enhancement layer color channel data ; - encoding (203r , 203g , 203b , 204r , 204g , 204b) the residual data ; - selecting (RDO r , RDO g , RDO b) for the at least one enhancement layer color channel either the encoded original enhancement layer color channel data , the residual data or the encoded residual data , wherein the selection is independent from the selection of other enhancement layer color channels ; and providing as enhancement layer output data the selected enhancement layer color channel data and an indication of the selected encoding mode referring to said enhancement layer color channel . WO2008128898A1 CLAIM 2 . Method according to claim 1 , wherein the base layer and enhancement layer use different color (spatial domain, spatial domain transform coding, transform coding, prediction coding) encoding (Y , CR , CB , R , G , B) and the inter-layer prediction (200) further comprises color space (spatial domain, spatial domain transform coding, transform coding, prediction coding) conversion for both Intra- and Inter-coding . WO2008128898A1 CLAIM 4 . Method according to one of the previous claims , wherein the encoding of the residual comprises entropy coding (second subdivision, intermediate subdivision) (204r , 204g , 204b) . WO2008128898A1 CLAIM 5 . Method according to one of the previous claims , wherein an additional encoding mode for enhancement layer color channel data comprises skip mode (spatial domain, spatial domain transform coding, transform coding, prediction coding) (405) on macro-block level , wherein in skip mode the enhancement layer data contains no bits for the respective macro-block .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (entropy coding, residual data) information and a maximum hierarchy level ; and a data stream (different bit) generator configured to : encode the array of information samples using prediction coding (different color, color space, skip mode) in accordance with the first set of sub-regions and transform coding (different color, color space, skip mode) in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	WO2008128898A1 CLAIM 1 . Method for encoding video data comprising base layer (BL) data and enhancement layer (EL) data , wherein the base layer and enhancement layer data comprise a plurality of color channels (Y , Cr , Cb , R , G , B) and wherein base layer and enhancement layer data have different bit (data stream) depth , comprising steps of encoding (201y , 201cr , 201cb) the base layer data ; - predicting (200) the enhancement layer data from the base layer data separately for the color channels ; and encoding the enhancement layer data separately for the color channels (R , G , B) , based on said predicted enhancement layer data ; wherein in at least one mode each enhancement layer color channel (R , G , B) is predicted jointly (200) from all available base layer color channels , the method further comprising for at least one of the enhancement layer color channels the further steps of - generating residual data (second subdivision, intermediate subdivision) (R res , B res , G res) being the difference between original enhancement layer color channel (REL , G E L , B EL) and predicted color channel data ; encoding (202r , 202g , 202b) the original enhancement layer color channel data ; - encoding (203r , 203g , 203b , 204r , 204g , 204b) the residual data ; - selecting (RDO r , RDO g , RDO b) for the at least one enhancement layer color channel either the encoded original enhancement layer color channel data , the residual data or the encoded residual data , wherein the selection is independent from the selection of other enhancement layer color channels ; and providing as enhancement layer output data the selected enhancement layer color channel data and an indication of the selected encoding mode referring to said enhancement layer color channel . WO2008128898A1 CLAIM 2 . Method according to claim 1 , wherein the base layer and enhancement layer use different color (spatial domain, spatial domain transform coding, transform coding, prediction coding) encoding (Y , CR , CB , R , G , B) and the inter-layer prediction (200) further comprises color space (spatial domain, spatial domain transform coding, transform coding, prediction coding) conversion for both Intra- and Inter-coding . WO2008128898A1 CLAIM 4 . Method according to one of the previous claims , wherein the encoding of the residual comprises entropy coding (second subdivision, intermediate subdivision) (204r , 204g , 204b) . WO2008128898A1 CLAIM 5 . Method according to one of the previous claims , wherein an additional encoding mode for enhancement layer color channel data comprises skip mode (spatial domain, spatial domain transform coding, transform coding, prediction coding) (405) on macro-block level , wherein in skip mode the enhancement layer data contains no bits for the respective macro-block .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (entropy coding, residual data) information and a maximum hierarchy level ; encoding the array of information samples using prediction coding (different color, color space, skip mode) in accordance with the first set of sub-regions and transform coding (different color, color space, skip mode) in accordance with the second set of sub-regions ; and inserting into a data stream (different bit) the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	WO2008128898A1 CLAIM 1 . Method for encoding video data comprising base layer (BL) data and enhancement layer (EL) data , wherein the base layer and enhancement layer data comprise a plurality of color channels (Y , Cr , Cb , R , G , B) and wherein base layer and enhancement layer data have different bit (data stream) depth , comprising steps of encoding (201y , 201cr , 201cb) the base layer data ; - predicting (200) the enhancement layer data from the base layer data separately for the color channels ; and encoding the enhancement layer data separately for the color channels (R , G , B) , based on said predicted enhancement layer data ; wherein in at least one mode each enhancement layer color channel (R , G , B) is predicted jointly (200) from all available base layer color channels , the method further comprising for at least one of the enhancement layer color channels the further steps of - generating residual data (second subdivision, intermediate subdivision) (R res , B res , G res) being the difference between original enhancement layer color channel (REL , G E L , B EL) and predicted color channel data ; encoding (202r , 202g , 202b) the original enhancement layer color channel data ; - encoding (203r , 203g , 203b , 204r , 204g , 204b) the residual data ; - selecting (RDO r , RDO g , RDO b) for the at least one enhancement layer color channel either the encoded original enhancement layer color channel data , the residual data or the encoded residual data , wherein the selection is independent from the selection of other enhancement layer color channels ; and providing as enhancement layer output data the selected enhancement layer color channel data and an indication of the selected encoding mode referring to said enhancement layer color channel . WO2008128898A1 CLAIM 2 . Method according to claim 1 , wherein the base layer and enhancement layer use different color (spatial domain, spatial domain transform coding, transform coding, prediction coding) encoding (Y , CR , CB , R , G , B) and the inter-layer prediction (200) further comprises color space (spatial domain, spatial domain transform coding, transform coding, prediction coding) conversion for both Intra- and Inter-coding . WO2008128898A1 CLAIM 4 . Method according to one of the previous claims , wherein the encoding of the residual comprises entropy coding (second subdivision, intermediate subdivision) (204r , 204g , 204b) . WO2008128898A1 CLAIM 5 . Method according to one of the previous claims , wherein an additional encoding mode for enhancement layer color channel data comprises skip mode (spatial domain, spatial domain transform coding, transform coding, prediction coding) (405) on macro-block level , wherein in skip mode the enhancement layer data contains no bits for the respective macro-block .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20090238279A1 Filed: 2008-03-21 Issued: 2009-09-24 Motion-compensated prediction of inter-layer residuals (Original Assignee) Microsoft Corp (Current Assignee) Microsoft Technology Licensing LLC Chengjie Tu, Sridhar Srinivasan, Shankar Regunathan, Shijun Sun, Chih-Lung Lin
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region (picture basis) sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples (second sample, first sample) representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20090238279A1 CLAIM 4 . The method of claim 1 further comprising , on a picture-by-picture basis (second maximum region, second maximum region sizes) : after the encoding the base layer video , determining the inter-layer residual video using reconstructed base layer video and the input video . US20090238279A1 CLAIM 8 . The method of claim 7 wherein the scaling comprises mapping samples of the inter-layer residual video from a first sample (information samples) depth to a second sample (information samples) depth smaller than the first sample depth .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples (second sample, first sample) into the first set of root regions such that the first set of root regions are rectangular blocks of a size determined by the first maximum region size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	US20090238279A1 CLAIM 8 . The method of claim 7 wherein the scaling comprises mapping samples of the inter-layer residual video from a first sample (information samples) depth to a second sample (information samples) depth smaller than the first sample depth .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples (second sample, first sample) , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20090238279A1 CLAIM 8 . The method of claim 7 wherein the scaling comprises mapping samples of the inter-layer residual video from a first sample (information samples) depth to a second sample (information samples) depth smaller than the first sample depth .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples (second sample, first sample) from the data stream , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	US20090238279A1 CLAIM 8 . The method of claim 7 wherein the scaling comprises mapping samples of the inter-layer residual video from a first sample (information samples) depth to a second sample (information samples) depth smaller than the first sample depth .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region (picture basis) sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples (second sample, first sample) representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20090238279A1 CLAIM 4 . The method of claim 1 further comprising , on a picture-by-picture basis (second maximum region, second maximum region sizes) : after the encoding the base layer video , determining the inter-layer residual video using reconstructed base layer video and the input video . US20090238279A1 CLAIM 8 . The method of claim 7 wherein the scaling comprises mapping samples of the inter-layer residual video from a first sample (information samples) depth to a second sample (information samples) depth smaller than the first sample depth .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples (second sample, first sample) representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region (picture basis) size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20090238279A1 CLAIM 4 . The method of claim 1 further comprising , on a picture-by-picture basis (second maximum region, second maximum region sizes) : after the encoding the base layer video , determining the inter-layer residual video using reconstructed base layer video and the input video . US20090238279A1 CLAIM 8 . The method of claim 7 wherein the scaling comprises mapping samples of the inter-layer residual video from a first sample (information samples) depth to a second sample (information samples) depth smaller than the first sample depth .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples (second sample, first sample) representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region (picture basis) size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20090238279A1 CLAIM 4 . The method of claim 1 further comprising , on a picture-by-picture basis (second maximum region, second maximum region sizes) : after the encoding the base layer video , determining the inter-layer residual video using reconstructed base layer video and the input video . US20090238279A1 CLAIM 8 . The method of claim 7 wherein the scaling comprises mapping samples of the inter-layer residual video from a first sample (information samples) depth to a second sample (information samples) depth smaller than the first sample depth .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20090175333A1 Filed: 2008-01-09 Issued: 2009-07-09 Method and apparatus for highly scalable intraframe video coding (Original Assignee) Motorola Solutions Inc (Current Assignee) Google Technology Holdings LLC Shih-Ta Hsiang
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream (different bit) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20090175333A1 CLAIM 9 . The method according to claim 3 , wherein blocks of the subband coefficients are further grouped according to a slice group map , as defined in H . 264/AVC , that further conforms to the subband partition or resolution scale of the subband representation and different groups of coefficient blocks are encoded into different bit (data stream) stream packets .
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset (pixel value) of the second set of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	US20090175333A1 CLAIM 10 . A quality scalable video decoding method for decompressing a coded video frame into a decoded video frame , comprising : extracting the packets containing the related coded coefficients to a requested resolution and/or quality level from a scalable bitstream using a bitstream parser ; recovering a base quality version of the decoded video frame from the extracted packets of the base quality layer bitstream ; recovering a set of decoded subband representations of increasing quality level , wherein each decoded subband representation in the set is recovered by decoding the extracted packets of the corresponding one of the set of enhancement layer bitstreams , comprising for each enhancement layer bitstream forming an inter-layer prediction signal which is a representation of a recovered video frame of the next lower quality layer , and recovering the subband representation by decoding the extracted packets of the corresponding enhancement layer by an inter-layer frame texture decoder that further utilizes the inter-layer prediction signal to remove inter-layer redundancy ; synthesizing the decoded video frame from the decoded subband representation at the final enhancement layer using subband synthesis filter banks ; and performing a clipping operation on the synthesized video frame according to the pixel value (neighboring subset) range .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level from the data stream (different bit) .	US20090175333A1 CLAIM 9 . The method according to claim 3 , wherein blocks of the subband coefficients are further grouped according to a slice group map , as defined in H . 264/AVC , that further conforms to the subband partition or resolution scale of the subband representation and different groups of coefficient blocks are encoded into different bit (data stream) stream packets .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements (syntax element, video coding) associated with the first or second set of sub-regions from the data stream (different bit) in a depth-first traversal order .	US20090175333A1 CLAIM 4 . The method according to claim 3 , wherein the inter-layer frame texture encoder comprises an enhancement-layer intraframe encoder conforming to the scalable video coding (syntax elements) extension to the MPEG-4 Part 10 AVC/H . 264 standard but without a clipping operation performed on the decoded signal . US20090175333A1 CLAIM 6 . The method according to claim 1 , wherein the enhancement-layer bitstreams contain a syntax element (syntax elements) indicating the number of the decomposition levels of each enhancement layer . US20090175333A1 CLAIM 9 . The method according to claim 3 , wherein blocks of the subband coefficients are further grouped according to a slice group map , as defined in H . 264/AVC , that further conforms to the subband partition or resolution scale of the subband representation and different groups of coefficient blocks are encoded into different bit (data stream) stream packets .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements (syntax element, video coding) of the data stream (different bit) , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20090175333A1 CLAIM 4 . The method according to claim 3 , wherein the inter-layer frame texture encoder comprises an enhancement-layer intraframe encoder conforming to the scalable video coding (syntax elements) extension to the MPEG-4 Part 10 AVC/H . 264 standard but without a clipping operation performed on the decoded signal . US20090175333A1 CLAIM 6 . The method according to claim 1 , wherein the enhancement-layer bitstreams contain a syntax element (syntax elements) indicating the number of the decomposition levels of each enhancement layer . US20090175333A1 CLAIM 9 . The method according to claim 3 , wherein blocks of the subband coefficients are further grouped according to a slice group map , as defined in H . 264/AVC , that further conforms to the subband partition or resolution scale of the subband representation and different groups of coefficient blocks are encoded into different bit (data stream) stream packets .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream (different bit) , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	US20090175333A1 CLAIM 9 . The method according to claim 3 , wherein blocks of the subband coefficients are further grouped according to a slice group map , as defined in H . 264/AVC , that further conforms to the subband partition or resolution scale of the subband representation and different groups of coefficient blocks are encoded into different bit (data stream) stream packets .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream (different bit) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20090175333A1 CLAIM 9 . The method according to claim 3 , wherein blocks of the subband coefficients are further grouped according to a slice group map , as defined in H . 264/AVC , that further conforms to the subband partition or resolution scale of the subband representation and different groups of coefficient blocks are encoded into different bit (data stream) stream packets .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream (different bit) generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20090175333A1 CLAIM 9 . The method according to claim 3 , wherein blocks of the subband coefficients are further grouped according to a slice group map , as defined in H . 264/AVC , that further conforms to the subband partition or resolution scale of the subband representation and different groups of coefficient blocks are encoded into different bit (data stream) stream packets .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream (different bit) the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20090175333A1 CLAIM 9 . The method according to claim 3 , wherein blocks of the subband coefficients are further grouped according to a slice group map , as defined in H . 264/AVC , that further conforms to the subband partition or resolution scale of the subband representation and different groups of coefficient blocks are encoded into different bit (data stream) stream packets .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20080165855A1 Filed: 2008-01-07 Issued: 2008-07-10 inter-layer prediction for extended spatial scalability in video coding (Original Assignee) Nokia Oyj (Current Assignee) Nokia Technologies Oy Xianglin Wang, Justin Ridge
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (same reference, video frame) information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision (same reference, video frame) information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20080165855A1 CLAIM 1 . A method for encoding an enhancement layer block representing at least a portion of a video frame (second subdivision, first subdivision) within a scalable bit stream , comprising : deriving a coding mode indicator specifying a partition of the enhancement layer block based at least in part on a plurality of reference frame index values corresponding to a plurality of reference layer blocks , wherein the reference layer blocks that have the same reference (second subdivision, first subdivision) frame index are merged to derive the partition size ; and encoding the enhancement layer block utilizing the coding mode indicator .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision (same reference, video frame) information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20080165855A1 CLAIM 1 . A method for encoding an enhancement layer block representing at least a portion of a video frame (second subdivision, first subdivision) within a scalable bit stream , comprising : deriving a coding mode indicator specifying a partition of the enhancement layer block based at least in part on a plurality of reference frame index values corresponding to a plurality of reference layer blocks , wherein the reference layer blocks that have the same reference (second subdivision, first subdivision) frame index are merged to derive the partition size ; and encoding the enhancement layer block utilizing the coding mode indicator .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision (same reference, video frame) information includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level is sub-divided .	US20080165855A1 CLAIM 1 . A method for encoding an enhancement layer block representing at least a portion of a video frame (second subdivision, first subdivision) within a scalable bit stream , comprising : deriving a coding mode indicator specifying a partition of the enhancement layer block based at least in part on a plurality of reference frame index values corresponding to a plurality of reference layer blocks , wherein the reference layer blocks that have the same reference (second subdivision, first subdivision) frame index are merged to derive the partition size ; and encoding the enhancement layer block utilizing the coding mode indicator .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision (same reference, video frame) information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20080165855A1 CLAIM 1 . A method for encoding an enhancement layer block representing at least a portion of a video frame (second subdivision, first subdivision) within a scalable bit stream , comprising : deriving a coding mode indicator specifying a partition of the enhancement layer block based at least in part on a plurality of reference frame index values corresponding to a plurality of reference layer blocks , wherein the reference layer blocks that have the same reference (second subdivision, first subdivision) frame index are merged to derive the partition size ; and encoding the enhancement layer block utilizing the coding mode indicator .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (same reference, video frame) information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision (same reference, video frame) information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20080165855A1 CLAIM 1 . A method for encoding an enhancement layer block representing at least a portion of a video frame (second subdivision, first subdivision) within a scalable bit stream , comprising : deriving a coding mode indicator specifying a partition of the enhancement layer block based at least in part on a plurality of reference frame index values corresponding to a plurality of reference layer blocks , wherein the reference layer blocks that have the same reference (second subdivision, first subdivision) frame index are merged to derive the partition size ; and encoding the enhancement layer block utilizing the coding mode indicator .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision (same reference, video frame) information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (same reference, video frame) information and a maximum hierarchy level ; and a data stream generator (absolute difference) configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20080165855A1 CLAIM 1 . A method for encoding an enhancement layer block representing at least a portion of a video frame (second subdivision, first subdivision) within a scalable bit stream , comprising : deriving a coding mode indicator specifying a partition of the enhancement layer block based at least in part on a plurality of reference frame index values corresponding to a plurality of reference layer blocks , wherein the reference layer blocks that have the same reference (second subdivision, first subdivision) frame index are merged to derive the partition size ; and encoding the enhancement layer block utilizing the coding mode indicator . US20080165855A1 CLAIM 4 . The method of claim 3 , wherein the difference metric is derived by a sum of absolute difference (data stream generator) of motion vector components , and wherein the threshold value is equal to one .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision (same reference, video frame) information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (same reference, video frame) information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20080165855A1 CLAIM 1 . A method for encoding an enhancement layer block representing at least a portion of a video frame (second subdivision, first subdivision) within a scalable bit stream , comprising : deriving a coding mode indicator specifying a partition of the enhancement layer block based at least in part on a plurality of reference frame index values corresponding to a plurality of reference layer blocks , wherein the reference layer blocks that have the same reference (second subdivision, first subdivision) frame index are merged to derive the partition size ; and encoding the enhancement layer block utilizing the coding mode indicator .
US10250913B2 CLAIM 15 . A non-transitory computer readable digital storage medium having stored thereon a computer program (computer program) having a program code for performing , when running on a computer , a method according to claim 12 .	US20080165855A1 CLAIM 7 . A computer program (computer program) product , embodied in a computer-readable medium , comprising computer code for performing the processes of claim 1 .
US10250913B2 CLAIM 16 . A non-transitory computer readable digital storage medium having stored thereon a computer program (computer program) having a program code for performing , when running on a computer , a method according to claim 14 .	US20080165855A1 CLAIM 7 . A computer program (computer program) product , embodied in a computer-readable medium , comprising computer code for performing the processes of claim 1 .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20090152357A1 Filed: 2007-12-12 Issued: 2009-06-18 Document verification using dynamic document identification framework (Original Assignee) 3M Innovative Properties Co (Current Assignee) Thales DIS France SA Yiwu Lei, James E. MacLean
US10250913B2 CLAIM 15 . A non-transitory computer readable digital storage (electronic information) medium having stored thereon a computer program having a program code for performing , when running on a computer , a method according to claim 12 .	US20090152357A1 CLAIM 16 . The method of claim 1 , further comprising identifying and verifying the unknown document as a security document that combines embedded electronic information (readable digital storage) includes one or more of radio frequency identification (RFID) data , electronic passport data , smartcard data , or magnetic strip data .
US10250913B2 CLAIM 16 . A non-transitory computer readable digital storage (electronic information) medium having stored thereon a computer program having a program code for performing , when running on a computer , a method according to claim 14 .	US20090152357A1 CLAIM 16 . The method of claim 1 , further comprising identifying and verifying the unknown document as a security document that combines embedded electronic information (readable digital storage) includes one or more of radio frequency identification (RFID) data , electronic passport data , smartcard data , or magnetic strip data .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	WO2008071542A1 Filed: 2007-11-27 Issued: 2008-06-19 Method and apparatus for encoding and/or decoding video data using adaptive prediction order for spatial and bit depth prediction (Original Assignee) Thomson Licensing Yuwen Wu, Yongying Gao, Ingo Doser
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information (video information) , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding (residual information) and the second maximum region size and the second subdivision information are associated with transform coding (inverse transformation) ; a divider configured to : divide an array of information samples (inverse transformation) representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	WO2008071542A1 CLAIM 6 . Method for decoding video data having a base layer and an enhancement layer , the method comprising the steps of receiving enhancement layer information (EL enc) , base layer information (BL enc) and an indication (bit depth pred after spatial flag) ; performing inverse quantization (T " ; 1) and inverse transformation (transform coding, information samples) (Q ' ; 1) on the received base layer and enhancement layer information ; - determining a prediction order based upon said indication (bit depth pred after spatial flag) , the prediction order indicating whether bit depth upsampling shall be done before or after spatial upsampling ; - upsampling (BDUp , TUp) inverse quantized and inverse transformed base layer information , wherein the number of pixels and the value depth per pixel are increased in the determined prediction order and wherein predicted enhancement layer information (Pre2 { Prei {BL rec } }) is obtained ; and reconstructing from the predicted enhancement layer information (Pre2 { Prei {BL rec } }) and the inverse quantized and inverse transformed enhancement layer information reconstructed enhancement layer video information (video information) (EL rec) . WO2008071542A1 CLAIM 7 . Method according to claim 6 , wherein the inverse quantized and inverse transformed enhancement layer information comprises residual information (quadtree partitioning, prediction coding, quadtree partitioning technique) (EI/ res) , further comprising the steps of reconstructing base layer video (BL rec) from the inverse quantized and inverse transformed base layer information and adding (A 2 , EL) said residual information (EL' ; res) to said predicted version of enhancement layer information (Pre 2 { Prei {BL rec } }) •
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples (inverse transformation) into the first set of root regions such that the first set of root regions are rectangular blocks of a size determined by the first maximum region size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	WO2008071542A1 CLAIM 6 . Method for decoding video data having a base layer and an enhancement layer , the method comprising the steps of receiving enhancement layer information (EL enc) , base layer information (BL enc) and an indication (bit depth pred after spatial flag) ; performing inverse quantization (T " ; 1) and inverse transformation (transform coding, information samples) (Q ' ; 1) on the received base layer and enhancement layer information ; - determining a prediction order based upon said indication (bit depth pred after spatial flag) , the prediction order indicating whether bit depth upsampling shall be done before or after spatial upsampling ; - upsampling (BDUp , TUp) inverse quantized and inverse transformed base layer information , wherein the number of pixels and the value depth per pixel are increased in the determined prediction order and wherein predicted enhancement layer information (Pre2 { Prei {BL rec } }) is obtained ; and reconstructing from the predicted enhancement layer information (Pre2 { Prei {BL rec } }) and the inverse quantized and inverse transformed enhancement layer information reconstructed enhancement layer video information (EL rec) .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules (predefined rule) associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	WO2008071542A1 CLAIM 3 . Method according to claim 1 , further comprising the steps of analyzing the base layer and/or enhancement layer information according to predefined rule (partition rules) s , wherein a value indicative of texture and/or color homogeneity is obtained ; based on said value indicative of texture and/or color homogeneity , determining the prediction order by which the determined smaller residual is obtained ; and encoding the enhancement layer residual according to the determined prediction order .
US10250913B2 CLAIM 5 . The decoder according to claim 4 , wherein the divider is configured to , in accordance with the partition rules (predefined rule) associated with the first and higher-order hierarchy levels , sub-divide into sub-regions of equal size , such that there are an equal number of sub-regions at each hierarchy level .	WO2008071542A1 CLAIM 3 . Method according to claim 1 , further comprising the steps of analyzing the base layer and/or enhancement layer information according to predefined rule (partition rules) s , wherein a value indicative of texture and/or color homogeneity is obtained ; based on said value indicative of texture and/or color homogeneity , determining the prediction order by which the determined smaller residual is obtained ; and encoding the enhancement layer residual according to the determined prediction order .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision (residual data) of the array of information samples (inverse transformation) , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	WO2008071542A1 CLAIM 5 . Method according to one of the claims 1-4 , wherein the step of upsampling comprises in the case of Inter coded base layer information upsampling of reconstructed base layer residual data (intermediate subdivision) (BL res , r ec , k) • WO2008071542A1 CLAIM 6 . Method for decoding video data having a base layer and an enhancement layer , the method comprising the steps of receiving enhancement layer information (EL enc) , base layer information (BL enc) and an indication (bit depth pred after spatial flag) ; performing inverse quantization (T " ; 1) and inverse transformation (transform coding, information samples) (Q ' ; 1) on the received base layer and enhancement layer information ; - determining a prediction order based upon said indication (bit depth pred after spatial flag) , the prediction order indicating whether bit depth upsampling shall be done before or after spatial upsampling ; - upsampling (BDUp , TUp) inverse quantized and inverse transformed base layer information , wherein the number of pixels and the value depth per pixel are increased in the determined prediction order and wherein predicted enhancement layer information (Pre2 { Prei {BL rec } }) is obtained ; and reconstructing from the predicted enhancement layer information (Pre2 { Prei {BL rec } }) and the inverse quantized and inverse transformed enhancement layer information reconstructed enhancement layer video information (EL rec) .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples (inverse transformation) from the data stream , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding (inverse transformation) to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	WO2008071542A1 CLAIM 6 . Method for decoding video data having a base layer and an enhancement layer , the method comprising the steps of receiving enhancement layer information (EL enc) , base layer information (BL enc) and an indication (bit depth pred after spatial flag) ; performing inverse quantization (T " ; 1) and inverse transformation (transform coding, information samples) (Q ' ; 1) on the received base layer and enhancement layer information ; - determining a prediction order based upon said indication (bit depth pred after spatial flag) , the prediction order indicating whether bit depth upsampling shall be done before or after spatial upsampling ; - upsampling (BDUp , TUp) inverse quantized and inverse transformed base layer information , wherein the number of pixels and the value depth per pixel are increased in the determined prediction order and wherein predicted enhancement layer information (Pre2 { Prei {BL rec } }) is obtained ; and reconstructing from the predicted enhancement layer information (Pre2 { Prei {BL rec } }) and the inverse quantized and inverse transformed enhancement layer information reconstructed enhancement layer video information (EL rec) .
US10250913B2 CLAIM 11 . The decoder according to claim 1 , wherein the recursive multi-tree partitioning includes a quadtree partitioning (residual information) technique .	WO2008071542A1 CLAIM 7 . Method according to claim 6 , wherein the inverse quantized and inverse transformed enhancement layer information comprises residual information (quadtree partitioning, prediction coding, quadtree partitioning technique) (EI/ res) , further comprising the steps of reconstructing base layer video (BL rec) from the inverse quantized and inverse transformed base layer information and adding (A 2 , EL) said residual information (EL' ; res) to said predicted version of enhancement layer information (Pre 2 { Prei {BL rec } }) •
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information (video information) , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding (residual information) and the second maximum region size and the second subdivision information are associated with transform coding (inverse transformation) ; dividing an array of information samples (inverse transformation) representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	WO2008071542A1 CLAIM 6 . Method for decoding video data having a base layer and an enhancement layer , the method comprising the steps of receiving enhancement layer information (EL enc) , base layer information (BL enc) and an indication (bit depth pred after spatial flag) ; performing inverse quantization (T " ; 1) and inverse transformation (transform coding, information samples) (Q ' ; 1) on the received base layer and enhancement layer information ; - determining a prediction order based upon said indication (bit depth pred after spatial flag) , the prediction order indicating whether bit depth upsampling shall be done before or after spatial upsampling ; - upsampling (BDUp , TUp) inverse quantized and inverse transformed base layer information , wherein the number of pixels and the value depth per pixel are increased in the determined prediction order and wherein predicted enhancement layer information (Pre2 { Prei {BL rec } }) is obtained ; and reconstructing from the predicted enhancement layer information (Pre2 { Prei {BL rec } }) and the inverse quantized and inverse transformed enhancement layer information reconstructed enhancement layer video information (video information) (EL rec) . WO2008071542A1 CLAIM 7 . Method according to claim 6 , wherein the inverse quantized and inverse transformed enhancement layer information comprises residual information (quadtree partitioning, prediction coding, quadtree partitioning technique) (EI/ res) , further comprising the steps of reconstructing base layer video (BL rec) from the inverse quantized and inverse transformed base layer information and adding (A 2 , EL) said residual information (EL' ; res) to said predicted version of enhancement layer information (Pre 2 { Prei {BL rec } }) •
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples (inverse transformation) representing a spatially sampled portion of video information (video information) into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding (residual information) in accordance with the first set of sub-regions and transform coding (inverse transformation) in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	WO2008071542A1 CLAIM 6 . Method for decoding video data having a base layer and an enhancement layer , the method comprising the steps of receiving enhancement layer information (EL enc) , base layer information (BL enc) and an indication (bit depth pred after spatial flag) ; performing inverse quantization (T " ; 1) and inverse transformation (transform coding, information samples) (Q ' ; 1) on the received base layer and enhancement layer information ; - determining a prediction order based upon said indication (bit depth pred after spatial flag) , the prediction order indicating whether bit depth upsampling shall be done before or after spatial upsampling ; - upsampling (BDUp , TUp) inverse quantized and inverse transformed base layer information , wherein the number of pixels and the value depth per pixel are increased in the determined prediction order and wherein predicted enhancement layer information (Pre2 { Prei {BL rec } }) is obtained ; and reconstructing from the predicted enhancement layer information (Pre2 { Prei {BL rec } }) and the inverse quantized and inverse transformed enhancement layer information reconstructed enhancement layer video information (video information) (EL rec) . WO2008071542A1 CLAIM 7 . Method according to claim 6 , wherein the inverse quantized and inverse transformed enhancement layer information comprises residual information (quadtree partitioning, prediction coding, quadtree partitioning technique) (EI/ res) , further comprising the steps of reconstructing base layer video (BL rec) from the inverse quantized and inverse transformed base layer information and adding (A 2 , EL) said residual information (EL' ; res) to said predicted version of enhancement layer information (Pre 2 { Prei {BL rec } }) •
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples (inverse transformation) representing a spatially sampled portion of video information (video information) into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding (residual information) in accordance with the first set of sub-regions and transform coding (inverse transformation) in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	WO2008071542A1 CLAIM 6 . Method for decoding video data having a base layer and an enhancement layer , the method comprising the steps of receiving enhancement layer information (EL enc) , base layer information (BL enc) and an indication (bit depth pred after spatial flag) ; performing inverse quantization (T " ; 1) and inverse transformation (transform coding, information samples) (Q ' ; 1) on the received base layer and enhancement layer information ; - determining a prediction order based upon said indication (bit depth pred after spatial flag) , the prediction order indicating whether bit depth upsampling shall be done before or after spatial upsampling ; - upsampling (BDUp , TUp) inverse quantized and inverse transformed base layer information , wherein the number of pixels and the value depth per pixel are increased in the determined prediction order and wherein predicted enhancement layer information (Pre2 { Prei {BL rec } }) is obtained ; and reconstructing from the predicted enhancement layer information (Pre2 { Prei {BL rec } }) and the inverse quantized and inverse transformed enhancement layer information reconstructed enhancement layer video information (video information) (EL rec) . WO2008071542A1 CLAIM 7 . Method according to claim 6 , wherein the inverse quantized and inverse transformed enhancement layer information comprises residual information (quadtree partitioning, prediction coding, quadtree partitioning technique) (EI/ res) , further comprising the steps of reconstructing base layer video (BL rec) from the inverse quantized and inverse transformed base layer information and adding (A 2 , EL) said residual information (EL' ; res) to said predicted version of enhancement layer information (Pre 2 { Prei {BL rec } }) •

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	CN101395922A Filed: 2007-11-19 Issued: 2009-03-25 用于解码/编码视频信号的方法及装置 (Original Assignee) Lg电子株式会社全柄文, 朴胜煜
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information (视频信号) , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level (水平方向, 包括水平) (水平方向, 包括水平) wherein the first maximum region size (一种解码) and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN101395922A CLAIM 1、一种解码 (first maximum region size) 视频信号 (video information) 的方法，所述方法包括：解码第一层的比特流；获得表示是否对第二层的当前块执行层间预测的标志信息；基于所述标志信息获得至少一个偏移量信息，所述偏移量信息表示用于所述层间预测的所述第一层的上采样后的图像和所述第二层的当前图像间的位置差异；和通过使用所述至少一个偏移量信息，对所述第一层的参考图像进行上采样。 CN101395922A CLAIM 5、根据权利要求3所述的方法，其中，所述关于色度信号的相移的信息包括水平方向 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) 上的相移信息和垂直方向上的相移信息。
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set of root regions such that the first set of root regions are rectangular blocks of a size determined by the first maximum region size (一种解码) , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	CN101395922A CLAIM 1、一种解码 (first maximum region size) 视频信号的方法，所述方法包括：解码第一层的比特流；获得表示是否对第二层的当前块执行层间预测的标志信息；基于所述标志信息获得至少一个偏移量信息，所述偏移量信息表示用于所述层间预测的所述第一层的上采样后的图像和所述第二层的当前图像间的位置差异；和通过使用所述至少一个偏移量信息，对所述第一层的参考图像进行上采样。
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level (水平方向, 包括水平) (水平方向, 包括水平) according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level (水平方向, 包括水平) is reached .	CN101395922A CLAIM 5、根据权利要求3所述的方法，其中，所述关于色度信号的相移的信息包括水平方向 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) 上的相移信息和垂直方向上的相移信息。
US10250913B2 CLAIM 5 . The decoder according to claim 4 , wherein the divider is configured to , in accordance with the partition rules associated with the first and higher-order hierarchy levels , sub-divide into sub-regions of equal size , such that there are an equal number of sub-regions at each hierarchy level (水平方向, 包括水平) .	CN101395922A CLAIM 5、根据权利要求3所述的方法，其中，所述关于色度信号的相移的信息包括水平方向 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) 上的相移信息和垂直方向上的相移信息。
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision information includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level (水平方向, 包括水平) is sub-divided .	CN101395922A CLAIM 5、根据权利要求3所述的方法，其中，所述关于色度信号的相移的信息包括水平方向 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) 上的相移信息和垂直方向上的相移信息。
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level (水平方向, 包括水平) (水平方向, 包括水平) from the data stream .	CN101395922A CLAIM 5、根据权利要求3所述的方法，其中，所述关于色度信号的相移的信息包括水平方向 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) 上的相移信息和垂直方向上的相移信息。
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information (视频信号) , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level (水平方向, 包括水平) (水平方向, 包括水平) , wherein the first maximum region size (一种解码) and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN101395922A CLAIM 1、一种解码 (first maximum region size) 视频信号 (video information) 的方法，所述方法包括：解码第一层的比特流；获得表示是否对第二层的当前块执行层间预测的标志信息；基于所述标志信息获得至少一个偏移量信息，所述偏移量信息表示用于所述层间预测的所述第一层的上采样后的图像和所述第二层的当前图像间的位置差异；和通过使用所述至少一个偏移量信息，对所述第一层的参考图像进行上采样。 CN101395922A CLAIM 5、根据权利要求3所述的方法，其中，所述关于色度信号的相移的信息包括水平方向 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) 上的相移信息和垂直方向上的相移信息。
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information (视频信号) into a first set of root regions based on a first maximum region size (一种解码) , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level (水平方向, 包括水平) (水平方向, 包括水平) ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN101395922A CLAIM 1、一种解码 (first maximum region size) 视频信号 (video information) 的方法，所述方法包括：解码第一层的比特流；获得表示是否对第二层的当前块执行层间预测的标志信息；基于所述标志信息获得至少一个偏移量信息，所述偏移量信息表示用于所述层间预测的所述第一层的上采样后的图像和所述第二层的当前图像间的位置差异；和通过使用所述至少一个偏移量信息，对所述第一层的参考图像进行上采样。 CN101395922A CLAIM 5、根据权利要求3所述的方法，其中，所述关于色度信号的相移的信息包括水平方向 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) 上的相移信息和垂直方向上的相移信息。
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information (视频信号) into a first set of root regions based on a first maximum region size (一种解码) ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level (水平方向, 包括水平) (水平方向, 包括水平) ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN101395922A CLAIM 1、一种解码 (first maximum region size) 视频信号 (video information) 的方法，所述方法包括：解码第一层的比特流；获得表示是否对第二层的当前块执行层间预测的标志信息；基于所述标志信息获得至少一个偏移量信息，所述偏移量信息表示用于所述层间预测的所述第一层的上采样后的图像和所述第二层的当前图像间的位置差异；和通过使用所述至少一个偏移量信息，对所述第一层的参考图像进行上采样。 CN101395922A CLAIM 5、根据权利要求3所述的方法，其中，所述关于色度信号的相移的信息包括水平方向 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) 上的相移信息和垂直方向上的相移信息。

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20090003441A1 Filed: 2007-10-30 Issued: 2009-01-01 Image encoding device, image decoding device, image encoding method and image decoding method (Original Assignee) Mitsubishi Electric Corp (Current Assignee) Mitsubishi Electric Corp Shunichi Sekiguchi, Shuichi Yamagishi, Yoshimi Moriya, Yoshihisa Yamada, Kohtaro Asai, Tokumichi Murakami, Yuichi Idehara
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region (decoding device) sizes , first and second subdivision information , and a maximum hierarchy (color component) level wherein the first maximum region (components a) size and the first subdivision (image generating unit) information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20090003441A1 CLAIM 1 . An image decoding device (second maximum region, second maximum region sizes) for receiving a bit stream obtained by compression-encoding a color moving image signal composed of a plurality of color component (maximum hierarchy, maximum hierarchy level, hierarchy level) s as an input and selectively applying one of intra decoding and motion compensation prediction decoding for each of the plurality of color components of the color moving image signal to decode the color moving image signal , comprising : a color component identifying unit for decoding a color component identification flag for identifying the color component to which the input bit stream belongs and determining the color component whose encoded information is contained in the bit stream ; a decoding unit for decoding information obtained by encoding a prediction mode indicating a predicted image generating method used for encoding each encoding unit area , corresponding prediction overhead information and a prediction error from the bit stream for each color component determined by the color component identifying unit according to a predetermined syntax for the encoding unit area ; a predicted image generating unit (first subdivision, first subdivision information) for generating a predicted image for a signal of the encoding unit area based on the decoded prediction mode and the corresponding prediction overhead information ; a prediction error decoding unit for decoding a prediction error signal based on the information obtained by encoding the prediction error ; and an adder unit for adding an output from the predicted image generating unit and an output from the prediction error decoding unit , wherein the decoding unit decodes a prediction information encoding indication flag indicating one of use of the prediction mode used for encoding and corresponding prediction overhead information in an area to be encoded of another color component constituting the same screen at the same image position and use of its own prediction mode and corresponding prediction overhead information for the color component to determine the prediction mode used in the predicted image generating unit and the corresponding prediction overhead information based on a value of the prediction information encoding indication flag .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set of root regions such that the first set of root regions are rectangular blocks of a size determined by the first maximum region (components a) size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	US20090003441A1 CLAIM 1 . An image decoding device for receiving a bit stream obtained by compression-encoding a color moving image signal composed of a plurality of color components a (first maximum region) s an input and selectively applying one of intra decoding and motion compensation prediction decoding for each of the plurality of color components of the color moving image signal to decode the color moving image signal , comprising : a color component identifying unit for decoding a color component identification flag for identifying the color component to which the input bit stream belongs and determining the color component whose encoded information is contained in the bit stream ; a decoding unit for decoding information obtained by encoding a prediction mode indicating a predicted image generating method used for encoding each encoding unit area , corresponding prediction overhead information and a prediction error from the bit stream for each color component determined by the color component identifying unit according to a predetermined syntax for the encoding unit area ; a predicted image generating unit for generating a predicted image for a signal of the encoding unit area based on the decoded prediction mode and the corresponding prediction overhead information ; a prediction error decoding unit for decoding a prediction error signal based on the information obtained by encoding the prediction error ; and an adder unit for adding an output from the predicted image generating unit and an output from the prediction error decoding unit , wherein the decoding unit decodes a prediction information encoding indication flag indicating one of use of the prediction mode used for encoding and corresponding prediction overhead information in an area to be encoded of another color component constituting the same screen at the same image position and use of its own prediction mode and corresponding prediction overhead information for the color component to determine the prediction mode used in the predicted image generating unit and the corresponding prediction overhead information based on a value of the prediction information encoding indication flag .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision (image generating unit) information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level (color component) according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy (color component) level is reached .	US20090003441A1 CLAIM 1 . An image decoding device for receiving a bit stream obtained by compression-encoding a color moving image signal composed of a plurality of color component (maximum hierarchy, maximum hierarchy level, hierarchy level) s as an input and selectively applying one of intra decoding and motion compensation prediction decoding for each of the plurality of color components of the color moving image signal to decode the color moving image signal , comprising : a color component identifying unit for decoding a color component identification flag for identifying the color component to which the input bit stream belongs and determining the color component whose encoded information is contained in the bit stream ; a decoding unit for decoding information obtained by encoding a prediction mode indicating a predicted image generating method used for encoding each encoding unit area , corresponding prediction overhead information and a prediction error from the bit stream for each color component determined by the color component identifying unit according to a predetermined syntax for the encoding unit area ; a predicted image generating unit (first subdivision, first subdivision information) for generating a predicted image for a signal of the encoding unit area based on the decoded prediction mode and the corresponding prediction overhead information ; a prediction error decoding unit for decoding a prediction error signal based on the information obtained by encoding the prediction error ; and an adder unit for adding an output from the predicted image generating unit and an output from the prediction error decoding unit , wherein the decoding unit decodes a prediction information encoding indication flag indicating one of use of the prediction mode used for encoding and corresponding prediction overhead information in an area to be encoded of another color component constituting the same screen at the same image position and use of its own prediction mode and corresponding prediction overhead information for the color component to determine the prediction mode used in the predicted image generating unit and the corresponding prediction overhead information based on a value of the prediction information encoding indication flag .
US10250913B2 CLAIM 5 . The decoder according to claim 4 , wherein the divider is configured to , in accordance with the partition rules associated with the first and higher-order hierarchy levels , sub-divide into sub-regions of equal size , such that there are an equal number of sub-regions at each hierarchy level (color component) .	US20090003441A1 CLAIM 1 . An image decoding device for receiving a bit stream obtained by compression-encoding a color moving image signal composed of a plurality of color component (maximum hierarchy, maximum hierarchy level, hierarchy level) s as an input and selectively applying one of intra decoding and motion compensation prediction decoding for each of the plurality of color components of the color moving image signal to decode the color moving image signal , comprising : a color component identifying unit for decoding a color component identification flag for identifying the color component to which the input bit stream belongs and determining the color component whose encoded information is contained in the bit stream ; a decoding unit for decoding information obtained by encoding a prediction mode indicating a predicted image generating method used for encoding each encoding unit area , corresponding prediction overhead information and a prediction error from the bit stream for each color component determined by the color component identifying unit according to a predetermined syntax for the encoding unit area ; a predicted image generating unit for generating a predicted image for a signal of the encoding unit area based on the decoded prediction mode and the corresponding prediction overhead information ; a prediction error decoding unit for decoding a prediction error signal based on the information obtained by encoding the prediction error ; and an adder unit for adding an output from the predicted image generating unit and an output from the prediction error decoding unit , wherein the decoding unit decodes a prediction information encoding indication flag indicating one of use of the prediction mode used for encoding and corresponding prediction overhead information in an area to be encoded of another color component constituting the same screen at the same image position and use of its own prediction mode and corresponding prediction overhead information for the color component to determine the prediction mode used in the predicted image generating unit and the corresponding prediction overhead information based on a value of the prediction information encoding indication flag .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision (image generating unit) information includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level (color component) is sub-divided .	US20090003441A1 CLAIM 1 . An image decoding device for receiving a bit stream obtained by compression-encoding a color moving image signal composed of a plurality of color component (maximum hierarchy, maximum hierarchy level, hierarchy level) s as an input and selectively applying one of intra decoding and motion compensation prediction decoding for each of the plurality of color components of the color moving image signal to decode the color moving image signal , comprising : a color component identifying unit for decoding a color component identification flag for identifying the color component to which the input bit stream belongs and determining the color component whose encoded information is contained in the bit stream ; a decoding unit for decoding information obtained by encoding a prediction mode indicating a predicted image generating method used for encoding each encoding unit area , corresponding prediction overhead information and a prediction error from the bit stream for each color component determined by the color component identifying unit according to a predetermined syntax for the encoding unit area ; a predicted image generating unit (first subdivision, first subdivision information) for generating a predicted image for a signal of the encoding unit area based on the decoded prediction mode and the corresponding prediction overhead information ; a prediction error decoding unit for decoding a prediction error signal based on the information obtained by encoding the prediction error ; and an adder unit for adding an output from the predicted image generating unit and an output from the prediction error decoding unit , wherein the decoding unit decodes a prediction information encoding indication flag indicating one of use of the prediction mode used for encoding and corresponding prediction overhead information in an area to be encoded of another color component constituting the same screen at the same image position and use of its own prediction mode and corresponding prediction overhead information for the color component to determine the prediction mode used in the predicted image generating unit and the corresponding prediction overhead information based on a value of the prediction information encoding indication flag .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy (color component) level from the data stream .	US20090003441A1 CLAIM 1 . An image decoding device for receiving a bit stream obtained by compression-encoding a color moving image signal composed of a plurality of color component (maximum hierarchy, maximum hierarchy level, hierarchy level) s as an input and selectively applying one of intra decoding and motion compensation prediction decoding for each of the plurality of color components of the color moving image signal to decode the color moving image signal , comprising : a color component identifying unit for decoding a color component identification flag for identifying the color component to which the input bit stream belongs and determining the color component whose encoded information is contained in the bit stream ; a decoding unit for decoding information obtained by encoding a prediction mode indicating a predicted image generating method used for encoding each encoding unit area , corresponding prediction overhead information and a prediction error from the bit stream for each color component determined by the color component identifying unit according to a predetermined syntax for the encoding unit area ; a predicted image generating unit for generating a predicted image for a signal of the encoding unit area based on the decoded prediction mode and the corresponding prediction overhead information ; a prediction error decoding unit for decoding a prediction error signal based on the information obtained by encoding the prediction error ; and an adder unit for adding an output from the predicted image generating unit and an output from the prediction error decoding unit , wherein the decoding unit decodes a prediction information encoding indication flag indicating one of use of the prediction mode used for encoding and corresponding prediction overhead information in an area to be encoded of another color component constituting the same screen at the same image position and use of its own prediction mode and corresponding prediction overhead information for the color component to determine the prediction mode used in the predicted image generating unit and the corresponding prediction overhead information based on a value of the prediction information encoding indication flag .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision (image generating unit) information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20090003441A1 CLAIM 1 . An image decoding device for receiving a bit stream obtained by compression-encoding a color moving image signal composed of a plurality of color components as an input and selectively applying one of intra decoding and motion compensation prediction decoding for each of the plurality of color components of the color moving image signal to decode the color moving image signal , comprising : a color component identifying unit for decoding a color component identification flag for identifying the color component to which the input bit stream belongs and determining the color component whose encoded information is contained in the bit stream ; a decoding unit for decoding information obtained by encoding a prediction mode indicating a predicted image generating method used for encoding each encoding unit area , corresponding prediction overhead information and a prediction error from the bit stream for each color component determined by the color component identifying unit according to a predetermined syntax for the encoding unit area ; a predicted image generating unit (first subdivision, first subdivision information) for generating a predicted image for a signal of the encoding unit area based on the decoded prediction mode and the corresponding prediction overhead information ; a prediction error decoding unit for decoding a prediction error signal based on the information obtained by encoding the prediction error ; and an adder unit for adding an output from the predicted image generating unit and an output from the prediction error decoding unit , wherein the decoding unit decodes a prediction information encoding indication flag indicating one of use of the prediction mode used for encoding and corresponding prediction overhead information in an area to be encoded of another color component constituting the same screen at the same image position and use of its own prediction mode and corresponding prediction overhead information for the color component to determine the prediction mode used in the predicted image generating unit and the corresponding prediction overhead information based on a value of the prediction information encoding indication flag .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region (decoding device) sizes , first and second subdivision information , and a maximum hierarchy (color component) level , wherein the first maximum region (components a) size and the first subdivision (image generating unit) information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20090003441A1 CLAIM 1 . An image decoding device (second maximum region, second maximum region sizes) for receiving a bit stream obtained by compression-encoding a color moving image signal composed of a plurality of color component (maximum hierarchy, maximum hierarchy level, hierarchy level) s as an input and selectively applying one of intra decoding and motion compensation prediction decoding for each of the plurality of color components of the color moving image signal to decode the color moving image signal , comprising : a color component identifying unit for decoding a color component identification flag for identifying the color component to which the input bit stream belongs and determining the color component whose encoded information is contained in the bit stream ; a decoding unit for decoding information obtained by encoding a prediction mode indicating a predicted image generating method used for encoding each encoding unit area , corresponding prediction overhead information and a prediction error from the bit stream for each color component determined by the color component identifying unit according to a predetermined syntax for the encoding unit area ; a predicted image generating unit (first subdivision, first subdivision information) for generating a predicted image for a signal of the encoding unit area based on the decoded prediction mode and the corresponding prediction overhead information ; a prediction error decoding unit for decoding a prediction error signal based on the information obtained by encoding the prediction error ; and an adder unit for adding an output from the predicted image generating unit and an output from the prediction error decoding unit , wherein the decoding unit decodes a prediction information encoding indication flag indicating one of use of the prediction mode used for encoding and corresponding prediction overhead information in an area to be encoded of another color component constituting the same screen at the same image position and use of its own prediction mode and corresponding prediction overhead information for the color component to determine the prediction mode used in the predicted image generating unit and the corresponding prediction overhead information based on a value of the prediction information encoding indication flag .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region (components a) size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision (image generating unit) information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region (decoding device) size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy (color component) level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20090003441A1 CLAIM 1 . An image decoding device (second maximum region, second maximum region sizes) for receiving a bit stream obtained by compression-encoding a color moving image signal composed of a plurality of color component (maximum hierarchy, maximum hierarchy level, hierarchy level) s as an input and selectively applying one of intra decoding and motion compensation prediction decoding for each of the plurality of color components of the color moving image signal to decode the color moving image signal , comprising : a color component identifying unit for decoding a color component identification flag for identifying the color component to which the input bit stream belongs and determining the color component whose encoded information is contained in the bit stream ; a decoding unit for decoding information obtained by encoding a prediction mode indicating a predicted image generating method used for encoding each encoding unit area , corresponding prediction overhead information and a prediction error from the bit stream for each color component determined by the color component identifying unit according to a predetermined syntax for the encoding unit area ; a predicted image generating unit (first subdivision, first subdivision information) for generating a predicted image for a signal of the encoding unit area based on the decoded prediction mode and the corresponding prediction overhead information ; a prediction error decoding unit for decoding a prediction error signal based on the information obtained by encoding the prediction error ; and an adder unit for adding an output from the predicted image generating unit and an output from the prediction error decoding unit , wherein the decoding unit decodes a prediction information encoding indication flag indicating one of use of the prediction mode used for encoding and corresponding prediction overhead information in an area to be encoded of another color component constituting the same screen at the same image position and use of its own prediction mode and corresponding prediction overhead information for the color component to determine the prediction mode used in the predicted image generating unit and the corresponding prediction overhead information based on a value of the prediction information encoding indication flag .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region (components a) size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision (image generating unit) information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region (decoding device) size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy (color component) level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20090003441A1 CLAIM 1 . An image decoding device (second maximum region, second maximum region sizes) for receiving a bit stream obtained by compression-encoding a color moving image signal composed of a plurality of color component (maximum hierarchy, maximum hierarchy level, hierarchy level) s as an input and selectively applying one of intra decoding and motion compensation prediction decoding for each of the plurality of color components of the color moving image signal to decode the color moving image signal , comprising : a color component identifying unit for decoding a color component identification flag for identifying the color component to which the input bit stream belongs and determining the color component whose encoded information is contained in the bit stream ; a decoding unit for decoding information obtained by encoding a prediction mode indicating a predicted image generating method used for encoding each encoding unit area , corresponding prediction overhead information and a prediction error from the bit stream for each color component determined by the color component identifying unit according to a predetermined syntax for the encoding unit area ; a predicted image generating unit (first subdivision, first subdivision information) for generating a predicted image for a signal of the encoding unit area based on the decoded prediction mode and the corresponding prediction overhead information ; a prediction error decoding unit for decoding a prediction error signal based on the information obtained by encoding the prediction error ; and an adder unit for adding an output from the predicted image generating unit and an output from the prediction error decoding unit , wherein the decoding unit decodes a prediction information encoding indication flag indicating one of use of the prediction mode used for encoding and corresponding prediction overhead information in an area to be encoded of another color component constituting the same screen at the same image position and use of its own prediction mode and corresponding prediction overhead information for the color component to determine the prediction mode used in the predicted image generating unit and the corresponding prediction overhead information based on a value of the prediction information encoding indication flag .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20090003448A1 Filed: 2007-10-30 Issued: 2009-01-01 Image encoding device, image decoding device, image encoding method and image decoding method (Original Assignee) Mitsubishi Electric Corp (Current Assignee) Mitsubishi Electric Corp Shunichi Sekiguchi, Shuichi Yamagishi, Yoshimi Moriya, Yoshihisa Yamada, Kohtaro Asai, Tokumichi Murakami, Yuichi Idehara
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region (decoding device) sizes , first and second subdivision information , and a maximum hierarchy (color component) level wherein the first maximum region (components a) size and the first subdivision (image generating unit) information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20090003448A1 CLAIM 1 . An image decoding device (second maximum region, second maximum region sizes) for receiving a bit stream obtained by compression-encoding a color moving image signal composed of a plurality of color component (maximum hierarchy, maximum hierarchy level, hierarchy level) s as an input and selectively applying one of intra decoding and motion compensation prediction decoding for each of the plurality of color components of the color moving image signal to decode the color moving image signal , comprising : a color component identifying unit for decoding a color component identification flag for identifying the color component to which the input bit stream belongs to determine the color component whose encoded information is contained in the bit stream ; a decoding unit for decoding , from the bit stream , encoded block size indication information for determining a size of a block corresponding to an encoding unit area of each color component signal for each color component determined by the color component identifying unit and determining the size of the block corresponding to the encoding unit area based on the encoded block size indication information to decode , from the bit stream , information obtained by encoding a prediction mode indicating a predicted image generating method used for encoding the encoding unit area and a prediction error , according to a predetermined syntax , for each encoding unit area ; a predicted image generating unit (first subdivision, first subdivision information) for generating a predicted image for a signal of the encoding unit area based on the encoded block size indication information and the prediction mode ; a prediction error decoding unit for decoding a prediction error signal based on the information obtained by encoding the prediction error ; and an adder unit for adding an output from the predicted image generating unit and an output from the prediction error decoding unit .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set of root regions such that the first set of root regions are rectangular blocks of a size determined by the first maximum region (components a) size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	US20090003448A1 CLAIM 1 . An image decoding device for receiving a bit stream obtained by compression-encoding a color moving image signal composed of a plurality of color components a (first maximum region) s an input and selectively applying one of intra decoding and motion compensation prediction decoding for each of the plurality of color components of the color moving image signal to decode the color moving image signal , comprising : a color component identifying unit for decoding a color component identification flag for identifying the color component to which the input bit stream belongs to determine the color component whose encoded information is contained in the bit stream ; a decoding unit for decoding , from the bit stream , encoded block size indication information for determining a size of a block corresponding to an encoding unit area of each color component signal for each color component determined by the color component identifying unit and determining the size of the block corresponding to the encoding unit area based on the encoded block size indication information to decode , from the bit stream , information obtained by encoding a prediction mode indicating a predicted image generating method used for encoding the encoding unit area and a prediction error , according to a predetermined syntax , for each encoding unit area ; a predicted image generating unit for generating a predicted image for a signal of the encoding unit area based on the encoded block size indication information and the prediction mode ; a prediction error decoding unit for decoding a prediction error signal based on the information obtained by encoding the prediction error ; and an adder unit for adding an output from the predicted image generating unit and an output from the prediction error decoding unit .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision (image generating unit) information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level (color component) according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy (color component) level is reached .	US20090003448A1 CLAIM 1 . An image decoding device for receiving a bit stream obtained by compression-encoding a color moving image signal composed of a plurality of color component (maximum hierarchy, maximum hierarchy level, hierarchy level) s as an input and selectively applying one of intra decoding and motion compensation prediction decoding for each of the plurality of color components of the color moving image signal to decode the color moving image signal , comprising : a color component identifying unit for decoding a color component identification flag for identifying the color component to which the input bit stream belongs to determine the color component whose encoded information is contained in the bit stream ; a decoding unit for decoding , from the bit stream , encoded block size indication information for determining a size of a block corresponding to an encoding unit area of each color component signal for each color component determined by the color component identifying unit and determining the size of the block corresponding to the encoding unit area based on the encoded block size indication information to decode , from the bit stream , information obtained by encoding a prediction mode indicating a predicted image generating method used for encoding the encoding unit area and a prediction error , according to a predetermined syntax , for each encoding unit area ; a predicted image generating unit (first subdivision, first subdivision information) for generating a predicted image for a signal of the encoding unit area based on the encoded block size indication information and the prediction mode ; a prediction error decoding unit for decoding a prediction error signal based on the information obtained by encoding the prediction error ; and an adder unit for adding an output from the predicted image generating unit and an output from the prediction error decoding unit .
US10250913B2 CLAIM 5 . The decoder according to claim 4 , wherein the divider is configured to , in accordance with the partition rules associated with the first and higher-order hierarchy levels , sub-divide into sub-regions of equal size , such that there are an equal number of sub-regions at each hierarchy level (color component) .	US20090003448A1 CLAIM 1 . An image decoding device for receiving a bit stream obtained by compression-encoding a color moving image signal composed of a plurality of color component (maximum hierarchy, maximum hierarchy level, hierarchy level) s as an input and selectively applying one of intra decoding and motion compensation prediction decoding for each of the plurality of color components of the color moving image signal to decode the color moving image signal , comprising : a color component identifying unit for decoding a color component identification flag for identifying the color component to which the input bit stream belongs to determine the color component whose encoded information is contained in the bit stream ; a decoding unit for decoding , from the bit stream , encoded block size indication information for determining a size of a block corresponding to an encoding unit area of each color component signal for each color component determined by the color component identifying unit and determining the size of the block corresponding to the encoding unit area based on the encoded block size indication information to decode , from the bit stream , information obtained by encoding a prediction mode indicating a predicted image generating method used for encoding the encoding unit area and a prediction error , according to a predetermined syntax , for each encoding unit area ; a predicted image generating unit for generating a predicted image for a signal of the encoding unit area based on the encoded block size indication information and the prediction mode ; a prediction error decoding unit for decoding a prediction error signal based on the information obtained by encoding the prediction error ; and an adder unit for adding an output from the predicted image generating unit and an output from the prediction error decoding unit .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision (image generating unit) information includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level (color component) is sub-divided .	US20090003448A1 CLAIM 1 . An image decoding device for receiving a bit stream obtained by compression-encoding a color moving image signal composed of a plurality of color component (maximum hierarchy, maximum hierarchy level, hierarchy level) s as an input and selectively applying one of intra decoding and motion compensation prediction decoding for each of the plurality of color components of the color moving image signal to decode the color moving image signal , comprising : a color component identifying unit for decoding a color component identification flag for identifying the color component to which the input bit stream belongs to determine the color component whose encoded information is contained in the bit stream ; a decoding unit for decoding , from the bit stream , encoded block size indication information for determining a size of a block corresponding to an encoding unit area of each color component signal for each color component determined by the color component identifying unit and determining the size of the block corresponding to the encoding unit area based on the encoded block size indication information to decode , from the bit stream , information obtained by encoding a prediction mode indicating a predicted image generating method used for encoding the encoding unit area and a prediction error , according to a predetermined syntax , for each encoding unit area ; a predicted image generating unit (first subdivision, first subdivision information) for generating a predicted image for a signal of the encoding unit area based on the encoded block size indication information and the prediction mode ; a prediction error decoding unit for decoding a prediction error signal based on the information obtained by encoding the prediction error ; and an adder unit for adding an output from the predicted image generating unit and an output from the prediction error decoding unit .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy (color component) level from the data stream .	US20090003448A1 CLAIM 1 . An image decoding device for receiving a bit stream obtained by compression-encoding a color moving image signal composed of a plurality of color component (maximum hierarchy, maximum hierarchy level, hierarchy level) s as an input and selectively applying one of intra decoding and motion compensation prediction decoding for each of the plurality of color components of the color moving image signal to decode the color moving image signal , comprising : a color component identifying unit for decoding a color component identification flag for identifying the color component to which the input bit stream belongs to determine the color component whose encoded information is contained in the bit stream ; a decoding unit for decoding , from the bit stream , encoded block size indication information for determining a size of a block corresponding to an encoding unit area of each color component signal for each color component determined by the color component identifying unit and determining the size of the block corresponding to the encoding unit area based on the encoded block size indication information to decode , from the bit stream , information obtained by encoding a prediction mode indicating a predicted image generating method used for encoding the encoding unit area and a prediction error , according to a predetermined syntax , for each encoding unit area ; a predicted image generating unit for generating a predicted image for a signal of the encoding unit area based on the encoded block size indication information and the prediction mode ; a prediction error decoding unit for decoding a prediction error signal based on the information obtained by encoding the prediction error ; and an adder unit for adding an output from the predicted image generating unit and an output from the prediction error decoding unit .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision (image generating unit) information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20090003448A1 CLAIM 1 . An image decoding device for receiving a bit stream obtained by compression-encoding a color moving image signal composed of a plurality of color components as an input and selectively applying one of intra decoding and motion compensation prediction decoding for each of the plurality of color components of the color moving image signal to decode the color moving image signal , comprising : a color component identifying unit for decoding a color component identification flag for identifying the color component to which the input bit stream belongs to determine the color component whose encoded information is contained in the bit stream ; a decoding unit for decoding , from the bit stream , encoded block size indication information for determining a size of a block corresponding to an encoding unit area of each color component signal for each color component determined by the color component identifying unit and determining the size of the block corresponding to the encoding unit area based on the encoded block size indication information to decode , from the bit stream , information obtained by encoding a prediction mode indicating a predicted image generating method used for encoding the encoding unit area and a prediction error , according to a predetermined syntax , for each encoding unit area ; a predicted image generating unit (first subdivision, first subdivision information) for generating a predicted image for a signal of the encoding unit area based on the encoded block size indication information and the prediction mode ; a prediction error decoding unit for decoding a prediction error signal based on the information obtained by encoding the prediction error ; and an adder unit for adding an output from the predicted image generating unit and an output from the prediction error decoding unit .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region (decoding device) sizes , first and second subdivision information , and a maximum hierarchy (color component) level , wherein the first maximum region (components a) size and the first subdivision (image generating unit) information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20090003448A1 CLAIM 1 . An image decoding device (second maximum region, second maximum region sizes) for receiving a bit stream obtained by compression-encoding a color moving image signal composed of a plurality of color component (maximum hierarchy, maximum hierarchy level, hierarchy level) s as an input and selectively applying one of intra decoding and motion compensation prediction decoding for each of the plurality of color components of the color moving image signal to decode the color moving image signal , comprising : a color component identifying unit for decoding a color component identification flag for identifying the color component to which the input bit stream belongs to determine the color component whose encoded information is contained in the bit stream ; a decoding unit for decoding , from the bit stream , encoded block size indication information for determining a size of a block corresponding to an encoding unit area of each color component signal for each color component determined by the color component identifying unit and determining the size of the block corresponding to the encoding unit area based on the encoded block size indication information to decode , from the bit stream , information obtained by encoding a prediction mode indicating a predicted image generating method used for encoding the encoding unit area and a prediction error , according to a predetermined syntax , for each encoding unit area ; a predicted image generating unit (first subdivision, first subdivision information) for generating a predicted image for a signal of the encoding unit area based on the encoded block size indication information and the prediction mode ; a prediction error decoding unit for decoding a prediction error signal based on the information obtained by encoding the prediction error ; and an adder unit for adding an output from the predicted image generating unit and an output from the prediction error decoding unit .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region (components a) size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision (image generating unit) information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region (decoding device) size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy (color component) level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20090003448A1 CLAIM 1 . An image decoding device (second maximum region, second maximum region sizes) for receiving a bit stream obtained by compression-encoding a color moving image signal composed of a plurality of color component (maximum hierarchy, maximum hierarchy level, hierarchy level) s as an input and selectively applying one of intra decoding and motion compensation prediction decoding for each of the plurality of color components of the color moving image signal to decode the color moving image signal , comprising : a color component identifying unit for decoding a color component identification flag for identifying the color component to which the input bit stream belongs to determine the color component whose encoded information is contained in the bit stream ; a decoding unit for decoding , from the bit stream , encoded block size indication information for determining a size of a block corresponding to an encoding unit area of each color component signal for each color component determined by the color component identifying unit and determining the size of the block corresponding to the encoding unit area based on the encoded block size indication information to decode , from the bit stream , information obtained by encoding a prediction mode indicating a predicted image generating method used for encoding the encoding unit area and a prediction error , according to a predetermined syntax , for each encoding unit area ; a predicted image generating unit (first subdivision, first subdivision information) for generating a predicted image for a signal of the encoding unit area based on the encoded block size indication information and the prediction mode ; a prediction error decoding unit for decoding a prediction error signal based on the information obtained by encoding the prediction error ; and an adder unit for adding an output from the predicted image generating unit and an output from the prediction error decoding unit .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region (components a) size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision (image generating unit) information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region (decoding device) size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy (color component) level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20090003448A1 CLAIM 1 . An image decoding device (second maximum region, second maximum region sizes) for receiving a bit stream obtained by compression-encoding a color moving image signal composed of a plurality of color component (maximum hierarchy, maximum hierarchy level, hierarchy level) s as an input and selectively applying one of intra decoding and motion compensation prediction decoding for each of the plurality of color components of the color moving image signal to decode the color moving image signal , comprising : a color component identifying unit for decoding a color component identification flag for identifying the color component to which the input bit stream belongs to determine the color component whose encoded information is contained in the bit stream ; a decoding unit for decoding , from the bit stream , encoded block size indication information for determining a size of a block corresponding to an encoding unit area of each color component signal for each color component determined by the color component identifying unit and determining the size of the block corresponding to the encoding unit area based on the encoded block size indication information to decode , from the bit stream , information obtained by encoding a prediction mode indicating a predicted image generating method used for encoding the encoding unit area and a prediction error , according to a predetermined syntax , for each encoding unit area ; a predicted image generating unit (first subdivision, first subdivision information) for generating a predicted image for a signal of the encoding unit area based on the encoded block size indication information and the prediction mode ; a prediction error decoding unit for decoding a prediction error signal based on the information obtained by encoding the prediction error ; and an adder unit for adding an output from the predicted image generating unit and an output from the prediction error decoding unit .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20080095238A1 Filed: 2007-10-18 Issued: 2008-04-24 Scalable video coding with filtering of lower layers (Original Assignee) Apple Inc (Current Assignee) Apple Inc Hsi-Jung Wu, Barin Geoffry Haskell, Xiaojin Shi
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream (order r) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (determined size) information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding (deblocking filtering) ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20080095238A1 CLAIM 1 . A method of predicting motion vectors in a multi-layer video decoding process , comprising : determining a size difference between recovered video data obtained solely by a base layer decode process and recovered video data obtained from an enhancement layer decode process ; scaling a base layer pixelblock partition map according to the determined size (second subdivision, second subset, second subdivision information) difference ; predicting a motion vector of an enhancement layer pixelblock according to : determining which base layer pixelblock(s) , when scaled according to the size difference , are co-located with the enhancement layer pixelblock , scaling motion vectors of the co-located base layer pixelblock(s) according to the size difference , and averaging the scaled motion vectors of the co-located base layer pixelblock(s) , wherein the averaging weight contribution of each scaled motion vector according to a degree of overlap between the enhancement layer pixelblock and the respective scaled base layer pixelblock . US20080095238A1 CLAIM 12 . The method of claim 11 , wherein an amount of data to be taken as a border r (data stream, data stream generator) egion is determined from a type of filtering to be applied . US20080095238A1 CLAIM 13 . The method of claim 11 , wherein the filtering is deblocking filtering (transform coding) .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level from the data stream (order r) .	US20080095238A1 CLAIM 12 . The method of claim 11 , wherein an amount of data to be taken as a border r (data stream, data stream generator) egion is determined from a type of filtering to be applied .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements associated with the first or second set of sub-regions from the data stream (order r) in a depth-first traversal order .	US20080095238A1 CLAIM 12 . The method of claim 11 , wherein an amount of data to be taken as a border r (data stream, data stream generator) egion is determined from a type of filtering to be applied .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream (order r) , disjoint from a second subset (determined size) of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20080095238A1 CLAIM 1 . A method of predicting motion vectors in a multi-layer video decoding process , comprising : determining a size difference between recovered video data obtained solely by a base layer decode process and recovered video data obtained from an enhancement layer decode process ; scaling a base layer pixelblock partition map according to the determined size (second subdivision, second subset, second subdivision information) difference ; predicting a motion vector of an enhancement layer pixelblock according to : determining which base layer pixelblock(s) , when scaled according to the size difference , are co-located with the enhancement layer pixelblock , scaling motion vectors of the co-located base layer pixelblock(s) according to the size difference , and averaging the scaled motion vectors of the co-located base layer pixelblock(s) , wherein the averaging weight contribution of each scaled motion vector according to a degree of overlap between the enhancement layer pixelblock and the respective scaled base layer pixelblock . US20080095238A1 CLAIM 12 . The method of claim 11 , wherein an amount of data to be taken as a border r (data stream, data stream generator) egion is determined from a type of filtering to be applied .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream (order r) , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding (deblocking filtering) to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	US20080095238A1 CLAIM 12 . The method of claim 11 , wherein an amount of data to be taken as a border r (data stream, data stream generator) egion is determined from a type of filtering to be applied . US20080095238A1 CLAIM 13 . The method of claim 11 , wherein the filtering is deblocking filtering (transform coding) .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream (order r) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (determined size) information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding (deblocking filtering) ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20080095238A1 CLAIM 1 . A method of predicting motion vectors in a multi-layer video decoding process , comprising : determining a size difference between recovered video data obtained solely by a base layer decode process and recovered video data obtained from an enhancement layer decode process ; scaling a base layer pixelblock partition map according to the determined size (second subdivision, second subset, second subdivision information) difference ; predicting a motion vector of an enhancement layer pixelblock according to : determining which base layer pixelblock(s) , when scaled according to the size difference , are co-located with the enhancement layer pixelblock , scaling motion vectors of the co-located base layer pixelblock(s) according to the size difference , and averaging the scaled motion vectors of the co-located base layer pixelblock(s) , wherein the averaging weight contribution of each scaled motion vector according to a degree of overlap between the enhancement layer pixelblock and the respective scaled base layer pixelblock . US20080095238A1 CLAIM 12 . The method of claim 11 , wherein an amount of data to be taken as a border r (data stream, data stream generator) egion is determined from a type of filtering to be applied . US20080095238A1 CLAIM 13 . The method of claim 11 , wherein the filtering is deblocking filtering (transform coding) .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (determined size) information and a maximum hierarchy level ; and a data stream (order r) generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding (deblocking filtering) in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20080095238A1 CLAIM 1 . A method of predicting motion vectors in a multi-layer video decoding process , comprising : determining a size difference between recovered video data obtained solely by a base layer decode process and recovered video data obtained from an enhancement layer decode process ; scaling a base layer pixelblock partition map according to the determined size (second subdivision, second subset, second subdivision information) difference ; predicting a motion vector of an enhancement layer pixelblock according to : determining which base layer pixelblock(s) , when scaled according to the size difference , are co-located with the enhancement layer pixelblock , scaling motion vectors of the co-located base layer pixelblock(s) according to the size difference , and averaging the scaled motion vectors of the co-located base layer pixelblock(s) , wherein the averaging weight contribution of each scaled motion vector according to a degree of overlap between the enhancement layer pixelblock and the respective scaled base layer pixelblock . US20080095238A1 CLAIM 12 . The method of claim 11 , wherein an amount of data to be taken as a border r (data stream, data stream generator) egion is determined from a type of filtering to be applied . US20080095238A1 CLAIM 13 . The method of claim 11 , wherein the filtering is deblocking filtering (transform coding) .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (determined size) information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding (deblocking filtering) in accordance with the second set of sub-regions ; and inserting into a data stream (order r) the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20080095238A1 CLAIM 1 . A method of predicting motion vectors in a multi-layer video decoding process , comprising : determining a size difference between recovered video data obtained solely by a base layer decode process and recovered video data obtained from an enhancement layer decode process ; scaling a base layer pixelblock partition map according to the determined size (second subdivision, second subset, second subdivision information) difference ; predicting a motion vector of an enhancement layer pixelblock according to : determining which base layer pixelblock(s) , when scaled according to the size difference , are co-located with the enhancement layer pixelblock , scaling motion vectors of the co-located base layer pixelblock(s) according to the size difference , and averaging the scaled motion vectors of the co-located base layer pixelblock(s) , wherein the averaging weight contribution of each scaled motion vector according to a degree of overlap between the enhancement layer pixelblock and the respective scaled base layer pixelblock . US20080095238A1 CLAIM 12 . The method of claim 11 , wherein an amount of data to be taken as a border r (data stream, data stream generator) egion is determined from a type of filtering to be applied . US20080095238A1 CLAIM 13 . The method of claim 11 , wherein the filtering is deblocking filtering (transform coding) .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20080089417A1 Filed: 2007-10-09 Issued: 2008-04-17 Video coding with adaptive filtering for motion compensated prediction (Original Assignee) Qualcomm Inc (Current Assignee) Qualcomm Inc Yiliang Bao, Yan Ye
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region (first filter) sizes , first and second subdivision (fractional pixel, video block, frame basis, video frame) information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision (fractional pixel, video block, frame basis, video frame) information are associated with prediction coding (fractional pixel, video block, frame basis, video frame) and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding (fractional pixel, video block, frame basis, video frame) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20080089417A1 CLAIM 1 . A method comprising : applying motion compensation to blocks within a video frame (information samples using prediction coding, second subdivision, second subdivision information, prediction coding, prediction signal, first subdivision) to generate prediction video block (information samples using prediction coding, second subdivision, second subdivision information, prediction coding, prediction signal, first subdivision) s ; and adaptively adjusting the motion compensation to apply either a first filter (second maximum region) mode or a second filter mode to each of the blocks based on a filter mode decision . US20080089417A1 CLAIM 9 . The method of claim 7 , wherein the interpolation filter includes a 2-tap filter , the method further comprising , in the second filter mode : applying the 3-tap filter in the horizontal dimension and applying the 2-tap filter in the vertical dimension when a motion vector points to an integer pixel location in the horizontal dimension and to a fractional pixel (information samples using prediction coding, second subdivision, second subdivision information, prediction coding, prediction signal, first subdivision) location in the vertical dimension ; and applying the 3-tap filter in the vertical dimension and applying the 2-tap filter in the horizontal dimension when a motion vector points to an integer pixel location in the vertical dimension and to a fractional pixel location in the horizontal dimension . US20080089417A1 CLAIM 10 . The method of claim 1 , further comprising adaptively adjusting the motion compensation on one of a block-by-block , macroblock-by-macroblock , slice-by-slice , or frame-by-frame basis (information samples using prediction coding, second subdivision, second subdivision information, prediction coding, prediction signal, first subdivision) .
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal (fractional pixel, video block, frame basis, video frame) based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset of the second set of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	US20080089417A1 CLAIM 1 . A method comprising : applying motion compensation to blocks within a video frame (information samples using prediction coding, second subdivision, second subdivision information, prediction coding, prediction signal, first subdivision) to generate prediction video block (information samples using prediction coding, second subdivision, second subdivision information, prediction coding, prediction signal, first subdivision) s ; and adaptively adjusting the motion compensation to apply either a first filter mode or a second filter mode to each of the blocks based on a filter mode decision . US20080089417A1 CLAIM 9 . The method of claim 7 , wherein the interpolation filter includes a 2-tap filter , the method further comprising , in the second filter mode : applying the 3-tap filter in the horizontal dimension and applying the 2-tap filter in the vertical dimension when a motion vector points to an integer pixel location in the horizontal dimension and to a fractional pixel (information samples using prediction coding, second subdivision, second subdivision information, prediction coding, prediction signal, first subdivision) location in the vertical dimension ; and applying the 3-tap filter in the vertical dimension and applying the 2-tap filter in the horizontal dimension when a motion vector points to an integer pixel location in the vertical dimension and to a fractional pixel location in the horizontal dimension . US20080089417A1 CLAIM 10 . The method of claim 1 , further comprising adaptively adjusting the motion compensation on one of a block-by-block , macroblock-by-macroblock , slice-by-slice , or frame-by-frame basis (information samples using prediction coding, second subdivision, second subdivision information, prediction coding, prediction signal, first subdivision) .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision (fractional pixel, video block, frame basis, video frame) information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20080089417A1 CLAIM 1 . A method comprising : applying motion compensation to blocks within a video frame (information samples using prediction coding, second subdivision, second subdivision information, prediction coding, prediction signal, first subdivision) to generate prediction video block (information samples using prediction coding, second subdivision, second subdivision information, prediction coding, prediction signal, first subdivision) s ; and adaptively adjusting the motion compensation to apply either a first filter mode or a second filter mode to each of the blocks based on a filter mode decision . US20080089417A1 CLAIM 9 . The method of claim 7 , wherein the interpolation filter includes a 2-tap filter , the method further comprising , in the second filter mode : applying the 3-tap filter in the horizontal dimension and applying the 2-tap filter in the vertical dimension when a motion vector points to an integer pixel location in the horizontal dimension and to a fractional pixel (information samples using prediction coding, second subdivision, second subdivision information, prediction coding, prediction signal, first subdivision) location in the vertical dimension ; and applying the 3-tap filter in the vertical dimension and applying the 2-tap filter in the horizontal dimension when a motion vector points to an integer pixel location in the vertical dimension and to a fractional pixel location in the horizontal dimension . US20080089417A1 CLAIM 10 . The method of claim 1 , further comprising adaptively adjusting the motion compensation on one of a block-by-block , macroblock-by-macroblock , slice-by-slice , or frame-by-frame basis (information samples using prediction coding, second subdivision, second subdivision information, prediction coding, prediction signal, first subdivision) .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision (fractional pixel, video block, frame basis, video frame) information includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level is sub-divided .	US20080089417A1 CLAIM 1 . A method comprising : applying motion compensation to blocks within a video frame (information samples using prediction coding, second subdivision, second subdivision information, prediction coding, prediction signal, first subdivision) to generate prediction video block (information samples using prediction coding, second subdivision, second subdivision information, prediction coding, prediction signal, first subdivision) s ; and adaptively adjusting the motion compensation to apply either a first filter mode or a second filter mode to each of the blocks based on a filter mode decision . US20080089417A1 CLAIM 9 . The method of claim 7 , wherein the interpolation filter includes a 2-tap filter , the method further comprising , in the second filter mode : applying the 3-tap filter in the horizontal dimension and applying the 2-tap filter in the vertical dimension when a motion vector points to an integer pixel location in the horizontal dimension and to a fractional pixel (information samples using prediction coding, second subdivision, second subdivision information, prediction coding, prediction signal, first subdivision) location in the vertical dimension ; and applying the 3-tap filter in the vertical dimension and applying the 2-tap filter in the horizontal dimension when a motion vector points to an integer pixel location in the vertical dimension and to a fractional pixel location in the horizontal dimension . US20080089417A1 CLAIM 10 . The method of claim 1 , further comprising adaptively adjusting the motion compensation on one of a block-by-block , macroblock-by-macroblock , slice-by-slice , or frame-by-frame basis (information samples using prediction coding, second subdivision, second subdivision information, prediction coding, prediction signal, first subdivision) .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements (video coding) associated with the first or second set of sub-regions from the data stream in a depth-first traversal order .	US20080089417A1 CLAIM 4 . The method of claim 1 , wherein the blocks comprise blocks in an enhancement layer of a scalable video coding (syntax elements) frame .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements (video coding) of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision (fractional pixel, video block, frame basis, video frame) information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20080089417A1 CLAIM 1 . A method comprising : applying motion compensation to blocks within a video frame (information samples using prediction coding, second subdivision, second subdivision information, prediction coding, prediction signal, first subdivision) to generate prediction video block (information samples using prediction coding, second subdivision, second subdivision information, prediction coding, prediction signal, first subdivision) s ; and adaptively adjusting the motion compensation to apply either a first filter mode or a second filter mode to each of the blocks based on a filter mode decision . US20080089417A1 CLAIM 4 . The method of claim 1 , wherein the blocks comprise blocks in an enhancement layer of a scalable video coding (syntax elements) frame . US20080089417A1 CLAIM 9 . The method of claim 7 , wherein the interpolation filter includes a 2-tap filter , the method further comprising , in the second filter mode : applying the 3-tap filter in the horizontal dimension and applying the 2-tap filter in the vertical dimension when a motion vector points to an integer pixel location in the horizontal dimension and to a fractional pixel (information samples using prediction coding, second subdivision, second subdivision information, prediction coding, prediction signal, first subdivision) location in the vertical dimension ; and applying the 3-tap filter in the vertical dimension and applying the 2-tap filter in the horizontal dimension when a motion vector points to an integer pixel location in the vertical dimension and to a fractional pixel location in the horizontal dimension . US20080089417A1 CLAIM 10 . The method of claim 1 , further comprising adaptively adjusting the motion compensation on one of a block-by-block , macroblock-by-macroblock , slice-by-slice , or frame-by-frame basis (information samples using prediction coding, second subdivision, second subdivision information, prediction coding, prediction signal, first subdivision) .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region (first filter) sizes , first and second subdivision (fractional pixel, video block, frame basis, video frame) information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision (fractional pixel, video block, frame basis, video frame) information are associated with prediction coding (fractional pixel, video block, frame basis, video frame) and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding (fractional pixel, video block, frame basis, video frame) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20080089417A1 CLAIM 1 . A method comprising : applying motion compensation to blocks within a video frame (information samples using prediction coding, second subdivision, second subdivision information, prediction coding, prediction signal, first subdivision) to generate prediction video block (information samples using prediction coding, second subdivision, second subdivision information, prediction coding, prediction signal, first subdivision) s ; and adaptively adjusting the motion compensation to apply either a first filter (second maximum region) mode or a second filter mode to each of the blocks based on a filter mode decision . US20080089417A1 CLAIM 9 . The method of claim 7 , wherein the interpolation filter includes a 2-tap filter , the method further comprising , in the second filter mode : applying the 3-tap filter in the horizontal dimension and applying the 2-tap filter in the vertical dimension when a motion vector points to an integer pixel location in the horizontal dimension and to a fractional pixel (information samples using prediction coding, second subdivision, second subdivision information, prediction coding, prediction signal, first subdivision) location in the vertical dimension ; and applying the 3-tap filter in the vertical dimension and applying the 2-tap filter in the horizontal dimension when a motion vector points to an integer pixel location in the vertical dimension and to a fractional pixel location in the horizontal dimension . US20080089417A1 CLAIM 10 . The method of claim 1 , further comprising adaptively adjusting the motion compensation on one of a block-by-block , macroblock-by-macroblock , slice-by-slice , or frame-by-frame basis (information samples using prediction coding, second subdivision, second subdivision information, prediction coding, prediction signal, first subdivision) .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision (fractional pixel, video block, frame basis, video frame) information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region (first filter) size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (fractional pixel, video block, frame basis, video frame) information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding (fractional pixel, video block, frame basis, video frame) (fractional pixel, video block, frame basis, video frame) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20080089417A1 CLAIM 1 . A method comprising : applying motion compensation to blocks within a video frame (information samples using prediction coding, second subdivision, second subdivision information, prediction coding, prediction signal, first subdivision) to generate prediction video block (information samples using prediction coding, second subdivision, second subdivision information, prediction coding, prediction signal, first subdivision) s ; and adaptively adjusting the motion compensation to apply either a first filter (second maximum region) mode or a second filter mode to each of the blocks based on a filter mode decision . US20080089417A1 CLAIM 9 . The method of claim 7 , wherein the interpolation filter includes a 2-tap filter , the method further comprising , in the second filter mode : applying the 3-tap filter in the horizontal dimension and applying the 2-tap filter in the vertical dimension when a motion vector points to an integer pixel location in the horizontal dimension and to a fractional pixel (information samples using prediction coding, second subdivision, second subdivision information, prediction coding, prediction signal, first subdivision) location in the vertical dimension ; and applying the 3-tap filter in the vertical dimension and applying the 2-tap filter in the horizontal dimension when a motion vector points to an integer pixel location in the vertical dimension and to a fractional pixel location in the horizontal dimension . US20080089417A1 CLAIM 10 . The method of claim 1 , further comprising adaptively adjusting the motion compensation on one of a block-by-block , macroblock-by-macroblock , slice-by-slice , or frame-by-frame basis (information samples using prediction coding, second subdivision, second subdivision information, prediction coding, prediction signal, first subdivision) .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision (fractional pixel, video block, frame basis, video frame) information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region (first filter) size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (fractional pixel, video block, frame basis, video frame) information and a maximum hierarchy level ; encoding the array of information samples using prediction coding (fractional pixel, video block, frame basis, video frame) (fractional pixel, video block, frame basis, video frame) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20080089417A1 CLAIM 1 . A method comprising : applying motion compensation to blocks within a video frame (information samples using prediction coding, second subdivision, second subdivision information, prediction coding, prediction signal, first subdivision) to generate prediction video block (information samples using prediction coding, second subdivision, second subdivision information, prediction coding, prediction signal, first subdivision) s ; and adaptively adjusting the motion compensation to apply either a first filter (second maximum region) mode or a second filter mode to each of the blocks based on a filter mode decision . US20080089417A1 CLAIM 9 . The method of claim 7 , wherein the interpolation filter includes a 2-tap filter , the method further comprising , in the second filter mode : applying the 3-tap filter in the horizontal dimension and applying the 2-tap filter in the vertical dimension when a motion vector points to an integer pixel location in the horizontal dimension and to a fractional pixel (information samples using prediction coding, second subdivision, second subdivision information, prediction coding, prediction signal, first subdivision) location in the vertical dimension ; and applying the 3-tap filter in the vertical dimension and applying the 2-tap filter in the horizontal dimension when a motion vector points to an integer pixel location in the vertical dimension and to a fractional pixel location in the horizontal dimension . US20080089417A1 CLAIM 10 . The method of claim 1 , further comprising adaptively adjusting the motion compensation on one of a block-by-block , macroblock-by-macroblock , slice-by-slice , or frame-by-frame basis (information samples using prediction coding, second subdivision, second subdivision information, prediction coding, prediction signal, first subdivision) .
US10250913B2 CLAIM 15 . A non-transitory computer readable digital storage medium having stored thereon a computer program (computer program) having a program code for performing , when running on a computer , a method according to claim 12 .	US20080089417A1 CLAIM 24 . A computer program (computer program) product comprising a computer-readable medium comprising instructions to cause a processor to : apply motion compensation to blocks within a video frame to generate prediction video blocks ; and adaptively adjust the motion compensation to apply either a first filter mode or a second filter mode to each of the blocks based on a filter mode decision .
US10250913B2 CLAIM 16 . A non-transitory computer readable digital storage medium having stored thereon a computer program (computer program) having a program code for performing , when running on a computer , a method according to claim 14 .	US20080089417A1 CLAIM 24 . A computer program (computer program) product comprising a computer-readable medium comprising instructions to cause a processor to : apply motion compensation to blocks within a video frame to generate prediction video blocks ; and adaptively adjust the motion compensation to apply either a first filter mode or a second filter mode to each of the blocks based on a filter mode decision .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	WO2009041843A1 Filed: 2007-09-28 Issued: 2009-04-02 Method of encoding digital signals (variants), method of decoding digital signals (variants), device for implementation thereof (variants), and system for image transmission via limited throughput communication channels (variants) (Original Assignee) Vsevolod Yurievich Mokrushin Vsevolod Yurievich Mokrushin
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region (decoding device) sizes , first and second subdivision information , and a maximum hierarchy level (d line) wherein the first maximum region size (d line) and the first subdivision information are associated with prediction coding (receiving input) and the second maximum region size and the second subdivision information are associated with transform coding (inverse transformation) ; a divider configured to : divide an array of information samples (inverse transformation) representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	WO2009041843A1 CLAIM 13 . Method according to Claim 1 , characterized in that the process of encoding a one-dimensional data array is carried out through discrete cosine transform and line (respective partition, maximum hierarchy level, first maximum region size) ar and/or non-linear adaptive quantization , with subsequent encoding of data obtained after quantization , together with quantization parameters , through a method of encoding with variable-length codes . WO2009041843A1 CLAIM 69 . Device for implementation of the method for decoding digital signals according to Claim 23 , which contains a unit of receiving input (prediction coding) encoded data and demultiplexing , a unit of lossless decompression and decoding of information on location of subsamples , a unit of decoding a one-dimensional array of subsamples encoded by means of a lossy compression algorithm , a unit of restoration of transmitted data sections , a unit of restoration of missed sections , for which there are similar restored sections on the pyramid levels with a higher spatial resolution , a unit of final filtration and interpolation , a unit of storing and output of hierarchical pyramid , a storage of a set of predetermined resampling patterns ; where the unit of receiving input encoded data and demultiplexing is connected to the unit of lossless decompression and decoding of information on location of subsamples , and to the unit of restoration of a one-dimensional array of subsamples encoded by means of a lossy compression , their outputs connected to the unit of restoration of transmitted data sections , which is connected to the unit of storing and output of hierarchical pyramid , the storage of a set of predetermined resampling patterns and the unit of restoration of missed sections , for which there are similar restored sections on the pyramid levels with a higher spatial resolution , the latter being connected to the unit of storing and output of hierarchical pyramid and the unit of final filtration and interpolation , which is connected to the unit of storing and output of hierarchical pyramid , and the storage of a set of predetermined resampling patterns . WO2009041843A1 CLAIM 87 . System for image transmission via limited throughput communication channels , which comprises a device for image registration , a unit for data format conversion , a data encoding device executed according to any of Claims 63 , 68 , a low throughput communication channel , a decoding device (second maximum region, second maximum region sizes) executed according to any of Claims 69 , 74 , a unit for inverse transformation (transform coding, information samples) of data format and a device for displaying images , where the device for image registration is connected to the unit for data format conversion connected to the data encoding device executed according to any of Claims 63 , 68 , connected to the limited throughput communication channel connected to the decoding device executed according to any of Claims 69 , 74 , connected to the unit for inverse transformation of data format connected to the device for displaying images .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples (inverse transformation) into the first set of root regions such that the first set of root regions are rectangular blocks of a size determined by the first maximum region size (d line) , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	WO2009041843A1 CLAIM 13 . Method according to Claim 1 , characterized in that the process of encoding a one-dimensional data array is carried out through discrete cosine transform and line (respective partition, maximum hierarchy level, first maximum region size) ar and/or non-linear adaptive quantization , with subsequent encoding of data obtained after quantization , together with quantization parameters , through a method of encoding with variable-length codes . WO2009041843A1 CLAIM 87 . System for image transmission via limited throughput communication channels , which comprises a device for image registration , a unit for data format conversion , a data encoding device executed according to any of Claims 63 , 68 , a low throughput communication channel , a decoding device executed according to any of Claims 69 , 74 , a unit for inverse transformation (transform coding, information samples) of data format and a device for displaying images , where the device for image registration is connected to the unit for data format conversion connected to the data encoding device executed according to any of Claims 63 , 68 , connected to the limited throughput communication channel connected to the decoding device executed according to any of Claims 69 , 74 , connected to the unit for inverse transformation of data format connected to the device for displaying images .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level (discrete cosine transform) according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition (d line) rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level (d line) is reached .	WO2009041843A1 CLAIM 13 . Method according to Claim 1 , characterized in that the process of encoding a one-dimensional data array is carried out through discrete cosine transform (first hierarchy level) and line (respective partition, maximum hierarchy level, first maximum region size) ar and/or non-linear adaptive quantization , with subsequent encoding of data obtained after quantization , together with quantization parameters , through a method of encoding with variable-length codes .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level (d line) from the data stream .	WO2009041843A1 CLAIM 13 . Method according to Claim 1 , characterized in that the process of encoding a one-dimensional data array is carried out through discrete cosine transform and line (respective partition, maximum hierarchy level, first maximum region size) ar and/or non-linear adaptive quantization , with subsequent encoding of data obtained after quantization , together with quantization parameters , through a method of encoding with variable-length codes .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples (inverse transformation) , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	WO2009041843A1 CLAIM 87 . System for image transmission via limited throughput communication channels , which comprises a device for image registration , a unit for data format conversion , a data encoding device executed according to any of Claims 63 , 68 , a low throughput communication channel , a decoding device executed according to any of Claims 69 , 74 , a unit for inverse transformation (transform coding, information samples) of data format and a device for displaying images , where the device for image registration is connected to the unit for data format conversion connected to the data encoding device executed according to any of Claims 63 , 68 , connected to the limited throughput communication channel connected to the decoding device executed according to any of Claims 69 , 74 , connected to the unit for inverse transformation of data format connected to the device for displaying images .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples (inverse transformation) from the data stream , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding (inverse transformation) to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	WO2009041843A1 CLAIM 87 . System for image transmission via limited throughput communication channels , which comprises a device for image registration , a unit for data format conversion , a data encoding device executed according to any of Claims 63 , 68 , a low throughput communication channel , a decoding device executed according to any of Claims 69 , 74 , a unit for inverse transformation (transform coding, information samples) of data format and a device for displaying images , where the device for image registration is connected to the unit for data format conversion connected to the data encoding device executed according to any of Claims 63 , 68 , connected to the limited throughput communication channel connected to the decoding device executed according to any of Claims 69 , 74 , connected to the unit for inverse transformation of data format connected to the device for displaying images .
US10250913B2 CLAIM 11 . The decoder according to claim 1 , wherein the recursive multi-tree partitioning includes a quadtree partitioning (coding one) technique .	WO2009041843A1 CLAIM 44 . Method according to Claim 32 , characterized in that the process of encoding one (quadtree partitioning, quadtree partitioning technique) -dimensional data arrays is carried out through discrete cosine transform and linear and/or non-linear adaptive quantization , with subsequent encoding of data obtained after quantization , together with quantization parameters , through a method of encoding with variable-length codes .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region (decoding device) sizes , first and second subdivision information , and a maximum hierarchy level (d line) , wherein the first maximum region size (d line) and the first subdivision information are associated with prediction coding (receiving input) and the second maximum region size and the second subdivision information are associated with transform coding (inverse transformation) ; dividing an array of information samples (inverse transformation) representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	WO2009041843A1 CLAIM 13 . Method according to Claim 1 , characterized in that the process of encoding a one-dimensional data array is carried out through discrete cosine transform and line (respective partition, maximum hierarchy level, first maximum region size) ar and/or non-linear adaptive quantization , with subsequent encoding of data obtained after quantization , together with quantization parameters , through a method of encoding with variable-length codes . WO2009041843A1 CLAIM 69 . Device for implementation of the method for decoding digital signals according to Claim 23 , which contains a unit of receiving input (prediction coding) encoded data and demultiplexing , a unit of lossless decompression and decoding of information on location of subsamples , a unit of decoding a one-dimensional array of subsamples encoded by means of a lossy compression algorithm , a unit of restoration of transmitted data sections , a unit of restoration of missed sections , for which there are similar restored sections on the pyramid levels with a higher spatial resolution , a unit of final filtration and interpolation , a unit of storing and output of hierarchical pyramid , a storage of a set of predetermined resampling patterns ; where the unit of receiving input encoded data and demultiplexing is connected to the unit of lossless decompression and decoding of information on location of subsamples , and to the unit of restoration of a one-dimensional array of subsamples encoded by means of a lossy compression , their outputs connected to the unit of restoration of transmitted data sections , which is connected to the unit of storing and output of hierarchical pyramid , the storage of a set of predetermined resampling patterns and the unit of restoration of missed sections , for which there are similar restored sections on the pyramid levels with a higher spatial resolution , the latter being connected to the unit of storing and output of hierarchical pyramid and the unit of final filtration and interpolation , which is connected to the unit of storing and output of hierarchical pyramid , and the storage of a set of predetermined resampling patterns . WO2009041843A1 CLAIM 87 . System for image transmission via limited throughput communication channels , which comprises a device for image registration , a unit for data format conversion , a data encoding device executed according to any of Claims 63 , 68 , a low throughput communication channel , a decoding device (second maximum region, second maximum region sizes) executed according to any of Claims 69 , 74 , a unit for inverse transformation (transform coding, information samples) of data format and a device for displaying images , where the device for image registration is connected to the unit for data format conversion connected to the data encoding device executed according to any of Claims 63 , 68 , connected to the limited throughput communication channel connected to the decoding device executed according to any of Claims 69 , 74 , connected to the unit for inverse transformation of data format connected to the device for displaying images .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples (inverse transformation) representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size (d line) , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region (decoding device) size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level (d line) ; and a data stream generator configured to : encode the array of information samples using prediction coding (receiving input) in accordance with the first set of sub-regions and transform coding (inverse transformation) in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	WO2009041843A1 CLAIM 13 . Method according to Claim 1 , characterized in that the process of encoding a one-dimensional data array is carried out through discrete cosine transform and line (respective partition, maximum hierarchy level, first maximum region size) ar and/or non-linear adaptive quantization , with subsequent encoding of data obtained after quantization , together with quantization parameters , through a method of encoding with variable-length codes . WO2009041843A1 CLAIM 69 . Device for implementation of the method for decoding digital signals according to Claim 23 , which contains a unit of receiving input (prediction coding) encoded data and demultiplexing , a unit of lossless decompression and decoding of information on location of subsamples , a unit of decoding a one-dimensional array of subsamples encoded by means of a lossy compression algorithm , a unit of restoration of transmitted data sections , a unit of restoration of missed sections , for which there are similar restored sections on the pyramid levels with a higher spatial resolution , a unit of final filtration and interpolation , a unit of storing and output of hierarchical pyramid , a storage of a set of predetermined resampling patterns ; where the unit of receiving input encoded data and demultiplexing is connected to the unit of lossless decompression and decoding of information on location of subsamples , and to the unit of restoration of a one-dimensional array of subsamples encoded by means of a lossy compression , their outputs connected to the unit of restoration of transmitted data sections , which is connected to the unit of storing and output of hierarchical pyramid , the storage of a set of predetermined resampling patterns and the unit of restoration of missed sections , for which there are similar restored sections on the pyramid levels with a higher spatial resolution , the latter being connected to the unit of storing and output of hierarchical pyramid and the unit of final filtration and interpolation , which is connected to the unit of storing and output of hierarchical pyramid , and the storage of a set of predetermined resampling patterns . WO2009041843A1 CLAIM 87 . System for image transmission via limited throughput communication channels , which comprises a device for image registration , a unit for data format conversion , a data encoding device executed according to any of Claims 63 , 68 , a low throughput communication channel , a decoding device (second maximum region, second maximum region sizes) executed according to any of Claims 69 , 74 , a unit for inverse transformation (transform coding, information samples) of data format and a device for displaying images , where the device for image registration is connected to the unit for data format conversion connected to the data encoding device executed according to any of Claims 63 , 68 , connected to the limited throughput communication channel connected to the decoding device executed according to any of Claims 69 , 74 , connected to the unit for inverse transformation of data format connected to the device for displaying images .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples (inverse transformation) representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size (d line) ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region (decoding device) size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level (d line) ; encoding the array of information samples using prediction coding (receiving input) in accordance with the first set of sub-regions and transform coding (inverse transformation) in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	WO2009041843A1 CLAIM 13 . Method according to Claim 1 , characterized in that the process of encoding a one-dimensional data array is carried out through discrete cosine transform and line (respective partition, maximum hierarchy level, first maximum region size) ar and/or non-linear adaptive quantization , with subsequent encoding of data obtained after quantization , together with quantization parameters , through a method of encoding with variable-length codes . WO2009041843A1 CLAIM 69 . Device for implementation of the method for decoding digital signals according to Claim 23 , which contains a unit of receiving input (prediction coding) encoded data and demultiplexing , a unit of lossless decompression and decoding of information on location of subsamples , a unit of decoding a one-dimensional array of subsamples encoded by means of a lossy compression algorithm , a unit of restoration of transmitted data sections , a unit of restoration of missed sections , for which there are similar restored sections on the pyramid levels with a higher spatial resolution , a unit of final filtration and interpolation , a unit of storing and output of hierarchical pyramid , a storage of a set of predetermined resampling patterns ; where the unit of receiving input encoded data and demultiplexing is connected to the unit of lossless decompression and decoding of information on location of subsamples , and to the unit of restoration of a one-dimensional array of subsamples encoded by means of a lossy compression , their outputs connected to the unit of restoration of transmitted data sections , which is connected to the unit of storing and output of hierarchical pyramid , the storage of a set of predetermined resampling patterns and the unit of restoration of missed sections , for which there are similar restored sections on the pyramid levels with a higher spatial resolution , the latter being connected to the unit of storing and output of hierarchical pyramid and the unit of final filtration and interpolation , which is connected to the unit of storing and output of hierarchical pyramid , and the storage of a set of predetermined resampling patterns . WO2009041843A1 CLAIM 87 . System for image transmission via limited throughput communication channels , which comprises a device for image registration , a unit for data format conversion , a data encoding device executed according to any of Claims 63 , 68 , a low throughput communication channel , a decoding device (second maximum region, second maximum region sizes) executed according to any of Claims 69 , 74 , a unit for inverse transformation (transform coding, information samples) of data format and a device for displaying images , where the device for image registration is connected to the unit for data format conversion connected to the data encoding device executed according to any of Claims 63 , 68 , connected to the limited throughput communication channel connected to the decoding device executed according to any of Claims 69 , 74 , connected to the unit for inverse transformation of data format connected to the device for displaying images .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	CN101507280A Filed: 2007-08-16 Issued: 2009-08-12 用于降低分辨率划分的方法和装置 (Original Assignee) 汤姆逊许可公司奥斯卡·迪沃拉·埃斯科达, 尹鹏
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information (视频信号) , information related to first and second maximum region (种方法) sizes , first and second subdivision information , and a maximum hierarchy (连接的) level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root (中的一个) region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN101507280A CLAIM 2 . 根据权利要求l所述的装置，其中划分由自顶向下树划分和自底向上的树连接的 (maximum hierarchy) 结合获得。 CN101507280A CLAIM 12 . 根据权利要求9所述的装置，其中与本地超块相关的信息仅被嵌入超块的一个块中或者分布在属于包含在超块中的相同一组块中的一个 (respective root) 以上的块中。 CN101507280A CLAIM 19 . 一种方法 (second maximum region) ，包括：通过进行图像的原始划分将图像划分为中等尺寸的一组图像块 (510) ; 选择其中某些图像块进行进一歩划分（530) ; 并选择其他图像块进行合并（520)对图像，以编码图像，其中进一步的划分和合并使用自适应的基于树的帧划分（520， 530)。 CN101507280A CLAIM 71 . —种用于视频编码的视频信号 (video information) 结构，包括：图像，通过进行图像的原始划分将图像划分为中等尺寸的一组图像块、选择其中某些图像块进行进一步划分、并选择其他图像块进行合并来进行编码。
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal based on an intra-prediction mode (编码标准) associated with the sub-region and reconstructed samples of a neighboring subset (一组块) of the second set of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle (编码标准) .	CN101507280A CLAIM 12 . 根据权利要求9所述的装置，其中与本地超块相关的信息仅被嵌入超块的一个块中或者分布在属于包含在超块中的相同一组块 (neighboring subset) 中的一个以上的块中。 CN101507280A CLAIM 15 . 根据权利要求9所述的装置，其中块扫描顺序与视频编码推荐性标准或视频编码标准 (intra-prediction mode, next intra-prediction cycle) 规定的现有块扫描顺序相同或不同。
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set of root regions such that the first set of root regions are rectangular blocks (至少一个块) of a size determined by the first maximum region size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	CN101507280A CLAIM 13 . 根据权利要求9所述的装置，其中在超块的至少一个块 (rectangular blocks) 中，块编码模式、与本地超块相关的信息和运动信息至少其中之一从当前块中直接推导出，以由至少一个块编码模式、与本地超块相关的信息和运动信息进行编码，显式或隐式地嵌入至少一个相邻块中。
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy (连接的) level is reached .	CN101507280A CLAIM 2 . 根据权利要求l所述的装置，其中划分由自顶向下树划分和自底向上的树连接的 (maximum hierarchy) 结合获得。
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy (连接的) level from the data stream .	CN101507280A CLAIM 2 . 根据权利要求l所述的装置，其中划分由自顶向下树划分和自底向上的树连接的 (maximum hierarchy) 结合获得。
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision (模块进行) of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	CN101507280A CLAIM 16 . 根据权利要求2所述的装置，其中所述编码器（300)将至少一个与本地超块划分相关的语法元素嵌入直接预测模块，从而基于自适应直接预测模块进行 (intermediate subdivision) 超块帧划分，所述自适应直接预测模块可以将不同的可能预测器用于直接预测模式。
US10250913B2 CLAIM 11 . The decoder according to claim 1 , wherein the recursive multi-tree partitioning includes a quadtree partitioning technique (而能够) .	CN101507280A CLAIM 65 . 根据权利要求61所述的方法，其中所述至少一个附加语法元素选择性地标示与本地超块相关的信息是否相对于相应于与本地超块相关的信总的先前编码的块由至少一个相邻块继承（850， 1020)，并且其中至少一个相邻块的至少一个块编码模式和运动信息从至少一个附加语法元素直接推导，从而能够 (quadtree partitioning technique) 对至少一个相邻块的至少一个块编码模式和运动信息直接解码。
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information (视频信号) , information related to first and second maximum region (种方法) sizes , first and second subdivision information , and a maximum hierarchy (连接的) level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root (中的一个) region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN101507280A CLAIM 2 . 根据权利要求l所述的装置，其中划分由自顶向下树划分和自底向上的树连接的 (maximum hierarchy) 结合获得。 CN101507280A CLAIM 12 . 根据权利要求9所述的装置，其中与本地超块相关的信息仅被嵌入超块的一个块中或者分布在属于包含在超块中的相同一组块中的一个 (respective root) 以上的块中。 CN101507280A CLAIM 19 . 一种方法 (second maximum region) ，包括：通过进行图像的原始划分将图像划分为中等尺寸的一组图像块 (510) ; 选择其中某些图像块进行进一歩划分（530) ; 并选择其他图像块进行合并（520)对图像，以编码图像，其中进一步的划分和合并使用自适应的基于树的帧划分（520， 530)。 CN101507280A CLAIM 71 . —种用于视频编码的视频信号 (video information) 结构，包括：图像，通过进行图像的原始划分将图像划分为中等尺寸的一组图像块、选择其中某些图像块进行进一步划分、并选择其他图像块进行合并来进行编码。
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information (视频信号) into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region (种方法) size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root (中的一个) region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy (连接的) level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN101507280A CLAIM 2 . 根据权利要求l所述的装置，其中划分由自顶向下树划分和自底向上的树连接的 (maximum hierarchy) 结合获得。 CN101507280A CLAIM 12 . 根据权利要求9所述的装置，其中与本地超块相关的信息仅被嵌入超块的一个块中或者分布在属于包含在超块中的相同一组块中的一个 (respective root) 以上的块中。 CN101507280A CLAIM 19 . 一种方法 (second maximum region) ，包括：通过进行图像的原始划分将图像划分为中等尺寸的一组图像块 (510) ; 选择其中某些图像块进行进一歩划分（530) ; 并选择其他图像块进行合并（520)对图像，以编码图像，其中进一步的划分和合并使用自适应的基于树的帧划分（520， 530)。 CN101507280A CLAIM 71 . —种用于视频编码的视频信号 (video information) 结构，包括：图像，通过进行图像的原始划分将图像划分为中等尺寸的一组图像块、选择其中某些图像块进行进一步划分、并选择其他图像块进行合并来进行编码。
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information (视频信号) into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region (种方法) size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root (中的一个) region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy (连接的) level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN101507280A CLAIM 2 . 根据权利要求l所述的装置，其中划分由自顶向下树划分和自底向上的树连接的 (maximum hierarchy) 结合获得。 CN101507280A CLAIM 12 . 根据权利要求9所述的装置，其中与本地超块相关的信息仅被嵌入超块的一个块中或者分布在属于包含在超块中的相同一组块中的一个 (respective root) 以上的块中。 CN101507280A CLAIM 19 . 一种方法 (second maximum region) ，包括：通过进行图像的原始划分将图像划分为中等尺寸的一组图像块 (510) ; 选择其中某些图像块进行进一歩划分（530) ; 并选择其他图像块进行合并（520)对图像，以编码图像，其中进一步的划分和合并使用自适应的基于树的帧划分（520， 530)。 CN101507280A CLAIM 71 . —种用于视频编码的视频信号 (video information) 结构，包括：图像，通过进行图像的原始划分将图像划分为中等尺寸的一组图像块、选择其中某些图像块进行进一步划分、并选择其他图像块进行合并来进行编码。

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	WO2008027192A2 Filed: 2007-08-16 Issued: 2008-03-06 Methods and apparatus for reduced resolution partitioning (Original Assignee) Thomson Licensing Oscar Divorra Escoda, Peng Yin
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level (high level syntax) wherein the first maximum region size and the first subdivision information are associated with prediction coding (adaptive tree, scan order) and the second maximum region size and the second subdivision information are associated with transform coding (adaptive tree, scan order) ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	WO2008027192A2 CLAIM 1 . An apparatus , comprising : an encoder (300) for encoding an image by performing an initial partitioning of the image into a mid-sized set of image blocks , selecting some of the image blocks for further partitioning , and selecting others of the image blocks for merging , wherein the further partitioning and the merging use adaptive tree (prediction coding, transform coding) -based frame partitioning . WO2008027192A2 CLAIM 7 . The apparatus of claim 2 , wherein said encoder (300) selectively enables or disables at least one of the top-down tree partitioning and the bottom-up tree joining using a high level syntax (hierarchy level) . WO2008027192A2 CLAIM 15 . The apparatus of claim 9 , wherein a block scanning order is equal or different from an existing block scan order (prediction coding, transform coding) imposed by a video coding recommendation or a video coding standard .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level (high level syntax) according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	WO2008027192A2 CLAIM 7 . The apparatus of claim 2 , wherein said encoder (300) selectively enables or disables at least one of the top-down tree partitioning and the bottom-up tree joining using a high level syntax (hierarchy level) .
US10250913B2 CLAIM 5 . The decoder according to claim 4 , wherein the divider is configured to , in accordance with the partition rules associated with the first and higher-order hierarchy levels , sub-divide into sub-regions of equal size , such that there are an equal number of sub-regions at each hierarchy level (high level syntax) .	WO2008027192A2 CLAIM 7 . The apparatus of claim 2 , wherein said encoder (300) selectively enables or disables at least one of the top-down tree partitioning and the bottom-up tree joining using a high level syntax (hierarchy level) .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision information includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level (high level syntax) is sub-divided .	WO2008027192A2 CLAIM 7 . The apparatus of claim 2 , wherein said encoder (300) selectively enables or disables at least one of the top-down tree partitioning and the bottom-up tree joining using a high level syntax (hierarchy level) .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level (high level syntax) from the data stream .	WO2008027192A2 CLAIM 7 . The apparatus of claim 2 , wherein said encoder (300) selectively enables or disables at least one of the top-down tree partitioning and the bottom-up tree joining using a high level syntax (hierarchy level) .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements (video coding) associated with the first or second set of sub-regions from the data stream in a depth-first traversal order .	WO2008027192A2 CLAIM 15 . The apparatus of claim 9 , wherein a block scanning order is equal or different from an existing block scan order imposed by a video coding (syntax elements) recommendation or a video coding standard .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements (video coding) of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	WO2008027192A2 CLAIM 15 . The apparatus of claim 9 , wherein a block scanning order is equal or different from an existing block scan order imposed by a video coding (syntax elements) recommendation or a video coding standard .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding (adaptive tree, scan order) to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	WO2008027192A2 CLAIM 1 . An apparatus , comprising : an encoder (300) for encoding an image by performing an initial partitioning of the image into a mid-sized set of image blocks , selecting some of the image blocks for further partitioning , and selecting others of the image blocks for merging , wherein the further partitioning and the merging use adaptive tree (prediction coding, transform coding) -based frame partitioning . WO2008027192A2 CLAIM 15 . The apparatus of claim 9 , wherein a block scanning order is equal or different from an existing block scan order (prediction coding, transform coding) imposed by a video coding recommendation or a video coding standard .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level (high level syntax) , wherein the first maximum region size and the first subdivision information are associated with prediction coding (adaptive tree, scan order) and the second maximum region size and the second subdivision information are associated with transform coding (adaptive tree, scan order) ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	WO2008027192A2 CLAIM 1 . An apparatus , comprising : an encoder (300) for encoding an image by performing an initial partitioning of the image into a mid-sized set of image blocks , selecting some of the image blocks for further partitioning , and selecting others of the image blocks for merging , wherein the further partitioning and the merging use adaptive tree (prediction coding, transform coding) -based frame partitioning . WO2008027192A2 CLAIM 7 . The apparatus of claim 2 , wherein said encoder (300) selectively enables or disables at least one of the top-down tree partitioning and the bottom-up tree joining using a high level syntax (hierarchy level) . WO2008027192A2 CLAIM 15 . The apparatus of claim 9 , wherein a block scanning order is equal or different from an existing block scan order (prediction coding, transform coding) imposed by a video coding recommendation or a video coding standard .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level (high level syntax) ; and a data stream generator configured to : encode the array of information samples using prediction coding (adaptive tree, scan order) in accordance with the first set of sub-regions and transform coding (adaptive tree, scan order) in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	WO2008027192A2 CLAIM 1 . An apparatus , comprising : an encoder (300) for encoding an image by performing an initial partitioning of the image into a mid-sized set of image blocks , selecting some of the image blocks for further partitioning , and selecting others of the image blocks for merging , wherein the further partitioning and the merging use adaptive tree (prediction coding, transform coding) -based frame partitioning . WO2008027192A2 CLAIM 7 . The apparatus of claim 2 , wherein said encoder (300) selectively enables or disables at least one of the top-down tree partitioning and the bottom-up tree joining using a high level syntax (hierarchy level) . WO2008027192A2 CLAIM 15 . The apparatus of claim 9 , wherein a block scanning order is equal or different from an existing block scan order (prediction coding, transform coding) imposed by a video coding recommendation or a video coding standard .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level (high level syntax) ; encoding the array of information samples using prediction coding (adaptive tree, scan order) in accordance with the first set of sub-regions and transform coding (adaptive tree, scan order) in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	WO2008027192A2 CLAIM 1 . An apparatus , comprising : an encoder (300) for encoding an image by performing an initial partitioning of the image into a mid-sized set of image blocks , selecting some of the image blocks for further partitioning , and selecting others of the image blocks for merging , wherein the further partitioning and the merging use adaptive tree (prediction coding, transform coding) -based frame partitioning . WO2008027192A2 CLAIM 7 . The apparatus of claim 2 , wherein said encoder (300) selectively enables or disables at least one of the top-down tree partitioning and the bottom-up tree joining using a high level syntax (hierarchy level) . WO2008027192A2 CLAIM 15 . The apparatus of claim 9 , wherein a block scanning order is equal or different from an existing block scan order (prediction coding, transform coding) imposed by a video coding recommendation or a video coding standard .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20090196517A1 Filed: 2007-08-16 Issued: 2009-08-06 Method and apparatus for reduced resolution partitioning (Original Assignee) Oscar Divorra Escoda; Peng Yin (Current Assignee) InterDigital VC Holdings Inc Oscar Divorra Escoda, Peng Yin
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level (high level syntax) wherein the first maximum region size and the first subdivision information are associated with prediction coding (adaptive tree, scan order) and the second maximum region size and the second subdivision information are associated with transform coding (adaptive tree, scan order) ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20090196517A1 CLAIM 1 . An apparatus , comprising : an encoder for encoding an image by performing an initial partitioning of the image into a mid-sized set of image blocks , selecting some of the image blocks for further partitioning , and selecting others of the image blocks for merging , wherein the further partitioning and the merging use adaptive tree (prediction coding, transform coding) -based frame partitioning . US20090196517A1 CLAIM 7 . The apparatus of claim 2 , wherein said encoder selectively enables or disables at least one of the top-down tree partitioning and the bottom-up tree joining using a high level syntax (hierarchy level) . US20090196517A1 CLAIM 15 . The apparatus of claim 9 , wherein a block scanning order is equal or different from an existing block scan order (prediction coding, transform coding) imposed by a video coding recommendation or a video coding standard .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level (high level syntax) according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20090196517A1 CLAIM 7 . The apparatus of claim 2 , wherein said encoder selectively enables or disables at least one of the top-down tree partitioning and the bottom-up tree joining using a high level syntax (hierarchy level) .
US10250913B2 CLAIM 5 . The decoder according to claim 4 , wherein the divider is configured to , in accordance with the partition rules associated with the first and higher-order hierarchy levels , sub-divide into sub-regions of equal size , such that there are an equal number of sub-regions at each hierarchy level (high level syntax) .	US20090196517A1 CLAIM 7 . The apparatus of claim 2 , wherein said encoder selectively enables or disables at least one of the top-down tree partitioning and the bottom-up tree joining using a high level syntax (hierarchy level) .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision information includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level (high level syntax) is sub-divided .	US20090196517A1 CLAIM 7 . The apparatus of claim 2 , wherein said encoder selectively enables or disables at least one of the top-down tree partitioning and the bottom-up tree joining using a high level syntax (hierarchy level) .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level (high level syntax) from the data stream .	US20090196517A1 CLAIM 7 . The apparatus of claim 2 , wherein said encoder selectively enables or disables at least one of the top-down tree partitioning and the bottom-up tree joining using a high level syntax (hierarchy level) .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements (video coding) associated with the first or second set of sub-regions from the data stream in a depth-first traversal order .	US20090196517A1 CLAIM 15 . The apparatus of claim 9 , wherein a block scanning order is equal or different from an existing block scan order imposed by a video coding (syntax elements) recommendation or a video coding standard .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements (video coding) of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20090196517A1 CLAIM 15 . The apparatus of claim 9 , wherein a block scanning order is equal or different from an existing block scan order imposed by a video coding (syntax elements) recommendation or a video coding standard .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding (adaptive tree, scan order) to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	US20090196517A1 CLAIM 1 . An apparatus , comprising : an encoder for encoding an image by performing an initial partitioning of the image into a mid-sized set of image blocks , selecting some of the image blocks for further partitioning , and selecting others of the image blocks for merging , wherein the further partitioning and the merging use adaptive tree (prediction coding, transform coding) -based frame partitioning . US20090196517A1 CLAIM 15 . The apparatus of claim 9 , wherein a block scanning order is equal or different from an existing block scan order (prediction coding, transform coding) imposed by a video coding recommendation or a video coding standard .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level (high level syntax) , wherein the first maximum region size and the first subdivision information are associated with prediction coding (adaptive tree, scan order) and the second maximum region size and the second subdivision information are associated with transform coding (adaptive tree, scan order) ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20090196517A1 CLAIM 1 . An apparatus , comprising : an encoder for encoding an image by performing an initial partitioning of the image into a mid-sized set of image blocks , selecting some of the image blocks for further partitioning , and selecting others of the image blocks for merging , wherein the further partitioning and the merging use adaptive tree (prediction coding, transform coding) -based frame partitioning . US20090196517A1 CLAIM 7 . The apparatus of claim 2 , wherein said encoder selectively enables or disables at least one of the top-down tree partitioning and the bottom-up tree joining using a high level syntax (hierarchy level) . US20090196517A1 CLAIM 15 . The apparatus of claim 9 , wherein a block scanning order is equal or different from an existing block scan order (prediction coding, transform coding) imposed by a video coding recommendation or a video coding standard .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level (high level syntax) ; and a data stream generator configured to : encode the array of information samples using prediction coding (adaptive tree, scan order) in accordance with the first set of sub-regions and transform coding (adaptive tree, scan order) in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20090196517A1 CLAIM 1 . An apparatus , comprising : an encoder for encoding an image by performing an initial partitioning of the image into a mid-sized set of image blocks , selecting some of the image blocks for further partitioning , and selecting others of the image blocks for merging , wherein the further partitioning and the merging use adaptive tree (prediction coding, transform coding) -based frame partitioning . US20090196517A1 CLAIM 7 . The apparatus of claim 2 , wherein said encoder selectively enables or disables at least one of the top-down tree partitioning and the bottom-up tree joining using a high level syntax (hierarchy level) . US20090196517A1 CLAIM 15 . The apparatus of claim 9 , wherein a block scanning order is equal or different from an existing block scan order (prediction coding, transform coding) imposed by a video coding recommendation or a video coding standard .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level (high level syntax) ; encoding the array of information samples using prediction coding (adaptive tree, scan order) in accordance with the first set of sub-regions and transform coding (adaptive tree, scan order) in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20090196517A1 CLAIM 1 . An apparatus , comprising : an encoder for encoding an image by performing an initial partitioning of the image into a mid-sized set of image blocks , selecting some of the image blocks for further partitioning , and selecting others of the image blocks for merging , wherein the further partitioning and the merging use adaptive tree (prediction coding, transform coding) -based frame partitioning . US20090196517A1 CLAIM 7 . The apparatus of claim 2 , wherein said encoder selectively enables or disables at least one of the top-down tree partitioning and the bottom-up tree joining using a high level syntax (hierarchy level) . US20090196517A1 CLAIM 15 . The apparatus of claim 9 , wherein a block scanning order is equal or different from an existing block scan order (prediction coding, transform coding) imposed by a video coding recommendation or a video coding standard .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20080049834A1 Filed: 2007-08-03 Issued: 2008-02-28 Sub-block transform coding of prediction residuals (Original Assignee) Microsoft Corp (Current Assignee) Microsoft Technology Licensing LLC Thomas Holcomb, Chih-Lung Lin
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (video encoder, video frame) information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision (video encoder, video frame) information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20080049834A1 CLAIM 55 . In a computer system , a computer-implemented method of processing one or more video frame (second subdivision, second subset, second subdivision information, first subdivision) s , the method comprising : processing data for one or more video frames , wherein the one or more video frames include plural blocks , wherein the processing includes using one or more sub-block pattern codes that each indicate an information pattern for plural sub-blocks of a corresponding block of the plural blocks . US20080049834A1 CLAIM 62 . In a video encoder (second subdivision, second subset, second subdivision information, first subdivision) , a computer-implemented method of processing one or more motion-predicted video frames , wherein the one or more motion-predicted video frames include plural blocks , the method comprising : using plural sub-block pattern codes during encoding of prediction residual data , wherein each of the plural sub-block pattern codes indicates presence or absence of information for plural sub-blocks of a corresponding block of the plural blocks ; and outputting the plural sub-block pattern codes .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set of root regions such that the first set of root regions are rectangular blocks (motion prediction) of a size determined by the first maximum region size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	US20080049834A1 CLAIM 56 . The method of claim 55 wherein the data for the one or more video frames comprises motion prediction (rectangular blocks) residual data .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision (video encoder, video frame) information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20080049834A1 CLAIM 55 . In a computer system , a computer-implemented method of processing one or more video frame (second subdivision, second subset, second subdivision information, first subdivision) s , the method comprising : processing data for one or more video frames , wherein the one or more video frames include plural blocks , wherein the processing includes using one or more sub-block pattern codes that each indicate an information pattern for plural sub-blocks of a corresponding block of the plural blocks . US20080049834A1 CLAIM 62 . In a video encoder (second subdivision, second subset, second subdivision information, first subdivision) , a computer-implemented method of processing one or more motion-predicted video frames , wherein the one or more motion-predicted video frames include plural blocks , the method comprising : using plural sub-block pattern codes during encoding of prediction residual data , wherein each of the plural sub-block pattern codes indicates presence or absence of information for plural sub-blocks of a corresponding block of the plural blocks ; and outputting the plural sub-block pattern codes .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision (video encoder, video frame) information includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level is sub-divided .	US20080049834A1 CLAIM 55 . In a computer system , a computer-implemented method of processing one or more video frame (second subdivision, second subset, second subdivision information, first subdivision) s , the method comprising : processing data for one or more video frames , wherein the one or more video frames include plural blocks , wherein the processing includes using one or more sub-block pattern codes that each indicate an information pattern for plural sub-blocks of a corresponding block of the plural blocks . US20080049834A1 CLAIM 62 . In a video encoder (second subdivision, second subset, second subdivision information, first subdivision) , a computer-implemented method of processing one or more motion-predicted video frames , wherein the one or more motion-predicted video frames include plural blocks , the method comprising : using plural sub-block pattern codes during encoding of prediction residual data , wherein each of the plural sub-block pattern codes indicates presence or absence of information for plural sub-blocks of a corresponding block of the plural blocks ; and outputting the plural sub-block pattern codes .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset (video encoder, video frame) of syntax elements of the data stream including the first subdivision (video encoder, video frame) information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision (residual data) of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20080049834A1 CLAIM 55 . In a computer system , a computer-implemented method of processing one or more video frame (second subdivision, second subset, second subdivision information, first subdivision) s , the method comprising : processing data for one or more video frames , wherein the one or more video frames include plural blocks , wherein the processing includes using one or more sub-block pattern codes that each indicate an information pattern for plural sub-blocks of a corresponding block of the plural blocks . US20080049834A1 CLAIM 56 . The method of claim 55 wherein the data for the one or more video frames comprises motion prediction residual data (intermediate subdivision) . US20080049834A1 CLAIM 62 . In a video encoder (second subdivision, second subset, second subdivision information, first subdivision) , a computer-implemented method of processing one or more motion-predicted video frames , wherein the one or more motion-predicted video frames include plural blocks , the method comprising : using plural sub-block pattern codes during encoding of prediction residual data , wherein each of the plural sub-block pattern codes indicates presence or absence of information for plural sub-blocks of a corresponding block of the plural blocks ; and outputting the plural sub-block pattern codes .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (video encoder, video frame) information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision (video encoder, video frame) information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20080049834A1 CLAIM 55 . In a computer system , a computer-implemented method of processing one or more video frame (second subdivision, second subset, second subdivision information, first subdivision) s , the method comprising : processing data for one or more video frames , wherein the one or more video frames include plural blocks , wherein the processing includes using one or more sub-block pattern codes that each indicate an information pattern for plural sub-blocks of a corresponding block of the plural blocks . US20080049834A1 CLAIM 62 . In a video encoder (second subdivision, second subset, second subdivision information, first subdivision) , a computer-implemented method of processing one or more motion-predicted video frames , wherein the one or more motion-predicted video frames include plural blocks , the method comprising : using plural sub-block pattern codes during encoding of prediction residual data , wherein each of the plural sub-block pattern codes indicates presence or absence of information for plural sub-blocks of a corresponding block of the plural blocks ; and outputting the plural sub-block pattern codes .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision (video encoder, video frame) information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (video encoder, video frame) information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20080049834A1 CLAIM 55 . In a computer system , a computer-implemented method of processing one or more video frame (second subdivision, second subset, second subdivision information, first subdivision) s , the method comprising : processing data for one or more video frames , wherein the one or more video frames include plural blocks , wherein the processing includes using one or more sub-block pattern codes that each indicate an information pattern for plural sub-blocks of a corresponding block of the plural blocks . US20080049834A1 CLAIM 62 . In a video encoder (second subdivision, second subset, second subdivision information, first subdivision) , a computer-implemented method of processing one or more motion-predicted video frames , wherein the one or more motion-predicted video frames include plural blocks , the method comprising : using plural sub-block pattern codes during encoding of prediction residual data , wherein each of the plural sub-block pattern codes indicates presence or absence of information for plural sub-blocks of a corresponding block of the plural blocks ; and outputting the plural sub-block pattern codes .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision (video encoder, video frame) information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (video encoder, video frame) information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20080049834A1 CLAIM 55 . In a computer system , a computer-implemented method of processing one or more video frame (second subdivision, second subset, second subdivision information, first subdivision) s , the method comprising : processing data for one or more video frames , wherein the one or more video frames include plural blocks , wherein the processing includes using one or more sub-block pattern codes that each indicate an information pattern for plural sub-blocks of a corresponding block of the plural blocks . US20080049834A1 CLAIM 62 . In a video encoder (second subdivision, second subset, second subdivision information, first subdivision) , a computer-implemented method of processing one or more motion-predicted video frames , wherein the one or more motion-predicted video frames include plural blocks , the method comprising : using plural sub-block pattern codes during encoding of prediction residual data , wherein each of the plural sub-block pattern codes indicates presence or absence of information for plural sub-blocks of a corresponding block of the plural blocks ; and outputting the plural sub-block pattern codes .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	CN101502119A Filed: 2007-07-31 Issued: 2009-08-05 用于视频编码的自适应几何分割方法和设备 (Original Assignee) 汤姆逊许可公司奥斯卡·迪沃拉·埃斯科达, 尹鹏
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information (视频信号) , information related to first and second maximum region (种方法) sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN101502119A CLAIM 28 . —种方法 (second maximum region) ，包括：通过响应至少一种参数模型自适应地分割（1600)图像至少一部分来编码与图像对应的图像数据，其中所述至少一种参数模型包括至少一条曲线的隐式和显式公式至少之一。 CN101502119A CLAIM 55 . —种用于视频编码的视频信号 (video information) 结构，包括：通过响应至少一种参数模型自适应地分割图像至少一部分而编码的、与图像对应的图像数据，其中所述至少一种参数模型包括至少一条曲线的隐式和显式公式至少之一。
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal based on an intra-prediction mode (编码标准) associated with the sub-region and reconstructed samples of a neighboring subset of the second set of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle (编码标准) .	CN101502119A CLAIM 15 . 根据权利要求1所述的设备，其中所述编码器（900)是现有视频编码标准 (intra-prediction mode, next intra-prediction cycle) 或视频编码建议的现有混合预测编码器的扩展版本。
US10250913B2 CLAIM 11 . The decoder according to claim 1 , wherein the recursive multi-tree partitioning includes a quadtree partitioning technique (的变换) .	CN101502119A CLAIM 26 . 根据权利要求16所述的设备，其中当使用基于参数模型的分块方式时，所述编码器（900)应用解块滤波和参考帧滤波至少之一，以适于处理由于所述宏块和所述子宏块至少之一的非树分割而受到至少一个基于参数模型的分块影响的变换 (quadtree partitioning technique) 尺寸块，并且其中所述解块滤波和所述参考帧滤波取决于所述至少一个基于参数模型的分块中的任一个被使用分块、以及所述至少一个基于参数模型的分块的选定形状。
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information (视频信号) , information related to first and second maximum region (种方法) sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN101502119A CLAIM 28 . —种方法 (second maximum region) ，包括：通过响应至少一种参数模型自适应地分割（1600)图像至少一部分来编码与图像对应的图像数据，其中所述至少一种参数模型包括至少一条曲线的隐式和显式公式至少之一。 CN101502119A CLAIM 55 . —种用于视频编码的视频信号 (video information) 结构，包括：通过响应至少一种参数模型自适应地分割图像至少一部分而编码的、与图像对应的图像数据，其中所述至少一种参数模型包括至少一条曲线的隐式和显式公式至少之一。
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information (视频信号) into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region (种方法) size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN101502119A CLAIM 28 . —种方法 (second maximum region) ，包括：通过响应至少一种参数模型自适应地分割（1600)图像至少一部分来编码与图像对应的图像数据，其中所述至少一种参数模型包括至少一条曲线的隐式和显式公式至少之一。 CN101502119A CLAIM 55 . —种用于视频编码的视频信号 (video information) 结构，包括：通过响应至少一种参数模型自适应地分割图像至少一部分而编码的、与图像对应的图像数据，其中所述至少一种参数模型包括至少一条曲线的隐式和显式公式至少之一。
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information (视频信号) into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region (种方法) size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN101502119A CLAIM 28 . —种方法 (second maximum region) ，包括：通过响应至少一种参数模型自适应地分割（1600)图像至少一部分来编码与图像对应的图像数据，其中所述至少一种参数模型包括至少一条曲线的隐式和显式公式至少之一。 CN101502119A CLAIM 55 . —种用于视频编码的视频信号 (video information) 结构，包括：通过响应至少一种参数模型自适应地分割图像至少一部分而编码的、与图像对应的图像数据，其中所述至少一种参数模型包括至少一条曲线的隐式和显式公式至少之一。

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	CN101502120A Filed: 2007-07-31 Issued: 2009-08-05 用于视频解码的自适应几何分割方法和设备 (Original Assignee) 汤姆逊许可公司奥斯卡·迪沃拉·埃斯科达, 尹鹏
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information (视频信号) , information related to first and second maximum region (种方法) sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN101502120A CLAIM 27 . —种方法 (second maximum region) ，包括：通过重构（2000、 2500)利用至少一种参数模型分割的图像的至少一部分来解码与所述图像对应的图像数据，其中所述至少一种参数模型包括至少一条曲线的隐式和显式公式至少之一。 CN101502120A CLAIM 53 . —种上面具有编码视频信号 (video information) 数据的存储介质，包括：通过响应至少一种参数模型自适应地分割图像至少一部分而编码的、与所述图像对应的图像数据，其中所述至少一种参数模型包括至少一条曲线的隐式和显式公式至少之一。
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal based on an intra-prediction mode (编码标准) associated with the sub-region and reconstructed samples of a neighboring subset of the second set of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle (编码标准) .	CN101502120A CLAIM 15 . 根据权利要求1所述的设备，其中所述解码器（1100)是现有视频编码标准 (intra-prediction mode, next intra-prediction cycle) 或视频编码建议的现有混合预测解码器的扩展版本。
US10250913B2 CLAIM 11 . The decoder according to claim 1 , wherein the recursive multi-tree partitioning includes a quadtree partitioning technique (的变换) .	CN101502120A CLAIM 25 . 根据权利要求16所述的设备，其中当使用基于参数模型的分块方式时，所述解码器（1100)应用解块滤波和参考帧滤波至少之一，以适于处理由于所述宏块和所述子宏块至少之一的非树分割而受到至少一个基于参数模型的分块影响的变换 (quadtree partitioning technique) 尺寸块，并且其中所述解块滤波和所述参考帧滤波取决于所述至少一个基于参数模型的分块中的任一个被使用分块、以及所述至少一个基于参数模型的分块的选定形状。
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information (视频信号) , information related to first and second maximum region (种方法) sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN101502120A CLAIM 27 . —种方法 (second maximum region) ，包括：通过重构（2000、 2500)利用至少一种参数模型分割的图像的至少一部分来解码与所述图像对应的图像数据，其中所述至少一种参数模型包括至少一条曲线的隐式和显式公式至少之一。 CN101502120A CLAIM 53 . —种上面具有编码视频信号 (video information) 数据的存储介质，包括：通过响应至少一种参数模型自适应地分割图像至少一部分而编码的、与所述图像对应的图像数据，其中所述至少一种参数模型包括至少一条曲线的隐式和显式公式至少之一。
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information (视频信号) into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region (种方法) size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN101502120A CLAIM 27 . —种方法 (second maximum region) ，包括：通过重构（2000、 2500)利用至少一种参数模型分割的图像的至少一部分来解码与所述图像对应的图像数据，其中所述至少一种参数模型包括至少一条曲线的隐式和显式公式至少之一。 CN101502120A CLAIM 53 . —种上面具有编码视频信号 (video information) 数据的存储介质，包括：通过响应至少一种参数模型自适应地分割图像至少一部分而编码的、与所述图像对应的图像数据，其中所述至少一种参数模型包括至少一条曲线的隐式和显式公式至少之一。
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information (视频信号) into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region (种方法) size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN101502120A CLAIM 27 . —种方法 (second maximum region) ，包括：通过重构（2000、 2500)利用至少一种参数模型分割的图像的至少一部分来解码与所述图像对应的图像数据，其中所述至少一种参数模型包括至少一条曲线的隐式和显式公式至少之一。 CN101502120A CLAIM 53 . —种上面具有编码视频信号 (video information) 数据的存储介质，包括：通过响应至少一种参数模型自适应地分割图像至少一部分而编码的、与所述图像对应的图像数据，其中所述至少一种参数模型包括至少一条曲线的隐式和显式公式至少之一。

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20090196342A1 Filed: 2007-07-31 Issued: 2009-08-06 Adaptive Geometric Partitioning For Video Encoding (Original Assignee) Oscar Divorra Escoda; Peng Yin (Current Assignee) Thomson Licensing DTV SAS Oscar Divorra Escoda, Peng Yin
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level (high level syntax) wherein the first maximum region size (d line) and the first subdivision information are associated with prediction coding (spatial neighboring block) and the second maximum region size and the second subdivision information are associated with transform coding (deblocking filtering) ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20090196342A1 CLAIM 8 . The apparatus of claim 1 , wherein said encoder performs explicit or implicit coding of a precision of parameters of at least one of the at least one parametric model and the at least one curve using at least one high level syntax (hierarchy level) element . US20090196342A1 CLAIM 12 . The apparatus of claim 1 , wherein predictor data , associated with at least one partition of at least one of the pictures , is predicted from at least one of spatial neighboring block (prediction coding) s and temporal neighboring blocks . US20090196342A1 CLAIM 20 . The apparatus of claim 16 , wherein pixels of at least one of the pictures that overlap at least two parametric model-based partitions are a weighted line (respective partition, maximum hierarchy level, first maximum region size) ar average from predictions of the at least two parametric model-based partitions . US20090196342A1 CLAIM 26 . The apparatus of claim 16 , wherein said encoder applies at least one of deblocking filtering (transform coding) and reference frame filtering adapted to handle transform-size blocks affected by at least one parametric model-based partition due to non-tree-based partitioning of the at least one of the macroblocks and the sub-macroblocks when parametric model-based partition modes are used , and wherein the deblocking filtering and the reference frame filtering is dependent upon at least one of whichever one of the at least one parametric model-based partition is used and a selected shape of the at least one parametric model-based partition .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set of root regions such that the first set of root regions are rectangular blocks of a size determined by the first maximum region size (d line) , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	US20090196342A1 CLAIM 20 . The apparatus of claim 16 , wherein pixels of at least one of the pictures that overlap at least two parametric model-based partitions are a weighted line (respective partition, maximum hierarchy level, first maximum region size) ar average from predictions of the at least two parametric model-based partitions .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level (high level syntax) according to a partition rule (different partitions) associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition (d line) rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20090196342A1 CLAIM 8 . The apparatus of claim 1 , wherein said encoder performs explicit or implicit coding of a precision of parameters of at least one of the at least one parametric model and the at least one curve using at least one high level syntax (hierarchy level) element . US20090196342A1 CLAIM 14 . The apparatus of claim 1 , wherein said encoder computes prediction values for pixels that , according to at least one of the at least one parametric model and the at least one curve , lay partly in more than one partition , using at least one of an anti-aliasing procedure , a combination of a part of prediction values for corresponding positions of the pixels , a totality of the prediction values for the corresponding positions of the pixels , a neighborhood , predictors of different partitions (partition rule) , from among the more than one partition , where the pixel is deemed to partly lay . US20090196342A1 CLAIM 20 . The apparatus of claim 16 , wherein pixels of at least one of the pictures that overlap at least two parametric model-based partitions are a weighted line (respective partition, maximum hierarchy level, first maximum region size) ar average from predictions of the at least two parametric model-based partitions .
US10250913B2 CLAIM 5 . The decoder according to claim 4 , wherein the divider is configured to , in accordance with the partition rules associated with the first and higher-order hierarchy levels , sub-divide into sub-regions of equal size , such that there are an equal number of sub-regions at each hierarchy level (high level syntax) .	US20090196342A1 CLAIM 8 . The apparatus of claim 1 , wherein said encoder performs explicit or implicit coding of a precision of parameters of at least one of the at least one parametric model and the at least one curve using at least one high level syntax (hierarchy level) element .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision information includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level (high level syntax) is sub-divided .	US20090196342A1 CLAIM 8 . The apparatus of claim 1 , wherein said encoder performs explicit or implicit coding of a precision of parameters of at least one of the at least one parametric model and the at least one curve using at least one high level syntax (hierarchy level) element .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level (high level syntax) from the data stream .	US20090196342A1 CLAIM 8 . The apparatus of claim 1 , wherein said encoder performs explicit or implicit coding of a precision of parameters of at least one of the at least one parametric model and the at least one curve using at least one high level syntax (hierarchy level) element . US20090196342A1 CLAIM 20 . The apparatus of claim 16 , wherein pixels of at least one of the pictures that overlap at least two parametric model-based partitions are a weighted line (respective partition, maximum hierarchy level, first maximum region size) ar average from predictions of the at least two parametric model-based partitions .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements (syntax element, video coding) associated with the first or second set of sub-regions from the data stream in a depth-first traversal order .	US20090196342A1 CLAIM 8 . The apparatus of claim 1 , wherein said encoder performs explicit or implicit coding of a precision of parameters of at least one of the at least one parametric model and the at least one curve using at least one high level syntax element (syntax elements) . US20090196342A1 CLAIM 15 . The apparatus of claim 1 , wherein said encoder is an extended version of an existing hybrid predictive encoder of an existing video coding (syntax elements) standard or video coding recommendation .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements (syntax element, video coding) of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20090196342A1 CLAIM 8 . The apparatus of claim 1 , wherein said encoder performs explicit or implicit coding of a precision of parameters of at least one of the at least one parametric model and the at least one curve using at least one high level syntax element (syntax elements) . US20090196342A1 CLAIM 15 . The apparatus of claim 1 , wherein said encoder is an extended version of an existing hybrid predictive encoder of an existing video coding (syntax elements) standard or video coding recommendation .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding (deblocking filtering) to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	US20090196342A1 CLAIM 26 . The apparatus of claim 16 , wherein said encoder applies at least one of deblocking filtering (transform coding) and reference frame filtering adapted to handle transform-size blocks affected by at least one parametric model-based partition due to non-tree-based partitioning of the at least one of the macroblocks and the sub-macroblocks when parametric model-based partition modes are used , and wherein the deblocking filtering and the reference frame filtering is dependent upon at least one of whichever one of the at least one parametric model-based partition is used and a selected shape of the at least one parametric model-based partition .
US10250913B2 CLAIM 11 . The decoder according to claim 1 , wherein the recursive multi-tree partitioning includes a quadtree partitioning (based partitioning) technique .	US20090196342A1 CLAIM 26 . The apparatus of claim 16 , wherein said encoder applies at least one of deblocking filtering and reference frame filtering adapted to handle transform-size blocks affected by at least one parametric model-based partition due to non-tree-based partitioning (quadtree partitioning) of the at least one of the macroblocks and the sub-macroblocks when parametric model-based partition modes are used , and wherein the deblocking filtering and the reference frame filtering is dependent upon at least one of whichever one of the at least one parametric model-based partition is used and a selected shape of the at least one parametric model-based partition .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level (high level syntax) , wherein the first maximum region size (d line) and the first subdivision information are associated with prediction coding (spatial neighboring block) and the second maximum region size and the second subdivision information are associated with transform coding (deblocking filtering) ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20090196342A1 CLAIM 8 . The apparatus of claim 1 , wherein said encoder performs explicit or implicit coding of a precision of parameters of at least one of the at least one parametric model and the at least one curve using at least one high level syntax (hierarchy level) element . US20090196342A1 CLAIM 12 . The apparatus of claim 1 , wherein predictor data , associated with at least one partition of at least one of the pictures , is predicted from at least one of spatial neighboring block (prediction coding) s and temporal neighboring blocks . US20090196342A1 CLAIM 20 . The apparatus of claim 16 , wherein pixels of at least one of the pictures that overlap at least two parametric model-based partitions are a weighted line (respective partition, maximum hierarchy level, first maximum region size) ar average from predictions of the at least two parametric model-based partitions . US20090196342A1 CLAIM 26 . The apparatus of claim 16 , wherein said encoder applies at least one of deblocking filtering (transform coding) and reference frame filtering adapted to handle transform-size blocks affected by at least one parametric model-based partition due to non-tree-based partitioning of the at least one of the macroblocks and the sub-macroblocks when parametric model-based partition modes are used , and wherein the deblocking filtering and the reference frame filtering is dependent upon at least one of whichever one of the at least one parametric model-based partition is used and a selected shape of the at least one parametric model-based partition .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size (d line) , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level (high level syntax) ; and a data stream generator configured to : encode the array of information samples using prediction coding (spatial neighboring block) in accordance with the first set of sub-regions and transform coding (deblocking filtering) in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20090196342A1 CLAIM 8 . The apparatus of claim 1 , wherein said encoder performs explicit or implicit coding of a precision of parameters of at least one of the at least one parametric model and the at least one curve using at least one high level syntax (hierarchy level) element . US20090196342A1 CLAIM 12 . The apparatus of claim 1 , wherein predictor data , associated with at least one partition of at least one of the pictures , is predicted from at least one of spatial neighboring block (prediction coding) s and temporal neighboring blocks . US20090196342A1 CLAIM 20 . The apparatus of claim 16 , wherein pixels of at least one of the pictures that overlap at least two parametric model-based partitions are a weighted line (respective partition, maximum hierarchy level, first maximum region size) ar average from predictions of the at least two parametric model-based partitions . US20090196342A1 CLAIM 26 . The apparatus of claim 16 , wherein said encoder applies at least one of deblocking filtering (transform coding) and reference frame filtering adapted to handle transform-size blocks affected by at least one parametric model-based partition due to non-tree-based partitioning of the at least one of the macroblocks and the sub-macroblocks when parametric model-based partition modes are used , and wherein the deblocking filtering and the reference frame filtering is dependent upon at least one of whichever one of the at least one parametric model-based partition is used and a selected shape of the at least one parametric model-based partition .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size (d line) ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level (high level syntax) ; encoding the array of information samples using prediction coding (spatial neighboring block) in accordance with the first set of sub-regions and transform coding (deblocking filtering) in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20090196342A1 CLAIM 8 . The apparatus of claim 1 , wherein said encoder performs explicit or implicit coding of a precision of parameters of at least one of the at least one parametric model and the at least one curve using at least one high level syntax (hierarchy level) element . US20090196342A1 CLAIM 12 . The apparatus of claim 1 , wherein predictor data , associated with at least one partition of at least one of the pictures , is predicted from at least one of spatial neighboring block (prediction coding) s and temporal neighboring blocks . US20090196342A1 CLAIM 20 . The apparatus of claim 16 , wherein pixels of at least one of the pictures that overlap at least two parametric model-based partitions are a weighted line (respective partition, maximum hierarchy level, first maximum region size) ar average from predictions of the at least two parametric model-based partitions . US20090196342A1 CLAIM 26 . The apparatus of claim 16 , wherein said encoder applies at least one of deblocking filtering (transform coding) and reference frame filtering adapted to handle transform-size blocks affected by at least one parametric model-based partition due to non-tree-based partitioning of the at least one of the macroblocks and the sub-macroblocks when parametric model-based partition modes are used , and wherein the deblocking filtering and the reference frame filtering is dependent upon at least one of whichever one of the at least one parametric model-based partition is used and a selected shape of the at least one parametric model-based partition .

CN101106711A

Filed: 2007-07-05 Issued: 2008-01-16

基于码率预分配的jpeg2000自适应率控制系统及方法

(Original Assignee) 西安电子科技大学

李云松, 孔繁锵, 王柯俨, 吴成柯, 刘凯, 雷杰, 周有喜, 汪美珠

US10250913B2
CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision (模块进行) of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .

CN101106711A
CLAIM 1 . 一种基于码率预分配的JPEG2000自适应码率控制编码系统，包括：预处理、小波变换、量化，T1编码器、T2编码器，该T1编码器由比特平面+MQ编码器组成，该T2编码器由优化截取、码流组织组成，其特征在于T1编码器中增设有熵估计模块，T2编码器中增设有码率分配模块和编码深度控制模块；原始图像经预处理、小波变换和量化后的码块分两路输出，一路直接进入比特平面+MQ编码器，另一路通过熵估计模块估计出每个码块的熵，送入码率分配模块进行 (intermediate subdivision) 码率分配，并通过编码深度控制模块将每个码块的码率反馈给比特平面+MQ编码器，进行码块比特平面编码后，再反馈给编码深度控制模块确定每个码块的编码输出码流，并对该输出码流进行优化截取和码流组织，输出最终码流。

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20080298694A1 Filed: 2007-06-22 Issued: 2008-12-04 Method for Coding RGB Color Space Signal (Original Assignee) Korea Electronics Technology Institute (Current Assignee) Korea Electronics Technology Institute Yong-Hwan Kim, Ji-Ho Park, Byeong-Ho Choi, Je-woo Kim, Joonki Paik
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding (residual information, coding one) and the second maximum region size (low pass) and the second subdivision information are associated with transform coding (color space) ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20080298694A1 CLAIM 1 . A method for encoding an RGB color space (spatial domain, transform coding, spatial domain transform coding) signal , comprising steps of : (a) encoding a base plane having a color plane id of a first value using an independent mode ; and (b) encoding one (quadtree partitioning, prediction coding, quadtree partitioning technique) or more enhanced plane having the color plane id of a second value by referring to the base plane . US20080298694A1 CLAIM 7 . The method in accordance with claim 6 , wherein the step (b) comprises : (b-1) encoding the current macroblock using an intra prediction mode of the base plane ; and (b-2) encoding a difference between a residual information (quadtree partitioning, prediction coding, quadtree partitioning technique) generated by encoding the current macroblock and a residual information generated by encoding the reference macroblock . US20080298694A1 CLAIM 8 . The method in accordance with claim 7 , further comprising subjecting the residual information generated by encoding the reference macroblock to a low pass (second maximum region size) filtering in a vertical direction , a horizontal direction or a DC direction .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set of root regions such that the first set of root regions are rectangular blocks (reference index) of a size determined by the first maximum region size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	US20080298694A1 CLAIM 15 . The method in accordance with claim 1 , wherein a reference macroblock is an inter macroblock in an inter base plane macroblock mode , and a current macroblock is encoded using a reference index (rectangular blocks) of the reference macroblock and using a motion vector as a prediction value .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level (discrete cosine transform) according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20080298694A1 CLAIM 11 . The method in accordance with claim 10 , wherein a discrete cosine transform (first hierarchy level) of the current macroblock is carried out in a manner that a block size of the discrete cosine transform of the current macroblock is same as that of the reference macroblock .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding (color space) to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	US20080298694A1 CLAIM 1 . A method for encoding an RGB color space (spatial domain, transform coding, spatial domain transform coding) signal , comprising steps of : (a) encoding a base plane having a color plane id of a first value using an independent mode ; and (b) encoding one or more enhanced plane having the color plane id of a second value by referring to the base plane .
US10250913B2 CLAIM 11 . The decoder according to claim 1 , wherein the recursive multi-tree partitioning includes a quadtree partitioning (residual information, coding one) technique .	US20080298694A1 CLAIM 1 . A method for encoding an RGB color space signal , comprising steps of : (a) encoding a base plane having a color plane id of a first value using an independent mode ; and (b) encoding one (quadtree partitioning, prediction coding, quadtree partitioning technique) or more enhanced plane having the color plane id of a second value by referring to the base plane . US20080298694A1 CLAIM 7 . The method in accordance with claim 6 , wherein the step (b) comprises : (b-1) encoding the current macroblock using an intra prediction mode of the base plane ; and (b-2) encoding a difference between a residual information (quadtree partitioning, prediction coding, quadtree partitioning technique) generated by encoding the current macroblock and a residual information generated by encoding the reference macroblock .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding (residual information, coding one) and the second maximum region size (low pass) and the second subdivision information are associated with transform coding (color space) ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20080298694A1 CLAIM 1 . A method for encoding an RGB color space (spatial domain, transform coding, spatial domain transform coding) signal , comprising steps of : (a) encoding a base plane having a color plane id of a first value using an independent mode ; and (b) encoding one (quadtree partitioning, prediction coding, quadtree partitioning technique) or more enhanced plane having the color plane id of a second value by referring to the base plane . US20080298694A1 CLAIM 7 . The method in accordance with claim 6 , wherein the step (b) comprises : (b-1) encoding the current macroblock using an intra prediction mode of the base plane ; and (b-2) encoding a difference between a residual information (quadtree partitioning, prediction coding, quadtree partitioning technique) generated by encoding the current macroblock and a residual information generated by encoding the reference macroblock . US20080298694A1 CLAIM 8 . The method in accordance with claim 7 , further comprising subjecting the residual information generated by encoding the reference macroblock to a low pass (second maximum region size) filtering in a vertical direction , a horizontal direction or a DC direction .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size (low pass) , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding (residual information, coding one) in accordance with the first set of sub-regions and transform coding (color space) in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20080298694A1 CLAIM 1 . A method for encoding an RGB color space (spatial domain, transform coding, spatial domain transform coding) signal , comprising steps of : (a) encoding a base plane having a color plane id of a first value using an independent mode ; and (b) encoding one (quadtree partitioning, prediction coding, quadtree partitioning technique) or more enhanced plane having the color plane id of a second value by referring to the base plane . US20080298694A1 CLAIM 7 . The method in accordance with claim 6 , wherein the step (b) comprises : (b-1) encoding the current macroblock using an intra prediction mode of the base plane ; and (b-2) encoding a difference between a residual information (quadtree partitioning, prediction coding, quadtree partitioning technique) generated by encoding the current macroblock and a residual information generated by encoding the reference macroblock . US20080298694A1 CLAIM 8 . The method in accordance with claim 7 , further comprising subjecting the residual information generated by encoding the reference macroblock to a low pass (second maximum region size) filtering in a vertical direction , a horizontal direction or a DC direction .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size (low pass) ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding (residual information, coding one) in accordance with the first set of sub-regions and transform coding (color space) in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20080298694A1 CLAIM 1 . A method for encoding an RGB color space (spatial domain, transform coding, spatial domain transform coding) signal , comprising steps of : (a) encoding a base plane having a color plane id of a first value using an independent mode ; and (b) encoding one (quadtree partitioning, prediction coding, quadtree partitioning technique) or more enhanced plane having the color plane id of a second value by referring to the base plane . US20080298694A1 CLAIM 7 . The method in accordance with claim 6 , wherein the step (b) comprises : (b-1) encoding the current macroblock using an intra prediction mode of the base plane ; and (b-2) encoding a difference between a residual information (quadtree partitioning, prediction coding, quadtree partitioning technique) generated by encoding the current macroblock and a residual information generated by encoding the reference macroblock . US20080298694A1 CLAIM 8 . The method in accordance with claim 7 , further comprising subjecting the residual information generated by encoding the reference macroblock to a low pass (second maximum region size) filtering in a vertical direction , a horizontal direction or a DC direction .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	JP2008311781A Filed: 2007-06-12 Issued: 2008-12-25 動画像符号化装置、動画像復号化装置、動画像符号化方法、動画像復号化方法、動画像符号化プログラム及び動画像復号化プログラム (Original Assignee) Ntt Docomo Inc; 株式会社エヌ・ティ・ティ・ドコモ Chunsen Bun, Sadaatsu Kato, Toshiro Kawahara, Junya Takigami, チュンセンブン, 禎篤加藤, 敏朗河原, 順也瀧上
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy (復元ステップ) level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	JP2008311781A CLAIM 1 フレーム (maximum hierarchy level) 画像信号の時間系列で構成される入力動画像信号を複数の領域に分割する領域分割手段と、前記領域分割手段により分割された領域のうちの処理対象領域に対する動きベクトルである第１動きベクトルを検出する動き検出手段と、前記処理対象領域に対する予測信号を生成する予測信号生成手段と、前記予測信号生成手段により生成された予測信号と前記処理対象領域の画素信号との残差信号を生成する残差信号生成手段と、前記残差信号生成手段により生成された前記残差信号及び前記動き検出手段により検出された第１動きベクトルを符号化して圧縮データを生成する符号化手段と、を備え、前記予測信号生成手段は、前記動き検出手段により検出された第１動きベクトルに基づいて、前記処理対象領域が区分された複数の小領域に対する動きベクトルである第２動きベクトルを生成して、生成した第２動きベクトルを用いて当該小領域に対する予測信号を生成することを特徴とする動画像符号化装置。 JP2008311781A CLAIM 13 動画像信号の圧縮データの中から、当該動画像信号を構成する処理対象領域に関する残差信号と第１動きベクトルとを抽出するデータ抽出ステップと、前記データ抽出ステップにおいて抽出された前記処理対象領域に関する残差信号を再生残差信号に復元する残差信号復元ステップ (maximum hierarchy) と、前記データ抽出ステップにおいて抽出された第１動きベクトルに基づいて、前記処理対象領域に対する予測信号を生成する予測信号生成ステップと、前記予測信号生成ステップにより生成された予測信号に前記残差信号復元ステップにおいて復元された再生残差信号を加算することによって、前記処理対象領域の画素信号を復元する画像復元ステップと、を含み、前記予測信号生成ステップにおいて、前記データ抽出ステップにおいて抽出された前記処理対象領域の第１動きベクトルに基づいて、前記処理対象領域が区分された複数の当該小領域に対する動きベクトルである第２動きベクトルを生成して、生成した第２動きベクトルを用いて当該小領域に対する予測信号を生成することを特徴とする動画像復号化方法。
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy (復元ステップ) level is reached .	JP2008311781A CLAIM 1 フレーム (maximum hierarchy level) 画像信号の時間系列で構成される入力動画像信号を複数の領域に分割する領域分割手段と、前記領域分割手段により分割された領域のうちの処理対象領域に対する動きベクトルである第１動きベクトルを検出する動き検出手段と、前記処理対象領域に対する予測信号を生成する予測信号生成手段と、前記予測信号生成手段により生成された予測信号と前記処理対象領域の画素信号との残差信号を生成する残差信号生成手段と、前記残差信号生成手段により生成された前記残差信号及び前記動き検出手段により検出された第１動きベクトルを符号化して圧縮データを生成する符号化手段と、を備え、前記予測信号生成手段は、前記動き検出手段により検出された第１動きベクトルに基づいて、前記処理対象領域が区分された複数の小領域に対する動きベクトルである第２動きベクトルを生成して、生成した第２動きベクトルを用いて当該小領域に対する予測信号を生成することを特徴とする動画像符号化装置。 JP2008311781A CLAIM 13 動画像信号の圧縮データの中から、当該動画像信号を構成する処理対象領域に関する残差信号と第１動きベクトルとを抽出するデータ抽出ステップと、前記データ抽出ステップにおいて抽出された前記処理対象領域に関する残差信号を再生残差信号に復元する残差信号復元ステップ (maximum hierarchy) と、前記データ抽出ステップにおいて抽出された第１動きベクトルに基づいて、前記処理対象領域に対する予測信号を生成する予測信号生成ステップと、前記予測信号生成ステップにより生成された予測信号に前記残差信号復元ステップにおいて復元された再生残差信号を加算することによって、前記処理対象領域の画素信号を復元する画像復元ステップと、を含み、前記予測信号生成ステップにおいて、前記データ抽出ステップにおいて抽出された前記処理対象領域の第１動きベクトルに基づいて、前記処理対象領域が区分された複数の当該小領域に対する動きベクトルである第２動きベクトルを生成して、生成した第２動きベクトルを用いて当該小領域に対する予測信号を生成することを特徴とする動画像復号化方法。
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy (復元ステップ) level from the data stream .	JP2008311781A CLAIM 1 フレーム (maximum hierarchy level) 画像信号の時間系列で構成される入力動画像信号を複数の領域に分割する領域分割手段と、前記領域分割手段により分割された領域のうちの処理対象領域に対する動きベクトルである第１動きベクトルを検出する動き検出手段と、前記処理対象領域に対する予測信号を生成する予測信号生成手段と、前記予測信号生成手段により生成された予測信号と前記処理対象領域の画素信号との残差信号を生成する残差信号生成手段と、前記残差信号生成手段により生成された前記残差信号及び前記動き検出手段により検出された第１動きベクトルを符号化して圧縮データを生成する符号化手段と、を備え、前記予測信号生成手段は、前記動き検出手段により検出された第１動きベクトルに基づいて、前記処理対象領域が区分された複数の小領域に対する動きベクトルである第２動きベクトルを生成して、生成した第２動きベクトルを用いて当該小領域に対する予測信号を生成することを特徴とする動画像符号化装置。 JP2008311781A CLAIM 13 動画像信号の圧縮データの中から、当該動画像信号を構成する処理対象領域に関する残差信号と第１動きベクトルとを抽出するデータ抽出ステップと、前記データ抽出ステップにおいて抽出された前記処理対象領域に関する残差信号を再生残差信号に復元する残差信号復元ステップ (maximum hierarchy) と、前記データ抽出ステップにおいて抽出された第１動きベクトルに基づいて、前記処理対象領域に対する予測信号を生成する予測信号生成ステップと、前記予測信号生成ステップにより生成された予測信号に前記残差信号復元ステップにおいて復元された再生残差信号を加算することによって、前記処理対象領域の画素信号を復元する画像復元ステップと、を含み、前記予測信号生成ステップにおいて、前記データ抽出ステップにおいて抽出された前記処理対象領域の第１動きベクトルに基づいて、前記処理対象領域が区分された複数の当該小領域に対する動きベクトルである第２動きベクトルを生成して、生成した第２動きベクトルを用いて当該小領域に対する予測信号を生成することを特徴とする動画像復号化方法。
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements (か一方) associated with the first or second set of sub-regions from the data stream in a depth-first traversal order .	JP2008311781A CLAIM 4 前記予測信号生成手段は、前記第１動きベクトルと前記第２動きベクトルとから何れか一方 (syntax elements) を選択し、選択された動きベクトルを用いて前記処理対象領域の予測信号を生成することを特徴とした請求項１〜３の何れか一項に記載の動画像符号化装置。
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements (か一方) of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	JP2008311781A CLAIM 4 前記予測信号生成手段は、前記第１動きベクトルと前記第２動きベクトルとから何れか一方 (syntax elements) を選択し、選択された動きベクトルを用いて前記処理対象領域の予測信号を生成することを特徴とした請求項１〜３の何れか一項に記載の動画像符号化装置。
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy (復元ステップ) level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	JP2008311781A CLAIM 1 フレーム (maximum hierarchy level) 画像信号の時間系列で構成される入力動画像信号を複数の領域に分割する領域分割手段と、前記領域分割手段により分割された領域のうちの処理対象領域に対する動きベクトルである第１動きベクトルを検出する動き検出手段と、前記処理対象領域に対する予測信号を生成する予測信号生成手段と、前記予測信号生成手段により生成された予測信号と前記処理対象領域の画素信号との残差信号を生成する残差信号生成手段と、前記残差信号生成手段により生成された前記残差信号及び前記動き検出手段により検出された第１動きベクトルを符号化して圧縮データを生成する符号化手段と、を備え、前記予測信号生成手段は、前記動き検出手段により検出された第１動きベクトルに基づいて、前記処理対象領域が区分された複数の小領域に対する動きベクトルである第２動きベクトルを生成して、生成した第２動きベクトルを用いて当該小領域に対する予測信号を生成することを特徴とする動画像符号化装置。 JP2008311781A CLAIM 13 動画像信号の圧縮データの中から、当該動画像信号を構成する処理対象領域に関する残差信号と第１動きベクトルとを抽出するデータ抽出ステップと、前記データ抽出ステップにおいて抽出された前記処理対象領域に関する残差信号を再生残差信号に復元する残差信号復元ステップ (maximum hierarchy) と、前記データ抽出ステップにおいて抽出された第１動きベクトルに基づいて、前記処理対象領域に対する予測信号を生成する予測信号生成ステップと、前記予測信号生成ステップにより生成された予測信号に前記残差信号復元ステップにおいて復元された再生残差信号を加算することによって、前記処理対象領域の画素信号を復元する画像復元ステップと、を含み、前記予測信号生成ステップにおいて、前記データ抽出ステップにおいて抽出された前記処理対象領域の第１動きベクトルに基づいて、前記処理対象領域が区分された複数の当該小領域に対する動きベクトルである第２動きベクトルを生成して、生成した第２動きベクトルを用いて当該小領域に対する予測信号を生成することを特徴とする動画像復号化方法。
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy (復元ステップ) level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	JP2008311781A CLAIM 1 フレーム (maximum hierarchy level) 画像信号の時間系列で構成される入力動画像信号を複数の領域に分割する領域分割手段と、前記領域分割手段により分割された領域のうちの処理対象領域に対する動きベクトルである第１動きベクトルを検出する動き検出手段と、前記処理対象領域に対する予測信号を生成する予測信号生成手段と、前記予測信号生成手段により生成された予測信号と前記処理対象領域の画素信号との残差信号を生成する残差信号生成手段と、前記残差信号生成手段により生成された前記残差信号及び前記動き検出手段により検出された第１動きベクトルを符号化して圧縮データを生成する符号化手段と、を備え、前記予測信号生成手段は、前記動き検出手段により検出された第１動きベクトルに基づいて、前記処理対象領域が区分された複数の小領域に対する動きベクトルである第２動きベクトルを生成して、生成した第２動きベクトルを用いて当該小領域に対する予測信号を生成することを特徴とする動画像符号化装置。 JP2008311781A CLAIM 13 動画像信号の圧縮データの中から、当該動画像信号を構成する処理対象領域に関する残差信号と第１動きベクトルとを抽出するデータ抽出ステップと、前記データ抽出ステップにおいて抽出された前記処理対象領域に関する残差信号を再生残差信号に復元する残差信号復元ステップ (maximum hierarchy) と、前記データ抽出ステップにおいて抽出された第１動きベクトルに基づいて、前記処理対象領域に対する予測信号を生成する予測信号生成ステップと、前記予測信号生成ステップにより生成された予測信号に前記残差信号復元ステップにおいて復元された再生残差信号を加算することによって、前記処理対象領域の画素信号を復元する画像復元ステップと、を含み、前記予測信号生成ステップにおいて、前記データ抽出ステップにおいて抽出された前記処理対象領域の第１動きベクトルに基づいて、前記処理対象領域が区分された複数の当該小領域に対する動きベクトルである第２動きベクトルを生成して、生成した第２動きベクトルを用いて当該小領域に対する予測信号を生成することを特徴とする動画像復号化方法。
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy (復元ステップ) level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	JP2008311781A CLAIM 1 フレーム (maximum hierarchy level) 画像信号の時間系列で構成される入力動画像信号を複数の領域に分割する領域分割手段と、前記領域分割手段により分割された領域のうちの処理対象領域に対する動きベクトルである第１動きベクトルを検出する動き検出手段と、前記処理対象領域に対する予測信号を生成する予測信号生成手段と、前記予測信号生成手段により生成された予測信号と前記処理対象領域の画素信号との残差信号を生成する残差信号生成手段と、前記残差信号生成手段により生成された前記残差信号及び前記動き検出手段により検出された第１動きベクトルを符号化して圧縮データを生成する符号化手段と、を備え、前記予測信号生成手段は、前記動き検出手段により検出された第１動きベクトルに基づいて、前記処理対象領域が区分された複数の小領域に対する動きベクトルである第２動きベクトルを生成して、生成した第２動きベクトルを用いて当該小領域に対する予測信号を生成することを特徴とする動画像符号化装置。 JP2008311781A CLAIM 13 動画像信号の圧縮データの中から、当該動画像信号を構成する処理対象領域に関する残差信号と第１動きベクトルとを抽出するデータ抽出ステップと、前記データ抽出ステップにおいて抽出された前記処理対象領域に関する残差信号を再生残差信号に復元する残差信号復元ステップ (maximum hierarchy) と、前記データ抽出ステップにおいて抽出された第１動きベクトルに基づいて、前記処理対象領域に対する予測信号を生成する予測信号生成ステップと、前記予測信号生成ステップにより生成された予測信号に前記残差信号復元ステップにおいて復元された再生残差信号を加算することによって、前記処理対象領域の画素信号を復元する画像復元ステップと、を含み、前記予測信号生成ステップにおいて、前記データ抽出ステップにおいて抽出された前記処理対象領域の第１動きベクトルに基づいて、前記処理対象領域が区分された複数の当該小領域に対する動きベクトルである第２動きベクトルを生成して、生成した第２動きベクトルを用いて当該小領域に対する予測信号を生成することを特徴とする動画像復号化方法。

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20070248274A1 Filed: 2007-05-22 Issued: 2007-10-25 Systems and methods using parameter selection in data compression and decompression (Original Assignee) Qualcomm Inc (Current Assignee) Qualcomm Inc Senthil Govindaswamy, Judith LaRocca, Jeff Levin
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition (sound system) rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20070248274A1 CLAIM 6 . The apparatus of claim 5 , further comprising at least one sound system (respective partition) configured to play decompressed audio information .
US10250913B2 CLAIM 15 . A non-transitory computer readable digital storage medium having stored thereon a computer program (computer program) having a program code for performing , when running on a computer , a method according to claim 12 .	US20070248274A1 CLAIM 7 . A computer-readable medium encoded with a computer program (computer program) , the computer program embodying executable instructions , the executable instructions comprising : instructions to display decompressed image information ; and instructions to decompress compressed image information into the decompressed image information , the instructions to decompress including : instructions to decode an address of data within a variable length decoded data block into Y and X indices based on a Y and X index system ; instructions to select a quantization parameter based at least on block size assignment information and the decoded address of the data within the variable length decoded data block ; instructions to inverse quantize the variable length decoded data block using the selected quantization parameter .
US10250913B2 CLAIM 16 . A non-transitory computer readable digital storage medium having stored thereon a computer program (computer program) having a program code for performing , when running on a computer , a method according to claim 14 .	US20070248274A1 CLAIM 7 . A computer-readable medium encoded with a computer program (computer program) , the computer program embodying executable instructions , the executable instructions comprising : instructions to display decompressed image information ; and instructions to decompress compressed image information into the decompressed image information , the instructions to decompress including : instructions to decode an address of data within a variable length decoded data block into Y and X indices based on a Y and X index system ; instructions to select a quantization parameter based at least on block size assignment information and the decoded address of the data within the variable length decoded data block ; instructions to inverse quantize the variable length decoded data block using the selected quantization parameter .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	CN101018333A Filed: 2007-02-09 Issued: 2007-08-15 空域可分级信噪比精细可分级视频编码方法 (Original Assignee) 上海大学; 上海广电（集团）有限公司中央研究院张兆扬, 沈礼权, 王国中
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level (一比特) (一比特) wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN101018333A CLAIM 3 . 根据权利要求1所述的空域可分级信噪比精细可分级视频编码方法，其特征在于所述的低分辨率下的基本层和增强层编码是：首先对低分辨率下视频进行编码，生成低分辨率基本层视频流，然后对低分辨率下的视频帧与它的重建帧的残差进行比特平面编码，得到信噪比可伸缩逐次精细化质量层；其步骤是：(1)对低分辨率下的视频基于分块运动补偿和DCT变换的编码方式进行编码，生成基本层视频流；(2)计算低分辨率下的视频帧与其重建帧，得出它们之间的残差系数。(3)对残差系数进行DCT变换、量化；(4)将量化后的DCT系数展开成二进制数，相同的位构成一层比特平面；(5)将每一层比特平面转化为RUN-EOP符号；对每一比特 (maximum hierarchy level, first hierarchy level, hierarchy level) 平面进行扫描，每遇到一个“1”，计算该“1”前面，前一个“1”后面“0”的个数作为RUN值，如果为最后一个“1”，则将EOP置为“1”，否则置为“0”；(6)在进行RUN-EOP后，对每个符号位进行编码，每个符号位只进行一次编码，而且按照从高层到底层第一个非零值之后放入；最后生成低分辨率下的增强层视频流。
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level (一比特) (一比特) according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level (一比特) is reached .	CN101018333A CLAIM 3 . 根据权利要求1所述的空域可分级信噪比精细可分级视频编码方法，其特征在于所述的低分辨率下的基本层和增强层编码是：首先对低分辨率下视频进行编码，生成低分辨率基本层视频流，然后对低分辨率下的视频帧与它的重建帧的残差进行比特平面编码，得到信噪比可伸缩逐次精细化质量层；其步骤是：(1)对低分辨率下的视频基于分块运动补偿和DCT变换的编码方式进行编码，生成基本层视频流；(2)计算低分辨率下的视频帧与其重建帧，得出它们之间的残差系数。(3)对残差系数进行DCT变换、量化；(4)将量化后的DCT系数展开成二进制数，相同的位构成一层比特平面；(5)将每一层比特平面转化为RUN-EOP符号；对每一比特 (maximum hierarchy level, first hierarchy level, hierarchy level) 平面进行扫描，每遇到一个“1”，计算该“1”前面，前一个“1”后面“0”的个数作为RUN值，如果为最后一个“1”，则将EOP置为“1”，否则置为“0”；(6)在进行RUN-EOP后，对每个符号位进行编码，每个符号位只进行一次编码，而且按照从高层到底层第一个非零值之后放入；最后生成低分辨率下的增强层视频流。
US10250913B2 CLAIM 5 . The decoder according to claim 4 , wherein the divider is configured to , in accordance with the partition rules associated with the first and higher-order hierarchy levels , sub-divide into sub-regions of equal size , such that there are an equal number of sub-regions at each hierarchy level (一比特) .	CN101018333A CLAIM 3 . 根据权利要求1所述的空域可分级信噪比精细可分级视频编码方法，其特征在于所述的低分辨率下的基本层和增强层编码是：首先对低分辨率下视频进行编码，生成低分辨率基本层视频流，然后对低分辨率下的视频帧与它的重建帧的残差进行比特平面编码，得到信噪比可伸缩逐次精细化质量层；其步骤是：(1)对低分辨率下的视频基于分块运动补偿和DCT变换的编码方式进行编码，生成基本层视频流；(2)计算低分辨率下的视频帧与其重建帧，得出它们之间的残差系数。(3)对残差系数进行DCT变换、量化；(4)将量化后的DCT系数展开成二进制数，相同的位构成一层比特平面；(5)将每一层比特平面转化为RUN-EOP符号；对每一比特 (maximum hierarchy level, first hierarchy level, hierarchy level) 平面进行扫描，每遇到一个“1”，计算该“1”前面，前一个“1”后面“0”的个数作为RUN值，如果为最后一个“1”，则将EOP置为“1”，否则置为“0”；(6)在进行RUN-EOP后，对每个符号位进行编码，每个符号位只进行一次编码，而且按照从高层到底层第一个非零值之后放入；最后生成低分辨率下的增强层视频流。
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision information includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level (一比特) is sub-divided .	CN101018333A CLAIM 3 . 根据权利要求1所述的空域可分级信噪比精细可分级视频编码方法，其特征在于所述的低分辨率下的基本层和增强层编码是：首先对低分辨率下视频进行编码，生成低分辨率基本层视频流，然后对低分辨率下的视频帧与它的重建帧的残差进行比特平面编码，得到信噪比可伸缩逐次精细化质量层；其步骤是：(1)对低分辨率下的视频基于分块运动补偿和DCT变换的编码方式进行编码，生成基本层视频流；(2)计算低分辨率下的视频帧与其重建帧，得出它们之间的残差系数。(3)对残差系数进行DCT变换、量化；(4)将量化后的DCT系数展开成二进制数，相同的位构成一层比特平面；(5)将每一层比特平面转化为RUN-EOP符号；对每一比特 (maximum hierarchy level, first hierarchy level, hierarchy level) 平面进行扫描，每遇到一个“1”，计算该“1”前面，前一个“1”后面“0”的个数作为RUN值，如果为最后一个“1”，则将EOP置为“1”，否则置为“0”；(6)在进行RUN-EOP后，对每个符号位进行编码，每个符号位只进行一次编码，而且按照从高层到底层第一个非零值之后放入；最后生成低分辨率下的增强层视频流。
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level (一比特) (一比特) from the data stream .	CN101018333A CLAIM 3 . 根据权利要求1所述的空域可分级信噪比精细可分级视频编码方法，其特征在于所述的低分辨率下的基本层和增强层编码是：首先对低分辨率下视频进行编码，生成低分辨率基本层视频流，然后对低分辨率下的视频帧与它的重建帧的残差进行比特平面编码，得到信噪比可伸缩逐次精细化质量层；其步骤是：(1)对低分辨率下的视频基于分块运动补偿和DCT变换的编码方式进行编码，生成基本层视频流；(2)计算低分辨率下的视频帧与其重建帧，得出它们之间的残差系数。(3)对残差系数进行DCT变换、量化；(4)将量化后的DCT系数展开成二进制数，相同的位构成一层比特平面；(5)将每一层比特平面转化为RUN-EOP符号；对每一比特 (maximum hierarchy level, first hierarchy level, hierarchy level) 平面进行扫描，每遇到一个“1”，计算该“1”前面，前一个“1”后面“0”的个数作为RUN值，如果为最后一个“1”，则将EOP置为“1”，否则置为“0”；(6)在进行RUN-EOP后，对每个符号位进行编码，每个符号位只进行一次编码，而且按照从高层到底层第一个非零值之后放入；最后生成低分辨率下的增强层视频流。
US10250913B2 CLAIM 11 . The decoder according to claim 1 , wherein the recursive multi-tree partitioning includes a quadtree partitioning (纹理信息) technique .	CN101018333A CLAIM 4 . 根据权利要求1所述的空域可分级信噪比精细可分级视频编码方法，其特征在于所述的高分辨率下的基本层编码是对高分辨率下的空间预测残差帧进行编码；其步骤是：(1)对低分辨率下的重建图像进行上采样，得到高分辨率下的图像帧的空间预测参考帧；(2)计算出高分辨率下的原始图像与空间预测参考帧的残差，得到空间预测残差帧；(3)将低分辨率下的运动矢量两倍作为高分辨率下的参考运动矢量，低分辨率下的参考帧作为选择高分辨率下的第一参考帧，在空间预测残差帧之间直接进行运动估计、运动补偿；(4)运动补偿后的残差纹理信息 (quadtree partitioning) 和运动信息经过编码，得到高分辨率下的基本层视频流。
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level (一比特) (一比特) , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN101018333A CLAIM 3 . 根据权利要求1所述的空域可分级信噪比精细可分级视频编码方法，其特征在于所述的低分辨率下的基本层和增强层编码是：首先对低分辨率下视频进行编码，生成低分辨率基本层视频流，然后对低分辨率下的视频帧与它的重建帧的残差进行比特平面编码，得到信噪比可伸缩逐次精细化质量层；其步骤是：(1)对低分辨率下的视频基于分块运动补偿和DCT变换的编码方式进行编码，生成基本层视频流；(2)计算低分辨率下的视频帧与其重建帧，得出它们之间的残差系数。(3)对残差系数进行DCT变换、量化；(4)将量化后的DCT系数展开成二进制数，相同的位构成一层比特平面；(5)将每一层比特平面转化为RUN-EOP符号；对每一比特 (maximum hierarchy level, first hierarchy level, hierarchy level) 平面进行扫描，每遇到一个“1”，计算该“1”前面，前一个“1”后面“0”的个数作为RUN值，如果为最后一个“1”，则将EOP置为“1”，否则置为“0”；(6)在进行RUN-EOP后，对每个符号位进行编码，每个符号位只进行一次编码，而且按照从高层到底层第一个非零值之后放入；最后生成低分辨率下的增强层视频流。
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level (一比特) (一比特) ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN101018333A CLAIM 3 . 根据权利要求1所述的空域可分级信噪比精细可分级视频编码方法，其特征在于所述的低分辨率下的基本层和增强层编码是：首先对低分辨率下视频进行编码，生成低分辨率基本层视频流，然后对低分辨率下的视频帧与它的重建帧的残差进行比特平面编码，得到信噪比可伸缩逐次精细化质量层；其步骤是：(1)对低分辨率下的视频基于分块运动补偿和DCT变换的编码方式进行编码，生成基本层视频流；(2)计算低分辨率下的视频帧与其重建帧，得出它们之间的残差系数。(3)对残差系数进行DCT变换、量化；(4)将量化后的DCT系数展开成二进制数，相同的位构成一层比特平面；(5)将每一层比特平面转化为RUN-EOP符号；对每一比特 (maximum hierarchy level, first hierarchy level, hierarchy level) 平面进行扫描，每遇到一个“1”，计算该“1”前面，前一个“1”后面“0”的个数作为RUN值，如果为最后一个“1”，则将EOP置为“1”，否则置为“0”；(6)在进行RUN-EOP后，对每个符号位进行编码，每个符号位只进行一次编码，而且按照从高层到底层第一个非零值之后放入；最后生成低分辨率下的增强层视频流。
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level (一比特) (一比特) ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN101018333A CLAIM 3 . 根据权利要求1所述的空域可分级信噪比精细可分级视频编码方法，其特征在于所述的低分辨率下的基本层和增强层编码是：首先对低分辨率下视频进行编码，生成低分辨率基本层视频流，然后对低分辨率下的视频帧与它的重建帧的残差进行比特平面编码，得到信噪比可伸缩逐次精细化质量层；其步骤是：(1)对低分辨率下的视频基于分块运动补偿和DCT变换的编码方式进行编码，生成基本层视频流；(2)计算低分辨率下的视频帧与其重建帧，得出它们之间的残差系数。(3)对残差系数进行DCT变换、量化；(4)将量化后的DCT系数展开成二进制数，相同的位构成一层比特平面；(5)将每一层比特平面转化为RUN-EOP符号；对每一比特 (maximum hierarchy level, first hierarchy level, hierarchy level) 平面进行扫描，每遇到一个“1”，计算该“1”前面，前一个“1”后面“0”的个数作为RUN值，如果为最后一个“1”，则将EOP置为“1”，否则置为“0”；(6)在进行RUN-EOP后，对每个符号位进行编码，每个符号位只进行一次编码，而且按照从高层到底层第一个非零值之后放入；最后生成低分辨率下的增强层视频流。

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	CN101366283A Filed: 2007-01-11 Issued: 2009-02-11 具有精细粒度空间可缩放性的视频编码 (Original Assignee) 高通股份有限公司鲍易亮, 叶琰
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information (一种视频编码方法) , information related to first and second maximum region (种方法) sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN101366283A CLAIM 1、一种视频编码方法 (video information) ，其包含：对精细粒度可缩放性(FGS)基础层进行解码以重构定义处于第一空间分辨率的视频的基础层视频块；至少部分地对一个或多个FGS增强层进行解码以重构定义处于大于或等于所述第一空间分辨率的第二空间分辨率的视频的增强层视频块；及基于由所述基础层视频块形成的第一预测块及由所述增强层视频块中的相邻像素形成的第二预测块的经加权和来预测帧内编码视频块。 CN101366283A CLAIM 40、一种方法 (second maximum region) ，其包含：对精细粒度可縮放性（FGS)基础层进行解码，所述精细粒度可缩放性（FGS) 基础层包括定义处于第一空间分辨率的视频信息的基础层视频块；至少部分地对一个或多个FGS增强层进行解码，所述一个或多个FGS增强层包括定义处于大于所述第一空间分辨率的第二空间分辨率的视频信息的增强层视频块；及在不使用从与所述各个帧内编码视频块相同层内的相同帧所推导出的视频信息的情况下预测帧内编码视频块。
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal (第一预测块) based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset of the second set of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	CN101366283A CLAIM 1、一种视频编码方法，其包含：对精细粒度可缩放性(FGS)基础层进行解码以重构定义处于第一空间分辨率的视频的基础层视频块；至少部分地对一个或多个FGS增强层进行解码以重构定义处于大于或等于所述第一空间分辨率的第二空间分辨率的视频的增强层视频块；及基于由所述基础层视频块形成的第一预测块 (prediction signal) 及由所述增强层视频块中的相邻像素形成的第二预测块的经加权和来预测帧内编码视频块。
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information (一种视频编码方法) , information related to first and second maximum region (种方法) sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN101366283A CLAIM 1、一种视频编码方法 (video information) ，其包含：对精细粒度可缩放性(FGS)基础层进行解码以重构定义处于第一空间分辨率的视频的基础层视频块；至少部分地对一个或多个FGS增强层进行解码以重构定义处于大于或等于所述第一空间分辨率的第二空间分辨率的视频的增强层视频块；及基于由所述基础层视频块形成的第一预测块及由所述增强层视频块中的相邻像素形成的第二预测块的经加权和来预测帧内编码视频块。 CN101366283A CLAIM 40、一种方法 (second maximum region) ，其包含：对精细粒度可縮放性（FGS)基础层进行解码，所述精细粒度可缩放性（FGS) 基础层包括定义处于第一空间分辨率的视频信息的基础层视频块；至少部分地对一个或多个FGS增强层进行解码，所述一个或多个FGS增强层包括定义处于大于所述第一空间分辨率的第二空间分辨率的视频信息的增强层视频块；及在不使用从与所述各个帧内编码视频块相同层内的相同帧所推导出的视频信息的情况下预测帧内编码视频块。
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information (一种视频编码方法) into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region (种方法) size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN101366283A CLAIM 1、一种视频编码方法 (video information) ，其包含：对精细粒度可缩放性(FGS)基础层进行解码以重构定义处于第一空间分辨率的视频的基础层视频块；至少部分地对一个或多个FGS增强层进行解码以重构定义处于大于或等于所述第一空间分辨率的第二空间分辨率的视频的增强层视频块；及基于由所述基础层视频块形成的第一预测块及由所述增强层视频块中的相邻像素形成的第二预测块的经加权和来预测帧内编码视频块。 CN101366283A CLAIM 40、一种方法 (second maximum region) ，其包含：对精细粒度可縮放性（FGS)基础层进行解码，所述精细粒度可缩放性（FGS) 基础层包括定义处于第一空间分辨率的视频信息的基础层视频块；至少部分地对一个或多个FGS增强层进行解码，所述一个或多个FGS增强层包括定义处于大于所述第一空间分辨率的第二空间分辨率的视频信息的增强层视频块；及在不使用从与所述各个帧内编码视频块相同层内的相同帧所推导出的视频信息的情况下预测帧内编码视频块。
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information (一种视频编码方法) into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region (种方法) size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN101366283A CLAIM 1、一种视频编码方法 (video information) ，其包含：对精细粒度可缩放性(FGS)基础层进行解码以重构定义处于第一空间分辨率的视频的基础层视频块；至少部分地对一个或多个FGS增强层进行解码以重构定义处于大于或等于所述第一空间分辨率的第二空间分辨率的视频的增强层视频块；及基于由所述基础层视频块形成的第一预测块及由所述增强层视频块中的相邻像素形成的第二预测块的经加权和来预测帧内编码视频块。 CN101366283A CLAIM 40、一种方法 (second maximum region) ，其包含：对精细粒度可縮放性（FGS)基础层进行解码，所述精细粒度可缩放性（FGS) 基础层包括定义处于第一空间分辨率的视频信息的基础层视频块；至少部分地对一个或多个FGS增强层进行解码，所述一个或多个FGS增强层包括定义处于大于所述第一空间分辨率的第二空间分辨率的视频信息的增强层视频块；及在不使用从与所述各个帧内编码视频块相同层内的相同帧所推导出的视频信息的情况下预测帧内编码视频块。

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	CN101385351A Filed: 2007-01-09 Issued: 2009-03-11 用于视频信号的层间预测方法 (Original Assignee) Lg电子株式会社全柄文, 朴胜煜, 朴志皓
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information (视频信号) , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level (水平方向) (水平方向) wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root (中的一个) region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN101385351A CLAIM 1 . 一种将基层的隔行视频信号 (video information) 用于层间预测的方法，所述方法包括以下步骤：a)将解块滤波器应用于通过交织所述隔行视频信号获得的图像；b)将所述经解块的图像分成偶和奇场分量；c)在垂直和/或水平方向 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) 上内插所述偶和奇场分量中的每一者；以及d)交织所述经内插的偶和奇场分量以获得组合的图像数据。 CN101385351A CLAIM 5 . 如权利要求1所述的方法，其特征在于，所述基层的视频信号包括含有垂直毗邻宏块对的图像，所述对中的一个 (respective root) 宏块是偶场分量宏块而另一个是奇场分量宏块。
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level (水平方向) (水平方向) according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition (不同画面) rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level (水平方向) is reached .	CN101385351A CLAIM 1 . 一种将基层的隔行视频信号用于层间预测的方法，所述方法包括以下步骤：a)将解块滤波器应用于通过交织所述隔行视频信号获得的图像；b)将所述经解块的图像分成偶和奇场分量；c)在垂直和/或水平方向 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) 上内插所述偶和奇场分量中的每一者；以及d)交织所述经内插的偶和奇场分量以获得组合的图像数据。 CN101385351A CLAIM 7 . 如权利要求1所述的方法，其特征在于，所述基层的所述视频信号中的偶和奇场分量包括在不同画面 (respective partition) 中。
US10250913B2 CLAIM 5 . The decoder according to claim 4 , wherein the divider is configured to , in accordance with the partition rules associated with the first and higher-order hierarchy levels , sub-divide into sub-regions of equal size , such that there are an equal number of sub-regions at each hierarchy level (水平方向) .	CN101385351A CLAIM 1 . 一种将基层的隔行视频信号用于层间预测的方法，所述方法包括以下步骤：a)将解块滤波器应用于通过交织所述隔行视频信号获得的图像；b)将所述经解块的图像分成偶和奇场分量；c)在垂直和/或水平方向 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) 上内插所述偶和奇场分量中的每一者；以及d)交织所述经内插的偶和奇场分量以获得组合的图像数据。
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision information includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level (水平方向) is sub-divided .	CN101385351A CLAIM 1 . 一种将基层的隔行视频信号用于层间预测的方法，所述方法包括以下步骤：a)将解块滤波器应用于通过交织所述隔行视频信号获得的图像；b)将所述经解块的图像分成偶和奇场分量；c)在垂直和/或水平方向 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) 上内插所述偶和奇场分量中的每一者；以及d)交织所述经内插的偶和奇场分量以获得组合的图像数据。
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level (水平方向) (水平方向) from the data stream .	CN101385351A CLAIM 1 . 一种将基层的隔行视频信号用于层间预测的方法，所述方法包括以下步骤：a)将解块滤波器应用于通过交织所述隔行视频信号获得的图像；b)将所述经解块的图像分成偶和奇场分量；c)在垂直和/或水平方向 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) 上内插所述偶和奇场分量中的每一者；以及d)交织所述经内插的偶和奇场分量以获得组合的图像数据。
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information (视频信号) , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level (水平方向) (水平方向) , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root (中的一个) region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN101385351A CLAIM 1 . 一种将基层的隔行视频信号 (video information) 用于层间预测的方法，所述方法包括以下步骤：a)将解块滤波器应用于通过交织所述隔行视频信号获得的图像；b)将所述经解块的图像分成偶和奇场分量；c)在垂直和/或水平方向 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) 上内插所述偶和奇场分量中的每一者；以及d)交织所述经内插的偶和奇场分量以获得组合的图像数据。 CN101385351A CLAIM 5 . 如权利要求1所述的方法，其特征在于，所述基层的视频信号包括含有垂直毗邻宏块对的图像，所述对中的一个 (respective root) 宏块是偶场分量宏块而另一个是奇场分量宏块。
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information (视频信号) into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root (中的一个) region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level (水平方向) (水平方向) ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN101385351A CLAIM 1 . 一种将基层的隔行视频信号 (video information) 用于层间预测的方法，所述方法包括以下步骤：a)将解块滤波器应用于通过交织所述隔行视频信号获得的图像；b)将所述经解块的图像分成偶和奇场分量；c)在垂直和/或水平方向 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) 上内插所述偶和奇场分量中的每一者；以及d)交织所述经内插的偶和奇场分量以获得组合的图像数据。 CN101385351A CLAIM 5 . 如权利要求1所述的方法，其特征在于，所述基层的视频信号包括含有垂直毗邻宏块对的图像，所述对中的一个 (respective root) 宏块是偶场分量宏块而另一个是奇场分量宏块。
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information (视频信号) into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root (中的一个) region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level (水平方向) (水平方向) ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN101385351A CLAIM 1 . 一种将基层的隔行视频信号 (video information) 用于层间预测的方法，所述方法包括以下步骤：a)将解块滤波器应用于通过交织所述隔行视频信号获得的图像；b)将所述经解块的图像分成偶和奇场分量；c)在垂直和/或水平方向 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) 上内插所述偶和奇场分量中的每一者；以及d)交织所述经内插的偶和奇场分量以获得组合的图像数据。 CN101385351A CLAIM 5 . 如权利要求1所述的方法，其特征在于，所述基层的视频信号包括含有垂直毗邻宏块对的图像，所述对中的一个 (respective root) 宏块是偶场分量宏块而另一个是奇场分量宏块。

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20090225846A1 Filed: 2006-12-18 Issued: 2009-09-10 Inter-Layer Motion Prediction Method (Original Assignee) Edouard Francois; Vincent Bottreau; Patrick Lopez; Vieron Jerome; Ying Chen Edouard Francois, Vincent Bottreau, Patrick Lopez, Jérome Vieron, Ying Chen
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream (data stream) representing encoded video information , information related to first and second maximum region sizes (same dimensions) , first and second subdivision (video encoder) information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set (following steps) of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding (low resolution image) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20090225846A1 CLAIM 1 . Method as part of a process of scalable video coding or decoding for generating for at least one macroblock of a high resolution image , called high resolution macroblock , at least one motion predictor from motion data associated to macroblock(s) of a low resolution image (information samples using prediction coding) , called low resolution macroblock(s) , comprising the following steps (second set) : defining a virtual structure made up of non overlapping macroblocks , called virtual base layer macroblocks , said virtual structure having same dimensions (second maximum region sizes) as said low resolution image ; identifying for said high resolution macroblock corresponding virtual base layer macroblocks in said virtual image on the basis of the location of said high resolution macroblock within said high resolution image and on the basis of the ratios of low resolution and high resolution images dimensions ; associating to each identified virtual base layer macroblocks motion data , said motion data being deduced from motion data associated to at least one macroblock of a corresponding low resolution macroblocks pair on the basis of the field/frame mode of said corresponding low resolution macroblocks pair and on the basis of the field/frame mode of said high resolution macroblock ; resampling motion data associated to said corresponding virtual base layer macroblocks so as to generate said at least one motion predictor . US20090225846A1 CLAIM 4 . Device for coding a sequence of high resolution images made up of macroblocks , called high resolution macroblocks , and a sequence of low resolution images , called low resolution macroblocks , said device comprising : first coding means for coding said low resolution images , said first coding means generating motion data for macroblocks of said low resolution images and a base layer data stream (data stream) ; inheritance means for deriving motion data for at least one macroblock of a high resolution image , called high resolution macroblock from motion data of macroblocks a low resolution image , called low resolution macroblocks ; and second coding means for coding said high resolution images using said derived motion data , said second coding means generating an enhancement layer data stream ; wherein the inheritance means comprise : means for defining a virtual structure made up of non overlapping macroblocks , called virtual base layer macroblocks , said virtual structure having same dimensions as said low resolution image ; means for identifying for said high resolution macroblock corresponding virtual base layer macroblocks in said virtual image on the basis of the location of said high resolution macroblock within said high resolution image and on the basis of the ratios of low resolution and high resolution images dimensions ; means for deriving , for each identified virtual base layer macroblocks , motion data from motion data associated to at least one macroblock of a corresponding low resolution macroblocks pair on the basis of the field/frame mode of said corresponding low resolution macroblocks pair and on the basis of the field/frame mode of said high resolution macroblock ; and means for resampling motion data associated to said corresponding virtual base layer macroblocks so as to generate said at least one motion predictor . US20090225846A1 CLAIM 5 . Device according to claim 4 , wherein said first coding means are an MPEG-4 AVC video encoder (second subdivision, second subset, second subdivision information) .
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset of the second set (following steps) of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	US20090225846A1 CLAIM 1 . Method as part of a process of scalable video coding or decoding for generating for at least one macroblock of a high resolution image , called high resolution macroblock , at least one motion predictor from motion data associated to macroblock(s) of a low resolution image , called low resolution macroblock(s) , comprising the following steps (second set) : defining a virtual structure made up of non overlapping macroblocks , called virtual base layer macroblocks , said virtual structure having same dimensions as said low resolution image ; identifying for said high resolution macroblock corresponding virtual base layer macroblocks in said virtual image on the basis of the location of said high resolution macroblock within said high resolution image and on the basis of the ratios of low resolution and high resolution images dimensions ; associating to each identified virtual base layer macroblocks motion data , said motion data being deduced from motion data associated to at least one macroblock of a corresponding low resolution macroblocks pair on the basis of the field/frame mode of said corresponding low resolution macroblocks pair and on the basis of the field/frame mode of said high resolution macroblock ; resampling motion data associated to said corresponding virtual base layer macroblocks so as to generate said at least one motion predictor .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set of root regions such that the first set of root regions are rectangular blocks (frame mode) of a size determined by the first maximum region size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	US20090225846A1 CLAIM 1 . Method as part of a process of scalable video coding or decoding for generating for at least one macroblock of a high resolution image , called high resolution macroblock , at least one motion predictor from motion data associated to macroblock(s) of a low resolution image , called low resolution macroblock(s) , comprising the following steps : defining a virtual structure made up of non overlapping macroblocks , called virtual base layer macroblocks , said virtual structure having same dimensions as said low resolution image ; identifying for said high resolution macroblock corresponding virtual base layer macroblocks in said virtual image on the basis of the location of said high resolution macroblock within said high resolution image and on the basis of the ratios of low resolution and high resolution images dimensions ; associating to each identified virtual base layer macroblocks motion data , said motion data being deduced from motion data associated to at least one macroblock of a corresponding low resolution macroblocks pair on the basis of the field/frame mode (rectangular blocks) of said corresponding low resolution macroblocks pair and on the basis of the field/frame mode of said high resolution macroblock ; resampling motion data associated to said corresponding virtual base layer macroblocks so as to generate said at least one motion predictor .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level from the data stream (data stream) .	US20090225846A1 CLAIM 4 . Device for coding a sequence of high resolution images made up of macroblocks , called high resolution macroblocks , and a sequence of low resolution images , called low resolution macroblocks , said device comprising : first coding means for coding said low resolution images , said first coding means generating motion data for macroblocks of said low resolution images and a base layer data stream (data stream) ; inheritance means for deriving motion data for at least one macroblock of a high resolution image , called high resolution macroblock from motion data of macroblocks a low resolution image , called low resolution macroblocks ; and second coding means for coding said high resolution images using said derived motion data , said second coding means generating an enhancement layer data stream ; wherein the inheritance means comprise : means for defining a virtual structure made up of non overlapping macroblocks , called virtual base layer macroblocks , said virtual structure having same dimensions as said low resolution image ; means for identifying for said high resolution macroblock corresponding virtual base layer macroblocks in said virtual image on the basis of the location of said high resolution macroblock within said high resolution image and on the basis of the ratios of low resolution and high resolution images dimensions ; means for deriving , for each identified virtual base layer macroblocks , motion data from motion data associated to at least one macroblock of a corresponding low resolution macroblocks pair on the basis of the field/frame mode of said corresponding low resolution macroblocks pair and on the basis of the field/frame mode of said high resolution macroblock ; and means for resampling motion data associated to said corresponding virtual base layer macroblocks so as to generate said at least one motion predictor .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements (video coding) associated with the first or second set (following steps) of sub-regions from the data stream (data stream) in a depth-first traversal order .	US20090225846A1 CLAIM 1 . Method as part of a process of scalable video coding (syntax elements) or decoding for generating for at least one macroblock of a high resolution image , called high resolution macroblock , at least one motion predictor from motion data associated to macroblock(s) of a low resolution image , called low resolution macroblock(s) , comprising the following steps (second set) : defining a virtual structure made up of non overlapping macroblocks , called virtual base layer macroblocks , said virtual structure having same dimensions as said low resolution image ; identifying for said high resolution macroblock corresponding virtual base layer macroblocks in said virtual image on the basis of the location of said high resolution macroblock within said high resolution image and on the basis of the ratios of low resolution and high resolution images dimensions ; associating to each identified virtual base layer macroblocks motion data , said motion data being deduced from motion data associated to at least one macroblock of a corresponding low resolution macroblocks pair on the basis of the field/frame mode of said corresponding low resolution macroblocks pair and on the basis of the field/frame mode of said high resolution macroblock ; resampling motion data associated to said corresponding virtual base layer macroblocks so as to generate said at least one motion predictor . US20090225846A1 CLAIM 4 . Device for coding a sequence of high resolution images made up of macroblocks , called high resolution macroblocks , and a sequence of low resolution images , called low resolution macroblocks , said device comprising : first coding means for coding said low resolution images , said first coding means generating motion data for macroblocks of said low resolution images and a base layer data stream (data stream) ; inheritance means for deriving motion data for at least one macroblock of a high resolution image , called high resolution macroblock from motion data of macroblocks a low resolution image , called low resolution macroblocks ; and second coding means for coding said high resolution images using said derived motion data , said second coding means generating an enhancement layer data stream ; wherein the inheritance means comprise : means for defining a virtual structure made up of non overlapping macroblocks , called virtual base layer macroblocks , said virtual structure having same dimensions as said low resolution image ; means for identifying for said high resolution macroblock corresponding virtual base layer macroblocks in said virtual image on the basis of the location of said high resolution macroblock within said high resolution image and on the basis of the ratios of low resolution and high resolution images dimensions ; means for deriving , for each identified virtual base layer macroblocks , motion data from motion data associated to at least one macroblock of a corresponding low resolution macroblocks pair on the basis of the field/frame mode of said corresponding low resolution macroblocks pair and on the basis of the field/frame mode of said high resolution macroblock ; and means for resampling motion data associated to said corresponding virtual base layer macroblocks so as to generate said at least one motion predictor .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements (video coding) of the data stream (data stream) , disjoint from a second subset (video encoder) of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20090225846A1 CLAIM 1 . Method as part of a process of scalable video coding (syntax elements) or decoding for generating for at least one macroblock of a high resolution image , called high resolution macroblock , at least one motion predictor from motion data associated to macroblock(s) of a low resolution image , called low resolution macroblock(s) , comprising the following steps : defining a virtual structure made up of non overlapping macroblocks , called virtual base layer macroblocks , said virtual structure having same dimensions as said low resolution image ; identifying for said high resolution macroblock corresponding virtual base layer macroblocks in said virtual image on the basis of the location of said high resolution macroblock within said high resolution image and on the basis of the ratios of low resolution and high resolution images dimensions ; associating to each identified virtual base layer macroblocks motion data , said motion data being deduced from motion data associated to at least one macroblock of a corresponding low resolution macroblocks pair on the basis of the field/frame mode of said corresponding low resolution macroblocks pair and on the basis of the field/frame mode of said high resolution macroblock ; resampling motion data associated to said corresponding virtual base layer macroblocks so as to generate said at least one motion predictor . US20090225846A1 CLAIM 4 . Device for coding a sequence of high resolution images made up of macroblocks , called high resolution macroblocks , and a sequence of low resolution images , called low resolution macroblocks , said device comprising : first coding means for coding said low resolution images , said first coding means generating motion data for macroblocks of said low resolution images and a base layer data stream (data stream) ; inheritance means for deriving motion data for at least one macroblock of a high resolution image , called high resolution macroblock from motion data of macroblocks a low resolution image , called low resolution macroblocks ; and second coding means for coding said high resolution images using said derived motion data , said second coding means generating an enhancement layer data stream ; wherein the inheritance means comprise : means for defining a virtual structure made up of non overlapping macroblocks , called virtual base layer macroblocks , said virtual structure having same dimensions as said low resolution image ; means for identifying for said high resolution macroblock corresponding virtual base layer macroblocks in said virtual image on the basis of the location of said high resolution macroblock within said high resolution image and on the basis of the ratios of low resolution and high resolution images dimensions ; means for deriving , for each identified virtual base layer macroblocks , motion data from motion data associated to at least one macroblock of a corresponding low resolution macroblocks pair on the basis of the field/frame mode of said corresponding low resolution macroblocks pair and on the basis of the field/frame mode of said high resolution macroblock ; and means for resampling motion data associated to said corresponding virtual base layer macroblocks so as to generate said at least one motion predictor . US20090225846A1 CLAIM 5 . Device according to claim 4 , wherein said first coding means are an MPEG-4 AVC video encoder (second subdivision, second subset, second subdivision information) .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream (data stream) , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	US20090225846A1 CLAIM 4 . Device for coding a sequence of high resolution images made up of macroblocks , called high resolution macroblocks , and a sequence of low resolution images , called low resolution macroblocks , said device comprising : first coding means for coding said low resolution images , said first coding means generating motion data for macroblocks of said low resolution images and a base layer data stream (data stream) ; inheritance means for deriving motion data for at least one macroblock of a high resolution image , called high resolution macroblock from motion data of macroblocks a low resolution image , called low resolution macroblocks ; and second coding means for coding said high resolution images using said derived motion data , said second coding means generating an enhancement layer data stream ; wherein the inheritance means comprise : means for defining a virtual structure made up of non overlapping macroblocks , called virtual base layer macroblocks , said virtual structure having same dimensions as said low resolution image ; means for identifying for said high resolution macroblock corresponding virtual base layer macroblocks in said virtual image on the basis of the location of said high resolution macroblock within said high resolution image and on the basis of the ratios of low resolution and high resolution images dimensions ; means for deriving , for each identified virtual base layer macroblocks , motion data from motion data associated to at least one macroblock of a corresponding low resolution macroblocks pair on the basis of the field/frame mode of said corresponding low resolution macroblocks pair and on the basis of the field/frame mode of said high resolution macroblock ; and means for resampling motion data associated to said corresponding virtual base layer macroblocks so as to generate said at least one motion predictor .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream (data stream) representing encoded video information , information related to first and second maximum region sizes (same dimensions) , first and second subdivision (video encoder) information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set (following steps) of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding (low resolution image) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20090225846A1 CLAIM 1 . Method as part of a process of scalable video coding or decoding for generating for at least one macroblock of a high resolution image , called high resolution macroblock , at least one motion predictor from motion data associated to macroblock(s) of a low resolution image (information samples using prediction coding) , called low resolution macroblock(s) , comprising the following steps (second set) : defining a virtual structure made up of non overlapping macroblocks , called virtual base layer macroblocks , said virtual structure having same dimensions (second maximum region sizes) as said low resolution image ; identifying for said high resolution macroblock corresponding virtual base layer macroblocks in said virtual image on the basis of the location of said high resolution macroblock within said high resolution image and on the basis of the ratios of low resolution and high resolution images dimensions ; associating to each identified virtual base layer macroblocks motion data , said motion data being deduced from motion data associated to at least one macroblock of a corresponding low resolution macroblocks pair on the basis of the field/frame mode of said corresponding low resolution macroblocks pair and on the basis of the field/frame mode of said high resolution macroblock ; resampling motion data associated to said corresponding virtual base layer macroblocks so as to generate said at least one motion predictor . US20090225846A1 CLAIM 4 . Device for coding a sequence of high resolution images made up of macroblocks , called high resolution macroblocks , and a sequence of low resolution images , called low resolution macroblocks , said device comprising : first coding means for coding said low resolution images , said first coding means generating motion data for macroblocks of said low resolution images and a base layer data stream (data stream) ; inheritance means for deriving motion data for at least one macroblock of a high resolution image , called high resolution macroblock from motion data of macroblocks a low resolution image , called low resolution macroblocks ; and second coding means for coding said high resolution images using said derived motion data , said second coding means generating an enhancement layer data stream ; wherein the inheritance means comprise : means for defining a virtual structure made up of non overlapping macroblocks , called virtual base layer macroblocks , said virtual structure having same dimensions as said low resolution image ; means for identifying for said high resolution macroblock corresponding virtual base layer macroblocks in said virtual image on the basis of the location of said high resolution macroblock within said high resolution image and on the basis of the ratios of low resolution and high resolution images dimensions ; means for deriving , for each identified virtual base layer macroblocks , motion data from motion data associated to at least one macroblock of a corresponding low resolution macroblocks pair on the basis of the field/frame mode of said corresponding low resolution macroblocks pair and on the basis of the field/frame mode of said high resolution macroblock ; and means for resampling motion data associated to said corresponding virtual base layer macroblocks so as to generate said at least one motion predictor . US20090225846A1 CLAIM 5 . Device according to claim 4 , wherein said first coding means are an MPEG-4 AVC video encoder (second subdivision, second subset, second subdivision information) .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set (following steps) of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (video encoder) information and a maximum hierarchy level ; and a data stream (data stream) generator configured to : encode the array of information samples using prediction coding (low resolution image) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes (same dimensions) and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20090225846A1 CLAIM 1 . Method as part of a process of scalable video coding or decoding for generating for at least one macroblock of a high resolution image , called high resolution macroblock , at least one motion predictor from motion data associated to macroblock(s) of a low resolution image (information samples using prediction coding) , called low resolution macroblock(s) , comprising the following steps (second set) : defining a virtual structure made up of non overlapping macroblocks , called virtual base layer macroblocks , said virtual structure having same dimensions (second maximum region sizes) as said low resolution image ; identifying for said high resolution macroblock corresponding virtual base layer macroblocks in said virtual image on the basis of the location of said high resolution macroblock within said high resolution image and on the basis of the ratios of low resolution and high resolution images dimensions ; associating to each identified virtual base layer macroblocks motion data , said motion data being deduced from motion data associated to at least one macroblock of a corresponding low resolution macroblocks pair on the basis of the field/frame mode of said corresponding low resolution macroblocks pair and on the basis of the field/frame mode of said high resolution macroblock ; resampling motion data associated to said corresponding virtual base layer macroblocks so as to generate said at least one motion predictor . US20090225846A1 CLAIM 4 . Device for coding a sequence of high resolution images made up of macroblocks , called high resolution macroblocks , and a sequence of low resolution images , called low resolution macroblocks , said device comprising : first coding means for coding said low resolution images , said first coding means generating motion data for macroblocks of said low resolution images and a base layer data stream (data stream) ; inheritance means for deriving motion data for at least one macroblock of a high resolution image , called high resolution macroblock from motion data of macroblocks a low resolution image , called low resolution macroblocks ; and second coding means for coding said high resolution images using said derived motion data , said second coding means generating an enhancement layer data stream ; wherein the inheritance means comprise : means for defining a virtual structure made up of non overlapping macroblocks , called virtual base layer macroblocks , said virtual structure having same dimensions as said low resolution image ; means for identifying for said high resolution macroblock corresponding virtual base layer macroblocks in said virtual image on the basis of the location of said high resolution macroblock within said high resolution image and on the basis of the ratios of low resolution and high resolution images dimensions ; means for deriving , for each identified virtual base layer macroblocks , motion data from motion data associated to at least one macroblock of a corresponding low resolution macroblocks pair on the basis of the field/frame mode of said corresponding low resolution macroblocks pair and on the basis of the field/frame mode of said high resolution macroblock ; and means for resampling motion data associated to said corresponding virtual base layer macroblocks so as to generate said at least one motion predictor . US20090225846A1 CLAIM 5 . Device according to claim 4 , wherein said first coding means are an MPEG-4 AVC video encoder (second subdivision, second subset, second subdivision information) .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set (following steps) of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (video encoder) information and a maximum hierarchy level ; encoding the array of information samples using prediction coding (low resolution image) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream (data stream) the encoded array of information samples , information related to the first and second maximum region sizes (same dimensions) and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20090225846A1 CLAIM 1 . Method as part of a process of scalable video coding or decoding for generating for at least one macroblock of a high resolution image , called high resolution macroblock , at least one motion predictor from motion data associated to macroblock(s) of a low resolution image (information samples using prediction coding) , called low resolution macroblock(s) , comprising the following steps (second set) : defining a virtual structure made up of non overlapping macroblocks , called virtual base layer macroblocks , said virtual structure having same dimensions (second maximum region sizes) as said low resolution image ; identifying for said high resolution macroblock corresponding virtual base layer macroblocks in said virtual image on the basis of the location of said high resolution macroblock within said high resolution image and on the basis of the ratios of low resolution and high resolution images dimensions ; associating to each identified virtual base layer macroblocks motion data , said motion data being deduced from motion data associated to at least one macroblock of a corresponding low resolution macroblocks pair on the basis of the field/frame mode of said corresponding low resolution macroblocks pair and on the basis of the field/frame mode of said high resolution macroblock ; resampling motion data associated to said corresponding virtual base layer macroblocks so as to generate said at least one motion predictor . US20090225846A1 CLAIM 4 . Device for coding a sequence of high resolution images made up of macroblocks , called high resolution macroblocks , and a sequence of low resolution images , called low resolution macroblocks , said device comprising : first coding means for coding said low resolution images , said first coding means generating motion data for macroblocks of said low resolution images and a base layer data stream (data stream) ; inheritance means for deriving motion data for at least one macroblock of a high resolution image , called high resolution macroblock from motion data of macroblocks a low resolution image , called low resolution macroblocks ; and second coding means for coding said high resolution images using said derived motion data , said second coding means generating an enhancement layer data stream ; wherein the inheritance means comprise : means for defining a virtual structure made up of non overlapping macroblocks , called virtual base layer macroblocks , said virtual structure having same dimensions as said low resolution image ; means for identifying for said high resolution macroblock corresponding virtual base layer macroblocks in said virtual image on the basis of the location of said high resolution macroblock within said high resolution image and on the basis of the ratios of low resolution and high resolution images dimensions ; means for deriving , for each identified virtual base layer macroblocks , motion data from motion data associated to at least one macroblock of a corresponding low resolution macroblocks pair on the basis of the field/frame mode of said corresponding low resolution macroblocks pair and on the basis of the field/frame mode of said high resolution macroblock ; and means for resampling motion data associated to said corresponding virtual base layer macroblocks so as to generate said at least one motion predictor . US20090225846A1 CLAIM 5 . Device according to claim 4 , wherein said first coding means are an MPEG-4 AVC video encoder (second subdivision, second subset, second subdivision information) .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20070230574A1 Filed: 2006-11-22 Issued: 2007-10-04 Method and Device for Encoding Digital Video Data (Original Assignee) Koninklijke Philips NV (Current Assignee) Entropic Communications LLC Stephane Valente
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set (following steps) of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20070230574A1 CLAIM 1 . A method of encoding digital video data corresponding to an original sequence of images and available in the form of a video stream consisting of successive pictures which are either INTRA pictures , called I-pictures and encoded by means of a so-called INTRA mode without any reference to any past or future picture , or INTER pictures , that are themselves either monodirectionally predicted pictures , called P-pictures and encoded with reference to a past or future reference picture which is an INTRA or INTER picture , or bidirectionally predicted pictures , called B-pictures and encoded with reference to one or more reference picture(s) , said INTRA pictures themselves comprising either I-pictures placed at the beginning of a new group of pictures corresponding to a scene change , where no temporal redundancy is available , and called scene change I-pictures , or I-pictures placed in other locations , where some temporal redundancy is available , and called refresh pictures , said method (root region) , intended to generate an output coded bitstream , being characterized in that , before being quantized and encoded in INTRA mode , said INTRA refresh pictures are replaced by an INTER picture having quality and artefacts substantially similar to those of the last encoded INTER picture(s) . US20070230574A1 CLAIM 2 . An encoding method according to claim 1 , in which each INTRA refresh picture is encoded by implementation of the following steps (second set) : (a) the concerned INTRA refresh picture is encoded as an INTER picture , similarly to the encoding step of the previous INTER picture(s) of the sequence , no corresponding output bits being however sent into the output coded bitstream (b) the temporally predicted picture corresponding to the encoded INTRA refresh picture thus obtained is reconstructed ; (c) the reconstructed picture thus obtained is encoded in INTRA mode , the corresponding output bits being now sent into said output coded bitstream .
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset of the second set (following steps) of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	US20070230574A1 CLAIM 2 . An encoding method according to claim 1 , in which each INTRA refresh picture is encoded by implementation of the following steps (second set) : (a) the concerned INTRA refresh picture is encoded as an INTER picture , similarly to the encoding step of the previous INTER picture(s) of the sequence , no corresponding output bits being however sent into the output coded bitstream (b) the temporally predicted picture corresponding to the encoded INTRA refresh picture thus obtained is reconstructed ; (c) the reconstructed picture thus obtained is encoded in INTRA mode , the corresponding output bits being now sent into said output coded bitstream .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region (said method) into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20070230574A1 CLAIM 1 . A method of encoding digital video data corresponding to an original sequence of images and available in the form of a video stream consisting of successive pictures which are either INTRA pictures , called I-pictures and encoded by means of a so-called INTRA mode without any reference to any past or future picture , or INTER pictures , that are themselves either monodirectionally predicted pictures , called P-pictures and encoded with reference to a past or future reference picture which is an INTRA or INTER picture , or bidirectionally predicted pictures , called B-pictures and encoded with reference to one or more reference picture(s) , said INTRA pictures themselves comprising either I-pictures placed at the beginning of a new group of pictures corresponding to a scene change , where no temporal redundancy is available , and called scene change I-pictures , or I-pictures placed in other locations , where some temporal redundancy is available , and called refresh pictures , said method (root region) , intended to generate an output coded bitstream , being characterized in that , before being quantized and encoded in INTRA mode , said INTRA refresh pictures are replaced by an INTER picture having quality and artefacts substantially similar to those of the last encoded INTER picture(s) .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements associated with the first or second set (following steps) of sub-regions from the data stream in a depth-first traversal order .	US20070230574A1 CLAIM 2 . An encoding method according to claim 1 , in which each INTRA refresh picture is encoded by implementation of the following steps (second set) : (a) the concerned INTRA refresh picture is encoded as an INTER picture , similarly to the encoding step of the previous INTER picture(s) of the sequence , no corresponding output bits being however sent into the output coded bitstream (b) the temporally predicted picture corresponding to the encoded INTRA refresh picture thus obtained is reconstructed ; (c) the reconstructed picture thus obtained is encoded in INTRA mode , the corresponding output bits being now sent into said output coded bitstream .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set (following steps) of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20070230574A1 CLAIM 1 . A method of encoding digital video data corresponding to an original sequence of images and available in the form of a video stream consisting of successive pictures which are either INTRA pictures , called I-pictures and encoded by means of a so-called INTRA mode without any reference to any past or future picture , or INTER pictures , that are themselves either monodirectionally predicted pictures , called P-pictures and encoded with reference to a past or future reference picture which is an INTRA or INTER picture , or bidirectionally predicted pictures , called B-pictures and encoded with reference to one or more reference picture(s) , said INTRA pictures themselves comprising either I-pictures placed at the beginning of a new group of pictures corresponding to a scene change , where no temporal redundancy is available , and called scene change I-pictures , or I-pictures placed in other locations , where some temporal redundancy is available , and called refresh pictures , said method (root region) , intended to generate an output coded bitstream , being characterized in that , before being quantized and encoded in INTRA mode , said INTRA refresh pictures are replaced by an INTER picture having quality and artefacts substantially similar to those of the last encoded INTER picture(s) . US20070230574A1 CLAIM 2 . An encoding method according to claim 1 , in which each INTRA refresh picture is encoded by implementation of the following steps (second set) : (a) the concerned INTRA refresh picture is encoded as an INTER picture , similarly to the encoding step of the previous INTER picture(s) of the sequence , no corresponding output bits being however sent into the output coded bitstream (b) the temporally predicted picture corresponding to the encoded INTRA refresh picture thus obtained is reconstructed ; (c) the reconstructed picture thus obtained is encoded in INTRA mode , the corresponding output bits being now sent into said output coded bitstream .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set (following steps) of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20070230574A1 CLAIM 1 . A method of encoding digital video data corresponding to an original sequence of images and available in the form of a video stream consisting of successive pictures which are either INTRA pictures , called I-pictures and encoded by means of a so-called INTRA mode without any reference to any past or future picture , or INTER pictures , that are themselves either monodirectionally predicted pictures , called P-pictures and encoded with reference to a past or future reference picture which is an INTRA or INTER picture , or bidirectionally predicted pictures , called B-pictures and encoded with reference to one or more reference picture(s) , said INTRA pictures themselves comprising either I-pictures placed at the beginning of a new group of pictures corresponding to a scene change , where no temporal redundancy is available , and called scene change I-pictures , or I-pictures placed in other locations , where some temporal redundancy is available , and called refresh pictures , said method (root region) , intended to generate an output coded bitstream , being characterized in that , before being quantized and encoded in INTRA mode , said INTRA refresh pictures are replaced by an INTER picture having quality and artefacts substantially similar to those of the last encoded INTER picture(s) . US20070230574A1 CLAIM 2 . An encoding method according to claim 1 , in which each INTRA refresh picture is encoded by implementation of the following steps (second set) : (a) the concerned INTRA refresh picture is encoded as an INTER picture , similarly to the encoding step of the previous INTER picture(s) of the sequence , no corresponding output bits being however sent into the output coded bitstream (b) the temporally predicted picture corresponding to the encoded INTRA refresh picture thus obtained is reconstructed ; (c) the reconstructed picture thus obtained is encoded in INTRA mode , the corresponding output bits being now sent into said output coded bitstream .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set (following steps) of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20070230574A1 CLAIM 1 . A method of encoding digital video data corresponding to an original sequence of images and available in the form of a video stream consisting of successive pictures which are either INTRA pictures , called I-pictures and encoded by means of a so-called INTRA mode without any reference to any past or future picture , or INTER pictures , that are themselves either monodirectionally predicted pictures , called P-pictures and encoded with reference to a past or future reference picture which is an INTRA or INTER picture , or bidirectionally predicted pictures , called B-pictures and encoded with reference to one or more reference picture(s) , said INTRA pictures themselves comprising either I-pictures placed at the beginning of a new group of pictures corresponding to a scene change , where no temporal redundancy is available , and called scene change I-pictures , or I-pictures placed in other locations , where some temporal redundancy is available , and called refresh pictures , said method (root region) , intended to generate an output coded bitstream , being characterized in that , before being quantized and encoded in INTRA mode , said INTRA refresh pictures are replaced by an INTER picture having quality and artefacts substantially similar to those of the last encoded INTER picture(s) . US20070230574A1 CLAIM 2 . An encoding method according to claim 1 , in which each INTRA refresh picture is encoded by implementation of the following steps (second set) : (a) the concerned INTRA refresh picture is encoded as an INTER picture , similarly to the encoding step of the previous INTER picture(s) of the sequence , no corresponding output bits being however sent into the output coded bitstream (b) the temporally predicted picture corresponding to the encoded INTRA refresh picture thus obtained is reconstructed ; (c) the reconstructed picture thus obtained is encoded in INTRA mode , the corresponding output bits being now sent into said output coded bitstream .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20070115154A1 Filed: 2006-11-20 Issued: 2007-05-24 Method of decoding bin values using pipeline architecture and decoding device therefor (Original Assignee) Samsung Electronics Co Ltd (Current Assignee) Samsung Electronics Co Ltd In-cheol Park, Yong-seok Yi
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream (comparing unit) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size (positive integer) and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20070115154A1 CLAIM 9 . A method of decoding a plurality of bin values in a context-based adaptive binary arithmetic coding decoder using a pipeline architecture , the method comprising : determining whether a first context model read from a memory is the same as a second context model required to decode an (i)th bin value , where i is a positive integer (second maximum region size) ; determining whether a third context model required to decode an (i+1)th bin value is the same as the second context model while decoding the (i)th bin value using the second context model , if it is determined that the first context model is the same as the second context model ; and reading the second context model from the memory , if it is determined that the first context model is not the same as the second context model . US20070115154A1 CLAIM 20 . The device of claim 14 , wherein the decoding and context model equality determining unit comprises : a decoding and context index estimating unit which estimates context indexes of the second context model for each case when the bin value to be decoded is 0 and 1 while decoding the bin value using the first context model ; a context index selection unit which selects one of the estimated context indexes according to the decoded bin value ; and a context index comparing unit (data stream) which determines whether the second context model is the same as the first context model according to whether the selected context index is the same as the context index of the first context model .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level from the data stream (comparing unit) .	US20070115154A1 CLAIM 20 . The device of claim 14 , wherein the decoding and context model equality determining unit comprises : a decoding and context index estimating unit which estimates context indexes of the second context model for each case when the bin value to be decoded is 0 and 1 while decoding the bin value using the first context model ; a context index selection unit which selects one of the estimated context indexes according to the decoded bin value ; and a context index comparing unit (data stream) which determines whether the second context model is the same as the first context model according to whether the selected context index is the same as the context index of the first context model .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements (syntax element) associated with the first or second set of sub-regions from the data stream (comparing unit) in a depth-first traversal order .	US20070115154A1 CLAIM 2 . The method of claim 1 , wherein the reading the first context model from a memory comprises : reading candidate context models corresponding to a syntax element (syntax elements) including the first bin value from the memory while calculating a context index increment for the syntax element including the first bin value ; and selecting one of the candidate context models using the calculated context index increment . US20070115154A1 CLAIM 20 . The device of claim 14 , wherein the decoding and context model equality determining unit comprises : a decoding and context index estimating unit which estimates context indexes of the second context model for each case when the bin value to be decoded is 0 and 1 while decoding the bin value using the first context model ; a context index selection unit which selects one of the estimated context indexes according to the decoded bin value ; and a context index comparing unit (data stream) which determines whether the second context model is the same as the first context model according to whether the selected context index is the same as the context index of the first context model .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements (syntax element) of the data stream (comparing unit) , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20070115154A1 CLAIM 2 . The method of claim 1 , wherein the reading the first context model from a memory comprises : reading candidate context models corresponding to a syntax element (syntax elements) including the first bin value from the memory while calculating a context index increment for the syntax element including the first bin value ; and selecting one of the candidate context models using the calculated context index increment . US20070115154A1 CLAIM 20 . The device of claim 14 , wherein the decoding and context model equality determining unit comprises : a decoding and context index estimating unit which estimates context indexes of the second context model for each case when the bin value to be decoded is 0 and 1 while decoding the bin value using the first context model ; a context index selection unit which selects one of the estimated context indexes according to the decoded bin value ; and a context index comparing unit (data stream) which determines whether the second context model is the same as the first context model according to whether the selected context index is the same as the context index of the first context model .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream (comparing unit) , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	US20070115154A1 CLAIM 20 . The device of claim 14 , wherein the decoding and context model equality determining unit comprises : a decoding and context index estimating unit which estimates context indexes of the second context model for each case when the bin value to be decoded is 0 and 1 while decoding the bin value using the first context model ; a context index selection unit which selects one of the estimated context indexes according to the decoded bin value ; and a context index comparing unit (data stream) which determines whether the second context model is the same as the first context model according to whether the selected context index is the same as the context index of the first context model .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream (comparing unit) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size (positive integer) and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20070115154A1 CLAIM 9 . A method of decoding a plurality of bin values in a context-based adaptive binary arithmetic coding decoder using a pipeline architecture , the method comprising : determining whether a first context model read from a memory is the same as a second context model required to decode an (i)th bin value , where i is a positive integer (second maximum region size) ; determining whether a third context model required to decode an (i+1)th bin value is the same as the second context model while decoding the (i)th bin value using the second context model , if it is determined that the first context model is the same as the second context model ; and reading the second context model from the memory , if it is determined that the first context model is not the same as the second context model . US20070115154A1 CLAIM 20 . The device of claim 14 , wherein the decoding and context model equality determining unit comprises : a decoding and context index estimating unit which estimates context indexes of the second context model for each case when the bin value to be decoded is 0 and 1 while decoding the bin value using the first context model ; a context index selection unit which selects one of the estimated context indexes according to the decoded bin value ; and a context index comparing unit (data stream) which determines whether the second context model is the same as the first context model according to whether the selected context index is the same as the context index of the first context model .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size (positive integer) , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream (comparing unit) generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20070115154A1 CLAIM 9 . A method of decoding a plurality of bin values in a context-based adaptive binary arithmetic coding decoder using a pipeline architecture , the method comprising : determining whether a first context model read from a memory is the same as a second context model required to decode an (i)th bin value , where i is a positive integer (second maximum region size) ; determining whether a third context model required to decode an (i+1)th bin value is the same as the second context model while decoding the (i)th bin value using the second context model , if it is determined that the first context model is the same as the second context model ; and reading the second context model from the memory , if it is determined that the first context model is not the same as the second context model . US20070115154A1 CLAIM 20 . The device of claim 14 , wherein the decoding and context model equality determining unit comprises : a decoding and context index estimating unit which estimates context indexes of the second context model for each case when the bin value to be decoded is 0 and 1 while decoding the bin value using the first context model ; a context index selection unit which selects one of the estimated context indexes according to the decoded bin value ; and a context index comparing unit (data stream) which determines whether the second context model is the same as the first context model according to whether the selected context index is the same as the context index of the first context model .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size (positive integer) ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream (comparing unit) the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20070115154A1 CLAIM 9 . A method of decoding a plurality of bin values in a context-based adaptive binary arithmetic coding decoder using a pipeline architecture , the method comprising : determining whether a first context model read from a memory is the same as a second context model required to decode an (i)th bin value , where i is a positive integer (second maximum region size) ; determining whether a third context model required to decode an (i+1)th bin value is the same as the second context model while decoding the (i)th bin value using the second context model , if it is determined that the first context model is the same as the second context model ; and reading the second context model from the memory , if it is determined that the first context model is not the same as the second context model . US20070115154A1 CLAIM 20 . The device of claim 14 , wherein the decoding and context model equality determining unit comprises : a decoding and context index estimating unit which estimates context indexes of the second context model for each case when the bin value to be decoded is 0 and 1 while decoding the bin value using the first context model ; a context index selection unit which selects one of the estimated context indexes according to the decoded bin value ; and a context index comparing unit (data stream) which determines whether the second context model is the same as the first context model according to whether the selected context index is the same as the context index of the first context model .
US10250913B2 CLAIM 15 . A non-transitory computer readable digital storage medium having stored thereon a computer program (computer program) having a program code for performing , when running on a computer , a method according to claim 12 .	US20070115154A1 CLAIM 22 . A computer-readable medium having embodied thereon a computer program (computer program) for executing a method of decoding a plurality of bin values in a context-based adaptive binary arithmetic coding decoder using a pipeline architecture , the method comprising : reading a first context model required to decode a first bin value ; determining whether a second context model required to decode a second bin value in a pipeline is the same as the first context model while decoding the first bin value using the first context model ; determining whether a third context model required to decode a third bin value is the same as the second context model while decoding the second bin value using the second context model , if it is determined that the second context model is the same as the first context model ; and reading the second context model , if it is determined that the second context model is not the same as the first context model .
US10250913B2 CLAIM 16 . A non-transitory computer readable digital storage medium having stored thereon a computer program (computer program) having a program code for performing , when running on a computer , a method according to claim 14 .	US20070115154A1 CLAIM 22 . A computer-readable medium having embodied thereon a computer program (computer program) for executing a method of decoding a plurality of bin values in a context-based adaptive binary arithmetic coding decoder using a pipeline architecture , the method comprising : reading a first context model required to decode a first bin value ; determining whether a second context model required to decode a second bin value in a pipeline is the same as the first context model while decoding the first bin value using the first context model ; determining whether a third context model required to decode a third bin value is the same as the second context model while decoding the second bin value using the second context model , if it is determined that the second context model is the same as the first context model ; and reading the second context model , if it is determined that the second context model is not the same as the first context model .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20070110153A1 Filed: 2006-11-14 Issued: 2007-05-17 Method, medium, and apparatus encoding and/or decoding an image using the same coding mode across components (Original Assignee) Samsung Electronics Co Ltd (Current Assignee) Samsung Electronics Co Ltd Dae-sung Cho, Hyun-mun Kim, Woo-shik Kim, Dmitri Birinov
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (determined size, block basis) information , and a maximum hierarchy level wherein the first maximum region (components a) size and the first subdivision information are associated with prediction coding (arithmetic decoding apparatus) and the second maximum region size and the second subdivision information are associated with transform coding (arithmetic decoding apparatus) ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20070110153A1 CLAIM 2 . The method of claim 1 , wherein when the predetermined size (second subdivision, second subset, second subdivision information) of the block is 4×4 or 8×8 , and one of 9 predicted directions is determined as the same predicted direction . US20070110153A1 CLAIM 5 . A method of generating a temporally predicted image , the method comprising generating a predicted image of a current image , including at least two image components , from motion estimation between a restored image and the current image by applying a same motion vector and a same motion interpolation method on a same block basis (second subdivision, second subset, second subdivision information) to each of the image components of the current image . US20070110153A1 CLAIM 26 . A context-based binary arithmetic coding method comprising : binarizing respective syntax elements used to encode a respective residue , which correspond to least two image components a (first maximum region) nd a difference between a current image and a predicted image ; selecting a respective context index information of the respective syntax elements for each of the image components of the current image ; and binary-arithmetic coding the respective syntax elements based on a same probability model having a same syntax element probability value for the selected respective context index information for each of the image components of the current image . US20070110153A1 CLAIM 49 . A context-based binary arithmetic decoding apparatus (prediction coding, transform coding) comprising : a context index selector to select respective context index information of respective syntax elements used to encode a respective residue , which corresponds to at least two image components and a difference between a current image and a predicted image ; a binary arithmetic decoder to restore respective binary values of the respective syntax elements by performing binary-arithmetic decoding the respective binary values of the respective syntax elements using a same probability model having a same syntax element probability value for the selected respective context index information of each of the image components of the current image ; and an inverse binarization unit to restore the respective syntax elements by inverse-binarizing the restored respective binary values of the respective syntax elements .
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal (processing element) based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset of the second set of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	US20070110153A1 CLAIM 4 . A medium comprising computer readable code to control at least one processing element (prediction signal, syntax elements) to implement a method of generating a spatially predicted image , the method comprising generating a predicted image of a current image , including at least two image components , from pixels of a restored image spatially adjacent to a predetermined-sized block of the current image by applying a same predicted direction to each of the image components of the current image .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set of root regions such that the first set of root regions are rectangular blocks of a size determined by the first maximum region (components a) size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	US20070110153A1 CLAIM 26 . A context-based binary arithmetic coding method comprising : binarizing respective syntax elements used to encode a respective residue , which correspond to least two image components a (first maximum region) nd a difference between a current image and a predicted image ; selecting a respective context index information of the respective syntax elements for each of the image components of the current image ; and binary-arithmetic coding the respective syntax elements based on a same probability model having a same syntax element probability value for the selected respective context index information for each of the image components of the current image .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements (processing element) associated with the first or second set of sub-regions from the data stream in a depth-first traversal order .	US20070110153A1 CLAIM 4 . A medium comprising computer readable code to control at least one processing element (prediction signal, syntax elements) to implement a method of generating a spatially predicted image , the method comprising generating a predicted image of a current image , including at least two image components , from pixels of a restored image spatially adjacent to a predetermined-sized block of the current image by applying a same predicted direction to each of the image components of the current image .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements (processing element) of the data stream , disjoint from a second subset (determined size, block basis) of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20070110153A1 CLAIM 2 . The method of claim 1 , wherein when the predetermined size (second subdivision, second subset, second subdivision information) of the block is 4×4 or 8×8 , and one of 9 predicted directions is determined as the same predicted direction . US20070110153A1 CLAIM 4 . A medium comprising computer readable code to control at least one processing element (prediction signal, syntax elements) to implement a method of generating a spatially predicted image , the method comprising generating a predicted image of a current image , including at least two image components , from pixels of a restored image spatially adjacent to a predetermined-sized block of the current image by applying a same predicted direction to each of the image components of the current image . US20070110153A1 CLAIM 5 . A method of generating a temporally predicted image , the method comprising generating a predicted image of a current image , including at least two image components , from motion estimation between a restored image and the current image by applying a same motion vector and a same motion interpolation method on a same block basis (second subdivision, second subset, second subdivision information) to each of the image components of the current image .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding (arithmetic decoding apparatus) to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	US20070110153A1 CLAIM 49 . A context-based binary arithmetic decoding apparatus (prediction coding, transform coding) comprising : a context index selector to select respective context index information of respective syntax elements used to encode a respective residue , which corresponds to at least two image components and a difference between a current image and a predicted image ; a binary arithmetic decoder to restore respective binary values of the respective syntax elements by performing binary-arithmetic decoding the respective binary values of the respective syntax elements using a same probability model having a same syntax element probability value for the selected respective context index information of each of the image components of the current image ; and an inverse binarization unit to restore the respective syntax elements by inverse-binarizing the restored respective binary values of the respective syntax elements .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (determined size, block basis) information , and a maximum hierarchy level , wherein the first maximum region (components a) size and the first subdivision information are associated with prediction coding (arithmetic decoding apparatus) and the second maximum region size and the second subdivision information are associated with transform coding (arithmetic decoding apparatus) ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20070110153A1 CLAIM 2 . The method of claim 1 , wherein when the predetermined size (second subdivision, second subset, second subdivision information) of the block is 4×4 or 8×8 , and one of 9 predicted directions is determined as the same predicted direction . US20070110153A1 CLAIM 5 . A method of generating a temporally predicted image , the method comprising generating a predicted image of a current image , including at least two image components , from motion estimation between a restored image and the current image by applying a same motion vector and a same motion interpolation method on a same block basis (second subdivision, second subset, second subdivision information) to each of the image components of the current image . US20070110153A1 CLAIM 26 . A context-based binary arithmetic coding method comprising : binarizing respective syntax elements used to encode a respective residue , which correspond to least two image components a (first maximum region) nd a difference between a current image and a predicted image ; selecting a respective context index information of the respective syntax elements for each of the image components of the current image ; and binary-arithmetic coding the respective syntax elements based on a same probability model having a same syntax element probability value for the selected respective context index information for each of the image components of the current image . US20070110153A1 CLAIM 49 . A context-based binary arithmetic decoding apparatus (prediction coding, transform coding) comprising : a context index selector to select respective context index information of respective syntax elements used to encode a respective residue , which corresponds to at least two image components and a difference between a current image and a predicted image ; a binary arithmetic decoder to restore respective binary values of the respective syntax elements by performing binary-arithmetic decoding the respective binary values of the respective syntax elements using a same probability model having a same syntax element probability value for the selected respective context index information of each of the image components of the current image ; and an inverse binarization unit to restore the respective syntax elements by inverse-binarizing the restored respective binary values of the respective syntax elements .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region (components a) size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (determined size, block basis) information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding (arithmetic decoding apparatus) in accordance with the first set of sub-regions and transform coding (arithmetic decoding apparatus) in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20070110153A1 CLAIM 2 . The method of claim 1 , wherein when the predetermined size (second subdivision, second subset, second subdivision information) of the block is 4×4 or 8×8 , and one of 9 predicted directions is determined as the same predicted direction . US20070110153A1 CLAIM 5 . A method of generating a temporally predicted image , the method comprising generating a predicted image of a current image , including at least two image components , from motion estimation between a restored image and the current image by applying a same motion vector and a same motion interpolation method on a same block basis (second subdivision, second subset, second subdivision information) to each of the image components of the current image . US20070110153A1 CLAIM 26 . A context-based binary arithmetic coding method comprising : binarizing respective syntax elements used to encode a respective residue , which correspond to least two image components a (first maximum region) nd a difference between a current image and a predicted image ; selecting a respective context index information of the respective syntax elements for each of the image components of the current image ; and binary-arithmetic coding the respective syntax elements based on a same probability model having a same syntax element probability value for the selected respective context index information for each of the image components of the current image . US20070110153A1 CLAIM 49 . A context-based binary arithmetic decoding apparatus (prediction coding, transform coding) comprising : a context index selector to select respective context index information of respective syntax elements used to encode a respective residue , which corresponds to at least two image components and a difference between a current image and a predicted image ; a binary arithmetic decoder to restore respective binary values of the respective syntax elements by performing binary-arithmetic decoding the respective binary values of the respective syntax elements using a same probability model having a same syntax element probability value for the selected respective context index information of each of the image components of the current image ; and an inverse binarization unit to restore the respective syntax elements by inverse-binarizing the restored respective binary values of the respective syntax elements .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region (components a) size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (determined size, block basis) information and a maximum hierarchy level ; encoding the array of information samples using prediction coding (arithmetic decoding apparatus) in accordance with the first set of sub-regions and transform coding (arithmetic decoding apparatus) in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20070110153A1 CLAIM 2 . The method of claim 1 , wherein when the predetermined size (second subdivision, second subset, second subdivision information) of the block is 4×4 or 8×8 , and one of 9 predicted directions is determined as the same predicted direction . US20070110153A1 CLAIM 5 . A method of generating a temporally predicted image , the method comprising generating a predicted image of a current image , including at least two image components , from motion estimation between a restored image and the current image by applying a same motion vector and a same motion interpolation method on a same block basis (second subdivision, second subset, second subdivision information) to each of the image components of the current image . US20070110153A1 CLAIM 26 . A context-based binary arithmetic coding method comprising : binarizing respective syntax elements used to encode a respective residue , which correspond to least two image components a (first maximum region) nd a difference between a current image and a predicted image ; selecting a respective context index information of the respective syntax elements for each of the image components of the current image ; and binary-arithmetic coding the respective syntax elements based on a same probability model having a same syntax element probability value for the selected respective context index information for each of the image components of the current image . US20070110153A1 CLAIM 49 . A context-based binary arithmetic decoding apparatus (prediction coding, transform coding) comprising : a context index selector to select respective context index information of respective syntax elements used to encode a respective residue , which corresponds to at least two image components and a difference between a current image and a predicted image ; a binary arithmetic decoder to restore respective binary values of the respective syntax elements by performing binary-arithmetic decoding the respective binary values of the respective syntax elements using a same probability model having a same syntax element probability value for the selected respective context index information of each of the image components of the current image ; and an inverse binarization unit to restore the respective syntax elements by inverse-binarizing the restored respective binary values of the respective syntax elements .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	CN1976458A Filed: 2006-10-19 Issued: 2007-06-06 利用层间相关性编码层内标记的方法、及解码方法和设备 (Original Assignee) 三星电子株式会社李培根, 韩宇镇
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level (一比特) (一比特) wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root (用于从输入) region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding (运动预测) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN1976458A CLAIM 5 . 根据权利要求1的方法，其中当前层的标记和基本层的标记包括残留预测标记、基本层内标记、运动预测 (information samples using prediction coding) 标记、基本模式标记、和细分系数的符号标记中的至少一个。 CN1976458A CLAIM 10 . 一种在基于多层的视频中利用与基本层的标记的相关性而对编码后的当前层的标记进行解码的方法，该方法包括：从输入比特流中读取预测标记和基本层的标记；如果预测标记具有第一比特 (maximum hierarchy level, first hierarchy level, hierarchy level) 值，则在预测标记所被分配到的特定单元区域中，用所读取的基本层的标记替换当前层的标记；和输出所替换的当前层的标记。 CN1976458A CLAIM 20 . 一种在基于多层的视频中利用与基本层的标记的相关性而对编码后的当前层的标记进行解码的设备，该设备包括：比特流读出单元，用于从输入 (respective root, respective root region) 比特流中读取预测标记和基本层标记；和替换单元，用于如果预测标记具有第一比特值，则在预测标记所被分配到的特定单元区域中，用所读取的基本层的标记替换当前层的标记，并输出所替换的当前层的标记。
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level (一比特) (一比特) according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition (标记进行) rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level (一比特) is reached .	CN1976458A CLAIM 1 . 一种利用与基本层的对应标记的相关性而对在基于多层的视频中使用的当前层的标记进行 (respective partition) 编码的方法，该方法包括：确定在指定单元区域中包括的当前层的标记是否等于基本层的标记；根据该确定结果而设置预测标记；和如果确定当前层的标记等于基本层的标记，则将基本层的标记和预测标记插入到比特流中。 CN1976458A CLAIM 10 . 一种在基于多层的视频中利用与基本层的标记的相关性而对编码后的当前层的标记进行解码的方法，该方法包括：从输入比特流中读取预测标记和基本层的标记；如果预测标记具有第一比特 (maximum hierarchy level, first hierarchy level, hierarchy level) 值，则在预测标记所被分配到的特定单元区域中，用所读取的基本层的标记替换当前层的标记；和输出所替换的当前层的标记。
US10250913B2 CLAIM 5 . The decoder according to claim 4 , wherein the divider is configured to , in accordance with the partition rules associated with the first and higher-order hierarchy levels , sub-divide into sub-regions of equal size , such that there are an equal number of sub-regions at each hierarchy level (一比特) .	CN1976458A CLAIM 10 . 一种在基于多层的视频中利用与基本层的标记的相关性而对编码后的当前层的标记进行解码的方法，该方法包括：从输入比特流中读取预测标记和基本层的标记；如果预测标记具有第一比特 (maximum hierarchy level, first hierarchy level, hierarchy level) 值，则在预测标记所被分配到的特定单元区域中，用所读取的基本层的标记替换当前层的标记；和输出所替换的当前层的标记。
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision information includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level (一比特) is sub-divided .	CN1976458A CLAIM 10 . 一种在基于多层的视频中利用与基本层的标记的相关性而对编码后的当前层的标记进行解码的方法，该方法包括：从输入比特流中读取预测标记和基本层的标记；如果预测标记具有第一比特 (maximum hierarchy level, first hierarchy level, hierarchy level) 值，则在预测标记所被分配到的特定单元区域中，用所读取的基本层的标记替换当前层的标记；和输出所替换的当前层的标记。
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level (一比特) (一比特) from the data stream .	CN1976458A CLAIM 10 . 一种在基于多层的视频中利用与基本层的标记的相关性而对编码后的当前层的标记进行解码的方法，该方法包括：从输入比特流中读取预测标记和基本层的标记；如果预测标记具有第一比特 (maximum hierarchy level, first hierarchy level, hierarchy level) 值，则在预测标记所被分配到的特定单元区域中，用所读取的基本层的标记替换当前层的标记；和输出所替换的当前层的标记。
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level (一比特) (一比特) , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root (用于从输入) region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding (运动预测) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN1976458A CLAIM 5 . 根据权利要求1的方法，其中当前层的标记和基本层的标记包括残留预测标记、基本层内标记、运动预测 (information samples using prediction coding) 标记、基本模式标记、和细分系数的符号标记中的至少一个。 CN1976458A CLAIM 10 . 一种在基于多层的视频中利用与基本层的标记的相关性而对编码后的当前层的标记进行解码的方法，该方法包括：从输入比特流中读取预测标记和基本层的标记；如果预测标记具有第一比特 (maximum hierarchy level, first hierarchy level, hierarchy level) 值，则在预测标记所被分配到的特定单元区域中，用所读取的基本层的标记替换当前层的标记；和输出所替换的当前层的标记。 CN1976458A CLAIM 20 . 一种在基于多层的视频中利用与基本层的标记的相关性而对编码后的当前层的标记进行解码的设备，该设备包括：比特流读出单元，用于从输入 (respective root, respective root region) 比特流中读取预测标记和基本层标记；和替换单元，用于如果预测标记具有第一比特值，则在预测标记所被分配到的特定单元区域中，用所读取的基本层的标记替换当前层的标记，并输出所替换的当前层的标记。
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root (用于从输入) region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level (一比特) (一比特) ; and a data stream generator configured to : encode the array of information samples using prediction coding (运动预测) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN1976458A CLAIM 5 . 根据权利要求1的方法，其中当前层的标记和基本层的标记包括残留预测标记、基本层内标记、运动预测 (information samples using prediction coding) 标记、基本模式标记、和细分系数的符号标记中的至少一个。 CN1976458A CLAIM 10 . 一种在基于多层的视频中利用与基本层的标记的相关性而对编码后的当前层的标记进行解码的方法，该方法包括：从输入比特流中读取预测标记和基本层的标记；如果预测标记具有第一比特 (maximum hierarchy level, first hierarchy level, hierarchy level) 值，则在预测标记所被分配到的特定单元区域中，用所读取的基本层的标记替换当前层的标记；和输出所替换的当前层的标记。 CN1976458A CLAIM 20 . 一种在基于多层的视频中利用与基本层的标记的相关性而对编码后的当前层的标记进行解码的设备，该设备包括：比特流读出单元，用于从输入 (respective root, respective root region) 比特流中读取预测标记和基本层标记；和替换单元，用于如果预测标记具有第一比特值，则在预测标记所被分配到的特定单元区域中，用所读取的基本层的标记替换当前层的标记，并输出所替换的当前层的标记。
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root (用于从输入) region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level (一比特) (一比特) ; encoding the array of information samples using prediction coding (运动预测) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN1976458A CLAIM 5 . 根据权利要求1的方法，其中当前层的标记和基本层的标记包括残留预测标记、基本层内标记、运动预测 (information samples using prediction coding) 标记、基本模式标记、和细分系数的符号标记中的至少一个。 CN1976458A CLAIM 10 . 一种在基于多层的视频中利用与基本层的标记的相关性而对编码后的当前层的标记进行解码的方法，该方法包括：从输入比特流中读取预测标记和基本层的标记；如果预测标记具有第一比特 (maximum hierarchy level, first hierarchy level, hierarchy level) 值，则在预测标记所被分配到的特定单元区域中，用所读取的基本层的标记替换当前层的标记；和输出所替换的当前层的标记。 CN1976458A CLAIM 20 . 一种在基于多层的视频中利用与基本层的标记的相关性而对编码后的当前层的标记进行解码的设备，该设备包括：比特流读出单元，用于从输入 (respective root, respective root region) 比特流中读取预测标记和基本层标记；和替换单元，用于如果预测标记具有第一比特值，则在预测标记所被分配到的特定单元区域中，用所读取的基本层的标记替换当前层的标记，并输出所替换的当前层的标记。

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	CN1960491A Filed: 2006-09-21 Issued: 2007-05-09 基于h.264压缩域运动对象实时分割方法 (Original Assignee) 上海大学刘志, 张兆杨, 陆宇
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding (运动矢量之差, 的匹配) and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN1960491A CLAIM 5 . 根据权利要求1所述的基于匹配矩阵的H . 264压缩域运动对象实时分割方法，其特征在于所述的区域分割，是采用统计区域生长算法将累积运动矢量场分割成多个具有相似运动的区域。步骤如下：(1)计算四邻域内任意相邻块组的运动差异性度量；(2)所有相邻块组按照运动差异性度量从小到大的次序进行排序；(3)将运动差异性度量最小的相邻块组合并，以此处开始区域生长过程，在每次区域生长时，当前两个块组分别属于相邻的两个区域，则判断这两个区域是否合并的条件是这两个区域的平均运动矢量之差 (prediction coding, prediction signal) 是否小于阈值条件：& ; Delta ; (R)=SR22Q\|R\|(min(SR , \|R\|)log(1+\|R\|)+2log6wh) , ]]> ; 其中SR表示运动矢量的动态范围，\|R\|表示区域包含的运动矢量数目，wh表示运动矢量场的尺寸，参数Q用来控制运动矢量场的分割程度，就样就可以将运动矢量场适度地分割成若干具有相似运动的区域；(4)计算每个分割区域在全局运动补偿后的平均残差；(5)区分最可靠的背景区域和其它对象所在的区域，在面积大于整个运动矢量场10％的若干分割区域中选择平均残差最小的区域作为可靠的背景区域，标记为R0t，剩下的区域作为运动对象可能存在的区域Rit；最后对当前帧所分割的M个对象区域和1个背景区域分别标记，分割结果记为Lregt。
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal (运动矢量之差, 的匹配) based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset of the second set of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	CN1960491A CLAIM 5 . 根据权利要求1所述的基于匹配矩阵的H . 264压缩域运动对象实时分割方法，其特征在于所述的区域分割，是采用统计区域生长算法将累积运动矢量场分割成多个具有相似运动的区域。步骤如下：(1)计算四邻域内任意相邻块组的运动差异性度量；(2)所有相邻块组按照运动差异性度量从小到大的次序进行排序；(3)将运动差异性度量最小的相邻块组合并，以此处开始区域生长过程，在每次区域生长时，当前两个块组分别属于相邻的两个区域，则判断这两个区域是否合并的条件是这两个区域的平均运动矢量之差 (prediction coding, prediction signal) 是否小于阈值条件：& ; Delta ; (R)=SR22Q\|R\|(min(SR , \|R\|)log(1+\|R\|)+2log6wh) , ]]> ; 其中SR表示运动矢量的动态范围，\|R\|表示区域包含的运动矢量数目，wh表示运动矢量场的尺寸，参数Q用来控制运动矢量场的分割程度，就样就可以将运动矢量场适度地分割成若干具有相似运动的区域；(4)计算每个分割区域在全局运动补偿后的平均残差；(5)区分最可靠的背景区域和其它对象所在的区域，在面积大于整个运动矢量场10％的若干分割区域中选择平均残差最小的区域作为可靠的背景区域，标记为R0t，剩下的区域作为运动对象可能存在的区域Rit；最后对当前帧所分割的M个对象区域和1个背景区域分别标记，分割结果记为Lregt。
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding (运动矢量之差, 的匹配) and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN1960491A CLAIM 5 . 根据权利要求1所述的基于匹配矩阵的H . 264压缩域运动对象实时分割方法，其特征在于所述的区域分割，是采用统计区域生长算法将累积运动矢量场分割成多个具有相似运动的区域。步骤如下：(1)计算四邻域内任意相邻块组的运动差异性度量；(2)所有相邻块组按照运动差异性度量从小到大的次序进行排序；(3)将运动差异性度量最小的相邻块组合并，以此处开始区域生长过程，在每次区域生长时，当前两个块组分别属于相邻的两个区域，则判断这两个区域是否合并的条件是这两个区域的平均运动矢量之差 (prediction coding, prediction signal) 是否小于阈值条件：& ; Delta ; (R)=SR22Q\|R\|(min(SR , \|R\|)log(1+\|R\|)+2log6wh) , ]]> ; 其中SR表示运动矢量的动态范围，\|R\|表示区域包含的运动矢量数目，wh表示运动矢量场的尺寸，参数Q用来控制运动矢量场的分割程度，就样就可以将运动矢量场适度地分割成若干具有相似运动的区域；(4)计算每个分割区域在全局运动补偿后的平均残差；(5)区分最可靠的背景区域和其它对象所在的区域，在面积大于整个运动矢量场10％的若干分割区域中选择平均残差最小的区域作为可靠的背景区域，标记为R0t，剩下的区域作为运动对象可能存在的区域Rit；最后对当前帧所分割的M个对象区域和1个背景区域分别标记，分割结果记为Lregt。
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding (运动矢量之差, 的匹配) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN1960491A CLAIM 5 . 根据权利要求1所述的基于匹配矩阵的H . 264压缩域运动对象实时分割方法，其特征在于所述的区域分割，是采用统计区域生长算法将累积运动矢量场分割成多个具有相似运动的区域。步骤如下：(1)计算四邻域内任意相邻块组的运动差异性度量；(2)所有相邻块组按照运动差异性度量从小到大的次序进行排序；(3)将运动差异性度量最小的相邻块组合并，以此处开始区域生长过程，在每次区域生长时，当前两个块组分别属于相邻的两个区域，则判断这两个区域是否合并的条件是这两个区域的平均运动矢量之差 (prediction coding, prediction signal) 是否小于阈值条件：& ; Delta ; (R)=SR22Q\|R\|(min(SR , \|R\|)log(1+\|R\|)+2log6wh) , ]]> ; 其中SR表示运动矢量的动态范围，\|R\|表示区域包含的运动矢量数目，wh表示运动矢量场的尺寸，参数Q用来控制运动矢量场的分割程度，就样就可以将运动矢量场适度地分割成若干具有相似运动的区域；(4)计算每个分割区域在全局运动补偿后的平均残差；(5)区分最可靠的背景区域和其它对象所在的区域，在面积大于整个运动矢量场10％的若干分割区域中选择平均残差最小的区域作为可靠的背景区域，标记为R0t，剩下的区域作为运动对象可能存在的区域Rit；最后对当前帧所分割的M个对象区域和1个背景区域分别标记，分割结果记为Lregt。
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding (运动矢量之差, 的匹配) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN1960491A CLAIM 5 . 根据权利要求1所述的基于匹配矩阵的H . 264压缩域运动对象实时分割方法，其特征在于所述的区域分割，是采用统计区域生长算法将累积运动矢量场分割成多个具有相似运动的区域。步骤如下：(1)计算四邻域内任意相邻块组的运动差异性度量；(2)所有相邻块组按照运动差异性度量从小到大的次序进行排序；(3)将运动差异性度量最小的相邻块组合并，以此处开始区域生长过程，在每次区域生长时，当前两个块组分别属于相邻的两个区域，则判断这两个区域是否合并的条件是这两个区域的平均运动矢量之差 (prediction coding, prediction signal) 是否小于阈值条件：& ; Delta ; (R)=SR22Q\|R\|(min(SR , \|R\|)log(1+\|R\|)+2log6wh) , ]]> ; 其中SR表示运动矢量的动态范围，\|R\|表示区域包含的运动矢量数目，wh表示运动矢量场的尺寸，参数Q用来控制运动矢量场的分割程度，就样就可以将运动矢量场适度地分割成若干具有相似运动的区域；(4)计算每个分割区域在全局运动补偿后的平均残差；(5)区分最可靠的背景区域和其它对象所在的区域，在面积大于整个运动矢量场10％的若干分割区域中选择平均残差最小的区域作为可靠的背景区域，标记为R0t，剩下的区域作为运动对象可能存在的区域Rit；最后对当前帧所分割的M个对象区域和1个背景区域分别标记，分割结果记为Lregt。

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20070005795A1 Filed: 2006-09-07 Issued: 2007-01-04 Object oriented video system (Original Assignee) Activesky Inc (Current Assignee) Activesky Inc Ruben Gonzalez
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream (bit streams) representing encoded video information (generated image) , information related to first and second maximum region sizes , first and second subdivision (unique identifiers, video encoder, video frame, following steps, including one, respective data) information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision (unique identifiers, video encoder, video frame, following steps, including one, respective data) information are associated with prediction coding (receiving input) and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions (compressed media) based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set (unique identifiers, video encoder, video frame, following steps, including one, respective data) of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20070005795A1 CLAIM 18 . A system according to claim 12 including playing mechanism for playing a plurality of video objects simultaneously , each of said video objects capable of originating from a different source , said server capable of opening each of said sources , interleaving the bit streams (data stream) , adding appropriate control information and forwarding the new composite stream to said client . US20070005795A1 CLAIM 19 . A system according to claim 12 including a data source manager capable of randomly accessing said source file , reading the correct data and control packets from said streams which are needed to compose the display scene , and including a server multiplexer capable of receiving input (prediction coding) from multiple source manager instances with single inputs and from said dynamic media composition engine , said multiplexer capable of multiplexing together object data packets from said sources and inserting additional control packets into said data stream for controlling the rendering of component objects in the composite scene . US20070005795A1 CLAIM 23 . An object oriented interactive multimedia file , comprising : a combination of one or more of contiguous self-contained scenes , each said scene comprising scene format definition as the first packet , and a group of one or more data streams following said first packet ; each said data stream apart from first data stream containing objects which may be optionally decoded and displayed according to a dynamic media composition process as specified by object control information in said first data stream ; and each said data stream including one (second subdivision, second set, second subdivision information, second subset, first subdivision) or more single self-contained objects and demarcated by an end stream marker ; said objects each containing it' ; s own control information and formed by combining packet streams ; said packet streams formed by encoding raw interactive multimedia data including at least one or a combination of video , text , audio , music , or graphics elements as a video packet stream , text packet stream , audio packet stream , music packet stream and graphics packet stream respectively . US20070005795A1 CLAIM 31 . A method according to claim 29 of streaming live video content to a user comprising the following steps (second subdivision, second set, second subdivision information, second subset, first subdivision) : said user connecting to a remote server ; and said user selecting a camera location to view within a region handled by the operator/exchange ; US20070005795A1 CLAIM 56 . A method according to claim 42 , wherein said inserting step comprises inserting a computer generated image (video information) of a monitor of a remote computing device . US20070005795A1 CLAIM 116 . A system according to claim 12 including a persistent object library on a portable client device for use in dynamic media composition said library being capable of being managed from said remote server , software available to a client for executing library management instructions delivered to it from said remote server , said server capable of querying said library and receiving information about specific objects contained therein , and inserting , updating , or deleting the contents of said library ; and said dynamic media composition engine capable of sourcing object data stream simultaneously both from said library and remote server , if required , said persistent object library storing object information including expiry dates , access permissions , unique identifiers (second subdivision, second set, second subdivision information, second subset, first subdivision) , metadata and state information , said system performing automatic garbage collection on expired objects , access control , library searching , and various other library management tasks . US20070005795A1 CLAIM 119 . A video encoding method as claimed in claim 118 , including generating a video data file including a plurality of said scene packet with respective data (second subdivision, second set, second subdivision information, second subset, first subdivision) streams and user control data . US20070005795A1 CLAIM 120 . A video encoding method as claimed in claim 117 , wherein said video data represents video frame (second subdivision, second set, second subdivision information, second subset, first subdivision) s , audio frames , text and/or graphics . US20070005795A1 CLAIM 151 . A video encoder (second subdivision, second set, second subdivision information, second subset, first subdivision) having components for executing the steps of the video encoding method as claimed in claim 117 . US20070005795A1 CLAIM 161 . A method of providing an interactive video brochure including at least one of steps of : (a) creating a video brochure by specifying (i) the various scenes in the brochure and the various video objects that may occur within each scene , (ii) specifying the preset and user selectable scene navigational controls and the individual composition rules for each scene , (iii) specifying rendering parameters on media objects , (iv) specifying controls on media objects to create forms to collect user feedback , (v) integrating the compressed media (root regions) streams and object control information into a composite data stream .
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal (respective video) based on an intra-prediction mode (low power) associated with the sub-region and reconstructed samples of a neighboring subset of the second set (unique identifiers, video encoder, video frame, following steps, including one, respective data) of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	US20070005795A1 CLAIM 23 . An object oriented interactive multimedia file , comprising : a combination of one or more of contiguous self-contained scenes , each said scene comprising scene format definition as the first packet , and a group of one or more data streams following said first packet ; each said data stream apart from first data stream containing objects which may be optionally decoded and displayed according to a dynamic media composition process as specified by object control information in said first data stream ; and each said data stream including one (second subdivision, second set, second subdivision information, second subset, first subdivision) or more single self-contained objects and demarcated by an end stream marker ; said objects each containing it' ; s own control information and formed by combining packet streams ; said packet streams formed by encoding raw interactive multimedia data including at least one or a combination of video , text , audio , music , or graphics elements as a video packet stream , text packet stream , audio packet stream , music packet stream and graphics packet stream respectively . US20070005795A1 CLAIM 31 . A method according to claim 29 of streaming live video content to a user comprising the following steps (second subdivision, second set, second subdivision information, second subset, first subdivision) : said user connecting to a remote server ; and said user selecting a camera location to view within a region handled by the operator/exchange ; US20070005795A1 CLAIM 35 . A method of providing a voice command operation of a low power (intra-prediction mode) device capable of operating in a streaming video system , comprising the following steps : capturing a user' ; s speech on said device ; compressing said speech ; inserting encoded samples of said compressed speech into user control packets ; sending said compressed speech to a server capable of processing voice commands ; said server performs automatic speech recognition ; said server maps the transcribed speech to a command set ; said system checks whether said command is generated by said user or said server ; if said transcribed command is from said server , said server executes said command ; if said transcribed command is from said user said system forwards said command to said user device ; and said user executes said command . US20070005795A1 CLAIM 116 . A system according to claim 12 including a persistent object library on a portable client device for use in dynamic media composition said library being capable of being managed from said remote server , software available to a client for executing library management instructions delivered to it from said remote server , said server capable of querying said library and receiving information about specific objects contained therein , and inserting , updating , or deleting the contents of said library ; and said dynamic media composition engine capable of sourcing object data stream simultaneously both from said library and remote server , if required , said persistent object library storing object information including expiry dates , access permissions , unique identifiers (second subdivision, second set, second subdivision information, second subset, first subdivision) , metadata and state information , said system performing automatic garbage collection on expired objects , access control , library searching , and various other library management tasks . US20070005795A1 CLAIM 117 . A video encoding method , including : encoding video data with object control data as a video object ; and generating a data stream including a plurality of video objects with respective video (prediction signal) data and object control data . US20070005795A1 CLAIM 119 . A video encoding method as claimed in claim 118 , including generating a video data file including a plurality of said scene packet with respective data (second subdivision, second set, second subdivision information, second subset, first subdivision) streams and user control data . US20070005795A1 CLAIM 120 . A video encoding method as claimed in claim 117 , wherein said video data represents video frame (second subdivision, second set, second subdivision information, second subset, first subdivision) s , audio frames , text and/or graphics . US20070005795A1 CLAIM 151 . A video encoder (second subdivision, second set, second subdivision information, second subset, first subdivision) having components for executing the steps of the video encoding method as claimed in claim 117 .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set of root regions (compressed media) such that the first set of root regions are rectangular blocks of a size determined by the first maximum region size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	US20070005795A1 CLAIM 161 . A method of providing an interactive video brochure including at least one of steps of : (a) creating a video brochure by specifying (i) the various scenes in the brochure and the various video objects that may occur within each scene , (ii) specifying the preset and user selectable scene navigational controls and the individual composition rules for each scene , (iii) specifying rendering parameters on media objects , (iv) specifying controls on media objects to create forms to collect user feedback , (v) integrating the compressed media (root regions) streams and object control information into a composite data stream .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions (compressed media) , determine whether the first subdivision (unique identifiers, video encoder, video frame, following steps, including one, respective data) information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule (coding data) associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules (one object) associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20070005795A1 CLAIM 1 . A method of generating an object oriented interactive multimedia file , including : encoding data (partition rule) comprising at least one of video , text , audio , music and/or graphics elements as a video packet stream , text packet stream , audio packet stream , music packet stream and/or graphics packet stream respectively ; combining said packet streams into a single self-contained object , said object containing its own control information ; placing a plurality of said objects in a data stream ; and grouping one or more of said data streams in a single contiguous self-contained scene , said scene including format definition as the initial packet in a sequence of packets . US20070005795A1 CLAIM 8 . A method of generating an interactive object oriented multimedia file according to claim 1 , wherein said object control data takes the form of messages encapsulated within object control packets and represents parameters for rendering video and graphics objects , for defining the interactive behaviour of said objects , for creating hyperlinks to and from said objects , for defining animation paths for said objects , for defining dynamic media composition parameters , for assigning values to user variables , for redirecting or retargeting the consequences of interactions with objects and other controls from one object (partition rules) to another , for attaching executable behaviours to objects , including voice calls and starting and stop timers , and for defining conditions for the execution of control actions . US20070005795A1 CLAIM 23 . An object oriented interactive multimedia file , comprising : a combination of one or more of contiguous self-contained scenes , each said scene comprising scene format definition as the first packet , and a group of one or more data streams following said first packet ; each said data stream apart from first data stream containing objects which may be optionally decoded and displayed according to a dynamic media composition process as specified by object control information in said first data stream ; and each said data stream including one (second subdivision, second set, second subdivision information, second subset, first subdivision) or more single self-contained objects and demarcated by an end stream marker ; said objects each containing it' ; s own control information and formed by combining packet streams ; said packet streams formed by encoding raw interactive multimedia data including at least one or a combination of video , text , audio , music , or graphics elements as a video packet stream , text packet stream , audio packet stream , music packet stream and graphics packet stream respectively . US20070005795A1 CLAIM 31 . A method according to claim 29 of streaming live video content to a user comprising the following steps (second subdivision, second set, second subdivision information, second subset, first subdivision) : said user connecting to a remote server ; and said user selecting a camera location to view within a region handled by the operator/exchange ; US20070005795A1 CLAIM 116 . A system according to claim 12 including a persistent object library on a portable client device for use in dynamic media composition said library being capable of being managed from said remote server , software available to a client for executing library management instructions delivered to it from said remote server , said server capable of querying said library and receiving information about specific objects contained therein , and inserting , updating , or deleting the contents of said library ; and said dynamic media composition engine capable of sourcing object data stream simultaneously both from said library and remote server , if required , said persistent object library storing object information including expiry dates , access permissions , unique identifiers (second subdivision, second set, second subdivision information, second subset, first subdivision) , metadata and state information , said system performing automatic garbage collection on expired objects , access control , library searching , and various other library management tasks . US20070005795A1 CLAIM 119 . A video encoding method as claimed in claim 118 , including generating a video data file including a plurality of said scene packet with respective data (second subdivision, second set, second subdivision information, second subset, first subdivision) streams and user control data . US20070005795A1 CLAIM 120 . A video encoding method as claimed in claim 117 , wherein said video data represents video frame (second subdivision, second set, second subdivision information, second subset, first subdivision) s , audio frames , text and/or graphics . US20070005795A1 CLAIM 151 . A video encoder (second subdivision, second set, second subdivision information, second subset, first subdivision) having components for executing the steps of the video encoding method as claimed in claim 117 . US20070005795A1 CLAIM 161 . A method of providing an interactive video brochure including at least one of steps of : (a) creating a video brochure by specifying (i) the various scenes in the brochure and the various video objects that may occur within each scene , (ii) specifying the preset and user selectable scene navigational controls and the individual composition rules for each scene , (iii) specifying rendering parameters on media objects , (iv) specifying controls on media objects to create forms to collect user feedback , (v) integrating the compressed media (root regions) streams and object control information into a composite data stream .
US10250913B2 CLAIM 5 . The decoder according to claim 4 , wherein the divider is configured to , in accordance with the partition rules (one object) associated with the first and higher-order hierarchy levels , sub-divide into sub-regions of equal size , such that there are an equal number of sub-regions at each hierarchy level .	US20070005795A1 CLAIM 8 . A method of generating an interactive object oriented multimedia file according to claim 1 , wherein said object control data takes the form of messages encapsulated within object control packets and represents parameters for rendering video and graphics objects , for defining the interactive behaviour of said objects , for creating hyperlinks to and from said objects , for defining animation paths for said objects , for defining dynamic media composition parameters , for assigning values to user variables , for redirecting or retargeting the consequences of interactions with objects and other controls from one object (partition rules) to another , for attaching executable behaviours to objects , including voice calls and starting and stop timers , and for defining conditions for the execution of control actions .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision (unique identifiers, video encoder, video frame, following steps, including one, respective data) information includes a partition indication flag indicating whether any of the first set of root regions (compressed media) or the sub-regions at the first or higher-order hierarchy level is sub-divided .	US20070005795A1 CLAIM 23 . An object oriented interactive multimedia file , comprising : a combination of one or more of contiguous self-contained scenes , each said scene comprising scene format definition as the first packet , and a group of one or more data streams following said first packet ; each said data stream apart from first data stream containing objects which may be optionally decoded and displayed according to a dynamic media composition process as specified by object control information in said first data stream ; and each said data stream including one (second subdivision, second set, second subdivision information, second subset, first subdivision) or more single self-contained objects and demarcated by an end stream marker ; said objects each containing it' ; s own control information and formed by combining packet streams ; said packet streams formed by encoding raw interactive multimedia data including at least one or a combination of video , text , audio , music , or graphics elements as a video packet stream , text packet stream , audio packet stream , music packet stream and graphics packet stream respectively . US20070005795A1 CLAIM 31 . A method according to claim 29 of streaming live video content to a user comprising the following steps (second subdivision, second set, second subdivision information, second subset, first subdivision) : said user connecting to a remote server ; and said user selecting a camera location to view within a region handled by the operator/exchange ; US20070005795A1 CLAIM 116 . A system according to claim 12 including a persistent object library on a portable client device for use in dynamic media composition said library being capable of being managed from said remote server , software available to a client for executing library management instructions delivered to it from said remote server , said server capable of querying said library and receiving information about specific objects contained therein , and inserting , updating , or deleting the contents of said library ; and said dynamic media composition engine capable of sourcing object data stream simultaneously both from said library and remote server , if required , said persistent object library storing object information including expiry dates , access permissions , unique identifiers (second subdivision, second set, second subdivision information, second subset, first subdivision) , metadata and state information , said system performing automatic garbage collection on expired objects , access control , library searching , and various other library management tasks . US20070005795A1 CLAIM 119 . A video encoding method as claimed in claim 118 , including generating a video data file including a plurality of said scene packet with respective data (second subdivision, second set, second subdivision information, second subset, first subdivision) streams and user control data . US20070005795A1 CLAIM 120 . A video encoding method as claimed in claim 117 , wherein said video data represents video frame (second subdivision, second set, second subdivision information, second subset, first subdivision) s , audio frames , text and/or graphics . US20070005795A1 CLAIM 151 . A video encoder (second subdivision, second set, second subdivision information, second subset, first subdivision) having components for executing the steps of the video encoding method as claimed in claim 117 . US20070005795A1 CLAIM 161 . A method of providing an interactive video brochure including at least one of steps of : (a) creating a video brochure by specifying (i) the various scenes in the brochure and the various video objects that may occur within each scene , (ii) specifying the preset and user selectable scene navigational controls and the individual composition rules for each scene , (iii) specifying rendering parameters on media objects , (iv) specifying controls on media objects to create forms to collect user feedback , (v) integrating the compressed media (root regions) streams and object control information into a composite data stream .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level from the data stream (bit streams) .	US20070005795A1 CLAIM 18 . A system according to claim 12 including playing mechanism for playing a plurality of video objects simultaneously , each of said video objects capable of originating from a different source , said server capable of opening each of said sources , interleaving the bit streams (data stream) , adding appropriate control information and forwarding the new composite stream to said client .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements associated with the first or second set (unique identifiers, video encoder, video frame, following steps, including one, respective data) of sub-regions from the data stream (bit streams) in a depth-first traversal order .	US20070005795A1 CLAIM 18 . A system according to claim 12 including playing mechanism for playing a plurality of video objects simultaneously , each of said video objects capable of originating from a different source , said server capable of opening each of said sources , interleaving the bit streams (data stream) , adding appropriate control information and forwarding the new composite stream to said client . US20070005795A1 CLAIM 23 . An object oriented interactive multimedia file , comprising : a combination of one or more of contiguous self-contained scenes , each said scene comprising scene format definition as the first packet , and a group of one or more data streams following said first packet ; each said data stream apart from first data stream containing objects which may be optionally decoded and displayed according to a dynamic media composition process as specified by object control information in said first data stream ; and each said data stream including one (second subdivision, second set, second subdivision information, second subset, first subdivision) or more single self-contained objects and demarcated by an end stream marker ; said objects each containing it' ; s own control information and formed by combining packet streams ; said packet streams formed by encoding raw interactive multimedia data including at least one or a combination of video , text , audio , music , or graphics elements as a video packet stream , text packet stream , audio packet stream , music packet stream and graphics packet stream respectively . US20070005795A1 CLAIM 31 . A method according to claim 29 of streaming live video content to a user comprising the following steps (second subdivision, second set, second subdivision information, second subset, first subdivision) : said user connecting to a remote server ; and said user selecting a camera location to view within a region handled by the operator/exchange ; US20070005795A1 CLAIM 116 . A system according to claim 12 including a persistent object library on a portable client device for use in dynamic media composition said library being capable of being managed from said remote server , software available to a client for executing library management instructions delivered to it from said remote server , said server capable of querying said library and receiving information about specific objects contained therein , and inserting , updating , or deleting the contents of said library ; and said dynamic media composition engine capable of sourcing object data stream simultaneously both from said library and remote server , if required , said persistent object library storing object information including expiry dates , access permissions , unique identifiers (second subdivision, second set, second subdivision information, second subset, first subdivision) , metadata and state information , said system performing automatic garbage collection on expired objects , access control , library searching , and various other library management tasks . US20070005795A1 CLAIM 119 . A video encoding method as claimed in claim 118 , including generating a video data file including a plurality of said scene packet with respective data (second subdivision, second set, second subdivision information, second subset, first subdivision) streams and user control data . US20070005795A1 CLAIM 120 . A video encoding method as claimed in claim 117 , wherein said video data represents video frame (second subdivision, second set, second subdivision information, second subset, first subdivision) s , audio frames , text and/or graphics . US20070005795A1 CLAIM 151 . A video encoder (second subdivision, second set, second subdivision information, second subset, first subdivision) having components for executing the steps of the video encoding method as claimed in claim 117 .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream (bit streams) , disjoint from a second subset (unique identifiers, video encoder, video frame, following steps, including one, respective data) of syntax elements of the data stream including the first subdivision (unique identifiers, video encoder, video frame, following steps, including one, respective data) information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20070005795A1 CLAIM 18 . A system according to claim 12 including playing mechanism for playing a plurality of video objects simultaneously , each of said video objects capable of originating from a different source , said server capable of opening each of said sources , interleaving the bit streams (data stream) , adding appropriate control information and forwarding the new composite stream to said client . US20070005795A1 CLAIM 23 . An object oriented interactive multimedia file , comprising : a combination of one or more of contiguous self-contained scenes , each said scene comprising scene format definition as the first packet , and a group of one or more data streams following said first packet ; each said data stream apart from first data stream containing objects which may be optionally decoded and displayed according to a dynamic media composition process as specified by object control information in said first data stream ; and each said data stream including one (second subdivision, second set, second subdivision information, second subset, first subdivision) or more single self-contained objects and demarcated by an end stream marker ; said objects each containing it' ; s own control information and formed by combining packet streams ; said packet streams formed by encoding raw interactive multimedia data including at least one or a combination of video , text , audio , music , or graphics elements as a video packet stream , text packet stream , audio packet stream , music packet stream and graphics packet stream respectively . US20070005795A1 CLAIM 31 . A method according to claim 29 of streaming live video content to a user comprising the following steps (second subdivision, second set, second subdivision information, second subset, first subdivision) : said user connecting to a remote server ; and said user selecting a camera location to view within a region handled by the operator/exchange ; US20070005795A1 CLAIM 116 . A system according to claim 12 including a persistent object library on a portable client device for use in dynamic media composition said library being capable of being managed from said remote server , software available to a client for executing library management instructions delivered to it from said remote server , said server capable of querying said library and receiving information about specific objects contained therein , and inserting , updating , or deleting the contents of said library ; and said dynamic media composition engine capable of sourcing object data stream simultaneously both from said library and remote server , if required , said persistent object library storing object information including expiry dates , access permissions , unique identifiers (second subdivision, second set, second subdivision information, second subset, first subdivision) , metadata and state information , said system performing automatic garbage collection on expired objects , access control , library searching , and various other library management tasks . US20070005795A1 CLAIM 119 . A video encoding method as claimed in claim 118 , including generating a video data file including a plurality of said scene packet with respective data (second subdivision, second set, second subdivision information, second subset, first subdivision) streams and user control data . US20070005795A1 CLAIM 120 . A video encoding method as claimed in claim 117 , wherein said video data represents video frame (second subdivision, second set, second subdivision information, second subset, first subdivision) s , audio frames , text and/or graphics . US20070005795A1 CLAIM 151 . A video encoder (second subdivision, second set, second subdivision information, second subset, first subdivision) having components for executing the steps of the video encoding method as claimed in claim 117 .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream (bit streams) , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	US20070005795A1 CLAIM 18 . A system according to claim 12 including playing mechanism for playing a plurality of video objects simultaneously , each of said video objects capable of originating from a different source , said server capable of opening each of said sources , interleaving the bit streams (data stream) , adding appropriate control information and forwarding the new composite stream to said client .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream (bit streams) representing encoded video information (generated image) , information related to first and second maximum region sizes , first and second subdivision (unique identifiers, video encoder, video frame, following steps, including one, respective data) information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision (unique identifiers, video encoder, video frame, following steps, including one, respective data) information are associated with prediction coding (receiving input) and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions (compressed media) based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set (unique identifiers, video encoder, video frame, following steps, including one, respective data) of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20070005795A1 CLAIM 18 . A system according to claim 12 including playing mechanism for playing a plurality of video objects simultaneously , each of said video objects capable of originating from a different source , said server capable of opening each of said sources , interleaving the bit streams (data stream) , adding appropriate control information and forwarding the new composite stream to said client . US20070005795A1 CLAIM 19 . A system according to claim 12 including a data source manager capable of randomly accessing said source file , reading the correct data and control packets from said streams which are needed to compose the display scene , and including a server multiplexer capable of receiving input (prediction coding) from multiple source manager instances with single inputs and from said dynamic media composition engine , said multiplexer capable of multiplexing together object data packets from said sources and inserting additional control packets into said data stream for controlling the rendering of component objects in the composite scene . US20070005795A1 CLAIM 23 . An object oriented interactive multimedia file , comprising : a combination of one or more of contiguous self-contained scenes , each said scene comprising scene format definition as the first packet , and a group of one or more data streams following said first packet ; each said data stream apart from first data stream containing objects which may be optionally decoded and displayed according to a dynamic media composition process as specified by object control information in said first data stream ; and each said data stream including one (second subdivision, second set, second subdivision information, second subset, first subdivision) or more single self-contained objects and demarcated by an end stream marker ; said objects each containing it' ; s own control information and formed by combining packet streams ; said packet streams formed by encoding raw interactive multimedia data including at least one or a combination of video , text , audio , music , or graphics elements as a video packet stream , text packet stream , audio packet stream , music packet stream and graphics packet stream respectively . US20070005795A1 CLAIM 31 . A method according to claim 29 of streaming live video content to a user comprising the following steps (second subdivision, second set, second subdivision information, second subset, first subdivision) : said user connecting to a remote server ; and said user selecting a camera location to view within a region handled by the operator/exchange ; US20070005795A1 CLAIM 56 . A method according to claim 42 , wherein said inserting step comprises inserting a computer generated image (video information) of a monitor of a remote computing device . US20070005795A1 CLAIM 116 . A system according to claim 12 including a persistent object library on a portable client device for use in dynamic media composition said library being capable of being managed from said remote server , software available to a client for executing library management instructions delivered to it from said remote server , said server capable of querying said library and receiving information about specific objects contained therein , and inserting , updating , or deleting the contents of said library ; and said dynamic media composition engine capable of sourcing object data stream simultaneously both from said library and remote server , if required , said persistent object library storing object information including expiry dates , access permissions , unique identifiers (second subdivision, second set, second subdivision information, second subset, first subdivision) , metadata and state information , said system performing automatic garbage collection on expired objects , access control , library searching , and various other library management tasks . US20070005795A1 CLAIM 119 . A video encoding method as claimed in claim 118 , including generating a video data file including a plurality of said scene packet with respective data (second subdivision, second set, second subdivision information, second subset, first subdivision) streams and user control data . US20070005795A1 CLAIM 120 . A video encoding method as claimed in claim 117 , wherein said video data represents video frame (second subdivision, second set, second subdivision information, second subset, first subdivision) s , audio frames , text and/or graphics . US20070005795A1 CLAIM 151 . A video encoder (second subdivision, second set, second subdivision information, second subset, first subdivision) having components for executing the steps of the video encoding method as claimed in claim 117 . US20070005795A1 CLAIM 161 . A method of providing an interactive video brochure including at least one of steps of : (a) creating a video brochure by specifying (i) the various scenes in the brochure and the various video objects that may occur within each scene , (ii) specifying the preset and user selectable scene navigational controls and the individual composition rules for each scene , (iii) specifying rendering parameters on media objects , (iv) specifying controls on media objects to create forms to collect user feedback , (v) integrating the compressed media (root regions) streams and object control information into a composite data stream .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information (generated image) into a first set of root regions (compressed media) based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision (unique identifiers, video encoder, video frame, following steps, including one, respective data) information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set (unique identifiers, video encoder, video frame, following steps, including one, respective data) of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (unique identifiers, video encoder, video frame, following steps, including one, respective data) information and a maximum hierarchy level ; and a data stream (bit streams) generator configured to : encode the array of information samples using prediction coding (receiving input) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20070005795A1 CLAIM 18 . A system according to claim 12 including playing mechanism for playing a plurality of video objects simultaneously , each of said video objects capable of originating from a different source , said server capable of opening each of said sources , interleaving the bit streams (data stream) , adding appropriate control information and forwarding the new composite stream to said client . US20070005795A1 CLAIM 19 . A system according to claim 12 including a data source manager capable of randomly accessing said source file , reading the correct data and control packets from said streams which are needed to compose the display scene , and including a server multiplexer capable of receiving input (prediction coding) from multiple source manager instances with single inputs and from said dynamic media composition engine , said multiplexer capable of multiplexing together object data packets from said sources and inserting additional control packets into said data stream for controlling the rendering of component objects in the composite scene . US20070005795A1 CLAIM 23 . An object oriented interactive multimedia file , comprising : a combination of one or more of contiguous self-contained scenes , each said scene comprising scene format definition as the first packet , and a group of one or more data streams following said first packet ; each said data stream apart from first data stream containing objects which may be optionally decoded and displayed according to a dynamic media composition process as specified by object control information in said first data stream ; and each said data stream including one (second subdivision, second set, second subdivision information, second subset, first subdivision) or more single self-contained objects and demarcated by an end stream marker ; said objects each containing it' ; s own control information and formed by combining packet streams ; said packet streams formed by encoding raw interactive multimedia data including at least one or a combination of video , text , audio , music , or graphics elements as a video packet stream , text packet stream , audio packet stream , music packet stream and graphics packet stream respectively . US20070005795A1 CLAIM 31 . A method according to claim 29 of streaming live video content to a user comprising the following steps (second subdivision, second set, second subdivision information, second subset, first subdivision) : said user connecting to a remote server ; and said user selecting a camera location to view within a region handled by the operator/exchange ; US20070005795A1 CLAIM 56 . A method according to claim 42 , wherein said inserting step comprises inserting a computer generated image (video information) of a monitor of a remote computing device . US20070005795A1 CLAIM 116 . A system according to claim 12 including a persistent object library on a portable client device for use in dynamic media composition said library being capable of being managed from said remote server , software available to a client for executing library management instructions delivered to it from said remote server , said server capable of querying said library and receiving information about specific objects contained therein , and inserting , updating , or deleting the contents of said library ; and said dynamic media composition engine capable of sourcing object data stream simultaneously both from said library and remote server , if required , said persistent object library storing object information including expiry dates , access permissions , unique identifiers (second subdivision, second set, second subdivision information, second subset, first subdivision) , metadata and state information , said system performing automatic garbage collection on expired objects , access control , library searching , and various other library management tasks . US20070005795A1 CLAIM 119 . A video encoding method as claimed in claim 118 , including generating a video data file including a plurality of said scene packet with respective data (second subdivision, second set, second subdivision information, second subset, first subdivision) streams and user control data . US20070005795A1 CLAIM 120 . A video encoding method as claimed in claim 117 , wherein said video data represents video frame (second subdivision, second set, second subdivision information, second subset, first subdivision) s , audio frames , text and/or graphics . US20070005795A1 CLAIM 151 . A video encoder (second subdivision, second set, second subdivision information, second subset, first subdivision) having components for executing the steps of the video encoding method as claimed in claim 117 . US20070005795A1 CLAIM 161 . A method of providing an interactive video brochure including at least one of steps of : (a) creating a video brochure by specifying (i) the various scenes in the brochure and the various video objects that may occur within each scene , (ii) specifying the preset and user selectable scene navigational controls and the individual composition rules for each scene , (iii) specifying rendering parameters on media objects , (iv) specifying controls on media objects to create forms to collect user feedback , (v) integrating the compressed media (root regions) streams and object control information into a composite data stream .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information (generated image) into a first set of root regions (compressed media) based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision (unique identifiers, video encoder, video frame, following steps, including one, respective data) information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set (unique identifiers, video encoder, video frame, following steps, including one, respective data) of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (unique identifiers, video encoder, video frame, following steps, including one, respective data) information and a maximum hierarchy level ; encoding the array of information samples using prediction coding (receiving input) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream (bit streams) the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20070005795A1 CLAIM 18 . A system according to claim 12 including playing mechanism for playing a plurality of video objects simultaneously , each of said video objects capable of originating from a different source , said server capable of opening each of said sources , interleaving the bit streams (data stream) , adding appropriate control information and forwarding the new composite stream to said client . US20070005795A1 CLAIM 19 . A system according to claim 12 including a data source manager capable of randomly accessing said source file , reading the correct data and control packets from said streams which are needed to compose the display scene , and including a server multiplexer capable of receiving input (prediction coding) from multiple source manager instances with single inputs and from said dynamic media composition engine , said multiplexer capable of multiplexing together object data packets from said sources and inserting additional control packets into said data stream for controlling the rendering of component objects in the composite scene . US20070005795A1 CLAIM 23 . An object oriented interactive multimedia file , comprising : a combination of one or more of contiguous self-contained scenes , each said scene comprising scene format definition as the first packet , and a group of one or more data streams following said first packet ; each said data stream apart from first data stream containing objects which may be optionally decoded and displayed according to a dynamic media composition process as specified by object control information in said first data stream ; and each said data stream including one (second subdivision, second set, second subdivision information, second subset, first subdivision) or more single self-contained objects and demarcated by an end stream marker ; said objects each containing it' ; s own control information and formed by combining packet streams ; said packet streams formed by encoding raw interactive multimedia data including at least one or a combination of video , text , audio , music , or graphics elements as a video packet stream , text packet stream , audio packet stream , music packet stream and graphics packet stream respectively . US20070005795A1 CLAIM 31 . A method according to claim 29 of streaming live video content to a user comprising the following steps (second subdivision, second set, second subdivision information, second subset, first subdivision) : said user connecting to a remote server ; and said user selecting a camera location to view within a region handled by the operator/exchange ; US20070005795A1 CLAIM 56 . A method according to claim 42 , wherein said inserting step comprises inserting a computer generated image (video information) of a monitor of a remote computing device . US20070005795A1 CLAIM 116 . A system according to claim 12 including a persistent object library on a portable client device for use in dynamic media composition said library being capable of being managed from said remote server , software available to a client for executing library management instructions delivered to it from said remote server , said server capable of querying said library and receiving information about specific objects contained therein , and inserting , updating , or deleting the contents of said library ; and said dynamic media composition engine capable of sourcing object data stream simultaneously both from said library and remote server , if required , said persistent object library storing object information including expiry dates , access permissions , unique identifiers (second subdivision, second set, second subdivision information, second subset, first subdivision) , metadata and state information , said system performing automatic garbage collection on expired objects , access control , library searching , and various other library management tasks . US20070005795A1 CLAIM 119 . A video encoding method as claimed in claim 118 , including generating a video data file including a plurality of said scene packet with respective data (second subdivision, second set, second subdivision information, second subset, first subdivision) streams and user control data . US20070005795A1 CLAIM 120 . A video encoding method as claimed in claim 117 , wherein said video data represents video frame (second subdivision, second set, second subdivision information, second subset, first subdivision) s , audio frames , text and/or graphics . US20070005795A1 CLAIM 151 . A video encoder (second subdivision, second set, second subdivision information, second subset, first subdivision) having components for executing the steps of the video encoding method as claimed in claim 117 . US20070005795A1 CLAIM 161 . A method of providing an interactive video brochure including at least one of steps of : (a) creating a video brochure by specifying (i) the various scenes in the brochure and the various video objects that may occur within each scene , (ii) specifying the preset and user selectable scene navigational controls and the individual composition rules for each scene , (iii) specifying rendering parameters on media objects , (iv) specifying controls on media objects to create forms to collect user feedback , (v) integrating the compressed media (root regions) streams and object control information into a composite data stream .
US10250913B2 CLAIM 15 . A non-transitory computer readable digital storage medium having stored thereon a computer program (computer program) having a program code for performing , when running on a computer , a method according to claim 12 .	US20070005795A1 CLAIM 156 . A computer program (computer program) stored on a computer readable storage medium including code for executing a video decoding method as claimed in claim 135 and generating a video display including controls for said video objects , and adjusting said display in response to application of said controls .
US10250913B2 CLAIM 16 . A non-transitory computer readable digital storage medium having stored thereon a computer program (computer program) having a program code for performing , when running on a computer , a method according to claim 14 .	US20070005795A1 CLAIM 156 . A computer program (computer program) stored on a computer readable storage medium including code for executing a video decoding method as claimed in claim 135 and generating a video display including controls for said video objects , and adjusting said display in response to application of said controls .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20070160133A1 Filed: 2006-08-18 Issued: 2007-07-12 Video coding with fine granularity spatial scalability (Original Assignee) Qualcomm Inc (Current Assignee) Qualcomm Inc Yiliang Bao, Yan Ye
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision (default value) information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding (code one) ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20070160133A1 CLAIM 9 . The method of claim 2 , further comprising decoding a block in the FGS enhancement layer using a special DC mode in which a DC coefficient is predicted from a default value (first subdivision) known to both an encoder and a decoder and AC coefficients are decoded without a prediction calculated from neighboring blocks . US20070160133A1 CLAIM 11 . The method of claim 2 , further comprising upsampling a significance map from the base layer , and using the upsampled significance map to decode one (transform coding) or more of the enhancement layers .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision (default value) information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20070160133A1 CLAIM 9 . The method of claim 2 , further comprising decoding a block in the FGS enhancement layer using a special DC mode in which a DC coefficient is predicted from a default value (first subdivision) known to both an encoder and a decoder and AC coefficients are decoded without a prediction calculated from neighboring blocks .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision (default value) information includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level is sub-divided .	US20070160133A1 CLAIM 9 . The method of claim 2 , further comprising decoding a block in the FGS enhancement layer using a special DC mode in which a DC coefficient is predicted from a default value (first subdivision) known to both an encoder and a decoder and AC coefficients are decoded without a prediction calculated from neighboring blocks .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements (syntax element, video coding) associated with the first or second set of sub-regions from the data stream in a depth-first traversal order .	US20070160133A1 CLAIM 1 . A video coding (syntax elements) method comprising : decoding a fine granularity scalability (FGS) base layer to reconstruct a base layer video block defining video at a first spatial resolution ; at least partially decoding one or more FGS enhancement layers to reconstruct an enhancement layer video block defining video at a second spatial resolution greater or equal to the first spatial resolution ; and predicting an intra-coded video block based on a weighted sum of a first prediction block formed from the base layer video block and a second prediction block formed from neighboring pixels in the enhancement layer video block . US20070160133A1 CLAIM 13 . The method of claim 2 , further comprising receiving a 1-bit syntax element (syntax elements) with at least one of the enhancement layers to signal the use of FGS coding for spatial scalability .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements (syntax element, video coding) of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision (default value) information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20070160133A1 CLAIM 1 . A video coding (syntax elements) method comprising : decoding a fine granularity scalability (FGS) base layer to reconstruct a base layer video block defining video at a first spatial resolution ; at least partially decoding one or more FGS enhancement layers to reconstruct an enhancement layer video block defining video at a second spatial resolution greater or equal to the first spatial resolution ; and predicting an intra-coded video block based on a weighted sum of a first prediction block formed from the base layer video block and a second prediction block formed from neighboring pixels in the enhancement layer video block . US20070160133A1 CLAIM 9 . The method of claim 2 , further comprising decoding a block in the FGS enhancement layer using a special DC mode in which a DC coefficient is predicted from a default value (first subdivision) known to both an encoder and a decoder and AC coefficients are decoded without a prediction calculated from neighboring blocks . US20070160133A1 CLAIM 13 . The method of claim 2 , further comprising receiving a 1-bit syntax element (syntax elements) with at least one of the enhancement layers to signal the use of FGS coding for spatial scalability .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding (code one) to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	US20070160133A1 CLAIM 11 . The method of claim 2 , further comprising upsampling a significance map from the base layer , and using the upsampled significance map to decode one (transform coding) or more of the enhancement layers .
US10250913B2 CLAIM 11 . The decoder according to claim 1 , wherein the recursive multi-tree partitioning includes a quadtree partitioning (coding one) technique .	US20070160133A1 CLAIM 1 . A video coding method comprising : decoding a fine granularity scalability (FGS) base layer to reconstruct a base layer video block defining video at a first spatial resolution ; at least partially decoding one (quadtree partitioning, quadtree partitioning technique) or more FGS enhancement layers to reconstruct an enhancement layer video block defining video at a second spatial resolution greater or equal to the first spatial resolution ; and predicting an intra-coded video block based on a weighted sum of a first prediction block formed from the base layer video block and a second prediction block formed from neighboring pixels in the enhancement layer video block .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision (default value) information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding (code one) ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20070160133A1 CLAIM 9 . The method of claim 2 , further comprising decoding a block in the FGS enhancement layer using a special DC mode in which a DC coefficient is predicted from a default value (first subdivision) known to both an encoder and a decoder and AC coefficients are decoded without a prediction calculated from neighboring blocks . US20070160133A1 CLAIM 11 . The method of claim 2 , further comprising upsampling a significance map from the base layer , and using the upsampled significance map to decode one (transform coding) or more of the enhancement layers .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision (default value) information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding (code one) in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20070160133A1 CLAIM 9 . The method of claim 2 , further comprising decoding a block in the FGS enhancement layer using a special DC mode in which a DC coefficient is predicted from a default value (first subdivision) known to both an encoder and a decoder and AC coefficients are decoded without a prediction calculated from neighboring blocks . US20070160133A1 CLAIM 11 . The method of claim 2 , further comprising upsampling a significance map from the base layer , and using the upsampled significance map to decode one (transform coding) or more of the enhancement layers .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision (default value) information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding (code one) in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20070160133A1 CLAIM 9 . The method of claim 2 , further comprising decoding a block in the FGS enhancement layer using a special DC mode in which a DC coefficient is predicted from a default value (first subdivision) known to both an encoder and a decoder and AC coefficients are decoded without a prediction calculated from neighboring blocks . US20070160133A1 CLAIM 11 . The method of claim 2 , further comprising upsampling a significance map from the base layer , and using the upsampled significance map to decode one (transform coding) or more of the enhancement layers .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20080086545A1 Filed: 2006-08-16 Issued: 2008-04-10 Network configuration using configuration parameter inheritance (Original Assignee) Motorola Solutions Inc (Current Assignee) Motorola Solutions Inc Gary P. Fatt, John D. Harper
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream (computer readable medium) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision (one second) information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set (first set) of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set (second set) of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20080086545A1 CLAIM 8 . A computer readable medium (data stream) containing programming instructions that , when executed on a computer , perform the method of claim 1 . US20080086545A1 CLAIM 9 . A method for configuring a network element of a network having a plurality of configuration parameters , the method comprising : segmenting the plurality of configuration parameters into at least one first set (first set) of configuration parameters , each first set of configuration parameters common to a class of network elements , and at least one second (first subdivision, first subdivision information) set of configuration parameters , each second set (second set) of parameters common to a sub-class of a class of network elements ; and generating a new member of an existing sub-class of network elements if all of the configuration parameters of the network element are common with the second set of parameters of the existing sub-class of network elements .
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set (first set) of sub-regions : compute a prediction signal based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset of the second set (second set) of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	US20080086545A1 CLAIM 9 . A method for configuring a network element of a network having a plurality of configuration parameters , the method comprising : segmenting the plurality of configuration parameters into at least one first set (first set) of configuration parameters , each first set of configuration parameters common to a class of network elements , and at least one second set (second set) of configuration parameters , each second set of parameters common to a sub-class of a class of network elements ; and generating a new member of an existing sub-class of network elements if all of the configuration parameters of the network element are common with the second set of parameters of the existing sub-class of network elements .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set (first set) of root regions such that the first set of root regions are rectangular blocks of a size determined by the first maximum region size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	US20080086545A1 CLAIM 9 . A method for configuring a network element of a network having a plurality of configuration parameters , the method comprising : segmenting the plurality of configuration parameters into at least one first set (first set) of configuration parameters , each first set of configuration parameters common to a class of network elements , and at least one second set of configuration parameters , each second set of parameters common to a sub-class of a class of network elements ; and generating a new member of an existing sub-class of network elements if all of the configuration parameters of the network element are common with the second set of parameters of the existing sub-class of network elements .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set (first set) of root regions , determine whether the first subdivision (one second) information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20080086545A1 CLAIM 9 . A method for configuring a network element of a network having a plurality of configuration parameters , the method comprising : segmenting the plurality of configuration parameters into at least one first set (first set) of configuration parameters , each first set of configuration parameters common to a class of network elements , and at least one second (first subdivision, first subdivision information) set of configuration parameters , each second set of parameters common to a sub-class of a class of network elements ; and generating a new member of an existing sub-class of network elements if all of the configuration parameters of the network element are common with the second set of parameters of the existing sub-class of network elements .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision (one second) information includes a partition indication flag indicating whether any of the first set (first set) of root regions or the sub-regions at the first or higher-order hierarchy level is sub-divided .	US20080086545A1 CLAIM 9 . A method for configuring a network element of a network having a plurality of configuration parameters , the method comprising : segmenting the plurality of configuration parameters into at least one first set (first set) of configuration parameters , each first set of configuration parameters common to a class of network elements , and at least one second (first subdivision, first subdivision information) set of configuration parameters , each second set of parameters common to a sub-class of a class of network elements ; and generating a new member of an existing sub-class of network elements if all of the configuration parameters of the network element are common with the second set of parameters of the existing sub-class of network elements .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level from the data stream (computer readable medium) .	US20080086545A1 CLAIM 8 . A computer readable medium (data stream) containing programming instructions that , when executed on a computer , perform the method of claim 1 .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements associated with the first or second set (second set) of sub-regions from the data stream (computer readable medium) in a depth-first traversal order .	US20080086545A1 CLAIM 8 . A computer readable medium (data stream) containing programming instructions that , when executed on a computer , perform the method of claim 1 . US20080086545A1 CLAIM 9 . A method for configuring a network element of a network having a plurality of configuration parameters , the method comprising : segmenting the plurality of configuration parameters into at least one first set of configuration parameters , each first set of configuration parameters common to a class of network elements , and at least one second set (second set) of configuration parameters , each second set of parameters common to a sub-class of a class of network elements ; and generating a new member of an existing sub-class of network elements if all of the configuration parameters of the network element are common with the second set of parameters of the existing sub-class of network elements .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream (computer readable medium) , disjoint from a second subset of syntax elements of the data stream including the first subdivision (one second) information , spatially neighboring ones of the first set (first set) of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20080086545A1 CLAIM 8 . A computer readable medium (data stream) containing programming instructions that , when executed on a computer , perform the method of claim 1 . US20080086545A1 CLAIM 9 . A method for configuring a network element of a network having a plurality of configuration parameters , the method comprising : segmenting the plurality of configuration parameters into at least one first set (first set) of configuration parameters , each first set of configuration parameters common to a class of network elements , and at least one second (first subdivision, first subdivision information) set of configuration parameters , each second set of parameters common to a sub-class of a class of network elements ; and generating a new member of an existing sub-class of network elements if all of the configuration parameters of the network element are common with the second set of parameters of the existing sub-class of network elements .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream (computer readable medium) , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	US20080086545A1 CLAIM 8 . A computer readable medium (data stream) containing programming instructions that , when executed on a computer , perform the method of claim 1 .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream (computer readable medium) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision (one second) information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set (first set) of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set (second set) of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20080086545A1 CLAIM 8 . A computer readable medium (data stream) containing programming instructions that , when executed on a computer , perform the method of claim 1 . US20080086545A1 CLAIM 9 . A method for configuring a network element of a network having a plurality of configuration parameters , the method comprising : segmenting the plurality of configuration parameters into at least one first set (first set) of configuration parameters , each first set of configuration parameters common to a class of network elements , and at least one second (first subdivision, first subdivision information) set of configuration parameters , each second set (second set) of parameters common to a sub-class of a class of network elements ; and generating a new member of an existing sub-class of network elements if all of the configuration parameters of the network element are common with the second set of parameters of the existing sub-class of network elements .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set (first set) of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision (one second) information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set (second set) of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream (computer readable medium) generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20080086545A1 CLAIM 8 . A computer readable medium (data stream) containing programming instructions that , when executed on a computer , perform the method of claim 1 . US20080086545A1 CLAIM 9 . A method for configuring a network element of a network having a plurality of configuration parameters , the method comprising : segmenting the plurality of configuration parameters into at least one first set (first set) of configuration parameters , each first set of configuration parameters common to a class of network elements , and at least one second (first subdivision, first subdivision information) set of configuration parameters , each second set (second set) of parameters common to a sub-class of a class of network elements ; and generating a new member of an existing sub-class of network elements if all of the configuration parameters of the network element are common with the second set of parameters of the existing sub-class of network elements .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set (first set) of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision (one second) information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set (second set) of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream (computer readable medium) the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20080086545A1 CLAIM 8 . A computer readable medium (data stream) containing programming instructions that , when executed on a computer , perform the method of claim 1 . US20080086545A1 CLAIM 9 . A method for configuring a network element of a network having a plurality of configuration parameters , the method comprising : segmenting the plurality of configuration parameters into at least one first set (first set) of configuration parameters , each first set of configuration parameters common to a class of network elements , and at least one second (first subdivision, first subdivision information) set of configuration parameters , each second set (second set) of parameters common to a sub-class of a class of network elements ; and generating a new member of an existing sub-class of network elements if all of the configuration parameters of the network element are common with the second set of parameters of the existing sub-class of network elements .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20100014590A1 Filed: 2006-08-11 Issued: 2010-01-21 Image data processing (Original Assignee) Electrosonic Ltd (Current Assignee) RGB Systems Inc Peter Lionel Smith
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream (equal length, data stream) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information (respective data) , and a maximum hierarchy (subsequent transformations, tree structure) level wherein the first maximum region size (repeating step) and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20100014590A1 CLAIM 1 . A method of encoding an input sequence of data bits by forming a tree structure (maximum hierarchy, quadtree partitioning, maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level, quadtree partitioning technique) , the method comprising : (a) forming groups of data bits from the input sequence of data bits and logically combining the data bits within each group to form a sequence of first-stage logic output bits ; (b) repeating step (first maximum region size) (a) iteratively , by forming groups of logic output bits from the first-stage logic output bits and logically combining logic output bits within each group to form a sequence of intermediate logic output bits , until there is a single final logic output bit ; and (c) generating an encoded output bit stream comprising said final logic output bit and any or all of the logic output bits and any or all of the data bits of the input data sequence , in dependence on at least a first exclusion condition that , if a given logic output bit is equal to a first predetermined value , which uniquely defines the data bits and any logic output bits which have been used to generate said given logic output bit , then said uniquely-defined data bits and said uniquely-defined logic output bits are excluded from said output bit stream , wherein the input sequence of data bits comprises one of a plurality of rows of bits which collectively define a bit plane of a block of image data which has been transformed in accordance with a wavelet transform , a bit plane being defined as a plane formed from the respective bits of equal significance with the transformed block of image data . US20100014590A1 CLAIM 32 . A method of performing a first transformation on each of a first and a second data group to generate first and second transformed data groups respectively , and performing a plurality of subsequent transformations (maximum hierarchy, quadtree partitioning, maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level, quadtree partitioning technique) on each of the first and second transformed data groups , the method comprising , in sequence : performing said first transformation on said first data group using a first transform engine ; and performing all of said subsequent transformations on said transformed first data group using a second transform engine within a time interval which at least partly overlaps a time interval within which said first transform engine performs said first transformation on said second data group . US20100014590A1 CLAIM 72 . A method of configuring a plurality of variable-length data blocks into a data stream (data stream, data stream generator) from which each data block can subsequently be retrieved , wherein each data block maps to a block of pixels within a frame of image data , the method comprising : for each data block , forming a respective indexed data block comprising : a sync word which is identical for each indexed data block ; an index number which uniquely identifies the data block within said plurality of data blocks ; and the respective data (second subdivision information) block . US20100014590A1 CLAIM 76 . A method as claimed in claim 72 , wherein all of the index numbers comprise bits sequences of equal length (data stream, data stream generator) .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set of root regions such that the first set of root regions are rectangular blocks of a size determined by the first maximum region size (repeating step) , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	US20100014590A1 CLAIM 1 . A method of encoding an input sequence of data bits by forming a tree structure , the method comprising : (a) forming groups of data bits from the input sequence of data bits and logically combining the data bits within each group to form a sequence of first-stage logic output bits ; (b) repeating step (first maximum region size) (a) iteratively , by forming groups of logic output bits from the first-stage logic output bits and logically combining logic output bits within each group to form a sequence of intermediate logic output bits , until there is a single final logic output bit ; and (c) generating an encoded output bit stream comprising said final logic output bit and any or all of the logic output bits and any or all of the data bits of the input data sequence , in dependence on at least a first exclusion condition that , if a given logic output bit is equal to a first predetermined value , which uniquely defines the data bits and any logic output bits which have been used to generate said given logic output bit , then said uniquely-defined data bits and said uniquely-defined logic output bits are excluded from said output bit stream , wherein the input sequence of data bits comprises one of a plurality of rows of bits which collectively define a bit plane of a block of image data which has been transformed in accordance with a wavelet transform , a bit plane being defined as a plane formed from the respective bits of equal significance with the transformed block of image data .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level (subsequent transformations, tree structure) (subsequent transformations, tree structure) according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy (subsequent transformations, tree structure) level is reached .	US20100014590A1 CLAIM 1 . A method of encoding an input sequence of data bits by forming a tree structure (maximum hierarchy, quadtree partitioning, maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level, quadtree partitioning technique) , the method comprising : (a) forming groups of data bits from the input sequence of data bits and logically combining the data bits within each group to form a sequence of first-stage logic output bits ; (b) repeating step (a) iteratively , by forming groups of logic output bits from the first-stage logic output bits and logically combining logic output bits within each group to form a sequence of intermediate logic output bits , until there is a single final logic output bit ; and (c) generating an encoded output bit stream comprising said final logic output bit and any or all of the logic output bits and any or all of the data bits of the input data sequence , in dependence on at least a first exclusion condition that , if a given logic output bit is equal to a first predetermined value , which uniquely defines the data bits and any logic output bits which have been used to generate said given logic output bit , then said uniquely-defined data bits and said uniquely-defined logic output bits are excluded from said output bit stream , wherein the input sequence of data bits comprises one of a plurality of rows of bits which collectively define a bit plane of a block of image data which has been transformed in accordance with a wavelet transform , a bit plane being defined as a plane formed from the respective bits of equal significance with the transformed block of image data . US20100014590A1 CLAIM 32 . A method of performing a first transformation on each of a first and a second data group to generate first and second transformed data groups respectively , and performing a plurality of subsequent transformations (maximum hierarchy, quadtree partitioning, maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level, quadtree partitioning technique) on each of the first and second transformed data groups , the method comprising , in sequence : performing said first transformation on said first data group using a first transform engine ; and performing all of said subsequent transformations on said transformed first data group using a second transform engine within a time interval which at least partly overlaps a time interval within which said first transform engine performs said first transformation on said second data group .
US10250913B2 CLAIM 5 . The decoder according to claim 4 , wherein the divider is configured to , in accordance with the partition rules associated with the first and higher-order hierarchy levels , sub-divide into sub-regions of equal size , such that there are an equal number of sub-regions at each hierarchy level (subsequent transformations, tree structure) .	US20100014590A1 CLAIM 1 . A method of encoding an input sequence of data bits by forming a tree structure (maximum hierarchy, quadtree partitioning, maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level, quadtree partitioning technique) , the method comprising : (a) forming groups of data bits from the input sequence of data bits and logically combining the data bits within each group to form a sequence of first-stage logic output bits ; (b) repeating step (a) iteratively , by forming groups of logic output bits from the first-stage logic output bits and logically combining logic output bits within each group to form a sequence of intermediate logic output bits , until there is a single final logic output bit ; and (c) generating an encoded output bit stream comprising said final logic output bit and any or all of the logic output bits and any or all of the data bits of the input data sequence , in dependence on at least a first exclusion condition that , if a given logic output bit is equal to a first predetermined value , which uniquely defines the data bits and any logic output bits which have been used to generate said given logic output bit , then said uniquely-defined data bits and said uniquely-defined logic output bits are excluded from said output bit stream , wherein the input sequence of data bits comprises one of a plurality of rows of bits which collectively define a bit plane of a block of image data which has been transformed in accordance with a wavelet transform , a bit plane being defined as a plane formed from the respective bits of equal significance with the transformed block of image data . US20100014590A1 CLAIM 32 . A method of performing a first transformation on each of a first and a second data group to generate first and second transformed data groups respectively , and performing a plurality of subsequent transformations (maximum hierarchy, quadtree partitioning, maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level, quadtree partitioning technique) on each of the first and second transformed data groups , the method comprising , in sequence : performing said first transformation on said first data group using a first transform engine ; and performing all of said subsequent transformations on said transformed first data group using a second transform engine within a time interval which at least partly overlaps a time interval within which said first transform engine performs said first transformation on said second data group .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision information includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level (subsequent transformations, tree structure) is sub-divided .	US20100014590A1 CLAIM 1 . A method of encoding an input sequence of data bits by forming a tree structure (maximum hierarchy, quadtree partitioning, maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level, quadtree partitioning technique) , the method comprising : (a) forming groups of data bits from the input sequence of data bits and logically combining the data bits within each group to form a sequence of first-stage logic output bits ; (b) repeating step (a) iteratively , by forming groups of logic output bits from the first-stage logic output bits and logically combining logic output bits within each group to form a sequence of intermediate logic output bits , until there is a single final logic output bit ; and (c) generating an encoded output bit stream comprising said final logic output bit and any or all of the logic output bits and any or all of the data bits of the input data sequence , in dependence on at least a first exclusion condition that , if a given logic output bit is equal to a first predetermined value , which uniquely defines the data bits and any logic output bits which have been used to generate said given logic output bit , then said uniquely-defined data bits and said uniquely-defined logic output bits are excluded from said output bit stream , wherein the input sequence of data bits comprises one of a plurality of rows of bits which collectively define a bit plane of a block of image data which has been transformed in accordance with a wavelet transform , a bit plane being defined as a plane formed from the respective bits of equal significance with the transformed block of image data . US20100014590A1 CLAIM 32 . A method of performing a first transformation on each of a first and a second data group to generate first and second transformed data groups respectively , and performing a plurality of subsequent transformations (maximum hierarchy, quadtree partitioning, maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level, quadtree partitioning technique) on each of the first and second transformed data groups , the method comprising , in sequence : performing said first transformation on said first data group using a first transform engine ; and performing all of said subsequent transformations on said transformed first data group using a second transform engine within a time interval which at least partly overlaps a time interval within which said first transform engine performs said first transformation on said second data group .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy (subsequent transformations, tree structure) level from the data stream (equal length, data stream) .	US20100014590A1 CLAIM 1 . A method of encoding an input sequence of data bits by forming a tree structure (maximum hierarchy, quadtree partitioning, maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level, quadtree partitioning technique) , the method comprising : (a) forming groups of data bits from the input sequence of data bits and logically combining the data bits within each group to form a sequence of first-stage logic output bits ; (b) repeating step (a) iteratively , by forming groups of logic output bits from the first-stage logic output bits and logically combining logic output bits within each group to form a sequence of intermediate logic output bits , until there is a single final logic output bit ; and (c) generating an encoded output bit stream comprising said final logic output bit and any or all of the logic output bits and any or all of the data bits of the input data sequence , in dependence on at least a first exclusion condition that , if a given logic output bit is equal to a first predetermined value , which uniquely defines the data bits and any logic output bits which have been used to generate said given logic output bit , then said uniquely-defined data bits and said uniquely-defined logic output bits are excluded from said output bit stream , wherein the input sequence of data bits comprises one of a plurality of rows of bits which collectively define a bit plane of a block of image data which has been transformed in accordance with a wavelet transform , a bit plane being defined as a plane formed from the respective bits of equal significance with the transformed block of image data . US20100014590A1 CLAIM 32 . A method of performing a first transformation on each of a first and a second data group to generate first and second transformed data groups respectively , and performing a plurality of subsequent transformations (maximum hierarchy, quadtree partitioning, maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level, quadtree partitioning technique) on each of the first and second transformed data groups , the method comprising , in sequence : performing said first transformation on said first data group using a first transform engine ; and performing all of said subsequent transformations on said transformed first data group using a second transform engine within a time interval which at least partly overlaps a time interval within which said first transform engine performs said first transformation on said second data group . US20100014590A1 CLAIM 72 . A method of configuring a plurality of variable-length data blocks into a data stream (data stream, data stream generator) from which each data block can subsequently be retrieved , wherein each data block maps to a block of pixels within a frame of image data , the method comprising : for each data block , forming a respective indexed data block comprising : a sync word which is identical for each indexed data block ; an index number which uniquely identifies the data block within said plurality of data blocks ; and the respective data block . US20100014590A1 CLAIM 76 . A method as claimed in claim 72 , wherein all of the index numbers comprise bits sequences of equal length (data stream, data stream generator) .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements associated with the first or second set of sub-regions from the data stream (equal length, data stream) in a depth-first traversal order .	US20100014590A1 CLAIM 72 . A method of configuring a plurality of variable-length data blocks into a data stream (data stream, data stream generator) from which each data block can subsequently be retrieved , wherein each data block maps to a block of pixels within a frame of image data , the method comprising : for each data block , forming a respective indexed data block comprising : a sync word which is identical for each indexed data block ; an index number which uniquely identifies the data block within said plurality of data blocks ; and the respective data block . US20100014590A1 CLAIM 76 . A method as claimed in claim 72 , wherein all of the index numbers comprise bits sequences of equal length (data stream, data stream generator) .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream (equal length, data stream) , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20100014590A1 CLAIM 72 . A method of configuring a plurality of variable-length data blocks into a data stream (data stream, data stream generator) from which each data block can subsequently be retrieved , wherein each data block maps to a block of pixels within a frame of image data , the method comprising : for each data block , forming a respective indexed data block comprising : a sync word which is identical for each indexed data block ; an index number which uniquely identifies the data block within said plurality of data blocks ; and the respective data block . US20100014590A1 CLAIM 76 . A method as claimed in claim 72 , wherein all of the index numbers comprise bits sequences of equal length (data stream, data stream generator) .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream (equal length, data stream) , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	US20100014590A1 CLAIM 72 . A method of configuring a plurality of variable-length data blocks into a data stream (data stream, data stream generator) from which each data block can subsequently be retrieved , wherein each data block maps to a block of pixels within a frame of image data , the method comprising : for each data block , forming a respective indexed data block comprising : a sync word which is identical for each indexed data block ; an index number which uniquely identifies the data block within said plurality of data blocks ; and the respective data block . US20100014590A1 CLAIM 76 . A method as claimed in claim 72 , wherein all of the index numbers comprise bits sequences of equal length (data stream, data stream generator) .
US10250913B2 CLAIM 11 . The decoder according to claim 1 , wherein the recursive multi-tree partitioning includes a quadtree partitioning (subsequent transformations, tree structure) technique .	US20100014590A1 CLAIM 1 . A method of encoding an input sequence of data bits by forming a tree structure (maximum hierarchy, quadtree partitioning, maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level, quadtree partitioning technique) , the method comprising : (a) forming groups of data bits from the input sequence of data bits and logically combining the data bits within each group to form a sequence of first-stage logic output bits ; (b) repeating step (a) iteratively , by forming groups of logic output bits from the first-stage logic output bits and logically combining logic output bits within each group to form a sequence of intermediate logic output bits , until there is a single final logic output bit ; and (c) generating an encoded output bit stream comprising said final logic output bit and any or all of the logic output bits and any or all of the data bits of the input data sequence , in dependence on at least a first exclusion condition that , if a given logic output bit is equal to a first predetermined value , which uniquely defines the data bits and any logic output bits which have been used to generate said given logic output bit , then said uniquely-defined data bits and said uniquely-defined logic output bits are excluded from said output bit stream , wherein the input sequence of data bits comprises one of a plurality of rows of bits which collectively define a bit plane of a block of image data which has been transformed in accordance with a wavelet transform , a bit plane being defined as a plane formed from the respective bits of equal significance with the transformed block of image data . US20100014590A1 CLAIM 32 . A method of performing a first transformation on each of a first and a second data group to generate first and second transformed data groups respectively , and performing a plurality of subsequent transformations (maximum hierarchy, quadtree partitioning, maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level, quadtree partitioning technique) on each of the first and second transformed data groups , the method comprising , in sequence : performing said first transformation on said first data group using a first transform engine ; and performing all of said subsequent transformations on said transformed first data group using a second transform engine within a time interval which at least partly overlaps a time interval within which said first transform engine performs said first transformation on said second data group .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream (equal length, data stream) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information (respective data) , and a maximum hierarchy (subsequent transformations, tree structure) level , wherein the first maximum region size (repeating step) and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20100014590A1 CLAIM 1 . A method of encoding an input sequence of data bits by forming a tree structure (maximum hierarchy, quadtree partitioning, maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level, quadtree partitioning technique) , the method comprising : (a) forming groups of data bits from the input sequence of data bits and logically combining the data bits within each group to form a sequence of first-stage logic output bits ; (b) repeating step (first maximum region size) (a) iteratively , by forming groups of logic output bits from the first-stage logic output bits and logically combining logic output bits within each group to form a sequence of intermediate logic output bits , until there is a single final logic output bit ; and (c) generating an encoded output bit stream comprising said final logic output bit and any or all of the logic output bits and any or all of the data bits of the input data sequence , in dependence on at least a first exclusion condition that , if a given logic output bit is equal to a first predetermined value , which uniquely defines the data bits and any logic output bits which have been used to generate said given logic output bit , then said uniquely-defined data bits and said uniquely-defined logic output bits are excluded from said output bit stream , wherein the input sequence of data bits comprises one of a plurality of rows of bits which collectively define a bit plane of a block of image data which has been transformed in accordance with a wavelet transform , a bit plane being defined as a plane formed from the respective bits of equal significance with the transformed block of image data . US20100014590A1 CLAIM 32 . A method of performing a first transformation on each of a first and a second data group to generate first and second transformed data groups respectively , and performing a plurality of subsequent transformations (maximum hierarchy, quadtree partitioning, maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level, quadtree partitioning technique) on each of the first and second transformed data groups , the method comprising , in sequence : performing said first transformation on said first data group using a first transform engine ; and performing all of said subsequent transformations on said transformed first data group using a second transform engine within a time interval which at least partly overlaps a time interval within which said first transform engine performs said first transformation on said second data group . US20100014590A1 CLAIM 72 . A method of configuring a plurality of variable-length data blocks into a data stream (data stream, data stream generator) from which each data block can subsequently be retrieved , wherein each data block maps to a block of pixels within a frame of image data , the method comprising : for each data block , forming a respective indexed data block comprising : a sync word which is identical for each indexed data block ; an index number which uniquely identifies the data block within said plurality of data blocks ; and the respective data (second subdivision information) block . US20100014590A1 CLAIM 76 . A method as claimed in claim 72 , wherein all of the index numbers comprise bits sequences of equal length (data stream, data stream generator) .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size (repeating step) , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information (respective data) and a maximum hierarchy (subsequent transformations, tree structure) level ; and a data stream (equal length, data stream) generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20100014590A1 CLAIM 1 . A method of encoding an input sequence of data bits by forming a tree structure (maximum hierarchy, quadtree partitioning, maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level, quadtree partitioning technique) , the method comprising : (a) forming groups of data bits from the input sequence of data bits and logically combining the data bits within each group to form a sequence of first-stage logic output bits ; (b) repeating step (first maximum region size) (a) iteratively , by forming groups of logic output bits from the first-stage logic output bits and logically combining logic output bits within each group to form a sequence of intermediate logic output bits , until there is a single final logic output bit ; and (c) generating an encoded output bit stream comprising said final logic output bit and any or all of the logic output bits and any or all of the data bits of the input data sequence , in dependence on at least a first exclusion condition that , if a given logic output bit is equal to a first predetermined value , which uniquely defines the data bits and any logic output bits which have been used to generate said given logic output bit , then said uniquely-defined data bits and said uniquely-defined logic output bits are excluded from said output bit stream , wherein the input sequence of data bits comprises one of a plurality of rows of bits which collectively define a bit plane of a block of image data which has been transformed in accordance with a wavelet transform , a bit plane being defined as a plane formed from the respective bits of equal significance with the transformed block of image data . US20100014590A1 CLAIM 32 . A method of performing a first transformation on each of a first and a second data group to generate first and second transformed data groups respectively , and performing a plurality of subsequent transformations (maximum hierarchy, quadtree partitioning, maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level, quadtree partitioning technique) on each of the first and second transformed data groups , the method comprising , in sequence : performing said first transformation on said first data group using a first transform engine ; and performing all of said subsequent transformations on said transformed first data group using a second transform engine within a time interval which at least partly overlaps a time interval within which said first transform engine performs said first transformation on said second data group . US20100014590A1 CLAIM 72 . A method of configuring a plurality of variable-length data blocks into a data stream (data stream, data stream generator) from which each data block can subsequently be retrieved , wherein each data block maps to a block of pixels within a frame of image data , the method comprising : for each data block , forming a respective indexed data block comprising : a sync word which is identical for each indexed data block ; an index number which uniquely identifies the data block within said plurality of data blocks ; and the respective data (second subdivision information) block . US20100014590A1 CLAIM 76 . A method as claimed in claim 72 , wherein all of the index numbers comprise bits sequences of equal length (data stream, data stream generator) .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size (repeating step) ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information (respective data) and a maximum hierarchy (subsequent transformations, tree structure) level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream (equal length, data stream) the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20100014590A1 CLAIM 1 . A method of encoding an input sequence of data bits by forming a tree structure (maximum hierarchy, quadtree partitioning, maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level, quadtree partitioning technique) , the method comprising : (a) forming groups of data bits from the input sequence of data bits and logically combining the data bits within each group to form a sequence of first-stage logic output bits ; (b) repeating step (first maximum region size) (a) iteratively , by forming groups of logic output bits from the first-stage logic output bits and logically combining logic output bits within each group to form a sequence of intermediate logic output bits , until there is a single final logic output bit ; and (c) generating an encoded output bit stream comprising said final logic output bit and any or all of the logic output bits and any or all of the data bits of the input data sequence , in dependence on at least a first exclusion condition that , if a given logic output bit is equal to a first predetermined value , which uniquely defines the data bits and any logic output bits which have been used to generate said given logic output bit , then said uniquely-defined data bits and said uniquely-defined logic output bits are excluded from said output bit stream , wherein the input sequence of data bits comprises one of a plurality of rows of bits which collectively define a bit plane of a block of image data which has been transformed in accordance with a wavelet transform , a bit plane being defined as a plane formed from the respective bits of equal significance with the transformed block of image data . US20100014590A1 CLAIM 32 . A method of performing a first transformation on each of a first and a second data group to generate first and second transformed data groups respectively , and performing a plurality of subsequent transformations (maximum hierarchy, quadtree partitioning, maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level, quadtree partitioning technique) on each of the first and second transformed data groups , the method comprising , in sequence : performing said first transformation on said first data group using a first transform engine ; and performing all of said subsequent transformations on said transformed first data group using a second transform engine within a time interval which at least partly overlaps a time interval within which said first transform engine performs said first transformation on said second data group . US20100014590A1 CLAIM 72 . A method of configuring a plurality of variable-length data blocks into a data stream (data stream, data stream generator) from which each data block can subsequently be retrieved , wherein each data block maps to a block of pixels within a frame of image data , the method comprising : for each data block , forming a respective indexed data block comprising : a sync word which is identical for each indexed data block ; an index number which uniquely identifies the data block within said plurality of data blocks ; and the respective data (second subdivision information) block . US20100014590A1 CLAIM 76 . A method as claimed in claim 72 , wherein all of the index numbers comprise bits sequences of equal length (data stream, data stream generator) .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20060268988A1 Filed: 2006-08-02 Issued: 2006-11-30 Adaptive filtering based upon boundary strength (Original Assignee) Shijun Sun; Shawmin Lei; Hiroyuki Katata (Current Assignee) Dolby Laboratories Licensing Corp Shijun Sun, Shawmin Lei, Hiroyuki Katata
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (same reference) information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20060268988A1 CLAIM 1 . A method for at least one of encoding and decoding an image , said method (root region) comprising : (a) identifying adjacent regions in said image ; (b) examining coding parameters for said adjacent regions ; (c) selectively filtering at least a portion of said regions proximate a boundary between said adjacent regions based upon said coding parameters ; (d) identifying similarities between coding parameters in a luminance channel of said adjacent regions ; and (e) controlling filtering for both the luminance channel and a chrominance channel in said image according to said similarities . US20060268988A1 CLAIM 10 . A method for at least one of encoding and decoding an image , comprising : (a) identifying adjacent regions in said image ; (b) determining a boundary strength for said adjacent regions ; and (c) selectively filtering at least a portion of said regions proximate a boundary between said adjacent regions based upon said boundary strength , wherein , for inter-coded regions with no non-zero transform coefficients , said boundary strength is : (i) a first value when said adjacent regions are predicted based upon different reference frames , and (ii) a second value when said adjacent regions are predicted based upon same reference (second subdivision) frame and have an absolute difference of motion vector with vector components less than a threshold value .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region (said method) into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20060268988A1 CLAIM 1 . A method for at least one of encoding and decoding an image , said method (root region) comprising : (a) identifying adjacent regions in said image ; (b) examining coding parameters for said adjacent regions ; (c) selectively filtering at least a portion of said regions proximate a boundary between said adjacent regions based upon said coding parameters ; (d) identifying similarities between coding parameters in a luminance channel of said adjacent regions ; and (e) controlling filtering for both the luminance channel and a chrominance channel in said image according to said similarities .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (same reference) information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20060268988A1 CLAIM 1 . A method for at least one of encoding and decoding an image , said method (root region) comprising : (a) identifying adjacent regions in said image ; (b) examining coding parameters for said adjacent regions ; (c) selectively filtering at least a portion of said regions proximate a boundary between said adjacent regions based upon said coding parameters ; (d) identifying similarities between coding parameters in a luminance channel of said adjacent regions ; and (e) controlling filtering for both the luminance channel and a chrominance channel in said image according to said similarities . US20060268988A1 CLAIM 10 . A method for at least one of encoding and decoding an image , comprising : (a) identifying adjacent regions in said image ; (b) determining a boundary strength for said adjacent regions ; and (c) selectively filtering at least a portion of said regions proximate a boundary between said adjacent regions based upon said boundary strength , wherein , for inter-coded regions with no non-zero transform coefficients , said boundary strength is : (i) a first value when said adjacent regions are predicted based upon different reference frames , and (ii) a second value when said adjacent regions are predicted based upon same reference (second subdivision) frame and have an absolute difference of motion vector with vector components less than a threshold value .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (same reference) information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20060268988A1 CLAIM 1 . A method for at least one of encoding and decoding an image , said method (root region) comprising : (a) identifying adjacent regions in said image ; (b) examining coding parameters for said adjacent regions ; (c) selectively filtering at least a portion of said regions proximate a boundary between said adjacent regions based upon said coding parameters ; (d) identifying similarities between coding parameters in a luminance channel of said adjacent regions ; and (e) controlling filtering for both the luminance channel and a chrominance channel in said image according to said similarities . US20060268988A1 CLAIM 10 . A method for at least one of encoding and decoding an image , comprising : (a) identifying adjacent regions in said image ; (b) determining a boundary strength for said adjacent regions ; and (c) selectively filtering at least a portion of said regions proximate a boundary between said adjacent regions based upon said boundary strength , wherein , for inter-coded regions with no non-zero transform coefficients , said boundary strength is : (i) a first value when said adjacent regions are predicted based upon different reference frames , and (ii) a second value when said adjacent regions are predicted based upon same reference (second subdivision) frame and have an absolute difference of motion vector with vector components less than a threshold value .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (same reference) information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20060268988A1 CLAIM 1 . A method for at least one of encoding and decoding an image , said method (root region) comprising : (a) identifying adjacent regions in said image ; (b) examining coding parameters for said adjacent regions ; (c) selectively filtering at least a portion of said regions proximate a boundary between said adjacent regions based upon said coding parameters ; (d) identifying similarities between coding parameters in a luminance channel of said adjacent regions ; and (e) controlling filtering for both the luminance channel and a chrominance channel in said image according to said similarities . US20060268988A1 CLAIM 10 . A method for at least one of encoding and decoding an image , comprising : (a) identifying adjacent regions in said image ; (b) determining a boundary strength for said adjacent regions ; and (c) selectively filtering at least a portion of said regions proximate a boundary between said adjacent regions based upon said boundary strength , wherein , for inter-coded regions with no non-zero transform coefficients , said boundary strength is : (i) a first value when said adjacent regions are predicted based upon different reference frames , and (ii) a second value when said adjacent regions are predicted based upon same reference (second subdivision) frame and have an absolute difference of motion vector with vector components less than a threshold value .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20070018994A1 Filed: 2006-07-21 Issued: 2007-01-25 Texture encoding apparatus, texture decoding apparatus, method, and program (Original Assignee) Toshiba Corp (Current Assignee) Toshiba Corp Masahiro Sekine
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream (computer readable medium) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding (macro block) ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20070018994A1 CLAIM 9 . The apparatus according to claim 5 , wherein the block data encoding unit comprises : an attachment unit configured to attach the code book data items to a macro block (transform coding) or the texture set , the macro block containing a plurality of blocks ; and a creation unit configured to create a plurality of index data items of each pixel , the index data items indicating a decoding method using one of the code book data items of each macro block and the code book data items of the texture set , the index data items being added to the code book data items in the block . US20070018994A1 CLAIM 38 . A texture encoding program stored in a computer readable medium (data stream) , comprising : means for instructing a computer to acquire texture data of a texture set provided under a plurality of different conditions ; means for instructing the computer to segment the texture data into a plurality of block data items each of which contains a plurality of pixel data items whose values corresponding to the conditions fall within a first range and whose pixel positions fall within a second range in the texture set ; means for instructing the computer to encode each of the block data items to produce a plurality of encoded block data items ; and means for instructing the computer to concatenate the encoded block data items to generate an encoded data item of the texture set .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level from the data stream (computer readable medium) .	US20070018994A1 CLAIM 38 . A texture encoding program stored in a computer readable medium (data stream) , comprising : means for instructing a computer to acquire texture data of a texture set provided under a plurality of different conditions ; means for instructing the computer to segment the texture data into a plurality of block data items each of which contains a plurality of pixel data items whose values corresponding to the conditions fall within a first range and whose pixel positions fall within a second range in the texture set ; means for instructing the computer to encode each of the block data items to produce a plurality of encoded block data items ; and means for instructing the computer to concatenate the encoded block data items to generate an encoded data item of the texture set .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements associated with the first or second set of sub-regions from the data stream (computer readable medium) in a depth-first traversal order .	US20070018994A1 CLAIM 38 . A texture encoding program stored in a computer readable medium (data stream) , comprising : means for instructing a computer to acquire texture data of a texture set provided under a plurality of different conditions ; means for instructing the computer to segment the texture data into a plurality of block data items each of which contains a plurality of pixel data items whose values corresponding to the conditions fall within a first range and whose pixel positions fall within a second range in the texture set ; means for instructing the computer to encode each of the block data items to produce a plurality of encoded block data items ; and means for instructing the computer to concatenate the encoded block data items to generate an encoded data item of the texture set .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream (computer readable medium) , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20070018994A1 CLAIM 38 . A texture encoding program stored in a computer readable medium (data stream) , comprising : means for instructing a computer to acquire texture data of a texture set provided under a plurality of different conditions ; means for instructing the computer to segment the texture data into a plurality of block data items each of which contains a plurality of pixel data items whose values corresponding to the conditions fall within a first range and whose pixel positions fall within a second range in the texture set ; means for instructing the computer to encode each of the block data items to produce a plurality of encoded block data items ; and means for instructing the computer to concatenate the encoded block data items to generate an encoded data item of the texture set .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream (computer readable medium) , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding (macro block) to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	US20070018994A1 CLAIM 9 . The apparatus according to claim 5 , wherein the block data encoding unit comprises : an attachment unit configured to attach the code book data items to a macro block (transform coding) or the texture set , the macro block containing a plurality of blocks ; and a creation unit configured to create a plurality of index data items of each pixel , the index data items indicating a decoding method using one of the code book data items of each macro block and the code book data items of the texture set , the index data items being added to the code book data items in the block . US20070018994A1 CLAIM 38 . A texture encoding program stored in a computer readable medium (data stream) , comprising : means for instructing a computer to acquire texture data of a texture set provided under a plurality of different conditions ; means for instructing the computer to segment the texture data into a plurality of block data items each of which contains a plurality of pixel data items whose values corresponding to the conditions fall within a first range and whose pixel positions fall within a second range in the texture set ; means for instructing the computer to encode each of the block data items to produce a plurality of encoded block data items ; and means for instructing the computer to concatenate the encoded block data items to generate an encoded data item of the texture set .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream (computer readable medium) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding (macro block) ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20070018994A1 CLAIM 9 . The apparatus according to claim 5 , wherein the block data encoding unit comprises : an attachment unit configured to attach the code book data items to a macro block (transform coding) or the texture set , the macro block containing a plurality of blocks ; and a creation unit configured to create a plurality of index data items of each pixel , the index data items indicating a decoding method using one of the code book data items of each macro block and the code book data items of the texture set , the index data items being added to the code book data items in the block . US20070018994A1 CLAIM 38 . A texture encoding program stored in a computer readable medium (data stream) , comprising : means for instructing a computer to acquire texture data of a texture set provided under a plurality of different conditions ; means for instructing the computer to segment the texture data into a plurality of block data items each of which contains a plurality of pixel data items whose values corresponding to the conditions fall within a first range and whose pixel positions fall within a second range in the texture set ; means for instructing the computer to encode each of the block data items to produce a plurality of encoded block data items ; and means for instructing the computer to concatenate the encoded block data items to generate an encoded data item of the texture set .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream (computer readable medium) generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding (macro block) in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20070018994A1 CLAIM 9 . The apparatus according to claim 5 , wherein the block data encoding unit comprises : an attachment unit configured to attach the code book data items to a macro block (transform coding) or the texture set , the macro block containing a plurality of blocks ; and a creation unit configured to create a plurality of index data items of each pixel , the index data items indicating a decoding method using one of the code book data items of each macro block and the code book data items of the texture set , the index data items being added to the code book data items in the block . US20070018994A1 CLAIM 38 . A texture encoding program stored in a computer readable medium (data stream) , comprising : means for instructing a computer to acquire texture data of a texture set provided under a plurality of different conditions ; means for instructing the computer to segment the texture data into a plurality of block data items each of which contains a plurality of pixel data items whose values corresponding to the conditions fall within a first range and whose pixel positions fall within a second range in the texture set ; means for instructing the computer to encode each of the block data items to produce a plurality of encoded block data items ; and means for instructing the computer to concatenate the encoded block data items to generate an encoded data item of the texture set .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding (macro block) in accordance with the second set of sub-regions ; and inserting into a data stream (computer readable medium) the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20070018994A1 CLAIM 9 . The apparatus according to claim 5 , wherein the block data encoding unit comprises : an attachment unit configured to attach the code book data items to a macro block (transform coding) or the texture set , the macro block containing a plurality of blocks ; and a creation unit configured to create a plurality of index data items of each pixel , the index data items indicating a decoding method using one of the code book data items of each macro block and the code book data items of the texture set , the index data items being added to the code book data items in the block . US20070018994A1 CLAIM 38 . A texture encoding program stored in a computer readable medium (data stream) , comprising : means for instructing a computer to acquire texture data of a texture set provided under a plurality of different conditions ; means for instructing the computer to segment the texture data into a plurality of block data items each of which contains a plurality of pixel data items whose values corresponding to the conditions fall within a first range and whose pixel positions fall within a second range in the texture set ; means for instructing the computer to encode each of the block data items to produce a plurality of encoded block data items ; and means for instructing the computer to concatenate the encoded block data items to generate an encoded data item of the texture set .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20070053441A1 Filed: 2006-06-29 Issued: 2007-03-08 Method and apparatus for update step in video coding using motion compensated temporal filtering (Original Assignee) Nokia Oyj (Current Assignee) Nokia Oyj Xianglin Wang, Marta Karczewicz, Yiliang Bao, Justin Ridge
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set (bitstream representative) of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20070053441A1 CLAIM 1 . A method of encoding a digital video sequence using motion compensated temporal filtering for providing a bitstream having video data representative of encoded video sequence , the digital video sequence comprising a plurality of frames , wherein each frame comprises an array of pixels which can be divided into a plurality of macroblocks , said method (root region) comprising : for a macroblock , selecting a macroblock mode ; segmenting the macroblock into a number of blocks based on the macroblock mode ; performing a prediction operation on said blocks , based on motion compensated prediction with respect to a reference video frame and motion vectors , for providing corresponding blocks of prediction residues ; and updating said video reference frame based on motion compensated prediction with respect to said blocks of prediction residues and the macroblock mode , and further based on a reverse direction of said motion vectors . US20070053441A1 CLAIM 8 . A method of decoding a digital video sequence from video data in a bitstream representative (second set) of an encoded video sequence , the encoded video sequence comprising a number of frames , each frame comprising an array of pixels , wherein the pixels in each frame can be divided into a plurality of macroblocks , said method comprising : for a macroblock , obtaining a macroblock mode ; segmenting the macroblock into a number of blocks based on the macroblock mode ; decoding motion vectors and prediction residues of the blocks ; performing an update operation on a reference video frame of said blocks , based on motion compensated prediction with respect to the prediction residues of said blocks based on said macroblock mode and a reverse direction of the motion vectors ; and performing a prediction operation on said blocks based on motion compensated prediction with respect to updated reference video frame and the motion vectors .
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal (adjacent blocks) based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset of the second set (bitstream representative) of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	US20070053441A1 CLAIM 2 . The method of claim 1 , wherein each of the blocks is associated with one of the motion vectors , said method further comprising : comparing the motion vector associated with one of the blocks with the motion vectors associated with adjacent blocks (prediction signal) for providing a differential vector of said one block ; and skipping said updating with respect to said one block if the differential vector is greater than a predetermined value . US20070053441A1 CLAIM 8 . A method of decoding a digital video sequence from video data in a bitstream representative (second set) of an encoded video sequence , the encoded video sequence comprising a number of frames , each frame comprising an array of pixels , wherein the pixels in each frame can be divided into a plurality of macroblocks , said method comprising : for a macroblock , obtaining a macroblock mode ; segmenting the macroblock into a number of blocks based on the macroblock mode ; decoding motion vectors and prediction residues of the blocks ; performing an update operation on a reference video frame of said blocks , based on motion compensated prediction with respect to the prediction residues of said blocks based on said macroblock mode and a reverse direction of the motion vectors ; and performing a prediction operation on said blocks based on motion compensated prediction with respect to updated reference video frame and the motion vectors .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region (said method) into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20070053441A1 CLAIM 1 . A method of encoding a digital video sequence using motion compensated temporal filtering for providing a bitstream having video data representative of encoded video sequence , the digital video sequence comprising a plurality of frames , wherein each frame comprises an array of pixels which can be divided into a plurality of macroblocks , said method (root region) comprising : for a macroblock , selecting a macroblock mode ; segmenting the macroblock into a number of blocks based on the macroblock mode ; performing a prediction operation on said blocks , based on motion compensated prediction with respect to a reference video frame and motion vectors , for providing corresponding blocks of prediction residues ; and updating said video reference frame based on motion compensated prediction with respect to said blocks of prediction residues and the macroblock mode , and further based on a reverse direction of said motion vectors .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements associated with the first or second set (bitstream representative) of sub-regions from the data stream in a depth-first traversal order .	US20070053441A1 CLAIM 8 . A method of decoding a digital video sequence from video data in a bitstream representative (second set) of an encoded video sequence , the encoded video sequence comprising a number of frames , each frame comprising an array of pixels , wherein the pixels in each frame can be divided into a plurality of macroblocks , said method comprising : for a macroblock , obtaining a macroblock mode ; segmenting the macroblock into a number of blocks based on the macroblock mode ; decoding motion vectors and prediction residues of the blocks ; performing an update operation on a reference video frame of said blocks , based on motion compensated prediction with respect to the prediction residues of said blocks based on said macroblock mode and a reverse direction of the motion vectors ; and performing a prediction operation on said blocks based on motion compensated prediction with respect to updated reference video frame and the motion vectors .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set (bitstream representative) of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20070053441A1 CLAIM 1 . A method of encoding a digital video sequence using motion compensated temporal filtering for providing a bitstream having video data representative of encoded video sequence , the digital video sequence comprising a plurality of frames , wherein each frame comprises an array of pixels which can be divided into a plurality of macroblocks , said method (root region) comprising : for a macroblock , selecting a macroblock mode ; segmenting the macroblock into a number of blocks based on the macroblock mode ; performing a prediction operation on said blocks , based on motion compensated prediction with respect to a reference video frame and motion vectors , for providing corresponding blocks of prediction residues ; and updating said video reference frame based on motion compensated prediction with respect to said blocks of prediction residues and the macroblock mode , and further based on a reverse direction of said motion vectors . US20070053441A1 CLAIM 8 . A method of decoding a digital video sequence from video data in a bitstream representative (second set) of an encoded video sequence , the encoded video sequence comprising a number of frames , each frame comprising an array of pixels , wherein the pixels in each frame can be divided into a plurality of macroblocks , said method comprising : for a macroblock , obtaining a macroblock mode ; segmenting the macroblock into a number of blocks based on the macroblock mode ; decoding motion vectors and prediction residues of the blocks ; performing an update operation on a reference video frame of said blocks , based on motion compensated prediction with respect to the prediction residues of said blocks based on said macroblock mode and a reverse direction of the motion vectors ; and performing a prediction operation on said blocks based on motion compensated prediction with respect to updated reference video frame and the motion vectors .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set (bitstream representative) of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20070053441A1 CLAIM 1 . A method of encoding a digital video sequence using motion compensated temporal filtering for providing a bitstream having video data representative of encoded video sequence , the digital video sequence comprising a plurality of frames , wherein each frame comprises an array of pixels which can be divided into a plurality of macroblocks , said method (root region) comprising : for a macroblock , selecting a macroblock mode ; segmenting the macroblock into a number of blocks based on the macroblock mode ; performing a prediction operation on said blocks , based on motion compensated prediction with respect to a reference video frame and motion vectors , for providing corresponding blocks of prediction residues ; and updating said video reference frame based on motion compensated prediction with respect to said blocks of prediction residues and the macroblock mode , and further based on a reverse direction of said motion vectors . US20070053441A1 CLAIM 8 . A method of decoding a digital video sequence from video data in a bitstream representative (second set) of an encoded video sequence , the encoded video sequence comprising a number of frames , each frame comprising an array of pixels , wherein the pixels in each frame can be divided into a plurality of macroblocks , said method comprising : for a macroblock , obtaining a macroblock mode ; segmenting the macroblock into a number of blocks based on the macroblock mode ; decoding motion vectors and prediction residues of the blocks ; performing an update operation on a reference video frame of said blocks , based on motion compensated prediction with respect to the prediction residues of said blocks based on said macroblock mode and a reverse direction of the motion vectors ; and performing a prediction operation on said blocks based on motion compensated prediction with respect to updated reference video frame and the motion vectors .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set (bitstream representative) of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20070053441A1 CLAIM 1 . A method of encoding a digital video sequence using motion compensated temporal filtering for providing a bitstream having video data representative of encoded video sequence , the digital video sequence comprising a plurality of frames , wherein each frame comprises an array of pixels which can be divided into a plurality of macroblocks , said method (root region) comprising : for a macroblock , selecting a macroblock mode ; segmenting the macroblock into a number of blocks based on the macroblock mode ; performing a prediction operation on said blocks , based on motion compensated prediction with respect to a reference video frame and motion vectors , for providing corresponding blocks of prediction residues ; and updating said video reference frame based on motion compensated prediction with respect to said blocks of prediction residues and the macroblock mode , and further based on a reverse direction of said motion vectors . US20070053441A1 CLAIM 8 . A method of decoding a digital video sequence from video data in a bitstream representative (second set) of an encoded video sequence , the encoded video sequence comprising a number of frames , each frame comprising an array of pixels , wherein the pixels in each frame can be divided into a plurality of macroblocks , said method comprising : for a macroblock , obtaining a macroblock mode ; segmenting the macroblock into a number of blocks based on the macroblock mode ; decoding motion vectors and prediction residues of the blocks ; performing an update operation on a reference video frame of said blocks , based on motion compensated prediction with respect to the prediction residues of said blocks based on said macroblock mode and a reverse direction of the motion vectors ; and performing a prediction operation on said blocks based on motion compensated prediction with respect to updated reference video frame and the motion vectors .
US10250913B2 CLAIM 15 . A non-transitory computer readable digital storage (said video) medium having stored thereon a computer program having a program code (program code) for performing , when running on a computer , a method according to claim 12 .	US20070053441A1 CLAIM 1 . A method of encoding a digital video sequence using motion compensated temporal filtering for providing a bitstream having video data representative of encoded video sequence , the digital video sequence comprising a plurality of frames , wherein each frame comprises an array of pixels which can be divided into a plurality of macroblocks , said method comprising : for a macroblock , selecting a macroblock mode ; segmenting the macroblock into a number of blocks based on the macroblock mode ; performing a prediction operation on said blocks , based on motion compensated prediction with respect to a reference video frame and motion vectors , for providing corresponding blocks of prediction residues ; and updating said video (readable digital storage) reference frame based on motion compensated prediction with respect to said blocks of prediction residues and the macroblock mode , and further based on a reverse direction of said motion vectors . US20070053441A1 CLAIM 29 . A software application product , comprising a storage medium having a software application for encoding a digital video sequence using motion compensated temporal filtering for providing a bitstream having video data representative of encoded video sequence , the digital video sequence comprising a plurality of frames , wherein each frame comprises an array of pixels which can be divided into a plurality of macroblocks , said software application comprising : program code (program code) for selecting a macroblock mode for a macroblock ; program code for segmenting the macroblock into a number of blocks based on the macroblock mode ; program code for performing a prediction operation on said blocks , based on motion compensated prediction with respect to a reference video frame and motion vectors , for providing corresponding blocks of prediction residues ; and program code for updating said video reference frame based on motion compensated prediction with respect to said blocks of prediction residues and the macroblock mode , and further based on a reverse direction of said motion vectors .
US10250913B2 CLAIM 16 . A non-transitory computer readable digital storage (said video) medium having stored thereon a computer program having a program code (program code) for performing , when running on a computer , a method according to claim 14 .	US20070053441A1 CLAIM 1 . A method of encoding a digital video sequence using motion compensated temporal filtering for providing a bitstream having video data representative of encoded video sequence , the digital video sequence comprising a plurality of frames , wherein each frame comprises an array of pixels which can be divided into a plurality of macroblocks , said method comprising : for a macroblock , selecting a macroblock mode ; segmenting the macroblock into a number of blocks based on the macroblock mode ; performing a prediction operation on said blocks , based on motion compensated prediction with respect to a reference video frame and motion vectors , for providing corresponding blocks of prediction residues ; and updating said video (readable digital storage) reference frame based on motion compensated prediction with respect to said blocks of prediction residues and the macroblock mode , and further based on a reverse direction of said motion vectors . US20070053441A1 CLAIM 29 . A software application product , comprising a storage medium having a software application for encoding a digital video sequence using motion compensated temporal filtering for providing a bitstream having video data representative of encoded video sequence , the digital video sequence comprising a plurality of frames , wherein each frame comprises an array of pixels which can be divided into a plurality of macroblocks , said software application comprising : program code (program code) for selecting a macroblock mode for a macroblock ; program code for segmenting the macroblock into a number of blocks based on the macroblock mode ; program code for performing a prediction operation on said blocks , based on motion compensated prediction with respect to a reference video frame and motion vectors , for providing corresponding blocks of prediction residues ; and program code for updating said video reference frame based on motion compensated prediction with respect to said blocks of prediction residues and the macroblock mode , and further based on a reverse direction of said motion vectors .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20070086516A1 Filed: 2006-06-28 Issued: 2007-04-19 Method of encoding flags in layer using inter-layer correlation, method and apparatus for decoding coded flags (Original Assignee) Samsung Electronics Co Ltd (Current Assignee) Samsung Electronics Co Ltd Bae-keun Lee, Woo-jin Han
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream (entropy decoding) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (entropy coding) information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions (R values) based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20070086516A1 CLAIM 2 . The method of claim 1 , further comprising , if it is determined that the flags of the current layer are not equal to the flags of the base layer , entropy coding (second subdivision, intermediate subdivision) the flags of the current layer , and inserting the flags of the base layer , the prediction flag , and the entropy-coded flags of the current layer into the bitstream . US20070086516A1 CLAIM 3 . The method of claim 2 , further comprising performing an exclusive OR values (root regions) on the flags of the current layer and the flags of the base layer prior to the entropy coding , wherein the entropy-coded flags of the current layer are values obtained by the performing of the exclusive OR operation . US20070086516A1 CLAIM 11 . The method of claim 10 , further comprising : reading the encoded flags of the current layer from the input bitstream ; if the prediction flag has a second bit value , performing entropy decoding (data stream) of the encoded flags of the current layer ; performing an exclusive OR operation on a result of the entropy decoding and the read flags of the base layer ; and outputting a result of the performing of the exclusive OR operation .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set of root regions (R values) such that the first set of root regions are rectangular blocks (motion prediction) of a size determined by the first maximum region size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	US20070086516A1 CLAIM 3 . The method of claim 2 , further comprising performing an exclusive OR values (root regions) on the flags of the current layer and the flags of the base layer prior to the entropy coding , wherein the entropy-coded flags of the current layer are values obtained by the performing of the exclusive OR operation . US20070086516A1 CLAIM 5 . The method of claim 1 , wherein the flags of the current layer and the flags of the base layer comprise at least one of a residual prediction flag , an intra base flag , a motion prediction (rectangular blocks) flag , a base mode flag , and a sign flag of a refinement coefficient .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions (R values) , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20070086516A1 CLAIM 3 . The method of claim 2 , further comprising performing an exclusive OR values (root regions) on the flags of the current layer and the flags of the base layer prior to the entropy coding , wherein the entropy-coded flags of the current layer are values obtained by the performing of the exclusive OR operation .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision information includes a partition indication flag indicating whether any of the first set of root regions (R values) or the sub-regions at the first or higher-order hierarchy level is sub-divided .	US20070086516A1 CLAIM 3 . The method of claim 2 , further comprising performing an exclusive OR values (root regions) on the flags of the current layer and the flags of the base layer prior to the entropy coding , wherein the entropy-coded flags of the current layer are values obtained by the performing of the exclusive OR operation .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level from the data stream (entropy decoding) .	US20070086516A1 CLAIM 11 . The method of claim 10 , further comprising : reading the encoded flags of the current layer from the input bitstream ; if the prediction flag has a second bit value , performing entropy decoding (data stream) of the encoded flags of the current layer ; performing an exclusive OR operation on a result of the entropy decoding and the read flags of the base layer ; and outputting a result of the performing of the exclusive OR operation .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements associated with the first or second set of sub-regions from the data stream (entropy decoding) in a depth-first traversal order .	US20070086516A1 CLAIM 11 . The method of claim 10 , further comprising : reading the encoded flags of the current layer from the input bitstream ; if the prediction flag has a second bit value , performing entropy decoding (data stream) of the encoded flags of the current layer ; performing an exclusive OR operation on a result of the entropy decoding and the read flags of the base layer ; and outputting a result of the performing of the exclusive OR operation .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream (entropy decoding) , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision (entropy coding) of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20070086516A1 CLAIM 2 . The method of claim 1 , further comprising , if it is determined that the flags of the current layer are not equal to the flags of the base layer , entropy coding (second subdivision, intermediate subdivision) the flags of the current layer , and inserting the flags of the base layer , the prediction flag , and the entropy-coded flags of the current layer into the bitstream . US20070086516A1 CLAIM 11 . The method of claim 10 , further comprising : reading the encoded flags of the current layer from the input bitstream ; if the prediction flag has a second bit value , performing entropy decoding (data stream) of the encoded flags of the current layer ; performing an exclusive OR operation on a result of the entropy decoding and the read flags of the base layer ; and outputting a result of the performing of the exclusive OR operation .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream (entropy decoding) , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	US20070086516A1 CLAIM 11 . The method of claim 10 , further comprising : reading the encoded flags of the current layer from the input bitstream ; if the prediction flag has a second bit value , performing entropy decoding (data stream) of the encoded flags of the current layer ; performing an exclusive OR operation on a result of the entropy decoding and the read flags of the base layer ; and outputting a result of the performing of the exclusive OR operation .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream (entropy decoding) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (entropy coding) information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions (R values) based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20070086516A1 CLAIM 2 . The method of claim 1 , further comprising , if it is determined that the flags of the current layer are not equal to the flags of the base layer , entropy coding (second subdivision, intermediate subdivision) the flags of the current layer , and inserting the flags of the base layer , the prediction flag , and the entropy-coded flags of the current layer into the bitstream . US20070086516A1 CLAIM 3 . The method of claim 2 , further comprising performing an exclusive OR values (root regions) on the flags of the current layer and the flags of the base layer prior to the entropy coding , wherein the entropy-coded flags of the current layer are values obtained by the performing of the exclusive OR operation . US20070086516A1 CLAIM 11 . The method of claim 10 , further comprising : reading the encoded flags of the current layer from the input bitstream ; if the prediction flag has a second bit value , performing entropy decoding (data stream) of the encoded flags of the current layer ; performing an exclusive OR operation on a result of the entropy decoding and the read flags of the base layer ; and outputting a result of the performing of the exclusive OR operation .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions (R values) based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (entropy coding) information and a maximum hierarchy level ; and a data stream (entropy decoding) generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20070086516A1 CLAIM 2 . The method of claim 1 , further comprising , if it is determined that the flags of the current layer are not equal to the flags of the base layer , entropy coding (second subdivision, intermediate subdivision) the flags of the current layer , and inserting the flags of the base layer , the prediction flag , and the entropy-coded flags of the current layer into the bitstream . US20070086516A1 CLAIM 3 . The method of claim 2 , further comprising performing an exclusive OR values (root regions) on the flags of the current layer and the flags of the base layer prior to the entropy coding , wherein the entropy-coded flags of the current layer are values obtained by the performing of the exclusive OR operation . US20070086516A1 CLAIM 11 . The method of claim 10 , further comprising : reading the encoded flags of the current layer from the input bitstream ; if the prediction flag has a second bit value , performing entropy decoding (data stream) of the encoded flags of the current layer ; performing an exclusive OR operation on a result of the entropy decoding and the read flags of the base layer ; and outputting a result of the performing of the exclusive OR operation .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions (R values) based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (entropy coding) information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream (entropy decoding) the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20070086516A1 CLAIM 2 . The method of claim 1 , further comprising , if it is determined that the flags of the current layer are not equal to the flags of the base layer , entropy coding (second subdivision, intermediate subdivision) the flags of the current layer , and inserting the flags of the base layer , the prediction flag , and the entropy-coded flags of the current layer into the bitstream . US20070086516A1 CLAIM 3 . The method of claim 2 , further comprising performing an exclusive OR values (root regions) on the flags of the current layer and the flags of the base layer prior to the entropy coding , wherein the entropy-coded flags of the current layer are values obtained by the performing of the exclusive OR operation . US20070086516A1 CLAIM 11 . The method of claim 10 , further comprising : reading the encoded flags of the current layer from the input bitstream ; if the prediction flag has a second bit value , performing entropy decoding (data stream) of the encoded flags of the current layer ; performing an exclusive OR operation on a result of the entropy decoding and the read flags of the base layer ; and outputting a result of the performing of the exclusive OR operation .

CN101047733A

Filed: 2006-06-16 Issued: 2007-10-03

短信处理方法以及装置

(Original Assignee) 华为技术有限公司

唐志雄

US10250913B2
CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset (进行读) of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision (模块进行) of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .

CN101047733A
CLAIM 7 . 根据权利要求4所述的短信处理方法，其特征在于，在分析短信内字符的类型之前进一步包括，初始化短信类型为非长短信的步骤；在判断短信类型为长短信时继续进行读 (second subset) 取字符；在再次读取到长短信一次发送的最大长度时截取该长度内的字符。

CN101047733A
CLAIM 15 . 根据权利要求12所述的短信处理装置，其特征在于，在字符类型分析模块判断该字符所属类型为UCS2编码时，由字符偏移量记录模块记录整个短信的长度，在整个短信长度大于70字符情况下，所述短信类型判断模块判断得到该短信的短信类型是长短信，并在字符偏移量记录模块记录的字符偏移量大于67字符情况下，由长短信截取模块将此字符前面的67个字符截取，并由编码模块进行 (intermediate subdivision) 编码。

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20060215919A1 Filed: 2006-05-26 Issued: 2006-09-28 Spatial extrapolation of pixel values in intraframe video coding and decoding (Original Assignee) Microsoft Corp (Current Assignee) Microsoft Technology Licensing LLC Sridhar Srinivasan
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream (entropy decoding) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (processing blocks, video frame) information , and a maximum hierarchy level wherein the first maximum region (causal neighborhood) size and the first subdivision (processing blocks, video frame) information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20060215919A1 CLAIM 1 . In a computer system , a computer-implemented method of processing blocks (first subdivision, second subdivision) of pixels in a video frame (first subdivision, second subdivision) of a video sequence , the method comprising : for a current block of plural pixels in the video frame of the video sequence , identifying plural context pixels in the video frame , wherein the plural context pixels form at least part of a causal neighborhood (first maximum region) for the current block ; predicting a spatial extrapolation mode for the current block based upon plural contextual spatial extrapolation modes , the plural contextual spatial extrapolation modes including a first contextual spatial extrapolation mode for a first causal block above the current block , the plural contextual spatial extrapolation modes further including a second contextual spatial extrapolation mode for a second causal block left of the current block ; computing an actual spatial extrapolation mode for the current block based at least in part upon the predicted spatial extrapolation mode for the current block ; and computing a spatial extrapolation according to the actual spatial extrapolation mode for pixel values of the plural pixels of the current block based at least in part upon pixel values of the plural context pixels , wherein the spatial extrapolation comprises one or more pixel value extrapolations from one or more of the plural context pixels into the current block to thereby spatially predict the pixel values of the plural pixels of the current block . US20060215919A1 CLAIM 40 . The method of claim 38 further comprising entropy decoding (data stream) the received information .
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset (pixel value) of the second set of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	US20060215919A1 CLAIM 1 . In a computer system , a computer-implemented method of processing blocks of pixels in a video frame of a video sequence , the method comprising : for a current block of plural pixels in the video frame of the video sequence , identifying plural context pixels in the video frame , wherein the plural context pixels form at least part of a causal neighborhood for the current block ; predicting a spatial extrapolation mode for the current block based upon plural contextual spatial extrapolation modes , the plural contextual spatial extrapolation modes including a first contextual spatial extrapolation mode for a first causal block above the current block , the plural contextual spatial extrapolation modes further including a second contextual spatial extrapolation mode for a second causal block left of the current block ; computing an actual spatial extrapolation mode for the current block based at least in part upon the predicted spatial extrapolation mode for the current block ; and computing a spatial extrapolation according to the actual spatial extrapolation mode for pixel value (neighboring subset) s of the plural pixels of the current block based at least in part upon pixel values of the plural context pixels , wherein the spatial extrapolation comprises one or more pixel value extrapolations from one or more of the plural context pixels into the current block to thereby spatially predict the pixel values of the plural pixels of the current block .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set of root regions such that the first set of root regions are rectangular blocks of a size determined by the first maximum region (causal neighborhood) size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	US20060215919A1 CLAIM 1 . In a computer system , a computer-implemented method of processing blocks of pixels in a video frame of a video sequence , the method comprising : for a current block of plural pixels in the video frame of the video sequence , identifying plural context pixels in the video frame , wherein the plural context pixels form at least part of a causal neighborhood (first maximum region) for the current block ; predicting a spatial extrapolation mode for the current block based upon plural contextual spatial extrapolation modes , the plural contextual spatial extrapolation modes including a first contextual spatial extrapolation mode for a first causal block above the current block , the plural contextual spatial extrapolation modes further including a second contextual spatial extrapolation mode for a second causal block left of the current block ; computing an actual spatial extrapolation mode for the current block based at least in part upon the predicted spatial extrapolation mode for the current block ; and computing a spatial extrapolation according to the actual spatial extrapolation mode for pixel values of the plural pixels of the current block based at least in part upon pixel values of the plural context pixels , wherein the spatial extrapolation comprises one or more pixel value extrapolations from one or more of the plural context pixels into the current block to thereby spatially predict the pixel values of the plural pixels of the current block .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision (processing blocks, video frame) information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20060215919A1 CLAIM 1 . In a computer system , a computer-implemented method of processing blocks (first subdivision, second subdivision) of pixels in a video frame (first subdivision, second subdivision) of a video sequence , the method comprising : for a current block of plural pixels in the video frame of the video sequence , identifying plural context pixels in the video frame , wherein the plural context pixels form at least part of a causal neighborhood for the current block ; predicting a spatial extrapolation mode for the current block based upon plural contextual spatial extrapolation modes , the plural contextual spatial extrapolation modes including a first contextual spatial extrapolation mode for a first causal block above the current block , the plural contextual spatial extrapolation modes further including a second contextual spatial extrapolation mode for a second causal block left of the current block ; computing an actual spatial extrapolation mode for the current block based at least in part upon the predicted spatial extrapolation mode for the current block ; and computing a spatial extrapolation according to the actual spatial extrapolation mode for pixel values of the plural pixels of the current block based at least in part upon pixel values of the plural context pixels , wherein the spatial extrapolation comprises one or more pixel value extrapolations from one or more of the plural context pixels into the current block to thereby spatially predict the pixel values of the plural pixels of the current block .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision (processing blocks, video frame) information includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level is sub-divided .	US20060215919A1 CLAIM 1 . In a computer system , a computer-implemented method of processing blocks (first subdivision, second subdivision) of pixels in a video frame (first subdivision, second subdivision) of a video sequence , the method comprising : for a current block of plural pixels in the video frame of the video sequence , identifying plural context pixels in the video frame , wherein the plural context pixels form at least part of a causal neighborhood for the current block ; predicting a spatial extrapolation mode for the current block based upon plural contextual spatial extrapolation modes , the plural contextual spatial extrapolation modes including a first contextual spatial extrapolation mode for a first causal block above the current block , the plural contextual spatial extrapolation modes further including a second contextual spatial extrapolation mode for a second causal block left of the current block ; computing an actual spatial extrapolation mode for the current block based at least in part upon the predicted spatial extrapolation mode for the current block ; and computing a spatial extrapolation according to the actual spatial extrapolation mode for pixel values of the plural pixels of the current block based at least in part upon pixel values of the plural context pixels , wherein the spatial extrapolation comprises one or more pixel value extrapolations from one or more of the plural context pixels into the current block to thereby spatially predict the pixel values of the plural pixels of the current block .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level from the data stream (entropy decoding) .	US20060215919A1 CLAIM 40 . The method of claim 38 further comprising entropy decoding (data stream) the received information .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements associated with the first or second set of sub-regions from the data stream (entropy decoding) in a depth-first traversal order .	US20060215919A1 CLAIM 40 . The method of claim 38 further comprising entropy decoding (data stream) the received information .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream (entropy decoding) , disjoint from a second subset of syntax elements of the data stream including the first subdivision (processing blocks, video frame) information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20060215919A1 CLAIM 1 . In a computer system , a computer-implemented method of processing blocks (first subdivision, second subdivision) of pixels in a video frame (first subdivision, second subdivision) of a video sequence , the method comprising : for a current block of plural pixels in the video frame of the video sequence , identifying plural context pixels in the video frame , wherein the plural context pixels form at least part of a causal neighborhood for the current block ; predicting a spatial extrapolation mode for the current block based upon plural contextual spatial extrapolation modes , the plural contextual spatial extrapolation modes including a first contextual spatial extrapolation mode for a first causal block above the current block , the plural contextual spatial extrapolation modes further including a second contextual spatial extrapolation mode for a second causal block left of the current block ; computing an actual spatial extrapolation mode for the current block based at least in part upon the predicted spatial extrapolation mode for the current block ; and computing a spatial extrapolation according to the actual spatial extrapolation mode for pixel values of the plural pixels of the current block based at least in part upon pixel values of the plural context pixels , wherein the spatial extrapolation comprises one or more pixel value extrapolations from one or more of the plural context pixels into the current block to thereby spatially predict the pixel values of the plural pixels of the current block . US20060215919A1 CLAIM 40 . The method of claim 38 further comprising entropy decoding (data stream) the received information .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream (entropy decoding) , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	US20060215919A1 CLAIM 40 . The method of claim 38 further comprising entropy decoding (data stream) the received information .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream (entropy decoding) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (processing blocks, video frame) information , and a maximum hierarchy level , wherein the first maximum region (causal neighborhood) size and the first subdivision (processing blocks, video frame) information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20060215919A1 CLAIM 1 . In a computer system , a computer-implemented method of processing blocks (first subdivision, second subdivision) of pixels in a video frame (first subdivision, second subdivision) of a video sequence , the method comprising : for a current block of plural pixels in the video frame of the video sequence , identifying plural context pixels in the video frame , wherein the plural context pixels form at least part of a causal neighborhood (first maximum region) for the current block ; predicting a spatial extrapolation mode for the current block based upon plural contextual spatial extrapolation modes , the plural contextual spatial extrapolation modes including a first contextual spatial extrapolation mode for a first causal block above the current block , the plural contextual spatial extrapolation modes further including a second contextual spatial extrapolation mode for a second causal block left of the current block ; computing an actual spatial extrapolation mode for the current block based at least in part upon the predicted spatial extrapolation mode for the current block ; and computing a spatial extrapolation according to the actual spatial extrapolation mode for pixel values of the plural pixels of the current block based at least in part upon pixel values of the plural context pixels , wherein the spatial extrapolation comprises one or more pixel value extrapolations from one or more of the plural context pixels into the current block to thereby spatially predict the pixel values of the plural pixels of the current block . US20060215919A1 CLAIM 40 . The method of claim 38 further comprising entropy decoding (data stream) the received information .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region (causal neighborhood) size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision (processing blocks, video frame) information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (processing blocks, video frame) information and a maximum hierarchy level ; and a data stream (entropy decoding) generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20060215919A1 CLAIM 1 . In a computer system , a computer-implemented method of processing blocks (first subdivision, second subdivision) of pixels in a video frame (first subdivision, second subdivision) of a video sequence , the method comprising : for a current block of plural pixels in the video frame of the video sequence , identifying plural context pixels in the video frame , wherein the plural context pixels form at least part of a causal neighborhood (first maximum region) for the current block ; predicting a spatial extrapolation mode for the current block based upon plural contextual spatial extrapolation modes , the plural contextual spatial extrapolation modes including a first contextual spatial extrapolation mode for a first causal block above the current block , the plural contextual spatial extrapolation modes further including a second contextual spatial extrapolation mode for a second causal block left of the current block ; computing an actual spatial extrapolation mode for the current block based at least in part upon the predicted spatial extrapolation mode for the current block ; and computing a spatial extrapolation according to the actual spatial extrapolation mode for pixel values of the plural pixels of the current block based at least in part upon pixel values of the plural context pixels , wherein the spatial extrapolation comprises one or more pixel value extrapolations from one or more of the plural context pixels into the current block to thereby spatially predict the pixel values of the plural pixels of the current block . US20060215919A1 CLAIM 40 . The method of claim 38 further comprising entropy decoding (data stream) the received information .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region (causal neighborhood) size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision (processing blocks, video frame) information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (processing blocks, video frame) information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream (entropy decoding) the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20060215919A1 CLAIM 1 . In a computer system , a computer-implemented method of processing blocks (first subdivision, second subdivision) of pixels in a video frame (first subdivision, second subdivision) of a video sequence , the method comprising : for a current block of plural pixels in the video frame of the video sequence , identifying plural context pixels in the video frame , wherein the plural context pixels form at least part of a causal neighborhood (first maximum region) for the current block ; predicting a spatial extrapolation mode for the current block based upon plural contextual spatial extrapolation modes , the plural contextual spatial extrapolation modes including a first contextual spatial extrapolation mode for a first causal block above the current block , the plural contextual spatial extrapolation modes further including a second contextual spatial extrapolation mode for a second causal block left of the current block ; computing an actual spatial extrapolation mode for the current block based at least in part upon the predicted spatial extrapolation mode for the current block ; and computing a spatial extrapolation according to the actual spatial extrapolation mode for pixel values of the plural pixels of the current block based at least in part upon pixel values of the plural context pixels , wherein the spatial extrapolation comprises one or more pixel value extrapolations from one or more of the plural context pixels into the current block to thereby spatially predict the pixel values of the plural pixels of the current block . US20060215919A1 CLAIM 40 . The method of claim 38 further comprising entropy decoding (data stream) the received information .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20090080535A1 Filed: 2006-05-19 Issued: 2009-03-26 Method and apparatus for weighted prediction for scalable video coding (Original Assignee) Thomson Licensing SAS (Current Assignee) Thomson Licensing SAS Peng Yin, Jill MacDonald Boyce, Purvin Bibhas Pandit
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information (block basis) , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding (picture order count, same slice) and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20090080535A1 CLAIM 7 . The apparatus of claim 6 , wherein said encoder uses a picture order count (syntax elements, prediction coding, information samples using prediction coding) to remap weighting parameters from the lower layer to a corresponding reference picture index in the enhancement layer . US20090080535A1 CLAIM 11 . The apparatus of claim 6 , wherein said encoder performs the remapping on a slice basis when the picture has a same slice (syntax elements, prediction coding, information samples using prediction coding) partitioning in both the enhancement layer and the lower layer , and said encoder performs the remapping on a macroblock basis (second subdivision information) when the picture has a different slice partitioning in the enhancement layer with respect to the lower layer .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements (picture order count, same slice) associated with the first or second set of sub-regions from the data stream in a depth-first traversal order .	US20090080535A1 CLAIM 7 . The apparatus of claim 6 , wherein said encoder uses a picture order count (syntax elements, prediction coding, information samples using prediction coding) to remap weighting parameters from the lower layer to a corresponding reference picture index in the enhancement layer . US20090080535A1 CLAIM 11 . The apparatus of claim 6 , wherein said encoder performs the remapping on a slice basis when the picture has a same slice (syntax elements, prediction coding, information samples using prediction coding) partitioning in both the enhancement layer and the lower layer , and said encoder performs the remapping on a macroblock basis when the picture has a different slice partitioning in the enhancement layer with respect to the lower layer .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements (picture order count, same slice) of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20090080535A1 CLAIM 7 . The apparatus of claim 6 , wherein said encoder uses a picture order count (syntax elements, prediction coding, information samples using prediction coding) to remap weighting parameters from the lower layer to a corresponding reference picture index in the enhancement layer . US20090080535A1 CLAIM 11 . The apparatus of claim 6 , wherein said encoder performs the remapping on a slice basis when the picture has a same slice (syntax elements, prediction coding, information samples using prediction coding) partitioning in both the enhancement layer and the lower layer , and said encoder performs the remapping on a macroblock basis when the picture has a different slice partitioning in the enhancement layer with respect to the lower layer .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information (block basis) , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding (picture order count, same slice) and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20090080535A1 CLAIM 7 . The apparatus of claim 6 , wherein said encoder uses a picture order count (syntax elements, prediction coding, information samples using prediction coding) to remap weighting parameters from the lower layer to a corresponding reference picture index in the enhancement layer . US20090080535A1 CLAIM 11 . The apparatus of claim 6 , wherein said encoder performs the remapping on a slice basis when the picture has a same slice (syntax elements, prediction coding, information samples using prediction coding) partitioning in both the enhancement layer and the lower layer , and said encoder performs the remapping on a macroblock basis (second subdivision information) when the picture has a different slice partitioning in the enhancement layer with respect to the lower layer .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information (block basis) and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding (picture order count, same slice) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20090080535A1 CLAIM 7 . The apparatus of claim 6 , wherein said encoder uses a picture order count (syntax elements, prediction coding, information samples using prediction coding) to remap weighting parameters from the lower layer to a corresponding reference picture index in the enhancement layer . US20090080535A1 CLAIM 11 . The apparatus of claim 6 , wherein said encoder performs the remapping on a slice basis when the picture has a same slice (syntax elements, prediction coding, information samples using prediction coding) partitioning in both the enhancement layer and the lower layer , and said encoder performs the remapping on a macroblock basis (second subdivision information) when the picture has a different slice partitioning in the enhancement layer with respect to the lower layer .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information (block basis) and a maximum hierarchy level ; encoding the array of information samples using prediction coding (picture order count, same slice) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20090080535A1 CLAIM 7 . The apparatus of claim 6 , wherein said encoder uses a picture order count (syntax elements, prediction coding, information samples using prediction coding) to remap weighting parameters from the lower layer to a corresponding reference picture index in the enhancement layer . US20090080535A1 CLAIM 11 . The apparatus of claim 6 , wherein said encoder performs the remapping on a slice basis when the picture has a same slice (syntax elements, prediction coding, information samples using prediction coding) partitioning in both the enhancement layer and the lower layer , and said encoder performs the remapping on a macroblock basis (second subdivision information) when the picture has a different slice partitioning in the enhancement layer with respect to the lower layer .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	CN101189641A Filed: 2006-05-09 Issued: 2008-05-28 编码数字图像的像素或体素的方法及处理数字图像的方法 (Original Assignee) 布雷克成像有限公司 I·戈里, M·马蒂乌齐
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (的权重) information , and a maximum hierarchy level (以确定) wherein the first maximum region size and the first subdivision (的权重) information (相对位置) are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN101189641A CLAIM 15 . 根据前述权利要求11到14中的一个或多个所述的方法，其特征在于，所述预处理步骤包括：提供人工神经网络，其包括与该神经网络的结点对应的细胞（Ki)的 n-维阵列，各个细胞具有到形成该细胞（Ki)的所述邻域的直接相邻细胞 (Kj)的连接，参见图9和10 ; 各个细胞（Ki)具有对于到所述周围细胞的直接相邻细胞（Kj)的各个连接的 (maximum hierarchy) 输入；各个细胞（Ki)具有对于到一个或多个所述直接相邻细胞（Kj)的连接的输出；在各个细胞（Ki)和所迷直接相邻细胞之间的所述连接由权重（Wij) 来确定；通过被定义为所述细胞（Ki)的激活值或函数（Ai)的内部值来进一步表征所述细胞，并且各个细胞（Ki)能够根据被称为传递函数的信号处理函数进行信号处理，以生成细胞输出信号（Ui) ; 所述传递函数将细胞（Ki)的输出信号（Ui)确定为所述细胞（Ki) 的所述激活值或函数（Ai)的函数，在此所述传递函数还包括使所述细胞 (Ki)的所述激活值或函数（Ai)等于细胞（Ki)的输出信号（in)的恒等函数；提供输入数据记录（Pi)的n-维ft据库，所述输入数据记录必须被提交给利用所述神经网络的计算，并且在所述n-维数椐库中，当所述数据记录（Pi)被投影到对应的n-维空间中时，其相对位置 (first subdivision information) 是所述数据记录（Pi) 的相关特征，能够由所述n-维空间中的点的阵列表示所述数据库的数据记录（Pi)，各个点具有在所述点阵列中的已定义的位置并与所迷数据库的数据记录（Pi)相关，所述数据库的各个数据记录（Pi)进一步包括每一个具有某个值（Ui)的至少一个变量或多个变量；各个数据记录（Pi)与形成所述神经网络的n-维细胞阵列的细胞（Ki) 相关，其中细胞（Ki)在n-维细胞（Ki)阵列中具有与由所述n-维点阵列中的点表示的对应的数据记录（Pi)相同的位置；被作为所述网络的初始化值的各个数据记录（Pi)的变量的值（Ui) 被取为所一目关细胞（Ki)的初始激活值（Ai)或初始输出值（Ui) ; 各个细胞（Ki)的所述激活值（Ai)或所述输出值（Ui)在经过所述神经网络的一定数目的迭代处理步骤之后，被作为所W目关数据记录（Pi) 的新值(Ui)。 CN101189641A CLAIM 16 . 根据权利要求15所述的方法，其特征在于，对于所述一定数目的迭代处理步骤的各处理步骤，定义各个细胞（Ki)和所述直接相邻细胞(Kj)之间的连接的权重 (second subdivision, first subdivision) （Wy)被确定为，与直接相邻于所述细胞（Ki) 的细胞（Kj)相关的各个数据记录（Pj)的所述变量的当前值（Uj)的函数，所述函数即所谓的学习函数或规则。 CN101189641A CLAIM 27 . 根据前述权利要求24到26中的一个或多个所述的图像处理方法，其特征在于，其包括如下的步骤：定义用于进行所述^象素或体素编码的第一窗口，所述窗口由将净皮编码的所述目标像素或体素周围的像素或体素的阵列形成，其具有与所述窗口的像素的数目相关的第一维度；进行所述像素或体素的编码；提供经过训练和测试的预测算法，并利用根据以上定义的第一窗口的所迷已编码的像素或体素来进行图像的第一处理，因而确定所述图像中的各个像素或体素的特征或特性；识别具有某种特性的在所述图像中的像素或体素以及它们在所述图像中的位置；定义与其中存在有具有所述某种特性的像素或体素的原始图像的区域或部分相对应的^f象素或体素的子阵列；定义用于进行所述像素或体素编码的第二窗口，所述窗口由将被编码的所述目标像素或体素周围的像素或体素的阵列形成，其具有与所述窗口的像素的数目相关的第二维度，所述窗口的维度和4象素或体素的数目大于所述第一窗口的维度和像素或体素的数目；只对以上定义的像素或体素的子阵列的像素或体素进行像素或体素编码，素的所述原始图 < ; 象的区域或部分相对应；利用所述经过训练和测试的算法，进行通过利用所述第二窗口来编码的所述已编码像素或体素的第二处理，以确定 (first hierarchy level, hierarchy level) 所述像素或体素子阵列的像素或体素的特征或特性，根据利用所述预测算法的第一处理步骤所述像素像的区域或部分相对应；进一步的步骤明显地能够被执行，通过：根据利用预测算法的前述处理步骤识别具有某种特性或特征的在所述图像中的像素或体素以及识别它们在所述图像中的位置；定义像素或体素的子阵列，其与在其中存在具有所述某种特性的像素或体素的原始图像的区域或部分相对应；定义用于进行所述像素或体素编码的新窗口，所述窗口由将被编码的目标像素或体素周围的像素或体素的阵列形成，其具有与所述窗口的像素的数目相关的维度，并且所述窗口的维度和像素或体素的数目不同于在前述处理步骤中定义的窗口的维度和像素或体素的数目；只对以上定义的像素或体素子阵列的像素或体素进行像素或体素编码，所述像素或体素子阵列与在其中存在具有所述某种特性的像素或体素的所述原始图像的区域或部分相对应；利用所述经过训练和测试的算法，进行对通过利用所述新窗口编码的所述已编码像素或体素的进一步处理，以确定所述^f象素或体素子阵列的所述像素或体素的特征或特性，根据具有所述预测算法的前述处理步骤所迷始图像的区域或部分相对应。
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal based on an intra-prediction mode (来确定的) associated with the sub-region and reconstructed samples of a neighboring subset of the second set of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle (来确定的) .	CN101189641A CLAIM 21 . 根据前述权利要求11到20中的一个或多个所述的方法，其特征在于，执行基于两种、三种或更多的滤波算法的两个、三个或更多的滤波步骤；各种滤波算法（Al， A2 , . . . ， Am)确定对所述图像的像素或体素的外观进行定义的参数的值的变换（fl，f2，…，fm) ; 对于形成所述二维或三维图像的各个像素（P(i , j)) , 定义仅包括所述像素（P(i , j))或所述体素的窗口；通过向量对所述图像的各个像素（P(i，j))或各个体素或者选定数目的像素（P(i，j))或体素进行编码，所述向量的分量被定义为，通过定义所述像素（P(i，j))或体素的所述参数的原始值的所述两种、三种或更多的变换 (fl， O， . . . ， fm)来确定的 (intra-prediction mode, next intra-prediction cycle) 各个像素或各个体素的参数的值。
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision (的权重) information (相对位置) indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level (以确定) (以确定) according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	CN101189641A CLAIM 15 . 根据前述权利要求11到14中的一个或多个所述的方法，其特征在于，所述预处理步骤包括：提供人工神经网络，其包括与该神经网络的结点对应的细胞（Ki)的 n-维阵列，各个细胞具有到形成该细胞（Ki)的所述邻域的直接相邻细胞 (Kj)的连接，参见图9和10 ; 各个细胞（Ki)具有对于到所述周围细胞的直接相邻细胞（Kj)的各个连接的 (maximum hierarchy) 输入；各个细胞（Ki)具有对于到一个或多个所述直接相邻细胞（Kj)的连接的输出；在各个细胞（Ki)和所迷直接相邻细胞之间的所述连接由权重（Wij) 来确定；通过被定义为所述细胞（Ki)的激活值或函数（Ai)的内部值来进一步表征所述细胞，并且各个细胞（Ki)能够根据被称为传递函数的信号处理函数进行信号处理，以生成细胞输出信号（Ui) ; 所述传递函数将细胞（Ki)的输出信号（Ui)确定为所述细胞（Ki) 的所述激活值或函数（Ai)的函数，在此所述传递函数还包括使所述细胞 (Ki)的所述激活值或函数（Ai)等于细胞（Ki)的输出信号（in)的恒等函数；提供输入数据记录（Pi)的n-维ft据库，所述输入数据记录必须被提交给利用所述神经网络的计算，并且在所述n-维数椐库中，当所述数据记录（Pi)被投影到对应的n-维空间中时，其相对位置 (first subdivision information) 是所述数据记录（Pi) 的相关特征，能够由所述n-维空间中的点的阵列表示所述数据库的数据记录（Pi)，各个点具有在所述点阵列中的已定义的位置并与所迷数据库的数据记录（Pi)相关，所述数据库的各个数据记录（Pi)进一步包括每一个具有某个值（Ui)的至少一个变量或多个变量；各个数据记录（Pi)与形成所述神经网络的n-维细胞阵列的细胞（Ki) 相关，其中细胞（Ki)在n-维细胞（Ki)阵列中具有与由所述n-维点阵列中的点表示的对应的数据记录（Pi)相同的位置；被作为所述网络的初始化值的各个数据记录（Pi)的变量的值（Ui) 被取为所一目关细胞（Ki)的初始激活值（Ai)或初始输出值（Ui) ; 各个细胞（Ki)的所述激活值（Ai)或所述输出值（Ui)在经过所述神经网络的一定数目的迭代处理步骤之后，被作为所W目关数据记录（Pi) 的新值(Ui)。 CN101189641A CLAIM 16 . 根据权利要求15所述的方法，其特征在于，对于所述一定数目的迭代处理步骤的各处理步骤，定义各个细胞（Ki)和所述直接相邻细胞(Kj)之间的连接的权重 (second subdivision, first subdivision) （Wy)被确定为，与直接相邻于所述细胞（Ki) 的细胞（Kj)相关的各个数据记录（Pj)的所述变量的当前值（Uj)的函数，所述函数即所谓的学习函数或规则。 CN101189641A CLAIM 27 . 根据前述权利要求24到26中的一个或多个所述的图像处理方法，其特征在于，其包括如下的步骤：定义用于进行所述^象素或体素编码的第一窗口，所述窗口由将净皮编码的所述目标像素或体素周围的像素或体素的阵列形成，其具有与所述窗口的像素的数目相关的第一维度；进行所述像素或体素的编码；提供经过训练和测试的预测算法，并利用根据以上定义的第一窗口的所迷已编码的像素或体素来进行图像的第一处理，因而确定所述图像中的各个像素或体素的特征或特性；识别具有某种特性的在所述图像中的像素或体素以及它们在所述图像中的位置；定义与其中存在有具有所述某种特性的像素或体素的原始图像的区域或部分相对应的^f象素或体素的子阵列；定义用于进行所述像素或体素编码的第二窗口，所述窗口由将被编码的所述目标像素或体素周围的像素或体素的阵列形成，其具有与所述窗口的像素的数目相关的第二维度，所述窗口的维度和4象素或体素的数目大于所述第一窗口的维度和像素或体素的数目；只对以上定义的像素或体素的子阵列的像素或体素进行像素或体素编码，素的所述原始图 < ; 象的区域或部分相对应；利用所述经过训练和测试的算法，进行通过利用所述第二窗口来编码的所述已编码像素或体素的第二处理，以确定 (first hierarchy level, hierarchy level) 所述像素或体素子阵列的像素或体素的特征或特性，根据利用所述预测算法的第一处理步骤所述像素像的区域或部分相对应；进一步的步骤明显地能够被执行，通过：根据利用预测算法的前述处理步骤识别具有某种特性或特征的在所述图像中的像素或体素以及识别它们在所述图像中的位置；定义像素或体素的子阵列，其与在其中存在具有所述某种特性的像素或体素的原始图像的区域或部分相对应；定义用于进行所述像素或体素编码的新窗口，所述窗口由将被编码的目标像素或体素周围的像素或体素的阵列形成，其具有与所述窗口的像素的数目相关的维度，并且所述窗口的维度和像素或体素的数目不同于在前述处理步骤中定义的窗口的维度和像素或体素的数目；只对以上定义的像素或体素子阵列的像素或体素进行像素或体素编码，所述像素或体素子阵列与在其中存在具有所述某种特性的像素或体素的所述原始图像的区域或部分相对应；利用所述经过训练和测试的算法，进行对通过利用所述新窗口编码的所述已编码像素或体素的进一步处理，以确定所述^f象素或体素子阵列的所述像素或体素的特征或特性，根据具有所述预测算法的前述处理步骤所迷始图像的区域或部分相对应。
US10250913B2 CLAIM 5 . The decoder according to claim 4 , wherein the divider is configured to , in accordance with the partition rules associated with the first and higher-order hierarchy levels , sub-divide into sub-regions of equal size , such that there are an equal number of sub-regions at each hierarchy level (以确定) .	CN101189641A CLAIM 27 . 根据前述权利要求24到26中的一个或多个所述的图像处理方法，其特征在于，其包括如下的步骤：定义用于进行所述^象素或体素编码的第一窗口，所述窗口由将净皮编码的所述目标像素或体素周围的像素或体素的阵列形成，其具有与所述窗口的像素的数目相关的第一维度；进行所述像素或体素的编码；提供经过训练和测试的预测算法，并利用根据以上定义的第一窗口的所迷已编码的像素或体素来进行图像的第一处理，因而确定所述图像中的各个像素或体素的特征或特性；识别具有某种特性的在所述图像中的像素或体素以及它们在所述图像中的位置；定义与其中存在有具有所述某种特性的像素或体素的原始图像的区域或部分相对应的^f象素或体素的子阵列；定义用于进行所述像素或体素编码的第二窗口，所述窗口由将被编码的所述目标像素或体素周围的像素或体素的阵列形成，其具有与所述窗口的像素的数目相关的第二维度，所述窗口的维度和4象素或体素的数目大于所述第一窗口的维度和像素或体素的数目；只对以上定义的像素或体素的子阵列的像素或体素进行像素或体素编码，素的所述原始图 < ; 象的区域或部分相对应；利用所述经过训练和测试的算法，进行通过利用所述第二窗口来编码的所述已编码像素或体素的第二处理，以确定 (first hierarchy level, hierarchy level) 所述像素或体素子阵列的像素或体素的特征或特性，根据利用所述预测算法的第一处理步骤所述像素像的区域或部分相对应；进一步的步骤明显地能够被执行，通过：根据利用预测算法的前述处理步骤识别具有某种特性或特征的在所述图像中的像素或体素以及识别它们在所述图像中的位置；定义像素或体素的子阵列，其与在其中存在具有所述某种特性的像素或体素的原始图像的区域或部分相对应；定义用于进行所述像素或体素编码的新窗口，所述窗口由将被编码的目标像素或体素周围的像素或体素的阵列形成，其具有与所述窗口的像素的数目相关的维度，并且所述窗口的维度和像素或体素的数目不同于在前述处理步骤中定义的窗口的维度和像素或体素的数目；只对以上定义的像素或体素子阵列的像素或体素进行像素或体素编码，所述像素或体素子阵列与在其中存在具有所述某种特性的像素或体素的所述原始图像的区域或部分相对应；利用所述经过训练和测试的算法，进行对通过利用所述新窗口编码的所述已编码像素或体素的进一步处理，以确定所述^f象素或体素子阵列的所述像素或体素的特征或特性，根据具有所述预测算法的前述处理步骤所迷始图像的区域或部分相对应。
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision (的权重) information (相对位置) includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level (以确定) is sub-divided .	CN101189641A CLAIM 15 . 根据前述权利要求11到14中的一个或多个所述的方法，其特征在于，所述预处理步骤包括：提供人工神经网络，其包括与该神经网络的结点对应的细胞（Ki)的 n-维阵列，各个细胞具有到形成该细胞（Ki)的所述邻域的直接相邻细胞 (Kj)的连接，参见图9和10 ; 各个细胞（Ki)具有对于到所述周围细胞的直接相邻细胞（Kj)的各个连接的输入；各个细胞（Ki)具有对于到一个或多个所述直接相邻细胞（Kj)的连接的输出；在各个细胞（Ki)和所迷直接相邻细胞之间的所述连接由权重（Wij) 来确定；通过被定义为所述细胞（Ki)的激活值或函数（Ai)的内部值来进一步表征所述细胞，并且各个细胞（Ki)能够根据被称为传递函数的信号处理函数进行信号处理，以生成细胞输出信号（Ui) ; 所述传递函数将细胞（Ki)的输出信号（Ui)确定为所述细胞（Ki) 的所述激活值或函数（Ai)的函数，在此所述传递函数还包括使所述细胞 (Ki)的所述激活值或函数（Ai)等于细胞（Ki)的输出信号（in)的恒等函数；提供输入数据记录（Pi)的n-维ft据库，所述输入数据记录必须被提交给利用所述神经网络的计算，并且在所述n-维数椐库中，当所述数据记录（Pi)被投影到对应的n-维空间中时，其相对位置 (first subdivision information) 是所述数据记录（Pi) 的相关特征，能够由所述n-维空间中的点的阵列表示所述数据库的数据记录（Pi)，各个点具有在所述点阵列中的已定义的位置并与所迷数据库的数据记录（Pi)相关，所述数据库的各个数据记录（Pi)进一步包括每一个具有某个值（Ui)的至少一个变量或多个变量；各个数据记录（Pi)与形成所述神经网络的n-维细胞阵列的细胞（Ki) 相关，其中细胞（Ki)在n-维细胞（Ki)阵列中具有与由所述n-维点阵列中的点表示的对应的数据记录（Pi)相同的位置；被作为所述网络的初始化值的各个数据记录（Pi)的变量的值（Ui) 被取为所一目关细胞（Ki)的初始激活值（Ai)或初始输出值（Ui) ; 各个细胞（Ki)的所述激活值（Ai)或所述输出值（Ui)在经过所述神经网络的一定数目的迭代处理步骤之后，被作为所W目关数据记录（Pi) 的新值(Ui)。 CN101189641A CLAIM 16 . 根据权利要求15所述的方法，其特征在于，对于所述一定数目的迭代处理步骤的各处理步骤，定义各个细胞（Ki)和所述直接相邻细胞(Kj)之间的连接的权重 (second subdivision, first subdivision) （Wy)被确定为，与直接相邻于所述细胞（Ki) 的细胞（Kj)相关的各个数据记录（Pj)的所述变量的当前值（Uj)的函数，所述函数即所谓的学习函数或规则。 CN101189641A CLAIM 27 . 根据前述权利要求24到26中的一个或多个所述的图像处理方法，其特征在于，其包括如下的步骤：定义用于进行所述^象素或体素编码的第一窗口，所述窗口由将净皮编码的所述目标像素或体素周围的像素或体素的阵列形成，其具有与所述窗口的像素的数目相关的第一维度；进行所述像素或体素的编码；提供经过训练和测试的预测算法，并利用根据以上定义的第一窗口的所迷已编码的像素或体素来进行图像的第一处理，因而确定所述图像中的各个像素或体素的特征或特性；识别具有某种特性的在所述图像中的像素或体素以及它们在所述图像中的位置；定义与其中存在有具有所述某种特性的像素或体素的原始图像的区域或部分相对应的^f象素或体素的子阵列；定义用于进行所述像素或体素编码的第二窗口，所述窗口由将被编码的所述目标像素或体素周围的像素或体素的阵列形成，其具有与所述窗口的像素的数目相关的第二维度，所述窗口的维度和4象素或体素的数目大于所述第一窗口的维度和像素或体素的数目；只对以上定义的像素或体素的子阵列的像素或体素进行像素或体素编码，素的所述原始图 < ; 象的区域或部分相对应；利用所述经过训练和测试的算法，进行通过利用所述第二窗口来编码的所述已编码像素或体素的第二处理，以确定 (first hierarchy level, hierarchy level) 所述像素或体素子阵列的像素或体素的特征或特性，根据利用所述预测算法的第一处理步骤所述像素像的区域或部分相对应；进一步的步骤明显地能够被执行，通过：根据利用预测算法的前述处理步骤识别具有某种特性或特征的在所述图像中的像素或体素以及识别它们在所述图像中的位置；定义像素或体素的子阵列，其与在其中存在具有所述某种特性的像素或体素的原始图像的区域或部分相对应；定义用于进行所述像素或体素编码的新窗口，所述窗口由将被编码的目标像素或体素周围的像素或体素的阵列形成，其具有与所述窗口的像素的数目相关的维度，并且所述窗口的维度和像素或体素的数目不同于在前述处理步骤中定义的窗口的维度和像素或体素的数目；只对以上定义的像素或体素子阵列的像素或体素进行像素或体素编码，所述像素或体素子阵列与在其中存在具有所述某种特性的像素或体素的所述原始图像的区域或部分相对应；利用所述经过训练和测试的算法，进行对通过利用所述新窗口编码的所述已编码像素或体素的进一步处理，以确定所述^f象素或体素子阵列的所述像素或体素的特征或特性，根据具有所述预测算法的前述处理步骤所迷始图像的区域或部分相对应。
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level (以确定) from the data stream .	CN101189641A CLAIM 15 . 根据前述权利要求11到14中的一个或多个所述的方法，其特征在于，所述预处理步骤包括：提供人工神经网络，其包括与该神经网络的结点对应的细胞（Ki)的 n-维阵列，各个细胞具有到形成该细胞（Ki)的所述邻域的直接相邻细胞 (Kj)的连接，参见图9和10 ; 各个细胞（Ki)具有对于到所述周围细胞的直接相邻细胞（Kj)的各个连接的 (maximum hierarchy) 输入；各个细胞（Ki)具有对于到一个或多个所述直接相邻细胞（Kj)的连接的输出；在各个细胞（Ki)和所迷直接相邻细胞之间的所述连接由权重（Wij) 来确定；通过被定义为所述细胞（Ki)的激活值或函数（Ai)的内部值来进一步表征所述细胞，并且各个细胞（Ki)能够根据被称为传递函数的信号处理函数进行信号处理，以生成细胞输出信号（Ui) ; 所述传递函数将细胞（Ki)的输出信号（Ui)确定为所述细胞（Ki) 的所述激活值或函数（Ai)的函数，在此所述传递函数还包括使所述细胞 (Ki)的所述激活值或函数（Ai)等于细胞（Ki)的输出信号（in)的恒等函数；提供输入数据记录（Pi)的n-维ft据库，所述输入数据记录必须被提交给利用所述神经网络的计算，并且在所述n-维数椐库中，当所述数据记录（Pi)被投影到对应的n-维空间中时，其相对位置是所述数据记录（Pi) 的相关特征，能够由所述n-维空间中的点的阵列表示所述数据库的数据记录（Pi)，各个点具有在所述点阵列中的已定义的位置并与所迷数据库的数据记录（Pi)相关，所述数据库的各个数据记录（Pi)进一步包括每一个具有某个值（Ui)的至少一个变量或多个变量；各个数据记录（Pi)与形成所述神经网络的n-维细胞阵列的细胞（Ki) 相关，其中细胞（Ki)在n-维细胞（Ki)阵列中具有与由所述n-维点阵列中的点表示的对应的数据记录（Pi)相同的位置；被作为所述网络的初始化值的各个数据记录（Pi)的变量的值（Ui) 被取为所一目关细胞（Ki)的初始激活值（Ai)或初始输出值（Ui) ; 各个细胞（Ki)的所述激活值（Ai)或所述输出值（Ui)在经过所述神经网络的一定数目的迭代处理步骤之后，被作为所W目关数据记录（Pi) 的新值(Ui)。 CN101189641A CLAIM 27 . 根据前述权利要求24到26中的一个或多个所述的图像处理方法，其特征在于，其包括如下的步骤：定义用于进行所述^象素或体素编码的第一窗口，所述窗口由将净皮编码的所述目标像素或体素周围的像素或体素的阵列形成，其具有与所述窗口的像素的数目相关的第一维度；进行所述像素或体素的编码；提供经过训练和测试的预测算法，并利用根据以上定义的第一窗口的所迷已编码的像素或体素来进行图像的第一处理，因而确定所述图像中的各个像素或体素的特征或特性；识别具有某种特性的在所述图像中的像素或体素以及它们在所述图像中的位置；定义与其中存在有具有所述某种特性的像素或体素的原始图像的区域或部分相对应的^f象素或体素的子阵列；定义用于进行所述像素或体素编码的第二窗口，所述窗口由将被编码的所述目标像素或体素周围的像素或体素的阵列形成，其具有与所述窗口的像素的数目相关的第二维度，所述窗口的维度和4象素或体素的数目大于所述第一窗口的维度和像素或体素的数目；只对以上定义的像素或体素的子阵列的像素或体素进行像素或体素编码，素的所述原始图 < ; 象的区域或部分相对应；利用所述经过训练和测试的算法，进行通过利用所述第二窗口来编码的所述已编码像素或体素的第二处理，以确定 (first hierarchy level, hierarchy level) 所述像素或体素子阵列的像素或体素的特征或特性，根据利用所述预测算法的第一处理步骤所述像素像的区域或部分相对应；进一步的步骤明显地能够被执行，通过：根据利用预测算法的前述处理步骤识别具有某种特性或特征的在所述图像中的像素或体素以及识别它们在所述图像中的位置；定义像素或体素的子阵列，其与在其中存在具有所述某种特性的像素或体素的原始图像的区域或部分相对应；定义用于进行所述像素或体素编码的新窗口，所述窗口由将被编码的目标像素或体素周围的像素或体素的阵列形成，其具有与所述窗口的像素的数目相关的维度，并且所述窗口的维度和像素或体素的数目不同于在前述处理步骤中定义的窗口的维度和像素或体素的数目；只对以上定义的像素或体素子阵列的像素或体素进行像素或体素编码，所述像素或体素子阵列与在其中存在具有所述某种特性的像素或体素的所述原始图像的区域或部分相对应；利用所述经过训练和测试的算法，进行对通过利用所述新窗口编码的所述已编码像素或体素的进一步处理，以确定所述^f象素或体素子阵列的所述像素或体素的特征或特性，根据具有所述预测算法的前述处理步骤所迷始图像的区域或部分相对应。
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset (的滤波) of syntax elements of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision (的权重) information (相对位置) , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	CN101189641A CLAIM 15 . 根据前述权利要求11到14中的一个或多个所述的方法，其特征在于，所述预处理步骤包括：提供人工神经网络，其包括与该神经网络的结点对应的细胞（Ki)的 n-维阵列，各个细胞具有到形成该细胞（Ki)的所述邻域的直接相邻细胞 (Kj)的连接，参见图9和10 ; 各个细胞（Ki)具有对于到所述周围细胞的直接相邻细胞（Kj)的各个连接的输入；各个细胞（Ki)具有对于到一个或多个所述直接相邻细胞（Kj)的连接的输出；在各个细胞（Ki)和所迷直接相邻细胞之间的所述连接由权重（Wij) 来确定；通过被定义为所述细胞（Ki)的激活值或函数（Ai)的内部值来进一步表征所述细胞，并且各个细胞（Ki)能够根据被称为传递函数的信号处理函数进行信号处理，以生成细胞输出信号（Ui) ; 所述传递函数将细胞（Ki)的输出信号（Ui)确定为所述细胞（Ki) 的所述激活值或函数（Ai)的函数，在此所述传递函数还包括使所述细胞 (Ki)的所述激活值或函数（Ai)等于细胞（Ki)的输出信号（in)的恒等函数；提供输入数据记录（Pi)的n-维ft据库，所述输入数据记录必须被提交给利用所述神经网络的计算，并且在所述n-维数椐库中，当所述数据记录（Pi)被投影到对应的n-维空间中时，其相对位置 (first subdivision information) 是所述数据记录（Pi) 的相关特征，能够由所述n-维空间中的点的阵列表示所述数据库的数据记录（Pi)，各个点具有在所述点阵列中的已定义的位置并与所迷数据库的数据记录（Pi)相关，所述数据库的各个数据记录（Pi)进一步包括每一个具有某个值（Ui)的至少一个变量或多个变量；各个数据记录（Pi)与形成所述神经网络的n-维细胞阵列的细胞（Ki) 相关，其中细胞（Ki)在n-维细胞（Ki)阵列中具有与由所述n-维点阵列中的点表示的对应的数据记录（Pi)相同的位置；被作为所述网络的初始化值的各个数据记录（Pi)的变量的值（Ui) 被取为所一目关细胞（Ki)的初始激活值（Ai)或初始输出值（Ui) ; 各个细胞（Ki)的所述激活值（Ai)或所述输出值（Ui)在经过所述神经网络的一定数目的迭代处理步骤之后，被作为所W目关数据记录（Pi) 的新值(Ui)。 CN101189641A CLAIM 16 . 根据权利要求15所述的方法，其特征在于，对于所述一定数目的迭代处理步骤的各处理步骤，定义各个细胞（Ki)和所述直接相邻细胞(Kj)之间的连接的权重 (second subdivision, first subdivision) （Wy)被确定为，与直接相邻于所述细胞（Ki) 的细胞（Kj)相关的各个数据记录（Pj)的所述变量的当前值（Uj)的函数，所述函数即所谓的学习函数或规则。 CN101189641A CLAIM 21 . 根据前述权利要求11到20中的一个或多个所述的方法，其特征在于，执行基于两种、三种或更多的滤波 (first subset) 算法的两个、三个或更多的滤波步骤；各种滤波算法（Al， A2 , . . . ， Am)确定对所述图像的像素或体素的外观进行定义的参数的值的变换（fl，f2，…，fm) ; 对于形成所述二维或三维图像的各个像素（P(i , j)) , 定义仅包括所述像素（P(i , j))或所述体素的窗口；通过向量对所述图像的各个像素（P(i，j))或各个体素或者选定数目的像素（P(i，j))或体素进行编码，所述向量的分量被定义为，通过定义所述像素（P(i，j))或体素的所述参数的原始值的所述两种、三种或更多的变换 (fl， O， . . . ， fm)来确定的各个像素或各个体素的参数的值。
US10250913B2 CLAIM 11 . The decoder according to claim 1 , wherein the recursive multi-tree partitioning includes a quadtree partitioning technique (的变换) .	CN101189641A CLAIM 1 . 一种对数字或数字化的二维或三维图像的像素或体素进行编码的方法，其包括如下步骤： a)提供以二维像素阵列或三维体素阵列构成的数字图像，通过至少一个变量，如灰度图像中的亮度或彩色图像中的HSV(色度、饱和度及纯度)或RGB值来定义各个像素或体素； b)将所述图像的各个像素或体素作为目标像素或体素，并且，对于每个目标像素或体素，通过包含所述目标像素或体素以及一定数目的周围像素或体素的像素或体素窗口形成邻域； c)对于每个目标像素或体素，生成与所述目标像素或体素单义地相关的向量，所述向量的分量被生成为所述目标像素或体素以及所述像素或体素窗口的各个像素或体素的值的函数；其特征在于，所述目标像素或体素以及所述像素或体素窗口的各个像素或体素的值的函数，对应于表示所述窗口的像素或体素的数值矩阵或该数值矩阵的变换 (quadtree partitioning technique) 的特征参数。
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (的权重) information , and a maximum hierarchy level (以确定) , wherein the first maximum region size and the first subdivision (的权重) information (相对位置) are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN101189641A CLAIM 15 . 根据前述权利要求11到14中的一个或多个所述的方法，其特征在于，所述预处理步骤包括：提供人工神经网络，其包括与该神经网络的结点对应的细胞（Ki)的 n-维阵列，各个细胞具有到形成该细胞（Ki)的所述邻域的直接相邻细胞 (Kj)的连接，参见图9和10 ; 各个细胞（Ki)具有对于到所述周围细胞的直接相邻细胞（Kj)的各个连接的 (maximum hierarchy) 输入；各个细胞（Ki)具有对于到一个或多个所述直接相邻细胞（Kj)的连接的输出；在各个细胞（Ki)和所迷直接相邻细胞之间的所述连接由权重（Wij) 来确定；通过被定义为所述细胞（Ki)的激活值或函数（Ai)的内部值来进一步表征所述细胞，并且各个细胞（Ki)能够根据被称为传递函数的信号处理函数进行信号处理，以生成细胞输出信号（Ui) ; 所述传递函数将细胞（Ki)的输出信号（Ui)确定为所述细胞（Ki) 的所述激活值或函数（Ai)的函数，在此所述传递函数还包括使所述细胞 (Ki)的所述激活值或函数（Ai)等于细胞（Ki)的输出信号（in)的恒等函数；提供输入数据记录（Pi)的n-维ft据库，所述输入数据记录必须被提交给利用所述神经网络的计算，并且在所述n-维数椐库中，当所述数据记录（Pi)被投影到对应的n-维空间中时，其相对位置 (first subdivision information) 是所述数据记录（Pi) 的相关特征，能够由所述n-维空间中的点的阵列表示所述数据库的数据记录（Pi)，各个点具有在所述点阵列中的已定义的位置并与所迷数据库的数据记录（Pi)相关，所述数据库的各个数据记录（Pi)进一步包括每一个具有某个值（Ui)的至少一个变量或多个变量；各个数据记录（Pi)与形成所述神经网络的n-维细胞阵列的细胞（Ki) 相关，其中细胞（Ki)在n-维细胞（Ki)阵列中具有与由所述n-维点阵列中的点表示的对应的数据记录（Pi)相同的位置；被作为所述网络的初始化值的各个数据记录（Pi)的变量的值（Ui) 被取为所一目关细胞（Ki)的初始激活值（Ai)或初始输出值（Ui) ; 各个细胞（Ki)的所述激活值（Ai)或所述输出值（Ui)在经过所述神经网络的一定数目的迭代处理步骤之后，被作为所W目关数据记录（Pi) 的新值(Ui)。 CN101189641A CLAIM 16 . 根据权利要求15所述的方法，其特征在于，对于所述一定数目的迭代处理步骤的各处理步骤，定义各个细胞（Ki)和所述直接相邻细胞(Kj)之间的连接的权重 (second subdivision, first subdivision) （Wy)被确定为，与直接相邻于所述细胞（Ki) 的细胞（Kj)相关的各个数据记录（Pj)的所述变量的当前值（Uj)的函数，所述函数即所谓的学习函数或规则。 CN101189641A CLAIM 27 . 根据前述权利要求24到26中的一个或多个所述的图像处理方法，其特征在于，其包括如下的步骤：定义用于进行所述^象素或体素编码的第一窗口，所述窗口由将净皮编码的所述目标像素或体素周围的像素或体素的阵列形成，其具有与所述窗口的像素的数目相关的第一维度；进行所述像素或体素的编码；提供经过训练和测试的预测算法，并利用根据以上定义的第一窗口的所迷已编码的像素或体素来进行图像的第一处理，因而确定所述图像中的各个像素或体素的特征或特性；识别具有某种特性的在所述图像中的像素或体素以及它们在所述图像中的位置；定义与其中存在有具有所述某种特性的像素或体素的原始图像的区域或部分相对应的^f象素或体素的子阵列；定义用于进行所述像素或体素编码的第二窗口，所述窗口由将被编码的所述目标像素或体素周围的像素或体素的阵列形成，其具有与所述窗口的像素的数目相关的第二维度，所述窗口的维度和4象素或体素的数目大于所述第一窗口的维度和像素或体素的数目；只对以上定义的像素或体素的子阵列的像素或体素进行像素或体素编码，素的所述原始图 < ; 象的区域或部分相对应；利用所述经过训练和测试的算法，进行通过利用所述第二窗口来编码的所述已编码像素或体素的第二处理，以确定 (first hierarchy level, hierarchy level) 所述像素或体素子阵列的像素或体素的特征或特性，根据利用所述预测算法的第一处理步骤所述像素像的区域或部分相对应；进一步的步骤明显地能够被执行，通过：根据利用预测算法的前述处理步骤识别具有某种特性或特征的在所述图像中的像素或体素以及识别它们在所述图像中的位置；定义像素或体素的子阵列，其与在其中存在具有所述某种特性的像素或体素的原始图像的区域或部分相对应；定义用于进行所述像素或体素编码的新窗口，所述窗口由将被编码的目标像素或体素周围的像素或体素的阵列形成，其具有与所述窗口的像素的数目相关的维度，并且所述窗口的维度和像素或体素的数目不同于在前述处理步骤中定义的窗口的维度和像素或体素的数目；只对以上定义的像素或体素子阵列的像素或体素进行像素或体素编码，所述像素或体素子阵列与在其中存在具有所述某种特性的像素或体素的所述原始图像的区域或部分相对应；利用所述经过训练和测试的算法，进行对通过利用所述新窗口编码的所述已编码像素或体素的进一步处理，以确定所述^f象素或体素子阵列的所述像素或体素的特征或特性，根据具有所述预测算法的前述处理步骤所迷始图像的区域或部分相对应。
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision (的权重) information (相对位置) , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (的权重) information and a maximum hierarchy level (以确定) ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN101189641A CLAIM 15 . 根据前述权利要求11到14中的一个或多个所述的方法，其特征在于，所述预处理步骤包括：提供人工神经网络，其包括与该神经网络的结点对应的细胞（Ki)的 n-维阵列，各个细胞具有到形成该细胞（Ki)的所述邻域的直接相邻细胞 (Kj)的连接，参见图9和10 ; 各个细胞（Ki)具有对于到所述周围细胞的直接相邻细胞（Kj)的各个连接的 (maximum hierarchy) 输入；各个细胞（Ki)具有对于到一个或多个所述直接相邻细胞（Kj)的连接的输出；在各个细胞（Ki)和所迷直接相邻细胞之间的所述连接由权重（Wij) 来确定；通过被定义为所述细胞（Ki)的激活值或函数（Ai)的内部值来进一步表征所述细胞，并且各个细胞（Ki)能够根据被称为传递函数的信号处理函数进行信号处理，以生成细胞输出信号（Ui) ; 所述传递函数将细胞（Ki)的输出信号（Ui)确定为所述细胞（Ki) 的所述激活值或函数（Ai)的函数，在此所述传递函数还包括使所述细胞 (Ki)的所述激活值或函数（Ai)等于细胞（Ki)的输出信号（in)的恒等函数；提供输入数据记录（Pi)的n-维ft据库，所述输入数据记录必须被提交给利用所述神经网络的计算，并且在所述n-维数椐库中，当所述数据记录（Pi)被投影到对应的n-维空间中时，其相对位置 (first subdivision information) 是所述数据记录（Pi) 的相关特征，能够由所述n-维空间中的点的阵列表示所述数据库的数据记录（Pi)，各个点具有在所述点阵列中的已定义的位置并与所迷数据库的数据记录（Pi)相关，所述数据库的各个数据记录（Pi)进一步包括每一个具有某个值（Ui)的至少一个变量或多个变量；各个数据记录（Pi)与形成所述神经网络的n-维细胞阵列的细胞（Ki) 相关，其中细胞（Ki)在n-维细胞（Ki)阵列中具有与由所述n-维点阵列中的点表示的对应的数据记录（Pi)相同的位置；被作为所述网络的初始化值的各个数据记录（Pi)的变量的值（Ui) 被取为所一目关细胞（Ki)的初始激活值（Ai)或初始输出值（Ui) ; 各个细胞（Ki)的所述激活值（Ai)或所述输出值（Ui)在经过所述神经网络的一定数目的迭代处理步骤之后，被作为所W目关数据记录（Pi) 的新值(Ui)。 CN101189641A CLAIM 16 . 根据权利要求15所述的方法，其特征在于，对于所述一定数目的迭代处理步骤的各处理步骤，定义各个细胞（Ki)和所述直接相邻细胞(Kj)之间的连接的权重 (second subdivision, first subdivision) （Wy)被确定为，与直接相邻于所述细胞（Ki) 的细胞（Kj)相关的各个数据记录（Pj)的所述变量的当前值（Uj)的函数，所述函数即所谓的学习函数或规则。 CN101189641A CLAIM 27 . 根据前述权利要求24到26中的一个或多个所述的图像处理方法，其特征在于，其包括如下的步骤：定义用于进行所述^象素或体素编码的第一窗口，所述窗口由将净皮编码的所述目标像素或体素周围的像素或体素的阵列形成，其具有与所述窗口的像素的数目相关的第一维度；进行所述像素或体素的编码；提供经过训练和测试的预测算法，并利用根据以上定义的第一窗口的所迷已编码的像素或体素来进行图像的第一处理，因而确定所述图像中的各个像素或体素的特征或特性；识别具有某种特性的在所述图像中的像素或体素以及它们在所述图像中的位置；定义与其中存在有具有所述某种特性的像素或体素的原始图像的区域或部分相对应的^f象素或体素的子阵列；定义用于进行所述像素或体素编码的第二窗口，所述窗口由将被编码的所述目标像素或体素周围的像素或体素的阵列形成，其具有与所述窗口的像素的数目相关的第二维度，所述窗口的维度和4象素或体素的数目大于所述第一窗口的维度和像素或体素的数目；只对以上定义的像素或体素的子阵列的像素或体素进行像素或体素编码，素的所述原始图 < ; 象的区域或部分相对应；利用所述经过训练和测试的算法，进行通过利用所述第二窗口来编码的所述已编码像素或体素的第二处理，以确定 (first hierarchy level, hierarchy level) 所述像素或体素子阵列的像素或体素的特征或特性，根据利用所述预测算法的第一处理步骤所述像素像的区域或部分相对应；进一步的步骤明显地能够被执行，通过：根据利用预测算法的前述处理步骤识别具有某种特性或特征的在所述图像中的像素或体素以及识别它们在所述图像中的位置；定义像素或体素的子阵列，其与在其中存在具有所述某种特性的像素或体素的原始图像的区域或部分相对应；定义用于进行所述像素或体素编码的新窗口，所述窗口由将被编码的目标像素或体素周围的像素或体素的阵列形成，其具有与所述窗口的像素的数目相关的维度，并且所述窗口的维度和像素或体素的数目不同于在前述处理步骤中定义的窗口的维度和像素或体素的数目；只对以上定义的像素或体素子阵列的像素或体素进行像素或体素编码，所述像素或体素子阵列与在其中存在具有所述某种特性的像素或体素的所述原始图像的区域或部分相对应；利用所述经过训练和测试的算法，进行对通过利用所述新窗口编码的所述已编码像素或体素的进一步处理，以确定所述^f象素或体素子阵列的所述像素或体素的特征或特性，根据具有所述预测算法的前述处理步骤所迷始图像的区域或部分相对应。
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision (的权重) information (相对位置) ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (的权重) information and a maximum hierarchy level (以确定) ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN101189641A CLAIM 15 . 根据前述权利要求11到14中的一个或多个所述的方法，其特征在于，所述预处理步骤包括：提供人工神经网络，其包括与该神经网络的结点对应的细胞（Ki)的 n-维阵列，各个细胞具有到形成该细胞（Ki)的所述邻域的直接相邻细胞 (Kj)的连接，参见图9和10 ; 各个细胞（Ki)具有对于到所述周围细胞的直接相邻细胞（Kj)的各个连接的 (maximum hierarchy) 输入；各个细胞（Ki)具有对于到一个或多个所述直接相邻细胞（Kj)的连接的输出；在各个细胞（Ki)和所迷直接相邻细胞之间的所述连接由权重（Wij) 来确定；通过被定义为所述细胞（Ki)的激活值或函数（Ai)的内部值来进一步表征所述细胞，并且各个细胞（Ki)能够根据被称为传递函数的信号处理函数进行信号处理，以生成细胞输出信号（Ui) ; 所述传递函数将细胞（Ki)的输出信号（Ui)确定为所述细胞（Ki) 的所述激活值或函数（Ai)的函数，在此所述传递函数还包括使所述细胞 (Ki)的所述激活值或函数（Ai)等于细胞（Ki)的输出信号（in)的恒等函数；提供输入数据记录（Pi)的n-维ft据库，所述输入数据记录必须被提交给利用所述神经网络的计算，并且在所述n-维数椐库中，当所述数据记录（Pi)被投影到对应的n-维空间中时，其相对位置 (first subdivision information) 是所述数据记录（Pi) 的相关特征，能够由所述n-维空间中的点的阵列表示所述数据库的数据记录（Pi)，各个点具有在所述点阵列中的已定义的位置并与所迷数据库的数据记录（Pi)相关，所述数据库的各个数据记录（Pi)进一步包括每一个具有某个值（Ui)的至少一个变量或多个变量；各个数据记录（Pi)与形成所述神经网络的n-维细胞阵列的细胞（Ki) 相关，其中细胞（Ki)在n-维细胞（Ki)阵列中具有与由所述n-维点阵列中的点表示的对应的数据记录（Pi)相同的位置；被作为所述网络的初始化值的各个数据记录（Pi)的变量的值（Ui) 被取为所一目关细胞（Ki)的初始激活值（Ai)或初始输出值（Ui) ; 各个细胞（Ki)的所述激活值（Ai)或所述输出值（Ui)在经过所述神经网络的一定数目的迭代处理步骤之后，被作为所W目关数据记录（Pi) 的新值(Ui)。 CN101189641A CLAIM 16 . 根据权利要求15所述的方法，其特征在于，对于所述一定数目的迭代处理步骤的各处理步骤，定义各个细胞（Ki)和所述直接相邻细胞(Kj)之间的连接的权重 (second subdivision, first subdivision) （Wy)被确定为，与直接相邻于所述细胞（Ki) 的细胞（Kj)相关的各个数据记录（Pj)的所述变量的当前值（Uj)的函数，所述函数即所谓的学习函数或规则。 CN101189641A CLAIM 27 . 根据前述权利要求24到26中的一个或多个所述的图像处理方法，其特征在于，其包括如下的步骤：定义用于进行所述^象素或体素编码的第一窗口，所述窗口由将净皮编码的所述目标像素或体素周围的像素或体素的阵列形成，其具有与所述窗口的像素的数目相关的第一维度；进行所述像素或体素的编码；提供经过训练和测试的预测算法，并利用根据以上定义的第一窗口的所迷已编码的像素或体素来进行图像的第一处理，因而确定所述图像中的各个像素或体素的特征或特性；识别具有某种特性的在所述图像中的像素或体素以及它们在所述图像中的位置；定义与其中存在有具有所述某种特性的像素或体素的原始图像的区域或部分相对应的^f象素或体素的子阵列；定义用于进行所述像素或体素编码的第二窗口，所述窗口由将被编码的所述目标像素或体素周围的像素或体素的阵列形成，其具有与所述窗口的像素的数目相关的第二维度，所述窗口的维度和4象素或体素的数目大于所述第一窗口的维度和像素或体素的数目；只对以上定义的像素或体素的子阵列的像素或体素进行像素或体素编码，素的所述原始图 < ; 象的区域或部分相对应；利用所述经过训练和测试的算法，进行通过利用所述第二窗口来编码的所述已编码像素或体素的第二处理，以确定 (first hierarchy level, hierarchy level) 所述像素或体素子阵列的像素或体素的特征或特性，根据利用所述预测算法的第一处理步骤所述像素像的区域或部分相对应；进一步的步骤明显地能够被执行，通过：根据利用预测算法的前述处理步骤识别具有某种特性或特征的在所述图像中的像素或体素以及识别它们在所述图像中的位置；定义像素或体素的子阵列，其与在其中存在具有所述某种特性的像素或体素的原始图像的区域或部分相对应；定义用于进行所述像素或体素编码的新窗口，所述窗口由将被编码的目标像素或体素周围的像素或体素的阵列形成，其具有与所述窗口的像素的数目相关的维度，并且所述窗口的维度和像素或体素的数目不同于在前述处理步骤中定义的窗口的维度和像素或体素的数目；只对以上定义的像素或体素子阵列的像素或体素进行像素或体素编码，所述像素或体素子阵列与在其中存在具有所述某种特性的像素或体素的所述原始图像的区域或部分相对应；利用所述经过训练和测试的算法，进行对通过利用所述新窗口编码的所述已编码像素或体素的进一步处理，以确定所述^f象素或体素子阵列的所述像素或体素的特征或特性，根据具有所述预测算法的前述处理步骤所迷始图像的区域或部分相对应。

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	CN1917647A Filed: 2006-04-19 Issued: 2007-02-21 自适应地选择用于熵编码的上下文模型的方法和设备 (Original Assignee) 三星电子株式会社李培根, 李教爀, 车尚昌, 韩宇镇
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information (视频信号) , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision (解码残差) information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding (该编码器) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN1917647A CLAIM 1 . 一种对残差预测标志进行编码的方法，所述残差预测标志指示多层视频信号 (video information) 增强层块的残差数据是否是根据与所述增强层块的残差数据相对应的较低层块的残差数据来预测的，该方法包括：计算较低层块的特征数据，其中，所述特征数据包括所述较低层块的残差数据的能量和所述较低层块的编码块模式的值中的至少一个；根据所述特征数据确定残差预测标志的编码方法；和使用确定的编码方法对残差预测标志进行编码。 CN1917647A CLAIM 26 . 如权利要求25所述的方法，其中，在对残差预测标志进行解码的过程中，使用以下模型来解码残差 (first subdivision, first subdivision information) 预测标志：如果用于选择上下文模型的参数被设置为“0”，则使用为“0”的概率比为“1”的概率高的第一上下文模型；以及如果所述参数被设置为“1”，则使用为“1”的概率比其为“0”的概率高的第二上下文模型。 CN1917647A CLAIM 30 . 一种用于对残差预测标志进行编码的视频编码器，所述残差预测标志指示多层视频信号的增强层块的残差数据是否是根据与所述增强层块的残差数据相对应的较低层块的残差数据来预测的，该编码器 (information samples using prediction coding) 包括：较低层编码单元，产生较低层块的特征数据，其中所述特征数据包括较低层块的残差数据的能量和较低层块的编码块模式的值中的至少一个；和增强层编码单元，使用残差预测标志的编码方法对残差预测标志进行编码，其中，根据所述特征数据确定所述方法。
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal based on an intra-prediction mode (使用根据) associated with the sub-region and reconstructed samples of a neighboring subset of the second set of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle (使用根据) .	CN1917647A CLAIM 29 . 一种对多层视频信号的增强层进行解码的方法，包括：使用较低层的编码块模式的值确定残差预测标志的解码方法，所述残差预测标志指示增强层是否是根据较低层来预测的；和使用根据 (intra-prediction mode, next intra-prediction cycle) 解码方法选择的熵解码方法对残差预测标志进行解码，使用所述残差预测标志对增强层进行解码。
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision (解码残差) information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	CN1917647A CLAIM 26 . 如权利要求25所述的方法，其中，在对残差预测标志进行解码的过程中，使用以下模型来解码残差 (first subdivision, first subdivision information) 预测标志：如果用于选择上下文模型的参数被设置为“0”，则使用为“0”的概率比为“1”的概率高的第一上下文模型；以及如果所述参数被设置为“1”，则使用为“1”的概率比其为“0”的概率高的第二上下文模型。
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision (解码残差) information includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level is sub-divided .	CN1917647A CLAIM 26 . 如权利要求25所述的方法，其中，在对残差预测标志进行解码的过程中，使用以下模型来解码残差 (first subdivision, first subdivision information) 预测标志：如果用于选择上下文模型的参数被设置为“0”，则使用为“0”的概率比为“1”的概率高的第一上下文模型；以及如果所述参数被设置为“1”，则使用为“1”的概率比其为“0”的概率高的第二上下文模型。
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision (解码残差) information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	CN1917647A CLAIM 26 . 如权利要求25所述的方法，其中，在对残差预测标志进行解码的过程中，使用以下模型来解码残差 (first subdivision, first subdivision information) 预测标志：如果用于选择上下文模型的参数被设置为“0”，则使用为“0”的概率比为“1”的概率高的第一上下文模型；以及如果所述参数被设置为“1”，则使用为“1”的概率比其为“0”的概率高的第二上下文模型。
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information (视频信号) , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision (解码残差) information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding (该编码器) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN1917647A CLAIM 1 . 一种对残差预测标志进行编码的方法，所述残差预测标志指示多层视频信号 (video information) 增强层块的残差数据是否是根据与所述增强层块的残差数据相对应的较低层块的残差数据来预测的，该方法包括：计算较低层块的特征数据，其中，所述特征数据包括所述较低层块的残差数据的能量和所述较低层块的编码块模式的值中的至少一个；根据所述特征数据确定残差预测标志的编码方法；和使用确定的编码方法对残差预测标志进行编码。 CN1917647A CLAIM 26 . 如权利要求25所述的方法，其中，在对残差预测标志进行解码的过程中，使用以下模型来解码残差 (first subdivision, first subdivision information) 预测标志：如果用于选择上下文模型的参数被设置为“0”，则使用为“0”的概率比为“1”的概率高的第一上下文模型；以及如果所述参数被设置为“1”，则使用为“1”的概率比其为“0”的概率高的第二上下文模型。 CN1917647A CLAIM 30 . 一种用于对残差预测标志进行编码的视频编码器，所述残差预测标志指示多层视频信号的增强层块的残差数据是否是根据与所述增强层块的残差数据相对应的较低层块的残差数据来预测的，该编码器 (information samples using prediction coding) 包括：较低层编码单元，产生较低层块的特征数据，其中所述特征数据包括较低层块的残差数据的能量和较低层块的编码块模式的值中的至少一个；和增强层编码单元，使用残差预测标志的编码方法对残差预测标志进行编码，其中，根据所述特征数据确定所述方法。
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information (视频信号) into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision (解码残差) information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding (该编码器) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN1917647A CLAIM 1 . 一种对残差预测标志进行编码的方法，所述残差预测标志指示多层视频信号 (video information) 增强层块的残差数据是否是根据与所述增强层块的残差数据相对应的较低层块的残差数据来预测的，该方法包括：计算较低层块的特征数据，其中，所述特征数据包括所述较低层块的残差数据的能量和所述较低层块的编码块模式的值中的至少一个；根据所述特征数据确定残差预测标志的编码方法；和使用确定的编码方法对残差预测标志进行编码。 CN1917647A CLAIM 26 . 如权利要求25所述的方法，其中，在对残差预测标志进行解码的过程中，使用以下模型来解码残差 (first subdivision, first subdivision information) 预测标志：如果用于选择上下文模型的参数被设置为“0”，则使用为“0”的概率比为“1”的概率高的第一上下文模型；以及如果所述参数被设置为“1”，则使用为“1”的概率比其为“0”的概率高的第二上下文模型。 CN1917647A CLAIM 30 . 一种用于对残差预测标志进行编码的视频编码器，所述残差预测标志指示多层视频信号的增强层块的残差数据是否是根据与所述增强层块的残差数据相对应的较低层块的残差数据来预测的，该编码器 (information samples using prediction coding) 包括：较低层编码单元，产生较低层块的特征数据，其中所述特征数据包括较低层块的残差数据的能量和较低层块的编码块模式的值中的至少一个；和增强层编码单元，使用残差预测标志的编码方法对残差预测标志进行编码，其中，根据所述特征数据确定所述方法。
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information (视频信号) into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision (解码残差) information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding (该编码器) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN1917647A CLAIM 1 . 一种对残差预测标志进行编码的方法，所述残差预测标志指示多层视频信号 (video information) 增强层块的残差数据是否是根据与所述增强层块的残差数据相对应的较低层块的残差数据来预测的，该方法包括：计算较低层块的特征数据，其中，所述特征数据包括所述较低层块的残差数据的能量和所述较低层块的编码块模式的值中的至少一个；根据所述特征数据确定残差预测标志的编码方法；和使用确定的编码方法对残差预测标志进行编码。 CN1917647A CLAIM 26 . 如权利要求25所述的方法，其中，在对残差预测标志进行解码的过程中，使用以下模型来解码残差 (first subdivision, first subdivision information) 预测标志：如果用于选择上下文模型的参数被设置为“0”，则使用为“0”的概率比为“1”的概率高的第一上下文模型；以及如果所述参数被设置为“1”，则使用为“1”的概率比其为“0”的概率高的第二上下文模型。 CN1917647A CLAIM 30 . 一种用于对残差预测标志进行编码的视频编码器，所述残差预测标志指示多层视频信号的增强层块的残差数据是否是根据与所述增强层块的残差数据相对应的较低层块的残差数据来预测的，该编码器 (information samples using prediction coding) 包括：较低层编码单元，产生较低层块的特征数据，其中所述特征数据包括较低层块的残差数据的能量和较低层块的编码块模式的值中的至少一个；和增强层编码单元，使用残差预测标志的编码方法对残差预测标志进行编码，其中，根据所述特征数据确定所述方法。

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20060233251A1 Filed: 2006-04-18 Issued: 2006-10-19 Moving picture coding/decoding method and apparatus (Original Assignee) Samsung Electronics Co Ltd (Current Assignee) Samsung Electronics Co Ltd Wooshik Kim, Dmitri Birinov, Daesung Cho, Hyun Kim
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region (components a) size and the first subdivision information (prediction direction) are associated with prediction coding (prediction modes) and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20060233251A1 CLAIM 1 . A moving picture coding method comprising : (a) selecting a prediction mode to be commonly applied to all color components constituting a color space ; (b) generating first residual data corresponding to differences between a current picture and a predicted picture for each of the color components a (first maximum region) ccording to the prediction mode selected in operation (a) ; (c) generating second residual data corresponding to differences between the first residual data for each of the color components ; and (d) coding the generated second residual data . US20060233251A1 CLAIM 6 . The moving picture coding method of claim 1 , wherein operation (a) comprises selecting a prediction direction (first subdivision information) to be commonly applied to all the color components , and operation (b) comprises generating the predicted picture from adjacent pixels indicated by the selected predicted direction , and generating the first residual data corresponding to e differences between the current picture and the generated predicted picture for each of the color components . US20060233251A1 CLAIM 17 . A moving picture coding method comprising : (a) selecting first prediction modes (intra-prediction mode, prediction coding) to be independently applied to color components constituting a color space or a second prediction mode to be commonly applied to all color components of the color space ; and (b) generating first residual data corresponding to differences between a current picture and a predicted picture for each of the color components according to the first prediction modes or the second prediction mode selected in operation (a) .
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal based on an intra-prediction mode (prediction modes) associated with the sub-region and reconstructed samples of a neighboring subset of the second set of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	US20060233251A1 CLAIM 17 . A moving picture coding method comprising : (a) selecting first prediction modes (intra-prediction mode, prediction coding) to be independently applied to color components constituting a color space or a second prediction mode to be commonly applied to all color components of the color space ; and (b) generating first residual data corresponding to differences between a current picture and a predicted picture for each of the color components according to the first prediction modes or the second prediction mode selected in operation (a) .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set of root regions such that the first set of root regions are rectangular blocks of a size determined by the first maximum region (components a) size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	US20060233251A1 CLAIM 1 . A moving picture coding method comprising : (a) selecting a prediction mode to be commonly applied to all color components constituting a color space ; (b) generating first residual data corresponding to differences between a current picture and a predicted picture for each of the color components a (first maximum region) ccording to the prediction mode selected in operation (a) ; (c) generating second residual data corresponding to differences between the first residual data for each of the color components ; and (d) coding the generated second residual data .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information (prediction direction) indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20060233251A1 CLAIM 6 . The moving picture coding method of claim 1 , wherein operation (a) comprises selecting a prediction direction (first subdivision information) to be commonly applied to all the color components , and operation (b) comprises generating the predicted picture from adjacent pixels indicated by the selected predicted direction , and generating the first residual data corresponding to e differences between the current picture and the generated predicted picture for each of the color components .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision information (prediction direction) includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level is sub-divided .	US20060233251A1 CLAIM 6 . The moving picture coding method of claim 1 , wherein operation (a) comprises selecting a prediction direction (first subdivision information) to be commonly applied to all the color components , and operation (b) comprises generating the predicted picture from adjacent pixels indicated by the selected predicted direction , and generating the first residual data corresponding to e differences between the current picture and the generated predicted picture for each of the color components .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision information (prediction direction) , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20060233251A1 CLAIM 6 . The moving picture coding method of claim 1 , wherein operation (a) comprises selecting a prediction direction (first subdivision information) to be commonly applied to all the color components , and operation (b) comprises generating the predicted picture from adjacent pixels indicated by the selected predicted direction , and generating the first residual data corresponding to e differences between the current picture and the generated predicted picture for each of the color components .
US10250913B2 CLAIM 11 . The decoder according to claim 1 , wherein the recursive multi-tree partitioning includes a quadtree partitioning (prediction unit) technique .	US20060233251A1 CLAIM 29 . A moving picture decoding apparatus comprising : a decoding unit generating second residual data corresponding to differences between first residual data by decoding a bitstream ; an inverse transform unit generating first residual data corresponding to a sum of the generated second residual data in a color space ; a prediction unit (quadtree partitioning, quadtree partitioning technique) generating a prediction picture for each color component constituting the color space according to a prediction mode that is commonly applied to all the color components ; and an adder generating a reconstructed picture corresponding to a sum of the first residual data generated by the inverse transform unit and the predicted pictures generated by the prediction unit .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region (components a) size and the first subdivision information (prediction direction) are associated with prediction coding (prediction modes) and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20060233251A1 CLAIM 1 . A moving picture coding method comprising : (a) selecting a prediction mode to be commonly applied to all color components constituting a color space ; (b) generating first residual data corresponding to differences between a current picture and a predicted picture for each of the color components a (first maximum region) ccording to the prediction mode selected in operation (a) ; (c) generating second residual data corresponding to differences between the first residual data for each of the color components ; and (d) coding the generated second residual data . US20060233251A1 CLAIM 6 . The moving picture coding method of claim 1 , wherein operation (a) comprises selecting a prediction direction (first subdivision information) to be commonly applied to all the color components , and operation (b) comprises generating the predicted picture from adjacent pixels indicated by the selected predicted direction , and generating the first residual data corresponding to e differences between the current picture and the generated predicted picture for each of the color components . US20060233251A1 CLAIM 17 . A moving picture coding method comprising : (a) selecting first prediction modes (intra-prediction mode, prediction coding) to be independently applied to color components constituting a color space or a second prediction mode to be commonly applied to all color components of the color space ; and (b) generating first residual data corresponding to differences between a current picture and a predicted picture for each of the color components according to the first prediction modes or the second prediction mode selected in operation (a) .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region (components a) size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information (prediction direction) , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding (prediction modes) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20060233251A1 CLAIM 1 . A moving picture coding method comprising : (a) selecting a prediction mode to be commonly applied to all color components constituting a color space ; (b) generating first residual data corresponding to differences between a current picture and a predicted picture for each of the color components a (first maximum region) ccording to the prediction mode selected in operation (a) ; (c) generating second residual data corresponding to differences between the first residual data for each of the color components ; and (d) coding the generated second residual data . US20060233251A1 CLAIM 6 . The moving picture coding method of claim 1 , wherein operation (a) comprises selecting a prediction direction (first subdivision information) to be commonly applied to all the color components , and operation (b) comprises generating the predicted picture from adjacent pixels indicated by the selected predicted direction , and generating the first residual data corresponding to e differences between the current picture and the generated predicted picture for each of the color components . US20060233251A1 CLAIM 17 . A moving picture coding method comprising : (a) selecting first prediction modes (intra-prediction mode, prediction coding) to be independently applied to color components constituting a color space or a second prediction mode to be commonly applied to all color components of the color space ; and (b) generating first residual data corresponding to differences between a current picture and a predicted picture for each of the color components according to the first prediction modes or the second prediction mode selected in operation (a) .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region (components a) size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information (prediction direction) ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding (prediction modes) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20060233251A1 CLAIM 1 . A moving picture coding method comprising : (a) selecting a prediction mode to be commonly applied to all color components constituting a color space ; (b) generating first residual data corresponding to differences between a current picture and a predicted picture for each of the color components a (first maximum region) ccording to the prediction mode selected in operation (a) ; (c) generating second residual data corresponding to differences between the first residual data for each of the color components ; and (d) coding the generated second residual data . US20060233251A1 CLAIM 6 . The moving picture coding method of claim 1 , wherein operation (a) comprises selecting a prediction direction (first subdivision information) to be commonly applied to all the color components , and operation (b) comprises generating the predicted picture from adjacent pixels indicated by the selected predicted direction , and generating the first residual data corresponding to e differences between the current picture and the generated predicted picture for each of the color components . US20060233251A1 CLAIM 17 . A moving picture coding method comprising : (a) selecting first prediction modes (intra-prediction mode, prediction coding) to be independently applied to color components constituting a color space or a second prediction mode to be commonly applied to all color components of the color space ; and (b) generating first residual data corresponding to differences between a current picture and a predicted picture for each of the color components according to the first prediction modes or the second prediction mode selected in operation (a) .
US10250913B2 CLAIM 15 . A non-transitory computer readable digital storage medium having stored thereon a computer program (readable recording medium, computer program) having a program code for performing , when running on a computer , a method according to claim 12 .	US20060233251A1 CLAIM 7 . A computer readable recording medium (computer program (computer program) ) having embodied thereon a computer program for the moving picture coding method of claim 1 .
US10250913B2 CLAIM 16 . A non-transitory computer readable digital storage medium having stored thereon a computer program (readable recording medium, computer program) having a program code for performing , when running on a computer , a method according to claim 14 .	US20060233251A1 CLAIM 7 . A computer readable recording medium (computer program (computer program) ) having embodied thereon a computer program for the moving picture coding method of claim 1 .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20060233254A1 Filed: 2006-04-18 Issued: 2006-10-19 Method and apparatus for adaptively selecting context model for entropy coding (Original Assignee) Samsung Electronics Co Ltd (Current Assignee) Samsung Electronics Co Ltd Bae-keun Lee, Kyo-hyuk Lee, Sang-Chang Cha, Woo-jin Han
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream (entropy decoding) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (entropy coding, video encoder) information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding (coded block pattern) and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20060233254A1 CLAIM 1 . A method of coding a residual prediction flag indicating whether residual data for an enhancement layer block of a multi-layered video signal is predicted from residual data for a lower layer block corresponding to the residual data for the enhancement layer block , the method comprising : calculating characteristic data for the lower layer block , wherein the characteristic data comprises at least one of energy of the residual data of the lower layer block and a value of a coded block pattern (prediction coding) (CBP) of the lower layer block ; determining a coding method for the residual prediction flag according to the characteristic data ; and coding the residual prediction flag using the determined coding method . US20060233254A1 CLAIM 23 . The method of claim 21 , wherein the determining of the decoding method comprises setting a context model for decoding the residual prediction flag and the decoding of the residual prediction flag is performed by entropy decoding (data stream) of the set context model , wherein the entropy decoding is an inverse operation of the CABAC . US20060233254A1 CLAIM 30 . A video encoder (second subdivision, intermediate subdivision, second subset, second subdivision information) for coding a residual prediction flag indicating whether residual data for an enhancement layer block of a multi-layered video signal is predicted from residual data for a lower layer block corresponding to the residual data for the enhancement layer block , the encoder comprising : a lower layer encoding unit which generates characteristic data for the lower layer block , wherein the characteristic data comprises at least one of energy of the residual data of the lower layer block and a value of a coded block pattern (CBP) of the lower layer block ; an enhancement layer encoding unit which codes the residual prediction flag using a coding method for the residual prediction flag , wherein the method is determined according to the characteristic data . US20060233254A1 CLAIM 64 . The coding method of claim 55 , wherein the coding of the data for the enhancement layer data is performed by entropy coding (second subdivision, intermediate subdivision, second subset, second subdivision information) .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level from the data stream (entropy decoding) .	US20060233254A1 CLAIM 23 . The method of claim 21 , wherein the determining of the decoding method comprises setting a context model for decoding the residual prediction flag and the decoding of the residual prediction flag is performed by entropy decoding (data stream) of the set context model , wherein the entropy decoding is an inverse operation of the CABAC .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements associated with the first or second set of sub-regions from the data stream (entropy decoding) in a depth-first traversal order .	US20060233254A1 CLAIM 23 . The method of claim 21 , wherein the determining of the decoding method comprises setting a context model for decoding the residual prediction flag and the decoding of the residual prediction flag is performed by entropy decoding (data stream) of the set context model , wherein the entropy decoding is an inverse operation of the CABAC .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream (entropy decoding) , disjoint from a second subset (entropy coding, video encoder) of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision (entropy coding, video encoder) of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20060233254A1 CLAIM 23 . The method of claim 21 , wherein the determining of the decoding method comprises setting a context model for decoding the residual prediction flag and the decoding of the residual prediction flag is performed by entropy decoding (data stream) of the set context model , wherein the entropy decoding is an inverse operation of the CABAC . US20060233254A1 CLAIM 30 . A video encoder (second subdivision, intermediate subdivision, second subset, second subdivision information) for coding a residual prediction flag indicating whether residual data for an enhancement layer block of a multi-layered video signal is predicted from residual data for a lower layer block corresponding to the residual data for the enhancement layer block , the encoder comprising : a lower layer encoding unit which generates characteristic data for the lower layer block , wherein the characteristic data comprises at least one of energy of the residual data of the lower layer block and a value of a coded block pattern (CBP) of the lower layer block ; an enhancement layer encoding unit which codes the residual prediction flag using a coding method for the residual prediction flag , wherein the method is determined according to the characteristic data . US20060233254A1 CLAIM 64 . The coding method of claim 55 , wherein the coding of the data for the enhancement layer data is performed by entropy coding (second subdivision, intermediate subdivision, second subset, second subdivision information) .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream (entropy decoding) , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	US20060233254A1 CLAIM 23 . The method of claim 21 , wherein the determining of the decoding method comprises setting a context model for decoding the residual prediction flag and the decoding of the residual prediction flag is performed by entropy decoding (data stream) of the set context model , wherein the entropy decoding is an inverse operation of the CABAC .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream (entropy decoding) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (entropy coding, video encoder) information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding (coded block pattern) and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20060233254A1 CLAIM 1 . A method of coding a residual prediction flag indicating whether residual data for an enhancement layer block of a multi-layered video signal is predicted from residual data for a lower layer block corresponding to the residual data for the enhancement layer block , the method comprising : calculating characteristic data for the lower layer block , wherein the characteristic data comprises at least one of energy of the residual data of the lower layer block and a value of a coded block pattern (prediction coding) (CBP) of the lower layer block ; determining a coding method for the residual prediction flag according to the characteristic data ; and coding the residual prediction flag using the determined coding method . US20060233254A1 CLAIM 23 . The method of claim 21 , wherein the determining of the decoding method comprises setting a context model for decoding the residual prediction flag and the decoding of the residual prediction flag is performed by entropy decoding (data stream) of the set context model , wherein the entropy decoding is an inverse operation of the CABAC . US20060233254A1 CLAIM 30 . A video encoder (second subdivision, intermediate subdivision, second subset, second subdivision information) for coding a residual prediction flag indicating whether residual data for an enhancement layer block of a multi-layered video signal is predicted from residual data for a lower layer block corresponding to the residual data for the enhancement layer block , the encoder comprising : a lower layer encoding unit which generates characteristic data for the lower layer block , wherein the characteristic data comprises at least one of energy of the residual data of the lower layer block and a value of a coded block pattern (CBP) of the lower layer block ; an enhancement layer encoding unit which codes the residual prediction flag using a coding method for the residual prediction flag , wherein the method is determined according to the characteristic data . US20060233254A1 CLAIM 64 . The coding method of claim 55 , wherein the coding of the data for the enhancement layer data is performed by entropy coding (second subdivision, intermediate subdivision, second subset, second subdivision information) .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (entropy coding, video encoder) information and a maximum hierarchy level ; and a data stream (entropy decoding) generator configured to : encode the array of information samples using prediction coding (coded block pattern) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20060233254A1 CLAIM 1 . A method of coding a residual prediction flag indicating whether residual data for an enhancement layer block of a multi-layered video signal is predicted from residual data for a lower layer block corresponding to the residual data for the enhancement layer block , the method comprising : calculating characteristic data for the lower layer block , wherein the characteristic data comprises at least one of energy of the residual data of the lower layer block and a value of a coded block pattern (prediction coding) (CBP) of the lower layer block ; determining a coding method for the residual prediction flag according to the characteristic data ; and coding the residual prediction flag using the determined coding method . US20060233254A1 CLAIM 23 . The method of claim 21 , wherein the determining of the decoding method comprises setting a context model for decoding the residual prediction flag and the decoding of the residual prediction flag is performed by entropy decoding (data stream) of the set context model , wherein the entropy decoding is an inverse operation of the CABAC . US20060233254A1 CLAIM 30 . A video encoder (second subdivision, intermediate subdivision, second subset, second subdivision information) for coding a residual prediction flag indicating whether residual data for an enhancement layer block of a multi-layered video signal is predicted from residual data for a lower layer block corresponding to the residual data for the enhancement layer block , the encoder comprising : a lower layer encoding unit which generates characteristic data for the lower layer block , wherein the characteristic data comprises at least one of energy of the residual data of the lower layer block and a value of a coded block pattern (CBP) of the lower layer block ; an enhancement layer encoding unit which codes the residual prediction flag using a coding method for the residual prediction flag , wherein the method is determined according to the characteristic data . US20060233254A1 CLAIM 64 . The coding method of claim 55 , wherein the coding of the data for the enhancement layer data is performed by entropy coding (second subdivision, intermediate subdivision, second subset, second subdivision information) .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (entropy coding, video encoder) information and a maximum hierarchy level ; encoding the array of information samples using prediction coding (coded block pattern) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream (entropy decoding) the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20060233254A1 CLAIM 1 . A method of coding a residual prediction flag indicating whether residual data for an enhancement layer block of a multi-layered video signal is predicted from residual data for a lower layer block corresponding to the residual data for the enhancement layer block , the method comprising : calculating characteristic data for the lower layer block , wherein the characteristic data comprises at least one of energy of the residual data of the lower layer block and a value of a coded block pattern (prediction coding) (CBP) of the lower layer block ; determining a coding method for the residual prediction flag according to the characteristic data ; and coding the residual prediction flag using the determined coding method . US20060233254A1 CLAIM 23 . The method of claim 21 , wherein the determining of the decoding method comprises setting a context model for decoding the residual prediction flag and the decoding of the residual prediction flag is performed by entropy decoding (data stream) of the set context model , wherein the entropy decoding is an inverse operation of the CABAC . US20060233254A1 CLAIM 30 . A video encoder (second subdivision, intermediate subdivision, second subset, second subdivision information) for coding a residual prediction flag indicating whether residual data for an enhancement layer block of a multi-layered video signal is predicted from residual data for a lower layer block corresponding to the residual data for the enhancement layer block , the encoder comprising : a lower layer encoding unit which generates characteristic data for the lower layer block , wherein the characteristic data comprises at least one of energy of the residual data of the lower layer block and a value of a coded block pattern (CBP) of the lower layer block ; an enhancement layer encoding unit which codes the residual prediction flag using a coding method for the residual prediction flag , wherein the method is determined according to the characteristic data . US20060233254A1 CLAIM 64 . The coding method of claim 55 , wherein the coding of the data for the enhancement layer data is performed by entropy coding (second subdivision, intermediate subdivision, second subset, second subdivision information) .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	CN101416399A Filed: 2006-03-31 Issued: 2009-04-22 用于执行分层解码的分层解码器和方法 (Original Assignee) 英特尔公司 D·Y·帕夫洛夫, M·Y·利亚克
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy (以便允许) level wherein the first maximum region size (一种解码) and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN101416399A CLAIM 1 . 一种解码 (first maximum region size) 器，包括：消息存储器，用于存储多层更新后的外部可靠性块；列-和存储器，用于存储包括列-和数据的软位；减法元件，用于将所述列-和数据的对应软位减去一层所述更新后的外部可靠性；层处理器，用于根据所述减法元件提供的软位生成所述更新后的可靠性；以及求和元件，用于将所述层处理器生成的所述更新后的外部可靠性与所述减法元件提供的之前子迭代的软位相加，以生成所述列-和数据。 CN101416399A CLAIM 5 . 如权利要求4所述的解码器，还包括延迟元件，所述延迟元件用于向所述求和元件提供从所述减法元件接收的来自之前子迭代的软位，以便允许 (maximum hierarchy) 所述求和元件为当前子迭代生成列-和数据。
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set of root regions such that the first set of root regions are rectangular blocks of a size determined by the first maximum region size (一种解码) , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	CN101416399A CLAIM 1 . 一种解码 (first maximum region size) 器，包括：消息存储器，用于存储多层更新后的外部可靠性块；列-和存储器，用于存储包括列-和数据的软位；减法元件，用于将所述列-和数据的对应软位减去一层所述更新后的外部可靠性；层处理器，用于根据所述减法元件提供的软位生成所述更新后的可靠性；以及求和元件，用于将所述层处理器生成的所述更新后的外部可靠性与所述减法元件提供的之前子迭代的软位相加，以生成所述列-和数据。
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy (以便允许) level is reached .	CN101416399A CLAIM 5 . 如权利要求4所述的解码器，还包括延迟元件，所述延迟元件用于向所述求和元件提供从所述减法元件接收的来自之前子迭代的软位，以便允许 (maximum hierarchy) 所述求和元件为当前子迭代生成列-和数据。
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy (以便允许) level from the data stream .	CN101416399A CLAIM 5 . 如权利要求4所述的解码器，还包括延迟元件，所述延迟元件用于向所述求和元件提供从所述减法元件接收的来自之前子迭代的软位，以便允许 (maximum hierarchy) 所述求和元件为当前子迭代生成列-和数据。
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy (以便允许) level , wherein the first maximum region size (一种解码) and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN101416399A CLAIM 1 . 一种解码 (first maximum region size) 器，包括：消息存储器，用于存储多层更新后的外部可靠性块；列-和存储器，用于存储包括列-和数据的软位；减法元件，用于将所述列-和数据的对应软位减去一层所述更新后的外部可靠性；层处理器，用于根据所述减法元件提供的软位生成所述更新后的可靠性；以及求和元件，用于将所述层处理器生成的所述更新后的外部可靠性与所述减法元件提供的之前子迭代的软位相加，以生成所述列-和数据。 CN101416399A CLAIM 5 . 如权利要求4所述的解码器，还包括延迟元件，所述延迟元件用于向所述求和元件提供从所述减法元件接收的来自之前子迭代的软位，以便允许 (maximum hierarchy) 所述求和元件为当前子迭代生成列-和数据。
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size (一种解码) , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy (以便允许) level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN101416399A CLAIM 1 . 一种解码 (first maximum region size) 器，包括：消息存储器，用于存储多层更新后的外部可靠性块；列-和存储器，用于存储包括列-和数据的软位；减法元件，用于将所述列-和数据的对应软位减去一层所述更新后的外部可靠性；层处理器，用于根据所述减法元件提供的软位生成所述更新后的可靠性；以及求和元件，用于将所述层处理器生成的所述更新后的外部可靠性与所述减法元件提供的之前子迭代的软位相加，以生成所述列-和数据。 CN101416399A CLAIM 5 . 如权利要求4所述的解码器，还包括延迟元件，所述延迟元件用于向所述求和元件提供从所述减法元件接收的来自之前子迭代的软位，以便允许 (maximum hierarchy) 所述求和元件为当前子迭代生成列-和数据。
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size (一种解码) ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy (以便允许) level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN101416399A CLAIM 1 . 一种解码 (first maximum region size) 器，包括：消息存储器，用于存储多层更新后的外部可靠性块；列-和存储器，用于存储包括列-和数据的软位；减法元件，用于将所述列-和数据的对应软位减去一层所述更新后的外部可靠性；层处理器，用于根据所述减法元件提供的软位生成所述更新后的可靠性；以及求和元件，用于将所述层处理器生成的所述更新后的外部可靠性与所述减法元件提供的之前子迭代的软位相加，以生成所述列-和数据。 CN101416399A CLAIM 5 . 如权利要求4所述的解码器，还包括延迟元件，所述延迟元件用于向所述求和元件提供从所述减法元件接收的来自之前子迭代的软位，以便允许 (maximum hierarchy) 所述求和元件为当前子迭代生成列-和数据。
US10250913B2 CLAIM 15 . A non-transitory computer readable digital storage medium having stored thereon a computer program (将存储) having a program code for performing , when running on a computer , a method according to claim 12 .	CN101416399A CLAIM 3 . 如权利要求2所述的解码器，其中对于所述子迭代中的每次子迭代，选择所述消息存储器中的下一层所述更新后的外部可靠性；并且所述减法元件将存储 (spatial domain, spatial domain transform coding, computer program) 在所述列-和存储器中的列-和数据位减去所选择的下一层的所述更新后的外部可靠性。
US10250913B2 CLAIM 16 . A non-transitory computer readable digital storage medium having stored thereon a computer program (将存储) having a program code for performing , when running on a computer , a method according to claim 14 .	CN101416399A CLAIM 3 . 如权利要求2所述的解码器，其中对于所述子迭代中的每次子迭代，选择所述消息存储器中的下一层所述更新后的外部可靠性；并且所述减法元件将存储 (spatial domain, spatial domain transform coding, computer program) 在所述列-和存储器中的列-和数据位减去所选择的下一层的所述更新后的外部可靠性。

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20090037791A1 Filed: 2006-03-31 Issued: 2009-02-05 Layered decoder and method for performing layered decoding (Original Assignee) Intel Corp (Current Assignee) Intel Corp Dmitri Yurievich Pavlov, Mikhail Yurievich Lyakh
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream (parity check) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information (code blocks) , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set (current data) of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20090037791A1 CLAIM 6 . The decoder of claim 2 wherein the input data comprises blocks of soft bits generated by a demodulator of a multicarrier receiver , and wherein the decoder is a low-density parity check (data stream) (LDPC) decoder that implements layered LDPC decoding . US20090037791A1 CLAIM 11 . A method of decoding blocks of soft bits comprising : initializing a memory with input data ; updating the memory with sums of updated extrinsic reliabilities generated by processing differences between current data (second set) in the memory and the updated extrinsic reliabilities ; and reading decoded output data from the memory after a predetermined number of iterations . US20090037791A1 CLAIM 22 . A data storage system comprising : a data-storage unit to store data encoded with a layered low-density parity check (LDPC) code ; and a decoder to decode blocks (second subdivision information) of input data retrieved from the data-storage unit and to generate blocks of output data , the decoder comprising a message memory to store layers of blocks of updated extrinsic reliabilities , a column-sum memory to store soft bits comprising column-sum data , a subtraction element to subtract a layer of the updated extrinsic reliabilities from corresponding soft bits of the column-sum data , a layer processor to generate the updated reliabilities from soft bits provided by the subtraction element , and a sum element to add the updated extrinsic reliabilities generated by the layer processor with soft bits of prior subiterations provided by the subtraction element to generate the column-sum data .
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset of the second set (current data) of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	US20090037791A1 CLAIM 11 . A method of decoding blocks of soft bits comprising : initializing a memory with input data ; updating the memory with sums of updated extrinsic reliabilities generated by processing differences between current data (second set) in the memory and the updated extrinsic reliabilities ; and reading decoded output data from the memory after a predetermined number of iterations .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition (data storage system) rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20090037791A1 CLAIM 22 . A data storage system (respective partition, respective partition rules, partition rules, order hierarchy levels using respective partition rules) comprising : a data-storage unit to store data encoded with a layered low-density parity check (LDPC) code ; and a decoder to decode blocks of input data retrieved from the data-storage unit and to generate blocks of output data , the decoder comprising a message memory to store layers of blocks of updated extrinsic reliabilities , a column-sum memory to store soft bits comprising column-sum data , a subtraction element to subtract a layer of the updated extrinsic reliabilities from corresponding soft bits of the column-sum data , a layer processor to generate the updated reliabilities from soft bits provided by the subtraction element , and a sum element to add the updated extrinsic reliabilities generated by the layer processor with soft bits of prior subiterations provided by the subtraction element to generate the column-sum data .
US10250913B2 CLAIM 5 . The decoder according to claim 4 , wherein the divider is configured to , in accordance with the partition rules (data storage system) associated with the first and higher-order hierarchy levels , sub-divide into sub-regions of equal size , such that there are an equal number of sub-regions at each hierarchy level .	US20090037791A1 CLAIM 22 . A data storage system (respective partition, respective partition rules, partition rules, order hierarchy levels using respective partition rules) comprising : a data-storage unit to store data encoded with a layered low-density parity check (LDPC) code ; and a decoder to decode blocks of input data retrieved from the data-storage unit and to generate blocks of output data , the decoder comprising a message memory to store layers of blocks of updated extrinsic reliabilities , a column-sum memory to store soft bits comprising column-sum data , a subtraction element to subtract a layer of the updated extrinsic reliabilities from corresponding soft bits of the column-sum data , a layer processor to generate the updated reliabilities from soft bits provided by the subtraction element , and a sum element to add the updated extrinsic reliabilities generated by the layer processor with soft bits of prior subiterations provided by the subtraction element to generate the column-sum data .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level from the data stream (parity check) .	US20090037791A1 CLAIM 6 . The decoder of claim 2 wherein the input data comprises blocks of soft bits generated by a demodulator of a multicarrier receiver , and wherein the decoder is a low-density parity check (data stream) (LDPC) decoder that implements layered LDPC decoding .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements (storage element) associated with the first or second set (current data) of sub-regions from the data stream (parity check) in a depth-first traversal order .	US20090037791A1 CLAIM 6 . The decoder of claim 2 wherein the input data comprises blocks of soft bits generated by a demodulator of a multicarrier receiver , and wherein the decoder is a low-density parity check (data stream) (LDPC) decoder that implements layered LDPC decoding . US20090037791A1 CLAIM 11 . A method of decoding blocks of soft bits comprising : initializing a memory with input data ; updating the memory with sums of updated extrinsic reliabilities generated by processing differences between current data (second set) in the memory and the updated extrinsic reliabilities ; and reading decoded output data from the memory after a predetermined number of iterations . US20090037791A1 CLAIM 24 . The data storage system of claim 23 further comprising a data-reading unit to read the blocks of input data from the data-storage element (syntax elements) , and wherein the decoder further comprises : multiplexer to initially route the input data to the column-sum memory and to subsequently route the column-sum data from the sum element to the column-sum memory after each of a plurality of subiterations , wherein the column-sum data comprises sums of updated extrinsic reliabilities in the message memory summed with the input data .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements (storage element) of the data stream (parity check) , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20090037791A1 CLAIM 6 . The decoder of claim 2 wherein the input data comprises blocks of soft bits generated by a demodulator of a multicarrier receiver , and wherein the decoder is a low-density parity check (data stream) (LDPC) decoder that implements layered LDPC decoding . US20090037791A1 CLAIM 24 . The data storage system of claim 23 further comprising a data-reading unit to read the blocks of input data from the data-storage element (syntax elements) , and wherein the decoder further comprises : multiplexer to initially route the input data to the column-sum memory and to subsequently route the column-sum data from the sum element to the column-sum memory after each of a plurality of subiterations , wherein the column-sum data comprises sums of updated extrinsic reliabilities in the message memory summed with the input data .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream (parity check) , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	US20090037791A1 CLAIM 6 . The decoder of claim 2 wherein the input data comprises blocks of soft bits generated by a demodulator of a multicarrier receiver , and wherein the decoder is a low-density parity check (data stream) (LDPC) decoder that implements layered LDPC decoding .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream (parity check) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information (code blocks) , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set (current data) of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20090037791A1 CLAIM 6 . The decoder of claim 2 wherein the input data comprises blocks of soft bits generated by a demodulator of a multicarrier receiver , and wherein the decoder is a low-density parity check (data stream) (LDPC) decoder that implements layered LDPC decoding . US20090037791A1 CLAIM 11 . A method of decoding blocks of soft bits comprising : initializing a memory with input data ; updating the memory with sums of updated extrinsic reliabilities generated by processing differences between current data (second set) in the memory and the updated extrinsic reliabilities ; and reading decoded output data from the memory after a predetermined number of iterations . US20090037791A1 CLAIM 22 . A data storage system comprising : a data-storage unit to store data encoded with a layered low-density parity check (LDPC) code ; and a decoder to decode blocks (second subdivision information) of input data retrieved from the data-storage unit and to generate blocks of output data , the decoder comprising a message memory to store layers of blocks of updated extrinsic reliabilities , a column-sum memory to store soft bits comprising column-sum data , a subtraction element to subtract a layer of the updated extrinsic reliabilities from corresponding soft bits of the column-sum data , a layer processor to generate the updated reliabilities from soft bits provided by the subtraction element , and a sum element to add the updated extrinsic reliabilities generated by the layer processor with soft bits of prior subiterations provided by the subtraction element to generate the column-sum data .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set (current data) of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information (code blocks) and a maximum hierarchy level ; and a data stream (parity check) generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20090037791A1 CLAIM 6 . The decoder of claim 2 wherein the input data comprises blocks of soft bits generated by a demodulator of a multicarrier receiver , and wherein the decoder is a low-density parity check (data stream) (LDPC) decoder that implements layered LDPC decoding . US20090037791A1 CLAIM 11 . A method of decoding blocks of soft bits comprising : initializing a memory with input data ; updating the memory with sums of updated extrinsic reliabilities generated by processing differences between current data (second set) in the memory and the updated extrinsic reliabilities ; and reading decoded output data from the memory after a predetermined number of iterations . US20090037791A1 CLAIM 22 . A data storage system comprising : a data-storage unit to store data encoded with a layered low-density parity check (LDPC) code ; and a decoder to decode blocks (second subdivision information) of input data retrieved from the data-storage unit and to generate blocks of output data , the decoder comprising a message memory to store layers of blocks of updated extrinsic reliabilities , a column-sum memory to store soft bits comprising column-sum data , a subtraction element to subtract a layer of the updated extrinsic reliabilities from corresponding soft bits of the column-sum data , a layer processor to generate the updated reliabilities from soft bits provided by the subtraction element , and a sum element to add the updated extrinsic reliabilities generated by the layer processor with soft bits of prior subiterations provided by the subtraction element to generate the column-sum data .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set (current data) of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information (code blocks) and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream (parity check) the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20090037791A1 CLAIM 6 . The decoder of claim 2 wherein the input data comprises blocks of soft bits generated by a demodulator of a multicarrier receiver , and wherein the decoder is a low-density parity check (data stream) (LDPC) decoder that implements layered LDPC decoding . US20090037791A1 CLAIM 11 . A method of decoding blocks of soft bits comprising : initializing a memory with input data ; updating the memory with sums of updated extrinsic reliabilities generated by processing differences between current data (second set) in the memory and the updated extrinsic reliabilities ; and reading decoded output data from the memory after a predetermined number of iterations . US20090037791A1 CLAIM 22 . A data storage system comprising : a data-storage unit to store data encoded with a layered low-density parity check (LDPC) code ; and a decoder to decode blocks (second subdivision information) of input data retrieved from the data-storage unit and to generate blocks of output data , the decoder comprising a message memory to store layers of blocks of updated extrinsic reliabilities , a column-sum memory to store soft bits comprising column-sum data , a subtraction element to subtract a layer of the updated extrinsic reliabilities from corresponding soft bits of the column-sum data , a layer processor to generate the updated reliabilities from soft bits provided by the subtraction element , and a sum element to add the updated extrinsic reliabilities generated by the layer processor with soft bits of prior subiterations provided by the subtraction element to generate the column-sum data .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20060262216A1 Filed: 2006-03-29 Issued: 2006-11-23 Method and apparatus for encoding video pictures, and method and apparatus for decoding video pictures (Original Assignee) Jiefu Zhai; Ying Chen (Current Assignee) InterDigital Madison Patent Holdings Inc Jiefu Zhai, Ying Chen
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information (second video data) , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding (residual information) and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20060262216A1 CLAIM 4 . Method according to claim 1 , wherein intra-coding of a picture on macroblock level comprises the steps of defining a plurality of subblocks of a macroblock ; selecting a first subblock from the defined subblocks or from subblocks of a neighboring macroblock ; defining a prediction direction within the macroblock ; performing a prediction for a second subblock within the macroblock using the selected first subblock and the prediction direction ; and generating residual information (quadtree partitioning, prediction coding, quadtree partitioning technique) , the residual information being the difference between the predicted subblock and the actual second subblock . US20060262216A1 CLAIM 7 . Method according to the claim 6 , wherein the decoding of the encoded second video picture comprises the steps of extracting from the encoded second video data (video information) first macroblock data including first subblock data and first residual update data ; extracting from the encoded first video picture first prediction direction data referring to the first macroblock data ; decoding a first subblock of the first macroblock from the encoded first macroblock data ; predicting from the first subblock and the first prediction information a second subblock of the first macroblock ; and updating the predicted second subblocks of the first macroblock with the extracted first residual update data .
US10250913B2 CLAIM 11 . The decoder according to claim 1 , wherein the recursive multi-tree partitioning includes a quadtree partitioning (residual information) technique .	US20060262216A1 CLAIM 4 . Method according to claim 1 , wherein intra-coding of a picture on macroblock level comprises the steps of defining a plurality of subblocks of a macroblock ; selecting a first subblock from the defined subblocks or from subblocks of a neighboring macroblock ; defining a prediction direction within the macroblock ; performing a prediction for a second subblock within the macroblock using the selected first subblock and the prediction direction ; and generating residual information (quadtree partitioning, prediction coding, quadtree partitioning technique) , the residual information being the difference between the predicted subblock and the actual second subblock .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information (second video data) , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding (residual information) and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20060262216A1 CLAIM 4 . Method according to claim 1 , wherein intra-coding of a picture on macroblock level comprises the steps of defining a plurality of subblocks of a macroblock ; selecting a first subblock from the defined subblocks or from subblocks of a neighboring macroblock ; defining a prediction direction within the macroblock ; performing a prediction for a second subblock within the macroblock using the selected first subblock and the prediction direction ; and generating residual information (quadtree partitioning, prediction coding, quadtree partitioning technique) , the residual information being the difference between the predicted subblock and the actual second subblock . US20060262216A1 CLAIM 7 . Method according to the claim 6 , wherein the decoding of the encoded second video picture comprises the steps of extracting from the encoded second video data (video information) first macroblock data including first subblock data and first residual update data ; extracting from the encoded first video picture first prediction direction data referring to the first macroblock data ; decoding a first subblock of the first macroblock from the encoded first macroblock data ; predicting from the first subblock and the first prediction information a second subblock of the first macroblock ; and updating the predicted second subblocks of the first macroblock with the extracted first residual update data .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information (second video data) into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding (residual information) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20060262216A1 CLAIM 4 . Method according to claim 1 , wherein intra-coding of a picture on macroblock level comprises the steps of defining a plurality of subblocks of a macroblock ; selecting a first subblock from the defined subblocks or from subblocks of a neighboring macroblock ; defining a prediction direction within the macroblock ; performing a prediction for a second subblock within the macroblock using the selected first subblock and the prediction direction ; and generating residual information (quadtree partitioning, prediction coding, quadtree partitioning technique) , the residual information being the difference between the predicted subblock and the actual second subblock . US20060262216A1 CLAIM 7 . Method according to the claim 6 , wherein the decoding of the encoded second video picture comprises the steps of extracting from the encoded second video data (video information) first macroblock data including first subblock data and first residual update data ; extracting from the encoded first video picture first prediction direction data referring to the first macroblock data ; decoding a first subblock of the first macroblock from the encoded first macroblock data ; predicting from the first subblock and the first prediction information a second subblock of the first macroblock ; and updating the predicted second subblocks of the first macroblock with the extracted first residual update data .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information (second video data) into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding (residual information) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20060262216A1 CLAIM 4 . Method according to claim 1 , wherein intra-coding of a picture on macroblock level comprises the steps of defining a plurality of subblocks of a macroblock ; selecting a first subblock from the defined subblocks or from subblocks of a neighboring macroblock ; defining a prediction direction within the macroblock ; performing a prediction for a second subblock within the macroblock using the selected first subblock and the prediction direction ; and generating residual information (quadtree partitioning, prediction coding, quadtree partitioning technique) , the residual information being the difference between the predicted subblock and the actual second subblock . US20060262216A1 CLAIM 7 . Method according to the claim 6 , wherein the decoding of the encoded second video picture comprises the steps of extracting from the encoded second video data (video information) first macroblock data including first subblock data and first residual update data ; extracting from the encoded first video picture first prediction direction data referring to the first macroblock data ; decoding a first subblock of the first macroblock from the encoded first macroblock data ; predicting from the first subblock and the first prediction information a second subblock of the first macroblock ; and updating the predicted second subblocks of the first macroblock with the extracted first residual update data .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20070237224A1 Filed: 2006-03-28 Issued: 2007-10-11 Method of reducing computations in intra-prediction and mode decision processes in a digital video encoder (Original Assignee) Sony Corp; Sony Electronics Inc (Current Assignee) Sony Corp ; Sony Electronics Inc Rathish Krishnan
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision (plane prediction) information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20070237224A1 CLAIM 8 . The method as claimed in claim 1 wherein obtaining the one or more sums of absolute transformed differences is for vertical prediction , horizontal prediction , DC prediction and plane prediction (first subdivision) .
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal based on an intra-prediction mode (intra-prediction mode) associated with the sub-region and reconstructed samples of a neighboring subset of the second set of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle (intra-prediction mode) .	US20070237224A1 CLAIM 9 . The method as claimed in claim 1 wherein the method results in determining a best intra-prediction mode (intra-prediction mode, next intra-prediction cycle, rectangular blocks) .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set of root regions such that the first set of root regions are rectangular blocks (intra-prediction mode) of a size determined by the first maximum region size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	US20070237224A1 CLAIM 9 . The method as claimed in claim 1 wherein the method results in determining a best intra-prediction mode (intra-prediction mode, next intra-prediction cycle, rectangular blocks) .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision (plane prediction) information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20070237224A1 CLAIM 8 . The method as claimed in claim 1 wherein obtaining the one or more sums of absolute transformed differences is for vertical prediction , horizontal prediction , DC prediction and plane prediction (first subdivision) .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision (plane prediction) information includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level is sub-divided .	US20070237224A1 CLAIM 8 . The method as claimed in claim 1 wherein obtaining the one or more sums of absolute transformed differences is for vertical prediction , horizontal prediction , DC prediction and plane prediction (first subdivision) .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision (plane prediction) information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20070237224A1 CLAIM 8 . The method as claimed in claim 1 wherein obtaining the one or more sums of absolute transformed differences is for vertical prediction , horizontal prediction , DC prediction and plane prediction (first subdivision) .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision (plane prediction) information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20070237224A1 CLAIM 8 . The method as claimed in claim 1 wherein obtaining the one or more sums of absolute transformed differences is for vertical prediction , horizontal prediction , DC prediction and plane prediction (first subdivision) .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision (plane prediction) information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20070237224A1 CLAIM 8 . The method as claimed in claim 1 wherein obtaining the one or more sums of absolute transformed differences is for vertical prediction , horizontal prediction , DC prediction and plane prediction (first subdivision) .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision (plane prediction) information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20070237224A1 CLAIM 8 . The method as claimed in claim 1 wherein obtaining the one or more sums of absolute transformed differences is for vertical prediction , horizontal prediction , DC prediction and plane prediction (first subdivision) .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20060198444A1 Filed: 2006-03-02 Issued: 2006-09-07 Moving picture processor, method for processing a moving picture, and computer program product for executing an application for a moving picture processor (Original Assignee) Toshiba Corp (Current Assignee) Toshiba Corp Takahisa Wada
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size (second minimum, first minimum) and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region (second minimum, first minimum) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20060198444A1 CLAIM 7 . The moving picture processor of claim 2 , wherein the first detector comprises : a target block memory configured to store data of the target block ; a reference block memory configured to store data of the reference block ; a first operator configured to execute an matching operation between the target block and the reference block , and to generate a first motion vector and a first error value of the matching operation ; a first motion vector register configured to store the first motion vector ; a first minimum (first maximum region size, root region) register configured to store the first error value ; and a first minimum determination circuit configured to read the first motion vector out of the first motion vector register as the first motion vector candidate when the first error value becomes minimum . US20060198444A1 CLAIM 8 . The moving picture processor of claim 7 , wherein the second detector comprises : a first adjacent block memory configured to store data of the first adjacent block ; a first adjacent reference block memory configured to store data of the first adjacent reference block ; a second operator configured to execute a matching operation between the first adjacent block and the first adjacent reference block , and to generate a second motion vector and a second error value of the matching operation ; a second motion vector register configured to store the second motion vector ; a first adder configured to add the first error value to the second error value , and to obtain a first sum ; a second minimum (first maximum region size, root region) register configured to store the first sum ; and a second minimum determination circuit configured to read the second motion vector out of the second motion vector register as the second motion vector candidate when the first sum becomes minimum .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set of root regions such that the first set of root regions are rectangular blocks of a size determined by the first maximum region size (second minimum, first minimum) , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	US20060198444A1 CLAIM 7 . The moving picture processor of claim 2 , wherein the first detector comprises : a target block memory configured to store data of the target block ; a reference block memory configured to store data of the reference block ; a first operator configured to execute an matching operation between the target block and the reference block , and to generate a first motion vector and a first error value of the matching operation ; a first motion vector register configured to store the first motion vector ; a first minimum (first maximum region size, root region) register configured to store the first error value ; and a first minimum determination circuit configured to read the first motion vector out of the first motion vector register as the first motion vector candidate when the first error value becomes minimum . US20060198444A1 CLAIM 8 . The moving picture processor of claim 7 , wherein the second detector comprises : a first adjacent block memory configured to store data of the first adjacent block ; a first adjacent reference block memory configured to store data of the first adjacent reference block ; a second operator configured to execute a matching operation between the first adjacent block and the first adjacent reference block , and to generate a second motion vector and a second error value of the matching operation ; a second motion vector register configured to store the second motion vector ; a first adder configured to add the first error value to the second error value , and to obtain a first sum ; a second minimum (first maximum region size, root region) register configured to store the first sum ; and a second minimum determination circuit configured to read the second motion vector out of the second motion vector register as the second motion vector candidate when the first sum becomes minimum .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region (second minimum, first minimum) into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20060198444A1 CLAIM 7 . The moving picture processor of claim 2 , wherein the first detector comprises : a target block memory configured to store data of the target block ; a reference block memory configured to store data of the reference block ; a first operator configured to execute an matching operation between the target block and the reference block , and to generate a first motion vector and a first error value of the matching operation ; a first motion vector register configured to store the first motion vector ; a first minimum (first maximum region size, root region) register configured to store the first error value ; and a first minimum determination circuit configured to read the first motion vector out of the first motion vector register as the first motion vector candidate when the first error value becomes minimum . US20060198444A1 CLAIM 8 . The moving picture processor of claim 7 , wherein the second detector comprises : a first adjacent block memory configured to store data of the first adjacent block ; a first adjacent reference block memory configured to store data of the first adjacent reference block ; a second operator configured to execute a matching operation between the first adjacent block and the first adjacent reference block , and to generate a second motion vector and a second error value of the matching operation ; a second motion vector register configured to store the second motion vector ; a first adder configured to add the first error value to the second error value , and to obtain a first sum ; a second minimum (first maximum region size, root region) register configured to store the first sum ; and a second minimum determination circuit configured to read the second motion vector out of the second motion vector register as the second motion vector candidate when the first sum becomes minimum .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size (second minimum, first minimum) and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region (second minimum, first minimum) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20060198444A1 CLAIM 7 . The moving picture processor of claim 2 , wherein the first detector comprises : a target block memory configured to store data of the target block ; a reference block memory configured to store data of the reference block ; a first operator configured to execute an matching operation between the target block and the reference block , and to generate a first motion vector and a first error value of the matching operation ; a first motion vector register configured to store the first motion vector ; a first minimum (first maximum region size, root region) register configured to store the first error value ; and a first minimum determination circuit configured to read the first motion vector out of the first motion vector register as the first motion vector candidate when the first error value becomes minimum . US20060198444A1 CLAIM 8 . The moving picture processor of claim 7 , wherein the second detector comprises : a first adjacent block memory configured to store data of the first adjacent block ; a first adjacent reference block memory configured to store data of the first adjacent reference block ; a second operator configured to execute a matching operation between the first adjacent block and the first adjacent reference block , and to generate a second motion vector and a second error value of the matching operation ; a second motion vector register configured to store the second motion vector ; a first adder configured to add the first error value to the second error value , and to obtain a first sum ; a second minimum (first maximum region size, root region) register configured to store the first sum ; and a second minimum determination circuit configured to read the second motion vector out of the second motion vector register as the second motion vector candidate when the first sum becomes minimum .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size (second minimum, first minimum) , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region (second minimum, first minimum) of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20060198444A1 CLAIM 7 . The moving picture processor of claim 2 , wherein the first detector comprises : a target block memory configured to store data of the target block ; a reference block memory configured to store data of the reference block ; a first operator configured to execute an matching operation between the target block and the reference block , and to generate a first motion vector and a first error value of the matching operation ; a first motion vector register configured to store the first motion vector ; a first minimum (first maximum region size, root region) register configured to store the first error value ; and a first minimum determination circuit configured to read the first motion vector out of the first motion vector register as the first motion vector candidate when the first error value becomes minimum . US20060198444A1 CLAIM 8 . The moving picture processor of claim 7 , wherein the second detector comprises : a first adjacent block memory configured to store data of the first adjacent block ; a first adjacent reference block memory configured to store data of the first adjacent reference block ; a second operator configured to execute a matching operation between the first adjacent block and the first adjacent reference block , and to generate a second motion vector and a second error value of the matching operation ; a second motion vector register configured to store the second motion vector ; a first adder configured to add the first error value to the second error value , and to obtain a first sum ; a second minimum (first maximum region size, root region) register configured to store the first sum ; and a second minimum determination circuit configured to read the second motion vector out of the second motion vector register as the second motion vector candidate when the first sum becomes minimum .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size (second minimum, first minimum) ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region (second minimum, first minimum) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20060198444A1 CLAIM 7 . The moving picture processor of claim 2 , wherein the first detector comprises : a target block memory configured to store data of the target block ; a reference block memory configured to store data of the reference block ; a first operator configured to execute an matching operation between the target block and the reference block , and to generate a first motion vector and a first error value of the matching operation ; a first motion vector register configured to store the first motion vector ; a first minimum (first maximum region size, root region) register configured to store the first error value ; and a first minimum determination circuit configured to read the first motion vector out of the first motion vector register as the first motion vector candidate when the first error value becomes minimum . US20060198444A1 CLAIM 8 . The moving picture processor of claim 7 , wherein the second detector comprises : a first adjacent block memory configured to store data of the first adjacent block ; a first adjacent reference block memory configured to store data of the first adjacent reference block ; a second operator configured to execute a matching operation between the first adjacent block and the first adjacent reference block , and to generate a second motion vector and a second error value of the matching operation ; a second motion vector register configured to store the second motion vector ; a first adder configured to add the first error value to the second error value , and to obtain a first sum ; a second minimum (first maximum region size, root region) register configured to store the first sum ; and a second minimum determination circuit configured to read the second motion vector out of the second motion vector register as the second motion vector candidate when the first sum becomes minimum .
US10250913B2 CLAIM 15 . A non-transitory computer readable digital storage medium having stored thereon a computer program (computer program) having a program code for performing , when running on a computer , a method according to claim 12 .	US20060198444A1 CLAIM 17 . A computer program (computer program) product for executing an application for a moving picture processor , the computer program product comprising : instructions configured to detect a reference block most similar to a target block for which motion is to be detected and which is set in a current picture , the reference block is set in a reference picture different from the current picture in terms of time ; instructions configured to generate a first motion vector candidate indicating a relative position between the target block and the reference block ; instructions configured to detect a first reference area most similar to a first target area obtained by combining the target block and a first adjacent block adjacent to the target block , the first reference area is set in the reference picture ; instructions configured to generate a second motion vector candidate indicating a relative position between the first target area and the first reference area ; and instructions configured to determine a motion vector for the target block , based on the first and second motion vector candidates .
US10250913B2 CLAIM 16 . A non-transitory computer readable digital storage medium having stored thereon a computer program (computer program) having a program code for performing , when running on a computer , a method according to claim 14 .	US20060198444A1 CLAIM 17 . A computer program (computer program) product for executing an application for a moving picture processor , the computer program product comprising : instructions configured to detect a reference block most similar to a target block for which motion is to be detected and which is set in a current picture , the reference block is set in a reference picture different from the current picture in terms of time ; instructions configured to generate a first motion vector candidate indicating a relative position between the target block and the reference block ; instructions configured to detect a first reference area most similar to a first target area obtained by combining the target block and a first adjacent block adjacent to the target block , the first reference area is set in the reference picture ; instructions configured to generate a second motion vector candidate indicating a relative position between the first target area and the first reference area ; and instructions configured to determine a motion vector for the target block , based on the first and second motion vector candidates .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	CN101213840A Filed: 2006-02-14 Issued: 2008-07-02 从低分辨率图像导出高分辨率图像的编码信息的方法以及实现该方法的编码和解码设备 (Original Assignee) 汤姆森许可贸易公司热罗姆·维耶龙, 爱德华·弗朗索瓦, 尼古拉斯·比尔丹, 纪尧姆·布瓦松, 帕特里克·洛佩兹, 格温艾利·马康
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream (数据流中) representing encoded video information (视频信号) , information related to first and second maximum region sizes , first and second subdivision (第二编) information , and a maximum hierarchy level (水平方向) (水平方向) wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN101213840A CLAIM 1、一种用于从低分辨率图像的至少一个图像部分的编码信息导出高分辨率图像的至少一个图像部分的编码信息的方法，每个图像被划分为非交迭宏块，所述方法的特征在于：所述编码信息至少包括分区信息，被称为底层宏块的所述至少一个低分辨率图像部分的至少一个宏块，与被称为高层宏块的所述至少一个高分辨率图像部分的每个宏块相关联，从而当将所述至少一个高分辨率图像部分叠加在沿水平方向 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) 以第一预定义比率和沿垂直方向以第二预定义比率上采样的所述至少一个低分辨率图像部分上时，所述相关联的低分辨率宏块至少部分地与所述高分辨率宏块交迭，所述方法包括以下步骤： -根据所述高层宏块相对于与所述高层宏块相关联的、被称为对应底层宏块的底层宏块的位置，计算(110)所述至少一个高分辨率图像部分中每个高层宏块的几何参数； -根据所述几何参数，导出(120)所述至少一个高分辨图像部分中每个高层宏块的宏块类别；以及 -根据所述几何参数和所述高层宏块类别，从对应底层宏块的分区信息中导出(210)所述至少一个高分辨图像部分的每个高层宏块的分区信息。 CN101213840A CLAIM 11、如权利要求l-10之一所述的方法，其中，所述方法是用于编码视频信号 (video information) 的处理的一部分。 CN101213840A CLAIM 13、一种用于编码至少髙分辨率图像序列和低分辨率图像序列的设备（8)，每个图像被划分为宏块，所述设备包括：-第一编码装置（80)，用于编码低分辨率图像，该第一编码装置生成所述低分辨率图像的编码信息和底层数据流；-继承装置（82)，用于从低分辨率图像的至少一个图像部分的编码信息中导出高分辨率图像的至少一个图像部分的编码信息；和-第二编 (second subdivision) 码装置（81)，用于使用导出的编码信息来编码所述高分辨率图像，所述第二编码装置生成增强层数据流；其特征在于，所述编码信息至少包括分区信息，继承装置（82) 包括：-关联装置，用于将被称为底层宏块的所述至少一个低分辨率图像部分的至少一个宏块，与被称为高层宏块的所述至少一个高分辨率图像部分的每个宏块相关联，从而当将所述至少一个高分辨率图像部分叠加在沿水平方向以第一预定义比率和沿垂直方向以第二预定义比率上采样的所述至少一个低分辨率图像部分上时，所述相关联的低分辨率宏块至少部分地与所述高分辨率宏块交迭；-计算装置，用于根据所述高层宏块相对于与所述高层宏块相关联的、被称为对应底层宏块的底层宏块的位置，计算所述至少一个高分辨率图像部分中每个高层宏块的几何参数；-第一导出装置，用于根据所述几何参数，导出所述至少一个高分辨图像部分中每个高层宏块的宏块类别；-第二导出装置，用于根据所述几何参数和所述高层宏块类别，从对应底层宏块的分区信息中导出所述至少一个高分辨图像部分的每个高层宏块的分区信息。 CN101213840A CLAIM 16、一种用于解码由权利要求13至15之一所述的设备编码的至少高分辨率图像序列和低分辨率图像序列的设备（9)，由数据流表示这些编码的图像，所述解码设备包括：-第一解码装置（91)，用于解码所述解码数据流中 (data stream) 的至少第一部分，以生成低分辨率图像和所述低分辨率图像的编码信息；-继承装置（82)，用于从低分辨率图像的至少一个图像部分的编码信息中导出高分辨率图像的至少一个图像部分的编码信息；和-第二解码装置（92)，用于使用所述导出的编码信息来解码所述数据流的至少第二部分，以生成高分辨率图像；其特征在于，所述编码信息至少包括分区信息，继承装置（82) 包括：-关联装置，用于将被称为底层宏块的所述至少一个低分辨率图像部分的至少一个宏块，与被称为高层宏块的所述至少一个高分辨率图像部分的每个宏块相关联，从而当将所述至少一个高分辨率图像部分叠加在沿水平方向以第一预定义比率和沿垂直方向以第二预定义比率上采样的所述至少一个低分辨率图像部分上时，所述相关联的低分辨率宏块至少部分地与所述高分辨率宏块交迭；-计算装置，用于根据所述高层宏块相对于与所述高层宏块相关联的、被称为对应底层宏块的底层宏块的位置，计算所述至少一个高分辨率图像部分中每个高层宏块的几何参数；-第一导出装置，用于根据所述几何参数，导出所述至少一个高分辨图像部分中每个高层宏块的宏块类别；-第二导出装置，用于根据所述几何参数和所述高层宏块类别，从对应底层宏块的分区信息中导出所述至少一个高分辨图像部分的每个高层宏块的分区信息。
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level (水平方向) (水平方向) according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level (水平方向) is reached .	CN101213840A CLAIM 1、一种用于从低分辨率图像的至少一个图像部分的编码信息导出高分辨率图像的至少一个图像部分的编码信息的方法，每个图像被划分为非交迭宏块，所述方法的特征在于：所述编码信息至少包括分区信息，被称为底层宏块的所述至少一个低分辨率图像部分的至少一个宏块，与被称为高层宏块的所述至少一个高分辨率图像部分的每个宏块相关联，从而当将所述至少一个高分辨率图像部分叠加在沿水平方向 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) 以第一预定义比率和沿垂直方向以第二预定义比率上采样的所述至少一个低分辨率图像部分上时，所述相关联的低分辨率宏块至少部分地与所述高分辨率宏块交迭，所述方法包括以下步骤： -根据所述高层宏块相对于与所述高层宏块相关联的、被称为对应底层宏块的底层宏块的位置，计算(110)所述至少一个高分辨率图像部分中每个高层宏块的几何参数； -根据所述几何参数，导出(120)所述至少一个高分辨图像部分中每个高层宏块的宏块类别；以及 -根据所述几何参数和所述高层宏块类别，从对应底层宏块的分区信息中导出(210)所述至少一个高分辨图像部分的每个高层宏块的分区信息。
US10250913B2 CLAIM 5 . The decoder according to claim 4 , wherein the divider is configured to , in accordance with the partition rules associated with the first and higher-order hierarchy levels , sub-divide into sub-regions of equal size , such that there are an equal number of sub-regions at each hierarchy level (水平方向) .	CN101213840A CLAIM 1、一种用于从低分辨率图像的至少一个图像部分的编码信息导出高分辨率图像的至少一个图像部分的编码信息的方法，每个图像被划分为非交迭宏块，所述方法的特征在于：所述编码信息至少包括分区信息，被称为底层宏块的所述至少一个低分辨率图像部分的至少一个宏块，与被称为高层宏块的所述至少一个高分辨率图像部分的每个宏块相关联，从而当将所述至少一个高分辨率图像部分叠加在沿水平方向 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) 以第一预定义比率和沿垂直方向以第二预定义比率上采样的所述至少一个低分辨率图像部分上时，所述相关联的低分辨率宏块至少部分地与所述高分辨率宏块交迭，所述方法包括以下步骤： -根据所述高层宏块相对于与所述高层宏块相关联的、被称为对应底层宏块的底层宏块的位置，计算(110)所述至少一个高分辨率图像部分中每个高层宏块的几何参数； -根据所述几何参数，导出(120)所述至少一个高分辨图像部分中每个高层宏块的宏块类别；以及 -根据所述几何参数和所述高层宏块类别，从对应底层宏块的分区信息中导出(210)所述至少一个高分辨图像部分的每个高层宏块的分区信息。
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision information includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level (水平方向) is sub-divided .	CN101213840A CLAIM 1、一种用于从低分辨率图像的至少一个图像部分的编码信息导出高分辨率图像的至少一个图像部分的编码信息的方法，每个图像被划分为非交迭宏块，所述方法的特征在于：所述编码信息至少包括分区信息，被称为底层宏块的所述至少一个低分辨率图像部分的至少一个宏块，与被称为高层宏块的所述至少一个高分辨率图像部分的每个宏块相关联，从而当将所述至少一个高分辨率图像部分叠加在沿水平方向 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) 以第一预定义比率和沿垂直方向以第二预定义比率上采样的所述至少一个低分辨率图像部分上时，所述相关联的低分辨率宏块至少部分地与所述高分辨率宏块交迭，所述方法包括以下步骤： -根据所述高层宏块相对于与所述高层宏块相关联的、被称为对应底层宏块的底层宏块的位置，计算(110)所述至少一个高分辨率图像部分中每个高层宏块的几何参数； -根据所述几何参数，导出(120)所述至少一个高分辨图像部分中每个高层宏块的宏块类别；以及 -根据所述几何参数和所述高层宏块类别，从对应底层宏块的分区信息中导出(210)所述至少一个高分辨图像部分的每个高层宏块的分区信息。
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level (水平方向) (水平方向) from the data stream (数据流中) .	CN101213840A CLAIM 1、一种用于从低分辨率图像的至少一个图像部分的编码信息导出高分辨率图像的至少一个图像部分的编码信息的方法，每个图像被划分为非交迭宏块，所述方法的特征在于：所述编码信息至少包括分区信息，被称为底层宏块的所述至少一个低分辨率图像部分的至少一个宏块，与被称为高层宏块的所述至少一个高分辨率图像部分的每个宏块相关联，从而当将所述至少一个高分辨率图像部分叠加在沿水平方向 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) 以第一预定义比率和沿垂直方向以第二预定义比率上采样的所述至少一个低分辨率图像部分上时，所述相关联的低分辨率宏块至少部分地与所述高分辨率宏块交迭，所述方法包括以下步骤： -根据所述高层宏块相对于与所述高层宏块相关联的、被称为对应底层宏块的底层宏块的位置，计算(110)所述至少一个高分辨率图像部分中每个高层宏块的几何参数； -根据所述几何参数，导出(120)所述至少一个高分辨图像部分中每个高层宏块的宏块类别；以及 -根据所述几何参数和所述高层宏块类别，从对应底层宏块的分区信息中导出(210)所述至少一个高分辨图像部分的每个高层宏块的分区信息。 CN101213840A CLAIM 16、一种用于解码由权利要求13至15之一所述的设备编码的至少高分辨率图像序列和低分辨率图像序列的设备（9)，由数据流表示这些编码的图像，所述解码设备包括：-第一解码装置（91)，用于解码所述解码数据流中 (data stream) 的至少第一部分，以生成低分辨率图像和所述低分辨率图像的编码信息；-继承装置（82)，用于从低分辨率图像的至少一个图像部分的编码信息中导出高分辨率图像的至少一个图像部分的编码信息；和-第二解码装置（92)，用于使用所述导出的编码信息来解码所述数据流的至少第二部分，以生成高分辨率图像；其特征在于，所述编码信息至少包括分区信息，继承装置（82) 包括：-关联装置，用于将被称为底层宏块的所述至少一个低分辨率图像部分的至少一个宏块，与被称为高层宏块的所述至少一个高分辨率图像部分的每个宏块相关联，从而当将所述至少一个高分辨率图像部分叠加在沿水平方向以第一预定义比率和沿垂直方向以第二预定义比率上采样的所述至少一个低分辨率图像部分上时，所述相关联的低分辨率宏块至少部分地与所述高分辨率宏块交迭；-计算装置，用于根据所述高层宏块相对于与所述高层宏块相关联的、被称为对应底层宏块的底层宏块的位置，计算所述至少一个高分辨率图像部分中每个高层宏块的几何参数；-第一导出装置，用于根据所述几何参数，导出所述至少一个高分辨图像部分中每个高层宏块的宏块类别；-第二导出装置，用于根据所述几何参数和所述高层宏块类别，从对应底层宏块的分区信息中导出所述至少一个高分辨图像部分的每个高层宏块的分区信息。
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements associated with the first or second set of sub-regions from the data stream (数据流中) in a depth-first traversal order .	CN101213840A CLAIM 16、一种用于解码由权利要求13至15之一所述的设备编码的至少高分辨率图像序列和低分辨率图像序列的设备（9)，由数据流表示这些编码的图像，所述解码设备包括：-第一解码装置（91)，用于解码所述解码数据流中 (data stream) 的至少第一部分，以生成低分辨率图像和所述低分辨率图像的编码信息；-继承装置（82)，用于从低分辨率图像的至少一个图像部分的编码信息中导出高分辨率图像的至少一个图像部分的编码信息；和-第二解码装置（92)，用于使用所述导出的编码信息来解码所述数据流的至少第二部分，以生成高分辨率图像；其特征在于，所述编码信息至少包括分区信息，继承装置（82) 包括：-关联装置，用于将被称为底层宏块的所述至少一个低分辨率图像部分的至少一个宏块，与被称为高层宏块的所述至少一个高分辨率图像部分的每个宏块相关联，从而当将所述至少一个高分辨率图像部分叠加在沿水平方向以第一预定义比率和沿垂直方向以第二预定义比率上采样的所述至少一个低分辨率图像部分上时，所述相关联的低分辨率宏块至少部分地与所述高分辨率宏块交迭；-计算装置，用于根据所述高层宏块相对于与所述高层宏块相关联的、被称为对应底层宏块的底层宏块的位置，计算所述至少一个高分辨率图像部分中每个高层宏块的几何参数；-第一导出装置，用于根据所述几何参数，导出所述至少一个高分辨图像部分中每个高层宏块的宏块类别；-第二导出装置，用于根据所述几何参数和所述高层宏块类别，从对应底层宏块的分区信息中导出所述至少一个高分辨图像部分的每个高层宏块的分区信息。
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream (数据流中) , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	CN101213840A CLAIM 16、一种用于解码由权利要求13至15之一所述的设备编码的至少高分辨率图像序列和低分辨率图像序列的设备（9)，由数据流表示这些编码的图像，所述解码设备包括：-第一解码装置（91)，用于解码所述解码数据流中 (data stream) 的至少第一部分，以生成低分辨率图像和所述低分辨率图像的编码信息；-继承装置（82)，用于从低分辨率图像的至少一个图像部分的编码信息中导出高分辨率图像的至少一个图像部分的编码信息；和-第二解码装置（92)，用于使用所述导出的编码信息来解码所述数据流的至少第二部分，以生成高分辨率图像；其特征在于，所述编码信息至少包括分区信息，继承装置（82) 包括：-关联装置，用于将被称为底层宏块的所述至少一个低分辨率图像部分的至少一个宏块，与被称为高层宏块的所述至少一个高分辨率图像部分的每个宏块相关联，从而当将所述至少一个高分辨率图像部分叠加在沿水平方向以第一预定义比率和沿垂直方向以第二预定义比率上采样的所述至少一个低分辨率图像部分上时，所述相关联的低分辨率宏块至少部分地与所述高分辨率宏块交迭；-计算装置，用于根据所述高层宏块相对于与所述高层宏块相关联的、被称为对应底层宏块的底层宏块的位置，计算所述至少一个高分辨率图像部分中每个高层宏块的几何参数；-第一导出装置，用于根据所述几何参数，导出所述至少一个高分辨图像部分中每个高层宏块的宏块类别；-第二导出装置，用于根据所述几何参数和所述高层宏块类别，从对应底层宏块的分区信息中导出所述至少一个高分辨图像部分的每个高层宏块的分区信息。
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream (数据流中) , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	CN101213840A CLAIM 16、一种用于解码由权利要求13至15之一所述的设备编码的至少高分辨率图像序列和低分辨率图像序列的设备（9)，由数据流表示这些编码的图像，所述解码设备包括：-第一解码装置（91)，用于解码所述解码数据流中 (data stream) 的至少第一部分，以生成低分辨率图像和所述低分辨率图像的编码信息；-继承装置（82)，用于从低分辨率图像的至少一个图像部分的编码信息中导出高分辨率图像的至少一个图像部分的编码信息；和-第二解码装置（92)，用于使用所述导出的编码信息来解码所述数据流的至少第二部分，以生成高分辨率图像；其特征在于，所述编码信息至少包括分区信息，继承装置（82) 包括：-关联装置，用于将被称为底层宏块的所述至少一个低分辨率图像部分的至少一个宏块，与被称为高层宏块的所述至少一个高分辨率图像部分的每个宏块相关联，从而当将所述至少一个高分辨率图像部分叠加在沿水平方向以第一预定义比率和沿垂直方向以第二预定义比率上采样的所述至少一个低分辨率图像部分上时，所述相关联的低分辨率宏块至少部分地与所述高分辨率宏块交迭；-计算装置，用于根据所述高层宏块相对于与所述高层宏块相关联的、被称为对应底层宏块的底层宏块的位置，计算所述至少一个高分辨率图像部分中每个高层宏块的几何参数；-第一导出装置，用于根据所述几何参数，导出所述至少一个高分辨图像部分中每个高层宏块的宏块类别；-第二导出装置，用于根据所述几何参数和所述高层宏块类别，从对应底层宏块的分区信息中导出所述至少一个高分辨图像部分的每个高层宏块的分区信息。
US10250913B2 CLAIM 11 . The decoder according to claim 1 , wherein the recursive multi-tree partitioning includes a quadtree partitioning (块尺寸) technique .	CN101213840A CLAIM 10、如权利要求3-9之一所述的方法，其中，宏块尺寸 (quadtree partitioning) 为16xl6像素，块尺寸为8x8像素，所述第一预定义比率等于所述第二预定义比率。
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream (数据流中) representing encoded video information (视频信号) , information related to first and second maximum region sizes , first and second subdivision (第二编) information , and a maximum hierarchy level (水平方向) (水平方向) , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN101213840A CLAIM 1、一种用于从低分辨率图像的至少一个图像部分的编码信息导出高分辨率图像的至少一个图像部分的编码信息的方法，每个图像被划分为非交迭宏块，所述方法的特征在于：所述编码信息至少包括分区信息，被称为底层宏块的所述至少一个低分辨率图像部分的至少一个宏块，与被称为高层宏块的所述至少一个高分辨率图像部分的每个宏块相关联，从而当将所述至少一个高分辨率图像部分叠加在沿水平方向 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) 以第一预定义比率和沿垂直方向以第二预定义比率上采样的所述至少一个低分辨率图像部分上时，所述相关联的低分辨率宏块至少部分地与所述高分辨率宏块交迭，所述方法包括以下步骤： -根据所述高层宏块相对于与所述高层宏块相关联的、被称为对应底层宏块的底层宏块的位置，计算(110)所述至少一个高分辨率图像部分中每个高层宏块的几何参数； -根据所述几何参数，导出(120)所述至少一个高分辨图像部分中每个高层宏块的宏块类别；以及 -根据所述几何参数和所述高层宏块类别，从对应底层宏块的分区信息中导出(210)所述至少一个高分辨图像部分的每个高层宏块的分区信息。 CN101213840A CLAIM 11、如权利要求l-10之一所述的方法，其中，所述方法是用于编码视频信号 (video information) 的处理的一部分。 CN101213840A CLAIM 13、一种用于编码至少髙分辨率图像序列和低分辨率图像序列的设备（8)，每个图像被划分为宏块，所述设备包括：-第一编码装置（80)，用于编码低分辨率图像，该第一编码装置生成所述低分辨率图像的编码信息和底层数据流；-继承装置（82)，用于从低分辨率图像的至少一个图像部分的编码信息中导出高分辨率图像的至少一个图像部分的编码信息；和-第二编 (second subdivision) 码装置（81)，用于使用导出的编码信息来编码所述高分辨率图像，所述第二编码装置生成增强层数据流；其特征在于，所述编码信息至少包括分区信息，继承装置（82) 包括：-关联装置，用于将被称为底层宏块的所述至少一个低分辨率图像部分的至少一个宏块，与被称为高层宏块的所述至少一个高分辨率图像部分的每个宏块相关联，从而当将所述至少一个高分辨率图像部分叠加在沿水平方向以第一预定义比率和沿垂直方向以第二预定义比率上采样的所述至少一个低分辨率图像部分上时，所述相关联的低分辨率宏块至少部分地与所述高分辨率宏块交迭；-计算装置，用于根据所述高层宏块相对于与所述高层宏块相关联的、被称为对应底层宏块的底层宏块的位置，计算所述至少一个高分辨率图像部分中每个高层宏块的几何参数；-第一导出装置，用于根据所述几何参数，导出所述至少一个高分辨图像部分中每个高层宏块的宏块类别；-第二导出装置，用于根据所述几何参数和所述高层宏块类别，从对应底层宏块的分区信息中导出所述至少一个高分辨图像部分的每个高层宏块的分区信息。 CN101213840A CLAIM 16、一种用于解码由权利要求13至15之一所述的设备编码的至少高分辨率图像序列和低分辨率图像序列的设备（9)，由数据流表示这些编码的图像，所述解码设备包括：-第一解码装置（91)，用于解码所述解码数据流中 (data stream) 的至少第一部分，以生成低分辨率图像和所述低分辨率图像的编码信息；-继承装置（82)，用于从低分辨率图像的至少一个图像部分的编码信息中导出高分辨率图像的至少一个图像部分的编码信息；和-第二解码装置（92)，用于使用所述导出的编码信息来解码所述数据流的至少第二部分，以生成高分辨率图像；其特征在于，所述编码信息至少包括分区信息，继承装置（82) 包括：-关联装置，用于将被称为底层宏块的所述至少一个低分辨率图像部分的至少一个宏块，与被称为高层宏块的所述至少一个高分辨率图像部分的每个宏块相关联，从而当将所述至少一个高分辨率图像部分叠加在沿水平方向以第一预定义比率和沿垂直方向以第二预定义比率上采样的所述至少一个低分辨率图像部分上时，所述相关联的低分辨率宏块至少部分地与所述高分辨率宏块交迭；-计算装置，用于根据所述高层宏块相对于与所述高层宏块相关联的、被称为对应底层宏块的底层宏块的位置，计算所述至少一个高分辨率图像部分中每个高层宏块的几何参数；-第一导出装置，用于根据所述几何参数，导出所述至少一个高分辨图像部分中每个高层宏块的宏块类别；-第二导出装置，用于根据所述几何参数和所述高层宏块类别，从对应底层宏块的分区信息中导出所述至少一个高分辨图像部分的每个高层宏块的分区信息。
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information (视频信号) into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (第二编) information and a maximum hierarchy level (水平方向) (水平方向) ; and a data stream (数据流中) generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN101213840A CLAIM 1、一种用于从低分辨率图像的至少一个图像部分的编码信息导出高分辨率图像的至少一个图像部分的编码信息的方法，每个图像被划分为非交迭宏块，所述方法的特征在于：所述编码信息至少包括分区信息，被称为底层宏块的所述至少一个低分辨率图像部分的至少一个宏块，与被称为高层宏块的所述至少一个高分辨率图像部分的每个宏块相关联，从而当将所述至少一个高分辨率图像部分叠加在沿水平方向 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) 以第一预定义比率和沿垂直方向以第二预定义比率上采样的所述至少一个低分辨率图像部分上时，所述相关联的低分辨率宏块至少部分地与所述高分辨率宏块交迭，所述方法包括以下步骤： -根据所述高层宏块相对于与所述高层宏块相关联的、被称为对应底层宏块的底层宏块的位置，计算(110)所述至少一个高分辨率图像部分中每个高层宏块的几何参数； -根据所述几何参数，导出(120)所述至少一个高分辨图像部分中每个高层宏块的宏块类别；以及 -根据所述几何参数和所述高层宏块类别，从对应底层宏块的分区信息中导出(210)所述至少一个高分辨图像部分的每个高层宏块的分区信息。 CN101213840A CLAIM 11、如权利要求l-10之一所述的方法，其中，所述方法是用于编码视频信号 (video information) 的处理的一部分。 CN101213840A CLAIM 13、一种用于编码至少髙分辨率图像序列和低分辨率图像序列的设备（8)，每个图像被划分为宏块，所述设备包括：-第一编码装置（80)，用于编码低分辨率图像，该第一编码装置生成所述低分辨率图像的编码信息和底层数据流；-继承装置（82)，用于从低分辨率图像的至少一个图像部分的编码信息中导出高分辨率图像的至少一个图像部分的编码信息；和-第二编 (second subdivision) 码装置（81)，用于使用导出的编码信息来编码所述高分辨率图像，所述第二编码装置生成增强层数据流；其特征在于，所述编码信息至少包括分区信息，继承装置（82) 包括：-关联装置，用于将被称为底层宏块的所述至少一个低分辨率图像部分的至少一个宏块，与被称为高层宏块的所述至少一个高分辨率图像部分的每个宏块相关联，从而当将所述至少一个高分辨率图像部分叠加在沿水平方向以第一预定义比率和沿垂直方向以第二预定义比率上采样的所述至少一个低分辨率图像部分上时，所述相关联的低分辨率宏块至少部分地与所述高分辨率宏块交迭；-计算装置，用于根据所述高层宏块相对于与所述高层宏块相关联的、被称为对应底层宏块的底层宏块的位置，计算所述至少一个高分辨率图像部分中每个高层宏块的几何参数；-第一导出装置，用于根据所述几何参数，导出所述至少一个高分辨图像部分中每个高层宏块的宏块类别；-第二导出装置，用于根据所述几何参数和所述高层宏块类别，从对应底层宏块的分区信息中导出所述至少一个高分辨图像部分的每个高层宏块的分区信息。 CN101213840A CLAIM 16、一种用于解码由权利要求13至15之一所述的设备编码的至少高分辨率图像序列和低分辨率图像序列的设备（9)，由数据流表示这些编码的图像，所述解码设备包括：-第一解码装置（91)，用于解码所述解码数据流中 (data stream) 的至少第一部分，以生成低分辨率图像和所述低分辨率图像的编码信息；-继承装置（82)，用于从低分辨率图像的至少一个图像部分的编码信息中导出高分辨率图像的至少一个图像部分的编码信息；和-第二解码装置（92)，用于使用所述导出的编码信息来解码所述数据流的至少第二部分，以生成高分辨率图像；其特征在于，所述编码信息至少包括分区信息，继承装置（82) 包括：-关联装置，用于将被称为底层宏块的所述至少一个低分辨率图像部分的至少一个宏块，与被称为高层宏块的所述至少一个高分辨率图像部分的每个宏块相关联，从而当将所述至少一个高分辨率图像部分叠加在沿水平方向以第一预定义比率和沿垂直方向以第二预定义比率上采样的所述至少一个低分辨率图像部分上时，所述相关联的低分辨率宏块至少部分地与所述高分辨率宏块交迭；-计算装置，用于根据所述高层宏块相对于与所述高层宏块相关联的、被称为对应底层宏块的底层宏块的位置，计算所述至少一个高分辨率图像部分中每个高层宏块的几何参数；-第一导出装置，用于根据所述几何参数，导出所述至少一个高分辨图像部分中每个高层宏块的宏块类别；-第二导出装置，用于根据所述几何参数和所述高层宏块类别，从对应底层宏块的分区信息中导出所述至少一个高分辨图像部分的每个高层宏块的分区信息。
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information (视频信号) into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (第二编) information and a maximum hierarchy level (水平方向) (水平方向) ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream (数据流中) the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN101213840A CLAIM 1、一种用于从低分辨率图像的至少一个图像部分的编码信息导出高分辨率图像的至少一个图像部分的编码信息的方法，每个图像被划分为非交迭宏块，所述方法的特征在于：所述编码信息至少包括分区信息，被称为底层宏块的所述至少一个低分辨率图像部分的至少一个宏块，与被称为高层宏块的所述至少一个高分辨率图像部分的每个宏块相关联，从而当将所述至少一个高分辨率图像部分叠加在沿水平方向 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) 以第一预定义比率和沿垂直方向以第二预定义比率上采样的所述至少一个低分辨率图像部分上时，所述相关联的低分辨率宏块至少部分地与所述高分辨率宏块交迭，所述方法包括以下步骤： -根据所述高层宏块相对于与所述高层宏块相关联的、被称为对应底层宏块的底层宏块的位置，计算(110)所述至少一个高分辨率图像部分中每个高层宏块的几何参数； -根据所述几何参数，导出(120)所述至少一个高分辨图像部分中每个高层宏块的宏块类别；以及 -根据所述几何参数和所述高层宏块类别，从对应底层宏块的分区信息中导出(210)所述至少一个高分辨图像部分的每个高层宏块的分区信息。 CN101213840A CLAIM 11、如权利要求l-10之一所述的方法，其中，所述方法是用于编码视频信号 (video information) 的处理的一部分。 CN101213840A CLAIM 13、一种用于编码至少髙分辨率图像序列和低分辨率图像序列的设备（8)，每个图像被划分为宏块，所述设备包括：-第一编码装置（80)，用于编码低分辨率图像，该第一编码装置生成所述低分辨率图像的编码信息和底层数据流；-继承装置（82)，用于从低分辨率图像的至少一个图像部分的编码信息中导出高分辨率图像的至少一个图像部分的编码信息；和-第二编 (second subdivision) 码装置（81)，用于使用导出的编码信息来编码所述高分辨率图像，所述第二编码装置生成增强层数据流；其特征在于，所述编码信息至少包括分区信息，继承装置（82) 包括：-关联装置，用于将被称为底层宏块的所述至少一个低分辨率图像部分的至少一个宏块，与被称为高层宏块的所述至少一个高分辨率图像部分的每个宏块相关联，从而当将所述至少一个高分辨率图像部分叠加在沿水平方向以第一预定义比率和沿垂直方向以第二预定义比率上采样的所述至少一个低分辨率图像部分上时，所述相关联的低分辨率宏块至少部分地与所述高分辨率宏块交迭；-计算装置，用于根据所述高层宏块相对于与所述高层宏块相关联的、被称为对应底层宏块的底层宏块的位置，计算所述至少一个高分辨率图像部分中每个高层宏块的几何参数；-第一导出装置，用于根据所述几何参数，导出所述至少一个高分辨图像部分中每个高层宏块的宏块类别；-第二导出装置，用于根据所述几何参数和所述高层宏块类别，从对应底层宏块的分区信息中导出所述至少一个高分辨图像部分的每个高层宏块的分区信息。 CN101213840A CLAIM 16、一种用于解码由权利要求13至15之一所述的设备编码的至少高分辨率图像序列和低分辨率图像序列的设备（9)，由数据流表示这些编码的图像，所述解码设备包括：-第一解码装置（91)，用于解码所述解码数据流中 (data stream) 的至少第一部分，以生成低分辨率图像和所述低分辨率图像的编码信息；-继承装置（82)，用于从低分辨率图像的至少一个图像部分的编码信息中导出高分辨率图像的至少一个图像部分的编码信息；和-第二解码装置（92)，用于使用所述导出的编码信息来解码所述数据流的至少第二部分，以生成高分辨率图像；其特征在于，所述编码信息至少包括分区信息，继承装置（82) 包括：-关联装置，用于将被称为底层宏块的所述至少一个低分辨率图像部分的至少一个宏块，与被称为高层宏块的所述至少一个高分辨率图像部分的每个宏块相关联，从而当将所述至少一个高分辨率图像部分叠加在沿水平方向以第一预定义比率和沿垂直方向以第二预定义比率上采样的所述至少一个低分辨率图像部分上时，所述相关联的低分辨率宏块至少部分地与所述高分辨率宏块交迭；-计算装置，用于根据所述高层宏块相对于与所述高层宏块相关联的、被称为对应底层宏块的底层宏块的位置，计算所述至少一个高分辨率图像部分中每个高层宏块的几何参数；-第一导出装置，用于根据所述几何参数，导出所述至少一个高分辨图像部分中每个高层宏块的宏块类别；-第二导出装置，用于根据所述几何参数和所述高层宏块类别，从对应底层宏块的分区信息中导出所述至少一个高分辨图像部分的每个高层宏块的分区信息。

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20090028245A1 Filed: 2006-02-14 Issued: 2009-01-29 Method for Deriving Coding Information for High Resolution Pictures from Low Resolution Pictures and Coding and Decoding Devices Implementing Said Method (Original Assignee) THOMAS LICENSING (Current Assignee) THOMAS LICENSING ; Thomson Licensing DTV SAS Jerome Vieron, Edouard Francois, Gwenaelle Marquant, Nicolas Burdin, Patrick Lopez, Guillaume Boisson
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream (data stream) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (video encoder) information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set (following steps) of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding (low resolution image) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20090028245A1 CLAIM 1 . Method as part of a process of coding or decoding video signal for deriving coding information for at least one picture part of a high resolution picture from coding information of at least one picture part of a low resolution picture , each picture being divided into non-overlapping macroblocks , wherein , said coding information comprising at least partitioning information , at least one macroblock of said at least one low resolution picture part , called base layer macroblock , is associated with each macroblock of said at least one high resolution picture part , called high layer macroblock , so that said associated low resolution macroblock overlays at least partly said high resolution macroblock when said at least one low resolution picture part upsampled by a first predefined ratio in the horizontal direction and a second predefined ratio in the vertical direction is superposed with said at least one high resolution picture part and wherein said method (root region) comprises the following steps (second set) : computing geometrical parameters for each high layer macroblock in said at least one high resolution picture part representative of the position of said high layer macroblock relatively to the base layer macroblock(s) associated with said high layer macroblock , called corresponding base layer macroblock(s) ; and deriving partitioning information for each high layer macroblock in said at least one high resolution picture part from the partitioning information of the corresponding base layer macroblock(s) on the basis of said geometrical parameters . US20090028245A1 CLAIM 10 . Method according to any claim 8 , wherein the motion vector components of motion vectors of each macroblock , partition , and sub-partition if any are scaled by the following equations : { d sx = (dx * scaled base  width + base width / 2 * sign  [ d x ]) / base width d sy = (dy * scaled base  height + base height / 2 * sign  [ d y ]) / base height Where : d x and d y represent the coordinates of the derived motion vector ; d sx and d sy represents the coordinates of the scaled motion vector ; sign [x] is equal to 1 when x is positive and −1 when x is negative ; scaled base width and scaled base height are the width and the height of the high resolution image part respectively ; base width and base height are the width and height of the low resolution image (information samples using prediction coding) part respectively . US20090028245A1 CLAIM 12 . Device for coding at least a sequence of high resolution pictures and a sequence of low resolution pictures , each picture being divided in macroblocks comprising : a first coding unit for coding said low resolution pictures , said first coding unit generating coding information for said low resolution pictures and a base layer data stream (data stream) ; an inheritance unit for deriving coding information for at least one picture part of a high resolution picture from coding information of at least one picture part of a low resolution picture ; and a second coding unit for coding said high resolution pictures using said derived coding information , said second coding unit generating an enhancement layer data stream ; wherein , said coding information comprising at least partitioning information , the inheritance unit comprises : a unit for associating at least one macroblock of said at least one low resolution picture part , called base layer macroblock , with each macroblock of said at least one high resolution picture part , called high layer macroblock , so that said associated low resolution macroblock overlays at least partly said high resolution macroblock when said at least one low resolution picture part upsampled by a first predefined ratio in the horizontal direction and a second predefined ratio in the vertical direction is superposed with said at least one high resolution picture part ; a unit for computing geometrical parameters for each high layer macroblock in said at least one high resolution picture part on the basis of the position of said high layer macroblock relatively to the base layer macroblock(s) associated with said high layer macroblock , called corresponding base layer macroblock(s) ; and a unit for deriving partitioning information for each high layer macroblock in said at least one high resolution picture part from the partitioning information of the corresponding base layer macroblock(s) on the basis of said geometrical parameters . US20090028245A1 CLAIM 14 . Device according to claim 12 , wherein said first coding unit is a MPEG-4 AVC video encoder (second subdivision, second subset, second subdivision information) .
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset of the second set (following steps) of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	US20090028245A1 CLAIM 1 . Method as part of a process of coding or decoding video signal for deriving coding information for at least one picture part of a high resolution picture from coding information of at least one picture part of a low resolution picture , each picture being divided into non-overlapping macroblocks , wherein , said coding information comprising at least partitioning information , at least one macroblock of said at least one low resolution picture part , called base layer macroblock , is associated with each macroblock of said at least one high resolution picture part , called high layer macroblock , so that said associated low resolution macroblock overlays at least partly said high resolution macroblock when said at least one low resolution picture part upsampled by a first predefined ratio in the horizontal direction and a second predefined ratio in the vertical direction is superposed with said at least one high resolution picture part and wherein said method comprises the following steps (second set) : computing geometrical parameters for each high layer macroblock in said at least one high resolution picture part representative of the position of said high layer macroblock relatively to the base layer macroblock(s) associated with said high layer macroblock , called corresponding base layer macroblock(s) ; and deriving partitioning information for each high layer macroblock in said at least one high resolution picture part from the partitioning information of the corresponding base layer macroblock(s) on the basis of said geometrical parameters .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set of root regions such that the first set of root regions are rectangular blocks (reference index) of a size determined by the first maximum region size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	US20090028245A1 CLAIM 7 . Method according to claim 6 , wherein said motion information of one macroblock , one partition or one sub-partition comprises at least one motion vector having a first and a second component and at least one reference index (rectangular blocks) associated with said motion vector selected among a first or a second list of reference indices , said indices identifying reference pictures .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region (said method) into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20090028245A1 CLAIM 1 . Method as part of a process of coding or decoding video signal for deriving coding information for at least one picture part of a high resolution picture from coding information of at least one picture part of a low resolution picture , each picture being divided into non-overlapping macroblocks , wherein , said coding information comprising at least partitioning information , at least one macroblock of said at least one low resolution picture part , called base layer macroblock , is associated with each macroblock of said at least one high resolution picture part , called high layer macroblock , so that said associated low resolution macroblock overlays at least partly said high resolution macroblock when said at least one low resolution picture part upsampled by a first predefined ratio in the horizontal direction and a second predefined ratio in the vertical direction is superposed with said at least one high resolution picture part and wherein said method (root region) comprises the following steps : computing geometrical parameters for each high layer macroblock in said at least one high resolution picture part representative of the position of said high layer macroblock relatively to the base layer macroblock(s) associated with said high layer macroblock , called corresponding base layer macroblock(s) ; and deriving partitioning information for each high layer macroblock in said at least one high resolution picture part from the partitioning information of the corresponding base layer macroblock(s) on the basis of said geometrical parameters .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level from the data stream (data stream) .	US20090028245A1 CLAIM 12 . Device for coding at least a sequence of high resolution pictures and a sequence of low resolution pictures , each picture being divided in macroblocks comprising : a first coding unit for coding said low resolution pictures , said first coding unit generating coding information for said low resolution pictures and a base layer data stream (data stream) ; an inheritance unit for deriving coding information for at least one picture part of a high resolution picture from coding information of at least one picture part of a low resolution picture ; and a second coding unit for coding said high resolution pictures using said derived coding information , said second coding unit generating an enhancement layer data stream ; wherein , said coding information comprising at least partitioning information , the inheritance unit comprises : a unit for associating at least one macroblock of said at least one low resolution picture part , called base layer macroblock , with each macroblock of said at least one high resolution picture part , called high layer macroblock , so that said associated low resolution macroblock overlays at least partly said high resolution macroblock when said at least one low resolution picture part upsampled by a first predefined ratio in the horizontal direction and a second predefined ratio in the vertical direction is superposed with said at least one high resolution picture part ; a unit for computing geometrical parameters for each high layer macroblock in said at least one high resolution picture part on the basis of the position of said high layer macroblock relatively to the base layer macroblock(s) associated with said high layer macroblock , called corresponding base layer macroblock(s) ; and a unit for deriving partitioning information for each high layer macroblock in said at least one high resolution picture part from the partitioning information of the corresponding base layer macroblock(s) on the basis of said geometrical parameters .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements associated with the first or second set (following steps) of sub-regions from the data stream (data stream) in a depth-first traversal order .	US20090028245A1 CLAIM 1 . Method as part of a process of coding or decoding video signal for deriving coding information for at least one picture part of a high resolution picture from coding information of at least one picture part of a low resolution picture , each picture being divided into non-overlapping macroblocks , wherein , said coding information comprising at least partitioning information , at least one macroblock of said at least one low resolution picture part , called base layer macroblock , is associated with each macroblock of said at least one high resolution picture part , called high layer macroblock , so that said associated low resolution macroblock overlays at least partly said high resolution macroblock when said at least one low resolution picture part upsampled by a first predefined ratio in the horizontal direction and a second predefined ratio in the vertical direction is superposed with said at least one high resolution picture part and wherein said method comprises the following steps (second set) : computing geometrical parameters for each high layer macroblock in said at least one high resolution picture part representative of the position of said high layer macroblock relatively to the base layer macroblock(s) associated with said high layer macroblock , called corresponding base layer macroblock(s) ; and deriving partitioning information for each high layer macroblock in said at least one high resolution picture part from the partitioning information of the corresponding base layer macroblock(s) on the basis of said geometrical parameters . US20090028245A1 CLAIM 12 . Device for coding at least a sequence of high resolution pictures and a sequence of low resolution pictures , each picture being divided in macroblocks comprising : a first coding unit for coding said low resolution pictures , said first coding unit generating coding information for said low resolution pictures and a base layer data stream (data stream) ; an inheritance unit for deriving coding information for at least one picture part of a high resolution picture from coding information of at least one picture part of a low resolution picture ; and a second coding unit for coding said high resolution pictures using said derived coding information , said second coding unit generating an enhancement layer data stream ; wherein , said coding information comprising at least partitioning information , the inheritance unit comprises : a unit for associating at least one macroblock of said at least one low resolution picture part , called base layer macroblock , with each macroblock of said at least one high resolution picture part , called high layer macroblock , so that said associated low resolution macroblock overlays at least partly said high resolution macroblock when said at least one low resolution picture part upsampled by a first predefined ratio in the horizontal direction and a second predefined ratio in the vertical direction is superposed with said at least one high resolution picture part ; a unit for computing geometrical parameters for each high layer macroblock in said at least one high resolution picture part on the basis of the position of said high layer macroblock relatively to the base layer macroblock(s) associated with said high layer macroblock , called corresponding base layer macroblock(s) ; and a unit for deriving partitioning information for each high layer macroblock in said at least one high resolution picture part from the partitioning information of the corresponding base layer macroblock(s) on the basis of said geometrical parameters .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream (data stream) , disjoint from a second subset (video encoder) of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20090028245A1 CLAIM 12 . Device for coding at least a sequence of high resolution pictures and a sequence of low resolution pictures , each picture being divided in macroblocks comprising : a first coding unit for coding said low resolution pictures , said first coding unit generating coding information for said low resolution pictures and a base layer data stream (data stream) ; an inheritance unit for deriving coding information for at least one picture part of a high resolution picture from coding information of at least one picture part of a low resolution picture ; and a second coding unit for coding said high resolution pictures using said derived coding information , said second coding unit generating an enhancement layer data stream ; wherein , said coding information comprising at least partitioning information , the inheritance unit comprises : a unit for associating at least one macroblock of said at least one low resolution picture part , called base layer macroblock , with each macroblock of said at least one high resolution picture part , called high layer macroblock , so that said associated low resolution macroblock overlays at least partly said high resolution macroblock when said at least one low resolution picture part upsampled by a first predefined ratio in the horizontal direction and a second predefined ratio in the vertical direction is superposed with said at least one high resolution picture part ; a unit for computing geometrical parameters for each high layer macroblock in said at least one high resolution picture part on the basis of the position of said high layer macroblock relatively to the base layer macroblock(s) associated with said high layer macroblock , called corresponding base layer macroblock(s) ; and a unit for deriving partitioning information for each high layer macroblock in said at least one high resolution picture part from the partitioning information of the corresponding base layer macroblock(s) on the basis of said geometrical parameters . US20090028245A1 CLAIM 14 . Device according to claim 12 , wherein said first coding unit is a MPEG-4 AVC video encoder (second subdivision, second subset, second subdivision information) .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream (data stream) , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	US20090028245A1 CLAIM 12 . Device for coding at least a sequence of high resolution pictures and a sequence of low resolution pictures , each picture being divided in macroblocks comprising : a first coding unit for coding said low resolution pictures , said first coding unit generating coding information for said low resolution pictures and a base layer data stream (data stream) ; an inheritance unit for deriving coding information for at least one picture part of a high resolution picture from coding information of at least one picture part of a low resolution picture ; and a second coding unit for coding said high resolution pictures using said derived coding information , said second coding unit generating an enhancement layer data stream ; wherein , said coding information comprising at least partitioning information , the inheritance unit comprises : a unit for associating at least one macroblock of said at least one low resolution picture part , called base layer macroblock , with each macroblock of said at least one high resolution picture part , called high layer macroblock , so that said associated low resolution macroblock overlays at least partly said high resolution macroblock when said at least one low resolution picture part upsampled by a first predefined ratio in the horizontal direction and a second predefined ratio in the vertical direction is superposed with said at least one high resolution picture part ; a unit for computing geometrical parameters for each high layer macroblock in said at least one high resolution picture part on the basis of the position of said high layer macroblock relatively to the base layer macroblock(s) associated with said high layer macroblock , called corresponding base layer macroblock(s) ; and a unit for deriving partitioning information for each high layer macroblock in said at least one high resolution picture part from the partitioning information of the corresponding base layer macroblock(s) on the basis of said geometrical parameters .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream (data stream) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (video encoder) information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set (following steps) of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding (low resolution image) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20090028245A1 CLAIM 1 . Method as part of a process of coding or decoding video signal for deriving coding information for at least one picture part of a high resolution picture from coding information of at least one picture part of a low resolution picture , each picture being divided into non-overlapping macroblocks , wherein , said coding information comprising at least partitioning information , at least one macroblock of said at least one low resolution picture part , called base layer macroblock , is associated with each macroblock of said at least one high resolution picture part , called high layer macroblock , so that said associated low resolution macroblock overlays at least partly said high resolution macroblock when said at least one low resolution picture part upsampled by a first predefined ratio in the horizontal direction and a second predefined ratio in the vertical direction is superposed with said at least one high resolution picture part and wherein said method (root region) comprises the following steps (second set) : computing geometrical parameters for each high layer macroblock in said at least one high resolution picture part representative of the position of said high layer macroblock relatively to the base layer macroblock(s) associated with said high layer macroblock , called corresponding base layer macroblock(s) ; and deriving partitioning information for each high layer macroblock in said at least one high resolution picture part from the partitioning information of the corresponding base layer macroblock(s) on the basis of said geometrical parameters . US20090028245A1 CLAIM 10 . Method according to any claim 8 , wherein the motion vector components of motion vectors of each macroblock , partition , and sub-partition if any are scaled by the following equations : { d sx = (dx * scaled base  width + base width / 2 * sign  [ d x ]) / base width d sy = (dy * scaled base  height + base height / 2 * sign  [ d y ]) / base height Where : d x and d y represent the coordinates of the derived motion vector ; d sx and d sy represents the coordinates of the scaled motion vector ; sign [x] is equal to 1 when x is positive and −1 when x is negative ; scaled base width and scaled base height are the width and the height of the high resolution image part respectively ; base width and base height are the width and height of the low resolution image (information samples using prediction coding) part respectively . US20090028245A1 CLAIM 12 . Device for coding at least a sequence of high resolution pictures and a sequence of low resolution pictures , each picture being divided in macroblocks comprising : a first coding unit for coding said low resolution pictures , said first coding unit generating coding information for said low resolution pictures and a base layer data stream (data stream) ; an inheritance unit for deriving coding information for at least one picture part of a high resolution picture from coding information of at least one picture part of a low resolution picture ; and a second coding unit for coding said high resolution pictures using said derived coding information , said second coding unit generating an enhancement layer data stream ; wherein , said coding information comprising at least partitioning information , the inheritance unit comprises : a unit for associating at least one macroblock of said at least one low resolution picture part , called base layer macroblock , with each macroblock of said at least one high resolution picture part , called high layer macroblock , so that said associated low resolution macroblock overlays at least partly said high resolution macroblock when said at least one low resolution picture part upsampled by a first predefined ratio in the horizontal direction and a second predefined ratio in the vertical direction is superposed with said at least one high resolution picture part ; a unit for computing geometrical parameters for each high layer macroblock in said at least one high resolution picture part on the basis of the position of said high layer macroblock relatively to the base layer macroblock(s) associated with said high layer macroblock , called corresponding base layer macroblock(s) ; and a unit for deriving partitioning information for each high layer macroblock in said at least one high resolution picture part from the partitioning information of the corresponding base layer macroblock(s) on the basis of said geometrical parameters . US20090028245A1 CLAIM 14 . Device according to claim 12 , wherein said first coding unit is a MPEG-4 AVC video encoder (second subdivision, second subset, second subdivision information) .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set (following steps) of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (video encoder) information and a maximum hierarchy level ; and a data stream (data stream) generator configured to : encode the array of information samples using prediction coding (low resolution image) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20090028245A1 CLAIM 1 . Method as part of a process of coding or decoding video signal for deriving coding information for at least one picture part of a high resolution picture from coding information of at least one picture part of a low resolution picture , each picture being divided into non-overlapping macroblocks , wherein , said coding information comprising at least partitioning information , at least one macroblock of said at least one low resolution picture part , called base layer macroblock , is associated with each macroblock of said at least one high resolution picture part , called high layer macroblock , so that said associated low resolution macroblock overlays at least partly said high resolution macroblock when said at least one low resolution picture part upsampled by a first predefined ratio in the horizontal direction and a second predefined ratio in the vertical direction is superposed with said at least one high resolution picture part and wherein said method (root region) comprises the following steps (second set) : computing geometrical parameters for each high layer macroblock in said at least one high resolution picture part representative of the position of said high layer macroblock relatively to the base layer macroblock(s) associated with said high layer macroblock , called corresponding base layer macroblock(s) ; and deriving partitioning information for each high layer macroblock in said at least one high resolution picture part from the partitioning information of the corresponding base layer macroblock(s) on the basis of said geometrical parameters . US20090028245A1 CLAIM 10 . Method according to any claim 8 , wherein the motion vector components of motion vectors of each macroblock , partition , and sub-partition if any are scaled by the following equations : { d sx = (dx * scaled base  width + base width / 2 * sign  [ d x ]) / base width d sy = (dy * scaled base  height + base height / 2 * sign  [ d y ]) / base height Where : d x and d y represent the coordinates of the derived motion vector ; d sx and d sy represents the coordinates of the scaled motion vector ; sign [x] is equal to 1 when x is positive and −1 when x is negative ; scaled base width and scaled base height are the width and the height of the high resolution image part respectively ; base width and base height are the width and height of the low resolution image (information samples using prediction coding) part respectively . US20090028245A1 CLAIM 12 . Device for coding at least a sequence of high resolution pictures and a sequence of low resolution pictures , each picture being divided in macroblocks comprising : a first coding unit for coding said low resolution pictures , said first coding unit generating coding information for said low resolution pictures and a base layer data stream (data stream) ; an inheritance unit for deriving coding information for at least one picture part of a high resolution picture from coding information of at least one picture part of a low resolution picture ; and a second coding unit for coding said high resolution pictures using said derived coding information , said second coding unit generating an enhancement layer data stream ; wherein , said coding information comprising at least partitioning information , the inheritance unit comprises : a unit for associating at least one macroblock of said at least one low resolution picture part , called base layer macroblock , with each macroblock of said at least one high resolution picture part , called high layer macroblock , so that said associated low resolution macroblock overlays at least partly said high resolution macroblock when said at least one low resolution picture part upsampled by a first predefined ratio in the horizontal direction and a second predefined ratio in the vertical direction is superposed with said at least one high resolution picture part ; a unit for computing geometrical parameters for each high layer macroblock in said at least one high resolution picture part on the basis of the position of said high layer macroblock relatively to the base layer macroblock(s) associated with said high layer macroblock , called corresponding base layer macroblock(s) ; and a unit for deriving partitioning information for each high layer macroblock in said at least one high resolution picture part from the partitioning information of the corresponding base layer macroblock(s) on the basis of said geometrical parameters . US20090028245A1 CLAIM 14 . Device according to claim 12 , wherein said first coding unit is a MPEG-4 AVC video encoder (second subdivision, second subset, second subdivision information) .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set (following steps) of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (video encoder) information and a maximum hierarchy level ; encoding the array of information samples using prediction coding (low resolution image) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream (data stream) the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20090028245A1 CLAIM 1 . Method as part of a process of coding or decoding video signal for deriving coding information for at least one picture part of a high resolution picture from coding information of at least one picture part of a low resolution picture , each picture being divided into non-overlapping macroblocks , wherein , said coding information comprising at least partitioning information , at least one macroblock of said at least one low resolution picture part , called base layer macroblock , is associated with each macroblock of said at least one high resolution picture part , called high layer macroblock , so that said associated low resolution macroblock overlays at least partly said high resolution macroblock when said at least one low resolution picture part upsampled by a first predefined ratio in the horizontal direction and a second predefined ratio in the vertical direction is superposed with said at least one high resolution picture part and wherein said method (root region) comprises the following steps (second set) : computing geometrical parameters for each high layer macroblock in said at least one high resolution picture part representative of the position of said high layer macroblock relatively to the base layer macroblock(s) associated with said high layer macroblock , called corresponding base layer macroblock(s) ; and deriving partitioning information for each high layer macroblock in said at least one high resolution picture part from the partitioning information of the corresponding base layer macroblock(s) on the basis of said geometrical parameters . US20090028245A1 CLAIM 10 . Method according to any claim 8 , wherein the motion vector components of motion vectors of each macroblock , partition , and sub-partition if any are scaled by the following equations : { d sx = (dx * scaled base  width + base width / 2 * sign  [ d x ]) / base width d sy = (dy * scaled base  height + base height / 2 * sign  [ d y ]) / base height Where : d x and d y represent the coordinates of the derived motion vector ; d sx and d sy represents the coordinates of the scaled motion vector ; sign [x] is equal to 1 when x is positive and −1 when x is negative ; scaled base width and scaled base height are the width and the height of the high resolution image part respectively ; base width and base height are the width and height of the low resolution image (information samples using prediction coding) part respectively . US20090028245A1 CLAIM 12 . Device for coding at least a sequence of high resolution pictures and a sequence of low resolution pictures , each picture being divided in macroblocks comprising : a first coding unit for coding said low resolution pictures , said first coding unit generating coding information for said low resolution pictures and a base layer data stream (data stream) ; an inheritance unit for deriving coding information for at least one picture part of a high resolution picture from coding information of at least one picture part of a low resolution picture ; and a second coding unit for coding said high resolution pictures using said derived coding information , said second coding unit generating an enhancement layer data stream ; wherein , said coding information comprising at least partitioning information , the inheritance unit comprises : a unit for associating at least one macroblock of said at least one low resolution picture part , called base layer macroblock , with each macroblock of said at least one high resolution picture part , called high layer macroblock , so that said associated low resolution macroblock overlays at least partly said high resolution macroblock when said at least one low resolution picture part upsampled by a first predefined ratio in the horizontal direction and a second predefined ratio in the vertical direction is superposed with said at least one high resolution picture part ; a unit for computing geometrical parameters for each high layer macroblock in said at least one high resolution picture part on the basis of the position of said high layer macroblock relatively to the base layer macroblock(s) associated with said high layer macroblock , called corresponding base layer macroblock(s) ; and a unit for deriving partitioning information for each high layer macroblock in said at least one high resolution picture part from the partitioning information of the corresponding base layer macroblock(s) on the basis of said geometrical parameters . US20090028245A1 CLAIM 14 . Device according to claim 12 , wherein said first coding unit is a MPEG-4 AVC video encoder (second subdivision, second subset, second subdivision information) .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20080267291A1 Filed: 2006-02-13 Issued: 2008-10-30 Method for Deriving Coding Information for High Resolution Images from Low Resolution Images and Coding and Decoding Devices Implementing Said Method (Original Assignee) Joseph J Laks Thomson Licensing LLC (Current Assignee) Joseph J Laks Thomson Licensing LLC Jerome Vieron, Edouard Francois, Gwenaelle Marquant, Nicolas Burdin, Patrick Lopez, Guillaume Boisson
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream (data stream) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision (one image) information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set (following steps) of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20080267291A1 CLAIM 15 . Method as part of a process of coding or decoding video signal for deriving coding information for at least one image (first subdivision) part of a high resolution image from coding information of at least one image part of a low resolution image , each image being divided into non-overlapping macroblocks themselves divided into non-overlapping blocks of a first size , wherein , non-overlapping sets of three lines of three macroblocks in said at least one image part of said high resolution image defining hyper-macroblocks and said coding information comprising at least macroblock coding modes and block coding modes , with each macroblock of said at least one high resolution image part , called high resolution macroblock , is associated at least one macroblock of said at least one low resolution image part , called low resolution macroblock , so that said associated low resolution macroblock covers at least partly said high resolution macroblock when said at least one low resolution image part upsampled by a predefined ratio multiple of 1 , 5 in both horizontal and vertical direction is superposed with said at least one high resolution image part and in that said method (root region) comprises the following steps (second set) : deriving a block coding mode for each block of a first size in said at least one high resolution image part , called high resolution block of a first size , from the macroblock coding modes of the low resolution macroblocks associated with the high resolution macroblock to which said high resolution block of a first size belongs , on the basis of the position of said high resolution block of a first size in said high resolution macroblock and on the basis of the position , called macroblock class , of said high resolution macroblock within an hyper-macroblock ; and/or deriving a macroblock coding mode for each high resolution macroblock in said at least one high resolution image part from the macroblock coding modes of the low resolution macroblocks associated with said high resolution macroblock on the basis of the class of said high resolution macroblock . US20080267291A1 CLAIM 25 . Device for coding at least a sequence of high resolution images and a sequence of low resolution images , each image being divided into non-overlapping macroblocks themselves divided into non-overlapping blocks of a first size , comprising : a first coding unit for coding said low resolution images , said first coding unit generating coding information for said low resolution images and a base layer data stream (data stream) ; an inheritance unit for deriving coding information for at least one image part of a high resolution image from coding information of at least one image part of a low resolution image ; and a second coding unit for coding said high resolution images using said derived coding information , said second coding unit generating an enhancement layer data stream ; wherein , non-overlapping sets of three lines of three macroblocks in said at least one image part of said high resolution image defining hyper-macroblocks and said coding information comprising at least macroblock coding modes and block coding modes , the inheriting unit comprises : a unit for associating , with each macroblock of said at least one high resolution image part , called high resolution macroblock , at least one macroblock of said at least one low resolution image part , called low resolution macroblock , so that said associated low resolution macroblock covers at least partly said high resolution macroblock when said at least one low resolution image part upsampled by a predefined ratio multiple of 1 . 5 in both horizontal and vertical direction is superposed with said at least one high resolution image part ; a unit for deriving a block coding mode for each block of a first size in said at least one high resolution image part , called high resolution block of a first size , from the macroblock coding modes of the low resolution macroblocks associated with the high resolution macroblock to which said high resolution block of a first size belongs , on the basis of the position of said high resolution block of a first size in said high resolution macroblock and on the basis of the position , called macroblock class , of said high resolution within an hyper-macroblock macroblock ; and/or a unit for deriving a macroblock coding mode for each high resolution macroblock in said at least one high resolution image part from the macroblock coding modes of the low resolution macroblocks associated with said high resolution macroblock on the basis of the class of said high resolution macroblock .
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset of the second set (following steps) of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	US20080267291A1 CLAIM 15 . Method as part of a process of coding or decoding video signal for deriving coding information for at least one image part of a high resolution image from coding information of at least one image part of a low resolution image , each image being divided into non-overlapping macroblocks themselves divided into non-overlapping blocks of a first size , wherein , non-overlapping sets of three lines of three macroblocks in said at least one image part of said high resolution image defining hyper-macroblocks and said coding information comprising at least macroblock coding modes and block coding modes , with each macroblock of said at least one high resolution image part , called high resolution macroblock , is associated at least one macroblock of said at least one low resolution image part , called low resolution macroblock , so that said associated low resolution macroblock covers at least partly said high resolution macroblock when said at least one low resolution image part upsampled by a predefined ratio multiple of 1 , 5 in both horizontal and vertical direction is superposed with said at least one high resolution image part and in that said method comprises the following steps (second set) : deriving a block coding mode for each block of a first size in said at least one high resolution image part , called high resolution block of a first size , from the macroblock coding modes of the low resolution macroblocks associated with the high resolution macroblock to which said high resolution block of a first size belongs , on the basis of the position of said high resolution block of a first size in said high resolution macroblock and on the basis of the position , called macroblock class , of said high resolution macroblock within an hyper-macroblock ; and/or deriving a macroblock coding mode for each high resolution macroblock in said at least one high resolution image part from the macroblock coding modes of the low resolution macroblocks associated with said high resolution macroblock on the basis of the class of said high resolution macroblock .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set of root regions such that the first set of root regions are rectangular blocks (reference index) of a size determined by the first maximum region size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	US20080267291A1 CLAIM 19 . Method according to claim 17 , wherein said motion information of one block or one macroblock comprises at least one motion vector having a first and a second component and at least one reference index (rectangular blocks) associated with said motion vector selected among a first or a second list of reference indices , said indices identifying reference images .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision (one image) information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region (said method) into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20080267291A1 CLAIM 15 . Method as part of a process of coding or decoding video signal for deriving coding information for at least one image (first subdivision) part of a high resolution image from coding information of at least one image part of a low resolution image , each image being divided into non-overlapping macroblocks themselves divided into non-overlapping blocks of a first size , wherein , non-overlapping sets of three lines of three macroblocks in said at least one image part of said high resolution image defining hyper-macroblocks and said coding information comprising at least macroblock coding modes and block coding modes , with each macroblock of said at least one high resolution image part , called high resolution macroblock , is associated at least one macroblock of said at least one low resolution image part , called low resolution macroblock , so that said associated low resolution macroblock covers at least partly said high resolution macroblock when said at least one low resolution image part upsampled by a predefined ratio multiple of 1 , 5 in both horizontal and vertical direction is superposed with said at least one high resolution image part and in that said method (root region) comprises the following steps : deriving a block coding mode for each block of a first size in said at least one high resolution image part , called high resolution block of a first size , from the macroblock coding modes of the low resolution macroblocks associated with the high resolution macroblock to which said high resolution block of a first size belongs , on the basis of the position of said high resolution block of a first size in said high resolution macroblock and on the basis of the position , called macroblock class , of said high resolution macroblock within an hyper-macroblock ; and/or deriving a macroblock coding mode for each high resolution macroblock in said at least one high resolution image part from the macroblock coding modes of the low resolution macroblocks associated with said high resolution macroblock on the basis of the class of said high resolution macroblock .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision (one image) information includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level is sub-divided .	US20080267291A1 CLAIM 15 . Method as part of a process of coding or decoding video signal for deriving coding information for at least one image (first subdivision) part of a high resolution image from coding information of at least one image part of a low resolution image , each image being divided into non-overlapping macroblocks themselves divided into non-overlapping blocks of a first size , wherein , non-overlapping sets of three lines of three macroblocks in said at least one image part of said high resolution image defining hyper-macroblocks and said coding information comprising at least macroblock coding modes and block coding modes , with each macroblock of said at least one high resolution image part , called high resolution macroblock , is associated at least one macroblock of said at least one low resolution image part , called low resolution macroblock , so that said associated low resolution macroblock covers at least partly said high resolution macroblock when said at least one low resolution image part upsampled by a predefined ratio multiple of 1 , 5 in both horizontal and vertical direction is superposed with said at least one high resolution image part and in that said method comprises the following steps : deriving a block coding mode for each block of a first size in said at least one high resolution image part , called high resolution block of a first size , from the macroblock coding modes of the low resolution macroblocks associated with the high resolution macroblock to which said high resolution block of a first size belongs , on the basis of the position of said high resolution block of a first size in said high resolution macroblock and on the basis of the position , called macroblock class , of said high resolution macroblock within an hyper-macroblock ; and/or deriving a macroblock coding mode for each high resolution macroblock in said at least one high resolution image part from the macroblock coding modes of the low resolution macroblocks associated with said high resolution macroblock on the basis of the class of said high resolution macroblock .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level from the data stream (data stream) .	US20080267291A1 CLAIM 25 . Device for coding at least a sequence of high resolution images and a sequence of low resolution images , each image being divided into non-overlapping macroblocks themselves divided into non-overlapping blocks of a first size , comprising : a first coding unit for coding said low resolution images , said first coding unit generating coding information for said low resolution images and a base layer data stream (data stream) ; an inheritance unit for deriving coding information for at least one image part of a high resolution image from coding information of at least one image part of a low resolution image ; and a second coding unit for coding said high resolution images using said derived coding information , said second coding unit generating an enhancement layer data stream ; wherein , non-overlapping sets of three lines of three macroblocks in said at least one image part of said high resolution image defining hyper-macroblocks and said coding information comprising at least macroblock coding modes and block coding modes , the inheriting unit comprises : a unit for associating , with each macroblock of said at least one high resolution image part , called high resolution macroblock , at least one macroblock of said at least one low resolution image part , called low resolution macroblock , so that said associated low resolution macroblock covers at least partly said high resolution macroblock when said at least one low resolution image part upsampled by a predefined ratio multiple of 1 . 5 in both horizontal and vertical direction is superposed with said at least one high resolution image part ; a unit for deriving a block coding mode for each block of a first size in said at least one high resolution image part , called high resolution block of a first size , from the macroblock coding modes of the low resolution macroblocks associated with the high resolution macroblock to which said high resolution block of a first size belongs , on the basis of the position of said high resolution block of a first size in said high resolution macroblock and on the basis of the position , called macroblock class , of said high resolution within an hyper-macroblock macroblock ; and/or a unit for deriving a macroblock coding mode for each high resolution macroblock in said at least one high resolution image part from the macroblock coding modes of the low resolution macroblocks associated with said high resolution macroblock on the basis of the class of said high resolution macroblock .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements associated with the first or second set (following steps) of sub-regions from the data stream (data stream) in a depth-first traversal order .	US20080267291A1 CLAIM 15 . Method as part of a process of coding or decoding video signal for deriving coding information for at least one image part of a high resolution image from coding information of at least one image part of a low resolution image , each image being divided into non-overlapping macroblocks themselves divided into non-overlapping blocks of a first size , wherein , non-overlapping sets of three lines of three macroblocks in said at least one image part of said high resolution image defining hyper-macroblocks and said coding information comprising at least macroblock coding modes and block coding modes , with each macroblock of said at least one high resolution image part , called high resolution macroblock , is associated at least one macroblock of said at least one low resolution image part , called low resolution macroblock , so that said associated low resolution macroblock covers at least partly said high resolution macroblock when said at least one low resolution image part upsampled by a predefined ratio multiple of 1 , 5 in both horizontal and vertical direction is superposed with said at least one high resolution image part and in that said method comprises the following steps (second set) : deriving a block coding mode for each block of a first size in said at least one high resolution image part , called high resolution block of a first size , from the macroblock coding modes of the low resolution macroblocks associated with the high resolution macroblock to which said high resolution block of a first size belongs , on the basis of the position of said high resolution block of a first size in said high resolution macroblock and on the basis of the position , called macroblock class , of said high resolution macroblock within an hyper-macroblock ; and/or deriving a macroblock coding mode for each high resolution macroblock in said at least one high resolution image part from the macroblock coding modes of the low resolution macroblocks associated with said high resolution macroblock on the basis of the class of said high resolution macroblock . US20080267291A1 CLAIM 25 . Device for coding at least a sequence of high resolution images and a sequence of low resolution images , each image being divided into non-overlapping macroblocks themselves divided into non-overlapping blocks of a first size , comprising : a first coding unit for coding said low resolution images , said first coding unit generating coding information for said low resolution images and a base layer data stream (data stream) ; an inheritance unit for deriving coding information for at least one image part of a high resolution image from coding information of at least one image part of a low resolution image ; and a second coding unit for coding said high resolution images using said derived coding information , said second coding unit generating an enhancement layer data stream ; wherein , non-overlapping sets of three lines of three macroblocks in said at least one image part of said high resolution image defining hyper-macroblocks and said coding information comprising at least macroblock coding modes and block coding modes , the inheriting unit comprises : a unit for associating , with each macroblock of said at least one high resolution image part , called high resolution macroblock , at least one macroblock of said at least one low resolution image part , called low resolution macroblock , so that said associated low resolution macroblock covers at least partly said high resolution macroblock when said at least one low resolution image part upsampled by a predefined ratio multiple of 1 . 5 in both horizontal and vertical direction is superposed with said at least one high resolution image part ; a unit for deriving a block coding mode for each block of a first size in said at least one high resolution image part , called high resolution block of a first size , from the macroblock coding modes of the low resolution macroblocks associated with the high resolution macroblock to which said high resolution block of a first size belongs , on the basis of the position of said high resolution block of a first size in said high resolution macroblock and on the basis of the position , called macroblock class , of said high resolution within an hyper-macroblock macroblock ; and/or a unit for deriving a macroblock coding mode for each high resolution macroblock in said at least one high resolution image part from the macroblock coding modes of the low resolution macroblocks associated with said high resolution macroblock on the basis of the class of said high resolution macroblock .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream (data stream) , disjoint from a second subset of syntax elements of the data stream including the first subdivision (one image) information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20080267291A1 CLAIM 15 . Method as part of a process of coding or decoding video signal for deriving coding information for at least one image (first subdivision) part of a high resolution image from coding information of at least one image part of a low resolution image , each image being divided into non-overlapping macroblocks themselves divided into non-overlapping blocks of a first size , wherein , non-overlapping sets of three lines of three macroblocks in said at least one image part of said high resolution image defining hyper-macroblocks and said coding information comprising at least macroblock coding modes and block coding modes , with each macroblock of said at least one high resolution image part , called high resolution macroblock , is associated at least one macroblock of said at least one low resolution image part , called low resolution macroblock , so that said associated low resolution macroblock covers at least partly said high resolution macroblock when said at least one low resolution image part upsampled by a predefined ratio multiple of 1 , 5 in both horizontal and vertical direction is superposed with said at least one high resolution image part and in that said method comprises the following steps : deriving a block coding mode for each block of a first size in said at least one high resolution image part , called high resolution block of a first size , from the macroblock coding modes of the low resolution macroblocks associated with the high resolution macroblock to which said high resolution block of a first size belongs , on the basis of the position of said high resolution block of a first size in said high resolution macroblock and on the basis of the position , called macroblock class , of said high resolution macroblock within an hyper-macroblock ; and/or deriving a macroblock coding mode for each high resolution macroblock in said at least one high resolution image part from the macroblock coding modes of the low resolution macroblocks associated with said high resolution macroblock on the basis of the class of said high resolution macroblock . US20080267291A1 CLAIM 25 . Device for coding at least a sequence of high resolution images and a sequence of low resolution images , each image being divided into non-overlapping macroblocks themselves divided into non-overlapping blocks of a first size , comprising : a first coding unit for coding said low resolution images , said first coding unit generating coding information for said low resolution images and a base layer data stream (data stream) ; an inheritance unit for deriving coding information for at least one image part of a high resolution image from coding information of at least one image part of a low resolution image ; and a second coding unit for coding said high resolution images using said derived coding information , said second coding unit generating an enhancement layer data stream ; wherein , non-overlapping sets of three lines of three macroblocks in said at least one image part of said high resolution image defining hyper-macroblocks and said coding information comprising at least macroblock coding modes and block coding modes , the inheriting unit comprises : a unit for associating , with each macroblock of said at least one high resolution image part , called high resolution macroblock , at least one macroblock of said at least one low resolution image part , called low resolution macroblock , so that said associated low resolution macroblock covers at least partly said high resolution macroblock when said at least one low resolution image part upsampled by a predefined ratio multiple of 1 . 5 in both horizontal and vertical direction is superposed with said at least one high resolution image part ; a unit for deriving a block coding mode for each block of a first size in said at least one high resolution image part , called high resolution block of a first size , from the macroblock coding modes of the low resolution macroblocks associated with the high resolution macroblock to which said high resolution block of a first size belongs , on the basis of the position of said high resolution block of a first size in said high resolution macroblock and on the basis of the position , called macroblock class , of said high resolution within an hyper-macroblock macroblock ; and/or a unit for deriving a macroblock coding mode for each high resolution macroblock in said at least one high resolution image part from the macroblock coding modes of the low resolution macroblocks associated with said high resolution macroblock on the basis of the class of said high resolution macroblock .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream (data stream) , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	US20080267291A1 CLAIM 25 . Device for coding at least a sequence of high resolution images and a sequence of low resolution images , each image being divided into non-overlapping macroblocks themselves divided into non-overlapping blocks of a first size , comprising : a first coding unit for coding said low resolution images , said first coding unit generating coding information for said low resolution images and a base layer data stream (data stream) ; an inheritance unit for deriving coding information for at least one image part of a high resolution image from coding information of at least one image part of a low resolution image ; and a second coding unit for coding said high resolution images using said derived coding information , said second coding unit generating an enhancement layer data stream ; wherein , non-overlapping sets of three lines of three macroblocks in said at least one image part of said high resolution image defining hyper-macroblocks and said coding information comprising at least macroblock coding modes and block coding modes , the inheriting unit comprises : a unit for associating , with each macroblock of said at least one high resolution image part , called high resolution macroblock , at least one macroblock of said at least one low resolution image part , called low resolution macroblock , so that said associated low resolution macroblock covers at least partly said high resolution macroblock when said at least one low resolution image part upsampled by a predefined ratio multiple of 1 . 5 in both horizontal and vertical direction is superposed with said at least one high resolution image part ; a unit for deriving a block coding mode for each block of a first size in said at least one high resolution image part , called high resolution block of a first size , from the macroblock coding modes of the low resolution macroblocks associated with the high resolution macroblock to which said high resolution block of a first size belongs , on the basis of the position of said high resolution block of a first size in said high resolution macroblock and on the basis of the position , called macroblock class , of said high resolution within an hyper-macroblock macroblock ; and/or a unit for deriving a macroblock coding mode for each high resolution macroblock in said at least one high resolution image part from the macroblock coding modes of the low resolution macroblocks associated with said high resolution macroblock on the basis of the class of said high resolution macroblock .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream (data stream) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision (one image) information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set (following steps) of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20080267291A1 CLAIM 15 . Method as part of a process of coding or decoding video signal for deriving coding information for at least one image (first subdivision) part of a high resolution image from coding information of at least one image part of a low resolution image , each image being divided into non-overlapping macroblocks themselves divided into non-overlapping blocks of a first size , wherein , non-overlapping sets of three lines of three macroblocks in said at least one image part of said high resolution image defining hyper-macroblocks and said coding information comprising at least macroblock coding modes and block coding modes , with each macroblock of said at least one high resolution image part , called high resolution macroblock , is associated at least one macroblock of said at least one low resolution image part , called low resolution macroblock , so that said associated low resolution macroblock covers at least partly said high resolution macroblock when said at least one low resolution image part upsampled by a predefined ratio multiple of 1 , 5 in both horizontal and vertical direction is superposed with said at least one high resolution image part and in that said method (root region) comprises the following steps (second set) : deriving a block coding mode for each block of a first size in said at least one high resolution image part , called high resolution block of a first size , from the macroblock coding modes of the low resolution macroblocks associated with the high resolution macroblock to which said high resolution block of a first size belongs , on the basis of the position of said high resolution block of a first size in said high resolution macroblock and on the basis of the position , called macroblock class , of said high resolution macroblock within an hyper-macroblock ; and/or deriving a macroblock coding mode for each high resolution macroblock in said at least one high resolution image part from the macroblock coding modes of the low resolution macroblocks associated with said high resolution macroblock on the basis of the class of said high resolution macroblock . US20080267291A1 CLAIM 25 . Device for coding at least a sequence of high resolution images and a sequence of low resolution images , each image being divided into non-overlapping macroblocks themselves divided into non-overlapping blocks of a first size , comprising : a first coding unit for coding said low resolution images , said first coding unit generating coding information for said low resolution images and a base layer data stream (data stream) ; an inheritance unit for deriving coding information for at least one image part of a high resolution image from coding information of at least one image part of a low resolution image ; and a second coding unit for coding said high resolution images using said derived coding information , said second coding unit generating an enhancement layer data stream ; wherein , non-overlapping sets of three lines of three macroblocks in said at least one image part of said high resolution image defining hyper-macroblocks and said coding information comprising at least macroblock coding modes and block coding modes , the inheriting unit comprises : a unit for associating , with each macroblock of said at least one high resolution image part , called high resolution macroblock , at least one macroblock of said at least one low resolution image part , called low resolution macroblock , so that said associated low resolution macroblock covers at least partly said high resolution macroblock when said at least one low resolution image part upsampled by a predefined ratio multiple of 1 . 5 in both horizontal and vertical direction is superposed with said at least one high resolution image part ; a unit for deriving a block coding mode for each block of a first size in said at least one high resolution image part , called high resolution block of a first size , from the macroblock coding modes of the low resolution macroblocks associated with the high resolution macroblock to which said high resolution block of a first size belongs , on the basis of the position of said high resolution block of a first size in said high resolution macroblock and on the basis of the position , called macroblock class , of said high resolution within an hyper-macroblock macroblock ; and/or a unit for deriving a macroblock coding mode for each high resolution macroblock in said at least one high resolution image part from the macroblock coding modes of the low resolution macroblocks associated with said high resolution macroblock on the basis of the class of said high resolution macroblock .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision (one image) information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set (following steps) of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream (data stream) generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20080267291A1 CLAIM 15 . Method as part of a process of coding or decoding video signal for deriving coding information for at least one image (first subdivision) part of a high resolution image from coding information of at least one image part of a low resolution image , each image being divided into non-overlapping macroblocks themselves divided into non-overlapping blocks of a first size , wherein , non-overlapping sets of three lines of three macroblocks in said at least one image part of said high resolution image defining hyper-macroblocks and said coding information comprising at least macroblock coding modes and block coding modes , with each macroblock of said at least one high resolution image part , called high resolution macroblock , is associated at least one macroblock of said at least one low resolution image part , called low resolution macroblock , so that said associated low resolution macroblock covers at least partly said high resolution macroblock when said at least one low resolution image part upsampled by a predefined ratio multiple of 1 , 5 in both horizontal and vertical direction is superposed with said at least one high resolution image part and in that said method (root region) comprises the following steps (second set) : deriving a block coding mode for each block of a first size in said at least one high resolution image part , called high resolution block of a first size , from the macroblock coding modes of the low resolution macroblocks associated with the high resolution macroblock to which said high resolution block of a first size belongs , on the basis of the position of said high resolution block of a first size in said high resolution macroblock and on the basis of the position , called macroblock class , of said high resolution macroblock within an hyper-macroblock ; and/or deriving a macroblock coding mode for each high resolution macroblock in said at least one high resolution image part from the macroblock coding modes of the low resolution macroblocks associated with said high resolution macroblock on the basis of the class of said high resolution macroblock . US20080267291A1 CLAIM 25 . Device for coding at least a sequence of high resolution images and a sequence of low resolution images , each image being divided into non-overlapping macroblocks themselves divided into non-overlapping blocks of a first size , comprising : a first coding unit for coding said low resolution images , said first coding unit generating coding information for said low resolution images and a base layer data stream (data stream) ; an inheritance unit for deriving coding information for at least one image part of a high resolution image from coding information of at least one image part of a low resolution image ; and a second coding unit for coding said high resolution images using said derived coding information , said second coding unit generating an enhancement layer data stream ; wherein , non-overlapping sets of three lines of three macroblocks in said at least one image part of said high resolution image defining hyper-macroblocks and said coding information comprising at least macroblock coding modes and block coding modes , the inheriting unit comprises : a unit for associating , with each macroblock of said at least one high resolution image part , called high resolution macroblock , at least one macroblock of said at least one low resolution image part , called low resolution macroblock , so that said associated low resolution macroblock covers at least partly said high resolution macroblock when said at least one low resolution image part upsampled by a predefined ratio multiple of 1 . 5 in both horizontal and vertical direction is superposed with said at least one high resolution image part ; a unit for deriving a block coding mode for each block of a first size in said at least one high resolution image part , called high resolution block of a first size , from the macroblock coding modes of the low resolution macroblocks associated with the high resolution macroblock to which said high resolution block of a first size belongs , on the basis of the position of said high resolution block of a first size in said high resolution macroblock and on the basis of the position , called macroblock class , of said high resolution within an hyper-macroblock macroblock ; and/or a unit for deriving a macroblock coding mode for each high resolution macroblock in said at least one high resolution image part from the macroblock coding modes of the low resolution macroblocks associated with said high resolution macroblock on the basis of the class of said high resolution macroblock .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision (one image) information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set (following steps) of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream (data stream) the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20080267291A1 CLAIM 15 . Method as part of a process of coding or decoding video signal for deriving coding information for at least one image (first subdivision) part of a high resolution image from coding information of at least one image part of a low resolution image , each image being divided into non-overlapping macroblocks themselves divided into non-overlapping blocks of a first size , wherein , non-overlapping sets of three lines of three macroblocks in said at least one image part of said high resolution image defining hyper-macroblocks and said coding information comprising at least macroblock coding modes and block coding modes , with each macroblock of said at least one high resolution image part , called high resolution macroblock , is associated at least one macroblock of said at least one low resolution image part , called low resolution macroblock , so that said associated low resolution macroblock covers at least partly said high resolution macroblock when said at least one low resolution image part upsampled by a predefined ratio multiple of 1 , 5 in both horizontal and vertical direction is superposed with said at least one high resolution image part and in that said method (root region) comprises the following steps (second set) : deriving a block coding mode for each block of a first size in said at least one high resolution image part , called high resolution block of a first size , from the macroblock coding modes of the low resolution macroblocks associated with the high resolution macroblock to which said high resolution block of a first size belongs , on the basis of the position of said high resolution block of a first size in said high resolution macroblock and on the basis of the position , called macroblock class , of said high resolution macroblock within an hyper-macroblock ; and/or deriving a macroblock coding mode for each high resolution macroblock in said at least one high resolution image part from the macroblock coding modes of the low resolution macroblocks associated with said high resolution macroblock on the basis of the class of said high resolution macroblock . US20080267291A1 CLAIM 25 . Device for coding at least a sequence of high resolution images and a sequence of low resolution images , each image being divided into non-overlapping macroblocks themselves divided into non-overlapping blocks of a first size , comprising : a first coding unit for coding said low resolution images , said first coding unit generating coding information for said low resolution images and a base layer data stream (data stream) ; an inheritance unit for deriving coding information for at least one image part of a high resolution image from coding information of at least one image part of a low resolution image ; and a second coding unit for coding said high resolution images using said derived coding information , said second coding unit generating an enhancement layer data stream ; wherein , non-overlapping sets of three lines of three macroblocks in said at least one image part of said high resolution image defining hyper-macroblocks and said coding information comprising at least macroblock coding modes and block coding modes , the inheriting unit comprises : a unit for associating , with each macroblock of said at least one high resolution image part , called high resolution macroblock , at least one macroblock of said at least one low resolution image part , called low resolution macroblock , so that said associated low resolution macroblock covers at least partly said high resolution macroblock when said at least one low resolution image part upsampled by a predefined ratio multiple of 1 . 5 in both horizontal and vertical direction is superposed with said at least one high resolution image part ; a unit for deriving a block coding mode for each block of a first size in said at least one high resolution image part , called high resolution block of a first size , from the macroblock coding modes of the low resolution macroblocks associated with the high resolution macroblock to which said high resolution block of a first size belongs , on the basis of the position of said high resolution block of a first size in said high resolution macroblock and on the basis of the position , called macroblock class , of said high resolution within an hyper-macroblock macroblock ; and/or a unit for deriving a macroblock coding mode for each high resolution macroblock in said at least one high resolution image part from the macroblock coding modes of the low resolution macroblocks associated with said high resolution macroblock on the basis of the class of said high resolution macroblock .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20060209959A1 Filed: 2006-02-07 Issued: 2006-09-21 Methods and systems for extended spatial scalability with picture-level adaptation (Original Assignee) Sharp Laboratories of America Inc (Current Assignee) Dolby Laboratories Licensing Corp Shijun Sun
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20060209959A1 CLAIM 1 . A method for picture-level adaptation in a spatially-scalable video codec , said method (root region) comprising : a) defining a first cropping window at a first location in a first picture of an input video sequence ; b) generating a first base layer corresponding to said first cropping window ; c) defining a second cropping window at a second location , not coincident to said first location , in a second picture of said input video sequence ; and d) generating a second base layer corresponding to said second cropping window .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region (said method) into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20060209959A1 CLAIM 1 . A method for picture-level adaptation in a spatially-scalable video codec , said method (root region) comprising : a) defining a first cropping window at a first location in a first picture of an input video sequence ; b) generating a first base layer corresponding to said first cropping window ; c) defining a second cropping window at a second location , not coincident to said first location , in a second picture of said input video sequence ; and d) generating a second base layer corresponding to said second cropping window .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20060209959A1 CLAIM 1 . A method for picture-level adaptation in a spatially-scalable video codec , said method (root region) comprising : a) defining a first cropping window at a first location in a first picture of an input video sequence ; b) generating a first base layer corresponding to said first cropping window ; c) defining a second cropping window at a second location , not coincident to said first location , in a second picture of said input video sequence ; and d) generating a second base layer corresponding to said second cropping window .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20060209959A1 CLAIM 1 . A method for picture-level adaptation in a spatially-scalable video codec , said method (root region) comprising : a) defining a first cropping window at a first location in a first picture of an input video sequence ; b) generating a first base layer corresponding to said first cropping window ; c) defining a second cropping window at a second location , not coincident to said first location , in a second picture of said input video sequence ; and d) generating a second base layer corresponding to said second cropping window .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20060209959A1 CLAIM 1 . A method for picture-level adaptation in a spatially-scalable video codec , said method (root region) comprising : a) defining a first cropping window at a first location in a first picture of an input video sequence ; b) generating a first base layer corresponding to said first cropping window ; c) defining a second cropping window at a second location , not coincident to said first location , in a second picture of said input video sequence ; and d) generating a second base layer corresponding to said second cropping window .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20060126955A1 Filed: 2006-02-01 Issued: 2006-06-15 Spatial extrapolation of pixel values in intraframe video coding and decoding (Original Assignee) Microsoft Corp (Current Assignee) Microsoft Technology Licensing LLC Sridhar Srinivasan
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information (first count) , information related to first and second maximum region sizes , first and second subdivision (video frame) information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision (video frame) information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20060126955A1 CLAIM 49 . The method of claim 46 wherein the current block is a luminance block of a macroblock of the video frame (second subdivision, first subdivision) . US20060126955A1 CLAIM 55 . The method of claim 52 wherein the causal context information includes a first count (video information) of non-zero coefficient values from a first causal block above the current block , and wherein the causal context information further includes a second count of non-zero coefficient values from a second causal block left of the current block .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision (video frame) information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level (discrete cosine transform) according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20060126955A1 CLAIM 49 . The method of claim 46 wherein the current block is a luminance block of a macroblock of the video frame (second subdivision, first subdivision) . US20060126955A1 CLAIM 66 . The method of claim 25 wherein the re-oriented inverse frequency transform is a skewed inverse discrete cosine transform (first hierarchy level) .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision (video frame) information includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level is sub-divided .	US20060126955A1 CLAIM 49 . The method of claim 46 wherein the current block is a luminance block of a macroblock of the video frame (second subdivision, first subdivision) .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision (video frame) information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20060126955A1 CLAIM 49 . The method of claim 46 wherein the current block is a luminance block of a macroblock of the video frame (second subdivision, first subdivision) .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information (first count) , information related to first and second maximum region sizes , first and second subdivision (video frame) information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision (video frame) information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20060126955A1 CLAIM 49 . The method of claim 46 wherein the current block is a luminance block of a macroblock of the video frame (second subdivision, first subdivision) . US20060126955A1 CLAIM 55 . The method of claim 52 wherein the causal context information includes a first count (video information) of non-zero coefficient values from a first causal block above the current block , and wherein the causal context information further includes a second count of non-zero coefficient values from a second causal block left of the current block .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information (first count) into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision (video frame) information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (video frame) information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20060126955A1 CLAIM 49 . The method of claim 46 wherein the current block is a luminance block of a macroblock of the video frame (second subdivision, first subdivision) . US20060126955A1 CLAIM 55 . The method of claim 52 wherein the causal context information includes a first count (video information) of non-zero coefficient values from a first causal block above the current block , and wherein the causal context information further includes a second count of non-zero coefficient values from a second causal block left of the current block .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information (first count) into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision (video frame) information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (video frame) information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20060126955A1 CLAIM 49 . The method of claim 46 wherein the current block is a luminance block of a macroblock of the video frame (second subdivision, first subdivision) . US20060126955A1 CLAIM 55 . The method of claim 52 wherein the causal context information includes a first count (video information) of non-zero coefficient values from a first causal block above the current block , and wherein the causal context information further includes a second count of non-zero coefficient values from a second causal block left of the current block .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20060153295A1 Filed: 2006-01-11 Issued: 2006-07-13 Method and system for inter-layer prediction mode coding in scalable video coding (Original Assignee) Nokia Oyj (Current Assignee) Nokia Oyj Xianglin Wang, Yiliang Bao, Marta Karczewicz, Justin Ridge
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (video encoder) information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding (coded block pattern) and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20060153295A1 CLAIM 1 . A method for use in scalable video coding for reducing redundancy existing in scalable video layers , the layers comprising a base layer and at least one enhancement layer , each layer comprising at least one macroblock , said method (root region) comprising : determining whether to use a residue prediction mode in coding a macroblock in the enhancement layer ; and if the residue prediction mode is used , coding a residual prediction flag into the enhancement layer bit stream , said flag indicating whether residual prediction is applied to the macroblock in the enhancement layer ; and if the residue prediction mode is not used , omitting the residual prediction flag from the enhancement layer bit stream for said macroblock . US20060153295A1 CLAIM 6 . The method of claim 1 , wherein the residue prediction mode is not used if a coded block pattern (prediction coding) for the base layer macroblock is zero US20060153295A1 CLAIM 11 . A scalable video encoder (second subdivision, second subset, second subdivision information) for coding for reducing redundancy existing in scalable video layers , the layers comprising a base layer and at least one enhancement layer , each layer comprising at least one macroblock , said encoder comprising : means for determining whether to use a residue prediction mode in coding a macroblock in the enhancement layer ; and means for coding a residual prediction flag into the enhancement layer bit stream if the residue prediction mode is used , said flag indicating whether residual prediction is applied to the macroblock in the enhancement layer ; and if the residue prediction mode is not used , omitting the residual prediction flag from the enhancement layer bit stream for said macroblock .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region (said method) into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20060153295A1 CLAIM 1 . A method for use in scalable video coding for reducing redundancy existing in scalable video layers , the layers comprising a base layer and at least one enhancement layer , each layer comprising at least one macroblock , said method (root region) comprising : determining whether to use a residue prediction mode in coding a macroblock in the enhancement layer ; and if the residue prediction mode is used , coding a residual prediction flag into the enhancement layer bit stream , said flag indicating whether residual prediction is applied to the macroblock in the enhancement layer ; and if the residue prediction mode is not used , omitting the residual prediction flag from the enhancement layer bit stream for said macroblock .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements (video coding) associated with the first or second set of sub-regions from the data stream in a depth-first traversal order .	US20060153295A1 CLAIM 1 . A method for use in scalable video coding (syntax elements) for reducing redundancy existing in scalable video layers , the layers comprising a base layer and at least one enhancement layer , each layer comprising at least one macroblock , said method comprising : determining whether to use a residue prediction mode in coding a macroblock in the enhancement layer ; and if the residue prediction mode is used , coding a residual prediction flag into the enhancement layer bit stream , said flag indicating whether residual prediction is applied to the macroblock in the enhancement layer ; and if the residue prediction mode is not used , omitting the residual prediction flag from the enhancement layer bit stream for said macroblock .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements (video coding) of the data stream , disjoint from a second subset (video encoder) of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20060153295A1 CLAIM 1 . A method for use in scalable video coding (syntax elements) for reducing redundancy existing in scalable video layers , the layers comprising a base layer and at least one enhancement layer , each layer comprising at least one macroblock , said method comprising : determining whether to use a residue prediction mode in coding a macroblock in the enhancement layer ; and if the residue prediction mode is used , coding a residual prediction flag into the enhancement layer bit stream , said flag indicating whether residual prediction is applied to the macroblock in the enhancement layer ; and if the residue prediction mode is not used , omitting the residual prediction flag from the enhancement layer bit stream for said macroblock . US20060153295A1 CLAIM 11 . A scalable video encoder (second subdivision, second subset, second subdivision information) for coding for reducing redundancy existing in scalable video layers , the layers comprising a base layer and at least one enhancement layer , each layer comprising at least one macroblock , said encoder comprising : means for determining whether to use a residue prediction mode in coding a macroblock in the enhancement layer ; and means for coding a residual prediction flag into the enhancement layer bit stream if the residue prediction mode is used , said flag indicating whether residual prediction is applied to the macroblock in the enhancement layer ; and if the residue prediction mode is not used , omitting the residual prediction flag from the enhancement layer bit stream for said macroblock .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (video encoder) information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding (coded block pattern) and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20060153295A1 CLAIM 1 . A method for use in scalable video coding for reducing redundancy existing in scalable video layers , the layers comprising a base layer and at least one enhancement layer , each layer comprising at least one macroblock , said method (root region) comprising : determining whether to use a residue prediction mode in coding a macroblock in the enhancement layer ; and if the residue prediction mode is used , coding a residual prediction flag into the enhancement layer bit stream , said flag indicating whether residual prediction is applied to the macroblock in the enhancement layer ; and if the residue prediction mode is not used , omitting the residual prediction flag from the enhancement layer bit stream for said macroblock . US20060153295A1 CLAIM 6 . The method of claim 1 , wherein the residue prediction mode is not used if a coded block pattern (prediction coding) for the base layer macroblock is zero US20060153295A1 CLAIM 11 . A scalable video encoder (second subdivision, second subset, second subdivision information) for coding for reducing redundancy existing in scalable video layers , the layers comprising a base layer and at least one enhancement layer , each layer comprising at least one macroblock , said encoder comprising : means for determining whether to use a residue prediction mode in coding a macroblock in the enhancement layer ; and means for coding a residual prediction flag into the enhancement layer bit stream if the residue prediction mode is used , said flag indicating whether residual prediction is applied to the macroblock in the enhancement layer ; and if the residue prediction mode is not used , omitting the residual prediction flag from the enhancement layer bit stream for said macroblock .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (video encoder) information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding (coded block pattern) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20060153295A1 CLAIM 1 . A method for use in scalable video coding for reducing redundancy existing in scalable video layers , the layers comprising a base layer and at least one enhancement layer , each layer comprising at least one macroblock , said method (root region) comprising : determining whether to use a residue prediction mode in coding a macroblock in the enhancement layer ; and if the residue prediction mode is used , coding a residual prediction flag into the enhancement layer bit stream , said flag indicating whether residual prediction is applied to the macroblock in the enhancement layer ; and if the residue prediction mode is not used , omitting the residual prediction flag from the enhancement layer bit stream for said macroblock . US20060153295A1 CLAIM 6 . The method of claim 1 , wherein the residue prediction mode is not used if a coded block pattern (prediction coding) for the base layer macroblock is zero US20060153295A1 CLAIM 11 . A scalable video encoder (second subdivision, second subset, second subdivision information) for coding for reducing redundancy existing in scalable video layers , the layers comprising a base layer and at least one enhancement layer , each layer comprising at least one macroblock , said encoder comprising : means for determining whether to use a residue prediction mode in coding a macroblock in the enhancement layer ; and means for coding a residual prediction flag into the enhancement layer bit stream if the residue prediction mode is used , said flag indicating whether residual prediction is applied to the macroblock in the enhancement layer ; and if the residue prediction mode is not used , omitting the residual prediction flag from the enhancement layer bit stream for said macroblock .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (video encoder) information and a maximum hierarchy level ; encoding the array of information samples using prediction coding (coded block pattern) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20060153295A1 CLAIM 1 . A method for use in scalable video coding for reducing redundancy existing in scalable video layers , the layers comprising a base layer and at least one enhancement layer , each layer comprising at least one macroblock , said method (root region) comprising : determining whether to use a residue prediction mode in coding a macroblock in the enhancement layer ; and if the residue prediction mode is used , coding a residual prediction flag into the enhancement layer bit stream , said flag indicating whether residual prediction is applied to the macroblock in the enhancement layer ; and if the residue prediction mode is not used , omitting the residual prediction flag from the enhancement layer bit stream for said macroblock . US20060153295A1 CLAIM 6 . The method of claim 1 , wherein the residue prediction mode is not used if a coded block pattern (prediction coding) for the base layer macroblock is zero US20060153295A1 CLAIM 11 . A scalable video encoder (second subdivision, second subset, second subdivision information) for coding for reducing redundancy existing in scalable video layers , the layers comprising a base layer and at least one enhancement layer , each layer comprising at least one macroblock , said encoder comprising : means for determining whether to use a residue prediction mode in coding a macroblock in the enhancement layer ; and means for coding a residual prediction flag into the enhancement layer bit stream if the residue prediction mode is used , said flag indicating whether residual prediction is applied to the macroblock in the enhancement layer ; and if the residue prediction mode is not used , omitting the residual prediction flag from the enhancement layer bit stream for said macroblock .
US10250913B2 CLAIM 15 . A non-transitory computer readable digital storage medium having stored thereon a computer program having a program code (program code) for performing , when running on a computer , a method according to claim 12 .	US20060153295A1 CLAIM 18 . A software application product comprising a storage medium having a software application for use in scalable video coding for reducing redundancy existing in scalable video layers , the layers comprising a base layer and at least one enhancement layer , each layer comprising at least one macroblock , said software application comprising program code (program code) s for carrying out the method steps of claim 1 .
US10250913B2 CLAIM 16 . A non-transitory computer readable digital storage medium having stored thereon a computer program having a program code (program code) for performing , when running on a computer , a method according to claim 14 .	US20060153295A1 CLAIM 18 . A software application product comprising a storage medium having a software application for use in scalable video coding for reducing redundancy existing in scalable video layers , the layers comprising a base layer and at least one enhancement layer , each layer comprising at least one macroblock , said software application comprising program code (program code) s for carrying out the method steps of claim 1 .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20060153300A1 Filed: 2006-01-11 Issued: 2006-07-13 Method and system for motion vector prediction in scalable video coding (Original Assignee) Nokia Oyj (Current Assignee) Nokia Oyj Xianglin Wang, Yiliang Bao, Marta Karczewicz, Justin Ridge
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (same reference, video frame) information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision (same reference, video frame) information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20060153300A1 CLAIM 1 . A method for use in scalable video coding for motion vector prediction in an enhancement layer in a video frame (second subdivision, first subdivision) , the enhancement layer having a corresponding base layer , wherein the enhancement layer comprises a plurality of first blocks including a current block and a plurality of neighboring blocks , and the base layer comprises a plurality of second blocks corresponding to the current block , said method (root region) comprising the steps of : computing a first predictive motion vector of the current block , if available , based at least on motion vectors in the neighboring blocks ; computing a second predictive motion vector of the current block , if available , based at least on a motion vector in the corresponding second blocks ; and coding the difference between the current block motion vector and one of the available predictive motion vectors for providing at least a difference motion vector , so that the available one predictive motion vector is used to predict motion associated with the enhancement layer in a decoding process based on the difference motion vector . US20060153300A1 CLAIM 2 . The method of claim 1 , wherein the first predictive motion vector is associated with a first reference frame index , the second predictive motion vector is associated with a second reference frame index , the current block motion vector is associated with a third reference frame index and wherein when both the first predictive motion vector and the second predictive motion vector are available , and if one and only one of the first and second reference frame indices is the same as the third reference frame index , said method further comprising the steps of : coding the difference between the current block motion vector and one of the first and second predictive motion vector associated with the same reference (second subdivision, first subdivision) frame index as the third reference frame index for providing the difference motion vector , and using said one of the first and second predictive motion vector associated with the same reference frame index as the third reference frame index to predict the motion associated with the enhancement layer in a decoding process based on the difference motion vector .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision (same reference, video frame) information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region (said method) into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20060153300A1 CLAIM 1 . A method for use in scalable video coding for motion vector prediction in an enhancement layer in a video frame (second subdivision, first subdivision) , the enhancement layer having a corresponding base layer , wherein the enhancement layer comprises a plurality of first blocks including a current block and a plurality of neighboring blocks , and the base layer comprises a plurality of second blocks corresponding to the current block , said method (root region) comprising the steps of : computing a first predictive motion vector of the current block , if available , based at least on motion vectors in the neighboring blocks ; computing a second predictive motion vector of the current block , if available , based at least on a motion vector in the corresponding second blocks ; and coding the difference between the current block motion vector and one of the available predictive motion vectors for providing at least a difference motion vector , so that the available one predictive motion vector is used to predict motion associated with the enhancement layer in a decoding process based on the difference motion vector . US20060153300A1 CLAIM 2 . The method of claim 1 , wherein the first predictive motion vector is associated with a first reference frame index , the second predictive motion vector is associated with a second reference frame index , the current block motion vector is associated with a third reference frame index and wherein when both the first predictive motion vector and the second predictive motion vector are available , and if one and only one of the first and second reference frame indices is the same as the third reference frame index , said method further comprising the steps of : coding the difference between the current block motion vector and one of the first and second predictive motion vector associated with the same reference (second subdivision, first subdivision) frame index as the third reference frame index for providing the difference motion vector , and using said one of the first and second predictive motion vector associated with the same reference frame index as the third reference frame index to predict the motion associated with the enhancement layer in a decoding process based on the difference motion vector .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision (same reference, video frame) information includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level is sub-divided .	US20060153300A1 CLAIM 1 . A method for use in scalable video coding for motion vector prediction in an enhancement layer in a video frame (second subdivision, first subdivision) , the enhancement layer having a corresponding base layer , wherein the enhancement layer comprises a plurality of first blocks including a current block and a plurality of neighboring blocks , and the base layer comprises a plurality of second blocks corresponding to the current block , said method comprising the steps of : computing a first predictive motion vector of the current block , if available , based at least on motion vectors in the neighboring blocks ; computing a second predictive motion vector of the current block , if available , based at least on a motion vector in the corresponding second blocks ; and coding the difference between the current block motion vector and one of the available predictive motion vectors for providing at least a difference motion vector , so that the available one predictive motion vector is used to predict motion associated with the enhancement layer in a decoding process based on the difference motion vector . US20060153300A1 CLAIM 2 . The method of claim 1 , wherein the first predictive motion vector is associated with a first reference frame index , the second predictive motion vector is associated with a second reference frame index , the current block motion vector is associated with a third reference frame index and wherein when both the first predictive motion vector and the second predictive motion vector are available , and if one and only one of the first and second reference frame indices is the same as the third reference frame index , said method further comprising the steps of : coding the difference between the current block motion vector and one of the first and second predictive motion vector associated with the same reference (second subdivision, first subdivision) frame index as the third reference frame index for providing the difference motion vector , and using said one of the first and second predictive motion vector associated with the same reference frame index as the third reference frame index to predict the motion associated with the enhancement layer in a decoding process based on the difference motion vector .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements (video coding) associated with the first or second set of sub-regions from the data stream in a depth-first traversal order .	US20060153300A1 CLAIM 1 . A method for use in scalable video coding (syntax elements) for motion vector prediction in an enhancement layer in a video frame , the enhancement layer having a corresponding base layer , wherein the enhancement layer comprises a plurality of first blocks including a current block and a plurality of neighboring blocks , and the base layer comprises a plurality of second blocks corresponding to the current block , said method comprising the steps of : computing a first predictive motion vector of the current block , if available , based at least on motion vectors in the neighboring blocks ; computing a second predictive motion vector of the current block , if available , based at least on a motion vector in the corresponding second blocks ; and coding the difference between the current block motion vector and one of the available predictive motion vectors for providing at least a difference motion vector , so that the available one predictive motion vector is used to predict motion associated with the enhancement layer in a decoding process based on the difference motion vector .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements (video coding) of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision (same reference, video frame) information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20060153300A1 CLAIM 1 . A method for use in scalable video coding (syntax elements) for motion vector prediction in an enhancement layer in a video frame (second subdivision, first subdivision) , the enhancement layer having a corresponding base layer , wherein the enhancement layer comprises a plurality of first blocks including a current block and a plurality of neighboring blocks , and the base layer comprises a plurality of second blocks corresponding to the current block , said method comprising the steps of : computing a first predictive motion vector of the current block , if available , based at least on motion vectors in the neighboring blocks ; computing a second predictive motion vector of the current block , if available , based at least on a motion vector in the corresponding second blocks ; and coding the difference between the current block motion vector and one of the available predictive motion vectors for providing at least a difference motion vector , so that the available one predictive motion vector is used to predict motion associated with the enhancement layer in a decoding process based on the difference motion vector . US20060153300A1 CLAIM 2 . The method of claim 1 , wherein the first predictive motion vector is associated with a first reference frame index , the second predictive motion vector is associated with a second reference frame index , the current block motion vector is associated with a third reference frame index and wherein when both the first predictive motion vector and the second predictive motion vector are available , and if one and only one of the first and second reference frame indices is the same as the third reference frame index , said method further comprising the steps of : coding the difference between the current block motion vector and one of the first and second predictive motion vector associated with the same reference (second subdivision, first subdivision) frame index as the third reference frame index for providing the difference motion vector , and using said one of the first and second predictive motion vector associated with the same reference frame index as the third reference frame index to predict the motion associated with the enhancement layer in a decoding process based on the difference motion vector .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (same reference, video frame) information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision (same reference, video frame) information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20060153300A1 CLAIM 1 . A method for use in scalable video coding for motion vector prediction in an enhancement layer in a video frame (second subdivision, first subdivision) , the enhancement layer having a corresponding base layer , wherein the enhancement layer comprises a plurality of first blocks including a current block and a plurality of neighboring blocks , and the base layer comprises a plurality of second blocks corresponding to the current block , said method (root region) comprising the steps of : computing a first predictive motion vector of the current block , if available , based at least on motion vectors in the neighboring blocks ; computing a second predictive motion vector of the current block , if available , based at least on a motion vector in the corresponding second blocks ; and coding the difference between the current block motion vector and one of the available predictive motion vectors for providing at least a difference motion vector , so that the available one predictive motion vector is used to predict motion associated with the enhancement layer in a decoding process based on the difference motion vector . US20060153300A1 CLAIM 2 . The method of claim 1 , wherein the first predictive motion vector is associated with a first reference frame index , the second predictive motion vector is associated with a second reference frame index , the current block motion vector is associated with a third reference frame index and wherein when both the first predictive motion vector and the second predictive motion vector are available , and if one and only one of the first and second reference frame indices is the same as the third reference frame index , said method further comprising the steps of : coding the difference between the current block motion vector and one of the first and second predictive motion vector associated with the same reference (second subdivision, first subdivision) frame index as the third reference frame index for providing the difference motion vector , and using said one of the first and second predictive motion vector associated with the same reference frame index as the third reference frame index to predict the motion associated with the enhancement layer in a decoding process based on the difference motion vector .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision (same reference, video frame) information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (same reference, video frame) information and a maximum hierarchy level ; and a data stream generator (first difference) configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20060153300A1 CLAIM 1 . A method for use in scalable video coding for motion vector prediction in an enhancement layer in a video frame (second subdivision, first subdivision) , the enhancement layer having a corresponding base layer , wherein the enhancement layer comprises a plurality of first blocks including a current block and a plurality of neighboring blocks , and the base layer comprises a plurality of second blocks corresponding to the current block , said method (root region) comprising the steps of : computing a first predictive motion vector of the current block , if available , based at least on motion vectors in the neighboring blocks ; computing a second predictive motion vector of the current block , if available , based at least on a motion vector in the corresponding second blocks ; and coding the difference between the current block motion vector and one of the available predictive motion vectors for providing at least a difference motion vector , so that the available one predictive motion vector is used to predict motion associated with the enhancement layer in a decoding process based on the difference motion vector . US20060153300A1 CLAIM 2 . The method of claim 1 , wherein the first predictive motion vector is associated with a first reference frame index , the second predictive motion vector is associated with a second reference frame index , the current block motion vector is associated with a third reference frame index and wherein when both the first predictive motion vector and the second predictive motion vector are available , and if one and only one of the first and second reference frame indices is the same as the third reference frame index , said method further comprising the steps of : coding the difference between the current block motion vector and one of the first and second predictive motion vector associated with the same reference (second subdivision, first subdivision) frame index as the third reference frame index for providing the difference motion vector , and using said one of the first and second predictive motion vector associated with the same reference frame index as the third reference frame index to predict the motion associated with the enhancement layer in a decoding process based on the difference motion vector . US20060153300A1 CLAIM 3 . The method of claim 1 , wherein both the first predictive motion vector and the second predictive motion vector are available , said method further comprising the steps of : computing a first difference (data stream generator) vector associated with the first predictive motion vector , the first difference vector having a first amplitude ; computing a second difference vector associated with the second predictive motion , the second difference vector having a second amplitude ; and if the first amplitude is smaller than the second amplitude , coding the difference between the current block motion vector and the first predictive motion vector for providing a difference motion vector , and if the second amplitude is smaller than the first amplitude , coding the difference between the current block motion vector and the second predictive motion vector for providing the difference motion vector .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision (same reference, video frame) information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (same reference, video frame) information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20060153300A1 CLAIM 1 . A method for use in scalable video coding for motion vector prediction in an enhancement layer in a video frame (second subdivision, first subdivision) , the enhancement layer having a corresponding base layer , wherein the enhancement layer comprises a plurality of first blocks including a current block and a plurality of neighboring blocks , and the base layer comprises a plurality of second blocks corresponding to the current block , said method (root region) comprising the steps of : computing a first predictive motion vector of the current block , if available , based at least on motion vectors in the neighboring blocks ; computing a second predictive motion vector of the current block , if available , based at least on a motion vector in the corresponding second blocks ; and coding the difference between the current block motion vector and one of the available predictive motion vectors for providing at least a difference motion vector , so that the available one predictive motion vector is used to predict motion associated with the enhancement layer in a decoding process based on the difference motion vector . US20060153300A1 CLAIM 2 . The method of claim 1 , wherein the first predictive motion vector is associated with a first reference frame index , the second predictive motion vector is associated with a second reference frame index , the current block motion vector is associated with a third reference frame index and wherein when both the first predictive motion vector and the second predictive motion vector are available , and if one and only one of the first and second reference frame indices is the same as the third reference frame index , said method further comprising the steps of : coding the difference between the current block motion vector and one of the first and second predictive motion vector associated with the same reference (second subdivision, first subdivision) frame index as the third reference frame index for providing the difference motion vector , and using said one of the first and second predictive motion vector associated with the same reference frame index as the third reference frame index to predict the motion associated with the enhancement layer in a decoding process based on the difference motion vector .
US10250913B2 CLAIM 15 . A non-transitory computer readable digital storage medium having stored thereon a computer program having a program code (program code) for performing , when running on a computer , a method according to claim 12 .	US20060153300A1 CLAIM 17 . A software application product comprising a storage medium having a software application for use in coding a video sequence having a plurality of frames , each frame having a plurality of layers , said plurality of layers including a base layer and at least one enhancement layer , said enhancement layer comprising a plurality of first blocks including a current block and a plurality of neighboring blocks , the base layer comprising a plurality of second blocks corresponding to the current block , said application product having program code (program code) s for carrying out the method steps of claim 1 .
US10250913B2 CLAIM 16 . A non-transitory computer readable digital storage medium having stored thereon a computer program having a program code (program code) for performing , when running on a computer , a method according to claim 14 .	US20060153300A1 CLAIM 17 . A software application product comprising a storage medium having a software application for use in coding a video sequence having a plurality of frames , each frame having a plurality of layers , said plurality of layers including a base layer and at least one enhancement layer , said enhancement layer comprising a plurality of first blocks including a current block and a plurality of neighboring blocks , the base layer comprising a plurality of second blocks corresponding to the current block , said application product having program code (program code) s for carrying out the method steps of claim 1 .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20060089832A1 Filed: 2005-12-08 Issued: 2006-04-27 Method for improving the coding efficiency of an audio signal (Original Assignee) Juha Ojanpera (Current Assignee) Provenance Asset Group LLC ; Nokia USA Inc Juha Ojanpera
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition (error information) rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20060089832A1 CLAIM 6 . The method of claim 5 , further comprising determining the prediction error information (respective partition) for each of the predicted signals as a difference spectrum representing using the frequency spectrum of the audio signal and the frequency spectrum of the predicted signal .
US10250913B2 CLAIM 15 . A non-transitory computer readable digital storage medium having stored thereon a computer program (computer program) having a program code for performing , when running on a computer , a method according to claim 12 .	US20060089832A1 CLAIM 37 . A computer program (computer program) product for encoding an audio signal comprising a computer useable medium including a computer readable program , wherein the computer readable program when executed on a computer causes the computer to : select a reference sequence from a number of stored sequences that has the smallest error relative to a sequence of the audio signal to be coded ; calculate pitch predictor coefficients for the selected reference sequence using one of a set of pitch predictor orders ; produce a predicted sequence from the selected reference sequence using the calculated pitch predictor coefficients ; calculate a coding error by comparing the predicted sequence to the sequence to be coded ; calculate pitch predictor coefficients for the selected reference sequence , produce a predicted sequence from the selected reference sequence , and calculate a coding error by comparing the predicted sequence to the sequence to be coded , for each of the remaining orders of the set of pitch predictor orders ; and use an order from the set of pitch predictor orders that results in the smallest coding error to select a coding method for the sequence to be coded .
US10250913B2 CLAIM 16 . A non-transitory computer readable digital storage medium having stored thereon a computer program (computer program) having a program code for performing , when running on a computer , a method according to claim 14 .	US20060089832A1 CLAIM 37 . A computer program (computer program) product for encoding an audio signal comprising a computer useable medium including a computer readable program , wherein the computer readable program when executed on a computer causes the computer to : select a reference sequence from a number of stored sequences that has the smallest error relative to a sequence of the audio signal to be coded ; calculate pitch predictor coefficients for the selected reference sequence using one of a set of pitch predictor orders ; produce a predicted sequence from the selected reference sequence using the calculated pitch predictor coefficients ; calculate a coding error by comparing the predicted sequence to the sequence to be coded ; calculate pitch predictor coefficients for the selected reference sequence , produce a predicted sequence from the selected reference sequence , and calculate a coding error by comparing the predicted sequence to the sequence to be coded , for each of the remaining orders of the set of pitch predictor orders ; and use an order from the set of pitch predictor orders that results in the smallest coding error to select a coding method for the sequence to be coded .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20060120448A1 Filed: 2005-11-29 Issued: 2006-06-08 Method and apparatus for encoding/decoding multi-layer video using DCT upsampling (Original Assignee) Samsung Electronics Co Ltd (Current Assignee) Samsung Electronics Co Ltd Woo-jin Han, Sang-Chang Cha, Ho-Jin Ha
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (determined size, video encoder) information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20060120448A1 CLAIM 1 . A method for encoding a multi-layer video comprising : encoding and reconstructing a base layer frame ; performing discrete cosine transform (DCT) upsampling on a second block of a predetermined size (second subdivision, second subset, second subdivision information) in the reconstructed frame corresponding to a first block in an enhancement layer frame ; calculating a difference between the first block and a third block generated by the performing of the DCT upsampling ; and encoding the difference . US20060120448A1 CLAIM 17 . A multi-layered video encoder (second subdivision, second subset, second subdivision information) comprising : means for encoding and reconstructing a base layer frame ; means for performing discrete cosine transform (DCT) upsampling on a second block of a predetermined size in the reconstructed frame corresponding to a first block in an enhancement layer frame ; means for calculating a difference between the first block and a third block generated by the DCT upsampling ; and means for encoding the difference .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level (discrete cosine transform) according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20060120448A1 CLAIM 1 . A method for encoding a multi-layer video comprising : encoding and reconstructing a base layer frame ; performing discrete cosine transform (first hierarchy level) (DCT) upsampling on a second block of a predetermined size in the reconstructed frame corresponding to a first block in an enhancement layer frame ; calculating a difference between the first block and a third block generated by the performing of the DCT upsampling ; and encoding the difference .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset (determined size, video encoder) of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20060120448A1 CLAIM 1 . A method for encoding a multi-layer video comprising : encoding and reconstructing a base layer frame ; performing discrete cosine transform (DCT) upsampling on a second block of a predetermined size (second subdivision, second subset, second subdivision information) in the reconstructed frame corresponding to a first block in an enhancement layer frame ; calculating a difference between the first block and a third block generated by the performing of the DCT upsampling ; and encoding the difference . US20060120448A1 CLAIM 17 . A multi-layered video encoder (second subdivision, second subset, second subdivision information) comprising : means for encoding and reconstructing a base layer frame ; means for performing discrete cosine transform (DCT) upsampling on a second block of a predetermined size in the reconstructed frame corresponding to a first block in an enhancement layer frame ; means for calculating a difference between the first block and a third block generated by the DCT upsampling ; and means for encoding the difference .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (determined size, video encoder) information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20060120448A1 CLAIM 1 . A method for encoding a multi-layer video comprising : encoding and reconstructing a base layer frame ; performing discrete cosine transform (DCT) upsampling on a second block of a predetermined size (second subdivision, second subset, second subdivision information) in the reconstructed frame corresponding to a first block in an enhancement layer frame ; calculating a difference between the first block and a third block generated by the performing of the DCT upsampling ; and encoding the difference . US20060120448A1 CLAIM 17 . A multi-layered video encoder (second subdivision, second subset, second subdivision information) comprising : means for encoding and reconstructing a base layer frame ; means for performing discrete cosine transform (DCT) upsampling on a second block of a predetermined size in the reconstructed frame corresponding to a first block in an enhancement layer frame ; means for calculating a difference between the first block and a third block generated by the DCT upsampling ; and means for encoding the difference .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (determined size, video encoder) information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20060120448A1 CLAIM 1 . A method for encoding a multi-layer video comprising : encoding and reconstructing a base layer frame ; performing discrete cosine transform (DCT) upsampling on a second block of a predetermined size (second subdivision, second subset, second subdivision information) in the reconstructed frame corresponding to a first block in an enhancement layer frame ; calculating a difference between the first block and a third block generated by the performing of the DCT upsampling ; and encoding the difference . US20060120448A1 CLAIM 17 . A multi-layered video encoder (second subdivision, second subset, second subdivision information) comprising : means for encoding and reconstructing a base layer frame ; means for performing discrete cosine transform (DCT) upsampling on a second block of a predetermined size in the reconstructed frame corresponding to a first block in an enhancement layer frame ; means for calculating a difference between the first block and a third block generated by the DCT upsampling ; and means for encoding the difference .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (determined size, video encoder) information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20060120448A1 CLAIM 1 . A method for encoding a multi-layer video comprising : encoding and reconstructing a base layer frame ; performing discrete cosine transform (DCT) upsampling on a second block of a predetermined size (second subdivision, second subset, second subdivision information) in the reconstructed frame corresponding to a first block in an enhancement layer frame ; calculating a difference between the first block and a third block generated by the performing of the DCT upsampling ; and encoding the difference . US20060120448A1 CLAIM 17 . A multi-layered video encoder (second subdivision, second subset, second subdivision information) comprising : means for encoding and reconstructing a base layer frame ; means for performing discrete cosine transform (DCT) upsampling on a second block of a predetermined size in the reconstructed frame corresponding to a first block in an enhancement layer frame ; means for calculating a difference between the first block and a third block generated by the DCT upsampling ; and means for encoding the difference .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20060120454A1 Filed: 2005-11-29 Issued: 2006-06-08 Method and apparatus for encoding/decoding video signal using motion vectors of pictures in base layer (Original Assignee) LG Electronics Inc (Current Assignee) LG Electronics Inc Seung Park, Ji Park, Byeong Jeon
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (video frame) information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision (video frame) information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20060120454A1 CLAIM 12 . A method for receiving and decoding both a bitstream of a first layer including a sequence of H frames , each including pixels having difference values , and a sequence of L frames and a bitstream of a second layer into a video signal , the method comprising : decoding the bitstream of the first layer into video frame (second subdivision, first subdivision) s having original images according to a scalable scheme using encoding information including motion vector information extracted and provided from the bitstream of the second layer , decoding the bitstream of the first layer into the video frames including a process for obtaining a motion vector of a target block present in an arbitrary frame in the H frame sequence using a motion vector of a first block present in a first auxiliary frame at a position corresponding to the target block , the first auxiliary frame being present in the bitstream of the second layer and temporally separated from the arbitrary frame , and restoring difference values of pixels of the target block to original images based on pixel values of a reference block in an L frame , the reference block being indicated by the obtained motion vector of the target block .
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset (pixel value) of the second set of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	US20060120454A1 CLAIM 12 . A method for receiving and decoding both a bitstream of a first layer including a sequence of H frames , each including pixels having difference values , and a sequence of L frames and a bitstream of a second layer into a video signal , the method comprising : decoding the bitstream of the first layer into video frames having original images according to a scalable scheme using encoding information including motion vector information extracted and provided from the bitstream of the second layer , decoding the bitstream of the first layer into the video frames including a process for obtaining a motion vector of a target block present in an arbitrary frame in the H frame sequence using a motion vector of a first block present in a first auxiliary frame at a position corresponding to the target block , the first auxiliary frame being present in the bitstream of the second layer and temporally separated from the arbitrary frame , and restoring difference values of pixels of the target block to original images based on pixel value (neighboring subset) s of a reference block in an L frame , the reference block being indicated by the obtained motion vector of the target block .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision (video frame) information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20060120454A1 CLAIM 12 . A method for receiving and decoding both a bitstream of a first layer including a sequence of H frames , each including pixels having difference values , and a sequence of L frames and a bitstream of a second layer into a video signal , the method comprising : decoding the bitstream of the first layer into video frame (second subdivision, first subdivision) s having original images according to a scalable scheme using encoding information including motion vector information extracted and provided from the bitstream of the second layer , decoding the bitstream of the first layer into the video frames including a process for obtaining a motion vector of a target block present in an arbitrary frame in the H frame sequence using a motion vector of a first block present in a first auxiliary frame at a position corresponding to the target block , the first auxiliary frame being present in the bitstream of the second layer and temporally separated from the arbitrary frame , and restoring difference values of pixels of the target block to original images based on pixel values of a reference block in an L frame , the reference block being indicated by the obtained motion vector of the target block .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision (video frame) information includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level is sub-divided .	US20060120454A1 CLAIM 12 . A method for receiving and decoding both a bitstream of a first layer including a sequence of H frames , each including pixels having difference values , and a sequence of L frames and a bitstream of a second layer into a video signal , the method comprising : decoding the bitstream of the first layer into video frame (second subdivision, first subdivision) s having original images according to a scalable scheme using encoding information including motion vector information extracted and provided from the bitstream of the second layer , decoding the bitstream of the first layer into the video frames including a process for obtaining a motion vector of a target block present in an arbitrary frame in the H frame sequence using a motion vector of a first block present in a first auxiliary frame at a position corresponding to the target block , the first auxiliary frame being present in the bitstream of the second layer and temporally separated from the arbitrary frame , and restoring difference values of pixels of the target block to original images based on pixel values of a reference block in an L frame , the reference block being indicated by the obtained motion vector of the target block .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision (video frame) information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20060120454A1 CLAIM 12 . A method for receiving and decoding both a bitstream of a first layer including a sequence of H frames , each including pixels having difference values , and a sequence of L frames and a bitstream of a second layer into a video signal , the method comprising : decoding the bitstream of the first layer into video frame (second subdivision, first subdivision) s having original images according to a scalable scheme using encoding information including motion vector information extracted and provided from the bitstream of the second layer , decoding the bitstream of the first layer into the video frames including a process for obtaining a motion vector of a target block present in an arbitrary frame in the H frame sequence using a motion vector of a first block present in a first auxiliary frame at a position corresponding to the target block , the first auxiliary frame being present in the bitstream of the second layer and temporally separated from the arbitrary frame , and restoring difference values of pixels of the target block to original images based on pixel values of a reference block in an L frame , the reference block being indicated by the obtained motion vector of the target block .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (video frame) information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision (video frame) information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20060120454A1 CLAIM 12 . A method for receiving and decoding both a bitstream of a first layer including a sequence of H frames , each including pixels having difference values , and a sequence of L frames and a bitstream of a second layer into a video signal , the method comprising : decoding the bitstream of the first layer into video frame (second subdivision, first subdivision) s having original images according to a scalable scheme using encoding information including motion vector information extracted and provided from the bitstream of the second layer , decoding the bitstream of the first layer into the video frames including a process for obtaining a motion vector of a target block present in an arbitrary frame in the H frame sequence using a motion vector of a first block present in a first auxiliary frame at a position corresponding to the target block , the first auxiliary frame being present in the bitstream of the second layer and temporally separated from the arbitrary frame , and restoring difference values of pixels of the target block to original images based on pixel values of a reference block in an L frame , the reference block being indicated by the obtained motion vector of the target block .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision (video frame) information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (video frame) information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20060120454A1 CLAIM 12 . A method for receiving and decoding both a bitstream of a first layer including a sequence of H frames , each including pixels having difference values , and a sequence of L frames and a bitstream of a second layer into a video signal , the method comprising : decoding the bitstream of the first layer into video frame (second subdivision, first subdivision) s having original images according to a scalable scheme using encoding information including motion vector information extracted and provided from the bitstream of the second layer , decoding the bitstream of the first layer into the video frames including a process for obtaining a motion vector of a target block present in an arbitrary frame in the H frame sequence using a motion vector of a first block present in a first auxiliary frame at a position corresponding to the target block , the first auxiliary frame being present in the bitstream of the second layer and temporally separated from the arbitrary frame , and restoring difference values of pixels of the target block to original images based on pixel values of a reference block in an L frame , the reference block being indicated by the obtained motion vector of the target block .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision (video frame) information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (video frame) information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20060120454A1 CLAIM 12 . A method for receiving and decoding both a bitstream of a first layer including a sequence of H frames , each including pixels having difference values , and a sequence of L frames and a bitstream of a second layer into a video signal , the method comprising : decoding the bitstream of the first layer into video frame (second subdivision, first subdivision) s having original images according to a scalable scheme using encoding information including motion vector information extracted and provided from the bitstream of the second layer , decoding the bitstream of the first layer into the video frames including a process for obtaining a motion vector of a target block present in an arbitrary frame in the H frame sequence using a motion vector of a first block present in a first auxiliary frame at a position corresponding to the target block , the first auxiliary frame being present in the bitstream of the second layer and temporally separated from the arbitrary frame , and restoring difference values of pixels of the target block to original images based on pixel values of a reference block in an L frame , the reference block being indicated by the obtained motion vector of the target block .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	EP1696674A2 Filed: 2005-11-18 Issued: 2006-08-30 Color image encoding and decoding method and apparatus using a correlation between chrominance components (Original Assignee) Samsung Electronics Co Ltd (Current Assignee) Samsung Electronics Co Ltd So-Young Kim, Jeong-Hoon Park, Sang-Rae Lee, Seung-Ran Park, Yu-Mi Sohn
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream (entropy decoding) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (determined size, entropy coding) information , and a maximum hierarchy level wherein the first maximum region (components a) size and the first subdivision (determined order) information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	EP1696674A2 CLAIM 1 An encoding apparatus comprising : a chrominance component transformer (330) which generates a plurality of conversion values by multiplying chrominance components Cb and Cr of color video by predetermined coefficients and combining multiplication results , selects two of the conversion values having lowest costs calculated by a predetermined cost function , and outputs the two conversion values which are selected ; and an entropy coder (314) performing entropy coding (second subdivision, second subset, second subdivision information, intermediate subdivision) on the two conversion values . EP1696674A2 CLAIM 30 The encoding apparatus of any one of claims 26-29 , wherein inter-prediction mode information for the plurality of blocks of the predetermined group is classified into a plurality of mode planes in each mode , the plurality of mode planes are arranged in a determined order (first subdivision, first subdivision information, program code) , information on a next mode plane is transformed based on mode information on a previous mode plane , and the transformed mode plane is coded . EP1696674A2 CLAIM 35 The encoding apparatus of any one of claims 25-34 , wherein the chrominance components a (first maximum region) re Cb and Cr which are pre-transformed and pre-quantized . EP1696674A2 CLAIM 57 A decoding apparatus for decoding an encoded color image , the decoding apparatus comprising : an entropy decoder (702) which entropy decodes an input bitstream ; and a chrominance component inverse transformer (710) which recovers original chrominance components based on inter-prediction mode information applied to a current block having a predetermined size (second subdivision, second subset, second subdivision information, intermediate subdivision) , the inter-prediction mode information being extracted from the input bitstream , wherein the inter-prediction mode information indicates an inter-prediction mode which selected from among at least two inter-prediction modes and is applied to the current block , and the original chrominance components are obtained from conversion values corresponding to the inter-prediction mode applied to the current block . EP1696674A2 CLAIM 70 A decoding method for decoding a color image , the decoding method comprising : entropy decoding (data stream) an input bitstream ; and recovering original chrominance components based on inter-prediction mode information applied to a current block having a predetermined size , the inter-prediction mode information being extracted from the input bitstream , wherein the inter-prediction mode information indicates an inter-prediction mode which is selected from among at least two inter-prediction modes and is applied to the current block , and the original chrominance components are obtained from conversion values corresponding to the inter-prediction mode applied to the current block .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set of root regions such that the first set of root regions are rectangular blocks (motion prediction) of a size determined by the first maximum region (components a) size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	EP1696674A2 CLAIM 12 The encoding method of any one of claims 9-11 , further comprising performing motion prediction (rectangular blocks) and motion compensation for inter-prediction . EP1696674A2 CLAIM 35 The encoding apparatus of any one of claims 25-34 , wherein the chrominance components a (first maximum region) re Cb and Cr which are pre-transformed and pre-quantized .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision (determined order) information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	EP1696674A2 CLAIM 30 The encoding apparatus of any one of claims 26-29 , wherein inter-prediction mode information for the plurality of blocks of the predetermined group is classified into a plurality of mode planes in each mode , the plurality of mode planes are arranged in a determined order (first subdivision, first subdivision information, program code) , information on a next mode plane is transformed based on mode information on a previous mode plane , and the transformed mode plane is coded .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision (determined order) information includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level is sub-divided .	EP1696674A2 CLAIM 30 The encoding apparatus of any one of claims 26-29 , wherein inter-prediction mode information for the plurality of blocks of the predetermined group is classified into a plurality of mode planes in each mode , the plurality of mode planes are arranged in a determined order (first subdivision, first subdivision information, program code) , information on a next mode plane is transformed based on mode information on a previous mode plane , and the transformed mode plane is coded .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level from the data stream (entropy decoding) .	EP1696674A2 CLAIM 70 A decoding method for decoding a color image , the decoding method comprising : entropy decoding (data stream) an input bitstream ; and recovering original chrominance components based on inter-prediction mode information applied to a current block having a predetermined size , the inter-prediction mode information being extracted from the input bitstream , wherein the inter-prediction mode information indicates an inter-prediction mode which is selected from among at least two inter-prediction modes and is applied to the current block , and the original chrominance components are obtained from conversion values corresponding to the inter-prediction mode applied to the current block .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements associated with the first or second set of sub-regions from the data stream (entropy decoding) in a depth-first traversal order .	EP1696674A2 CLAIM 70 A decoding method for decoding a color image , the decoding method comprising : entropy decoding (data stream) an input bitstream ; and recovering original chrominance components based on inter-prediction mode information applied to a current block having a predetermined size , the inter-prediction mode information being extracted from the input bitstream , wherein the inter-prediction mode information indicates an inter-prediction mode which is selected from among at least two inter-prediction modes and is applied to the current block , and the original chrominance components are obtained from conversion values corresponding to the inter-prediction mode applied to the current block .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream (entropy decoding) , disjoint from a second subset (determined size, entropy coding) of syntax elements of the data stream including the first subdivision (determined order) information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision (determined size, entropy coding) of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	EP1696674A2 CLAIM 1 An encoding apparatus comprising : a chrominance component transformer (330) which generates a plurality of conversion values by multiplying chrominance components Cb and Cr of color video by predetermined coefficients and combining multiplication results , selects two of the conversion values having lowest costs calculated by a predetermined cost function , and outputs the two conversion values which are selected ; and an entropy coder (314) performing entropy coding (second subdivision, second subset, second subdivision information, intermediate subdivision) on the two conversion values . EP1696674A2 CLAIM 30 The encoding apparatus of any one of claims 26-29 , wherein inter-prediction mode information for the plurality of blocks of the predetermined group is classified into a plurality of mode planes in each mode , the plurality of mode planes are arranged in a determined order (first subdivision, first subdivision information, program code) , information on a next mode plane is transformed based on mode information on a previous mode plane , and the transformed mode plane is coded . EP1696674A2 CLAIM 57 A decoding apparatus for decoding an encoded color image , the decoding apparatus comprising : an entropy decoder (702) which entropy decodes an input bitstream ; and a chrominance component inverse transformer (710) which recovers original chrominance components based on inter-prediction mode information applied to a current block having a predetermined size (second subdivision, second subset, second subdivision information, intermediate subdivision) , the inter-prediction mode information being extracted from the input bitstream , wherein the inter-prediction mode information indicates an inter-prediction mode which selected from among at least two inter-prediction modes and is applied to the current block , and the original chrominance components are obtained from conversion values corresponding to the inter-prediction mode applied to the current block . EP1696674A2 CLAIM 70 A decoding method for decoding a color image , the decoding method comprising : entropy decoding (data stream) an input bitstream ; and recovering original chrominance components based on inter-prediction mode information applied to a current block having a predetermined size , the inter-prediction mode information being extracted from the input bitstream , wherein the inter-prediction mode information indicates an inter-prediction mode which is selected from among at least two inter-prediction modes and is applied to the current block , and the original chrominance components are obtained from conversion values corresponding to the inter-prediction mode applied to the current block .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream (entropy decoding) , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	EP1696674A2 CLAIM 70 A decoding method for decoding a color image , the decoding method comprising : entropy decoding (data stream) an input bitstream ; and recovering original chrominance components based on inter-prediction mode information applied to a current block having a predetermined size , the inter-prediction mode information being extracted from the input bitstream , wherein the inter-prediction mode information indicates an inter-prediction mode which is selected from among at least two inter-prediction modes and is applied to the current block , and the original chrominance components are obtained from conversion values corresponding to the inter-prediction mode applied to the current block .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream (entropy decoding) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (determined size, entropy coding) information , and a maximum hierarchy level , wherein the first maximum region (components a) size and the first subdivision (determined order) information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	EP1696674A2 CLAIM 1 An encoding apparatus comprising : a chrominance component transformer (330) which generates a plurality of conversion values by multiplying chrominance components Cb and Cr of color video by predetermined coefficients and combining multiplication results , selects two of the conversion values having lowest costs calculated by a predetermined cost function , and outputs the two conversion values which are selected ; and an entropy coder (314) performing entropy coding (second subdivision, second subset, second subdivision information, intermediate subdivision) on the two conversion values . EP1696674A2 CLAIM 30 The encoding apparatus of any one of claims 26-29 , wherein inter-prediction mode information for the plurality of blocks of the predetermined group is classified into a plurality of mode planes in each mode , the plurality of mode planes are arranged in a determined order (first subdivision, first subdivision information, program code) , information on a next mode plane is transformed based on mode information on a previous mode plane , and the transformed mode plane is coded . EP1696674A2 CLAIM 35 The encoding apparatus of any one of claims 25-34 , wherein the chrominance components a (first maximum region) re Cb and Cr which are pre-transformed and pre-quantized . EP1696674A2 CLAIM 57 A decoding apparatus for decoding an encoded color image , the decoding apparatus comprising : an entropy decoder (702) which entropy decodes an input bitstream ; and a chrominance component inverse transformer (710) which recovers original chrominance components based on inter-prediction mode information applied to a current block having a predetermined size (second subdivision, second subset, second subdivision information, intermediate subdivision) , the inter-prediction mode information being extracted from the input bitstream , wherein the inter-prediction mode information indicates an inter-prediction mode which selected from among at least two inter-prediction modes and is applied to the current block , and the original chrominance components are obtained from conversion values corresponding to the inter-prediction mode applied to the current block . EP1696674A2 CLAIM 70 A decoding method for decoding a color image , the decoding method comprising : entropy decoding (data stream) an input bitstream ; and recovering original chrominance components based on inter-prediction mode information applied to a current block having a predetermined size , the inter-prediction mode information being extracted from the input bitstream , wherein the inter-prediction mode information indicates an inter-prediction mode which is selected from among at least two inter-prediction modes and is applied to the current block , and the original chrominance components are obtained from conversion values corresponding to the inter-prediction mode applied to the current block .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region (components a) size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision (determined order) information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (determined size, entropy coding) information and a maximum hierarchy level ; and a data stream (entropy decoding) generator (absolute difference) configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	EP1696674A2 CLAIM 1 An encoding apparatus comprising : a chrominance component transformer (330) which generates a plurality of conversion values by multiplying chrominance components Cb and Cr of color video by predetermined coefficients and combining multiplication results , selects two of the conversion values having lowest costs calculated by a predetermined cost function , and outputs the two conversion values which are selected ; and an entropy coder (314) performing entropy coding (second subdivision, second subset, second subdivision information, intermediate subdivision) on the two conversion values . EP1696674A2 CLAIM 6 The encoding apparatus of any preceding claim , wherein the predetermined cost function is one of a rate-distortion cost function , a sum of absolute difference (data stream generator) value function , a sum of absolute transformed difference function , a sum of squared difference function , and a mean of absolute difference function . EP1696674A2 CLAIM 30 The encoding apparatus of any one of claims 26-29 , wherein inter-prediction mode information for the plurality of blocks of the predetermined group is classified into a plurality of mode planes in each mode , the plurality of mode planes are arranged in a determined order (first subdivision, first subdivision information, program code) , information on a next mode plane is transformed based on mode information on a previous mode plane , and the transformed mode plane is coded . EP1696674A2 CLAIM 35 The encoding apparatus of any one of claims 25-34 , wherein the chrominance components a (first maximum region) re Cb and Cr which are pre-transformed and pre-quantized . EP1696674A2 CLAIM 57 A decoding apparatus for decoding an encoded color image , the decoding apparatus comprising : an entropy decoder (702) which entropy decodes an input bitstream ; and a chrominance component inverse transformer (710) which recovers original chrominance components based on inter-prediction mode information applied to a current block having a predetermined size (second subdivision, second subset, second subdivision information, intermediate subdivision) , the inter-prediction mode information being extracted from the input bitstream , wherein the inter-prediction mode information indicates an inter-prediction mode which selected from among at least two inter-prediction modes and is applied to the current block , and the original chrominance components are obtained from conversion values corresponding to the inter-prediction mode applied to the current block . EP1696674A2 CLAIM 70 A decoding method for decoding a color image , the decoding method comprising : entropy decoding (data stream) an input bitstream ; and recovering original chrominance components based on inter-prediction mode information applied to a current block having a predetermined size , the inter-prediction mode information being extracted from the input bitstream , wherein the inter-prediction mode information indicates an inter-prediction mode which is selected from among at least two inter-prediction modes and is applied to the current block , and the original chrominance components are obtained from conversion values corresponding to the inter-prediction mode applied to the current block .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region (components a) size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision (determined order) information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (determined size, entropy coding) information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream (entropy decoding) the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	EP1696674A2 CLAIM 1 An encoding apparatus comprising : a chrominance component transformer (330) which generates a plurality of conversion values by multiplying chrominance components Cb and Cr of color video by predetermined coefficients and combining multiplication results , selects two of the conversion values having lowest costs calculated by a predetermined cost function , and outputs the two conversion values which are selected ; and an entropy coder (314) performing entropy coding (second subdivision, second subset, second subdivision information, intermediate subdivision) on the two conversion values . EP1696674A2 CLAIM 30 The encoding apparatus of any one of claims 26-29 , wherein inter-prediction mode information for the plurality of blocks of the predetermined group is classified into a plurality of mode planes in each mode , the plurality of mode planes are arranged in a determined order (first subdivision, first subdivision information, program code) , information on a next mode plane is transformed based on mode information on a previous mode plane , and the transformed mode plane is coded . EP1696674A2 CLAIM 35 The encoding apparatus of any one of claims 25-34 , wherein the chrominance components a (first maximum region) re Cb and Cr which are pre-transformed and pre-quantized . EP1696674A2 CLAIM 57 A decoding apparatus for decoding an encoded color image , the decoding apparatus comprising : an entropy decoder (702) which entropy decodes an input bitstream ; and a chrominance component inverse transformer (710) which recovers original chrominance components based on inter-prediction mode information applied to a current block having a predetermined size (second subdivision, second subset, second subdivision information, intermediate subdivision) , the inter-prediction mode information being extracted from the input bitstream , wherein the inter-prediction mode information indicates an inter-prediction mode which selected from among at least two inter-prediction modes and is applied to the current block , and the original chrominance components are obtained from conversion values corresponding to the inter-prediction mode applied to the current block . EP1696674A2 CLAIM 70 A decoding method for decoding a color image , the decoding method comprising : entropy decoding (data stream) an input bitstream ; and recovering original chrominance components based on inter-prediction mode information applied to a current block having a predetermined size , the inter-prediction mode information being extracted from the input bitstream , wherein the inter-prediction mode information indicates an inter-prediction mode which is selected from among at least two inter-prediction modes and is applied to the current block , and the original chrominance components are obtained from conversion values corresponding to the inter-prediction mode applied to the current block .
US10250913B2 CLAIM 15 . A non-transitory computer readable digital storage medium having stored thereon a computer program (computer program) having a program code (determined order) for performing , when running on a computer , a method according to claim 12 .	EP1696674A2 CLAIM 30 The encoding apparatus of any one of claims 26-29 , wherein inter-prediction mode information for the plurality of blocks of the predetermined group is classified into a plurality of mode planes in each mode , the plurality of mode planes are arranged in a determined order (first subdivision, first subdivision information, program code) , information on a next mode plane is transformed based on mode information on a previous mode plane , and the transformed mode plane is coded . EP1696674A2 CLAIM 83 A computer-readable recording medium having embodied thereon a computer program (computer program) for performing an encoding method , the encoding method comprising : generating a plurality of conversion values by multiplying chrominance components Cb and Cr of color video by predetermined coefficients and combining multiplication results ; selecting two of the conversion values having lowest costs calculated by a predetermined cost function ; and performing entropy coding on the two conversion values which are selected .
US10250913B2 CLAIM 16 . A non-transitory computer readable digital storage medium having stored thereon a computer program (computer program) having a program code (determined order) for performing , when running on a computer , a method according to claim 14 .	EP1696674A2 CLAIM 30 The encoding apparatus of any one of claims 26-29 , wherein inter-prediction mode information for the plurality of blocks of the predetermined group is classified into a plurality of mode planes in each mode , the plurality of mode planes are arranged in a determined order (first subdivision, first subdivision information, program code) , information on a next mode plane is transformed based on mode information on a previous mode plane , and the transformed mode plane is coded . EP1696674A2 CLAIM 83 A computer-readable recording medium having embodied thereon a computer program (computer program) for performing an encoding method , the encoding method comprising : generating a plurality of conversion values by multiplying chrominance components Cb and Cr of color video by predetermined coefficients and combining multiplication results ; selecting two of the conversion values having lowest costs calculated by a predetermined cost function ; and performing entropy coding on the two conversion values which are selected .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20090147866A1 Filed: 2005-11-18 Issued: 2009-06-11 Communication apparatus, communication system, and communication method (Original Assignee) Panasonic Corp (Current Assignee) INVT SPE LLC Xiaoming She, Jifeng Li
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information (determined time) , information related to first and second maximum region sizes , first and second subdivision information (frequency axis) , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information (time domain) are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples (determined time) representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding (estimation result) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20090147866A1 CLAIM 1 . A communication apparatus comprising : a channel estimating section that carries out channel estimation per subband ; a parameter deciding section that decides modulation parameters and coding parameters per subband group comprised of a plurality of subbands based on the channel estimation result (information samples using prediction coding) ; a parameter information transmission section that transmits to a communicating party , parameter information that is information for the modulation parameters and the coding parameters decided at the parameter deciding section ; a receiving section that receives a received signal containing data modulated and encoded per subband group at a communicating party using the modulation parameters and coding parameters of the parameter information transmitted at the parameter information transmission section ; and a data obtaining section that demodulates and decodes the received signal received at the receiving section per subband group using the modulation parameters and coding parameters decided at the parameter deciding section and obtains the data contained in the received signal . US20090147866A1 CLAIM 3 . The communication apparatus of claim 2 , wherein the parameter deciding section decides the modulation parameters and the coding parameters per subband group constituted from the patterns for selecting a plurality of subbands neighboring on the frequency axis (second subdivision information) . US20090147866A1 CLAIM 5 . The communication apparatus of claim 2 , wherein the parameter deciding section decides the modulation parameters and the coding parameters per subband group constituted from the patterns selecting all subbands per predetermined time (video information, information samples) domain .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples (determined time) into the first set of root regions such that the first set of root regions are rectangular blocks of a size determined by the first maximum region size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	US20090147866A1 CLAIM 5 . The communication apparatus of claim 2 , wherein the parameter deciding section decides the modulation parameters and the coding parameters per subband group constituted from the patterns selecting all subbands per predetermined time (video information, information samples) domain .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information (time domain) indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule (coding data) associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20090147866A1 CLAIM 5 . The communication apparatus of claim 2 , wherein the parameter deciding section decides the modulation parameters and the coding parameters per subband group constituted from the patterns selecting all subbands per predetermined time domain (first subdivision information) . US20090147866A1 CLAIM 11 . A communication method comprising the steps of : carrying out channel estimation per subband ; deciding modulation parameters and coding parameters per subband group comprised of a plurality of subbands based on the channel estimation results ; at a communication terminal apparatus , transmitting parameter information that is information for the decided modulation parameters and coding parameters ; at a base station apparatus , receiving the parameter information transmitted by the communication terminal apparatus ; modulating and coding data (partition rule) in accordance with the modulation parameters and the coding parameters of the received parameter information ; at the base station apparatus , transmitting the modulated and encoded data ; at the communication terminal apparatus , receiving a received signal containing the data transmitted by the base station apparatus ; and modulating and decoding the received signal per subband group using the modulation parameters and the coding parameters of the parameter information , and extracting data contained in the received signal .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision information (time domain) includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level is sub-divided .	US20090147866A1 CLAIM 5 . The communication apparatus of claim 2 , wherein the parameter deciding section decides the modulation parameters and the coding parameters per subband group constituted from the patterns selecting all subbands per predetermined time domain (first subdivision information) .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision information (time domain) , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples (determined time) , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20090147866A1 CLAIM 5 . The communication apparatus of claim 2 , wherein the parameter deciding section decides the modulation parameters and the coding parameters per subband group constituted from the patterns selecting all subbands per predetermined time (video information, information samples) domain .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples (determined time) from the data stream , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	US20090147866A1 CLAIM 5 . The communication apparatus of claim 2 , wherein the parameter deciding section decides the modulation parameters and the coding parameters per subband group constituted from the patterns selecting all subbands per predetermined time (video information, information samples) domain .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information (determined time) , information related to first and second maximum region sizes , first and second subdivision information (frequency axis) , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information (time domain) are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples (determined time) representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding (estimation result) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20090147866A1 CLAIM 1 . A communication apparatus comprising : a channel estimating section that carries out channel estimation per subband ; a parameter deciding section that decides modulation parameters and coding parameters per subband group comprised of a plurality of subbands based on the channel estimation result (information samples using prediction coding) ; a parameter information transmission section that transmits to a communicating party , parameter information that is information for the modulation parameters and the coding parameters decided at the parameter deciding section ; a receiving section that receives a received signal containing data modulated and encoded per subband group at a communicating party using the modulation parameters and coding parameters of the parameter information transmitted at the parameter information transmission section ; and a data obtaining section that demodulates and decodes the received signal received at the receiving section per subband group using the modulation parameters and coding parameters decided at the parameter deciding section and obtains the data contained in the received signal . US20090147866A1 CLAIM 3 . The communication apparatus of claim 2 , wherein the parameter deciding section decides the modulation parameters and the coding parameters per subband group constituted from the patterns for selecting a plurality of subbands neighboring on the frequency axis (second subdivision information) . US20090147866A1 CLAIM 5 . The communication apparatus of claim 2 , wherein the parameter deciding section decides the modulation parameters and the coding parameters per subband group constituted from the patterns selecting all subbands per predetermined time (video information, information samples) domain .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples (determined time) representing a spatially sampled portion of video information (determined time) into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information (time domain) , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information (frequency axis) and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding (estimation result) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20090147866A1 CLAIM 1 . A communication apparatus comprising : a channel estimating section that carries out channel estimation per subband ; a parameter deciding section that decides modulation parameters and coding parameters per subband group comprised of a plurality of subbands based on the channel estimation result (information samples using prediction coding) ; a parameter information transmission section that transmits to a communicating party , parameter information that is information for the modulation parameters and the coding parameters decided at the parameter deciding section ; a receiving section that receives a received signal containing data modulated and encoded per subband group at a communicating party using the modulation parameters and coding parameters of the parameter information transmitted at the parameter information transmission section ; and a data obtaining section that demodulates and decodes the received signal received at the receiving section per subband group using the modulation parameters and coding parameters decided at the parameter deciding section and obtains the data contained in the received signal . US20090147866A1 CLAIM 3 . The communication apparatus of claim 2 , wherein the parameter deciding section decides the modulation parameters and the coding parameters per subband group constituted from the patterns for selecting a plurality of subbands neighboring on the frequency axis (second subdivision information) . US20090147866A1 CLAIM 5 . The communication apparatus of claim 2 , wherein the parameter deciding section decides the modulation parameters and the coding parameters per subband group constituted from the patterns selecting all subbands per predetermined time (video information, information samples) domain .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples (determined time) representing a spatially sampled portion of video information (determined time) into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information (time domain) ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information (frequency axis) and a maximum hierarchy level ; encoding the array of information samples using prediction coding (estimation result) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20090147866A1 CLAIM 1 . A communication apparatus comprising : a channel estimating section that carries out channel estimation per subband ; a parameter deciding section that decides modulation parameters and coding parameters per subband group comprised of a plurality of subbands based on the channel estimation result (information samples using prediction coding) ; a parameter information transmission section that transmits to a communicating party , parameter information that is information for the modulation parameters and the coding parameters decided at the parameter deciding section ; a receiving section that receives a received signal containing data modulated and encoded per subband group at a communicating party using the modulation parameters and coding parameters of the parameter information transmitted at the parameter information transmission section ; and a data obtaining section that demodulates and decodes the received signal received at the receiving section per subband group using the modulation parameters and coding parameters decided at the parameter deciding section and obtains the data contained in the received signal . US20090147866A1 CLAIM 3 . The communication apparatus of claim 2 , wherein the parameter deciding section decides the modulation parameters and the coding parameters per subband group constituted from the patterns for selecting a plurality of subbands neighboring on the frequency axis (second subdivision information) . US20090147866A1 CLAIM 5 . The communication apparatus of claim 2 , wherein the parameter deciding section decides the modulation parameters and the coding parameters per subband group constituted from the patterns selecting all subbands per predetermined time (video information, information samples) domain .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20090304090A1 Filed: 2005-09-29 Issued: 2009-12-10 Method for Scalable Video Coding (Original Assignee) Telecom Italia SpA (Current Assignee) Telecom Italia SpA Giovanni Cordara, Gianluca Francini, Skjalg Lepsoy
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set (following steps) of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20090304090A1 CLAIM 29 . The method according to claim 28 , wherein the step of filtering and sub-sampling comprises the following steps (second set) : low-pass filtering along the rows ; sub-sampling the columns ; low-pass filtering along the columns ; and sub-sampling the rows .
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset of the second set (following steps) of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle (comprising two) .	US20090304090A1 CLAIM 25 . The method according to claim 23 , wherein , taking into account two photograms g t and g t+1 at following instants t and t+1 at the generic resolution level K−m , the term designating the approximation error can be expressed as : F 1 (q)=∥ A K−m q −(M (g t , u 0 , v 0)− g t+1)∥ 2 , where : u 0 and v 0 are the horizontal and vertical components of the initial motion field , A k−m is a matrix comprising two (next intra-prediction cycle) diagonal sub-matrixes containing space derivatives of photogram g t+1 , expressed as A K−m =[diag(g t+1 (x))diag(g t+1 (y))] , and M is a motion operator adapted to distort a generic photogram g in the following way : M (g , u , v)(x , y)= g (x−u (x , y) , y−v (x , y)) . US20090304090A1 CLAIM 29 . The method according to claim 28 , wherein the step of filtering and sub-sampling comprises the following steps (second set) : low-pass filtering along the rows ; sub-sampling the columns ; low-pass filtering along the columns ; and sub-sampling the rows .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements (video coding) associated with the first or second set (following steps) of sub-regions from the data stream in a depth-first traversal order .	US20090304090A1 CLAIM 18 . A method for a scalable video coding (syntax elements) , comprising the step of estimating a motion field (p) of a sequence of photograms (f 1 , f 2 , . . . , f T) which can be represented with a plurality of space resolution levels (K , . . . , K−m , . . . , K−M) included between a minimum resolution level (K−M) and a maximum resolution level (K) , wherein the step of estimating the motion field comprises the step of computing the motion field for each one of said space resolution levels by the minimization of a function , wherein , for each level which is different from the minimum space resolution level , said function comprises a regularization term between levels which represents a difference between the solution of said minimization for the considered level and the solution of said minimization for the space resolution level which is immediately lower than the considered level . US20090304090A1 CLAIM 29 . The method according to claim 28 , wherein the step of filtering and sub-sampling comprises the following steps (second set) : low-pass filtering along the rows ; sub-sampling the columns ; low-pass filtering along the columns ; and sub-sampling the rows .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements (video coding) of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20090304090A1 CLAIM 18 . A method for a scalable video coding (syntax elements) , comprising the step of estimating a motion field (p) of a sequence of photograms (f 1 , f 2 , . . . , f T) which can be represented with a plurality of space resolution levels (K , . . . , K−m , . . . , K−M) included between a minimum resolution level (K−M) and a maximum resolution level (K) , wherein the step of estimating the motion field comprises the step of computing the motion field for each one of said space resolution levels by the minimization of a function , wherein , for each level which is different from the minimum space resolution level , said function comprises a regularization term between levels which represents a difference between the solution of said minimization for the considered level and the solution of said minimization for the space resolution level which is immediately lower than the considered level .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set (following steps) of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20090304090A1 CLAIM 29 . The method according to claim 28 , wherein the step of filtering and sub-sampling comprises the following steps (second set) : low-pass filtering along the rows ; sub-sampling the columns ; low-pass filtering along the columns ; and sub-sampling the rows .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set (following steps) of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20090304090A1 CLAIM 29 . The method according to claim 28 , wherein the step of filtering and sub-sampling comprises the following steps (second set) : low-pass filtering along the rows ; sub-sampling the columns ; low-pass filtering along the columns ; and sub-sampling the rows .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set (following steps) of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20090304090A1 CLAIM 29 . The method according to claim 28 , wherein the step of filtering and sub-sampling comprises the following steps (second set) : low-pass filtering along the rows ; sub-sampling the columns ; low-pass filtering along the columns ; and sub-sampling the rows .
US10250913B2 CLAIM 15 . A non-transitory computer readable digital storage medium having stored thereon a computer program (computer program) having a program code for performing , when running on a computer , a method according to claim 12 .	US20090304090A1 CLAIM 33 . A computer program (computer program) capable of being directly loaded in a memory of a data processing system and adapted to implement , when run , the method according to claim 18 .
US10250913B2 CLAIM 16 . A non-transitory computer readable digital storage medium having stored thereon a computer program (computer program) having a program code for performing , when running on a computer , a method according to claim 14 .	US20090304090A1 CLAIM 33 . A computer program (computer program) capable of being directly loaded in a memory of a data processing system and adapted to implement , when run , the method according to claim 18 .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	CN1728833A Filed: 2005-07-13 Issued: 2006-02-01 用于可伸缩编码和解码彩色视频的方法和设备 (Original Assignee) 学校法人大洋学园; 三星电子株式会社金海光
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size (一种解码) and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set (在其上记录) of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN1728833A CLAIM 7 . 一种彩色视频解码方法，包括：仅使用图像的亮度分量通过对使用基于运动预测的编码方法而编码的亮度比特流解码，来产生解码的亮度分量；通过对至少一种编码的色度比特流解码，来产生至少一种解码 (first maximum region size) 的色度分量；和通过将解码的亮度分量和该至少一种解码的色度分量相加，来产生至少一种颜色格式的图像。 CN1728833A CLAIM 23 . 一种在其上记录 (second set) 有编码的彩色图象的信息存储介质，包括：编码的亮度比特流，其通过使用基于运动预测的编码方法对图像的亮度分量编码被产生；和至少一种编码的色度比特流，其通过使用由基于运动预测的编码方法所产生的运动矢量对至少一种颜色格式的色度分量编码而被产生。
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset of the second set (在其上记录) of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	CN1728833A CLAIM 23 . 一种在其上记录 (second set) 有编码的彩色图象的信息存储介质，包括：编码的亮度比特流，其通过使用基于运动预测的编码方法对图像的亮度分量编码被产生；和至少一种编码的色度比特流，其通过使用由基于运动预测的编码方法所产生的运动矢量对至少一种颜色格式的色度分量编码而被产生。
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set of root regions such that the first set of root regions are rectangular blocks of a size determined by the first maximum region size (一种解码) , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	CN1728833A CLAIM 7 . 一种彩色视频解码方法，包括：仅使用图像的亮度分量通过对使用基于运动预测的编码方法而编码的亮度比特流解码，来产生解码的亮度分量；通过对至少一种编码的色度比特流解码，来产生至少一种解码 (first maximum region size) 的色度分量；和通过将解码的亮度分量和该至少一种解码的色度分量相加，来产生至少一种颜色格式的图像。
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements associated with the first or second set (在其上记录) of sub-regions from the data stream in a depth-first traversal order .	CN1728833A CLAIM 23 . 一种在其上记录 (second set) 有编码的彩色图象的信息存储介质，包括：编码的亮度比特流，其通过使用基于运动预测的编码方法对图像的亮度分量编码被产生；和至少一种编码的色度比特流，其通过使用由基于运动预测的编码方法所产生的运动矢量对至少一种颜色格式的色度分量编码而被产生。
US10250913B2 CLAIM 11 . The decoder according to claim 1 , wherein the recursive multi-tree partitioning includes a quadtree partitioning (纹理信息) technique .	CN1728833A CLAIM 2 . 根据权利要求1所述的方法，其中，产生编码的亮度比特流的步骤包括：从图像的亮度分量获得运动矢量；和通过多路复用从亮度分量获得的运动矢量和亮度分量纹理信息 (quadtree partitioning) ，来产生亮度比特流，所述亮度分量纹理信息基于从亮度分量获得的运动矢量通过使用基于运动预测的编码方法对亮度分量编码被获得。
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size (一种解码) and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set (在其上记录) of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN1728833A CLAIM 7 . 一种彩色视频解码方法，包括：仅使用图像的亮度分量通过对使用基于运动预测的编码方法而编码的亮度比特流解码，来产生解码的亮度分量；通过对至少一种编码的色度比特流解码，来产生至少一种解码 (first maximum region size) 的色度分量；和通过将解码的亮度分量和该至少一种解码的色度分量相加，来产生至少一种颜色格式的图像。 CN1728833A CLAIM 23 . 一种在其上记录 (second set) 有编码的彩色图象的信息存储介质，包括：编码的亮度比特流，其通过使用基于运动预测的编码方法对图像的亮度分量编码被产生；和至少一种编码的色度比特流，其通过使用由基于运动预测的编码方法所产生的运动矢量对至少一种颜色格式的色度分量编码而被产生。
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size (一种解码) , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set (在其上记录) of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN1728833A CLAIM 7 . 一种彩色视频解码方法，包括：仅使用图像的亮度分量通过对使用基于运动预测的编码方法而编码的亮度比特流解码，来产生解码的亮度分量；通过对至少一种编码的色度比特流解码，来产生至少一种解码 (first maximum region size) 的色度分量；和通过将解码的亮度分量和该至少一种解码的色度分量相加，来产生至少一种颜色格式的图像。 CN1728833A CLAIM 23 . 一种在其上记录 (second set) 有编码的彩色图象的信息存储介质，包括：编码的亮度比特流，其通过使用基于运动预测的编码方法对图像的亮度分量编码被产生；和至少一种编码的色度比特流，其通过使用由基于运动预测的编码方法所产生的运动矢量对至少一种颜色格式的色度分量编码而被产生。
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size (一种解码) ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set (在其上记录) of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN1728833A CLAIM 7 . 一种彩色视频解码方法，包括：仅使用图像的亮度分量通过对使用基于运动预测的编码方法而编码的亮度比特流解码，来产生解码的亮度分量；通过对至少一种编码的色度比特流解码，来产生至少一种解码 (first maximum region size) 的色度分量；和通过将解码的亮度分量和该至少一种解码的色度分量相加，来产生至少一种颜色格式的图像。 CN1728833A CLAIM 23 . 一种在其上记录 (second set) 有编码的彩色图象的信息存储介质，包括：编码的亮度比特流，其通过使用基于运动预测的编码方法对图像的亮度分量编码被产生；和至少一种编码的色度比特流，其通过使用由基于运动预测的编码方法所产生的运动矢量对至少一种颜色格式的色度分量编码而被产生。

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20060013308A1 Filed: 2005-07-12 Issued: 2006-01-19 Method and apparatus for scalably encoding and decoding color video (Original Assignee) Samsung Electronics Co Ltd; Sejong University Industry-Academy Cooperation Group (Current Assignee) Samsung Electronics Co Ltd ; Sejong University Industry-Academy Cooperation Group Hae-Kwang Kim
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream (chrominance components) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region (components a) size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20060013308A1 CLAIM 3 . The method of claim 1 , wherein the generating at least one encoded chrominance bitstream comprises : independently receiving and encoding 4 : 2 : 0 , 4 : 2 : 2 and 4 : 4 : 4 color format chrominance components (data stream) . US20060013308A1 CLAIM 25 . The information storage medium of claim 23 , wherein 4 : 2 : 0 , 4 : 2 : 2 , and 4 : 4 : 4 color format chrominance components a (first maximum region) re independently encoded in the chrominance bitstream .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set of root regions such that the first set of root regions are rectangular blocks of a size determined by the first maximum region (components a) size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	US20060013308A1 CLAIM 25 . The information storage medium of claim 23 , wherein 4 : 2 : 0 , 4 : 2 : 2 , and 4 : 4 : 4 color format chrominance components a (first maximum region) re independently encoded in the chrominance bitstream .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level from the data stream (chrominance components) .	US20060013308A1 CLAIM 3 . The method of claim 1 , wherein the generating at least one encoded chrominance bitstream comprises : independently receiving and encoding 4 : 2 : 0 , 4 : 2 : 2 and 4 : 4 : 4 color format chrominance components (data stream) .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements associated with the first or second set of sub-regions from the data stream (chrominance components) in a depth-first traversal order .	US20060013308A1 CLAIM 3 . The method of claim 1 , wherein the generating at least one encoded chrominance bitstream comprises : independently receiving and encoding 4 : 2 : 0 , 4 : 2 : 2 and 4 : 4 : 4 color format chrominance components (data stream) .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream (chrominance components) , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20060013308A1 CLAIM 3 . The method of claim 1 , wherein the generating at least one encoded chrominance bitstream comprises : independently receiving and encoding 4 : 2 : 0 , 4 : 2 : 2 and 4 : 4 : 4 color format chrominance components (data stream) .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream (chrominance components) , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	US20060013308A1 CLAIM 3 . The method of claim 1 , wherein the generating at least one encoded chrominance bitstream comprises : independently receiving and encoding 4 : 2 : 0 , 4 : 2 : 2 and 4 : 4 : 4 color format chrominance components (data stream) .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream (chrominance components) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region (components a) size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20060013308A1 CLAIM 3 . The method of claim 1 , wherein the generating at least one encoded chrominance bitstream comprises : independently receiving and encoding 4 : 2 : 0 , 4 : 2 : 2 and 4 : 4 : 4 color format chrominance components (data stream) . US20060013308A1 CLAIM 25 . The information storage medium of claim 23 , wherein 4 : 2 : 0 , 4 : 2 : 2 , and 4 : 4 : 4 color format chrominance components a (first maximum region) re independently encoded in the chrominance bitstream .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region (components a) size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream (chrominance components) generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20060013308A1 CLAIM 3 . The method of claim 1 , wherein the generating at least one encoded chrominance bitstream comprises : independently receiving and encoding 4 : 2 : 0 , 4 : 2 : 2 and 4 : 4 : 4 color format chrominance components (data stream) . US20060013308A1 CLAIM 25 . The information storage medium of claim 23 , wherein 4 : 2 : 0 , 4 : 2 : 2 , and 4 : 4 : 4 color format chrominance components a (first maximum region) re independently encoded in the chrominance bitstream .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region (components a) size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream (chrominance components) the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20060013308A1 CLAIM 3 . The method of claim 1 , wherein the generating at least one encoded chrominance bitstream comprises : independently receiving and encoding 4 : 2 : 0 , 4 : 2 : 2 and 4 : 4 : 4 color format chrominance components (data stream) . US20060013308A1 CLAIM 25 . The information storage medium of claim 23 , wherein 4 : 2 : 0 , 4 : 2 : 2 , and 4 : 4 : 4 color format chrominance components a (first maximum region) re independently encoded in the chrominance bitstream .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20060002474A1 Filed: 2005-06-27 Issued: 2006-01-05 Efficient multi-block motion estimation for video compression (Original Assignee) Hong Kong University of Science and Technology HKUST (Current Assignee) Hong Kong University of Science and Technology HKUST Oscar Chi-Lim Au, Andy Chang
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20060002474A1 CLAIM 1 . In a data compressing scheme for matching between frames of images in which each frame is divided into a predetermined number of macroblocks , a method of choosing the best mode for dividing a candidate macroblock from among the predetermined number of macroblocks for motion estimation , said method (root region) comprising : defining a motion vector for a search point in a research region within the candidate macroblock ; constructing a hierarchy of modes for subdividing the candidate macroblock into one or more subblocks wherein the modes are enumerated such that a mode M comprises subblocks with smaller area than or equal to sublocks of a mode N if M> ; N ; selecting a lowest mode L and performing an elaborate search with respect to a mismatch measure for the mode L ; choosing the mode M for dividing the candidate macroblock if the mismatch measure is smaller than a threshold ; and performing a relatively simple search for higher modes if the mismatch is not smaller than a threshold .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region (said method) into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20060002474A1 CLAIM 1 . In a data compressing scheme for matching between frames of images in which each frame is divided into a predetermined number of macroblocks , a method of choosing the best mode for dividing a candidate macroblock from among the predetermined number of macroblocks for motion estimation , said method (root region) comprising : defining a motion vector for a search point in a research region within the candidate macroblock ; constructing a hierarchy of modes for subdividing the candidate macroblock into one or more subblocks wherein the modes are enumerated such that a mode M comprises subblocks with smaller area than or equal to sublocks of a mode N if M> ; N ; selecting a lowest mode L and performing an elaborate search with respect to a mismatch measure for the mode L ; choosing the mode M for dividing the candidate macroblock if the mismatch measure is smaller than a threshold ; and performing a relatively simple search for higher modes if the mismatch is not smaller than a threshold .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20060002474A1 CLAIM 1 . In a data compressing scheme for matching between frames of images in which each frame is divided into a predetermined number of macroblocks , a method of choosing the best mode for dividing a candidate macroblock from among the predetermined number of macroblocks for motion estimation , said method (root region) comprising : defining a motion vector for a search point in a research region within the candidate macroblock ; constructing a hierarchy of modes for subdividing the candidate macroblock into one or more subblocks wherein the modes are enumerated such that a mode M comprises subblocks with smaller area than or equal to sublocks of a mode N if M> ; N ; selecting a lowest mode L and performing an elaborate search with respect to a mismatch measure for the mode L ; choosing the mode M for dividing the candidate macroblock if the mismatch measure is smaller than a threshold ; and performing a relatively simple search for higher modes if the mismatch is not smaller than a threshold .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator (absolute difference) configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20060002474A1 CLAIM 1 . In a data compressing scheme for matching between frames of images in which each frame is divided into a predetermined number of macroblocks , a method of choosing the best mode for dividing a candidate macroblock from among the predetermined number of macroblocks for motion estimation , said method (root region) comprising : defining a motion vector for a search point in a research region within the candidate macroblock ; constructing a hierarchy of modes for subdividing the candidate macroblock into one or more subblocks wherein the modes are enumerated such that a mode M comprises subblocks with smaller area than or equal to sublocks of a mode N if M> ; N ; selecting a lowest mode L and performing an elaborate search with respect to a mismatch measure for the mode L ; choosing the mode M for dividing the candidate macroblock if the mismatch measure is smaller than a threshold ; and performing a relatively simple search for higher modes if the mismatch is not smaller than a threshold . US20060002474A1 CLAIM 2 . The method of claim 1 wherein the mismatch measure comprises sum of absolute difference (data stream generator) (SAD) .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20060002474A1 CLAIM 1 . In a data compressing scheme for matching between frames of images in which each frame is divided into a predetermined number of macroblocks , a method of choosing the best mode for dividing a candidate macroblock from among the predetermined number of macroblocks for motion estimation , said method (root region) comprising : defining a motion vector for a search point in a research region within the candidate macroblock ; constructing a hierarchy of modes for subdividing the candidate macroblock into one or more subblocks wherein the modes are enumerated such that a mode M comprises subblocks with smaller area than or equal to sublocks of a mode N if M> ; N ; selecting a lowest mode L and performing an elaborate search with respect to a mismatch measure for the mode L ; choosing the mode M for dividing the candidate macroblock if the mismatch measure is smaller than a threshold ; and performing a relatively simple search for higher modes if the mismatch is not smaller than a threshold .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	CN1957617A Filed: 2005-05-20 Issued: 2007-05-02 用于编码数字视频数据的方法和设备 (Original Assignee) 皇家飞利浦电子股份有限公司 S·瓦伦特
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream (多个参考) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN1957617A CLAIM 1 . 一种编码数字视频数据的方法，其中数字视频数据对应于原始图像序列并且以视频流的形式可利用，其中视频流由相继的图像组成，这些图像或者是INTRA图像或者是INTER图像，其中INTRA图像被称作I图像，并且利用所谓的INTRA模式进行编码而无需参考任何过去的或者未来的图像，而INTER图像自身或是单向预测的图像或是双向预测的图像，其中单向预测的图像被称作P图像，并且参考过去或者未来的参考图像进行编码，其中参考图像是INTRA或者INTER图像，而双向预测的图像被称作B图像，并且参考一个或多个参考 (data stream) 图像进行编码，所述INTRA图像自身或包括设置于对应于景物变化的新的图像组开始的I图像，其中没有时间冗余度可利用，并且被称作景物变化I图像，所述INTRA图像自身或包括设置于其他位置中的I图像，其中一些时间冗余度可利用，并且被称作刷新图像，所述方法用于生成输出编码的比特流，其特征在于，在INTRA模式中被量化和被编码之前，所述INTRA刷新图像利用具有基本上类似于最后编码的INTER图像的质量和假象的INTER图像来代替。
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level from the data stream (多个参考) .	CN1957617A CLAIM 1 . 一种编码数字视频数据的方法，其中数字视频数据对应于原始图像序列并且以视频流的形式可利用，其中视频流由相继的图像组成，这些图像或者是INTRA图像或者是INTER图像，其中INTRA图像被称作I图像，并且利用所谓的INTRA模式进行编码而无需参考任何过去的或者未来的图像，而INTER图像自身或是单向预测的图像或是双向预测的图像，其中单向预测的图像被称作P图像，并且参考过去或者未来的参考图像进行编码，其中参考图像是INTRA或者INTER图像，而双向预测的图像被称作B图像，并且参考一个或多个参考 (data stream) 图像进行编码，所述INTRA图像自身或包括设置于对应于景物变化的新的图像组开始的I图像，其中没有时间冗余度可利用，并且被称作景物变化I图像，所述INTRA图像自身或包括设置于其他位置中的I图像，其中一些时间冗余度可利用，并且被称作刷新图像，所述方法用于生成输出编码的比特流，其特征在于，在INTRA模式中被量化和被编码之前，所述INTRA刷新图像利用具有基本上类似于最后编码的INTER图像的质量和假象的INTER图像来代替。
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements associated with the first or second set of sub-regions from the data stream (多个参考) in a depth-first traversal order .	CN1957617A CLAIM 1 . 一种编码数字视频数据的方法，其中数字视频数据对应于原始图像序列并且以视频流的形式可利用，其中视频流由相继的图像组成，这些图像或者是INTRA图像或者是INTER图像，其中INTRA图像被称作I图像，并且利用所谓的INTRA模式进行编码而无需参考任何过去的或者未来的图像，而INTER图像自身或是单向预测的图像或是双向预测的图像，其中单向预测的图像被称作P图像，并且参考过去或者未来的参考图像进行编码，其中参考图像是INTRA或者INTER图像，而双向预测的图像被称作B图像，并且参考一个或多个参考 (data stream) 图像进行编码，所述INTRA图像自身或包括设置于对应于景物变化的新的图像组开始的I图像，其中没有时间冗余度可利用，并且被称作景物变化I图像，所述INTRA图像自身或包括设置于其他位置中的I图像，其中一些时间冗余度可利用，并且被称作刷新图像，所述方法用于生成输出编码的比特流，其特征在于，在INTRA模式中被量化和被编码之前，所述INTRA刷新图像利用具有基本上类似于最后编码的INTER图像的质量和假象的INTER图像来代替。
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream (多个参考) , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	CN1957617A CLAIM 1 . 一种编码数字视频数据的方法，其中数字视频数据对应于原始图像序列并且以视频流的形式可利用，其中视频流由相继的图像组成，这些图像或者是INTRA图像或者是INTER图像，其中INTRA图像被称作I图像，并且利用所谓的INTRA模式进行编码而无需参考任何过去的或者未来的图像，而INTER图像自身或是单向预测的图像或是双向预测的图像，其中单向预测的图像被称作P图像，并且参考过去或者未来的参考图像进行编码，其中参考图像是INTRA或者INTER图像，而双向预测的图像被称作B图像，并且参考一个或多个参考 (data stream) 图像进行编码，所述INTRA图像自身或包括设置于对应于景物变化的新的图像组开始的I图像，其中没有时间冗余度可利用，并且被称作景物变化I图像，所述INTRA图像自身或包括设置于其他位置中的I图像，其中一些时间冗余度可利用，并且被称作刷新图像，所述方法用于生成输出编码的比特流，其特征在于，在INTRA模式中被量化和被编码之前，所述INTRA刷新图像利用具有基本上类似于最后编码的INTER图像的质量和假象的INTER图像来代替。
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream (多个参考) , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	CN1957617A CLAIM 1 . 一种编码数字视频数据的方法，其中数字视频数据对应于原始图像序列并且以视频流的形式可利用，其中视频流由相继的图像组成，这些图像或者是INTRA图像或者是INTER图像，其中INTRA图像被称作I图像，并且利用所谓的INTRA模式进行编码而无需参考任何过去的或者未来的图像，而INTER图像自身或是单向预测的图像或是双向预测的图像，其中单向预测的图像被称作P图像，并且参考过去或者未来的参考图像进行编码，其中参考图像是INTRA或者INTER图像，而双向预测的图像被称作B图像，并且参考一个或多个参考 (data stream) 图像进行编码，所述INTRA图像自身或包括设置于对应于景物变化的新的图像组开始的I图像，其中没有时间冗余度可利用，并且被称作景物变化I图像，所述INTRA图像自身或包括设置于其他位置中的I图像，其中一些时间冗余度可利用，并且被称作刷新图像，所述方法用于生成输出编码的比特流，其特征在于，在INTRA模式中被量化和被编码之前，所述INTRA刷新图像利用具有基本上类似于最后编码的INTER图像的质量和假象的INTER图像来代替。
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream (多个参考) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN1957617A CLAIM 1 . 一种编码数字视频数据的方法，其中数字视频数据对应于原始图像序列并且以视频流的形式可利用，其中视频流由相继的图像组成，这些图像或者是INTRA图像或者是INTER图像，其中INTRA图像被称作I图像，并且利用所谓的INTRA模式进行编码而无需参考任何过去的或者未来的图像，而INTER图像自身或是单向预测的图像或是双向预测的图像，其中单向预测的图像被称作P图像，并且参考过去或者未来的参考图像进行编码，其中参考图像是INTRA或者INTER图像，而双向预测的图像被称作B图像，并且参考一个或多个参考 (data stream) 图像进行编码，所述INTRA图像自身或包括设置于对应于景物变化的新的图像组开始的I图像，其中没有时间冗余度可利用，并且被称作景物变化I图像，所述INTRA图像自身或包括设置于其他位置中的I图像，其中一些时间冗余度可利用，并且被称作刷新图像，所述方法用于生成输出编码的比特流，其特征在于，在INTRA模式中被量化和被编码之前，所述INTRA刷新图像利用具有基本上类似于最后编码的INTER图像的质量和假象的INTER图像来代替。
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream (多个参考) generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN1957617A CLAIM 1 . 一种编码数字视频数据的方法，其中数字视频数据对应于原始图像序列并且以视频流的形式可利用，其中视频流由相继的图像组成，这些图像或者是INTRA图像或者是INTER图像，其中INTRA图像被称作I图像，并且利用所谓的INTRA模式进行编码而无需参考任何过去的或者未来的图像，而INTER图像自身或是单向预测的图像或是双向预测的图像，其中单向预测的图像被称作P图像，并且参考过去或者未来的参考图像进行编码，其中参考图像是INTRA或者INTER图像，而双向预测的图像被称作B图像，并且参考一个或多个参考 (data stream) 图像进行编码，所述INTRA图像自身或包括设置于对应于景物变化的新的图像组开始的I图像，其中没有时间冗余度可利用，并且被称作景物变化I图像，所述INTRA图像自身或包括设置于其他位置中的I图像，其中一些时间冗余度可利用，并且被称作刷新图像，所述方法用于生成输出编码的比特流，其特征在于，在INTRA模式中被量化和被编码之前，所述INTRA刷新图像利用具有基本上类似于最后编码的INTER图像的质量和假象的INTER图像来代替。
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream (多个参考) the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN1957617A CLAIM 1 . 一种编码数字视频数据的方法，其中数字视频数据对应于原始图像序列并且以视频流的形式可利用，其中视频流由相继的图像组成，这些图像或者是INTRA图像或者是INTER图像，其中INTRA图像被称作I图像，并且利用所谓的INTRA模式进行编码而无需参考任何过去的或者未来的图像，而INTER图像自身或是单向预测的图像或是双向预测的图像，其中单向预测的图像被称作P图像，并且参考过去或者未来的参考图像进行编码，其中参考图像是INTRA或者INTER图像，而双向预测的图像被称作B图像，并且参考一个或多个参考 (data stream) 图像进行编码，所述INTRA图像自身或包括设置于对应于景物变化的新的图像组开始的I图像，其中没有时间冗余度可利用，并且被称作景物变化I图像，所述INTRA图像自身或包括设置于其他位置中的I图像，其中一些时间冗余度可利用，并且被称作刷新图像，所述方法用于生成输出编码的比特流，其特征在于，在INTRA模式中被量化和被编码之前，所述INTRA刷新图像利用具有基本上类似于最后编码的INTER图像的质量和假象的INTER图像来代替。

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	CN1691087A Filed: 2005-04-26 Issued: 2005-11-02 用于解码数字编码图像的系统和方法 (Original Assignee) 图形安全系统公司阿尔佛雷德·V·阿拉西亚, 阿尔佛雷德·J·阿拉西亚, 托马斯·C·阿拉西亚, 斯洛博丹·茨韦特科维奇
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (第二编) information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root (中的一个) region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN1691087A CLAIM 14 . 根据权利要求13所述的用于对编码图像进行解码的方法，其特征在于所述图像获取设备是由光学扫描仪、数字照相机、以及包括模拟照相机和帧接收器的系统构成的组中的一个 (respective root) 。 CN1691087A CLAIM 27 . 一种用于增强对其中已经嵌入了第一编码图像的数字文档的保护的方法，已经利用验证内容组和第一编码参数组构建了所述第一编码图像；所述方法包括：利用所述第一编码参数组对所述第一编码图像进行数字解码以产生解码图像；从所述解码图像中提取所述验证内容组；以及利用所述验证内容组和第二编 (second subdivision) 码参数组来构建第二编码图像。
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition (服务器) rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	CN1691087A CLAIM 26 . 根据权利要求23所述的系统，其特征在于所述系统包括验证服务器 (respective partition, respective partition rules) ，所述验证服务器通过网络与至少一个用户数据处理器通信，所述解码模块和所述验证模块是所述验证服务器的一部分，以及所述验证服务器适合于从所述至少一个用户数据处理器接收文档验证请求，并且将验证结果返回到所述至少一个用户数据处理器。
US10250913B2 CLAIM 11 . The decoder according to claim 1 , wherein the recursive multi-tree partitioning includes a quadtree partitioning technique (辅助图像) .	CN1691087A CLAIM 1 . 一种利用至少一个编码参数来解码由主图像和至少一个辅助图像 (quadtree partitioning technique) 产生的编码图像的方法，按照以下方式来形成所述编码图像：当打印所述编码图像时，如果没有具有与所述至少一个编码参数相对应的特性的光学解码设备，则观看者无法辨别所述辅助图像；所述方法包括：获得所述编码图像的数字版本；确定所述至少一个编码参数；以及利用所述至少一个编码参数，根据所述数字编码图像来构建解码图像。
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (第二编) information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root (中的一个) region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN1691087A CLAIM 14 . 根据权利要求13所述的用于对编码图像进行解码的方法，其特征在于所述图像获取设备是由光学扫描仪、数字照相机、以及包括模拟照相机和帧接收器的系统构成的组中的一个 (respective root) 。 CN1691087A CLAIM 27 . 一种用于增强对其中已经嵌入了第一编码图像的数字文档的保护的方法，已经利用验证内容组和第一编码参数组构建了所述第一编码图像；所述方法包括：利用所述第一编码参数组对所述第一编码图像进行数字解码以产生解码图像；从所述解码图像中提取所述验证内容组；以及利用所述验证内容组和第二编 (second subdivision) 码参数组来构建第二编码图像。
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root (中的一个) region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (第二编) information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN1691087A CLAIM 14 . 根据权利要求13所述的用于对编码图像进行解码的方法，其特征在于所述图像获取设备是由光学扫描仪、数字照相机、以及包括模拟照相机和帧接收器的系统构成的组中的一个 (respective root) 。 CN1691087A CLAIM 27 . 一种用于增强对其中已经嵌入了第一编码图像的数字文档的保护的方法，已经利用验证内容组和第一编码参数组构建了所述第一编码图像；所述方法包括：利用所述第一编码参数组对所述第一编码图像进行数字解码以产生解码图像；从所述解码图像中提取所述验证内容组；以及利用所述验证内容组和第二编 (second subdivision) 码参数组来构建第二编码图像。
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root (中的一个) region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (第二编) information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN1691087A CLAIM 14 . 根据权利要求13所述的用于对编码图像进行解码的方法，其特征在于所述图像获取设备是由光学扫描仪、数字照相机、以及包括模拟照相机和帧接收器的系统构成的组中的一个 (respective root) 。 CN1691087A CLAIM 27 . 一种用于增强对其中已经嵌入了第一编码图像的数字文档的保护的方法，已经利用验证内容组和第一编码参数组构建了所述第一编码图像；所述方法包括：利用所述第一编码参数组对所述第一编码图像进行数字解码以产生解码图像；从所述解码图像中提取所述验证内容组；以及利用所述验证内容组和第二编 (second subdivision) 码参数组来构建第二编码图像。

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20060233262A1 Filed: 2005-04-13 Issued: 2006-10-19 Signaling of bit stream ordering in scalable video coding (Original Assignee) Nokia Oyj (Current Assignee) Nokia Oyj Justin Ridge, Yiliang Bao, Marta Karczewicz, Xianglin Wang, Fehmi Chebil
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy (color component) level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20060233262A1 CLAIM 2 . The method of claim 1 , wherein the multiple dimensions comprise at least two from the group consisting of block , color component (maximum hierarchy, maximum hierarchy level, hierarchy level) , cycle , and fine granularity scalability (FGS) plane .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level (color component) according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy (color component) level is reached .	US20060233262A1 CLAIM 2 . The method of claim 1 , wherein the multiple dimensions comprise at least two from the group consisting of block , color component (maximum hierarchy, maximum hierarchy level, hierarchy level) , cycle , and fine granularity scalability (FGS) plane .
US10250913B2 CLAIM 5 . The decoder according to claim 4 , wherein the divider is configured to , in accordance with the partition rules associated with the first and higher-order hierarchy levels , sub-divide into sub-regions of equal size , such that there are an equal number of sub-regions at each hierarchy level (color component) .	US20060233262A1 CLAIM 2 . The method of claim 1 , wherein the multiple dimensions comprise at least two from the group consisting of block , color component (maximum hierarchy, maximum hierarchy level, hierarchy level) , cycle , and fine granularity scalability (FGS) plane .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision information includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level (color component) is sub-divided .	US20060233262A1 CLAIM 2 . The method of claim 1 , wherein the multiple dimensions comprise at least two from the group consisting of block , color component (maximum hierarchy, maximum hierarchy level, hierarchy level) , cycle , and fine granularity scalability (FGS) plane .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy (color component) level from the data stream .	US20060233262A1 CLAIM 2 . The method of claim 1 , wherein the multiple dimensions comprise at least two from the group consisting of block , color component (maximum hierarchy, maximum hierarchy level, hierarchy level) , cycle , and fine granularity scalability (FGS) plane .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements (syntax element) associated with the first or second set of sub-regions from the data stream in a depth-first traversal order .	US20060233262A1 CLAIM 6 . An decoder that decodes scalable video data having multiple dimensions of scalability , the decoder comprising : a fine granularity scalability (FGS) enhancement module that decodes information using a series of iterations within an encoded bit stream ; and a processor that receives a syntax element (syntax elements) that specifies ordering of iterations in the series of iterations and instructs the FGS enhancement module to decode information using the specified ordering of iterations .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements (syntax element) of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20060233262A1 CLAIM 6 . An decoder that decodes scalable video data having multiple dimensions of scalability , the decoder comprising : a fine granularity scalability (FGS) enhancement module that decodes information using a series of iterations within an encoded bit stream ; and a processor that receives a syntax element (syntax elements) that specifies ordering of iterations in the series of iterations and instructs the FGS enhancement module to decode information using the specified ordering of iterations .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy (color component) level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20060233262A1 CLAIM 2 . The method of claim 1 , wherein the multiple dimensions comprise at least two from the group consisting of block , color component (maximum hierarchy, maximum hierarchy level, hierarchy level) , cycle , and fine granularity scalability (FGS) plane .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy (color component) level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20060233262A1 CLAIM 2 . The method of claim 1 , wherein the multiple dimensions comprise at least two from the group consisting of block , color component (maximum hierarchy, maximum hierarchy level, hierarchy level) , cycle , and fine granularity scalability (FGS) plane .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy (color component) level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20060233262A1 CLAIM 2 . The method of claim 1 , wherein the multiple dimensions comprise at least two from the group consisting of block , color component (maximum hierarchy, maximum hierarchy level, hierarchy level) , cycle , and fine granularity scalability (FGS) plane .
US10250913B2 CLAIM 15 . A non-transitory computer readable digital storage medium having stored thereon a computer program (computer program) having a program code for performing , when running on a computer , a method according to claim 12 .	US20060233262A1 CLAIM 17 . A computer program (computer program) product utilized in video encoding comprising : computer code to decode information using a series of iterations within a coded bit stream ; computer code to receive a syntax element that specifies ordering of iterations in the series of iterations ; and computer code to instruct the decoding of information using the specified ordering of iterations .
US10250913B2 CLAIM 16 . A non-transitory computer readable digital storage medium having stored thereon a computer program (computer program) having a program code for performing , when running on a computer , a method according to claim 14 .	US20060233262A1 CLAIM 17 . A computer program (computer program) product utilized in video encoding comprising : computer code to decode information using a series of iterations within a coded bit stream ; computer code to receive a syntax element that specifies ordering of iterations in the series of iterations ; and computer code to instruct the decoding of information using the specified ordering of iterations .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	KR20060079051A Filed: 2005-04-02 Issued: 2006-07-05 색차 성분의 상관관계를 이용한 컬러 영상의 부호화,복호화 방법 및 그 장치 (Original Assignee) 삼성전자주식회사 김소영, 박승란, 박정훈, 손유미, 이상래
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size (역변환부) and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	KR20060079051A CLAIM 17 부호화된 비트 스트림을 엔트로피 복호화하는 엔트로피 디코딩부 ; 및 상기 디코딩된 데이터가 휘도 성분인 경우에는 바이 패스시키고 , 색차성분인 경우에는 , Cb 및 Cr 성분에 가중치를 주고 조합하는데 사용된 계수들에 관한 정보를 추출하여 원래의 색차 성분 Cb 및 Cr 성분을 만들어 출력하는 색차성분 역변환부 (second maximum region size) 를 포함하는 것을 특징으로 하는 복호화 장치 .
US10250913B2 CLAIM 5 . The decoder according to claim 4 , wherein the divider is configured to , in accordance with the partition rules associated with the first and higher-order hierarchy levels , sub-divide into sub-regions of equal size (성분은) , such that there are an equal number of sub-regions at each hierarchy level .	KR20060079051A CLAIM 35 제25항에 있어서 , 상기 색차 성분은 (equal size) Cb , Cr이며 , 상기 색차 성분 Cb , Cr은 변환 및 양자화가 이미 수행된 것임을 특징으로 하는 부호화 장치 .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size (역변환부) and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	KR20060079051A CLAIM 17 부호화된 비트 스트림을 엔트로피 복호화하는 엔트로피 디코딩부 ; 및 상기 디코딩된 데이터가 휘도 성분인 경우에는 바이 패스시키고 , 색차성분인 경우에는 , Cb 및 Cr 성분에 가중치를 주고 조합하는데 사용된 계수들에 관한 정보를 추출하여 원래의 색차 성분 Cb 및 Cr 성분을 만들어 출력하는 색차성분 역변환부 (second maximum region size) 를 포함하는 것을 특징으로 하는 복호화 장치 .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size (역변환부) , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	KR20060079051A CLAIM 17 부호화된 비트 스트림을 엔트로피 복호화하는 엔트로피 디코딩부 ; 및 상기 디코딩된 데이터가 휘도 성분인 경우에는 바이 패스시키고 , 색차성분인 경우에는 , Cb 및 Cr 성분에 가중치를 주고 조합하는데 사용된 계수들에 관한 정보를 추출하여 원래의 색차 성분 Cb 및 Cr 성분을 만들어 출력하는 색차성분 역변환부 (second maximum region size) 를 포함하는 것을 특징으로 하는 복호화 장치 .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size (역변환부) ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	KR20060079051A CLAIM 17 부호화된 비트 스트림을 엔트로피 복호화하는 엔트로피 디코딩부 ; 및 상기 디코딩된 데이터가 휘도 성분인 경우에는 바이 패스시키고 , 색차성분인 경우에는 , Cb 및 Cr 성분에 가중치를 주고 조합하는데 사용된 계수들에 관한 정보를 추출하여 원래의 색차 성분 Cb 및 Cr 성분을 만들어 출력하는 색차성분 역변환부 (second maximum region size) 를 포함하는 것을 특징으로 하는 복호화 장치 .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20050286759A1 Filed: 2005-03-31 Issued: 2005-12-29 Interactive viewpoint video system and process employing overlapping images of a scene captured from viewpoints forming a grid (Original Assignee) Microsoft Corp (Current Assignee) Microsoft Technology Licensing LLC Charles Zitnick, Matthew Uyttendaele, Richard Szeliski, Simon Winder, Sing Kang
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream (video streams) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20050286759A1 CLAIM 1 . A computer-implemented process for generating an interactive viewpoint video , comprising using a computer to perform the following process actions : inputting a plurality of synchronized video streams (data stream, data stream generator) each depicting a portion of the same scene captured from different viewpoints , wherein said viewpoints form a grid ; inputting calibration data defining geometric and photometric parameters associated with each video stream ; and for each group of contemporaneous frames from the synchronized video streams , generating a 3D reconstruction of the scene , using the reconstruction to compute a disparity map for each frame in the group of contemporaneous frames , and for each frame in the group of contemporaneous frames , identifying areas of significant depth discontinuities based on its disparity map , generating a main layer comprising pixel information associated with areas in a frame that do not exhibit depth discontinuities exceeding a prescribed threshold and background pixel information from areas having depth discontinuities above the threshold , and a boundary layer comprising foreground pixel information associated with areas having depth discontinuities that exceed the threshold , to produce a layered representation for the frame under consideration .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level from the data stream (video streams) .	US20050286759A1 CLAIM 1 . A computer-implemented process for generating an interactive viewpoint video , comprising using a computer to perform the following process actions : inputting a plurality of synchronized video streams (data stream, data stream generator) each depicting a portion of the same scene captured from different viewpoints , wherein said viewpoints form a grid ; inputting calibration data defining geometric and photometric parameters associated with each video stream ; and for each group of contemporaneous frames from the synchronized video streams , generating a 3D reconstruction of the scene , using the reconstruction to compute a disparity map for each frame in the group of contemporaneous frames , and for each frame in the group of contemporaneous frames , identifying areas of significant depth discontinuities based on its disparity map , generating a main layer comprising pixel information associated with areas in a frame that do not exhibit depth discontinuities exceeding a prescribed threshold and background pixel information from areas having depth discontinuities above the threshold , and a boundary layer comprising foreground pixel information associated with areas having depth discontinuities that exceed the threshold , to produce a layered representation for the frame under consideration .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements associated with the first or second set of sub-regions from the data stream (video streams) in a depth-first traversal order .	US20050286759A1 CLAIM 1 . A computer-implemented process for generating an interactive viewpoint video , comprising using a computer to perform the following process actions : inputting a plurality of synchronized video streams (data stream, data stream generator) each depicting a portion of the same scene captured from different viewpoints , wherein said viewpoints form a grid ; inputting calibration data defining geometric and photometric parameters associated with each video stream ; and for each group of contemporaneous frames from the synchronized video streams , generating a 3D reconstruction of the scene , using the reconstruction to compute a disparity map for each frame in the group of contemporaneous frames , and for each frame in the group of contemporaneous frames , identifying areas of significant depth discontinuities based on its disparity map , generating a main layer comprising pixel information associated with areas in a frame that do not exhibit depth discontinuities exceeding a prescribed threshold and background pixel information from areas having depth discontinuities above the threshold , and a boundary layer comprising foreground pixel information associated with areas having depth discontinuities that exceed the threshold , to produce a layered representation for the frame under consideration .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream (video streams) , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20050286759A1 CLAIM 1 . A computer-implemented process for generating an interactive viewpoint video , comprising using a computer to perform the following process actions : inputting a plurality of synchronized video streams (data stream, data stream generator) each depicting a portion of the same scene captured from different viewpoints , wherein said viewpoints form a grid ; inputting calibration data defining geometric and photometric parameters associated with each video stream ; and for each group of contemporaneous frames from the synchronized video streams , generating a 3D reconstruction of the scene , using the reconstruction to compute a disparity map for each frame in the group of contemporaneous frames , and for each frame in the group of contemporaneous frames , identifying areas of significant depth discontinuities based on its disparity map , generating a main layer comprising pixel information associated with areas in a frame that do not exhibit depth discontinuities exceeding a prescribed threshold and background pixel information from areas having depth discontinuities above the threshold , and a boundary layer comprising foreground pixel information associated with areas having depth discontinuities that exceed the threshold , to produce a layered representation for the frame under consideration .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream (video streams) , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	US20050286759A1 CLAIM 1 . A computer-implemented process for generating an interactive viewpoint video , comprising using a computer to perform the following process actions : inputting a plurality of synchronized video streams (data stream, data stream generator) each depicting a portion of the same scene captured from different viewpoints , wherein said viewpoints form a grid ; inputting calibration data defining geometric and photometric parameters associated with each video stream ; and for each group of contemporaneous frames from the synchronized video streams , generating a 3D reconstruction of the scene , using the reconstruction to compute a disparity map for each frame in the group of contemporaneous frames , and for each frame in the group of contemporaneous frames , identifying areas of significant depth discontinuities based on its disparity map , generating a main layer comprising pixel information associated with areas in a frame that do not exhibit depth discontinuities exceeding a prescribed threshold and background pixel information from areas having depth discontinuities above the threshold , and a boundary layer comprising foreground pixel information associated with areas having depth discontinuities that exceed the threshold , to produce a layered representation for the frame under consideration .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream (video streams) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20050286759A1 CLAIM 1 . A computer-implemented process for generating an interactive viewpoint video , comprising using a computer to perform the following process actions : inputting a plurality of synchronized video streams (data stream, data stream generator) each depicting a portion of the same scene captured from different viewpoints , wherein said viewpoints form a grid ; inputting calibration data defining geometric and photometric parameters associated with each video stream ; and for each group of contemporaneous frames from the synchronized video streams , generating a 3D reconstruction of the scene , using the reconstruction to compute a disparity map for each frame in the group of contemporaneous frames , and for each frame in the group of contemporaneous frames , identifying areas of significant depth discontinuities based on its disparity map , generating a main layer comprising pixel information associated with areas in a frame that do not exhibit depth discontinuities exceeding a prescribed threshold and background pixel information from areas having depth discontinuities above the threshold , and a boundary layer comprising foreground pixel information associated with areas having depth discontinuities that exceed the threshold , to produce a layered representation for the frame under consideration .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream (video streams) generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20050286759A1 CLAIM 1 . A computer-implemented process for generating an interactive viewpoint video , comprising using a computer to perform the following process actions : inputting a plurality of synchronized video streams (data stream, data stream generator) each depicting a portion of the same scene captured from different viewpoints , wherein said viewpoints form a grid ; inputting calibration data defining geometric and photometric parameters associated with each video stream ; and for each group of contemporaneous frames from the synchronized video streams , generating a 3D reconstruction of the scene , using the reconstruction to compute a disparity map for each frame in the group of contemporaneous frames , and for each frame in the group of contemporaneous frames , identifying areas of significant depth discontinuities based on its disparity map , generating a main layer comprising pixel information associated with areas in a frame that do not exhibit depth discontinuities exceeding a prescribed threshold and background pixel information from areas having depth discontinuities above the threshold , and a boundary layer comprising foreground pixel information associated with areas having depth discontinuities that exceed the threshold , to produce a layered representation for the frame under consideration .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream (video streams) the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20050286759A1 CLAIM 1 . A computer-implemented process for generating an interactive viewpoint video , comprising using a computer to perform the following process actions : inputting a plurality of synchronized video streams (data stream, data stream generator) each depicting a portion of the same scene captured from different viewpoints , wherein said viewpoints form a grid ; inputting calibration data defining geometric and photometric parameters associated with each video stream ; and for each group of contemporaneous frames from the synchronized video streams , generating a 3D reconstruction of the scene , using the reconstruction to compute a disparity map for each frame in the group of contemporaneous frames , and for each frame in the group of contemporaneous frames , identifying areas of significant depth discontinuities based on its disparity map , generating a main layer comprising pixel information associated with areas in a frame that do not exhibit depth discontinuities exceeding a prescribed threshold and background pixel information from areas having depth discontinuities above the threshold , and a boundary layer comprising foreground pixel information associated with areas having depth discontinuities that exceed the threshold , to produce a layered representation for the frame under consideration .
US10250913B2 CLAIM 15 . A non-transitory computer readable digital storage medium having stored thereon a computer program (computer program) having a program code for performing , when running on a computer , a method according to claim 12 .	US20050286759A1 CLAIM 8 . A system for generating an interactive viewpoint video , comprising : a video capture sub-system comprising , a plurality of video cameras for capturing multiple video streams each depicting a portion of the same scene captured from different viewpoints which form a grid , synchronization equipment for synchronizing the video streams to create a sequence of groups of contemporaneously captured video frames each depicting a portion of the same scene , one or more general purpose computing devices ; a first computer program (computer program) having program modules executable by at least one of said one or more general purpose computing devices , said modules comprising , a camera calibration module for computing geometric and photometric parameters associated with each video stream ; and a second computer program having program modules executable by at least one of said one or more general purpose computing devices , said modules comprising , a 3D reconstruction module which generates a 3D reconstruction of the scene depicted each group of contemporaneous frames from the synchronized video streams , and which uses the reconstruction to compute a disparity map for each frame in the group of contemporaneous frames , a matting module which , for each frame in each group of contemporaneous frames , identifies areas of significant depth discontinuities based on the frame' ; s disparity map , a layered representation module which , for each frame in each group of contemporaneous frames , generates a main layer comprising pixel information associated with areas in a frame that do not exhibit depth discontinuities exceeding a prescribed threshold and background pixel information from pixels in areas having depth discontinuities exceeding the threshold , and a boundary layer comprising foreground pixel information associated with areas having depth discontinuities that exceed the threshold , to produce a layered representation for the frame under consideration .
US10250913B2 CLAIM 16 . A non-transitory computer readable digital storage medium having stored thereon a computer program (computer program) having a program code for performing , when running on a computer , a method according to claim 14 .	US20050286759A1 CLAIM 8 . A system for generating an interactive viewpoint video , comprising : a video capture sub-system comprising , a plurality of video cameras for capturing multiple video streams each depicting a portion of the same scene captured from different viewpoints which form a grid , synchronization equipment for synchronizing the video streams to create a sequence of groups of contemporaneously captured video frames each depicting a portion of the same scene , one or more general purpose computing devices ; a first computer program (computer program) having program modules executable by at least one of said one or more general purpose computing devices , said modules comprising , a camera calibration module for computing geometric and photometric parameters associated with each video stream ; and a second computer program having program modules executable by at least one of said one or more general purpose computing devices , said modules comprising , a 3D reconstruction module which generates a 3D reconstruction of the scene depicted each group of contemporaneous frames from the synchronized video streams , and which uses the reconstruction to compute a disparity map for each frame in the group of contemporaneous frames , a matting module which , for each frame in each group of contemporaneous frames , identifies areas of significant depth discontinuities based on the frame' ; s disparity map , a layered representation module which , for each frame in each group of contemporaneous frames , generates a main layer comprising pixel information associated with areas in a frame that do not exhibit depth discontinuities exceeding a prescribed threshold and background pixel information from pixels in areas having depth discontinuities exceeding the threshold , and a boundary layer comprising foreground pixel information associated with areas having depth discontinuities that exceed the threshold , to produce a layered representation for the frame under consideration .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20060083309A1 Filed: 2005-03-01 Issued: 2006-04-20 Apparatus and method for generating a coded video sequence by using an intermediate layer motion data prediction (Original Assignee) Fraunhofer Gesellschaft zur Forderung der Angewandten Forschung eV (Current Assignee) Fraunhofer Gesellschaft zur Forderung der Angewandten Forschung eV Heiko Schwarz, Detlev Marpe, Thomas Wiegand
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream (computer readable medium) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding (first quantization parameter) ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set (cost function) of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20060083309A1 CLAIM 9 . The apparatus according to claim 1 , wherein the enhancement motion compensator is formed to determine motion vectors for blocks of a picture and to further postprocess the motion vectors to determine motion vector differences between two motion vectors and supply them to the enhancement picture coder , and wherein the enhancement motion compensator is further formed to use , in dependence on a cost function (first set) instead of a difference between motion vectors for two blocks of the same picture , a difference between a motion vector of the block of one picture from the enhancement layer and a modified or unmodified motion vector of a corresponding block of a picture of the base layer and to supply this difference to the enhancement picture coder together with a signalization for the block . US20060083309A1 CLAIM 12 . The apparatus according to claim 11 , wherein the base picture coder is formed to perform quantization with a base quantization parameter , wherein the enhancement picture coder is formed to perform quantization with an enhancement quantization parameter , wherein the enhancement quantization parameter can result in a finer quantization than the base quantization parameter , wherein the base picture coder is formed to reconstruct the base sequence of residual error pictures quantized with the first quantization parameter (transform coding) to obtain a reconstructed base sequence , and wherein the intermediate layer predictor is formed to calculate the enhancement prediction residual error pictures by using the enhancement sequence of residual error pictures and the reconstructed base sequence of residual error pictures as information about the base sequence of residual error pictures . US20060083309A1 CLAIM 22 . A computer readable medium (data stream) with a coded video sequence having a base scaling layer and an enhancement scaling layer , wherein the coded video sequence is formed such that it results in a decoded first scaling layer and a decoded second scaling layer when it is decoded in an apparatus for decoding a coded video sequence with a base scaling layer and an enhancement scaling layer , comprising : a base picture decoder for decoding the base scaling layer to obtain a decoded base sequence of residual error pictures and base motion data ; a base motion combiner , which is formed to obtain a sequence of pictures of the base scaling layer by using the base motion data and the decoded sequence of residual error pictures ; an enhancement picture decoder for decoding the enhancement scaling layer to obtain information about an enhancement sequence of residual error pictures and information about enhancement motion data ; an enhancement motion data calculator for calculating the enhancement motion data by evaluating the information about the enhancement motion data and by using information about base motion data due to the evaluated information about the enhancement motion data ; and an enhancement motion combiner , which is formed to obtain a sequence of pictures of the enhancement scaling layer by using the enhancement sequence of residual error pictures and the enhancement motion data .
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set (cost function) of sub-regions : compute a prediction signal (prediction signal) based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset of the second set of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	US20060083309A1 CLAIM 4 . The apparatus according to claim 2 , wherein the enhancement motion compensator is formed to use the scaled base motion data as predictor for a block of enhancement motion data to calculate an enhancement motion data residual signal and to supply the enhancement motion data residual signal together with a prediction signal (prediction signal) ization to the enhancement picture coder . US20060083309A1 CLAIM 9 . The apparatus according to claim 1 , wherein the enhancement motion compensator is formed to determine motion vectors for blocks of a picture and to further postprocess the motion vectors to determine motion vector differences between two motion vectors and supply them to the enhancement picture coder , and wherein the enhancement motion compensator is further formed to use , in dependence on a cost function (first set) instead of a difference between motion vectors for two blocks of the same picture , a difference between a motion vector of the block of one picture from the enhancement layer and a modified or unmodified motion vector of a corresponding block of a picture of the base layer and to supply this difference to the enhancement picture coder together with a signalization for the block .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set (cost function) of root regions such that the first set of root regions are rectangular blocks of a size determined by the first maximum region size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	US20060083309A1 CLAIM 9 . The apparatus according to claim 1 , wherein the enhancement motion compensator is formed to determine motion vectors for blocks of a picture and to further postprocess the motion vectors to determine motion vector differences between two motion vectors and supply them to the enhancement picture coder , and wherein the enhancement motion compensator is further formed to use , in dependence on a cost function (first set) instead of a difference between motion vectors for two blocks of the same picture , a difference between a motion vector of the block of one picture from the enhancement layer and a modified or unmodified motion vector of a corresponding block of a picture of the base layer and to supply this difference to the enhancement picture coder together with a signalization for the block .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set (cost function) of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20060083309A1 CLAIM 9 . The apparatus according to claim 1 , wherein the enhancement motion compensator is formed to determine motion vectors for blocks of a picture and to further postprocess the motion vectors to determine motion vector differences between two motion vectors and supply them to the enhancement picture coder , and wherein the enhancement motion compensator is further formed to use , in dependence on a cost function (first set) instead of a difference between motion vectors for two blocks of the same picture , a difference between a motion vector of the block of one picture from the enhancement layer and a modified or unmodified motion vector of a corresponding block of a picture of the base layer and to supply this difference to the enhancement picture coder together with a signalization for the block .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision information includes a partition indication flag indicating whether any of the first set (cost function) of root regions or the sub-regions at the first or higher-order hierarchy level is sub-divided .	US20060083309A1 CLAIM 9 . The apparatus according to claim 1 , wherein the enhancement motion compensator is formed to determine motion vectors for blocks of a picture and to further postprocess the motion vectors to determine motion vector differences between two motion vectors and supply them to the enhancement picture coder , and wherein the enhancement motion compensator is further formed to use , in dependence on a cost function (first set) instead of a difference between motion vectors for two blocks of the same picture , a difference between a motion vector of the block of one picture from the enhancement layer and a modified or unmodified motion vector of a corresponding block of a picture of the base layer and to supply this difference to the enhancement picture coder together with a signalization for the block .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level from the data stream (computer readable medium) .	US20060083309A1 CLAIM 22 . A computer readable medium (data stream) with a coded video sequence having a base scaling layer and an enhancement scaling layer , wherein the coded video sequence is formed such that it results in a decoded first scaling layer and a decoded second scaling layer when it is decoded in an apparatus for decoding a coded video sequence with a base scaling layer and an enhancement scaling layer , comprising : a base picture decoder for decoding the base scaling layer to obtain a decoded base sequence of residual error pictures and base motion data ; a base motion combiner , which is formed to obtain a sequence of pictures of the base scaling layer by using the base motion data and the decoded sequence of residual error pictures ; an enhancement picture decoder for decoding the enhancement scaling layer to obtain information about an enhancement sequence of residual error pictures and information about enhancement motion data ; an enhancement motion data calculator for calculating the enhancement motion data by evaluating the information about the enhancement motion data and by using information about base motion data due to the evaluated information about the enhancement motion data ; and an enhancement motion combiner , which is formed to obtain a sequence of pictures of the enhancement scaling layer by using the enhancement sequence of residual error pictures and the enhancement motion data .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements associated with the first or second set of sub-regions from the data stream (computer readable medium) in a depth-first traversal order .	US20060083309A1 CLAIM 22 . A computer readable medium (data stream) with a coded video sequence having a base scaling layer and an enhancement scaling layer , wherein the coded video sequence is formed such that it results in a decoded first scaling layer and a decoded second scaling layer when it is decoded in an apparatus for decoding a coded video sequence with a base scaling layer and an enhancement scaling layer , comprising : a base picture decoder for decoding the base scaling layer to obtain a decoded base sequence of residual error pictures and base motion data ; a base motion combiner , which is formed to obtain a sequence of pictures of the base scaling layer by using the base motion data and the decoded sequence of residual error pictures ; an enhancement picture decoder for decoding the enhancement scaling layer to obtain information about an enhancement sequence of residual error pictures and information about enhancement motion data ; an enhancement motion data calculator for calculating the enhancement motion data by evaluating the information about the enhancement motion data and by using information about base motion data due to the evaluated information about the enhancement motion data ; and an enhancement motion combiner , which is formed to obtain a sequence of pictures of the enhancement scaling layer by using the enhancement sequence of residual error pictures and the enhancement motion data .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream (computer readable medium) , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set (cost function) of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20060083309A1 CLAIM 9 . The apparatus according to claim 1 , wherein the enhancement motion compensator is formed to determine motion vectors for blocks of a picture and to further postprocess the motion vectors to determine motion vector differences between two motion vectors and supply them to the enhancement picture coder , and wherein the enhancement motion compensator is further formed to use , in dependence on a cost function (first set) instead of a difference between motion vectors for two blocks of the same picture , a difference between a motion vector of the block of one picture from the enhancement layer and a modified or unmodified motion vector of a corresponding block of a picture of the base layer and to supply this difference to the enhancement picture coder together with a signalization for the block . US20060083309A1 CLAIM 22 . A computer readable medium (data stream) with a coded video sequence having a base scaling layer and an enhancement scaling layer , wherein the coded video sequence is formed such that it results in a decoded first scaling layer and a decoded second scaling layer when it is decoded in an apparatus for decoding a coded video sequence with a base scaling layer and an enhancement scaling layer , comprising : a base picture decoder for decoding the base scaling layer to obtain a decoded base sequence of residual error pictures and base motion data ; a base motion combiner , which is formed to obtain a sequence of pictures of the base scaling layer by using the base motion data and the decoded sequence of residual error pictures ; an enhancement picture decoder for decoding the enhancement scaling layer to obtain information about an enhancement sequence of residual error pictures and information about enhancement motion data ; an enhancement motion data calculator for calculating the enhancement motion data by evaluating the information about the enhancement motion data and by using information about base motion data due to the evaluated information about the enhancement motion data ; and an enhancement motion combiner , which is formed to obtain a sequence of pictures of the enhancement scaling layer by using the enhancement sequence of residual error pictures and the enhancement motion data .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream (computer readable medium) , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding (first quantization parameter) to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	US20060083309A1 CLAIM 12 . The apparatus according to claim 11 , wherein the base picture coder is formed to perform quantization with a base quantization parameter , wherein the enhancement picture coder is formed to perform quantization with an enhancement quantization parameter , wherein the enhancement quantization parameter can result in a finer quantization than the base quantization parameter , wherein the base picture coder is formed to reconstruct the base sequence of residual error pictures quantized with the first quantization parameter (transform coding) to obtain a reconstructed base sequence , and wherein the intermediate layer predictor is formed to calculate the enhancement prediction residual error pictures by using the enhancement sequence of residual error pictures and the reconstructed base sequence of residual error pictures as information about the base sequence of residual error pictures . US20060083309A1 CLAIM 22 . A computer readable medium (data stream) with a coded video sequence having a base scaling layer and an enhancement scaling layer , wherein the coded video sequence is formed such that it results in a decoded first scaling layer and a decoded second scaling layer when it is decoded in an apparatus for decoding a coded video sequence with a base scaling layer and an enhancement scaling layer , comprising : a base picture decoder for decoding the base scaling layer to obtain a decoded base sequence of residual error pictures and base motion data ; a base motion combiner , which is formed to obtain a sequence of pictures of the base scaling layer by using the base motion data and the decoded sequence of residual error pictures ; an enhancement picture decoder for decoding the enhancement scaling layer to obtain information about an enhancement sequence of residual error pictures and information about enhancement motion data ; an enhancement motion data calculator for calculating the enhancement motion data by evaluating the information about the enhancement motion data and by using information about base motion data due to the evaluated information about the enhancement motion data ; and an enhancement motion combiner , which is formed to obtain a sequence of pictures of the enhancement scaling layer by using the enhancement sequence of residual error pictures and the enhancement motion data .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream (computer readable medium) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding (first quantization parameter) ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set (cost function) of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20060083309A1 CLAIM 9 . The apparatus according to claim 1 , wherein the enhancement motion compensator is formed to determine motion vectors for blocks of a picture and to further postprocess the motion vectors to determine motion vector differences between two motion vectors and supply them to the enhancement picture coder , and wherein the enhancement motion compensator is further formed to use , in dependence on a cost function (first set) instead of a difference between motion vectors for two blocks of the same picture , a difference between a motion vector of the block of one picture from the enhancement layer and a modified or unmodified motion vector of a corresponding block of a picture of the base layer and to supply this difference to the enhancement picture coder together with a signalization for the block . US20060083309A1 CLAIM 12 . The apparatus according to claim 11 , wherein the base picture coder is formed to perform quantization with a base quantization parameter , wherein the enhancement picture coder is formed to perform quantization with an enhancement quantization parameter , wherein the enhancement quantization parameter can result in a finer quantization than the base quantization parameter , wherein the base picture coder is formed to reconstruct the base sequence of residual error pictures quantized with the first quantization parameter (transform coding) to obtain a reconstructed base sequence , and wherein the intermediate layer predictor is formed to calculate the enhancement prediction residual error pictures by using the enhancement sequence of residual error pictures and the reconstructed base sequence of residual error pictures as information about the base sequence of residual error pictures . US20060083309A1 CLAIM 22 . A computer readable medium (data stream) with a coded video sequence having a base scaling layer and an enhancement scaling layer , wherein the coded video sequence is formed such that it results in a decoded first scaling layer and a decoded second scaling layer when it is decoded in an apparatus for decoding a coded video sequence with a base scaling layer and an enhancement scaling layer , comprising : a base picture decoder for decoding the base scaling layer to obtain a decoded base sequence of residual error pictures and base motion data ; a base motion combiner , which is formed to obtain a sequence of pictures of the base scaling layer by using the base motion data and the decoded sequence of residual error pictures ; an enhancement picture decoder for decoding the enhancement scaling layer to obtain information about an enhancement sequence of residual error pictures and information about enhancement motion data ; an enhancement motion data calculator for calculating the enhancement motion data by evaluating the information about the enhancement motion data and by using information about base motion data due to the evaluated information about the enhancement motion data ; and an enhancement motion combiner , which is formed to obtain a sequence of pictures of the enhancement scaling layer by using the enhancement sequence of residual error pictures and the enhancement motion data .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set (cost function) of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream (computer readable medium) generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding (first quantization parameter) in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20060083309A1 CLAIM 9 . The apparatus according to claim 1 , wherein the enhancement motion compensator is formed to determine motion vectors for blocks of a picture and to further postprocess the motion vectors to determine motion vector differences between two motion vectors and supply them to the enhancement picture coder , and wherein the enhancement motion compensator is further formed to use , in dependence on a cost function (first set) instead of a difference between motion vectors for two blocks of the same picture , a difference between a motion vector of the block of one picture from the enhancement layer and a modified or unmodified motion vector of a corresponding block of a picture of the base layer and to supply this difference to the enhancement picture coder together with a signalization for the block . US20060083309A1 CLAIM 12 . The apparatus according to claim 11 , wherein the base picture coder is formed to perform quantization with a base quantization parameter , wherein the enhancement picture coder is formed to perform quantization with an enhancement quantization parameter , wherein the enhancement quantization parameter can result in a finer quantization than the base quantization parameter , wherein the base picture coder is formed to reconstruct the base sequence of residual error pictures quantized with the first quantization parameter (transform coding) to obtain a reconstructed base sequence , and wherein the intermediate layer predictor is formed to calculate the enhancement prediction residual error pictures by using the enhancement sequence of residual error pictures and the reconstructed base sequence of residual error pictures as information about the base sequence of residual error pictures . US20060083309A1 CLAIM 22 . A computer readable medium (data stream) with a coded video sequence having a base scaling layer and an enhancement scaling layer , wherein the coded video sequence is formed such that it results in a decoded first scaling layer and a decoded second scaling layer when it is decoded in an apparatus for decoding a coded video sequence with a base scaling layer and an enhancement scaling layer , comprising : a base picture decoder for decoding the base scaling layer to obtain a decoded base sequence of residual error pictures and base motion data ; a base motion combiner , which is formed to obtain a sequence of pictures of the base scaling layer by using the base motion data and the decoded sequence of residual error pictures ; an enhancement picture decoder for decoding the enhancement scaling layer to obtain information about an enhancement sequence of residual error pictures and information about enhancement motion data ; an enhancement motion data calculator for calculating the enhancement motion data by evaluating the information about the enhancement motion data and by using information about base motion data due to the evaluated information about the enhancement motion data ; and an enhancement motion combiner , which is formed to obtain a sequence of pictures of the enhancement scaling layer by using the enhancement sequence of residual error pictures and the enhancement motion data .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set (cost function) of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding (first quantization parameter) in accordance with the second set of sub-regions ; and inserting into a data stream (computer readable medium) the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20060083309A1 CLAIM 9 . The apparatus according to claim 1 , wherein the enhancement motion compensator is formed to determine motion vectors for blocks of a picture and to further postprocess the motion vectors to determine motion vector differences between two motion vectors and supply them to the enhancement picture coder , and wherein the enhancement motion compensator is further formed to use , in dependence on a cost function (first set) instead of a difference between motion vectors for two blocks of the same picture , a difference between a motion vector of the block of one picture from the enhancement layer and a modified or unmodified motion vector of a corresponding block of a picture of the base layer and to supply this difference to the enhancement picture coder together with a signalization for the block . US20060083309A1 CLAIM 12 . The apparatus according to claim 11 , wherein the base picture coder is formed to perform quantization with a base quantization parameter , wherein the enhancement picture coder is formed to perform quantization with an enhancement quantization parameter , wherein the enhancement quantization parameter can result in a finer quantization than the base quantization parameter , wherein the base picture coder is formed to reconstruct the base sequence of residual error pictures quantized with the first quantization parameter (transform coding) to obtain a reconstructed base sequence , and wherein the intermediate layer predictor is formed to calculate the enhancement prediction residual error pictures by using the enhancement sequence of residual error pictures and the reconstructed base sequence of residual error pictures as information about the base sequence of residual error pictures . US20060083309A1 CLAIM 22 . A computer readable medium (data stream) with a coded video sequence having a base scaling layer and an enhancement scaling layer , wherein the coded video sequence is formed such that it results in a decoded first scaling layer and a decoded second scaling layer when it is decoded in an apparatus for decoding a coded video sequence with a base scaling layer and an enhancement scaling layer , comprising : a base picture decoder for decoding the base scaling layer to obtain a decoded base sequence of residual error pictures and base motion data ; a base motion combiner , which is formed to obtain a sequence of pictures of the base scaling layer by using the base motion data and the decoded sequence of residual error pictures ; an enhancement picture decoder for decoding the enhancement scaling layer to obtain information about an enhancement sequence of residual error pictures and information about enhancement motion data ; an enhancement motion data calculator for calculating the enhancement motion data by evaluating the information about the enhancement motion data and by using information about base motion data due to the evaluated information about the enhancement motion data ; and an enhancement motion combiner , which is formed to obtain a sequence of pictures of the enhancement scaling layer by using the enhancement sequence of residual error pictures and the enhancement motion data .
US10250913B2 CLAIM 15 . A non-transitory computer readable digital storage medium having stored thereon a computer program (computer program) having a program code for performing , when running on a computer , a method according to claim 12 .	US20060083309A1 CLAIM 21 . A computer program (computer program) for performing a method for generating a coded video sequence having a base scaling layer and an enhancement scaling layer , comprising the steps of : calculating base motion data , which indicate how a block in a current picture has moved in relation to another picture in a group of pictures ; calculating a base sequence of residual error pictures by using the base motion data ; performing a base picture coding to generate a coded first scaling layer from the base sequence of residual error pictures ; determining enhancement motion data wherein enhancement motion data are determined adaptively and block by block by using the base motion data , and wherein signalization information are provided adaptively and block by block ; calculating an enhancement sequence of residual error pictures by using the enhancement motion data ; and performing an enhancement picture coding by coding information about the enhancement sequence of residual error pictures and by coding the block by block signalization information to obtain a coded enhancement scaling layer ; or a method for decoding a coded video sequence with a base scaling layer and an enhancement scaling layer , comprising the steps of : decoding the base scaling layer to obtain a decoded base sequence of residual error pictures and base motion data ; performing a base motion combination by using the base motion data and the decoded sequence of residual error pictures , so that a sequence of pictures of the base scaling layer is obtained ; decoding the enhancement scaling layer to obtain information about an enhancement sequence of residual error pictures and information about enhancement motion data ; calculating the enhancement motion data by evaluating the information about the enhancement motion data and by using information about base motion data due to the evaluated information about the enhancement motion data ; and performing an enhancement motion combination to obtain a sequence of pictures of the enhancement scaling layer by using the enhancement sequence of residual error pictures and the enhancement motion data ; when the method runs on a computer .
US10250913B2 CLAIM 16 . A non-transitory computer readable digital storage medium having stored thereon a computer program (computer program) having a program code for performing , when running on a computer , a method according to claim 14 .	US20060083309A1 CLAIM 21 . A computer program (computer program) for performing a method for generating a coded video sequence having a base scaling layer and an enhancement scaling layer , comprising the steps of : calculating base motion data , which indicate how a block in a current picture has moved in relation to another picture in a group of pictures ; calculating a base sequence of residual error pictures by using the base motion data ; performing a base picture coding to generate a coded first scaling layer from the base sequence of residual error pictures ; determining enhancement motion data wherein enhancement motion data are determined adaptively and block by block by using the base motion data , and wherein signalization information are provided adaptively and block by block ; calculating an enhancement sequence of residual error pictures by using the enhancement motion data ; and performing an enhancement picture coding by coding information about the enhancement sequence of residual error pictures and by coding the block by block signalization information to obtain a coded enhancement scaling layer ; or a method for decoding a coded video sequence with a base scaling layer and an enhancement scaling layer , comprising the steps of : decoding the base scaling layer to obtain a decoded base sequence of residual error pictures and base motion data ; performing a base motion combination by using the base motion data and the decoded sequence of residual error pictures , so that a sequence of pictures of the base scaling layer is obtained ; decoding the enhancement scaling layer to obtain information about an enhancement sequence of residual error pictures and information about enhancement motion data ; calculating the enhancement motion data by evaluating the information about the enhancement motion data and by using information about base motion data due to the evaluated information about the enhancement motion data ; and performing an enhancement motion combination to obtain a sequence of pictures of the enhancement scaling layer by using the enhancement sequence of residual error pictures and the enhancement motion data ; when the method runs on a computer .

CN1717047A

Filed: 2004-12-06 Issued: 2006-01-04

用于运动图像数据流业务的数据流文件、方法和系统

(Original Assignee) Lg电子株式会社

朴晟俊

US10250913B2
CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset of the second set of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle (预定周期, 时间周期) .

CN1717047A
CLAIM 7 . 如权利要求1的文件，其中，该有效载荷包括多个用于第一周期播放的视频帧和与多个视频帧同步的预定长度的音频数据，其中，无线运动图像数据流文件的总播放时间被分成预定的时间周期 (next intra-prediction cycle) ，并且第一周期是预定周期 (next intra-prediction cycle) 其中之一。

US10250913B2
CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition (服务器) rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .

CN1717047A
CLAIM 8 . 一种用于移动通信终端的运动图像数据流业务的系统，包括：数据流内容生成器，用于通过根据MJPEG的无线运动图像数据流编码的视频帧和音频数据来产生内容；内容服务器 (respective partition, respective partition rules) ，用于存储和管理所产生的内容；无线应用协议服务器，用于通过移动通信终端在内容服务器中检索所需内容，并通过数据流将检索到的内容提供给移动通信终端；以及移动通信终端，用于通过根据MJPEG的运动图像数据流解码的内容为用户提供无线运动图像数据流业务。

CN1780278A

Filed: 2004-11-19 Issued: 2006-05-31

子载波通信系统中自适应调制与编码方法和设备

(Original Assignee) 松下电器产业株式会社

佘小明, 李继峰

US10250913B2
CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision (子步骤) of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .

CN1780278A
CLAIM 6 . 根据权利要求5所述的方法，其特征在于：确定子带组内分配的信息比特数的步骤包括以下子步骤 (intermediate subdivision) ：计算子带组包含的每一个子带内可分配的信息比特数；对所述子带组内的每一个子带的信息比特数进行求和，作为所述子带组内可分配的信息比特数。

US10250913B2
CLAIM 11 . The decoder according to claim 1 , wherein the recursive multi-tree partitioning includes a quadtree partitioning technique (参数选择) .

CN1780278A
CLAIM 14 . 一种在子载波通信系统中执行子带组自适应调制与编码的接收端设备，所述接收端设备包括：天线，用于向发送端设备发送信号和从发送端设备接收信号；信道估计装置，用于对信道的传输性能进行估计；自适应调制与编码参数选择 (quadtree partitioning technique) 装置，用于根据信道估计的结果，选择子带组自适应调制与编码参数；自适应接收控制装置，用于根据子带组自适应调制与编码参数，控制自适应解调和译码装置；自适应解调与译码装置，用于在自适应接收控制装置的控制下，控制子带组的自适应解调与译码；发送装置，用于通过天线，向发送端发送包含子带组自适应调制与编码参数信息的信号。

US20050114093A1

Filed: 2004-11-12 Issued: 2005-05-26

Method and apparatus for motion estimation using variable block size of hierarchy structure

(Original Assignee) Samsung Electronics Co Ltd (Current Assignee) Samsung Electronics Co Ltd

Sang-Chang Cha, Jong-Hak Ahn

US10250913B2
CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal (adjacent blocks) based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset of the second set of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .

US20050114093A1
CLAIM 4 . The method according to claim 3 , wherein when the motion vectors between the grouped blocks are similar as a result of the determining the similarities of the motion vectors between the grouped blocks , the second step further includes determining similarities of the motion vectors between the grouped blocks and other adjacent blocks (prediction signal) having the same sizes as the grouped blocks , each of the grouped blocks being used as a unit .

US10250913B2
CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy (lower hierarchy) level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .

US20050114093A1
CLAIM 7 . The method according to claim 1 , wherein the fourth step is a step of deciding the motion vector of the mode of the variable block established in the third step using the motion vectors of lower hierarchy (first hierarchy) blocks constructing the variable block established in the third step .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	CN1589022A Filed: 2004-08-26 Issued: 2005-03-02 多模式运动估计中由朝向树决定的宏块分割模式选择方法 (Original Assignee) 中芯联合（北京）微电子有限公司苑泽生, 李晓蕾, 王识霖, 刘华平
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream (多个参考) representing encoded video information (视频信号) , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level (水平方向, 一水平, 的水平, 包括水平) (水平方向, 一水平, 的水平, 包括水平) wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN1589022A CLAIM 3 . 根据权利要求1所述的建立朝向树的方法，特征在于将权利要求2中的11个等级的分割模式，根据朝向特性按一定的划分规则组成一个树状结构，具体包含如下特征：1)“树根”只有一个，处于第0级，即不对该宏块做任何分割的模式。2)此树根模式有两个直接的“子女”分割模式(第1级模式)，即等分为两个具有水平分割特点的16×8像素块模式，和等分为两个具有垂直分割特点的8×16像素块模式。3)树的第2级有两个模式，它们都是将原16×16宏块等分为4个8×8的像素块，分别由第1级模式中不同的“父母”模式经过进一步细分而得到，但此两个分割模式是完全一样的。4)从第2级往下，整个树分为有朝向子树(包括水平 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) 朝向子树和垂直朝向子树)和无朝向子树。有朝向子树具有两条“生长”规则：每个模式的子女模式，要么是在该模式的基础上，对尚存的任何一个正方形像素块(8×8)在水平方向 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) 上或垂直方向上进行恰好一次平分而形成；要么是在该模式的基础上，将一对有朝向的长方形像素块分割成四个4×4像素块而形成。此过程一直进行到该宏块已被全部分割为16个4×4像素块为止。这样形成的朝向子树有以下三个特点：A . 越靠近根部的分割模式，在空间上的细粒度越粗；而越远离根部的分割模式，空间上的细粒度越细。B . 由第1级往下的水平 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) /垂直朝向子树中的每一个模式中，只存在同向方向分割或各向同性分割(即四个4×4像素块或四个8×8像素块)，不存在反向方向分割。c . 水平朝向树枝和垂直朝向树枝中有些分割模式是等同的，第10级模式是所有分支的树叶。5)从第3级至第9级，凡是既不属于水平朝向子树又不属于垂直朝向子树的混合朝向分割模式，均归入无朝向子树。无朝向子树的“生长”规则：在一个无朝向分割模式中，要么全由各向同性分割组成，要么既含有水平分割也含有垂直分割，同级的分割模式细粒程度均一样。 CN1589022A CLAIM 5 . 根据权利要求4所述的选择初始模式的方法，其特征在于采用了起始点思想，包括如下：1)整个算法以数字视频信号 (video information) 序列单元GOP为单位进行。确定整个方法的起始点为每个GOP的第一个P帧。2)采用“代价函数mcost”作为衡量一个分割模式优劣的判据。代价函数mcost是一个综合了残差和SAD以及其它编码开销(例如运动矢量数据等)的数值。如果一个分割模式导致的代价函数小于另一个分割模式导致的代价函数，则该分割模式优于另一个分割模式。3)对每个GOP中第一个P帧的分割模式的确定是后续过程的基础。因此，当计算时间允许时，在初始模式集中也可以包含更多种的分割模式，且可为任意的。 CN1589022A CLAIM 7 . 根据权利要求4所述的用已确定的最优分割模式和朝向地图对下一个预测帧(B或P)进行处理的方法，其特征在于采用了时间轴上惯性分割模式思想和微调整思想，包括如下：1)时间轴上惯性分割模式思想，即利用当前帧与参考帧之间的相关性，将参考帧对应位置宏块的分割模式(记载在权利 (maximum hierarchy) 6所述的最优分割模式和朝向地图中)作为当前宏块分割模式选择过程开始时的缺省分割模式MODE0，进行整数像素级别的运动估计。得出选定宏块缺省分割模式下的SAD(残差和)、总残差和SAD0和一个代价函数mcost0。2)微调整思想：将SAD0与定量界定标准“SAD上限”和“SAD下限”进行比较，根据结果判定是否对缺省分割模式进行未调整，从而确定是接受缺省分割模式的代价函数mcost，还是经过微调整后的当前分割模式代价函数mcost1。3)进行比较步骤：即将新的综合代价函数mcost1与缺省综合代价函数mcost0进行比较，选择代价函数较小的那一个分割模式。4)修改分割模式和朝向地图：根据比较步骤中的结果确定是否要修改分割模式和朝向地图，即保留上述步骤中确认保留的综合代价函数mcost所对应的mode。据此对分割模式和朝向地图中本宏块的登记项进行修改或延用，并以此为下一个预测帧中对应位置的宏块的缺省分割模式。 CN1589022A CLAIM 8 . 根据权利要求7所述的微调整思想，即粗化和细化的方法，包含如下特征：1)本方法用“SAD上限”和“SAD下限”来定量界定“满意”。“SAD上限”和“SAD下限”是根据选定宏块的相邻信息推算获得的两个经验值。将缺省分割模式的总残差和SAD0与“SAD上限”和“SAD下限”进行比较，如果SAD0介于这两者之间，就认为该缺省模式符合编码要求，接受用该分割模式得出的运动估计结果。如果SAD0大于“SAD上限”，本方法认为该缺省分割模式分得太粗，需要“细化”。如果SAD0小于“SAD下限”，本方法认为该缺省分割模式分得太细，需要“粗化”。2)在本方法中，粗化和细化有两个共同特点：A . 粗化和细化都是在朝向标志约束下进行的。即对于每一个宏块来说，如果在对一个GOP的第一个P帧的编码时被登记为水平/垂直标志，则该GOP中所有后续预测帧中该宏块都将以同方向朝向子树中的分割模式进行运动估计。B . 粗化和细化都只在朝向树中的相邻级进行。即如果当前缺省分割模式位于朝向树的第K级，则粗化的结果是在同一朝向树的第K-1级选择一个分割模式，而细化的结果是在同一朝向树的第K+1级选择一个分割模式(0＜K＜10)。3)沿朝向树粗化和细化的过程中，存在允许和不被允许的分割模式。如当前在分割模式和朝向地形图中对应选定宏块的朝向标志为水平朝向，则细化/粗化规则允许该分割模式被细化/粗化为另一水平 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) 分割模式，或者被细化/粗化为一个各向同性模式(同时要保留水平朝向标志)，但不能细化/粗化为一个无朝向模式。(同理适用于垂直朝向。)如当前在分割模式和朝向地形图中对应选定宏块的朝向标志为水平朝向，而试探分割模式为一各向同性模式(在水平朝向子树和垂直朝向子树中都存在若干各向同性模式)，且该模式需要被细化/粗化，则细化/粗化规则允许该分割模式被细化/粗化为一水平分割模式，但不能细化/粗化为一个无朝向模式。(同理适用于垂直朝向。) CN1589022A CLAIM 9 . 根据权利要求1所述的本方法可应用到有多于一个参考帧时的情形，特点包括：1)如当前帧的运动估计需要用到多个参考 (data stream) 帧时，对各个参考帧的分割模式和朝向地图均予以保存。这些参考帧均来自同一个GOP，但由于细化和粗化机制的存在，因此就每一个宏块来说，所对应的朝向标志在各个参考帧对应的地图中是一致的；但在各个地图中给出的分割模式则不一定一致。2)就一个宏块来说，其最终分割模式的确定需要对每个地图均进行比较，并以代价函数mcost最小的那一个作为其分割模式。3)当出现某两个地图恰好给出同样的代价函数时，本方法选择细粒程度较粗的那一个。
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal (余预测) based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset of the second set of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	CN1589022A CLAIM 1 . 在以块为单位的多模式多尺度运动估计中，能够简便快速确定帧间预测宏块分割模式的方法，包括以下特征：1)将一个16×16像素块(下称为“宏块”)的各种可能的分割模式，按分割的细粒程度(granularity)分为从0到10共11个等级。2)将所分成的11个等级的分割模式按一定的划分规则组成一个树状结构，在该结构中，由于宏块中像素块分割具有朝向特性，即各像素亮度值空间分布的不同使得不同尺寸像素块运动估计的SAD值不同，分成水平朝向和垂直朝向两类，因此该结构形成朝向树。3)利用分割模式和朝向地图简便快速确定帧间预测宏块分割模式。4)以GOP为单位对视频序列中各预测帧的每一宏块的运动估计模式做出决定，其中包括：(1)、对GOP中第一个P帧的处理方法；(2)用第一个P帧中已确定的最优分割模式和朝向地图对GOP中其余预测 (prediction signal) 帧(B或P)进行处理的方法，其特征在于采用了时间轴上惯性分割模式思想和微调整思想。5)本方法应用到有多于一个参考帧时的情形。
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level (水平方向, 一水平, 的水平, 包括水平) (水平方向, 一水平, 的水平, 包括水平) according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level (水平方向, 一水平, 的水平, 包括水平) is reached .	CN1589022A CLAIM 3 . 根据权利要求1所述的建立朝向树的方法，特征在于将权利要求2中的11个等级的分割模式，根据朝向特性按一定的划分规则组成一个树状结构，具体包含如下特征：1)“树根”只有一个，处于第0级，即不对该宏块做任何分割的模式。2)此树根模式有两个直接的“子女”分割模式(第1级模式)，即等分为两个具有水平分割特点的16×8像素块模式，和等分为两个具有垂直分割特点的8×16像素块模式。3)树的第2级有两个模式，它们都是将原16×16宏块等分为4个8×8的像素块，分别由第1级模式中不同的“父母”模式经过进一步细分而得到，但此两个分割模式是完全一样的。4)从第2级往下，整个树分为有朝向子树(包括水平 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) 朝向子树和垂直朝向子树)和无朝向子树。有朝向子树具有两条“生长”规则：每个模式的子女模式，要么是在该模式的基础上，对尚存的任何一个正方形像素块(8×8)在水平方向 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) 上或垂直方向上进行恰好一次平分而形成；要么是在该模式的基础上，将一对有朝向的长方形像素块分割成四个4×4像素块而形成。此过程一直进行到该宏块已被全部分割为16个4×4像素块为止。这样形成的朝向子树有以下三个特点：A . 越靠近根部的分割模式，在空间上的细粒度越粗；而越远离根部的分割模式，空间上的细粒度越细。B . 由第1级往下的水平 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) /垂直朝向子树中的每一个模式中，只存在同向方向分割或各向同性分割(即四个4×4像素块或四个8×8像素块)，不存在反向方向分割。c . 水平朝向树枝和垂直朝向树枝中有些分割模式是等同的，第10级模式是所有分支的树叶。5)从第3级至第9级，凡是既不属于水平朝向子树又不属于垂直朝向子树的混合朝向分割模式，均归入无朝向子树。无朝向子树的“生长”规则：在一个无朝向分割模式中，要么全由各向同性分割组成，要么既含有水平分割也含有垂直分割，同级的分割模式细粒程度均一样。 CN1589022A CLAIM 7 . 根据权利要求4所述的用已确定的最优分割模式和朝向地图对下一个预测帧(B或P)进行处理的方法，其特征在于采用了时间轴上惯性分割模式思想和微调整思想，包括如下：1)时间轴上惯性分割模式思想，即利用当前帧与参考帧之间的相关性，将参考帧对应位置宏块的分割模式(记载在权利 (maximum hierarchy) 6所述的最优分割模式和朝向地图中)作为当前宏块分割模式选择过程开始时的缺省分割模式MODE0，进行整数像素级别的运动估计。得出选定宏块缺省分割模式下的SAD(残差和)、总残差和SAD0和一个代价函数mcost0。2)微调整思想：将SAD0与定量界定标准“SAD上限”和“SAD下限”进行比较，根据结果判定是否对缺省分割模式进行未调整，从而确定是接受缺省分割模式的代价函数mcost，还是经过微调整后的当前分割模式代价函数mcost1。3)进行比较步骤：即将新的综合代价函数mcost1与缺省综合代价函数mcost0进行比较，选择代价函数较小的那一个分割模式。4)修改分割模式和朝向地图：根据比较步骤中的结果确定是否要修改分割模式和朝向地图，即保留上述步骤中确认保留的综合代价函数mcost所对应的mode。据此对分割模式和朝向地图中本宏块的登记项进行修改或延用，并以此为下一个预测帧中对应位置的宏块的缺省分割模式。 CN1589022A CLAIM 8 . 根据权利要求7所述的微调整思想，即粗化和细化的方法，包含如下特征：1)本方法用“SAD上限”和“SAD下限”来定量界定“满意”。“SAD上限”和“SAD下限”是根据选定宏块的相邻信息推算获得的两个经验值。将缺省分割模式的总残差和SAD0与“SAD上限”和“SAD下限”进行比较，如果SAD0介于这两者之间，就认为该缺省模式符合编码要求，接受用该分割模式得出的运动估计结果。如果SAD0大于“SAD上限”，本方法认为该缺省分割模式分得太粗，需要“细化”。如果SAD0小于“SAD下限”，本方法认为该缺省分割模式分得太细，需要“粗化”。2)在本方法中，粗化和细化有两个共同特点：A . 粗化和细化都是在朝向标志约束下进行的。即对于每一个宏块来说，如果在对一个GOP的第一个P帧的编码时被登记为水平/垂直标志，则该GOP中所有后续预测帧中该宏块都将以同方向朝向子树中的分割模式进行运动估计。B . 粗化和细化都只在朝向树中的相邻级进行。即如果当前缺省分割模式位于朝向树的第K级，则粗化的结果是在同一朝向树的第K-1级选择一个分割模式，而细化的结果是在同一朝向树的第K+1级选择一个分割模式(0＜K＜10)。3)沿朝向树粗化和细化的过程中，存在允许和不被允许的分割模式。如当前在分割模式和朝向地形图中对应选定宏块的朝向标志为水平朝向，则细化/粗化规则允许该分割模式被细化/粗化为另一水平 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) 分割模式，或者被细化/粗化为一个各向同性模式(同时要保留水平朝向标志)，但不能细化/粗化为一个无朝向模式。(同理适用于垂直朝向。)如当前在分割模式和朝向地形图中对应选定宏块的朝向标志为水平朝向，而试探分割模式为一各向同性模式(在水平朝向子树和垂直朝向子树中都存在若干各向同性模式)，且该模式需要被细化/粗化，则细化/粗化规则允许该分割模式被细化/粗化为一水平分割模式，但不能细化/粗化为一个无朝向模式。(同理适用于垂直朝向。)
US10250913B2 CLAIM 5 . The decoder according to claim 4 , wherein the divider is configured to , in accordance with the partition rules associated with the first and higher-order hierarchy levels , sub-divide into sub-regions of equal size , such that there are an equal number of sub-regions at each hierarchy level (水平方向, 一水平, 的水平, 包括水平) .	CN1589022A CLAIM 3 . 根据权利要求1所述的建立朝向树的方法，特征在于将权利要求2中的11个等级的分割模式，根据朝向特性按一定的划分规则组成一个树状结构，具体包含如下特征：1)“树根”只有一个，处于第0级，即不对该宏块做任何分割的模式。2)此树根模式有两个直接的“子女”分割模式(第1级模式)，即等分为两个具有水平分割特点的16×8像素块模式，和等分为两个具有垂直分割特点的8×16像素块模式。3)树的第2级有两个模式，它们都是将原16×16宏块等分为4个8×8的像素块，分别由第1级模式中不同的“父母”模式经过进一步细分而得到，但此两个分割模式是完全一样的。4)从第2级往下，整个树分为有朝向子树(包括水平 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) 朝向子树和垂直朝向子树)和无朝向子树。有朝向子树具有两条“生长”规则：每个模式的子女模式，要么是在该模式的基础上，对尚存的任何一个正方形像素块(8×8)在水平方向 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) 上或垂直方向上进行恰好一次平分而形成；要么是在该模式的基础上，将一对有朝向的长方形像素块分割成四个4×4像素块而形成。此过程一直进行到该宏块已被全部分割为16个4×4像素块为止。这样形成的朝向子树有以下三个特点：A . 越靠近根部的分割模式，在空间上的细粒度越粗；而越远离根部的分割模式，空间上的细粒度越细。B . 由第1级往下的水平 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) /垂直朝向子树中的每一个模式中，只存在同向方向分割或各向同性分割(即四个4×4像素块或四个8×8像素块)，不存在反向方向分割。c . 水平朝向树枝和垂直朝向树枝中有些分割模式是等同的，第10级模式是所有分支的树叶。5)从第3级至第9级，凡是既不属于水平朝向子树又不属于垂直朝向子树的混合朝向分割模式，均归入无朝向子树。无朝向子树的“生长”规则：在一个无朝向分割模式中，要么全由各向同性分割组成，要么既含有水平分割也含有垂直分割，同级的分割模式细粒程度均一样。 CN1589022A CLAIM 8 . 根据权利要求7所述的微调整思想，即粗化和细化的方法，包含如下特征：1)本方法用“SAD上限”和“SAD下限”来定量界定“满意”。“SAD上限”和“SAD下限”是根据选定宏块的相邻信息推算获得的两个经验值。将缺省分割模式的总残差和SAD0与“SAD上限”和“SAD下限”进行比较，如果SAD0介于这两者之间，就认为该缺省模式符合编码要求，接受用该分割模式得出的运动估计结果。如果SAD0大于“SAD上限”，本方法认为该缺省分割模式分得太粗，需要“细化”。如果SAD0小于“SAD下限”，本方法认为该缺省分割模式分得太细，需要“粗化”。2)在本方法中，粗化和细化有两个共同特点：A . 粗化和细化都是在朝向标志约束下进行的。即对于每一个宏块来说，如果在对一个GOP的第一个P帧的编码时被登记为水平/垂直标志，则该GOP中所有后续预测帧中该宏块都将以同方向朝向子树中的分割模式进行运动估计。B . 粗化和细化都只在朝向树中的相邻级进行。即如果当前缺省分割模式位于朝向树的第K级，则粗化的结果是在同一朝向树的第K-1级选择一个分割模式，而细化的结果是在同一朝向树的第K+1级选择一个分割模式(0＜K＜10)。3)沿朝向树粗化和细化的过程中，存在允许和不被允许的分割模式。如当前在分割模式和朝向地形图中对应选定宏块的朝向标志为水平朝向，则细化/粗化规则允许该分割模式被细化/粗化为另一水平 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) 分割模式，或者被细化/粗化为一个各向同性模式(同时要保留水平朝向标志)，但不能细化/粗化为一个无朝向模式。(同理适用于垂直朝向。)如当前在分割模式和朝向地形图中对应选定宏块的朝向标志为水平朝向，而试探分割模式为一各向同性模式(在水平朝向子树和垂直朝向子树中都存在若干各向同性模式)，且该模式需要被细化/粗化，则细化/粗化规则允许该分割模式被细化/粗化为一水平分割模式，但不能细化/粗化为一个无朝向模式。(同理适用于垂直朝向。)
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision information includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level (水平方向, 一水平, 的水平, 包括水平) is sub-divided .	CN1589022A CLAIM 3 . 根据权利要求1所述的建立朝向树的方法，特征在于将权利要求2中的11个等级的分割模式，根据朝向特性按一定的划分规则组成一个树状结构，具体包含如下特征：1)“树根”只有一个，处于第0级，即不对该宏块做任何分割的模式。2)此树根模式有两个直接的“子女”分割模式(第1级模式)，即等分为两个具有水平分割特点的16×8像素块模式，和等分为两个具有垂直分割特点的8×16像素块模式。3)树的第2级有两个模式，它们都是将原16×16宏块等分为4个8×8的像素块，分别由第1级模式中不同的“父母”模式经过进一步细分而得到，但此两个分割模式是完全一样的。4)从第2级往下，整个树分为有朝向子树(包括水平 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) 朝向子树和垂直朝向子树)和无朝向子树。有朝向子树具有两条“生长”规则：每个模式的子女模式，要么是在该模式的基础上，对尚存的任何一个正方形像素块(8×8)在水平方向 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) 上或垂直方向上进行恰好一次平分而形成；要么是在该模式的基础上，将一对有朝向的长方形像素块分割成四个4×4像素块而形成。此过程一直进行到该宏块已被全部分割为16个4×4像素块为止。这样形成的朝向子树有以下三个特点：A . 越靠近根部的分割模式，在空间上的细粒度越粗；而越远离根部的分割模式，空间上的细粒度越细。B . 由第1级往下的水平 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) /垂直朝向子树中的每一个模式中，只存在同向方向分割或各向同性分割(即四个4×4像素块或四个8×8像素块)，不存在反向方向分割。c . 水平朝向树枝和垂直朝向树枝中有些分割模式是等同的，第10级模式是所有分支的树叶。5)从第3级至第9级，凡是既不属于水平朝向子树又不属于垂直朝向子树的混合朝向分割模式，均归入无朝向子树。无朝向子树的“生长”规则：在一个无朝向分割模式中，要么全由各向同性分割组成，要么既含有水平分割也含有垂直分割，同级的分割模式细粒程度均一样。 CN1589022A CLAIM 8 . 根据权利要求7所述的微调整思想，即粗化和细化的方法，包含如下特征：1)本方法用“SAD上限”和“SAD下限”来定量界定“满意”。“SAD上限”和“SAD下限”是根据选定宏块的相邻信息推算获得的两个经验值。将缺省分割模式的总残差和SAD0与“SAD上限”和“SAD下限”进行比较，如果SAD0介于这两者之间，就认为该缺省模式符合编码要求，接受用该分割模式得出的运动估计结果。如果SAD0大于“SAD上限”，本方法认为该缺省分割模式分得太粗，需要“细化”。如果SAD0小于“SAD下限”，本方法认为该缺省分割模式分得太细，需要“粗化”。2)在本方法中，粗化和细化有两个共同特点：A . 粗化和细化都是在朝向标志约束下进行的。即对于每一个宏块来说，如果在对一个GOP的第一个P帧的编码时被登记为水平/垂直标志，则该GOP中所有后续预测帧中该宏块都将以同方向朝向子树中的分割模式进行运动估计。B . 粗化和细化都只在朝向树中的相邻级进行。即如果当前缺省分割模式位于朝向树的第K级，则粗化的结果是在同一朝向树的第K-1级选择一个分割模式，而细化的结果是在同一朝向树的第K+1级选择一个分割模式(0＜K＜10)。3)沿朝向树粗化和细化的过程中，存在允许和不被允许的分割模式。如当前在分割模式和朝向地形图中对应选定宏块的朝向标志为水平朝向，则细化/粗化规则允许该分割模式被细化/粗化为另一水平 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) 分割模式，或者被细化/粗化为一个各向同性模式(同时要保留水平朝向标志)，但不能细化/粗化为一个无朝向模式。(同理适用于垂直朝向。)如当前在分割模式和朝向地形图中对应选定宏块的朝向标志为水平朝向，而试探分割模式为一各向同性模式(在水平朝向子树和垂直朝向子树中都存在若干各向同性模式)，且该模式需要被细化/粗化，则细化/粗化规则允许该分割模式被细化/粗化为一水平分割模式，但不能细化/粗化为一个无朝向模式。(同理适用于垂直朝向。)
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level (水平方向, 一水平, 的水平, 包括水平) (水平方向, 一水平, 的水平, 包括水平) from the data stream (多个参考) .	CN1589022A CLAIM 3 . 根据权利要求1所述的建立朝向树的方法，特征在于将权利要求2中的11个等级的分割模式，根据朝向特性按一定的划分规则组成一个树状结构，具体包含如下特征：1)“树根”只有一个，处于第0级，即不对该宏块做任何分割的模式。2)此树根模式有两个直接的“子女”分割模式(第1级模式)，即等分为两个具有水平分割特点的16×8像素块模式，和等分为两个具有垂直分割特点的8×16像素块模式。3)树的第2级有两个模式，它们都是将原16×16宏块等分为4个8×8的像素块，分别由第1级模式中不同的“父母”模式经过进一步细分而得到，但此两个分割模式是完全一样的。4)从第2级往下，整个树分为有朝向子树(包括水平 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) 朝向子树和垂直朝向子树)和无朝向子树。有朝向子树具有两条“生长”规则：每个模式的子女模式，要么是在该模式的基础上，对尚存的任何一个正方形像素块(8×8)在水平方向 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) 上或垂直方向上进行恰好一次平分而形成；要么是在该模式的基础上，将一对有朝向的长方形像素块分割成四个4×4像素块而形成。此过程一直进行到该宏块已被全部分割为16个4×4像素块为止。这样形成的朝向子树有以下三个特点：A . 越靠近根部的分割模式，在空间上的细粒度越粗；而越远离根部的分割模式，空间上的细粒度越细。B . 由第1级往下的水平 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) /垂直朝向子树中的每一个模式中，只存在同向方向分割或各向同性分割(即四个4×4像素块或四个8×8像素块)，不存在反向方向分割。c . 水平朝向树枝和垂直朝向树枝中有些分割模式是等同的，第10级模式是所有分支的树叶。5)从第3级至第9级，凡是既不属于水平朝向子树又不属于垂直朝向子树的混合朝向分割模式，均归入无朝向子树。无朝向子树的“生长”规则：在一个无朝向分割模式中，要么全由各向同性分割组成，要么既含有水平分割也含有垂直分割，同级的分割模式细粒程度均一样。 CN1589022A CLAIM 7 . 根据权利要求4所述的用已确定的最优分割模式和朝向地图对下一个预测帧(B或P)进行处理的方法，其特征在于采用了时间轴上惯性分割模式思想和微调整思想，包括如下：1)时间轴上惯性分割模式思想，即利用当前帧与参考帧之间的相关性，将参考帧对应位置宏块的分割模式(记载在权利 (maximum hierarchy) 6所述的最优分割模式和朝向地图中)作为当前宏块分割模式选择过程开始时的缺省分割模式MODE0，进行整数像素级别的运动估计。得出选定宏块缺省分割模式下的SAD(残差和)、总残差和SAD0和一个代价函数mcost0。2)微调整思想：将SAD0与定量界定标准“SAD上限”和“SAD下限”进行比较，根据结果判定是否对缺省分割模式进行未调整，从而确定是接受缺省分割模式的代价函数mcost，还是经过微调整后的当前分割模式代价函数mcost1。3)进行比较步骤：即将新的综合代价函数mcost1与缺省综合代价函数mcost0进行比较，选择代价函数较小的那一个分割模式。4)修改分割模式和朝向地图：根据比较步骤中的结果确定是否要修改分割模式和朝向地图，即保留上述步骤中确认保留的综合代价函数mcost所对应的mode。据此对分割模式和朝向地图中本宏块的登记项进行修改或延用，并以此为下一个预测帧中对应位置的宏块的缺省分割模式。 CN1589022A CLAIM 8 . 根据权利要求7所述的微调整思想，即粗化和细化的方法，包含如下特征：1)本方法用“SAD上限”和“SAD下限”来定量界定“满意”。“SAD上限”和“SAD下限”是根据选定宏块的相邻信息推算获得的两个经验值。将缺省分割模式的总残差和SAD0与“SAD上限”和“SAD下限”进行比较，如果SAD0介于这两者之间，就认为该缺省模式符合编码要求，接受用该分割模式得出的运动估计结果。如果SAD0大于“SAD上限”，本方法认为该缺省分割模式分得太粗，需要“细化”。如果SAD0小于“SAD下限”，本方法认为该缺省分割模式分得太细，需要“粗化”。2)在本方法中，粗化和细化有两个共同特点：A . 粗化和细化都是在朝向标志约束下进行的。即对于每一个宏块来说，如果在对一个GOP的第一个P帧的编码时被登记为水平/垂直标志，则该GOP中所有后续预测帧中该宏块都将以同方向朝向子树中的分割模式进行运动估计。B . 粗化和细化都只在朝向树中的相邻级进行。即如果当前缺省分割模式位于朝向树的第K级，则粗化的结果是在同一朝向树的第K-1级选择一个分割模式，而细化的结果是在同一朝向树的第K+1级选择一个分割模式(0＜K＜10)。3)沿朝向树粗化和细化的过程中，存在允许和不被允许的分割模式。如当前在分割模式和朝向地形图中对应选定宏块的朝向标志为水平朝向，则细化/粗化规则允许该分割模式被细化/粗化为另一水平 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) 分割模式，或者被细化/粗化为一个各向同性模式(同时要保留水平朝向标志)，但不能细化/粗化为一个无朝向模式。(同理适用于垂直朝向。)如当前在分割模式和朝向地形图中对应选定宏块的朝向标志为水平朝向，而试探分割模式为一各向同性模式(在水平朝向子树和垂直朝向子树中都存在若干各向同性模式)，且该模式需要被细化/粗化，则细化/粗化规则允许该分割模式被细化/粗化为一水平分割模式，但不能细化/粗化为一个无朝向模式。(同理适用于垂直朝向。) CN1589022A CLAIM 9 . 根据权利要求1所述的本方法可应用到有多于一个参考帧时的情形，特点包括：1)如当前帧的运动估计需要用到多个参考 (data stream) 帧时，对各个参考帧的分割模式和朝向地图均予以保存。这些参考帧均来自同一个GOP，但由于细化和粗化机制的存在，因此就每一个宏块来说，所对应的朝向标志在各个参考帧对应的地图中是一致的；但在各个地图中给出的分割模式则不一定一致。2)就一个宏块来说，其最终分割模式的确定需要对每个地图均进行比较，并以代价函数mcost最小的那一个作为其分割模式。3)当出现某两个地图恰好给出同样的代价函数时，本方法选择细粒程度较粗的那一个。
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements associated with the first or second set of sub-regions from the data stream (多个参考) in a depth-first traversal order .	CN1589022A CLAIM 9 . 根据权利要求1所述的本方法可应用到有多于一个参考帧时的情形，特点包括：1)如当前帧的运动估计需要用到多个参考 (data stream) 帧时，对各个参考帧的分割模式和朝向地图均予以保存。这些参考帧均来自同一个GOP，但由于细化和粗化机制的存在，因此就每一个宏块来说，所对应的朝向标志在各个参考帧对应的地图中是一致的；但在各个地图中给出的分割模式则不一定一致。2)就一个宏块来说，其最终分割模式的确定需要对每个地图均进行比较，并以代价函数mcost最小的那一个作为其分割模式。3)当出现某两个地图恰好给出同样的代价函数时，本方法选择细粒程度较粗的那一个。
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream (多个参考) , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	CN1589022A CLAIM 9 . 根据权利要求1所述的本方法可应用到有多于一个参考帧时的情形，特点包括：1)如当前帧的运动估计需要用到多个参考 (data stream) 帧时，对各个参考帧的分割模式和朝向地图均予以保存。这些参考帧均来自同一个GOP，但由于细化和粗化机制的存在，因此就每一个宏块来说，所对应的朝向标志在各个参考帧对应的地图中是一致的；但在各个地图中给出的分割模式则不一定一致。2)就一个宏块来说，其最终分割模式的确定需要对每个地图均进行比较，并以代价函数mcost最小的那一个作为其分割模式。3)当出现某两个地图恰好给出同样的代价函数时，本方法选择细粒程度较粗的那一个。
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream (多个参考) , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	CN1589022A CLAIM 9 . 根据权利要求1所述的本方法可应用到有多于一个参考帧时的情形，特点包括：1)如当前帧的运动估计需要用到多个参考 (data stream) 帧时，对各个参考帧的分割模式和朝向地图均予以保存。这些参考帧均来自同一个GOP，但由于细化和粗化机制的存在，因此就每一个宏块来说，所对应的朝向标志在各个参考帧对应的地图中是一致的；但在各个地图中给出的分割模式则不一定一致。2)就一个宏块来说，其最终分割模式的确定需要对每个地图均进行比较，并以代价函数mcost最小的那一个作为其分割模式。3)当出现某两个地图恰好给出同样的代价函数时，本方法选择细粒程度较粗的那一个。
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream (多个参考) representing encoded video information (视频信号) , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level (水平方向, 一水平, 的水平, 包括水平) (水平方向, 一水平, 的水平, 包括水平) , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN1589022A CLAIM 3 . 根据权利要求1所述的建立朝向树的方法，特征在于将权利要求2中的11个等级的分割模式，根据朝向特性按一定的划分规则组成一个树状结构，具体包含如下特征：1)“树根”只有一个，处于第0级，即不对该宏块做任何分割的模式。2)此树根模式有两个直接的“子女”分割模式(第1级模式)，即等分为两个具有水平分割特点的16×8像素块模式，和等分为两个具有垂直分割特点的8×16像素块模式。3)树的第2级有两个模式，它们都是将原16×16宏块等分为4个8×8的像素块，分别由第1级模式中不同的“父母”模式经过进一步细分而得到，但此两个分割模式是完全一样的。4)从第2级往下，整个树分为有朝向子树(包括水平 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) 朝向子树和垂直朝向子树)和无朝向子树。有朝向子树具有两条“生长”规则：每个模式的子女模式，要么是在该模式的基础上，对尚存的任何一个正方形像素块(8×8)在水平方向 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) 上或垂直方向上进行恰好一次平分而形成；要么是在该模式的基础上，将一对有朝向的长方形像素块分割成四个4×4像素块而形成。此过程一直进行到该宏块已被全部分割为16个4×4像素块为止。这样形成的朝向子树有以下三个特点：A . 越靠近根部的分割模式，在空间上的细粒度越粗；而越远离根部的分割模式，空间上的细粒度越细。B . 由第1级往下的水平 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) /垂直朝向子树中的每一个模式中，只存在同向方向分割或各向同性分割(即四个4×4像素块或四个8×8像素块)，不存在反向方向分割。c . 水平朝向树枝和垂直朝向树枝中有些分割模式是等同的，第10级模式是所有分支的树叶。5)从第3级至第9级，凡是既不属于水平朝向子树又不属于垂直朝向子树的混合朝向分割模式，均归入无朝向子树。无朝向子树的“生长”规则：在一个无朝向分割模式中，要么全由各向同性分割组成，要么既含有水平分割也含有垂直分割，同级的分割模式细粒程度均一样。 CN1589022A CLAIM 5 . 根据权利要求4所述的选择初始模式的方法，其特征在于采用了起始点思想，包括如下：1)整个算法以数字视频信号 (video information) 序列单元GOP为单位进行。确定整个方法的起始点为每个GOP的第一个P帧。2)采用“代价函数mcost”作为衡量一个分割模式优劣的判据。代价函数mcost是一个综合了残差和SAD以及其它编码开销(例如运动矢量数据等)的数值。如果一个分割模式导致的代价函数小于另一个分割模式导致的代价函数，则该分割模式优于另一个分割模式。3)对每个GOP中第一个P帧的分割模式的确定是后续过程的基础。因此，当计算时间允许时，在初始模式集中也可以包含更多种的分割模式，且可为任意的。 CN1589022A CLAIM 7 . 根据权利要求4所述的用已确定的最优分割模式和朝向地图对下一个预测帧(B或P)进行处理的方法，其特征在于采用了时间轴上惯性分割模式思想和微调整思想，包括如下：1)时间轴上惯性分割模式思想，即利用当前帧与参考帧之间的相关性，将参考帧对应位置宏块的分割模式(记载在权利 (maximum hierarchy) 6所述的最优分割模式和朝向地图中)作为当前宏块分割模式选择过程开始时的缺省分割模式MODE0，进行整数像素级别的运动估计。得出选定宏块缺省分割模式下的SAD(残差和)、总残差和SAD0和一个代价函数mcost0。2)微调整思想：将SAD0与定量界定标准“SAD上限”和“SAD下限”进行比较，根据结果判定是否对缺省分割模式进行未调整，从而确定是接受缺省分割模式的代价函数mcost，还是经过微调整后的当前分割模式代价函数mcost1。3)进行比较步骤：即将新的综合代价函数mcost1与缺省综合代价函数mcost0进行比较，选择代价函数较小的那一个分割模式。4)修改分割模式和朝向地图：根据比较步骤中的结果确定是否要修改分割模式和朝向地图，即保留上述步骤中确认保留的综合代价函数mcost所对应的mode。据此对分割模式和朝向地图中本宏块的登记项进行修改或延用，并以此为下一个预测帧中对应位置的宏块的缺省分割模式。 CN1589022A CLAIM 8 . 根据权利要求7所述的微调整思想，即粗化和细化的方法，包含如下特征：1)本方法用“SAD上限”和“SAD下限”来定量界定“满意”。“SAD上限”和“SAD下限”是根据选定宏块的相邻信息推算获得的两个经验值。将缺省分割模式的总残差和SAD0与“SAD上限”和“SAD下限”进行比较，如果SAD0介于这两者之间，就认为该缺省模式符合编码要求，接受用该分割模式得出的运动估计结果。如果SAD0大于“SAD上限”，本方法认为该缺省分割模式分得太粗，需要“细化”。如果SAD0小于“SAD下限”，本方法认为该缺省分割模式分得太细，需要“粗化”。2)在本方法中，粗化和细化有两个共同特点：A . 粗化和细化都是在朝向标志约束下进行的。即对于每一个宏块来说，如果在对一个GOP的第一个P帧的编码时被登记为水平/垂直标志，则该GOP中所有后续预测帧中该宏块都将以同方向朝向子树中的分割模式进行运动估计。B . 粗化和细化都只在朝向树中的相邻级进行。即如果当前缺省分割模式位于朝向树的第K级，则粗化的结果是在同一朝向树的第K-1级选择一个分割模式，而细化的结果是在同一朝向树的第K+1级选择一个分割模式(0＜K＜10)。3)沿朝向树粗化和细化的过程中，存在允许和不被允许的分割模式。如当前在分割模式和朝向地形图中对应选定宏块的朝向标志为水平朝向，则细化/粗化规则允许该分割模式被细化/粗化为另一水平 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) 分割模式，或者被细化/粗化为一个各向同性模式(同时要保留水平朝向标志)，但不能细化/粗化为一个无朝向模式。(同理适用于垂直朝向。)如当前在分割模式和朝向地形图中对应选定宏块的朝向标志为水平朝向，而试探分割模式为一各向同性模式(在水平朝向子树和垂直朝向子树中都存在若干各向同性模式)，且该模式需要被细化/粗化，则细化/粗化规则允许该分割模式被细化/粗化为一水平分割模式，但不能细化/粗化为一个无朝向模式。(同理适用于垂直朝向。) CN1589022A CLAIM 9 . 根据权利要求1所述的本方法可应用到有多于一个参考帧时的情形，特点包括：1)如当前帧的运动估计需要用到多个参考 (data stream) 帧时，对各个参考帧的分割模式和朝向地图均予以保存。这些参考帧均来自同一个GOP，但由于细化和粗化机制的存在，因此就每一个宏块来说，所对应的朝向标志在各个参考帧对应的地图中是一致的；但在各个地图中给出的分割模式则不一定一致。2)就一个宏块来说，其最终分割模式的确定需要对每个地图均进行比较，并以代价函数mcost最小的那一个作为其分割模式。3)当出现某两个地图恰好给出同样的代价函数时，本方法选择细粒程度较粗的那一个。
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information (视频信号) into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level (水平方向, 一水平, 的水平, 包括水平) (水平方向, 一水平, 的水平, 包括水平) ; and a data stream (多个参考) generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN1589022A CLAIM 3 . 根据权利要求1所述的建立朝向树的方法，特征在于将权利要求2中的11个等级的分割模式，根据朝向特性按一定的划分规则组成一个树状结构，具体包含如下特征：1)“树根”只有一个，处于第0级，即不对该宏块做任何分割的模式。2)此树根模式有两个直接的“子女”分割模式(第1级模式)，即等分为两个具有水平分割特点的16×8像素块模式，和等分为两个具有垂直分割特点的8×16像素块模式。3)树的第2级有两个模式，它们都是将原16×16宏块等分为4个8×8的像素块，分别由第1级模式中不同的“父母”模式经过进一步细分而得到，但此两个分割模式是完全一样的。4)从第2级往下，整个树分为有朝向子树(包括水平 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) 朝向子树和垂直朝向子树)和无朝向子树。有朝向子树具有两条“生长”规则：每个模式的子女模式，要么是在该模式的基础上，对尚存的任何一个正方形像素块(8×8)在水平方向 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) 上或垂直方向上进行恰好一次平分而形成；要么是在该模式的基础上，将一对有朝向的长方形像素块分割成四个4×4像素块而形成。此过程一直进行到该宏块已被全部分割为16个4×4像素块为止。这样形成的朝向子树有以下三个特点：A . 越靠近根部的分割模式，在空间上的细粒度越粗；而越远离根部的分割模式，空间上的细粒度越细。B . 由第1级往下的水平 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) /垂直朝向子树中的每一个模式中，只存在同向方向分割或各向同性分割(即四个4×4像素块或四个8×8像素块)，不存在反向方向分割。c . 水平朝向树枝和垂直朝向树枝中有些分割模式是等同的，第10级模式是所有分支的树叶。5)从第3级至第9级，凡是既不属于水平朝向子树又不属于垂直朝向子树的混合朝向分割模式，均归入无朝向子树。无朝向子树的“生长”规则：在一个无朝向分割模式中，要么全由各向同性分割组成，要么既含有水平分割也含有垂直分割，同级的分割模式细粒程度均一样。 CN1589022A CLAIM 5 . 根据权利要求4所述的选择初始模式的方法，其特征在于采用了起始点思想，包括如下：1)整个算法以数字视频信号 (video information) 序列单元GOP为单位进行。确定整个方法的起始点为每个GOP的第一个P帧。2)采用“代价函数mcost”作为衡量一个分割模式优劣的判据。代价函数mcost是一个综合了残差和SAD以及其它编码开销(例如运动矢量数据等)的数值。如果一个分割模式导致的代价函数小于另一个分割模式导致的代价函数，则该分割模式优于另一个分割模式。3)对每个GOP中第一个P帧的分割模式的确定是后续过程的基础。因此，当计算时间允许时，在初始模式集中也可以包含更多种的分割模式，且可为任意的。 CN1589022A CLAIM 7 . 根据权利要求4所述的用已确定的最优分割模式和朝向地图对下一个预测帧(B或P)进行处理的方法，其特征在于采用了时间轴上惯性分割模式思想和微调整思想，包括如下：1)时间轴上惯性分割模式思想，即利用当前帧与参考帧之间的相关性，将参考帧对应位置宏块的分割模式(记载在权利 (maximum hierarchy) 6所述的最优分割模式和朝向地图中)作为当前宏块分割模式选择过程开始时的缺省分割模式MODE0，进行整数像素级别的运动估计。得出选定宏块缺省分割模式下的SAD(残差和)、总残差和SAD0和一个代价函数mcost0。2)微调整思想：将SAD0与定量界定标准“SAD上限”和“SAD下限”进行比较，根据结果判定是否对缺省分割模式进行未调整，从而确定是接受缺省分割模式的代价函数mcost，还是经过微调整后的当前分割模式代价函数mcost1。3)进行比较步骤：即将新的综合代价函数mcost1与缺省综合代价函数mcost0进行比较，选择代价函数较小的那一个分割模式。4)修改分割模式和朝向地图：根据比较步骤中的结果确定是否要修改分割模式和朝向地图，即保留上述步骤中确认保留的综合代价函数mcost所对应的mode。据此对分割模式和朝向地图中本宏块的登记项进行修改或延用，并以此为下一个预测帧中对应位置的宏块的缺省分割模式。 CN1589022A CLAIM 8 . 根据权利要求7所述的微调整思想，即粗化和细化的方法，包含如下特征：1)本方法用“SAD上限”和“SAD下限”来定量界定“满意”。“SAD上限”和“SAD下限”是根据选定宏块的相邻信息推算获得的两个经验值。将缺省分割模式的总残差和SAD0与“SAD上限”和“SAD下限”进行比较，如果SAD0介于这两者之间，就认为该缺省模式符合编码要求，接受用该分割模式得出的运动估计结果。如果SAD0大于“SAD上限”，本方法认为该缺省分割模式分得太粗，需要“细化”。如果SAD0小于“SAD下限”，本方法认为该缺省分割模式分得太细，需要“粗化”。2)在本方法中，粗化和细化有两个共同特点：A . 粗化和细化都是在朝向标志约束下进行的。即对于每一个宏块来说，如果在对一个GOP的第一个P帧的编码时被登记为水平/垂直标志，则该GOP中所有后续预测帧中该宏块都将以同方向朝向子树中的分割模式进行运动估计。B . 粗化和细化都只在朝向树中的相邻级进行。即如果当前缺省分割模式位于朝向树的第K级，则粗化的结果是在同一朝向树的第K-1级选择一个分割模式，而细化的结果是在同一朝向树的第K+1级选择一个分割模式(0＜K＜10)。3)沿朝向树粗化和细化的过程中，存在允许和不被允许的分割模式。如当前在分割模式和朝向地形图中对应选定宏块的朝向标志为水平朝向，则细化/粗化规则允许该分割模式被细化/粗化为另一水平 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) 分割模式，或者被细化/粗化为一个各向同性模式(同时要保留水平朝向标志)，但不能细化/粗化为一个无朝向模式。(同理适用于垂直朝向。)如当前在分割模式和朝向地形图中对应选定宏块的朝向标志为水平朝向，而试探分割模式为一各向同性模式(在水平朝向子树和垂直朝向子树中都存在若干各向同性模式)，且该模式需要被细化/粗化，则细化/粗化规则允许该分割模式被细化/粗化为一水平分割模式，但不能细化/粗化为一个无朝向模式。(同理适用于垂直朝向。) CN1589022A CLAIM 9 . 根据权利要求1所述的本方法可应用到有多于一个参考帧时的情形，特点包括：1)如当前帧的运动估计需要用到多个参考 (data stream) 帧时，对各个参考帧的分割模式和朝向地图均予以保存。这些参考帧均来自同一个GOP，但由于细化和粗化机制的存在，因此就每一个宏块来说，所对应的朝向标志在各个参考帧对应的地图中是一致的；但在各个地图中给出的分割模式则不一定一致。2)就一个宏块来说，其最终分割模式的确定需要对每个地图均进行比较，并以代价函数mcost最小的那一个作为其分割模式。3)当出现某两个地图恰好给出同样的代价函数时，本方法选择细粒程度较粗的那一个。
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information (视频信号) into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level (水平方向, 一水平, 的水平, 包括水平) (水平方向, 一水平, 的水平, 包括水平) ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream (多个参考) the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN1589022A CLAIM 3 . 根据权利要求1所述的建立朝向树的方法，特征在于将权利要求2中的11个等级的分割模式，根据朝向特性按一定的划分规则组成一个树状结构，具体包含如下特征：1)“树根”只有一个，处于第0级，即不对该宏块做任何分割的模式。2)此树根模式有两个直接的“子女”分割模式(第1级模式)，即等分为两个具有水平分割特点的16×8像素块模式，和等分为两个具有垂直分割特点的8×16像素块模式。3)树的第2级有两个模式，它们都是将原16×16宏块等分为4个8×8的像素块，分别由第1级模式中不同的“父母”模式经过进一步细分而得到，但此两个分割模式是完全一样的。4)从第2级往下，整个树分为有朝向子树(包括水平 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) 朝向子树和垂直朝向子树)和无朝向子树。有朝向子树具有两条“生长”规则：每个模式的子女模式，要么是在该模式的基础上，对尚存的任何一个正方形像素块(8×8)在水平方向 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) 上或垂直方向上进行恰好一次平分而形成；要么是在该模式的基础上，将一对有朝向的长方形像素块分割成四个4×4像素块而形成。此过程一直进行到该宏块已被全部分割为16个4×4像素块为止。这样形成的朝向子树有以下三个特点：A . 越靠近根部的分割模式，在空间上的细粒度越粗；而越远离根部的分割模式，空间上的细粒度越细。B . 由第1级往下的水平 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) /垂直朝向子树中的每一个模式中，只存在同向方向分割或各向同性分割(即四个4×4像素块或四个8×8像素块)，不存在反向方向分割。c . 水平朝向树枝和垂直朝向树枝中有些分割模式是等同的，第10级模式是所有分支的树叶。5)从第3级至第9级，凡是既不属于水平朝向子树又不属于垂直朝向子树的混合朝向分割模式，均归入无朝向子树。无朝向子树的“生长”规则：在一个无朝向分割模式中，要么全由各向同性分割组成，要么既含有水平分割也含有垂直分割，同级的分割模式细粒程度均一样。 CN1589022A CLAIM 5 . 根据权利要求4所述的选择初始模式的方法，其特征在于采用了起始点思想，包括如下：1)整个算法以数字视频信号 (video information) 序列单元GOP为单位进行。确定整个方法的起始点为每个GOP的第一个P帧。2)采用“代价函数mcost”作为衡量一个分割模式优劣的判据。代价函数mcost是一个综合了残差和SAD以及其它编码开销(例如运动矢量数据等)的数值。如果一个分割模式导致的代价函数小于另一个分割模式导致的代价函数，则该分割模式优于另一个分割模式。3)对每个GOP中第一个P帧的分割模式的确定是后续过程的基础。因此，当计算时间允许时，在初始模式集中也可以包含更多种的分割模式，且可为任意的。 CN1589022A CLAIM 7 . 根据权利要求4所述的用已确定的最优分割模式和朝向地图对下一个预测帧(B或P)进行处理的方法，其特征在于采用了时间轴上惯性分割模式思想和微调整思想，包括如下：1)时间轴上惯性分割模式思想，即利用当前帧与参考帧之间的相关性，将参考帧对应位置宏块的分割模式(记载在权利 (maximum hierarchy) 6所述的最优分割模式和朝向地图中)作为当前宏块分割模式选择过程开始时的缺省分割模式MODE0，进行整数像素级别的运动估计。得出选定宏块缺省分割模式下的SAD(残差和)、总残差和SAD0和一个代价函数mcost0。2)微调整思想：将SAD0与定量界定标准“SAD上限”和“SAD下限”进行比较，根据结果判定是否对缺省分割模式进行未调整，从而确定是接受缺省分割模式的代价函数mcost，还是经过微调整后的当前分割模式代价函数mcost1。3)进行比较步骤：即将新的综合代价函数mcost1与缺省综合代价函数mcost0进行比较，选择代价函数较小的那一个分割模式。4)修改分割模式和朝向地图：根据比较步骤中的结果确定是否要修改分割模式和朝向地图，即保留上述步骤中确认保留的综合代价函数mcost所对应的mode。据此对分割模式和朝向地图中本宏块的登记项进行修改或延用，并以此为下一个预测帧中对应位置的宏块的缺省分割模式。 CN1589022A CLAIM 8 . 根据权利要求7所述的微调整思想，即粗化和细化的方法，包含如下特征：1)本方法用“SAD上限”和“SAD下限”来定量界定“满意”。“SAD上限”和“SAD下限”是根据选定宏块的相邻信息推算获得的两个经验值。将缺省分割模式的总残差和SAD0与“SAD上限”和“SAD下限”进行比较，如果SAD0介于这两者之间，就认为该缺省模式符合编码要求，接受用该分割模式得出的运动估计结果。如果SAD0大于“SAD上限”，本方法认为该缺省分割模式分得太粗，需要“细化”。如果SAD0小于“SAD下限”，本方法认为该缺省分割模式分得太细，需要“粗化”。2)在本方法中，粗化和细化有两个共同特点：A . 粗化和细化都是在朝向标志约束下进行的。即对于每一个宏块来说，如果在对一个GOP的第一个P帧的编码时被登记为水平/垂直标志，则该GOP中所有后续预测帧中该宏块都将以同方向朝向子树中的分割模式进行运动估计。B . 粗化和细化都只在朝向树中的相邻级进行。即如果当前缺省分割模式位于朝向树的第K级，则粗化的结果是在同一朝向树的第K-1级选择一个分割模式，而细化的结果是在同一朝向树的第K+1级选择一个分割模式(0＜K＜10)。3)沿朝向树粗化和细化的过程中，存在允许和不被允许的分割模式。如当前在分割模式和朝向地形图中对应选定宏块的朝向标志为水平朝向，则细化/粗化规则允许该分割模式被细化/粗化为另一水平 (maximum hierarchy level, first hierarchy level, order hierarchy levels, hierarchy level, order hierarchy level) 分割模式，或者被细化/粗化为一个各向同性模式(同时要保留水平朝向标志)，但不能细化/粗化为一个无朝向模式。(同理适用于垂直朝向。)如当前在分割模式和朝向地形图中对应选定宏块的朝向标志为水平朝向，而试探分割模式为一各向同性模式(在水平朝向子树和垂直朝向子树中都存在若干各向同性模式)，且该模式需要被细化/粗化，则细化/粗化规则允许该分割模式被细化/粗化为一水平分割模式，但不能细化/粗化为一个无朝向模式。(同理适用于垂直朝向。) CN1589022A CLAIM 9 . 根据权利要求1所述的本方法可应用到有多于一个参考帧时的情形，特点包括：1)如当前帧的运动估计需要用到多个参考 (data stream) 帧时，对各个参考帧的分割模式和朝向地图均予以保存。这些参考帧均来自同一个GOP，但由于细化和粗化机制的存在，因此就每一个宏块来说，所对应的朝向标志在各个参考帧对应的地图中是一致的；但在各个地图中给出的分割模式则不一定一致。2)就一个宏块来说，其最终分割模式的确定需要对每个地图均进行比较，并以代价函数mcost最小的那一个作为其分割模式。3)当出现某两个地图恰好给出同样的代价函数时，本方法选择细粒程度较粗的那一个。

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20050213655A1 Filed: 2004-08-06 Issued: 2005-09-29 Device and method for compressing digital images (Original Assignee) Thomson Licensing SAS (Current Assignee) InterDigital Madison Patent Holdings Inc Dominique Thoreau, Philippe Guillotel, Philippe Bordes, Edouard Francois
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level (square root) (square root) wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20050213655A1 CLAIM 11 . Device according to claim 1 , comprising means for generating the enhancement layer by considering a motion or displacement vector associated with each pixel block i , for example by means of the formula : Vect i ={square root (maximum hierarchy level, hierarchy level) }{square root over (Vx 2 +Vy 2)} where the components Vx and Vy represent the horizontal and vertical displacements of the block .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level (square root) (discrete cosine transform) according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules (linear form) associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level (square root) is reached .	US20050213655A1 CLAIM 11 . Device according to claim 1 , comprising means for generating the enhancement layer by considering a motion or displacement vector associated with each pixel block i , for example by means of the formula : Vect i ={square root (maximum hierarchy level, hierarchy level) }{square root over (Vx 2 +Vy 2)} where the components Vx and Vy represent the horizontal and vertical displacements of the block . US20050213655A1 CLAIM 13 . Device according to claim 1 , comprising means for estimating the quality (psnr) of restitution of a block of pixels with the aid of an affine modelling such that the quality (psnr) of restitution of an image has a linear form (partition rules) : psnr=Dpsnr·x+b where Dpsnr is a constant equal , for example , to 0 . 212 dB/bit per block and x represents the allotted number of bits per block . US20050213655A1 CLAIM 15 . Device according to claim 1 , comprising means for coding the base layer with the aid of a discrete cosine transform (first hierarchy level) (DCT) .
US10250913B2 CLAIM 5 . The decoder according to claim 4 , wherein the divider is configured to , in accordance with the partition rules (linear form) associated with the first and higher-order hierarchy levels , sub-divide into sub-regions of equal size , such that there are an equal number of sub-regions at each hierarchy level (square root) .	US20050213655A1 CLAIM 11 . Device according to claim 1 , comprising means for generating the enhancement layer by considering a motion or displacement vector associated with each pixel block i , for example by means of the formula : Vect i ={square root (maximum hierarchy level, hierarchy level) }{square root over (Vx 2 +Vy 2)} where the components Vx and Vy represent the horizontal and vertical displacements of the block . US20050213655A1 CLAIM 13 . Device according to claim 1 , comprising means for estimating the quality (psnr) of restitution of a block of pixels with the aid of an affine modelling such that the quality (psnr) of restitution of an image has a linear form (partition rules) : psnr=Dpsnr·x+b where Dpsnr is a constant equal , for example , to 0 . 212 dB/bit per block and x represents the allotted number of bits per block .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision information includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level (square root) is sub-divided .	US20050213655A1 CLAIM 11 . Device according to claim 1 , comprising means for generating the enhancement layer by considering a motion or displacement vector associated with each pixel block i , for example by means of the formula : Vect i ={square root (maximum hierarchy level, hierarchy level) }{square root over (Vx 2 +Vy 2)} where the components Vx and Vy represent the horizontal and vertical displacements of the block .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level (square root) (square root) from the data stream .	US20050213655A1 CLAIM 11 . Device according to claim 1 , comprising means for generating the enhancement layer by considering a motion or displacement vector associated with each pixel block i , for example by means of the formula : Vect i ={square root (maximum hierarchy level, hierarchy level) }{square root over (Vx 2 +Vy 2)} where the components Vx and Vy represent the horizontal and vertical displacements of the block .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level (square root) (square root) , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20050213655A1 CLAIM 11 . Device according to claim 1 , comprising means for generating the enhancement layer by considering a motion or displacement vector associated with each pixel block i , for example by means of the formula : Vect i ={square root (maximum hierarchy level, hierarchy level) }{square root over (Vx 2 +Vy 2)} where the components Vx and Vy represent the horizontal and vertical displacements of the block .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level (square root) (square root) ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20050213655A1 CLAIM 11 . Device according to claim 1 , comprising means for generating the enhancement layer by considering a motion or displacement vector associated with each pixel block i , for example by means of the formula : Vect i ={square root (maximum hierarchy level, hierarchy level) }{square root over (Vx 2 +Vy 2)} where the components Vx and Vy represent the horizontal and vertical displacements of the block .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level (square root) (square root) ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20050213655A1 CLAIM 11 . Device according to claim 1 , comprising means for generating the enhancement layer by considering a motion or displacement vector associated with each pixel block i , for example by means of the formula : Vect i ={square root (maximum hierarchy level, hierarchy level) }{square root over (Vx 2 +Vy 2)} where the components Vx and Vy represent the horizontal and vertical displacements of the block .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	EP1507415A2 Filed: 2004-07-16 Issued: 2005-02-16 Video encoding/decoding apparatus and method for color image (Original Assignee) Samsung Electronics Co Ltd (Current Assignee) Samsung Electronics Co Ltd Dae-Sung Cho, Hyun Mun Kim, Woo-Shik Kim
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream (entropy decoding) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (video encoder) information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision (plane prediction) information are associated with prediction coding (coded block pattern) and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	EP1507415A2 CLAIM 10 The video encoding apparatus of any preceding claim , wherein the first motion prediction unit selects a filter tap with a predetermined length according to color information and resolution information of the input image and performs inter-plane prediction (first subdivision) for the input image using the selected filter tap . EP1507415A2 CLAIM 18 The video decoding apparatus of claim 17 , wherein the first restoration unit performs entropy decoding (data stream) , dequantization , and inverse discrete integer transform for the encoded image , and generates the first prediction residue image . EP1507415A2 CLAIM 35 A deblocking filter apparatus , which is included in a video decoder or video encoder (second subdivision, second subset, second subdivision information) , comprising : an image information detector detecting color information of an image ; a deblocking filter selector selecting a length of a deblocking filter tap for reducing block effect of the image on the basis of the color information ; a filtering unit filtering the image using a deblocking filter with the selected tap length . EP1507415A2 CLAIM 38 The deblocking filter apparatus of claim 35 , 36 or 37 , wherein the filtering unit determines whether or not filtering for the image should be performed , on the basis of a block encoding mode , a coded block pattern (prediction coding) , a motion vector of a previous frame , a reference image number for motion compensation , and field information in a case of an interlaced image .
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal (encoding mode) based on an intra-prediction mode (tap length) associated with the sub-region and reconstructed samples of a neighboring subset of the second set of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	EP1507415A2 CLAIM 35 A deblocking filter apparatus , which is included in a video decoder or video encoder , comprising : an image information detector detecting color information of an image ; a deblocking filter selector selecting a length of a deblocking filter tap for reducing block effect of the image on the basis of the color information ; a filtering unit filtering the image using a deblocking filter with the selected tap length (intra-prediction mode) . EP1507415A2 CLAIM 38 The deblocking filter apparatus of claim 35 , 36 or 37 , wherein the filtering unit determines whether or not filtering for the image should be performed , on the basis of a block encoding mode (prediction signal) , a coded block pattern , a motion vector of a previous frame , a reference image number for motion compensation , and field information in a case of an interlaced image .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision (plane prediction) information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level (discrete cosine transform) according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	EP1507415A2 CLAIM 3 The video encoding apparatus of claim 2 , wherein the encoding unit performs discrete cosine transform (first hierarchy level) or discrete integer transform , quantization , and entropy encoding for the first prediction residue image and the second prediction residue image . EP1507415A2 CLAIM 10 The video encoding apparatus of any preceding claim , wherein the first motion prediction unit selects a filter tap with a predetermined length according to color information and resolution information of the input image and performs inter-plane prediction (first subdivision) for the input image using the selected filter tap .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision (plane prediction) information includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level is sub-divided .	EP1507415A2 CLAIM 10 The video encoding apparatus of any preceding claim , wherein the first motion prediction unit selects a filter tap with a predetermined length according to color information and resolution information of the input image and performs inter-plane prediction (first subdivision) for the input image using the selected filter tap .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level from the data stream (entropy decoding) .	EP1507415A2 CLAIM 18 The video decoding apparatus of claim 17 , wherein the first restoration unit performs entropy decoding (data stream) , dequantization , and inverse discrete integer transform for the encoded image , and generates the first prediction residue image .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements associated with the first or second set of sub-regions from the data stream (entropy decoding) in a depth-first traversal order .	EP1507415A2 CLAIM 18 The video decoding apparatus of claim 17 , wherein the first restoration unit performs entropy decoding (data stream) , dequantization , and inverse discrete integer transform for the encoded image , and generates the first prediction residue image .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream (entropy decoding) , disjoint from a second subset (video encoder) of syntax elements of the data stream including the first subdivision (plane prediction) information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	EP1507415A2 CLAIM 10 The video encoding apparatus of any preceding claim , wherein the first motion prediction unit selects a filter tap with a predetermined length according to color information and resolution information of the input image and performs inter-plane prediction (first subdivision) for the input image using the selected filter tap . EP1507415A2 CLAIM 18 The video decoding apparatus of claim 17 , wherein the first restoration unit performs entropy decoding (data stream) , dequantization , and inverse discrete integer transform for the encoded image , and generates the first prediction residue image . EP1507415A2 CLAIM 35 A deblocking filter apparatus , which is included in a video decoder or video encoder (second subdivision, second subset, second subdivision information) , comprising : an image information detector detecting color information of an image ; a deblocking filter selector selecting a length of a deblocking filter tap for reducing block effect of the image on the basis of the color information ; a filtering unit filtering the image using a deblocking filter with the selected tap length .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream (entropy decoding) , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	EP1507415A2 CLAIM 18 The video decoding apparatus of claim 17 , wherein the first restoration unit performs entropy decoding (data stream) , dequantization , and inverse discrete integer transform for the encoded image , and generates the first prediction residue image .
US10250913B2 CLAIM 11 . The decoder according to claim 1 , wherein the recursive multi-tree partitioning includes a quadtree partitioning (prediction unit) technique .	EP1507415A2 CLAIM 1 A video encoding apparatus comprising : a first motion prediction unit (quadtree partitioning, quadtree partitioning technique) generating a first prediction residue image for an input image on the basis of a first motion prediction result of the input image ; an image information detection unit setting a reference color component among color components of an R-G-B image , determining whether the input image is a Y-Cb-Cr image or the R-G-B image , and determining whether or not a color component of the input image is the reference color component ; and a second motion prediction unit performing motion prediction for the first prediction residue image and generating a second prediction residue image , on the basis of the reference color component and creating a second prediction residue image , if the input image is the R-G-B image and if the color component of the input image is not the reference color component .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream (entropy decoding) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (video encoder) information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision (plane prediction) information are associated with prediction coding (coded block pattern) and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	EP1507415A2 CLAIM 10 The video encoding apparatus of any preceding claim , wherein the first motion prediction unit selects a filter tap with a predetermined length according to color information and resolution information of the input image and performs inter-plane prediction (first subdivision) for the input image using the selected filter tap . EP1507415A2 CLAIM 18 The video decoding apparatus of claim 17 , wherein the first restoration unit performs entropy decoding (data stream) , dequantization , and inverse discrete integer transform for the encoded image , and generates the first prediction residue image . EP1507415A2 CLAIM 35 A deblocking filter apparatus , which is included in a video decoder or video encoder (second subdivision, second subset, second subdivision information) , comprising : an image information detector detecting color information of an image ; a deblocking filter selector selecting a length of a deblocking filter tap for reducing block effect of the image on the basis of the color information ; a filtering unit filtering the image using a deblocking filter with the selected tap length . EP1507415A2 CLAIM 38 The deblocking filter apparatus of claim 35 , 36 or 37 , wherein the filtering unit determines whether or not filtering for the image should be performed , on the basis of a block encoding mode , a coded block pattern (prediction coding) , a motion vector of a previous frame , a reference image number for motion compensation , and field information in a case of an interlaced image .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision (plane prediction) information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (video encoder) information and a maximum hierarchy level ; and a data stream (entropy decoding) generator configured to : encode the array of information samples using prediction coding (coded block pattern) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	EP1507415A2 CLAIM 10 The video encoding apparatus of any preceding claim , wherein the first motion prediction unit selects a filter tap with a predetermined length according to color information and resolution information of the input image and performs inter-plane prediction (first subdivision) for the input image using the selected filter tap . EP1507415A2 CLAIM 18 The video decoding apparatus of claim 17 , wherein the first restoration unit performs entropy decoding (data stream) , dequantization , and inverse discrete integer transform for the encoded image , and generates the first prediction residue image . EP1507415A2 CLAIM 35 A deblocking filter apparatus , which is included in a video decoder or video encoder (second subdivision, second subset, second subdivision information) , comprising : an image information detector detecting color information of an image ; a deblocking filter selector selecting a length of a deblocking filter tap for reducing block effect of the image on the basis of the color information ; a filtering unit filtering the image using a deblocking filter with the selected tap length . EP1507415A2 CLAIM 38 The deblocking filter apparatus of claim 35 , 36 or 37 , wherein the filtering unit determines whether or not filtering for the image should be performed , on the basis of a block encoding mode , a coded block pattern (prediction coding) , a motion vector of a previous frame , a reference image number for motion compensation , and field information in a case of an interlaced image .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision (plane prediction) information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (video encoder) information and a maximum hierarchy level ; encoding the array of information samples using prediction coding (coded block pattern) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream (entropy decoding) the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	EP1507415A2 CLAIM 10 The video encoding apparatus of any preceding claim , wherein the first motion prediction unit selects a filter tap with a predetermined length according to color information and resolution information of the input image and performs inter-plane prediction (first subdivision) for the input image using the selected filter tap . EP1507415A2 CLAIM 18 The video decoding apparatus of claim 17 , wherein the first restoration unit performs entropy decoding (data stream) , dequantization , and inverse discrete integer transform for the encoded image , and generates the first prediction residue image . EP1507415A2 CLAIM 35 A deblocking filter apparatus , which is included in a video decoder or video encoder (second subdivision, second subset, second subdivision information) , comprising : an image information detector detecting color information of an image ; a deblocking filter selector selecting a length of a deblocking filter tap for reducing block effect of the image on the basis of the color information ; a filtering unit filtering the image using a deblocking filter with the selected tap length . EP1507415A2 CLAIM 38 The deblocking filter apparatus of claim 35 , 36 or 37 , wherein the filtering unit determines whether or not filtering for the image should be performed , on the basis of a block encoding mode , a coded block pattern (prediction coding) , a motion vector of a previous frame , a reference image number for motion compensation , and field information in a case of an interlaced image .
US10250913B2 CLAIM 15 . A non-transitory computer readable digital storage medium having stored thereon a computer program (computer program) having a program code for performing , when running on a computer , a method according to claim 12 .	EP1507415A2 CLAIM 43 A computer-readable medium having embodied thereon a computer program (computer program) for executing one among the methods of claims 11 to 16 , 20 to 22 , 26 to 28 and 39 to 42 .
US10250913B2 CLAIM 16 . A non-transitory computer readable digital storage medium having stored thereon a computer program (computer program) having a program code for performing , when running on a computer , a method according to claim 14 .	EP1507415A2 CLAIM 43 A computer-readable medium having embodied thereon a computer program (computer program) for executing one among the methods of claims 11 to 16 , 20 to 22 , 26 to 28 and 39 to 42 .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	JP2005039841A Filed: 2004-07-16 Issued: 2005-02-10 カラー平面間予測を利用した無損失映像符号化／復号化方法及び装置 (Original Assignee) Samsung Electronics Co Ltd; 三星電子株式会社 Daisei Cho, Hyun-Mun Kim, Woo-Shik Kim, 大星趙, 祐 ▲是▼ 金, 鉉文金
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level (ＲＧＢ) wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	JP2005039841A CLAIM 4 前記カラー映像がＲＧＢ (maximum hierarchy level, order hierarchy level) 映像である場合に、前記予測レジデュ生成部は、Ｇ成分のレジデュを使用して予測子を作り、Ｒ成分のレジデュと前記予測子との差を利用して、前記Ｒ成分の予測レジデュを生成する共に、Ｂ成分のレジデュと前記予測子との差を利用して、前記Ｂ成分の予測レジデュを生成することを特徴とする請求項１に記載のカラー平面間予測を利用した無損失映像符号化装置。
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level (ＲＧＢ) is reached .	JP2005039841A CLAIM 4 前記カラー映像がＲＧＢ (maximum hierarchy level, order hierarchy level) 映像である場合に、前記予測レジデュ生成部は、Ｇ成分のレジデュを使用して予測子を作り、Ｒ成分のレジデュと前記予測子との差を利用して、前記Ｒ成分の予測レジデュを生成する共に、Ｂ成分のレジデュと前記予測子との差を利用して、前記Ｂ成分の予測レジデュを生成することを特徴とする請求項１に記載のカラー平面間予測を利用した無損失映像符号化装置。
US10250913B2 CLAIM 5 . The decoder according to claim 4 , wherein the divider is configured to , in accordance with the partition rules associated with the first and higher-order hierarchy levels , sub-divide into sub-regions of equal size (所定サイズ) , such that there are an equal number of sub-regions at each hierarchy level .	JP2005039841A CLAIM 1 相異なるカラー間のレジデュ予測を使用してカラー映像を無損失に符号化する装置において、以前映像と現在映像との間の動きを、所定サイズ (equal size) のブロック単位で推定し、該当する予測映像を出力する動き予測映像生成部と、前記カラー映像の相異なるそれぞれの成分に対し、前記動き予測映像生成部の予測映像と現在映像の該当ブロックとの差に該当する時間レジデュを生成するレジデュ生成部と、前記レジデュ生成部から出力される前記カラー映像成分の相異なるそれぞれの成分のうち１つのレジデュを線形変換した値を予測子として決定し、他の成分のレジデュと前記予測子との差を利用して予測レジデュを生成する予測レジデュ生成部と、前記カラー映像のうち前記予測子を形成するレジデュを前記レジデュ生成部から受信し、前記予測レジデュを前記予測レジデュ生成部から受信してエントロピ符号化してビットストリームを生成するエントロピ符号化部とを含むことを特徴とするカラー平面間予測を利用した無損失映像符号化装置。
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level (ＲＧＢ) from the data stream .	JP2005039841A CLAIM 4 前記カラー映像がＲＧＢ (maximum hierarchy level, order hierarchy level) 映像である場合に、前記予測レジデュ生成部は、Ｇ成分のレジデュを使用して予測子を作り、Ｒ成分のレジデュと前記予測子との差を利用して、前記Ｒ成分の予測レジデュを生成する共に、Ｂ成分のレジデュと前記予測子との差を利用して、前記Ｂ成分の予測レジデュを生成することを特徴とする請求項１に記載のカラー平面間予測を利用した無損失映像符号化装置。
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level (ＲＧＢ) , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	JP2005039841A CLAIM 4 前記カラー映像がＲＧＢ (maximum hierarchy level, order hierarchy level) 映像である場合に、前記予測レジデュ生成部は、Ｇ成分のレジデュを使用して予測子を作り、Ｒ成分のレジデュと前記予測子との差を利用して、前記Ｒ成分の予測レジデュを生成する共に、Ｂ成分のレジデュと前記予測子との差を利用して、前記Ｂ成分の予測レジデュを生成することを特徴とする請求項１に記載のカラー平面間予測を利用した無損失映像符号化装置。
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level (ＲＧＢ) ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	JP2005039841A CLAIM 4 前記カラー映像がＲＧＢ (maximum hierarchy level, order hierarchy level) 映像である場合に、前記予測レジデュ生成部は、Ｇ成分のレジデュを使用して予測子を作り、Ｒ成分のレジデュと前記予測子との差を利用して、前記Ｒ成分の予測レジデュを生成する共に、Ｂ成分のレジデュと前記予測子との差を利用して、前記Ｂ成分の予測レジデュを生成することを特徴とする請求項１に記載のカラー平面間予測を利用した無損失映像符号化装置。
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level (ＲＧＢ) ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	JP2005039841A CLAIM 4 前記カラー映像がＲＧＢ (maximum hierarchy level, order hierarchy level) 映像である場合に、前記予測レジデュ生成部は、Ｇ成分のレジデュを使用して予測子を作り、Ｒ成分のレジデュと前記予測子との差を利用して、前記Ｒ成分の予測レジデュを生成する共に、Ｂ成分のレジデュと前記予測子との差を利用して、前記Ｂ成分の予測レジデュを生成することを特徴とする請求項１に記載のカラー平面間予測を利用した無損失映像符号化装置。

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	JP2005039842A Filed: 2004-07-16 Issued: 2005-02-10 カラー映像のためのビデオ符号化／復号化装置およびその方法 (Original Assignee) Samsung Electronics Co Ltd; 三星電子株式会社 Daisei Cho, Hyun-Mun Kim, Woo-Shik Kim, 大星趙, 祐 ▲シク▼ 金, 鉉文金
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information (選択部) , information related to first and second maximum region sizes , first and second subdivision (行うこと) information , and a maximum hierarchy level (フレーム) wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set (うち所定) of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	JP2005039842A CLAIM 1 入力映像の第１動き予測結果に基づいて前記入力映像に対する第１予測誤差映像を算出する第１動き予測部と、Ｒ−Ｇ−Ｂ映像の色成分のうち所定 (first set, first hierarchy level) の色成分を基準色成分と設定し、前記入力映像がＹ−Ｃｂ−Ｃｒ映像であるか前記Ｒ−Ｇ−Ｂ映像であるかを把握し、前記入力映像の色成分が前記基準色成分であるか否かを把握する映像情報把握部と、前記入力映像が前記Ｒ−Ｇ−Ｂ映像であり、前記入力映像の色成分が前記基準色成分以外の色成分であれば、前記基準色成分に基づいて前記第１予測誤差映像に対する動き予測を行って第２予測誤差映像を算出する第２動き予測部と、を含むことを特徴とするビデオ符号化装置。 JP2005039842A CLAIM 10 前記第１動き予測部は、前記入力映像の色情報および解像度情報に基づき所定長さのフィルタタップを選択し、前記選択されたフィルタタップを利用して前記入力映像に対するインタープレーン予測を行うこと (second subdivision) を特徴とする請求項１に記載のビデオ符号化装置。 JP2005039842A CLAIM 23 入力映像の色情報を把握する映像情報把握部と、前記入力映像の色情報に基づいて補間のためのフィルタタップの長さを選択するフィルタタップ選択部 (video information) と、前記選択された長さのフィルタタップを利用して前記入力映像を補間する補間部と、前記補間結果に対して動き補償を行う動き補償部と、を含むことを特徴とするビデオ符号化／復号化装置用の動き補償装置。 JP2005039842A CLAIM 38 前記フィルタリング部は、ブロック単位の符号化モードと、符号化ブロックパターンと、先行フレーム (maximum hierarchy level) の動きベクトルと、動き補償のための参照映像番号と、インターレース映像の場合のフィールド情報とに基づいて、前記復号化対象映像に対してフィルタリングを実行するか否かを決定することを特徴とする請求項３５に記載のビデオ復号化装置用のデブロッキングフィルタ装置。
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set (うち所定) of sub-regions : compute a prediction signal based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset of the second set of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	JP2005039842A CLAIM 1 入力映像の第１動き予測結果に基づいて前記入力映像に対する第１予測誤差映像を算出する第１動き予測部と、Ｒ−Ｇ−Ｂ映像の色成分のうち所定 (first set, first hierarchy level) の色成分を基準色成分と設定し、前記入力映像がＹ−Ｃｂ−Ｃｒ映像であるか前記Ｒ−Ｇ−Ｂ映像であるかを把握し、前記入力映像の色成分が前記基準色成分であるか否かを把握する映像情報把握部と、前記入力映像が前記Ｒ−Ｇ−Ｂ映像であり、前記入力映像の色成分が前記基準色成分以外の色成分であれば、前記基準色成分に基づいて前記第１予測誤差映像に対する動き予測を行って第２予測誤差映像を算出する第２動き予測部と、を含むことを特徴とするビデオ符号化装置。
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set (うち所定) of root regions such that the first set of root regions are rectangular blocks of a size determined by the first maximum region size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	JP2005039842A CLAIM 1 入力映像の第１動き予測結果に基づいて前記入力映像に対する第１予測誤差映像を算出する第１動き予測部と、Ｒ−Ｇ−Ｂ映像の色成分のうち所定 (first set, first hierarchy level) の色成分を基準色成分と設定し、前記入力映像がＹ−Ｃｂ−Ｃｒ映像であるか前記Ｒ−Ｇ−Ｂ映像であるかを把握し、前記入力映像の色成分が前記基準色成分であるか否かを把握する映像情報把握部と、前記入力映像が前記Ｒ−Ｇ−Ｂ映像であり、前記入力映像の色成分が前記基準色成分以外の色成分であれば、前記基準色成分に基づいて前記第１予測誤差映像に対する動き予測を行って第２予測誤差映像を算出する第２動き予測部と、を含むことを特徴とするビデオ符号化装置。
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set (うち所定) of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level (うち所定) according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level (フレーム) is reached .	JP2005039842A CLAIM 1 入力映像の第１動き予測結果に基づいて前記入力映像に対する第１予測誤差映像を算出する第１動き予測部と、Ｒ−Ｇ−Ｂ映像の色成分のうち所定 (first set, first hierarchy level) の色成分を基準色成分と設定し、前記入力映像がＹ−Ｃｂ−Ｃｒ映像であるか前記Ｒ−Ｇ−Ｂ映像であるかを把握し、前記入力映像の色成分が前記基準色成分であるか否かを把握する映像情報把握部と、前記入力映像が前記Ｒ−Ｇ−Ｂ映像であり、前記入力映像の色成分が前記基準色成分以外の色成分であれば、前記基準色成分に基づいて前記第１予測誤差映像に対する動き予測を行って第２予測誤差映像を算出する第２動き予測部と、を含むことを特徴とするビデオ符号化装置。 JP2005039842A CLAIM 38 前記フィルタリング部は、ブロック単位の符号化モードと、符号化ブロックパターンと、先行フレーム (maximum hierarchy level) の動きベクトルと、動き補償のための参照映像番号と、インターレース映像の場合のフィールド情報とに基づいて、前記復号化対象映像に対してフィルタリングを実行するか否かを決定することを特徴とする請求項３５に記載のビデオ復号化装置用のデブロッキングフィルタ装置。
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision information includes a partition indication flag indicating whether any of the first set (うち所定) of root regions or the sub-regions at the first or higher-order hierarchy level is sub-divided .	JP2005039842A CLAIM 1 入力映像の第１動き予測結果に基づいて前記入力映像に対する第１予測誤差映像を算出する第１動き予測部と、Ｒ−Ｇ−Ｂ映像の色成分のうち所定 (first set, first hierarchy level) の色成分を基準色成分と設定し、前記入力映像がＹ−Ｃｂ−Ｃｒ映像であるか前記Ｒ−Ｇ−Ｂ映像であるかを把握し、前記入力映像の色成分が前記基準色成分であるか否かを把握する映像情報把握部と、前記入力映像が前記Ｒ−Ｇ−Ｂ映像であり、前記入力映像の色成分が前記基準色成分以外の色成分であれば、前記基準色成分に基づいて前記第１予測誤差映像に対する動き予測を行って第２予測誤差映像を算出する第２動き予測部と、を含むことを特徴とするビデオ符号化装置。
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level (フレーム) from the data stream .	JP2005039842A CLAIM 38 前記フィルタリング部は、ブロック単位の符号化モードと、符号化ブロックパターンと、先行フレーム (maximum hierarchy level) の動きベクトルと、動き補償のための参照映像番号と、インターレース映像の場合のフィールド情報とに基づいて、前記復号化対象映像に対してフィルタリングを実行するか否かを決定することを特徴とする請求項３５に記載のビデオ復号化装置用のデブロッキングフィルタ装置。
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set (うち所定) of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	JP2005039842A CLAIM 1 入力映像の第１動き予測結果に基づいて前記入力映像に対する第１予測誤差映像を算出する第１動き予測部と、Ｒ−Ｇ−Ｂ映像の色成分のうち所定 (first set, first hierarchy level) の色成分を基準色成分と設定し、前記入力映像がＹ−Ｃｂ−Ｃｒ映像であるか前記Ｒ−Ｇ−Ｂ映像であるかを把握し、前記入力映像の色成分が前記基準色成分であるか否かを把握する映像情報把握部と、前記入力映像が前記Ｒ−Ｇ−Ｂ映像であり、前記入力映像の色成分が前記基準色成分以外の色成分であれば、前記基準色成分に基づいて前記第１予測誤差映像に対する動き予測を行って第２予測誤差映像を算出する第２動き予測部と、を含むことを特徴とするビデオ符号化装置。
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information (選択部) , information related to first and second maximum region sizes , first and second subdivision (行うこと) information , and a maximum hierarchy level (フレーム) , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set (うち所定) of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	JP2005039842A CLAIM 1 入力映像の第１動き予測結果に基づいて前記入力映像に対する第１予測誤差映像を算出する第１動き予測部と、Ｒ−Ｇ−Ｂ映像の色成分のうち所定 (first set, first hierarchy level) の色成分を基準色成分と設定し、前記入力映像がＹ−Ｃｂ−Ｃｒ映像であるか前記Ｒ−Ｇ−Ｂ映像であるかを把握し、前記入力映像の色成分が前記基準色成分であるか否かを把握する映像情報把握部と、前記入力映像が前記Ｒ−Ｇ−Ｂ映像であり、前記入力映像の色成分が前記基準色成分以外の色成分であれば、前記基準色成分に基づいて前記第１予測誤差映像に対する動き予測を行って第２予測誤差映像を算出する第２動き予測部と、を含むことを特徴とするビデオ符号化装置。 JP2005039842A CLAIM 10 前記第１動き予測部は、前記入力映像の色情報および解像度情報に基づき所定長さのフィルタタップを選択し、前記選択されたフィルタタップを利用して前記入力映像に対するインタープレーン予測を行うこと (second subdivision) を特徴とする請求項１に記載のビデオ符号化装置。 JP2005039842A CLAIM 23 入力映像の色情報を把握する映像情報把握部と、前記入力映像の色情報に基づいて補間のためのフィルタタップの長さを選択するフィルタタップ選択部 (video information) と、前記選択された長さのフィルタタップを利用して前記入力映像を補間する補間部と、前記補間結果に対して動き補償を行う動き補償部と、を含むことを特徴とするビデオ符号化／復号化装置用の動き補償装置。 JP2005039842A CLAIM 38 前記フィルタリング部は、ブロック単位の符号化モードと、符号化ブロックパターンと、先行フレーム (maximum hierarchy level) の動きベクトルと、動き補償のための参照映像番号と、インターレース映像の場合のフィールド情報とに基づいて、前記復号化対象映像に対してフィルタリングを実行するか否かを決定することを特徴とする請求項３５に記載のビデオ復号化装置用のデブロッキングフィルタ装置。
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information (選択部) into a first set (うち所定) of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (行うこと) information and a maximum hierarchy level (フレーム) ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	JP2005039842A CLAIM 1 入力映像の第１動き予測結果に基づいて前記入力映像に対する第１予測誤差映像を算出する第１動き予測部と、Ｒ−Ｇ−Ｂ映像の色成分のうち所定 (first set, first hierarchy level) の色成分を基準色成分と設定し、前記入力映像がＹ−Ｃｂ−Ｃｒ映像であるか前記Ｒ−Ｇ−Ｂ映像であるかを把握し、前記入力映像の色成分が前記基準色成分であるか否かを把握する映像情報把握部と、前記入力映像が前記Ｒ−Ｇ−Ｂ映像であり、前記入力映像の色成分が前記基準色成分以外の色成分であれば、前記基準色成分に基づいて前記第１予測誤差映像に対する動き予測を行って第２予測誤差映像を算出する第２動き予測部と、を含むことを特徴とするビデオ符号化装置。 JP2005039842A CLAIM 10 前記第１動き予測部は、前記入力映像の色情報および解像度情報に基づき所定長さのフィルタタップを選択し、前記選択されたフィルタタップを利用して前記入力映像に対するインタープレーン予測を行うこと (second subdivision) を特徴とする請求項１に記載のビデオ符号化装置。 JP2005039842A CLAIM 23 入力映像の色情報を把握する映像情報把握部と、前記入力映像の色情報に基づいて補間のためのフィルタタップの長さを選択するフィルタタップ選択部 (video information) と、前記選択された長さのフィルタタップを利用して前記入力映像を補間する補間部と、前記補間結果に対して動き補償を行う動き補償部と、を含むことを特徴とするビデオ符号化／復号化装置用の動き補償装置。 JP2005039842A CLAIM 38 前記フィルタリング部は、ブロック単位の符号化モードと、符号化ブロックパターンと、先行フレーム (maximum hierarchy level) の動きベクトルと、動き補償のための参照映像番号と、インターレース映像の場合のフィールド情報とに基づいて、前記復号化対象映像に対してフィルタリングを実行するか否かを決定することを特徴とする請求項３５に記載のビデオ復号化装置用のデブロッキングフィルタ装置。
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information (選択部) into a first set (うち所定) of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (行うこと) information and a maximum hierarchy level (フレーム) ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	JP2005039842A CLAIM 1 入力映像の第１動き予測結果に基づいて前記入力映像に対する第１予測誤差映像を算出する第１動き予測部と、Ｒ−Ｇ−Ｂ映像の色成分のうち所定 (first set, first hierarchy level) の色成分を基準色成分と設定し、前記入力映像がＹ−Ｃｂ−Ｃｒ映像であるか前記Ｒ−Ｇ−Ｂ映像であるかを把握し、前記入力映像の色成分が前記基準色成分であるか否かを把握する映像情報把握部と、前記入力映像が前記Ｒ−Ｇ−Ｂ映像であり、前記入力映像の色成分が前記基準色成分以外の色成分であれば、前記基準色成分に基づいて前記第１予測誤差映像に対する動き予測を行って第２予測誤差映像を算出する第２動き予測部と、を含むことを特徴とするビデオ符号化装置。 JP2005039842A CLAIM 10 前記第１動き予測部は、前記入力映像の色情報および解像度情報に基づき所定長さのフィルタタップを選択し、前記選択されたフィルタタップを利用して前記入力映像に対するインタープレーン予測を行うこと (second subdivision) を特徴とする請求項１に記載のビデオ符号化装置。 JP2005039842A CLAIM 23 入力映像の色情報を把握する映像情報把握部と、前記入力映像の色情報に基づいて補間のためのフィルタタップの長さを選択するフィルタタップ選択部 (video information) と、前記選択された長さのフィルタタップを利用して前記入力映像を補間する補間部と、前記補間結果に対して動き補償を行う動き補償部と、を含むことを特徴とするビデオ符号化／復号化装置用の動き補償装置。 JP2005039842A CLAIM 38 前記フィルタリング部は、ブロック単位の符号化モードと、符号化ブロックパターンと、先行フレーム (maximum hierarchy level) の動きベクトルと、動き補償のための参照映像番号と、インターレース映像の場合のフィールド情報とに基づいて、前記復号化対象映像に対してフィルタリングを実行するか否かを決定することを特徴とする請求項３５に記載のビデオ復号化装置用のデブロッキングフィルタ装置。

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20050013370A1 Filed: 2004-07-16 Issued: 2005-01-20 Lossless image encoding/decoding method and apparatus using inter-color plane prediction (Original Assignee) Samsung Electronics Co Ltd (Current Assignee) Samsung Electronics Co Ltd Woo-shik Kim, Dae-sung Cho, Hyun Kim
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream (computer readable medium) representing encoded video information (second line) , information related to first and second maximum region sizes , first and second subdivision (determined size) information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information (prediction direction, first generating) are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20050013370A1 CLAIM 1 . A lossless image encoding apparatus , which losslessly encodes a color image using residue prediction between different color image components , the apparatus comprising : a motion prediction image generator estimating motion between a previous image and a current image in units of predetermined size (second subdivision, second subset, second subdivision information) d blocks and outputting a prediction image ; a residue generator generating a temporal residue corresponding to a difference between the prediction image and a corresponding block of the current image with respect to different components of the current image ; a prediction residue generator generating prediction residues by defining a linear-transformed value of one residue , of the different components , output from the residue generator as a predictor residue and using respective differences between residues of other components , of the different components , and the predictor residue ; and an entropy encoder receiving the predictor residue and prediction residues and generating a bitstream by entropy encoding the predictor residue and the prediction residues . US20050013370A1 CLAIM 10 . A lossless image encoding apparatus , which losslessly encodes a color image using residue prediction between different color image components , the apparatus comprising : a spatial prediction image generator estimating a prediction direction (first subdivision information) from pixels spatially close to a pixel block of a current image and outputting a prediction image ; a residue generator generating a spatial residue corresponding to a difference between the prediction image and the pixel block of the current image with respect to each of different components of the current image ; a prediction residue generator generating prediction residues by defining a linear-transformed value of one residue , of the different components , output from the residue generator as a predictor residue and using respective differences between residues of other components , of the different components , and the predictor residue ; and an entropy encoder receiving the predictor residue and the prediction residues and generating a bitstream by entropy encoding the predictor residue and the prediction residues . US20050013370A1 CLAIM 32 . A lossless image encoding method , which losslessly encodes a color image using residue prediction between different color image components , the method comprising : determining whether an encoding mode is an inter prediction mode or an intra prediction mode ; if the encoding mode is determined to be an inter prediction mode , then estimating a motion between a previous image and a current image in units of predetermined sized blocks and outputting a first prediction image , generating a temporal residue corresponding to a difference between the first prediction image and a corresponding block of the current image with respect to different components of the current image , first generating (first subdivision information) first prediction residues by defining a first linear-transformed value of a first residue , of the different components , output from the generating of the temporal residue , as a predictor residue and using respective differences between temporal residues of other components , of the different components , and the predictor residue , and firstly generating a bitstream by entropy encoding the predictor residue and the first prediction residues of the other components ; and if it is determined that the encoding mode is an intra prediction mode , estimating a prediction direction from pixels spatially close to a pixel block of the current image and outputting a second prediction image , generating a spatial residue corresponding to a difference between the second prediction image and the pixel block of the current image with respect to different components of the current image , secondly generating second prediction residues by defining a second line (video information) ar-transformed value of a second residue , of the different components , output from the generating of the spatial residue , as the predictor residue and using respective differences between temporal residues of other components , of the different components , and the predictor residue , and secondly generating a bitstream by entropy encoding the predictor residue and the second prediction residues of the other components . US20050013370A1 CLAIM 51 . A computer readable medium (data stream) comprising computer readable code for performing the method of claim 20 .
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal (encoding mode) based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset of the second set of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	US20050013370A1 CLAIM 32 . A lossless image encoding method , which losslessly encodes a color image using residue prediction between different color image components , the method comprising : determining whether an encoding mode (prediction signal) is an inter prediction mode or an intra prediction mode ; if the encoding mode is determined to be an inter prediction mode , then estimating a motion between a previous image and a current image in units of predetermined sized blocks and outputting a first prediction image , generating a temporal residue corresponding to a difference between the first prediction image and a corresponding block of the current image with respect to different components of the current image , first generating first prediction residues by defining a first linear-transformed value of a first residue , of the different components , output from the generating of the temporal residue , as a predictor residue and using respective differences between temporal residues of other components , of the different components , and the predictor residue , and firstly generating a bitstream by entropy encoding the predictor residue and the first prediction residues of the other components ; and if it is determined that the encoding mode is an intra prediction mode , estimating a prediction direction from pixels spatially close to a pixel block of the current image and outputting a second prediction image , generating a spatial residue corresponding to a difference between the second prediction image and the pixel block of the current image with respect to different components of the current image , secondly generating second prediction residues by defining a second linear-transformed value of a second residue , of the different components , output from the generating of the spatial residue , as the predictor residue and using respective differences between temporal residues of other components , of the different components , and the predictor residue , and secondly generating a bitstream by entropy encoding the predictor residue and the second prediction residues of the other components .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set of root regions such that the first set of root regions are rectangular blocks (motion prediction) of a size determined by the first maximum region size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	US20050013370A1 CLAIM 1 . A lossless image encoding apparatus , which losslessly encodes a color image using residue prediction between different color image components , the apparatus comprising : a motion prediction (rectangular blocks) image generator estimating motion between a previous image and a current image in units of predetermined sized blocks and outputting a prediction image ; a residue generator generating a temporal residue corresponding to a difference between the prediction image and a corresponding block of the current image with respect to different components of the current image ; a prediction residue generator generating prediction residues by defining a linear-transformed value of one residue , of the different components , output from the residue generator as a predictor residue and using respective differences between residues of other components , of the different components , and the predictor residue ; and an entropy encoder receiving the predictor residue and prediction residues and generating a bitstream by entropy encoding the predictor residue and the prediction residues .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information (prediction direction, first generating) indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20050013370A1 CLAIM 10 . A lossless image encoding apparatus , which losslessly encodes a color image using residue prediction between different color image components , the apparatus comprising : a spatial prediction image generator estimating a prediction direction (first subdivision information) from pixels spatially close to a pixel block of a current image and outputting a prediction image ; a residue generator generating a spatial residue corresponding to a difference between the prediction image and the pixel block of the current image with respect to each of different components of the current image ; a prediction residue generator generating prediction residues by defining a linear-transformed value of one residue , of the different components , output from the residue generator as a predictor residue and using respective differences between residues of other components , of the different components , and the predictor residue ; and an entropy encoder receiving the predictor residue and the prediction residues and generating a bitstream by entropy encoding the predictor residue and the prediction residues . US20050013370A1 CLAIM 32 . A lossless image encoding method , which losslessly encodes a color image using residue prediction between different color image components , the method comprising : determining whether an encoding mode is an inter prediction mode or an intra prediction mode ; if the encoding mode is determined to be an inter prediction mode , then estimating a motion between a previous image and a current image in units of predetermined sized blocks and outputting a first prediction image , generating a temporal residue corresponding to a difference between the first prediction image and a corresponding block of the current image with respect to different components of the current image , first generating (first subdivision information) first prediction residues by defining a first linear-transformed value of a first residue , of the different components , output from the generating of the temporal residue , as a predictor residue and using respective differences between temporal residues of other components , of the different components , and the predictor residue , and firstly generating a bitstream by entropy encoding the predictor residue and the first prediction residues of the other components ; and if it is determined that the encoding mode is an intra prediction mode , estimating a prediction direction from pixels spatially close to a pixel block of the current image and outputting a second prediction image , generating a spatial residue corresponding to a difference between the second prediction image and the pixel block of the current image with respect to different components of the current image , secondly generating second prediction residues by defining a second linear-transformed value of a second residue , of the different components , output from the generating of the spatial residue , as the predictor residue and using respective differences between temporal residues of other components , of the different components , and the predictor residue , and secondly generating a bitstream by entropy encoding the predictor residue and the second prediction residues of the other components .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision information (prediction direction, first generating) includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level is sub-divided .	US20050013370A1 CLAIM 10 . A lossless image encoding apparatus , which losslessly encodes a color image using residue prediction between different color image components , the apparatus comprising : a spatial prediction image generator estimating a prediction direction (first subdivision information) from pixels spatially close to a pixel block of a current image and outputting a prediction image ; a residue generator generating a spatial residue corresponding to a difference between the prediction image and the pixel block of the current image with respect to each of different components of the current image ; a prediction residue generator generating prediction residues by defining a linear-transformed value of one residue , of the different components , output from the residue generator as a predictor residue and using respective differences between residues of other components , of the different components , and the predictor residue ; and an entropy encoder receiving the predictor residue and the prediction residues and generating a bitstream by entropy encoding the predictor residue and the prediction residues . US20050013370A1 CLAIM 32 . A lossless image encoding method , which losslessly encodes a color image using residue prediction between different color image components , the method comprising : determining whether an encoding mode is an inter prediction mode or an intra prediction mode ; if the encoding mode is determined to be an inter prediction mode , then estimating a motion between a previous image and a current image in units of predetermined sized blocks and outputting a first prediction image , generating a temporal residue corresponding to a difference between the first prediction image and a corresponding block of the current image with respect to different components of the current image , first generating (first subdivision information) first prediction residues by defining a first linear-transformed value of a first residue , of the different components , output from the generating of the temporal residue , as a predictor residue and using respective differences between temporal residues of other components , of the different components , and the predictor residue , and firstly generating a bitstream by entropy encoding the predictor residue and the first prediction residues of the other components ; and if it is determined that the encoding mode is an intra prediction mode , estimating a prediction direction from pixels spatially close to a pixel block of the current image and outputting a second prediction image , generating a spatial residue corresponding to a difference between the second prediction image and the pixel block of the current image with respect to different components of the current image , secondly generating second prediction residues by defining a second linear-transformed value of a second residue , of the different components , output from the generating of the spatial residue , as the predictor residue and using respective differences between temporal residues of other components , of the different components , and the predictor residue , and secondly generating a bitstream by entropy encoding the predictor residue and the second prediction residues of the other components .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level from the data stream (computer readable medium) .	US20050013370A1 CLAIM 51 . A computer readable medium (data stream) comprising computer readable code for performing the method of claim 20 .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements associated with the first or second set of sub-regions from the data stream (computer readable medium) in a depth-first traversal order .	US20050013370A1 CLAIM 51 . A computer readable medium (data stream) comprising computer readable code for performing the method of claim 20 .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream (computer readable medium) , disjoint from a second subset (determined size) of syntax elements of the data stream including the first subdivision information (prediction direction, first generating) , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20050013370A1 CLAIM 1 . A lossless image encoding apparatus , which losslessly encodes a color image using residue prediction between different color image components , the apparatus comprising : a motion prediction image generator estimating motion between a previous image and a current image in units of predetermined size (second subdivision, second subset, second subdivision information) d blocks and outputting a prediction image ; a residue generator generating a temporal residue corresponding to a difference between the prediction image and a corresponding block of the current image with respect to different components of the current image ; a prediction residue generator generating prediction residues by defining a linear-transformed value of one residue , of the different components , output from the residue generator as a predictor residue and using respective differences between residues of other components , of the different components , and the predictor residue ; and an entropy encoder receiving the predictor residue and prediction residues and generating a bitstream by entropy encoding the predictor residue and the prediction residues . US20050013370A1 CLAIM 10 . A lossless image encoding apparatus , which losslessly encodes a color image using residue prediction between different color image components , the apparatus comprising : a spatial prediction image generator estimating a prediction direction (first subdivision information) from pixels spatially close to a pixel block of a current image and outputting a prediction image ; a residue generator generating a spatial residue corresponding to a difference between the prediction image and the pixel block of the current image with respect to each of different components of the current image ; a prediction residue generator generating prediction residues by defining a linear-transformed value of one residue , of the different components , output from the residue generator as a predictor residue and using respective differences between residues of other components , of the different components , and the predictor residue ; and an entropy encoder receiving the predictor residue and the prediction residues and generating a bitstream by entropy encoding the predictor residue and the prediction residues . US20050013370A1 CLAIM 32 . A lossless image encoding method , which losslessly encodes a color image using residue prediction between different color image components , the method comprising : determining whether an encoding mode is an inter prediction mode or an intra prediction mode ; if the encoding mode is determined to be an inter prediction mode , then estimating a motion between a previous image and a current image in units of predetermined sized blocks and outputting a first prediction image , generating a temporal residue corresponding to a difference between the first prediction image and a corresponding block of the current image with respect to different components of the current image , first generating (first subdivision information) first prediction residues by defining a first linear-transformed value of a first residue , of the different components , output from the generating of the temporal residue , as a predictor residue and using respective differences between temporal residues of other components , of the different components , and the predictor residue , and firstly generating a bitstream by entropy encoding the predictor residue and the first prediction residues of the other components ; and if it is determined that the encoding mode is an intra prediction mode , estimating a prediction direction from pixels spatially close to a pixel block of the current image and outputting a second prediction image , generating a spatial residue corresponding to a difference between the second prediction image and the pixel block of the current image with respect to different components of the current image , secondly generating second prediction residues by defining a second linear-transformed value of a second residue , of the different components , output from the generating of the spatial residue , as the predictor residue and using respective differences between temporal residues of other components , of the different components , and the predictor residue , and secondly generating a bitstream by entropy encoding the predictor residue and the second prediction residues of the other components . US20050013370A1 CLAIM 51 . A computer readable medium (data stream) comprising computer readable code for performing the method of claim 20 .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream (computer readable medium) , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	US20050013370A1 CLAIM 51 . A computer readable medium (data stream) comprising computer readable code for performing the method of claim 20 .
US10250913B2 CLAIM 11 . The decoder according to claim 1 , wherein the recursive multi-tree partitioning includes a quadtree partitioning (prediction unit) technique .	US20050013370A1 CLAIM 2 . The apparatus of claim 1 , wherein the motion prediction image generator comprises : a motion estimation unit estimating motion between the current image and the previous image in units of predetermined sized blocks ; and a motion prediction unit (quadtree partitioning, quadtree partitioning technique) outputting a block corresponding to a motion vector generated by the motion estimation unit .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream (computer readable medium) representing encoded video information (second line) , information related to first and second maximum region sizes , first and second subdivision (determined size) information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information (prediction direction, first generating) are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20050013370A1 CLAIM 1 . A lossless image encoding apparatus , which losslessly encodes a color image using residue prediction between different color image components , the apparatus comprising : a motion prediction image generator estimating motion between a previous image and a current image in units of predetermined size (second subdivision, second subset, second subdivision information) d blocks and outputting a prediction image ; a residue generator generating a temporal residue corresponding to a difference between the prediction image and a corresponding block of the current image with respect to different components of the current image ; a prediction residue generator generating prediction residues by defining a linear-transformed value of one residue , of the different components , output from the residue generator as a predictor residue and using respective differences between residues of other components , of the different components , and the predictor residue ; and an entropy encoder receiving the predictor residue and prediction residues and generating a bitstream by entropy encoding the predictor residue and the prediction residues . US20050013370A1 CLAIM 10 . A lossless image encoding apparatus , which losslessly encodes a color image using residue prediction between different color image components , the apparatus comprising : a spatial prediction image generator estimating a prediction direction (first subdivision information) from pixels spatially close to a pixel block of a current image and outputting a prediction image ; a residue generator generating a spatial residue corresponding to a difference between the prediction image and the pixel block of the current image with respect to each of different components of the current image ; a prediction residue generator generating prediction residues by defining a linear-transformed value of one residue , of the different components , output from the residue generator as a predictor residue and using respective differences between residues of other components , of the different components , and the predictor residue ; and an entropy encoder receiving the predictor residue and the prediction residues and generating a bitstream by entropy encoding the predictor residue and the prediction residues . US20050013370A1 CLAIM 32 . A lossless image encoding method , which losslessly encodes a color image using residue prediction between different color image components , the method comprising : determining whether an encoding mode is an inter prediction mode or an intra prediction mode ; if the encoding mode is determined to be an inter prediction mode , then estimating a motion between a previous image and a current image in units of predetermined sized blocks and outputting a first prediction image , generating a temporal residue corresponding to a difference between the first prediction image and a corresponding block of the current image with respect to different components of the current image , first generating (first subdivision information) first prediction residues by defining a first linear-transformed value of a first residue , of the different components , output from the generating of the temporal residue , as a predictor residue and using respective differences between temporal residues of other components , of the different components , and the predictor residue , and firstly generating a bitstream by entropy encoding the predictor residue and the first prediction residues of the other components ; and if it is determined that the encoding mode is an intra prediction mode , estimating a prediction direction from pixels spatially close to a pixel block of the current image and outputting a second prediction image , generating a spatial residue corresponding to a difference between the second prediction image and the pixel block of the current image with respect to different components of the current image , secondly generating second prediction residues by defining a second line (video information) ar-transformed value of a second residue , of the different components , output from the generating of the spatial residue , as the predictor residue and using respective differences between temporal residues of other components , of the different components , and the predictor residue , and secondly generating a bitstream by entropy encoding the predictor residue and the second prediction residues of the other components . US20050013370A1 CLAIM 51 . A computer readable medium (data stream) comprising computer readable code for performing the method of claim 20 .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information (second line) into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information (prediction direction, first generating) , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (determined size) information and a maximum hierarchy level ; and a data stream (computer readable medium) generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20050013370A1 CLAIM 1 . A lossless image encoding apparatus , which losslessly encodes a color image using residue prediction between different color image components , the apparatus comprising : a motion prediction image generator estimating motion between a previous image and a current image in units of predetermined size (second subdivision, second subset, second subdivision information) d blocks and outputting a prediction image ; a residue generator generating a temporal residue corresponding to a difference between the prediction image and a corresponding block of the current image with respect to different components of the current image ; a prediction residue generator generating prediction residues by defining a linear-transformed value of one residue , of the different components , output from the residue generator as a predictor residue and using respective differences between residues of other components , of the different components , and the predictor residue ; and an entropy encoder receiving the predictor residue and prediction residues and generating a bitstream by entropy encoding the predictor residue and the prediction residues . US20050013370A1 CLAIM 10 . A lossless image encoding apparatus , which losslessly encodes a color image using residue prediction between different color image components , the apparatus comprising : a spatial prediction image generator estimating a prediction direction (first subdivision information) from pixels spatially close to a pixel block of a current image and outputting a prediction image ; a residue generator generating a spatial residue corresponding to a difference between the prediction image and the pixel block of the current image with respect to each of different components of the current image ; a prediction residue generator generating prediction residues by defining a linear-transformed value of one residue , of the different components , output from the residue generator as a predictor residue and using respective differences between residues of other components , of the different components , and the predictor residue ; and an entropy encoder receiving the predictor residue and the prediction residues and generating a bitstream by entropy encoding the predictor residue and the prediction residues . US20050013370A1 CLAIM 32 . A lossless image encoding method , which losslessly encodes a color image using residue prediction between different color image components , the method comprising : determining whether an encoding mode is an inter prediction mode or an intra prediction mode ; if the encoding mode is determined to be an inter prediction mode , then estimating a motion between a previous image and a current image in units of predetermined sized blocks and outputting a first prediction image , generating a temporal residue corresponding to a difference between the first prediction image and a corresponding block of the current image with respect to different components of the current image , first generating (first subdivision information) first prediction residues by defining a first linear-transformed value of a first residue , of the different components , output from the generating of the temporal residue , as a predictor residue and using respective differences between temporal residues of other components , of the different components , and the predictor residue , and firstly generating a bitstream by entropy encoding the predictor residue and the first prediction residues of the other components ; and if it is determined that the encoding mode is an intra prediction mode , estimating a prediction direction from pixels spatially close to a pixel block of the current image and outputting a second prediction image , generating a spatial residue corresponding to a difference between the second prediction image and the pixel block of the current image with respect to different components of the current image , secondly generating second prediction residues by defining a second line (video information) ar-transformed value of a second residue , of the different components , output from the generating of the spatial residue , as the predictor residue and using respective differences between temporal residues of other components , of the different components , and the predictor residue , and secondly generating a bitstream by entropy encoding the predictor residue and the second prediction residues of the other components . US20050013370A1 CLAIM 51 . A computer readable medium (data stream) comprising computer readable code for performing the method of claim 20 .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information (second line) into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information (prediction direction, first generating) ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (determined size) information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream (computer readable medium) the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20050013370A1 CLAIM 1 . A lossless image encoding apparatus , which losslessly encodes a color image using residue prediction between different color image components , the apparatus comprising : a motion prediction image generator estimating motion between a previous image and a current image in units of predetermined size (second subdivision, second subset, second subdivision information) d blocks and outputting a prediction image ; a residue generator generating a temporal residue corresponding to a difference between the prediction image and a corresponding block of the current image with respect to different components of the current image ; a prediction residue generator generating prediction residues by defining a linear-transformed value of one residue , of the different components , output from the residue generator as a predictor residue and using respective differences between residues of other components , of the different components , and the predictor residue ; and an entropy encoder receiving the predictor residue and prediction residues and generating a bitstream by entropy encoding the predictor residue and the prediction residues . US20050013370A1 CLAIM 10 . A lossless image encoding apparatus , which losslessly encodes a color image using residue prediction between different color image components , the apparatus comprising : a spatial prediction image generator estimating a prediction direction (first subdivision information) from pixels spatially close to a pixel block of a current image and outputting a prediction image ; a residue generator generating a spatial residue corresponding to a difference between the prediction image and the pixel block of the current image with respect to each of different components of the current image ; a prediction residue generator generating prediction residues by defining a linear-transformed value of one residue , of the different components , output from the residue generator as a predictor residue and using respective differences between residues of other components , of the different components , and the predictor residue ; and an entropy encoder receiving the predictor residue and the prediction residues and generating a bitstream by entropy encoding the predictor residue and the prediction residues . US20050013370A1 CLAIM 32 . A lossless image encoding method , which losslessly encodes a color image using residue prediction between different color image components , the method comprising : determining whether an encoding mode is an inter prediction mode or an intra prediction mode ; if the encoding mode is determined to be an inter prediction mode , then estimating a motion between a previous image and a current image in units of predetermined sized blocks and outputting a first prediction image , generating a temporal residue corresponding to a difference between the first prediction image and a corresponding block of the current image with respect to different components of the current image , first generating (first subdivision information) first prediction residues by defining a first linear-transformed value of a first residue , of the different components , output from the generating of the temporal residue , as a predictor residue and using respective differences between temporal residues of other components , of the different components , and the predictor residue , and firstly generating a bitstream by entropy encoding the predictor residue and the first prediction residues of the other components ; and if it is determined that the encoding mode is an intra prediction mode , estimating a prediction direction from pixels spatially close to a pixel block of the current image and outputting a second prediction image , generating a spatial residue corresponding to a difference between the second prediction image and the pixel block of the current image with respect to different components of the current image , secondly generating second prediction residues by defining a second line (video information) ar-transformed value of a second residue , of the different components , output from the generating of the spatial residue , as the predictor residue and using respective differences between temporal residues of other components , of the different components , and the predictor residue , and secondly generating a bitstream by entropy encoding the predictor residue and the second prediction residues of the other components . US20050013370A1 CLAIM 51 . A computer readable medium (data stream) comprising computer readable code for performing the method of claim 20 .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	CN1595990A Filed: 2004-07-02 Issued: 2005-03-16 基于图像切片结构的帧场自适应编码方法 (Original Assignee) 上海广电（集团）有限公司中央研究院赵海武
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region (的整数) size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root (中的一个) region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN1595990A CLAIM 1 . 一种基于图像切片结构的帧场自适应编码方法，包括如下的步骤：a . 将图像划分成一个或数个图像切片；b . 对所述每一个图像切片，分别进行帧编码和场编码；其中，进行帧编码时将所述图像切片划分成数个宏块，之后对每一个宏块进行编码；进行场编码时首先将所述图像切片的奇数行象素和偶数行象素分别形成一子切片，之后再将所述两个子切片划分成数个宏块，再对每一个宏块进行编码；c . 根据所述帧编码和场编码的编码代价，选择代价较小的一个作为所述图像切片的编码方式；d . 为所述每一个图像切片添加一图像切片头，其与其中的数个宏块的编码数据一同组成图像切片的编码数据，其中，所述图像切片头标示该图像切片中的宏块是采用帧编码方式还是场编码方式；e . 为所述每一个图像切片添加一宏块索引，其不包括在所述图像切片的编码数据中；f . 为所述每一个图像添加一图像头，其与其中的一个 (respective root) 或数个图像切片的编码数据以及所述宏块索引一同组成图像的编码数据。 CN1595990A CLAIM 3 . 如权利要求2所述的方法，其特征在于，所述图像切片为所述图像中的矩形区域，其左上角象素到所述图像上边和左边的距离都是16的整数 (first maximum region) 倍，所述图像切片的高度和宽度也是16的整数倍。
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set of root regions such that the first set of root regions are rectangular blocks of a size determined by the first maximum region (的整数) size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	CN1595990A CLAIM 3 . 如权利要求2所述的方法，其特征在于，所述图像切片为所述图像中的矩形区域，其左上角象素到所述图像上边和左边的距离都是16的整数 (first maximum region) 倍，所述图像切片的高度和宽度也是16的整数倍。
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision (的一个作为) of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	CN1595990A CLAIM 1 . 一种基于图像切片结构的帧场自适应编码方法，包括如下的步骤：a . 将图像划分成一个或数个图像切片；b . 对所述每一个图像切片，分别进行帧编码和场编码；其中，进行帧编码时将所述图像切片划分成数个宏块，之后对每一个宏块进行编码；进行场编码时首先将所述图像切片的奇数行象素和偶数行象素分别形成一子切片，之后再将所述两个子切片划分成数个宏块，再对每一个宏块进行编码；c . 根据所述帧编码和场编码的编码代价，选择代价较小的一个作为 (intermediate subdivision) 所述图像切片的编码方式；d . 为所述每一个图像切片添加一图像切片头，其与其中的数个宏块的编码数据一同组成图像切片的编码数据，其中，所述图像切片头标示该图像切片中的宏块是采用帧编码方式还是场编码方式；e . 为所述每一个图像切片添加一宏块索引，其不包括在所述图像切片的编码数据中；f . 为所述每一个图像添加一图像头，其与其中的一个或数个图像切片的编码数据以及所述宏块索引一同组成图像的编码数据。
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region (的整数) size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root (中的一个) region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN1595990A CLAIM 1 . 一种基于图像切片结构的帧场自适应编码方法，包括如下的步骤：a . 将图像划分成一个或数个图像切片；b . 对所述每一个图像切片，分别进行帧编码和场编码；其中，进行帧编码时将所述图像切片划分成数个宏块，之后对每一个宏块进行编码；进行场编码时首先将所述图像切片的奇数行象素和偶数行象素分别形成一子切片，之后再将所述两个子切片划分成数个宏块，再对每一个宏块进行编码；c . 根据所述帧编码和场编码的编码代价，选择代价较小的一个作为所述图像切片的编码方式；d . 为所述每一个图像切片添加一图像切片头，其与其中的数个宏块的编码数据一同组成图像切片的编码数据，其中，所述图像切片头标示该图像切片中的宏块是采用帧编码方式还是场编码方式；e . 为所述每一个图像切片添加一宏块索引，其不包括在所述图像切片的编码数据中；f . 为所述每一个图像添加一图像头，其与其中的一个 (respective root) 或数个图像切片的编码数据以及所述宏块索引一同组成图像的编码数据。 CN1595990A CLAIM 3 . 如权利要求2所述的方法，其特征在于，所述图像切片为所述图像中的矩形区域，其左上角象素到所述图像上边和左边的距离都是16的整数 (first maximum region) 倍，所述图像切片的高度和宽度也是16的整数倍。
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region (的整数) size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root (中的一个) region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN1595990A CLAIM 1 . 一种基于图像切片结构的帧场自适应编码方法，包括如下的步骤：a . 将图像划分成一个或数个图像切片；b . 对所述每一个图像切片，分别进行帧编码和场编码；其中，进行帧编码时将所述图像切片划分成数个宏块，之后对每一个宏块进行编码；进行场编码时首先将所述图像切片的奇数行象素和偶数行象素分别形成一子切片，之后再将所述两个子切片划分成数个宏块，再对每一个宏块进行编码；c . 根据所述帧编码和场编码的编码代价，选择代价较小的一个作为所述图像切片的编码方式；d . 为所述每一个图像切片添加一图像切片头，其与其中的数个宏块的编码数据一同组成图像切片的编码数据，其中，所述图像切片头标示该图像切片中的宏块是采用帧编码方式还是场编码方式；e . 为所述每一个图像切片添加一宏块索引，其不包括在所述图像切片的编码数据中；f . 为所述每一个图像添加一图像头，其与其中的一个 (respective root) 或数个图像切片的编码数据以及所述宏块索引一同组成图像的编码数据。 CN1595990A CLAIM 3 . 如权利要求2所述的方法，其特征在于，所述图像切片为所述图像中的矩形区域，其左上角象素到所述图像上边和左边的距离都是16的整数 (first maximum region) 倍，所述图像切片的高度和宽度也是16的整数倍。
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region (的整数) size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root (中的一个) region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN1595990A CLAIM 1 . 一种基于图像切片结构的帧场自适应编码方法，包括如下的步骤：a . 将图像划分成一个或数个图像切片；b . 对所述每一个图像切片，分别进行帧编码和场编码；其中，进行帧编码时将所述图像切片划分成数个宏块，之后对每一个宏块进行编码；进行场编码时首先将所述图像切片的奇数行象素和偶数行象素分别形成一子切片，之后再将所述两个子切片划分成数个宏块，再对每一个宏块进行编码；c . 根据所述帧编码和场编码的编码代价，选择代价较小的一个作为所述图像切片的编码方式；d . 为所述每一个图像切片添加一图像切片头，其与其中的数个宏块的编码数据一同组成图像切片的编码数据，其中，所述图像切片头标示该图像切片中的宏块是采用帧编码方式还是场编码方式；e . 为所述每一个图像切片添加一宏块索引，其不包括在所述图像切片的编码数据中；f . 为所述每一个图像添加一图像头，其与其中的一个 (respective root) 或数个图像切片的编码数据以及所述宏块索引一同组成图像的编码数据。 CN1595990A CLAIM 3 . 如权利要求2所述的方法，其特征在于，所述图像切片为所述图像中的矩形区域，其左上角象素到所述图像上边和左边的距离都是16的整数 (first maximum region) 倍，所述图像切片的高度和宽度也是16的整数倍。

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20090103602A1 Filed: 2004-03-29 Issued: 2009-04-23 Overcomplete basis transform-based motion residual frame coding method and apparatus for video compression (Original Assignee) Digital Accelerator Corp (Current Assignee) ETIIP HOLDINGS Inc ; Digital Accelerator Corp Yi Xiong, Mark Sauer, Meng Wang, Peter Koat
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream (computer readable medium) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size (repeating step) and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding (highest energy) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20090103602A1 CLAIM 1 . A method for encoding a residual image using basis functions from an overcomplete library , said method (root region) comprising the steps of : a) obtaining the residual image , said residual image having a size and an energy ; and b) decomposing said residual image into a list of one or more atoms , each atom representing a basis function from the overcomplete library , said step of decomposing said residual image including the steps of : i) identifying a replacement region in the residual image for representation by an atom using a residual energy segmentation algorithm ; ii) creating a subset of basis functions from the overcomplete library , each basis function in the subset matching with the replacement region within a predetermined threshold ; iii) identifying an atom within the subset of basis functions , said atom for representing the replacement region and said atom having parameters ; iv) quantizing said atom and modifying the parameters of the atom into a form suited for encoding ; v) encoding said quantized atom , subtracting said atom from the replacement region in the residual image thereby reducing the energy of the residual image and using a quadtree-based atom coder to reduce the size of the residual image ; and vi) comparing the reduced size of the residual image or the reduced energy of the residual image with a predetermined criteria and repeating step (first maximum region size) s (i) to (vi) until the predetermined criteria is achieved ; thereby encoding said residual image and reducing the size thereof to a predetermined level . US20090103602A1 CLAIM 4 . The method according to claim 3 , wherein the step of identifying a replacement region comprises identification of an initial region within the residual image having a highest energy (information samples using prediction coding) , and growing the RESA rectangle therefrom . US20090103602A1 CLAIM 11 . A computer program product comprising a computer readable medium (data stream) having a computer program recorded thereon for performing a method for encoding a residual image using basis functions from an overcomplete library comprising the steps of : a) obtaining the residual image , said residual image having a size and an energy ; and b) decomposing said residual image into a list of one or more atoms , each atom representing a basis function from the overcomplete library , said step of decomposing said residual image including the steps of : i) identifying a replacement region in the residual image for representation by an atom using a residual energy segmentation algorithm ; ii) creating a subset of basis functions from the overcomplete library , each basis function in the subset matching with the replacement region within a predetermined threshold ; iii) identifying an atom within the subset of basis functions , said atom for representing the replacement region and said atom having parameters ; iv) quantizing said atom and modifying the parameters of the atom into a form suited for encoding ; v) encoding said quantized atom , subtracting said atom from the replacement region in the residual image thereby reducing the energy of the residual image and using a quadtree-based atom coder to reduce the size of the residual image ; and vi) comparing the reduced size of the residual image or the reduced energy of the residual image with a predetermined criteria and repeating steps (i) to (vi) until the predetermined criteria is achieved ; thereby encoding said residual image and reducing the size thereof to a predetermined level .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set of root regions such that the first set of root regions are rectangular blocks of a size determined by the first maximum region size (repeating step) , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	US20090103602A1 CLAIM 1 . A method for encoding a residual image using basis functions from an overcomplete library , said method comprising the steps of : a) obtaining the residual image , said residual image having a size and an energy ; and b) decomposing said residual image into a list of one or more atoms , each atom representing a basis function from the overcomplete library , said step of decomposing said residual image including the steps of : i) identifying a replacement region in the residual image for representation by an atom using a residual energy segmentation algorithm ; ii) creating a subset of basis functions from the overcomplete library , each basis function in the subset matching with the replacement region within a predetermined threshold ; iii) identifying an atom within the subset of basis functions , said atom for representing the replacement region and said atom having parameters ; iv) quantizing said atom and modifying the parameters of the atom into a form suited for encoding ; v) encoding said quantized atom , subtracting said atom from the replacement region in the residual image thereby reducing the energy of the residual image and using a quadtree-based atom coder to reduce the size of the residual image ; and vi) comparing the reduced size of the residual image or the reduced energy of the residual image with a predetermined criteria and repeating step (first maximum region size) s (i) to (vi) until the predetermined criteria is achieved ; thereby encoding said residual image and reducing the size thereof to a predetermined level .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region (said method) into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20090103602A1 CLAIM 1 . A method for encoding a residual image using basis functions from an overcomplete library , said method (root region) comprising the steps of : a) obtaining the residual image , said residual image having a size and an energy ; and b) decomposing said residual image into a list of one or more atoms , each atom representing a basis function from the overcomplete library , said step of decomposing said residual image including the steps of : i) identifying a replacement region in the residual image for representation by an atom using a residual energy segmentation algorithm ; ii) creating a subset of basis functions from the overcomplete library , each basis function in the subset matching with the replacement region within a predetermined threshold ; iii) identifying an atom within the subset of basis functions , said atom for representing the replacement region and said atom having parameters ; iv) quantizing said atom and modifying the parameters of the atom into a form suited for encoding ; v) encoding said quantized atom , subtracting said atom from the replacement region in the residual image thereby reducing the energy of the residual image and using a quadtree-based atom coder to reduce the size of the residual image ; and vi) comparing the reduced size of the residual image or the reduced energy of the residual image with a predetermined criteria and repeating steps (i) to (vi) until the predetermined criteria is achieved ; thereby encoding said residual image and reducing the size thereof to a predetermined level .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level from the data stream (computer readable medium) .	US20090103602A1 CLAIM 11 . A computer program product comprising a computer readable medium (data stream) having a computer program recorded thereon for performing a method for encoding a residual image using basis functions from an overcomplete library comprising the steps of : a) obtaining the residual image , said residual image having a size and an energy ; and b) decomposing said residual image into a list of one or more atoms , each atom representing a basis function from the overcomplete library , said step of decomposing said residual image including the steps of : i) identifying a replacement region in the residual image for representation by an atom using a residual energy segmentation algorithm ; ii) creating a subset of basis functions from the overcomplete library , each basis function in the subset matching with the replacement region within a predetermined threshold ; iii) identifying an atom within the subset of basis functions , said atom for representing the replacement region and said atom having parameters ; iv) quantizing said atom and modifying the parameters of the atom into a form suited for encoding ; v) encoding said quantized atom , subtracting said atom from the replacement region in the residual image thereby reducing the energy of the residual image and using a quadtree-based atom coder to reduce the size of the residual image ; and vi) comparing the reduced size of the residual image or the reduced energy of the residual image with a predetermined criteria and repeating steps (i) to (vi) until the predetermined criteria is achieved ; thereby encoding said residual image and reducing the size thereof to a predetermined level .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements associated with the first or second set of sub-regions from the data stream (computer readable medium) in a depth-first traversal order .	US20090103602A1 CLAIM 11 . A computer program product comprising a computer readable medium (data stream) having a computer program recorded thereon for performing a method for encoding a residual image using basis functions from an overcomplete library comprising the steps of : a) obtaining the residual image , said residual image having a size and an energy ; and b) decomposing said residual image into a list of one or more atoms , each atom representing a basis function from the overcomplete library , said step of decomposing said residual image including the steps of : i) identifying a replacement region in the residual image for representation by an atom using a residual energy segmentation algorithm ; ii) creating a subset of basis functions from the overcomplete library , each basis function in the subset matching with the replacement region within a predetermined threshold ; iii) identifying an atom within the subset of basis functions , said atom for representing the replacement region and said atom having parameters ; iv) quantizing said atom and modifying the parameters of the atom into a form suited for encoding ; v) encoding said quantized atom , subtracting said atom from the replacement region in the residual image thereby reducing the energy of the residual image and using a quadtree-based atom coder to reduce the size of the residual image ; and vi) comparing the reduced size of the residual image or the reduced energy of the residual image with a predetermined criteria and repeating steps (i) to (vi) until the predetermined criteria is achieved ; thereby encoding said residual image and reducing the size thereof to a predetermined level .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream (computer readable medium) , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20090103602A1 CLAIM 11 . A computer program product comprising a computer readable medium (data stream) having a computer program recorded thereon for performing a method for encoding a residual image using basis functions from an overcomplete library comprising the steps of : a) obtaining the residual image , said residual image having a size and an energy ; and b) decomposing said residual image into a list of one or more atoms , each atom representing a basis function from the overcomplete library , said step of decomposing said residual image including the steps of : i) identifying a replacement region in the residual image for representation by an atom using a residual energy segmentation algorithm ; ii) creating a subset of basis functions from the overcomplete library , each basis function in the subset matching with the replacement region within a predetermined threshold ; iii) identifying an atom within the subset of basis functions , said atom for representing the replacement region and said atom having parameters ; iv) quantizing said atom and modifying the parameters of the atom into a form suited for encoding ; v) encoding said quantized atom , subtracting said atom from the replacement region in the residual image thereby reducing the energy of the residual image and using a quadtree-based atom coder to reduce the size of the residual image ; and vi) comparing the reduced size of the residual image or the reduced energy of the residual image with a predetermined criteria and repeating steps (i) to (vi) until the predetermined criteria is achieved ; thereby encoding said residual image and reducing the size thereof to a predetermined level .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream (computer readable medium) , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	US20090103602A1 CLAIM 11 . A computer program product comprising a computer readable medium (data stream) having a computer program recorded thereon for performing a method for encoding a residual image using basis functions from an overcomplete library comprising the steps of : a) obtaining the residual image , said residual image having a size and an energy ; and b) decomposing said residual image into a list of one or more atoms , each atom representing a basis function from the overcomplete library , said step of decomposing said residual image including the steps of : i) identifying a replacement region in the residual image for representation by an atom using a residual energy segmentation algorithm ; ii) creating a subset of basis functions from the overcomplete library , each basis function in the subset matching with the replacement region within a predetermined threshold ; iii) identifying an atom within the subset of basis functions , said atom for representing the replacement region and said atom having parameters ; iv) quantizing said atom and modifying the parameters of the atom into a form suited for encoding ; v) encoding said quantized atom , subtracting said atom from the replacement region in the residual image thereby reducing the energy of the residual image and using a quadtree-based atom coder to reduce the size of the residual image ; and vi) comparing the reduced size of the residual image or the reduced energy of the residual image with a predetermined criteria and repeating steps (i) to (vi) until the predetermined criteria is achieved ; thereby encoding said residual image and reducing the size thereof to a predetermined level .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream (computer readable medium) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size (repeating step) and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding (highest energy) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20090103602A1 CLAIM 1 . A method for encoding a residual image using basis functions from an overcomplete library , said method (root region) comprising the steps of : a) obtaining the residual image , said residual image having a size and an energy ; and b) decomposing said residual image into a list of one or more atoms , each atom representing a basis function from the overcomplete library , said step of decomposing said residual image including the steps of : i) identifying a replacement region in the residual image for representation by an atom using a residual energy segmentation algorithm ; ii) creating a subset of basis functions from the overcomplete library , each basis function in the subset matching with the replacement region within a predetermined threshold ; iii) identifying an atom within the subset of basis functions , said atom for representing the replacement region and said atom having parameters ; iv) quantizing said atom and modifying the parameters of the atom into a form suited for encoding ; v) encoding said quantized atom , subtracting said atom from the replacement region in the residual image thereby reducing the energy of the residual image and using a quadtree-based atom coder to reduce the size of the residual image ; and vi) comparing the reduced size of the residual image or the reduced energy of the residual image with a predetermined criteria and repeating step (first maximum region size) s (i) to (vi) until the predetermined criteria is achieved ; thereby encoding said residual image and reducing the size thereof to a predetermined level . US20090103602A1 CLAIM 4 . The method according to claim 3 , wherein the step of identifying a replacement region comprises identification of an initial region within the residual image having a highest energy (information samples using prediction coding) , and growing the RESA rectangle therefrom . US20090103602A1 CLAIM 11 . A computer program product comprising a computer readable medium (data stream) having a computer program recorded thereon for performing a method for encoding a residual image using basis functions from an overcomplete library comprising the steps of : a) obtaining the residual image , said residual image having a size and an energy ; and b) decomposing said residual image into a list of one or more atoms , each atom representing a basis function from the overcomplete library , said step of decomposing said residual image including the steps of : i) identifying a replacement region in the residual image for representation by an atom using a residual energy segmentation algorithm ; ii) creating a subset of basis functions from the overcomplete library , each basis function in the subset matching with the replacement region within a predetermined threshold ; iii) identifying an atom within the subset of basis functions , said atom for representing the replacement region and said atom having parameters ; iv) quantizing said atom and modifying the parameters of the atom into a form suited for encoding ; v) encoding said quantized atom , subtracting said atom from the replacement region in the residual image thereby reducing the energy of the residual image and using a quadtree-based atom coder to reduce the size of the residual image ; and vi) comparing the reduced size of the residual image or the reduced energy of the residual image with a predetermined criteria and repeating steps (i) to (vi) until the predetermined criteria is achieved ; thereby encoding said residual image and reducing the size thereof to a predetermined level .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size (repeating step) , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream (computer readable medium) generator configured to : encode the array of information samples using prediction coding (highest energy) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20090103602A1 CLAIM 1 . A method for encoding a residual image using basis functions from an overcomplete library , said method (root region) comprising the steps of : a) obtaining the residual image , said residual image having a size and an energy ; and b) decomposing said residual image into a list of one or more atoms , each atom representing a basis function from the overcomplete library , said step of decomposing said residual image including the steps of : i) identifying a replacement region in the residual image for representation by an atom using a residual energy segmentation algorithm ; ii) creating a subset of basis functions from the overcomplete library , each basis function in the subset matching with the replacement region within a predetermined threshold ; iii) identifying an atom within the subset of basis functions , said atom for representing the replacement region and said atom having parameters ; iv) quantizing said atom and modifying the parameters of the atom into a form suited for encoding ; v) encoding said quantized atom , subtracting said atom from the replacement region in the residual image thereby reducing the energy of the residual image and using a quadtree-based atom coder to reduce the size of the residual image ; and vi) comparing the reduced size of the residual image or the reduced energy of the residual image with a predetermined criteria and repeating step (first maximum region size) s (i) to (vi) until the predetermined criteria is achieved ; thereby encoding said residual image and reducing the size thereof to a predetermined level . US20090103602A1 CLAIM 4 . The method according to claim 3 , wherein the step of identifying a replacement region comprises identification of an initial region within the residual image having a highest energy (information samples using prediction coding) , and growing the RESA rectangle therefrom . US20090103602A1 CLAIM 11 . A computer program product comprising a computer readable medium (data stream) having a computer program recorded thereon for performing a method for encoding a residual image using basis functions from an overcomplete library comprising the steps of : a) obtaining the residual image , said residual image having a size and an energy ; and b) decomposing said residual image into a list of one or more atoms , each atom representing a basis function from the overcomplete library , said step of decomposing said residual image including the steps of : i) identifying a replacement region in the residual image for representation by an atom using a residual energy segmentation algorithm ; ii) creating a subset of basis functions from the overcomplete library , each basis function in the subset matching with the replacement region within a predetermined threshold ; iii) identifying an atom within the subset of basis functions , said atom for representing the replacement region and said atom having parameters ; iv) quantizing said atom and modifying the parameters of the atom into a form suited for encoding ; v) encoding said quantized atom , subtracting said atom from the replacement region in the residual image thereby reducing the energy of the residual image and using a quadtree-based atom coder to reduce the size of the residual image ; and vi) comparing the reduced size of the residual image or the reduced energy of the residual image with a predetermined criteria and repeating steps (i) to (vi) until the predetermined criteria is achieved ; thereby encoding said residual image and reducing the size thereof to a predetermined level .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size (repeating step) ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding (highest energy) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream (computer readable medium) the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20090103602A1 CLAIM 1 . A method for encoding a residual image using basis functions from an overcomplete library , said method (root region) comprising the steps of : a) obtaining the residual image , said residual image having a size and an energy ; and b) decomposing said residual image into a list of one or more atoms , each atom representing a basis function from the overcomplete library , said step of decomposing said residual image including the steps of : i) identifying a replacement region in the residual image for representation by an atom using a residual energy segmentation algorithm ; ii) creating a subset of basis functions from the overcomplete library , each basis function in the subset matching with the replacement region within a predetermined threshold ; iii) identifying an atom within the subset of basis functions , said atom for representing the replacement region and said atom having parameters ; iv) quantizing said atom and modifying the parameters of the atom into a form suited for encoding ; v) encoding said quantized atom , subtracting said atom from the replacement region in the residual image thereby reducing the energy of the residual image and using a quadtree-based atom coder to reduce the size of the residual image ; and vi) comparing the reduced size of the residual image or the reduced energy of the residual image with a predetermined criteria and repeating step (first maximum region size) s (i) to (vi) until the predetermined criteria is achieved ; thereby encoding said residual image and reducing the size thereof to a predetermined level . US20090103602A1 CLAIM 4 . The method according to claim 3 , wherein the step of identifying a replacement region comprises identification of an initial region within the residual image having a highest energy (information samples using prediction coding) , and growing the RESA rectangle therefrom . US20090103602A1 CLAIM 11 . A computer program product comprising a computer readable medium (data stream) having a computer program recorded thereon for performing a method for encoding a residual image using basis functions from an overcomplete library comprising the steps of : a) obtaining the residual image , said residual image having a size and an energy ; and b) decomposing said residual image into a list of one or more atoms , each atom representing a basis function from the overcomplete library , said step of decomposing said residual image including the steps of : i) identifying a replacement region in the residual image for representation by an atom using a residual energy segmentation algorithm ; ii) creating a subset of basis functions from the overcomplete library , each basis function in the subset matching with the replacement region within a predetermined threshold ; iii) identifying an atom within the subset of basis functions , said atom for representing the replacement region and said atom having parameters ; iv) quantizing said atom and modifying the parameters of the atom into a form suited for encoding ; v) encoding said quantized atom , subtracting said atom from the replacement region in the residual image thereby reducing the energy of the residual image and using a quadtree-based atom coder to reduce the size of the residual image ; and vi) comparing the reduced size of the residual image or the reduced energy of the residual image with a predetermined criteria and repeating steps (i) to (vi) until the predetermined criteria is achieved ; thereby encoding said residual image and reducing the size thereof to a predetermined level .
US10250913B2 CLAIM 15 . A non-transitory computer readable digital storage medium having stored thereon a computer program (computer program) having a program code for performing , when running on a computer , a method according to claim 12 .	US20090103602A1 CLAIM 11 . A computer program (computer program) product comprising a computer readable medium having a computer program recorded thereon for performing a method for encoding a residual image using basis functions from an overcomplete library comprising the steps of : a) obtaining the residual image , said residual image having a size and an energy ; and b) decomposing said residual image into a list of one or more atoms , each atom representing a basis function from the overcomplete library , said step of decomposing said residual image including the steps of : i) identifying a replacement region in the residual image for representation by an atom using a residual energy segmentation algorithm ; ii) creating a subset of basis functions from the overcomplete library , each basis function in the subset matching with the replacement region within a predetermined threshold ; iii) identifying an atom within the subset of basis functions , said atom for representing the replacement region and said atom having parameters ; iv) quantizing said atom and modifying the parameters of the atom into a form suited for encoding ; v) encoding said quantized atom , subtracting said atom from the replacement region in the residual image thereby reducing the energy of the residual image and using a quadtree-based atom coder to reduce the size of the residual image ; and vi) comparing the reduced size of the residual image or the reduced energy of the residual image with a predetermined criteria and repeating steps (i) to (vi) until the predetermined criteria is achieved ; thereby encoding said residual image and reducing the size thereof to a predetermined level .
US10250913B2 CLAIM 16 . A non-transitory computer readable digital storage medium having stored thereon a computer program (computer program) having a program code for performing , when running on a computer , a method according to claim 14 .	US20090103602A1 CLAIM 11 . A computer program (computer program) product comprising a computer readable medium having a computer program recorded thereon for performing a method for encoding a residual image using basis functions from an overcomplete library comprising the steps of : a) obtaining the residual image , said residual image having a size and an energy ; and b) decomposing said residual image into a list of one or more atoms , each atom representing a basis function from the overcomplete library , said step of decomposing said residual image including the steps of : i) identifying a replacement region in the residual image for representation by an atom using a residual energy segmentation algorithm ; ii) creating a subset of basis functions from the overcomplete library , each basis function in the subset matching with the replacement region within a predetermined threshold ; iii) identifying an atom within the subset of basis functions , said atom for representing the replacement region and said atom having parameters ; iv) quantizing said atom and modifying the parameters of the atom into a form suited for encoding ; v) encoding said quantized atom , subtracting said atom from the replacement region in the residual image thereby reducing the energy of the residual image and using a quadtree-based atom coder to reduce the size of the residual image ; and vi) comparing the reduced size of the residual image or the reduced energy of the residual image with a predetermined criteria and repeating steps (i) to (vi) until the predetermined criteria is achieved ; thereby encoding said residual image and reducing the size thereof to a predetermined level .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	WO2004086302A1 Filed: 2004-03-29 Issued: 2004-10-07 Overcomplete basis transform-based motion residual frame coding method and apparatus for video compression (Original Assignee) Digital Accelerator Corporation Yi Xiong, Mark Sauer, Meng Wang, Peter Koat
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream (computer readable medium) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size (repeating step) and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding (highest energy) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	WO2004086302A1 CLAIM 1 . A method for encoding a residual image using basis functions from an overcomplete library , said method (root region) comprising the steps of : a) obtaining the residual image , said residual image having a size and an energy ; and b) decomposing said residual image into a list of one or more atoms , each atom representing a basis function from the overcomplete library , said step of decomposing said residual image including the steps of : i) identifying a replacement region in the residual image for representation by an atom using a residual energy segmentation algorithm ; ii) creating a subset of basis functions from the overcomplete library , each basis function in the subset matching with the replacement region within a predetermined threshold ; iii) identifying an atom within the subset of basis functions , said atom for representing the replacement region and said atom having parameters ; iv) quantizing said atom and modifying the parameters of the atom into a form suited for encoding ; v) encoding said quantized atom , subtracting said atom from the- replacement region in the residual image thereby reducing the energy of the residual image and using a quadtree-based atom coder to reduce the size of the residual image ; and vi) comparing the reduced size of the residual image or the reduced energy of the residual image with a predetermined criteria and repeating step (first maximum region size) s (i) to (vi) until the predetermined criteria is achieved ; thereby encoding said residual image and reducing the size thereof to a predetermined level . WO2004086302A1 CLAIM 4 . The method according to claim 3 , wherein the step of identifying a replacement region comprises identification of an initial region within the residual image having a highest energy (information samples using prediction coding) , and growing the RESA rectangle therefrom . WO2004086302A1 CLAIM 11 . A computer program product comprising a computer readable medium (data stream) having a computer program recorded thereon for performing a method for encoding a residual image using basis functions from an overcomplete library comprising the steps of : a) obtaining the residual image , said residual image having a size and an energy ; and b) decomposing said residual image into a list of one or more atoms , each atom representing a basis function from the overcomplete library , said step of decomposing said residual image including the steps of : i) identifying a replacement region in the residual image for representation by an atom using a residual energy segmentation algorithm ; ii) creating a subset of basis functions from the overcomplete library , each basis function in the subset matching with the replacement region within a predetermined threshold ; iii) identifying an atom within the subset of basis functions , said atom for representing the replacement region and said atom having parameters ; iv) quantizing said atom and modifying the parameters of the atom into a form suited for encoding ; v) encoding said quantized atom , subtracting said atom from the replacement region in the residual image thereby reducing the energy of the residual image and using a quadtree-based atom coder to reduce the size of the residual image ; and vi) comparing the reduced size of the residual image or the reduced energy of the residual image with a predetermined criteria and repeating steps (i) to (vi) until the predetermined criteria is achieved ; thereby encoding said residual image and reducing the size thereof to a predetermined level .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set of root regions such that the first set of root regions are rectangular blocks of a size determined by the first maximum region size (repeating step) , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	WO2004086302A1 CLAIM 1 . A method for encoding a residual image using basis functions from an overcomplete library , said method comprising the steps of : a) obtaining the residual image , said residual image having a size and an energy ; and b) decomposing said residual image into a list of one or more atoms , each atom representing a basis function from the overcomplete library , said step of decomposing said residual image including the steps of : i) identifying a replacement region in the residual image for representation by an atom using a residual energy segmentation algorithm ; ii) creating a subset of basis functions from the overcomplete library , each basis function in the subset matching with the replacement region within a predetermined threshold ; iii) identifying an atom within the subset of basis functions , said atom for representing the replacement region and said atom having parameters ; iv) quantizing said atom and modifying the parameters of the atom into a form suited for encoding ; v) encoding said quantized atom , subtracting said atom from the- replacement region in the residual image thereby reducing the energy of the residual image and using a quadtree-based atom coder to reduce the size of the residual image ; and vi) comparing the reduced size of the residual image or the reduced energy of the residual image with a predetermined criteria and repeating step (first maximum region size) s (i) to (vi) until the predetermined criteria is achieved ; thereby encoding said residual image and reducing the size thereof to a predetermined level .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region (said method) into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	WO2004086302A1 CLAIM 1 . A method for encoding a residual image using basis functions from an overcomplete library , said method (root region) comprising the steps of : a) obtaining the residual image , said residual image having a size and an energy ; and b) decomposing said residual image into a list of one or more atoms , each atom representing a basis function from the overcomplete library , said step of decomposing said residual image including the steps of : i) identifying a replacement region in the residual image for representation by an atom using a residual energy segmentation algorithm ; ii) creating a subset of basis functions from the overcomplete library , each basis function in the subset matching with the replacement region within a predetermined threshold ; iii) identifying an atom within the subset of basis functions , said atom for representing the replacement region and said atom having parameters ; iv) quantizing said atom and modifying the parameters of the atom into a form suited for encoding ; v) encoding said quantized atom , subtracting said atom from the- replacement region in the residual image thereby reducing the energy of the residual image and using a quadtree-based atom coder to reduce the size of the residual image ; and vi) comparing the reduced size of the residual image or the reduced energy of the residual image with a predetermined criteria and repeating steps (i) to (vi) until the predetermined criteria is achieved ; thereby encoding said residual image and reducing the size thereof to a predetermined level .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level from the data stream (computer readable medium) .	WO2004086302A1 CLAIM 11 . A computer program product comprising a computer readable medium (data stream) having a computer program recorded thereon for performing a method for encoding a residual image using basis functions from an overcomplete library comprising the steps of : a) obtaining the residual image , said residual image having a size and an energy ; and b) decomposing said residual image into a list of one or more atoms , each atom representing a basis function from the overcomplete library , said step of decomposing said residual image including the steps of : i) identifying a replacement region in the residual image for representation by an atom using a residual energy segmentation algorithm ; ii) creating a subset of basis functions from the overcomplete library , each basis function in the subset matching with the replacement region within a predetermined threshold ; iii) identifying an atom within the subset of basis functions , said atom for representing the replacement region and said atom having parameters ; iv) quantizing said atom and modifying the parameters of the atom into a form suited for encoding ; v) encoding said quantized atom , subtracting said atom from the replacement region in the residual image thereby reducing the energy of the residual image and using a quadtree-based atom coder to reduce the size of the residual image ; and vi) comparing the reduced size of the residual image or the reduced energy of the residual image with a predetermined criteria and repeating steps (i) to (vi) until the predetermined criteria is achieved ; thereby encoding said residual image and reducing the size thereof to a predetermined level .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements associated with the first or second set of sub-regions from the data stream (computer readable medium) in a depth-first traversal order .	WO2004086302A1 CLAIM 11 . A computer program product comprising a computer readable medium (data stream) having a computer program recorded thereon for performing a method for encoding a residual image using basis functions from an overcomplete library comprising the steps of : a) obtaining the residual image , said residual image having a size and an energy ; and b) decomposing said residual image into a list of one or more atoms , each atom representing a basis function from the overcomplete library , said step of decomposing said residual image including the steps of : i) identifying a replacement region in the residual image for representation by an atom using a residual energy segmentation algorithm ; ii) creating a subset of basis functions from the overcomplete library , each basis function in the subset matching with the replacement region within a predetermined threshold ; iii) identifying an atom within the subset of basis functions , said atom for representing the replacement region and said atom having parameters ; iv) quantizing said atom and modifying the parameters of the atom into a form suited for encoding ; v) encoding said quantized atom , subtracting said atom from the replacement region in the residual image thereby reducing the energy of the residual image and using a quadtree-based atom coder to reduce the size of the residual image ; and vi) comparing the reduced size of the residual image or the reduced energy of the residual image with a predetermined criteria and repeating steps (i) to (vi) until the predetermined criteria is achieved ; thereby encoding said residual image and reducing the size thereof to a predetermined level .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream (computer readable medium) , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	WO2004086302A1 CLAIM 11 . A computer program product comprising a computer readable medium (data stream) having a computer program recorded thereon for performing a method for encoding a residual image using basis functions from an overcomplete library comprising the steps of : a) obtaining the residual image , said residual image having a size and an energy ; and b) decomposing said residual image into a list of one or more atoms , each atom representing a basis function from the overcomplete library , said step of decomposing said residual image including the steps of : i) identifying a replacement region in the residual image for representation by an atom using a residual energy segmentation algorithm ; ii) creating a subset of basis functions from the overcomplete library , each basis function in the subset matching with the replacement region within a predetermined threshold ; iii) identifying an atom within the subset of basis functions , said atom for representing the replacement region and said atom having parameters ; iv) quantizing said atom and modifying the parameters of the atom into a form suited for encoding ; v) encoding said quantized atom , subtracting said atom from the replacement region in the residual image thereby reducing the energy of the residual image and using a quadtree-based atom coder to reduce the size of the residual image ; and vi) comparing the reduced size of the residual image or the reduced energy of the residual image with a predetermined criteria and repeating steps (i) to (vi) until the predetermined criteria is achieved ; thereby encoding said residual image and reducing the size thereof to a predetermined level .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream (computer readable medium) , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	WO2004086302A1 CLAIM 11 . A computer program product comprising a computer readable medium (data stream) having a computer program recorded thereon for performing a method for encoding a residual image using basis functions from an overcomplete library comprising the steps of : a) obtaining the residual image , said residual image having a size and an energy ; and b) decomposing said residual image into a list of one or more atoms , each atom representing a basis function from the overcomplete library , said step of decomposing said residual image including the steps of : i) identifying a replacement region in the residual image for representation by an atom using a residual energy segmentation algorithm ; ii) creating a subset of basis functions from the overcomplete library , each basis function in the subset matching with the replacement region within a predetermined threshold ; iii) identifying an atom within the subset of basis functions , said atom for representing the replacement region and said atom having parameters ; iv) quantizing said atom and modifying the parameters of the atom into a form suited for encoding ; v) encoding said quantized atom , subtracting said atom from the replacement region in the residual image thereby reducing the energy of the residual image and using a quadtree-based atom coder to reduce the size of the residual image ; and vi) comparing the reduced size of the residual image or the reduced energy of the residual image with a predetermined criteria and repeating steps (i) to (vi) until the predetermined criteria is achieved ; thereby encoding said residual image and reducing the size thereof to a predetermined level .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream (computer readable medium) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size (repeating step) and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding (highest energy) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	WO2004086302A1 CLAIM 1 . A method for encoding a residual image using basis functions from an overcomplete library , said method (root region) comprising the steps of : a) obtaining the residual image , said residual image having a size and an energy ; and b) decomposing said residual image into a list of one or more atoms , each atom representing a basis function from the overcomplete library , said step of decomposing said residual image including the steps of : i) identifying a replacement region in the residual image for representation by an atom using a residual energy segmentation algorithm ; ii) creating a subset of basis functions from the overcomplete library , each basis function in the subset matching with the replacement region within a predetermined threshold ; iii) identifying an atom within the subset of basis functions , said atom for representing the replacement region and said atom having parameters ; iv) quantizing said atom and modifying the parameters of the atom into a form suited for encoding ; v) encoding said quantized atom , subtracting said atom from the- replacement region in the residual image thereby reducing the energy of the residual image and using a quadtree-based atom coder to reduce the size of the residual image ; and vi) comparing the reduced size of the residual image or the reduced energy of the residual image with a predetermined criteria and repeating step (first maximum region size) s (i) to (vi) until the predetermined criteria is achieved ; thereby encoding said residual image and reducing the size thereof to a predetermined level . WO2004086302A1 CLAIM 4 . The method according to claim 3 , wherein the step of identifying a replacement region comprises identification of an initial region within the residual image having a highest energy (information samples using prediction coding) , and growing the RESA rectangle therefrom . WO2004086302A1 CLAIM 11 . A computer program product comprising a computer readable medium (data stream) having a computer program recorded thereon for performing a method for encoding a residual image using basis functions from an overcomplete library comprising the steps of : a) obtaining the residual image , said residual image having a size and an energy ; and b) decomposing said residual image into a list of one or more atoms , each atom representing a basis function from the overcomplete library , said step of decomposing said residual image including the steps of : i) identifying a replacement region in the residual image for representation by an atom using a residual energy segmentation algorithm ; ii) creating a subset of basis functions from the overcomplete library , each basis function in the subset matching with the replacement region within a predetermined threshold ; iii) identifying an atom within the subset of basis functions , said atom for representing the replacement region and said atom having parameters ; iv) quantizing said atom and modifying the parameters of the atom into a form suited for encoding ; v) encoding said quantized atom , subtracting said atom from the replacement region in the residual image thereby reducing the energy of the residual image and using a quadtree-based atom coder to reduce the size of the residual image ; and vi) comparing the reduced size of the residual image or the reduced energy of the residual image with a predetermined criteria and repeating steps (i) to (vi) until the predetermined criteria is achieved ; thereby encoding said residual image and reducing the size thereof to a predetermined level .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size (repeating step) , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream (computer readable medium) generator configured to : encode the array of information samples using prediction coding (highest energy) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	WO2004086302A1 CLAIM 1 . A method for encoding a residual image using basis functions from an overcomplete library , said method (root region) comprising the steps of : a) obtaining the residual image , said residual image having a size and an energy ; and b) decomposing said residual image into a list of one or more atoms , each atom representing a basis function from the overcomplete library , said step of decomposing said residual image including the steps of : i) identifying a replacement region in the residual image for representation by an atom using a residual energy segmentation algorithm ; ii) creating a subset of basis functions from the overcomplete library , each basis function in the subset matching with the replacement region within a predetermined threshold ; iii) identifying an atom within the subset of basis functions , said atom for representing the replacement region and said atom having parameters ; iv) quantizing said atom and modifying the parameters of the atom into a form suited for encoding ; v) encoding said quantized atom , subtracting said atom from the- replacement region in the residual image thereby reducing the energy of the residual image and using a quadtree-based atom coder to reduce the size of the residual image ; and vi) comparing the reduced size of the residual image or the reduced energy of the residual image with a predetermined criteria and repeating step (first maximum region size) s (i) to (vi) until the predetermined criteria is achieved ; thereby encoding said residual image and reducing the size thereof to a predetermined level . WO2004086302A1 CLAIM 4 . The method according to claim 3 , wherein the step of identifying a replacement region comprises identification of an initial region within the residual image having a highest energy (information samples using prediction coding) , and growing the RESA rectangle therefrom . WO2004086302A1 CLAIM 11 . A computer program product comprising a computer readable medium (data stream) having a computer program recorded thereon for performing a method for encoding a residual image using basis functions from an overcomplete library comprising the steps of : a) obtaining the residual image , said residual image having a size and an energy ; and b) decomposing said residual image into a list of one or more atoms , each atom representing a basis function from the overcomplete library , said step of decomposing said residual image including the steps of : i) identifying a replacement region in the residual image for representation by an atom using a residual energy segmentation algorithm ; ii) creating a subset of basis functions from the overcomplete library , each basis function in the subset matching with the replacement region within a predetermined threshold ; iii) identifying an atom within the subset of basis functions , said atom for representing the replacement region and said atom having parameters ; iv) quantizing said atom and modifying the parameters of the atom into a form suited for encoding ; v) encoding said quantized atom , subtracting said atom from the replacement region in the residual image thereby reducing the energy of the residual image and using a quadtree-based atom coder to reduce the size of the residual image ; and vi) comparing the reduced size of the residual image or the reduced energy of the residual image with a predetermined criteria and repeating steps (i) to (vi) until the predetermined criteria is achieved ; thereby encoding said residual image and reducing the size thereof to a predetermined level .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size (repeating step) ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding (highest energy) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream (computer readable medium) the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	WO2004086302A1 CLAIM 1 . A method for encoding a residual image using basis functions from an overcomplete library , said method (root region) comprising the steps of : a) obtaining the residual image , said residual image having a size and an energy ; and b) decomposing said residual image into a list of one or more atoms , each atom representing a basis function from the overcomplete library , said step of decomposing said residual image including the steps of : i) identifying a replacement region in the residual image for representation by an atom using a residual energy segmentation algorithm ; ii) creating a subset of basis functions from the overcomplete library , each basis function in the subset matching with the replacement region within a predetermined threshold ; iii) identifying an atom within the subset of basis functions , said atom for representing the replacement region and said atom having parameters ; iv) quantizing said atom and modifying the parameters of the atom into a form suited for encoding ; v) encoding said quantized atom , subtracting said atom from the- replacement region in the residual image thereby reducing the energy of the residual image and using a quadtree-based atom coder to reduce the size of the residual image ; and vi) comparing the reduced size of the residual image or the reduced energy of the residual image with a predetermined criteria and repeating step (first maximum region size) s (i) to (vi) until the predetermined criteria is achieved ; thereby encoding said residual image and reducing the size thereof to a predetermined level . WO2004086302A1 CLAIM 4 . The method according to claim 3 , wherein the step of identifying a replacement region comprises identification of an initial region within the residual image having a highest energy (information samples using prediction coding) , and growing the RESA rectangle therefrom . WO2004086302A1 CLAIM 11 . A computer program product comprising a computer readable medium (data stream) having a computer program recorded thereon for performing a method for encoding a residual image using basis functions from an overcomplete library comprising the steps of : a) obtaining the residual image , said residual image having a size and an energy ; and b) decomposing said residual image into a list of one or more atoms , each atom representing a basis function from the overcomplete library , said step of decomposing said residual image including the steps of : i) identifying a replacement region in the residual image for representation by an atom using a residual energy segmentation algorithm ; ii) creating a subset of basis functions from the overcomplete library , each basis function in the subset matching with the replacement region within a predetermined threshold ; iii) identifying an atom within the subset of basis functions , said atom for representing the replacement region and said atom having parameters ; iv) quantizing said atom and modifying the parameters of the atom into a form suited for encoding ; v) encoding said quantized atom , subtracting said atom from the replacement region in the residual image thereby reducing the energy of the residual image and using a quadtree-based atom coder to reduce the size of the residual image ; and vi) comparing the reduced size of the residual image or the reduced energy of the residual image with a predetermined criteria and repeating steps (i) to (vi) until the predetermined criteria is achieved ; thereby encoding said residual image and reducing the size thereof to a predetermined level .
US10250913B2 CLAIM 15 . A non-transitory computer readable digital storage medium having stored thereon a computer program (computer program) having a program code for performing , when running on a computer , a method according to claim 12 .	WO2004086302A1 CLAIM 11 . A computer program (computer program) product comprising a computer readable medium having a computer program recorded thereon for performing a method for encoding a residual image using basis functions from an overcomplete library comprising the steps of : a) obtaining the residual image , said residual image having a size and an energy ; and b) decomposing said residual image into a list of one or more atoms , each atom representing a basis function from the overcomplete library , said step of decomposing said residual image including the steps of : i) identifying a replacement region in the residual image for representation by an atom using a residual energy segmentation algorithm ; ii) creating a subset of basis functions from the overcomplete library , each basis function in the subset matching with the replacement region within a predetermined threshold ; iii) identifying an atom within the subset of basis functions , said atom for representing the replacement region and said atom having parameters ; iv) quantizing said atom and modifying the parameters of the atom into a form suited for encoding ; v) encoding said quantized atom , subtracting said atom from the replacement region in the residual image thereby reducing the energy of the residual image and using a quadtree-based atom coder to reduce the size of the residual image ; and vi) comparing the reduced size of the residual image or the reduced energy of the residual image with a predetermined criteria and repeating steps (i) to (vi) until the predetermined criteria is achieved ; thereby encoding said residual image and reducing the size thereof to a predetermined level .
US10250913B2 CLAIM 16 . A non-transitory computer readable digital storage medium having stored thereon a computer program (computer program) having a program code for performing , when running on a computer , a method according to claim 14 .	WO2004086302A1 CLAIM 11 . A computer program (computer program) product comprising a computer readable medium having a computer program recorded thereon for performing a method for encoding a residual image using basis functions from an overcomplete library comprising the steps of : a) obtaining the residual image , said residual image having a size and an energy ; and b) decomposing said residual image into a list of one or more atoms , each atom representing a basis function from the overcomplete library , said step of decomposing said residual image including the steps of : i) identifying a replacement region in the residual image for representation by an atom using a residual energy segmentation algorithm ; ii) creating a subset of basis functions from the overcomplete library , each basis function in the subset matching with the replacement region within a predetermined threshold ; iii) identifying an atom within the subset of basis functions , said atom for representing the replacement region and said atom having parameters ; iv) quantizing said atom and modifying the parameters of the atom into a form suited for encoding ; v) encoding said quantized atom , subtracting said atom from the replacement region in the residual image thereby reducing the energy of the residual image and using a quadtree-based atom coder to reduce the size of the residual image ; and vi) comparing the reduced size of the residual image or the reduced energy of the residual image with a predetermined criteria and repeating steps (i) to (vi) until the predetermined criteria is achieved ; thereby encoding said residual image and reducing the size thereof to a predetermined level .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20050200630A1 Filed: 2004-03-10 Issued: 2005-09-15 Image formats for video capture, processing and display (Original Assignee) Microsoft Corp (Current Assignee) Microsoft Technology Licensing LLC Glenn Evans, Stephen Estrop
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream (different bit) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (second un) information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision (first unit) information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding (chroma component, color space) ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20050200630A1 CLAIM 18 . The method of claim 11 wherein the color channel data is in a YUV color space (transform coding, spatial domain, spatial domain transform coding) . US20050200630A1 CLAIM 20 . In a computer system , a method of representing pixel data for a video image in a packed format , the method comprising : storing first luma data for a first pixel in a first unit (first subdivision, first subdivision information) of memory ; storing first chroma data shared by the first pixel and a second pixel in a second un (second subdivision, second subdivision information) it of memory at a higher memory address than the first unit of memory ; storing second luma data for the second pixel in a third unit of memory at a higher memory address than the second unit of memory ; and storing second chroma data shared by the first pixel and the second pixel in a fourth unit of memory at a higher memory address than the third unit of memory ; wherein the first and second luma data and the first and second chroma data have a bit precision of greater than eight bits per channel . US20050200630A1 CLAIM 26 . The computer-readable medium of claim 25 wherein the four-character code is changeable to cast the format of the digital video data to a different bit (data stream) precision . US20050200630A1 CLAIM 31 . The method of claim 27 wherein the chroma information is stored as interleaved pairs of chroma component (transform coding, spatial domain, spatial domain transform coding) s .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision (first unit) information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20050200630A1 CLAIM 20 . In a computer system , a method of representing pixel data for a video image in a packed format , the method comprising : storing first luma data for a first pixel in a first unit (first subdivision, first subdivision information) of memory ; storing first chroma data shared by the first pixel and a second pixel in a second unit of memory at a higher memory address than the first unit of memory ; storing second luma data for the second pixel in a third unit of memory at a higher memory address than the second unit of memory ; and storing second chroma data shared by the first pixel and the second pixel in a fourth unit of memory at a higher memory address than the third unit of memory ; wherein the first and second luma data and the first and second chroma data have a bit precision of greater than eight bits per channel .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision (first unit) information includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level is sub-divided .	US20050200630A1 CLAIM 20 . In a computer system , a method of representing pixel data for a video image in a packed format , the method comprising : storing first luma data for a first pixel in a first unit (first subdivision, first subdivision information) of memory ; storing first chroma data shared by the first pixel and a second pixel in a second unit of memory at a higher memory address than the first unit of memory ; storing second luma data for the second pixel in a third unit of memory at a higher memory address than the second unit of memory ; and storing second chroma data shared by the first pixel and the second pixel in a fourth unit of memory at a higher memory address than the third unit of memory ; wherein the first and second luma data and the first and second chroma data have a bit precision of greater than eight bits per channel .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level from the data stream (different bit) .	US20050200630A1 CLAIM 26 . The computer-readable medium of claim 25 wherein the four-character code is changeable to cast the format of the digital video data to a different bit (data stream) precision .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements associated with the first or second set of sub-regions from the data stream (different bit) in a depth-first traversal order .	US20050200630A1 CLAIM 26 . The computer-readable medium of claim 25 wherein the four-character code is changeable to cast the format of the digital video data to a different bit (data stream) precision .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream (different bit) , disjoint from a second subset of syntax elements of the data stream including the first subdivision (first unit) information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20050200630A1 CLAIM 20 . In a computer system , a method of representing pixel data for a video image in a packed format , the method comprising : storing first luma data for a first pixel in a first unit (first subdivision, first subdivision information) of memory ; storing first chroma data shared by the first pixel and a second pixel in a second unit of memory at a higher memory address than the first unit of memory ; storing second luma data for the second pixel in a third unit of memory at a higher memory address than the second unit of memory ; and storing second chroma data shared by the first pixel and the second pixel in a fourth unit of memory at a higher memory address than the third unit of memory ; wherein the first and second luma data and the first and second chroma data have a bit precision of greater than eight bits per channel . US20050200630A1 CLAIM 26 . The computer-readable medium of claim 25 wherein the four-character code is changeable to cast the format of the digital video data to a different bit (data stream) precision .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream (different bit) , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding (chroma component, color space) to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	US20050200630A1 CLAIM 18 . The method of claim 11 wherein the color channel data is in a YUV color space (transform coding, spatial domain, spatial domain transform coding) . US20050200630A1 CLAIM 26 . The computer-readable medium of claim 25 wherein the four-character code is changeable to cast the format of the digital video data to a different bit (data stream) precision . US20050200630A1 CLAIM 31 . The method of claim 27 wherein the chroma information is stored as interleaved pairs of chroma component (transform coding, spatial domain, spatial domain transform coding) s .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream (different bit) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (second un) information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision (first unit) information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding (chroma component, color space) ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20050200630A1 CLAIM 18 . The method of claim 11 wherein the color channel data is in a YUV color space (transform coding, spatial domain, spatial domain transform coding) . US20050200630A1 CLAIM 20 . In a computer system , a method of representing pixel data for a video image in a packed format , the method comprising : storing first luma data for a first pixel in a first unit (first subdivision, first subdivision information) of memory ; storing first chroma data shared by the first pixel and a second pixel in a second un (second subdivision, second subdivision information) it of memory at a higher memory address than the first unit of memory ; storing second luma data for the second pixel in a third unit of memory at a higher memory address than the second unit of memory ; and storing second chroma data shared by the first pixel and the second pixel in a fourth unit of memory at a higher memory address than the third unit of memory ; wherein the first and second luma data and the first and second chroma data have a bit precision of greater than eight bits per channel . US20050200630A1 CLAIM 26 . The computer-readable medium of claim 25 wherein the four-character code is changeable to cast the format of the digital video data to a different bit (data stream) precision . US20050200630A1 CLAIM 31 . The method of claim 27 wherein the chroma information is stored as interleaved pairs of chroma component (transform coding, spatial domain, spatial domain transform coding) s .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision (first unit) information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (second un) information and a maximum hierarchy level ; and a data stream (different bit) generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding (chroma component, color space) in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20050200630A1 CLAIM 18 . The method of claim 11 wherein the color channel data is in a YUV color space (transform coding, spatial domain, spatial domain transform coding) . US20050200630A1 CLAIM 20 . In a computer system , a method of representing pixel data for a video image in a packed format , the method comprising : storing first luma data for a first pixel in a first unit (first subdivision, first subdivision information) of memory ; storing first chroma data shared by the first pixel and a second pixel in a second un (second subdivision, second subdivision information) it of memory at a higher memory address than the first unit of memory ; storing second luma data for the second pixel in a third unit of memory at a higher memory address than the second unit of memory ; and storing second chroma data shared by the first pixel and the second pixel in a fourth unit of memory at a higher memory address than the third unit of memory ; wherein the first and second luma data and the first and second chroma data have a bit precision of greater than eight bits per channel . US20050200630A1 CLAIM 26 . The computer-readable medium of claim 25 wherein the four-character code is changeable to cast the format of the digital video data to a different bit (data stream) precision . US20050200630A1 CLAIM 31 . The method of claim 27 wherein the chroma information is stored as interleaved pairs of chroma component (transform coding, spatial domain, spatial domain transform coding) s .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision (first unit) information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (second un) information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding (chroma component, color space) in accordance with the second set of sub-regions ; and inserting into a data stream (different bit) the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20050200630A1 CLAIM 18 . The method of claim 11 wherein the color channel data is in a YUV color space (transform coding, spatial domain, spatial domain transform coding) . US20050200630A1 CLAIM 20 . In a computer system , a method of representing pixel data for a video image in a packed format , the method comprising : storing first luma data for a first pixel in a first unit (first subdivision, first subdivision information) of memory ; storing first chroma data shared by the first pixel and a second pixel in a second un (second subdivision, second subdivision information) it of memory at a higher memory address than the first unit of memory ; storing second luma data for the second pixel in a third unit of memory at a higher memory address than the second unit of memory ; and storing second chroma data shared by the first pixel and the second pixel in a fourth unit of memory at a higher memory address than the third unit of memory ; wherein the first and second luma data and the first and second chroma data have a bit precision of greater than eight bits per channel . US20050200630A1 CLAIM 26 . The computer-readable medium of claim 25 wherein the four-character code is changeable to cast the format of the digital video data to a different bit (data stream) precision . US20050200630A1 CLAIM 31 . The method of claim 27 wherein the chroma information is stored as interleaved pairs of chroma component (transform coding, spatial domain, spatial domain transform coding) s .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20070036215A1 Filed: 2004-03-03 Issued: 2007-02-15 Fast mode decision algorithm for intra prediction for advanced video coding (Original Assignee) Agency for Science Technology and Research, Singapore (Current Assignee) Agency for Science Technology and Research, Singapore Feng Pan, Xiao Lin, Susanto Rahardja, Keng Pang Lim, Zheng Li, Ge Nan Feng, Da Jun Wu, Si Wu
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream (computer readable medium, chrominance components) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level (one edge) (one edge) wherein the first maximum region size and the first subdivision (plane prediction) information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20070036215A1 CLAIM 1 . A method of AVC intra prediction to code digital video comprising a plurality of pictures , said method (root region) comprising the steps of : generating edge directional information for each intra block of a digital picture ; and choosing most probable intra prediction modes for rate distortion optimisation dependent upon said generated edge directional information . US20070036215A1 CLAIM 2 . The method according to claim 1 , wherein said edge directional information is generated by applying at least one edge (maximum hierarchy level, hierarchy level, order hierarchy level) operator to said digital picture . US20070036215A1 CLAIM 4 . The method according to claim 2 , wherein said edge operator is applied to every luminance and chrominance pixel except any pixels of the borders of the luminance and chrominance components (data stream) of said digital picture . US20070036215A1 CLAIM 10 . The method according to claim 9 , wherein prediction modes comprise two directional prediction modes , a plane prediction (first subdivision) mode , and a DC prediction mode . US20070036215A1 CLAIM 29 . A computer program product having a computer program recorded on a computer readable medium (data stream) using AVC intra prediction to code digital video comprising a plurality of pictures , said computer program product comprising : computer program code means for generating edge directional information for each intra block of a digital picture ; and computer program code means for choosing most probable intra prediction modes for rate distortion optimisation dependent upon said generated edge directional information .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision (plane prediction) information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region (said method) into sub-regions of a first hierarchy level (one edge) according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level (one edge) is reached .	US20070036215A1 CLAIM 1 . A method of AVC intra prediction to code digital video comprising a plurality of pictures , said method (root region) comprising the steps of : generating edge directional information for each intra block of a digital picture ; and choosing most probable intra prediction modes for rate distortion optimisation dependent upon said generated edge directional information . US20070036215A1 CLAIM 2 . The method according to claim 1 , wherein said edge directional information is generated by applying at least one edge (maximum hierarchy level, hierarchy level, order hierarchy level) operator to said digital picture . US20070036215A1 CLAIM 10 . The method according to claim 9 , wherein prediction modes comprise two directional prediction modes , a plane prediction (first subdivision) mode , and a DC prediction mode .
US10250913B2 CLAIM 5 . The decoder according to claim 4 , wherein the divider is configured to , in accordance with the partition rules associated with the first and higher-order hierarchy levels , sub-divide into sub-regions of equal size , such that there are an equal number of sub-regions at each hierarchy level (one edge) .	US20070036215A1 CLAIM 2 . The method according to claim 1 , wherein said edge directional information is generated by applying at least one edge (maximum hierarchy level, hierarchy level, order hierarchy level) operator to said digital picture .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision (plane prediction) information includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level (one edge) is sub-divided .	US20070036215A1 CLAIM 2 . The method according to claim 1 , wherein said edge directional information is generated by applying at least one edge (maximum hierarchy level, hierarchy level, order hierarchy level) operator to said digital picture . US20070036215A1 CLAIM 10 . The method according to claim 9 , wherein prediction modes comprise two directional prediction modes , a plane prediction (first subdivision) mode , and a DC prediction mode .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level (one edge) (one edge) from the data stream (computer readable medium, chrominance components) .	US20070036215A1 CLAIM 2 . The method according to claim 1 , wherein said edge directional information is generated by applying at least one edge (maximum hierarchy level, hierarchy level, order hierarchy level) operator to said digital picture . US20070036215A1 CLAIM 4 . The method according to claim 2 , wherein said edge operator is applied to every luminance and chrominance pixel except any pixels of the borders of the luminance and chrominance components (data stream) of said digital picture . US20070036215A1 CLAIM 29 . A computer program product having a computer program recorded on a computer readable medium (data stream) using AVC intra prediction to code digital video comprising a plurality of pictures , said computer program product comprising : computer program code means for generating edge directional information for each intra block of a digital picture ; and computer program code means for choosing most probable intra prediction modes for rate distortion optimisation dependent upon said generated edge directional information .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements associated with the first or second set of sub-regions from the data stream (computer readable medium, chrominance components) in a depth-first traversal order .	US20070036215A1 CLAIM 4 . The method according to claim 2 , wherein said edge operator is applied to every luminance and chrominance pixel except any pixels of the borders of the luminance and chrominance components (data stream) of said digital picture . US20070036215A1 CLAIM 29 . A computer program product having a computer program recorded on a computer readable medium (data stream) using AVC intra prediction to code digital video comprising a plurality of pictures , said computer program product comprising : computer program code means for generating edge directional information for each intra block of a digital picture ; and computer program code means for choosing most probable intra prediction modes for rate distortion optimisation dependent upon said generated edge directional information .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream (computer readable medium, chrominance components) , disjoint from a second subset of syntax elements of the data stream including the first subdivision (plane prediction) information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20070036215A1 CLAIM 4 . The method according to claim 2 , wherein said edge operator is applied to every luminance and chrominance pixel except any pixels of the borders of the luminance and chrominance components (data stream) of said digital picture . US20070036215A1 CLAIM 10 . The method according to claim 9 , wherein prediction modes comprise two directional prediction modes , a plane prediction (first subdivision) mode , and a DC prediction mode . US20070036215A1 CLAIM 29 . A computer program product having a computer program recorded on a computer readable medium (data stream) using AVC intra prediction to code digital video comprising a plurality of pictures , said computer program product comprising : computer program code means for generating edge directional information for each intra block of a digital picture ; and computer program code means for choosing most probable intra prediction modes for rate distortion optimisation dependent upon said generated edge directional information .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream (computer readable medium, chrominance components) , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	US20070036215A1 CLAIM 4 . The method according to claim 2 , wherein said edge operator is applied to every luminance and chrominance pixel except any pixels of the borders of the luminance and chrominance components (data stream) of said digital picture . US20070036215A1 CLAIM 29 . A computer program product having a computer program recorded on a computer readable medium (data stream) using AVC intra prediction to code digital video comprising a plurality of pictures , said computer program product comprising : computer program code means for generating edge directional information for each intra block of a digital picture ; and computer program code means for choosing most probable intra prediction modes for rate distortion optimisation dependent upon said generated edge directional information .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream (computer readable medium, chrominance components) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level (one edge) (one edge) , wherein the first maximum region size and the first subdivision (plane prediction) information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20070036215A1 CLAIM 1 . A method of AVC intra prediction to code digital video comprising a plurality of pictures , said method (root region) comprising the steps of : generating edge directional information for each intra block of a digital picture ; and choosing most probable intra prediction modes for rate distortion optimisation dependent upon said generated edge directional information . US20070036215A1 CLAIM 2 . The method according to claim 1 , wherein said edge directional information is generated by applying at least one edge (maximum hierarchy level, hierarchy level, order hierarchy level) operator to said digital picture . US20070036215A1 CLAIM 4 . The method according to claim 2 , wherein said edge operator is applied to every luminance and chrominance pixel except any pixels of the borders of the luminance and chrominance components (data stream) of said digital picture . US20070036215A1 CLAIM 10 . The method according to claim 9 , wherein prediction modes comprise two directional prediction modes , a plane prediction (first subdivision) mode , and a DC prediction mode . US20070036215A1 CLAIM 29 . A computer program product having a computer program recorded on a computer readable medium (data stream) using AVC intra prediction to code digital video comprising a plurality of pictures , said computer program product comprising : computer program code means for generating edge directional information for each intra block of a digital picture ; and computer program code means for choosing most probable intra prediction modes for rate distortion optimisation dependent upon said generated edge directional information .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision (plane prediction) information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level (one edge) (one edge) ; and a data stream (computer readable medium, chrominance components) generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20070036215A1 CLAIM 1 . A method of AVC intra prediction to code digital video comprising a plurality of pictures , said method (root region) comprising the steps of : generating edge directional information for each intra block of a digital picture ; and choosing most probable intra prediction modes for rate distortion optimisation dependent upon said generated edge directional information . US20070036215A1 CLAIM 2 . The method according to claim 1 , wherein said edge directional information is generated by applying at least one edge (maximum hierarchy level, hierarchy level, order hierarchy level) operator to said digital picture . US20070036215A1 CLAIM 4 . The method according to claim 2 , wherein said edge operator is applied to every luminance and chrominance pixel except any pixels of the borders of the luminance and chrominance components (data stream) of said digital picture . US20070036215A1 CLAIM 10 . The method according to claim 9 , wherein prediction modes comprise two directional prediction modes , a plane prediction (first subdivision) mode , and a DC prediction mode . US20070036215A1 CLAIM 29 . A computer program product having a computer program recorded on a computer readable medium (data stream) using AVC intra prediction to code digital video comprising a plurality of pictures , said computer program product comprising : computer program code means for generating edge directional information for each intra block of a digital picture ; and computer program code means for choosing most probable intra prediction modes for rate distortion optimisation dependent upon said generated edge directional information .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision (plane prediction) information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level (one edge) (one edge) ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream (computer readable medium, chrominance components) the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20070036215A1 CLAIM 1 . A method of AVC intra prediction to code digital video comprising a plurality of pictures , said method (root region) comprising the steps of : generating edge directional information for each intra block of a digital picture ; and choosing most probable intra prediction modes for rate distortion optimisation dependent upon said generated edge directional information . US20070036215A1 CLAIM 2 . The method according to claim 1 , wherein said edge directional information is generated by applying at least one edge (maximum hierarchy level, hierarchy level, order hierarchy level) operator to said digital picture . US20070036215A1 CLAIM 4 . The method according to claim 2 , wherein said edge operator is applied to every luminance and chrominance pixel except any pixels of the borders of the luminance and chrominance components (data stream) of said digital picture . US20070036215A1 CLAIM 10 . The method according to claim 9 , wherein prediction modes comprise two directional prediction modes , a plane prediction (first subdivision) mode , and a DC prediction mode . US20070036215A1 CLAIM 29 . A computer program product having a computer program recorded on a computer readable medium (data stream) using AVC intra prediction to code digital video comprising a plurality of pictures , said computer program product comprising : computer program code means for generating edge directional information for each intra block of a digital picture ; and computer program code means for choosing most probable intra prediction modes for rate distortion optimisation dependent upon said generated edge directional information .
US10250913B2 CLAIM 15 . A non-transitory computer readable digital storage medium having stored thereon a computer program having a program code (program code) for performing , when running on a computer , a method according to claim 12 .	US20070036215A1 CLAIM 29 . A computer program product having a computer program recorded on a computer readable medium using AVC intra prediction to code digital video comprising a plurality of pictures , said computer program product comprising : computer program code (program code) means for generating edge directional information for each intra block of a digital picture ; and computer program code means for choosing most probable intra prediction modes for rate distortion optimisation dependent upon said generated edge directional information .
US10250913B2 CLAIM 16 . A non-transitory computer readable digital storage medium having stored thereon a computer program having a program code (program code) for performing , when running on a computer , a method according to claim 14 .	US20070036215A1 CLAIM 29 . A computer program product having a computer program recorded on a computer readable medium using AVC intra prediction to code digital video comprising a plurality of pictures , said computer program product comprising : computer program code (program code) means for generating edge directional information for each intra block of a digital picture ; and computer program code means for choosing most probable intra prediction modes for rate distortion optimisation dependent upon said generated edge directional information .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	CN1549206A Filed: 2003-12-05 Issued: 2004-11-24 对三维对象数据进行编码和解码的方法及装置 (Original Assignee) 三星电子株式会社; 财团法人索尔大学校产学协力财团朴仁圭, 李信俊, 宋寅昱, 金昌洙, 李商郁
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition (标记进行) rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	CN1549206A CLAIM 11 . 根据权利要求8或9的方法，其中步骤(C)包括：对表示候选节点是否存在于队列中的信息的连续标记进行 (respective partition) 编码；对表示队列中每个候选节点的位置的节点位置信息进行编码；对表示当前节点是否为“S”节点或“P”节点的节点类型信息进行编码；以及如果节点信息表示当前节点为“S”节点，则对“S”节点的DIB数据进行编码，和如果节点信息表示当前节点为“P”节点，则对“P”节点的DIB数据进行编码。
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision information includes a partition indication flag (预测部分) indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level is sub-divided .	CN1549206A CLAIM 3 . 根据权利要求2的方法，其中在表示三维对象数据的树形结构中，具有子节点的节点被标记为“S”，其体元不包括对象的节点被标记为“W”，其体元都包括对象的节点被标记为“B”，以及使用预测部分 (partition indication flag) 匹配(PPM)算法对其体元进行编码的节点被标记为“P”。
US10250913B2 CLAIM 15 . A non-transitory computer readable digital storage (结构数据) medium having stored thereon a computer program having a program code for performing , when running on a computer , a method according to claim 12 .	CN1549206A CLAIM 1 . 一种对三维对象数据进行编码的方法，其中所述三维对象数据由点纹理数据、体元数据或者八叉树形结构数据 (readable digital storage) 组成，所述方法包括：生成具有树形结构的三维对象数据，其中在所述树形结构中，节点被加以表示其类型的标记；对三维对象数据的节点进行编码；以及生成其节点被编码成位流的三维对象数据。
US10250913B2 CLAIM 16 . A non-transitory computer readable digital storage (结构数据) medium having stored thereon a computer program having a program code for performing , when running on a computer , a method according to claim 14 .	CN1549206A CLAIM 1 . 一种对三维对象数据进行编码的方法，其中所述三维对象数据由点纹理数据、体元数据或者八叉树形结构数据 (readable digital storage) 组成，所述方法包括：生成具有树形结构的三维对象数据，其中在所述树形结构中，节点被加以表示其类型的标记；对三维对象数据的节点进行编码；以及生成其节点被编码成位流的三维对象数据。

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20050114298A1 Filed: 2003-11-26 Issued: 2005-05-26 System and method for indexing weighted-sequences in large databases (Original Assignee) International Business Machines Corp (Current Assignee) SAP SE Wei Fan, Chang-shing Perng, Haixun Wang, Philip Yu
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set (generate one) of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20050114298A1 CLAIM 11 . The method of claim 10 , wherein reordering the one or more one one-dimensional sequences prior to inserting each of the one or more one-dimensional sequences into a trie structure using the non-uniform frequency distribution to generate one (second set) or more new sequences , comprises : (a) adding an offset 2wr to each weight element of the one or more one-dimensional sequences , wherein w is a window size , r is a rank a symbol to generate a new weight ; (b) sorting the each element of the one or more one-dimensional sequences by the new weight ; (c) placing a moving window of size 2wA on the one or more new sequences , wherein A is the total number of the symbols ; and (d) indexing the one or more new sequences in a new window .
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset of the second set (generate one) of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	US20050114298A1 CLAIM 11 . The method of claim 10 , wherein reordering the one or more one one-dimensional sequences prior to inserting each of the one or more one-dimensional sequences into a trie structure using the non-uniform frequency distribution to generate one (second set) or more new sequences , comprises : (a) adding an offset 2wr to each weight element of the one or more one-dimensional sequences , wherein w is a window size , r is a rank a symbol to generate a new weight ; (b) sorting the each element of the one or more one-dimensional sequences by the new weight ; (c) placing a moving window of size 2wA on the one or more new sequences , wherein A is the total number of the symbols ; and (d) indexing the one or more new sequences in a new window .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy (new sequence) level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20050114298A1 CLAIM 10 . The method of claim 9 , further comprising reordering the one or more one one-dimensional sequences prior to inserting each of the one or more one-dimensional sequences into a trie structure using the non-uniform frequency distribution to generate a new sequence (first hierarchy) .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements associated with the first or second set (generate one) of sub-regions from the data stream in a depth-first traversal order .	US20050114298A1 CLAIM 11 . The method of claim 10 , wherein reordering the one or more one one-dimensional sequences prior to inserting each of the one or more one-dimensional sequences into a trie structure using the non-uniform frequency distribution to generate one (second set) or more new sequences , comprises : (a) adding an offset 2wr to each weight element of the one or more one-dimensional sequences , wherein w is a window size , r is a rank a symbol to generate a new weight ; (b) sorting the each element of the one or more one-dimensional sequences by the new weight ; (c) placing a moving window of size 2wA on the one or more new sequences , wherein A is the total number of the symbols ; and (d) indexing the one or more new sequences in a new window .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set (generate one) of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20050114298A1 CLAIM 11 . The method of claim 10 , wherein reordering the one or more one one-dimensional sequences prior to inserting each of the one or more one-dimensional sequences into a trie structure using the non-uniform frequency distribution to generate one (second set) or more new sequences , comprises : (a) adding an offset 2wr to each weight element of the one or more one-dimensional sequences , wherein w is a window size , r is a rank a symbol to generate a new weight ; (b) sorting the each element of the one or more one-dimensional sequences by the new weight ; (c) placing a moving window of size 2wA on the one or more new sequences , wherein A is the total number of the symbols ; and (d) indexing the one or more new sequences in a new window .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set (generate one) of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20050114298A1 CLAIM 11 . The method of claim 10 , wherein reordering the one or more one one-dimensional sequences prior to inserting each of the one or more one-dimensional sequences into a trie structure using the non-uniform frequency distribution to generate one (second set) or more new sequences , comprises : (a) adding an offset 2wr to each weight element of the one or more one-dimensional sequences , wherein w is a window size , r is a rank a symbol to generate a new weight ; (b) sorting the each element of the one or more one-dimensional sequences by the new weight ; (c) placing a moving window of size 2wA on the one or more new sequences , wherein A is the total number of the symbols ; and (d) indexing the one or more new sequences in a new window .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set (generate one) of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20050114298A1 CLAIM 11 . The method of claim 10 , wherein reordering the one or more one one-dimensional sequences prior to inserting each of the one or more one-dimensional sequences into a trie structure using the non-uniform frequency distribution to generate one (second set) or more new sequences , comprises : (a) adding an offset 2wr to each weight element of the one or more one-dimensional sequences , wherein w is a window size , r is a rank a symbol to generate a new weight ; (b) sorting the each element of the one or more one-dimensional sequences by the new weight ; (c) placing a moving window of size 2wA on the one or more new sequences , wherein A is the total number of the symbols ; and (d) indexing the one or more new sequences in a new window .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US7254533B1 Filed: 2003-10-17 Issued: 2007-08-07 Method and apparatus for a thin CELP voice codec (Original Assignee) Dilithium Networks Pty Ltd (Current Assignee) Onmobile Global Ltd Marwan A. Jabri, Nicola Chong-White, Jianwei Wang
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding (spectral frequency) and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set (second function) of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US7254533B1 CLAIM 1 . An apparatus for encoding and decoding a voice signal , the apparatus comprising : an encoder configured to generate an output bitstream signal from an input voice signal , the output bitstream signal associated with at least a first standard of a first plurality of CELP voice compression standards ; a decoder configured to generate an output voice signal from an input bitstream signal , the input bitstream signal associated with at least a first standard of a second plurality of CELP voice compression standards ; wherein the CELP encoder comprises : a plurality of codec-specific encoder modules , at least one of the plurality of codec-specific encoder modules including at least a first table , at least a first function or at least a first operation , the first table , the first function or the first operation associated with only a second standard of the first plurality of CELP voice compression standards ; a plurality of generic encoder modules , at least one of the plurality of generic encoder modules including at least a second table , a second function (first set) or a second operation , the second table , the second function or the second operation associated with at least a third standard and a fourth standard of the first plurality of CELP voice compression standards , the third standard and the fourth standard of the first plurality of CELP voice compression standards being different ; wherein the CELP decoder comprises : a plurality of codec-specific decoder modules , at least one of the plurality of codec-specific decoder modules including at least a third table , at least a third function or at least a third operation , the third table , the third function or the third operation associated with only a second standard of the second plurality of CELP voice compression standards ; a plurality of generic decoder modules , at least one of the plurality of generic decoder modules including at least a fourth table , a fourth function or a fourth operation , the fourth table , the fourth function or the fourth operation associated with at least a third standard and a fourth standard of the second plurality of CELP voice compression standards , the third standard and the fourth standard of the second plurality of CELP voice compression standards being different . US7254533B1 CLAIM 25 . The method of claim 24 wherein the linear prediction parameter comprises a line spectral frequency (prediction coding, spatial domain transform coding) .
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set (second function) of sub-regions : compute a prediction signal based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset of the second set of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	US7254533B1 CLAIM 1 . An apparatus for encoding and decoding a voice signal , the apparatus comprising : an encoder configured to generate an output bitstream signal from an input voice signal , the output bitstream signal associated with at least a first standard of a first plurality of CELP voice compression standards ; a decoder configured to generate an output voice signal from an input bitstream signal , the input bitstream signal associated with at least a first standard of a second plurality of CELP voice compression standards ; wherein the CELP encoder comprises : a plurality of codec-specific encoder modules , at least one of the plurality of codec-specific encoder modules including at least a first table , at least a first function or at least a first operation , the first table , the first function or the first operation associated with only a second standard of the first plurality of CELP voice compression standards ; a plurality of generic encoder modules , at least one of the plurality of generic encoder modules including at least a second table , a second function (first set) or a second operation , the second table , the second function or the second operation associated with at least a third standard and a fourth standard of the first plurality of CELP voice compression standards , the third standard and the fourth standard of the first plurality of CELP voice compression standards being different ; wherein the CELP decoder comprises : a plurality of codec-specific decoder modules , at least one of the plurality of codec-specific decoder modules including at least a third table , at least a third function or at least a third operation , the third table , the third function or the third operation associated with only a second standard of the second plurality of CELP voice compression standards ; a plurality of generic decoder modules , at least one of the plurality of generic decoder modules including at least a fourth table , a fourth function or a fourth operation , the fourth table , the fourth function or the fourth operation associated with at least a third standard and a fourth standard of the second plurality of CELP voice compression standards , the third standard and the fourth standard of the second plurality of CELP voice compression standards being different .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set (second function) of root regions such that the first set of root regions are rectangular blocks of a size determined by the first maximum region size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	US7254533B1 CLAIM 1 . An apparatus for encoding and decoding a voice signal , the apparatus comprising : an encoder configured to generate an output bitstream signal from an input voice signal , the output bitstream signal associated with at least a first standard of a first plurality of CELP voice compression standards ; a decoder configured to generate an output voice signal from an input bitstream signal , the input bitstream signal associated with at least a first standard of a second plurality of CELP voice compression standards ; wherein the CELP encoder comprises : a plurality of codec-specific encoder modules , at least one of the plurality of codec-specific encoder modules including at least a first table , at least a first function or at least a first operation , the first table , the first function or the first operation associated with only a second standard of the first plurality of CELP voice compression standards ; a plurality of generic encoder modules , at least one of the plurality of generic encoder modules including at least a second table , a second function (first set) or a second operation , the second table , the second function or the second operation associated with at least a third standard and a fourth standard of the first plurality of CELP voice compression standards , the third standard and the fourth standard of the first plurality of CELP voice compression standards being different ; wherein the CELP decoder comprises : a plurality of codec-specific decoder modules , at least one of the plurality of codec-specific decoder modules including at least a third table , at least a third function or at least a third operation , the third table , the third function or the third operation associated with only a second standard of the second plurality of CELP voice compression standards ; a plurality of generic decoder modules , at least one of the plurality of generic decoder modules including at least a fourth table , a fourth function or a fourth operation , the fourth table , the fourth function or the fourth operation associated with at least a third standard and a fourth standard of the second plurality of CELP voice compression standards , the third standard and the fourth standard of the second plurality of CELP voice compression standards being different .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set (second function) of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US7254533B1 CLAIM 1 . An apparatus for encoding and decoding a voice signal , the apparatus comprising : an encoder configured to generate an output bitstream signal from an input voice signal , the output bitstream signal associated with at least a first standard of a first plurality of CELP voice compression standards ; a decoder configured to generate an output voice signal from an input bitstream signal , the input bitstream signal associated with at least a first standard of a second plurality of CELP voice compression standards ; wherein the CELP encoder comprises : a plurality of codec-specific encoder modules , at least one of the plurality of codec-specific encoder modules including at least a first table , at least a first function or at least a first operation , the first table , the first function or the first operation associated with only a second standard of the first plurality of CELP voice compression standards ; a plurality of generic encoder modules , at least one of the plurality of generic encoder modules including at least a second table , a second function (first set) or a second operation , the second table , the second function or the second operation associated with at least a third standard and a fourth standard of the first plurality of CELP voice compression standards , the third standard and the fourth standard of the first plurality of CELP voice compression standards being different ; wherein the CELP decoder comprises : a plurality of codec-specific decoder modules , at least one of the plurality of codec-specific decoder modules including at least a third table , at least a third function or at least a third operation , the third table , the third function or the third operation associated with only a second standard of the second plurality of CELP voice compression standards ; a plurality of generic decoder modules , at least one of the plurality of generic decoder modules including at least a fourth table , a fourth function or a fourth operation , the fourth table , the fourth function or the fourth operation associated with at least a third standard and a fourth standard of the second plurality of CELP voice compression standards , the third standard and the fourth standard of the second plurality of CELP voice compression standards being different .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision information includes a partition indication flag indicating whether any of the first set (second function) of root regions or the sub-regions at the first or higher-order hierarchy level is sub-divided .	US7254533B1 CLAIM 1 . An apparatus for encoding and decoding a voice signal , the apparatus comprising : an encoder configured to generate an output bitstream signal from an input voice signal , the output bitstream signal associated with at least a first standard of a first plurality of CELP voice compression standards ; a decoder configured to generate an output voice signal from an input bitstream signal , the input bitstream signal associated with at least a first standard of a second plurality of CELP voice compression standards ; wherein the CELP encoder comprises : a plurality of codec-specific encoder modules , at least one of the plurality of codec-specific encoder modules including at least a first table , at least a first function or at least a first operation , the first table , the first function or the first operation associated with only a second standard of the first plurality of CELP voice compression standards ; a plurality of generic encoder modules , at least one of the plurality of generic encoder modules including at least a second table , a second function (first set) or a second operation , the second table , the second function or the second operation associated with at least a third standard and a fourth standard of the first plurality of CELP voice compression standards , the third standard and the fourth standard of the first plurality of CELP voice compression standards being different ; wherein the CELP decoder comprises : a plurality of codec-specific decoder modules , at least one of the plurality of codec-specific decoder modules including at least a third table , at least a third function or at least a third operation , the third table , the third function or the third operation associated with only a second standard of the second plurality of CELP voice compression standards ; a plurality of generic decoder modules , at least one of the plurality of generic decoder modules including at least a fourth table , a fourth function or a fourth operation , the fourth table , the fourth function or the fourth operation associated with at least a third standard and a fourth standard of the second plurality of CELP voice compression standards , the third standard and the fourth standard of the second plurality of CELP voice compression standards being different .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set (second function) of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US7254533B1 CLAIM 1 . An apparatus for encoding and decoding a voice signal , the apparatus comprising : an encoder configured to generate an output bitstream signal from an input voice signal , the output bitstream signal associated with at least a first standard of a first plurality of CELP voice compression standards ; a decoder configured to generate an output voice signal from an input bitstream signal , the input bitstream signal associated with at least a first standard of a second plurality of CELP voice compression standards ; wherein the CELP encoder comprises : a plurality of codec-specific encoder modules , at least one of the plurality of codec-specific encoder modules including at least a first table , at least a first function or at least a first operation , the first table , the first function or the first operation associated with only a second standard of the first plurality of CELP voice compression standards ; a plurality of generic encoder modules , at least one of the plurality of generic encoder modules including at least a second table , a second function (first set) or a second operation , the second table , the second function or the second operation associated with at least a third standard and a fourth standard of the first plurality of CELP voice compression standards , the third standard and the fourth standard of the first plurality of CELP voice compression standards being different ; wherein the CELP decoder comprises : a plurality of codec-specific decoder modules , at least one of the plurality of codec-specific decoder modules including at least a third table , at least a third function or at least a third operation , the third table , the third function or the third operation associated with only a second standard of the second plurality of CELP voice compression standards ; a plurality of generic decoder modules , at least one of the plurality of generic decoder modules including at least a fourth table , a fourth function or a fourth operation , the fourth table , the fourth function or the fourth operation associated with at least a third standard and a fourth standard of the second plurality of CELP voice compression standards , the third standard and the fourth standard of the second plurality of CELP voice compression standards being different .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding (spectral frequency) and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set (second function) of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US7254533B1 CLAIM 1 . An apparatus for encoding and decoding a voice signal , the apparatus comprising : an encoder configured to generate an output bitstream signal from an input voice signal , the output bitstream signal associated with at least a first standard of a first plurality of CELP voice compression standards ; a decoder configured to generate an output voice signal from an input bitstream signal , the input bitstream signal associated with at least a first standard of a second plurality of CELP voice compression standards ; wherein the CELP encoder comprises : a plurality of codec-specific encoder modules , at least one of the plurality of codec-specific encoder modules including at least a first table , at least a first function or at least a first operation , the first table , the first function or the first operation associated with only a second standard of the first plurality of CELP voice compression standards ; a plurality of generic encoder modules , at least one of the plurality of generic encoder modules including at least a second table , a second function (first set) or a second operation , the second table , the second function or the second operation associated with at least a third standard and a fourth standard of the first plurality of CELP voice compression standards , the third standard and the fourth standard of the first plurality of CELP voice compression standards being different ; wherein the CELP decoder comprises : a plurality of codec-specific decoder modules , at least one of the plurality of codec-specific decoder modules including at least a third table , at least a third function or at least a third operation , the third table , the third function or the third operation associated with only a second standard of the second plurality of CELP voice compression standards ; a plurality of generic decoder modules , at least one of the plurality of generic decoder modules including at least a fourth table , a fourth function or a fourth operation , the fourth table , the fourth function or the fourth operation associated with at least a third standard and a fourth standard of the second plurality of CELP voice compression standards , the third standard and the fourth standard of the second plurality of CELP voice compression standards being different . US7254533B1 CLAIM 25 . The method of claim 24 wherein the linear prediction parameter comprises a line spectral frequency (prediction coding, spatial domain transform coding) .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set (second function) of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding (spectral frequency) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US7254533B1 CLAIM 1 . An apparatus for encoding and decoding a voice signal , the apparatus comprising : an encoder configured to generate an output bitstream signal from an input voice signal , the output bitstream signal associated with at least a first standard of a first plurality of CELP voice compression standards ; a decoder configured to generate an output voice signal from an input bitstream signal , the input bitstream signal associated with at least a first standard of a second plurality of CELP voice compression standards ; wherein the CELP encoder comprises : a plurality of codec-specific encoder modules , at least one of the plurality of codec-specific encoder modules including at least a first table , at least a first function or at least a first operation , the first table , the first function or the first operation associated with only a second standard of the first plurality of CELP voice compression standards ; a plurality of generic encoder modules , at least one of the plurality of generic encoder modules including at least a second table , a second function (first set) or a second operation , the second table , the second function or the second operation associated with at least a third standard and a fourth standard of the first plurality of CELP voice compression standards , the third standard and the fourth standard of the first plurality of CELP voice compression standards being different ; wherein the CELP decoder comprises : a plurality of codec-specific decoder modules , at least one of the plurality of codec-specific decoder modules including at least a third table , at least a third function or at least a third operation , the third table , the third function or the third operation associated with only a second standard of the second plurality of CELP voice compression standards ; a plurality of generic decoder modules , at least one of the plurality of generic decoder modules including at least a fourth table , a fourth function or a fourth operation , the fourth table , the fourth function or the fourth operation associated with at least a third standard and a fourth standard of the second plurality of CELP voice compression standards , the third standard and the fourth standard of the second plurality of CELP voice compression standards being different . US7254533B1 CLAIM 25 . The method of claim 24 wherein the linear prediction parameter comprises a line spectral frequency (prediction coding, spatial domain transform coding) .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set (second function) of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding (spectral frequency) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US7254533B1 CLAIM 1 . An apparatus for encoding and decoding a voice signal , the apparatus comprising : an encoder configured to generate an output bitstream signal from an input voice signal , the output bitstream signal associated with at least a first standard of a first plurality of CELP voice compression standards ; a decoder configured to generate an output voice signal from an input bitstream signal , the input bitstream signal associated with at least a first standard of a second plurality of CELP voice compression standards ; wherein the CELP encoder comprises : a plurality of codec-specific encoder modules , at least one of the plurality of codec-specific encoder modules including at least a first table , at least a first function or at least a first operation , the first table , the first function or the first operation associated with only a second standard of the first plurality of CELP voice compression standards ; a plurality of generic encoder modules , at least one of the plurality of generic encoder modules including at least a second table , a second function (first set) or a second operation , the second table , the second function or the second operation associated with at least a third standard and a fourth standard of the first plurality of CELP voice compression standards , the third standard and the fourth standard of the first plurality of CELP voice compression standards being different ; wherein the CELP decoder comprises : a plurality of codec-specific decoder modules , at least one of the plurality of codec-specific decoder modules including at least a third table , at least a third function or at least a third operation , the third table , the third function or the third operation associated with only a second standard of the second plurality of CELP voice compression standards ; a plurality of generic decoder modules , at least one of the plurality of generic decoder modules including at least a fourth table , a fourth function or a fourth operation , the fourth table , the fourth function or the fourth operation associated with at least a third standard and a fourth standard of the second plurality of CELP voice compression standards , the third standard and the fourth standard of the second plurality of CELP voice compression standards being different . US7254533B1 CLAIM 25 . The method of claim 24 wherein the linear prediction parameter comprises a line spectral frequency (prediction coding, spatial domain transform coding) .
US10250913B2 CLAIM 15 . A non-transitory computer readable digital storage medium having stored thereon a computer program having a program code (program code) for performing , when running on a computer , a method according to claim 12 .	US7254533B1 CLAIM 7 . The apparatus of claim 6 wherein the first common functions library , the first common math operations library and the first common tables library are associated with at least the third standard and the fourth standard of the first plurality of CELP voice compression standards and configured to substantially remove all duplications between a first program code (program code) associated with the third standard of the first plurality of CELP voice compression standards and a second program code associated with the fourth standard of the first plurality of CELP voice compression standards .
US10250913B2 CLAIM 16 . A non-transitory computer readable digital storage medium having stored thereon a computer program having a program code (program code) for performing , when running on a computer , a method according to claim 14 .	US7254533B1 CLAIM 7 . The apparatus of claim 6 wherein the first common functions library , the first common math operations library and the first common tables library are associated with at least the third standard and the fourth standard of the first plurality of CELP voice compression standards and configured to substantially remove all duplications between a first program code (program code) associated with the third standard of the first plurality of CELP voice compression standards and a second program code associated with the fourth standard of the first plurality of CELP voice compression standards .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	JP2004129260A Filed: 2003-09-30 Issued: 2004-04-22 色相の空間予測符号化を利用した映像の符号化及び復号化方法及び装置 (Original Assignee) Samsung Electronics Co Ltd; 三星電子株式会社 Chang-Yeong Kim, Woo-Shik Kim, Yang-Seock Seo, 徐　亮錫, 金　▲祐▼▲滉▼, 金　昌容
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information (選択部) , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	JP2004129260A CLAIM 44 　入力映像の色相成分を所定サイズに分割したブロックのうち予測符号化を行う現在ブロックを所定数の予測方法によって所定数の領域に分割し、前記分割された現在ブロックに隣接した上位参照ブロック及び側面参照ブロックの画素値を利用してそれぞれの予測方法に対応する予測値を生成する混合予測部と、　前記現在ブロックの入力画素値と前記各予測方法による前記予測値の間の差分値を生成する差分値生成部と、　前記差分値のうち符号化に必要なビット数が最小になる差分値を選択する選択部 (video information) と、　前記選択された差分値及び前記選択された差分値に対応する予測方法に関する情報を所定の符号化方法によって符号化する符号化部と、を含むことを特徴とする符号化装置。
US10250913B2 CLAIM 5 . The decoder according to claim 4 , wherein the divider is configured to , in accordance with the partition rules associated with the first and higher-order hierarchy levels , sub-divide into sub-regions of equal size (所定サイズ) , such that there are an equal number of sub-regions at each hierarchy level .	JP2004129260A CLAIM 1 　（ａ）入力映像の色相成分を示す画素を所定サイズ (equal size) のブロックに分割する段階と、　（ｂ）前記ブロックのうち予測符号化を行う現在ブロックに隣接した上位参照ブロック及び側面参照ブロックの画素値を利用し、現在ブロックに対する水平及び垂直方向の画素値の変化量を生成する段階と、　（ｃ）前記変化量によって現在ブロックを所定数の領域に分割し、分割された各領域の各画素値の予測値を前記上位参照ブロックまたは前記側面参照ブロックの画素値を利用して生成する段階と、　（ｄ）前記現在ブロックの入力画素値と前記予測値との差分値を生成し、前記差分値を所定の符号化方法によって符号化する段階と、を含むことを特徴とする符号化方法。
US10250913B2 CLAIM 11 . The decoder according to claim 1 , wherein the recursive multi-tree partitioning includes a quadtree partitioning (前記予測モード) technique .	JP2004129260A CLAIM 21 　映像の色相成分が符号化されたビットストリームを入力されて映像を復元する復号化方法であって、　（ａ）前記ビットストリームで読出された符号化情報に対応する所定の復号化方法によって、前記ビットストリームに含まれた色相成分に対する差分値をブロック単位に復号化する段階と、　（ｂ）前記ビットストリームに予測方法についての情報である予測モードが含まれているか否かを調べ、前記ビットストリームから予測モードを抽出して、抽出された予測モードに基づいて予測方法を決定する段階と、　（ｃ）前記ビットストリームに前記予測モード (quadtree partitioning, quadtree partitioning technique) が含まれていない場合に、現在復元されるブロック以前に復元された上位参照ブロック及び側面参照ブロックを利用し、現在ブロックに対する画素値の垂直及び水平方向の変化量を計算して前記垂直及び水平方向の変化量によって予測方法を決定する段階と、　（ｄ）前記（ｂ）段階または前記（ｃ）段階で決定された予測方法によって現在ブロックの画素に対する予測値を生成する段階と、　（ｅ）前記予測値と前記差分値とを合算して映像の色相成分を復元する段階と、を含むことを特徴とする復号化方法。
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information (選択部) , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	JP2004129260A CLAIM 44 　入力映像の色相成分を所定サイズに分割したブロックのうち予測符号化を行う現在ブロックを所定数の予測方法によって所定数の領域に分割し、前記分割された現在ブロックに隣接した上位参照ブロック及び側面参照ブロックの画素値を利用してそれぞれの予測方法に対応する予測値を生成する混合予測部と、　前記現在ブロックの入力画素値と前記各予測方法による前記予測値の間の差分値を生成する差分値生成部と、　前記差分値のうち符号化に必要なビット数が最小になる差分値を選択する選択部 (video information) と、　前記選択された差分値及び前記選択された差分値に対応する予測方法に関する情報を所定の符号化方法によって符号化する符号化部と、を含むことを特徴とする符号化装置。
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information (選択部) into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	JP2004129260A CLAIM 44 　入力映像の色相成分を所定サイズに分割したブロックのうち予測符号化を行う現在ブロックを所定数の予測方法によって所定数の領域に分割し、前記分割された現在ブロックに隣接した上位参照ブロック及び側面参照ブロックの画素値を利用してそれぞれの予測方法に対応する予測値を生成する混合予測部と、　前記現在ブロックの入力画素値と前記各予測方法による前記予測値の間の差分値を生成する差分値生成部と、　前記差分値のうち符号化に必要なビット数が最小になる差分値を選択する選択部 (video information) と、　前記選択された差分値及び前記選択された差分値に対応する予測方法に関する情報を所定の符号化方法によって符号化する符号化部と、を含むことを特徴とする符号化装置。
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information (選択部) into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	JP2004129260A CLAIM 44 　入力映像の色相成分を所定サイズに分割したブロックのうち予測符号化を行う現在ブロックを所定数の予測方法によって所定数の領域に分割し、前記分割された現在ブロックに隣接した上位参照ブロック及び側面参照ブロックの画素値を利用してそれぞれの予測方法に対応する予測値を生成する混合予測部と、　前記現在ブロックの入力画素値と前記各予測方法による前記予測値の間の差分値を生成する差分値生成部と、　前記差分値のうち符号化に必要なビット数が最小になる差分値を選択する選択部 (video information) と、　前記選択された差分値及び前記選択された差分値に対応する予測方法に関する情報を所定の符号化方法によって符号化する符号化部と、を含むことを特徴とする符号化装置。
US10250913B2 CLAIM 15 . A non-transitory computer readable digital storage medium having stored thereon a computer program having a program code (計算部) for performing , when running on a computer , a method according to claim 12 .	JP2004129260A CLAIM 34 　入力映像の色相成分が所定サイズに分割されたブロックのうち予測符号化を行う現在ブロックに隣接した上位参照ブロック及び側面参照ブロックの画素値を利用し、現在ブロックに対する水平及び垂直方向の画素値の変化量を計算する変化量計算部 (program code) と、　前記変化量によって現在ブロックを所定数の領域に分割し、分割された各領域の画素値の予測値を前記上位参照ブロックまたは前記側面参照ブロックの画素値を利用して生成する混合予測部と、　前記現在ブロックの入力画素値と前記予測値との差分値を生成し、前記差分値を所定の符号化方法によって符号化する差分値生成部と、を含むことを特徴とする符号化装置。
US10250913B2 CLAIM 16 . A non-transitory computer readable digital storage medium having stored thereon a computer program having a program code (計算部) for performing , when running on a computer , a method according to claim 14 .	JP2004129260A CLAIM 34 　入力映像の色相成分が所定サイズに分割されたブロックのうち予測符号化を行う現在ブロックに隣接した上位参照ブロック及び側面参照ブロックの画素値を利用し、現在ブロックに対する水平及び垂直方向の画素値の変化量を計算する変化量計算部 (program code) と、　前記変化量によって現在ブロックを所定数の領域に分割し、分割された各領域の画素値の予測値を前記上位参照ブロックまたは前記側面参照ブロックの画素値を利用して生成する混合予測部と、　前記現在ブロックの入力画素値と前記予測値との差分値を生成し、前記差分値を所定の符号化方法によって符号化する差分値生成部と、を含むことを特徴とする符号化装置。

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20040062445A1 Filed: 2003-09-30 Issued: 2004-04-01 Image coding method and apparatus using spatial predictive coding of chrominance and image decoding method and apparatus (Original Assignee) Samsung Electronics Co Ltd (Current Assignee) Samsung Electronics Co Ltd Woo-shik Kim, Chang-yeong Kim, Yang-seock Seo
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (determined size) information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding (respective prediction) ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20040062445A1 CLAIM 1 . A coding method comprising : (a) dividing pixels-of a chrominance component of an input image into blocks having a predetermined size (second subdivision, second subset, second subdivision information) ; (b) generating a vertical variation and a horizontal variation with respect to a current block to be predictively coded , using pixel values in an upper reference block adjacent to the current block and pixel values in a side reference block adjacent to the current block ; (c) dividing the current block into a predetermined number of regions according to the vertical and horizontal variations and generating a prediction value of each pixel in each region using a pixel value in the upper reference block or a pixel value in the side reference block ; and (d) generating a differential value between the prediction value and a corresponding real pixel value in the current block and coding the differential value using a predetermined coding method . US20040062445A1 CLAIM 11 . A coding method comprising : (a) dividing pixels of a chrominance component of an input image into blocks having a predetermined size ; (b) dividing a current block to be predictively coded into a predetermined number of regions according to a predetermined number of prediction methods and generating prediction values of each pixel in the current block according to the respective prediction (transform coding) methods using a pixel value in an upper reference block adjacent to the current block and a pixel value in a side reference block adjacent to the current block ; (c) generating differential values between the prediction values corresponding to the respective prediction methods and a corresponding real pixel value in the current block ; and (d) selecting a differential value requiring a least number of bits for coding among the differential values and coding the selected differential value and information on a prediction method corresponding to the selected differential value using a predetermined coding method .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset (determined size) of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20040062445A1 CLAIM 1 . A coding method comprising : (a) dividing pixels-of a chrominance component of an input image into blocks having a predetermined size (second subdivision, second subset, second subdivision information) ; (b) generating a vertical variation and a horizontal variation with respect to a current block to be predictively coded , using pixel values in an upper reference block adjacent to the current block and pixel values in a side reference block adjacent to the current block ; (c) dividing the current block into a predetermined number of regions according to the vertical and horizontal variations and generating a prediction value of each pixel in each region using a pixel value in the upper reference block or a pixel value in the side reference block ; and (d) generating a differential value between the prediction value and a corresponding real pixel value in the current block and coding the differential value using a predetermined coding method .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding (respective prediction) to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	US20040062445A1 CLAIM 11 . A coding method comprising : (a) dividing pixels of a chrominance component of an input image into blocks having a predetermined size ; (b) dividing a current block to be predictively coded into a predetermined number of regions according to a predetermined number of prediction methods and generating prediction values of each pixel in the current block according to the respective prediction (transform coding) methods using a pixel value in an upper reference block adjacent to the current block and a pixel value in a side reference block adjacent to the current block ; (c) generating differential values between the prediction values corresponding to the respective prediction methods and a corresponding real pixel value in the current block ; and (d) selecting a differential value requiring a least number of bits for coding among the differential values and coding the selected differential value and information on a prediction method corresponding to the selected differential value using a predetermined coding method .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (determined size) information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding (respective prediction) ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20040062445A1 CLAIM 1 . A coding method comprising : (a) dividing pixels-of a chrominance component of an input image into blocks having a predetermined size (second subdivision, second subset, second subdivision information) ; (b) generating a vertical variation and a horizontal variation with respect to a current block to be predictively coded , using pixel values in an upper reference block adjacent to the current block and pixel values in a side reference block adjacent to the current block ; (c) dividing the current block into a predetermined number of regions according to the vertical and horizontal variations and generating a prediction value of each pixel in each region using a pixel value in the upper reference block or a pixel value in the side reference block ; and (d) generating a differential value between the prediction value and a corresponding real pixel value in the current block and coding the differential value using a predetermined coding method . US20040062445A1 CLAIM 11 . A coding method comprising : (a) dividing pixels of a chrominance component of an input image into blocks having a predetermined size ; (b) dividing a current block to be predictively coded into a predetermined number of regions according to a predetermined number of prediction methods and generating prediction values of each pixel in the current block according to the respective prediction (transform coding) methods using a pixel value in an upper reference block adjacent to the current block and a pixel value in a side reference block adjacent to the current block ; (c) generating differential values between the prediction values corresponding to the respective prediction methods and a corresponding real pixel value in the current block ; and (d) selecting a differential value requiring a least number of bits for coding among the differential values and coding the selected differential value and information on a prediction method corresponding to the selected differential value using a predetermined coding method .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (determined size) information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding (respective prediction) in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20040062445A1 CLAIM 1 . A coding method comprising : (a) dividing pixels-of a chrominance component of an input image into blocks having a predetermined size (second subdivision, second subset, second subdivision information) ; (b) generating a vertical variation and a horizontal variation with respect to a current block to be predictively coded , using pixel values in an upper reference block adjacent to the current block and pixel values in a side reference block adjacent to the current block ; (c) dividing the current block into a predetermined number of regions according to the vertical and horizontal variations and generating a prediction value of each pixel in each region using a pixel value in the upper reference block or a pixel value in the side reference block ; and (d) generating a differential value between the prediction value and a corresponding real pixel value in the current block and coding the differential value using a predetermined coding method . US20040062445A1 CLAIM 11 . A coding method comprising : (a) dividing pixels of a chrominance component of an input image into blocks having a predetermined size ; (b) dividing a current block to be predictively coded into a predetermined number of regions according to a predetermined number of prediction methods and generating prediction values of each pixel in the current block according to the respective prediction (transform coding) methods using a pixel value in an upper reference block adjacent to the current block and a pixel value in a side reference block adjacent to the current block ; (c) generating differential values between the prediction values corresponding to the respective prediction methods and a corresponding real pixel value in the current block ; and (d) selecting a differential value requiring a least number of bits for coding among the differential values and coding the selected differential value and information on a prediction method corresponding to the selected differential value using a predetermined coding method .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (determined size) information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding (respective prediction) in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20040062445A1 CLAIM 1 . A coding method comprising : (a) dividing pixels-of a chrominance component of an input image into blocks having a predetermined size (second subdivision, second subset, second subdivision information) ; (b) generating a vertical variation and a horizontal variation with respect to a current block to be predictively coded , using pixel values in an upper reference block adjacent to the current block and pixel values in a side reference block adjacent to the current block ; (c) dividing the current block into a predetermined number of regions according to the vertical and horizontal variations and generating a prediction value of each pixel in each region using a pixel value in the upper reference block or a pixel value in the side reference block ; and (d) generating a differential value between the prediction value and a corresponding real pixel value in the current block and coding the differential value using a predetermined coding method . US20040062445A1 CLAIM 11 . A coding method comprising : (a) dividing pixels of a chrominance component of an input image into blocks having a predetermined size ; (b) dividing a current block to be predictively coded into a predetermined number of regions according to a predetermined number of prediction methods and generating prediction values of each pixel in the current block according to the respective prediction (transform coding) methods using a pixel value in an upper reference block adjacent to the current block and a pixel value in a side reference block adjacent to the current block ; (c) generating differential values between the prediction values corresponding to the respective prediction methods and a corresponding real pixel value in the current block ; and (d) selecting a differential value requiring a least number of bits for coding among the differential values and coding the selected differential value and information on a prediction method corresponding to the selected differential value using a predetermined coding method .
US10250913B2 CLAIM 15 . A non-transitory computer readable digital storage medium having stored thereon a computer program having a program code (program code) for performing , when running on a computer , a method according to claim 12 .	US20040062445A1 CLAIM 30 . A recording medium for storing a program code (program code) for executing the coding method of claim 1 in a computer , the program code being able to be read in the computer .
US10250913B2 CLAIM 16 . A non-transitory computer readable digital storage medium having stored thereon a computer program having a program code (program code) for performing , when running on a computer , a method according to claim 14 .	US20040062445A1 CLAIM 30 . A recording medium for storing a program code (program code) for executing the coding method of claim 1 in a computer , the program code being able to be read in the computer .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	CN1637782A Filed: 2003-09-08 Issued: 2005-07-13 基于小波变换的预测四叉树图像压缩及解压方法 (Original Assignee) 中国人民解放军第一军医大学冯前进, 陈武凡
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level (一比特) (一比特) wherein the first maximum region size and the first subdivision information (动态的) are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN1637782A CLAIM 1 . 一种基于小波变换的预测四叉树图像压缩方法，其特征在于：首先对图像进行小波变换，然后对小波系数进行分块编码，采用四叉树分割算法，动态的 (first subdivision information) 调整编码块的大小，充分利用了带内小波系数间的相关性，同时在编码的过程中加入了预测过程，用上一比特 (maximum hierarchy level, first hierarchy level, hierarchy level) 平面的重要系数在当前比特面对其邻域和子节点系数进行预测，将上一比特平面的重要系数的邻域和子节点系数从块中取出，单独编码，从而实现对块的裁剪，以使块的形状更符合实际的情况；最后熵编码采用的了基于上下文的算术编码。
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information (动态的) indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level (一比特) (一比特) according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level (一比特) is reached .	CN1637782A CLAIM 1 . 一种基于小波变换的预测四叉树图像压缩方法，其特征在于：首先对图像进行小波变换，然后对小波系数进行分块编码，采用四叉树分割算法，动态的 (first subdivision information) 调整编码块的大小，充分利用了带内小波系数间的相关性，同时在编码的过程中加入了预测过程，用上一比特 (maximum hierarchy level, first hierarchy level, hierarchy level) 平面的重要系数在当前比特面对其邻域和子节点系数进行预测，将上一比特平面的重要系数的邻域和子节点系数从块中取出，单独编码，从而实现对块的裁剪，以使块的形状更符合实际的情况；最后熵编码采用的了基于上下文的算术编码。
US10250913B2 CLAIM 5 . The decoder according to claim 4 , wherein the divider is configured to , in accordance with the partition rules associated with the first and higher-order hierarchy levels , sub-divide into sub-regions of equal size , such that there are an equal number of sub-regions at each hierarchy level (一比特) .	CN1637782A CLAIM 1 . 一种基于小波变换的预测四叉树图像压缩方法，其特征在于：首先对图像进行小波变换，然后对小波系数进行分块编码，采用四叉树分割算法，动态的调整编码块的大小，充分利用了带内小波系数间的相关性，同时在编码的过程中加入了预测过程，用上一比特 (maximum hierarchy level, first hierarchy level, hierarchy level) 平面的重要系数在当前比特面对其邻域和子节点系数进行预测，将上一比特平面的重要系数的邻域和子节点系数从块中取出，单独编码，从而实现对块的裁剪，以使块的形状更符合实际的情况；最后熵编码采用的了基于上下文的算术编码。
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision information (动态的) includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level (一比特) is sub-divided .	CN1637782A CLAIM 1 . 一种基于小波变换的预测四叉树图像压缩方法，其特征在于：首先对图像进行小波变换，然后对小波系数进行分块编码，采用四叉树分割算法，动态的 (first subdivision information) 调整编码块的大小，充分利用了带内小波系数间的相关性，同时在编码的过程中加入了预测过程，用上一比特 (maximum hierarchy level, first hierarchy level, hierarchy level) 平面的重要系数在当前比特面对其邻域和子节点系数进行预测，将上一比特平面的重要系数的邻域和子节点系数从块中取出，单独编码，从而实现对块的裁剪，以使块的形状更符合实际的情况；最后熵编码采用的了基于上下文的算术编码。
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level (一比特) (一比特) from the data stream .	CN1637782A CLAIM 1 . 一种基于小波变换的预测四叉树图像压缩方法，其特征在于：首先对图像进行小波变换，然后对小波系数进行分块编码，采用四叉树分割算法，动态的调整编码块的大小，充分利用了带内小波系数间的相关性，同时在编码的过程中加入了预测过程，用上一比特 (maximum hierarchy level, first hierarchy level, hierarchy level) 平面的重要系数在当前比特面对其邻域和子节点系数进行预测，将上一比特平面的重要系数的邻域和子节点系数从块中取出，单独编码，从而实现对块的裁剪，以使块的形状更符合实际的情况；最后熵编码采用的了基于上下文的算术编码。
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision information (动态的) , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	CN1637782A CLAIM 1 . 一种基于小波变换的预测四叉树图像压缩方法，其特征在于：首先对图像进行小波变换，然后对小波系数进行分块编码，采用四叉树分割算法，动态的 (first subdivision information) 调整编码块的大小，充分利用了带内小波系数间的相关性，同时在编码的过程中加入了预测过程，用上一比特平面的重要系数在当前比特面对其邻域和子节点系数进行预测，将上一比特平面的重要系数的邻域和子节点系数从块中取出，单独编码，从而实现对块的裁剪，以使块的形状更符合实际的情况；最后熵编码采用的了基于上下文的算术编码。
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level (一比特) (一比特) , wherein the first maximum region size and the first subdivision information (动态的) are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN1637782A CLAIM 1 . 一种基于小波变换的预测四叉树图像压缩方法，其特征在于：首先对图像进行小波变换，然后对小波系数进行分块编码，采用四叉树分割算法，动态的 (first subdivision information) 调整编码块的大小，充分利用了带内小波系数间的相关性，同时在编码的过程中加入了预测过程，用上一比特 (maximum hierarchy level, first hierarchy level, hierarchy level) 平面的重要系数在当前比特面对其邻域和子节点系数进行预测，将上一比特平面的重要系数的邻域和子节点系数从块中取出，单独编码，从而实现对块的裁剪，以使块的形状更符合实际的情况；最后熵编码采用的了基于上下文的算术编码。
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information (动态的) , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level (一比特) (一比特) ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN1637782A CLAIM 1 . 一种基于小波变换的预测四叉树图像压缩方法，其特征在于：首先对图像进行小波变换，然后对小波系数进行分块编码，采用四叉树分割算法，动态的 (first subdivision information) 调整编码块的大小，充分利用了带内小波系数间的相关性，同时在编码的过程中加入了预测过程，用上一比特 (maximum hierarchy level, first hierarchy level, hierarchy level) 平面的重要系数在当前比特面对其邻域和子节点系数进行预测，将上一比特平面的重要系数的邻域和子节点系数从块中取出，单独编码，从而实现对块的裁剪，以使块的形状更符合实际的情况；最后熵编码采用的了基于上下文的算术编码。
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information (动态的) ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level (一比特) (一比特) ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN1637782A CLAIM 1 . 一种基于小波变换的预测四叉树图像压缩方法，其特征在于：首先对图像进行小波变换，然后对小波系数进行分块编码，采用四叉树分割算法，动态的 (first subdivision information) 调整编码块的大小，充分利用了带内小波系数间的相关性，同时在编码的过程中加入了预测过程，用上一比特 (maximum hierarchy level, first hierarchy level, hierarchy level) 平面的重要系数在当前比特面对其邻域和子节点系数进行预测，将上一比特平面的重要系数的邻域和子节点系数从块中取出，单独编码，从而实现对块的裁剪，以使块的形状更符合实际的情况；最后熵编码采用的了基于上下文的算术编码。

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	CN1672177A Filed: 2003-07-30 Issued: 2005-09-21 数据压缩和解压缩中的参数选择 (Original Assignee) 高通股份有限公司 S·戈文达斯瓦米, J·A·莱温, J·拉罗卡
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region (种方法) sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root (中的一个) region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN1672177A CLAIM 10 . 一种方法 (second maximum region) ，包括：可变长度地解码压缩的信息以生成可变长度解码的数据块；基于块大小分配信息和所述数据块中的数据地址来选择量化参数；以及使用所选择的量化参数来反量化所述可变长度解码的数据块。 CN1672177A CLAIM 18 . 根据权利要求14或权利要求15至17中的任何一个的装置，其中，用于选择所述量化参数的装置选择Q-步骤和频率加权掩码表中的一个 (respective root) 或者二者。
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision information includes a partition indication flag (一个所) indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level is sub-divided .	CN1672177A CLAIM 23 . 一种装置，包括：放映机，被配置成能显示解压缩的图像信息；声音系统，被配置成能播放解压缩的音频信息；被耦合到至少一个所 (partition indication flag) 述放映机的解码器，所述解码器包括：被耦合到所述放映机的图像解压缩器，所述图像解压缩器被配置成能基于块大小分配信息和数据块中的数据地址将压缩的图像信息解压缩为解压缩的图像信息；以及被耦合到所述声音系统的音频解压缩器，所述音频解压缩器被配置成能将压缩的音频信息解压缩为所述解压缩的音频信息。
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision (的一个作为) of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	CN1672177A CLAIM 36 . 根据权利要求35的方法，其中，确定所述变量值包括：确定所述变量值的第一值作为所述块大小分配信息的所述第一比特；如果所述块大小分配信息包括第二比特，则基于所述Y坐标和X坐标来选择所述块大小分配信息的所述第二比特中的一个作为 (intermediate subdivision) 所述变量值的第二值，否则选择缺省值作为所述变量值的所述第二值；以及如果所述块大小分配信息包括第三比特，则基于所述Y坐标和X坐标来选择所述块大小分配信息的所述第三比特中的一个作为所述变量值的第三值，否则选择缺省值作为所述变量值的所述第三值。
US10250913B2 CLAIM 11 . The decoder according to claim 1 , wherein the recursive multi-tree partitioning includes a quadtree partitioning technique (参数选择) .	CN1672177A CLAIM 3 . 根据权利要求2的装置，其中，所述反量化模块包括参数选择 (quadtree partitioning technique) 模块，所述参数选择模块被配置成能选择所述量化参数。
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region (种方法) sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root (中的一个) region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN1672177A CLAIM 10 . 一种方法 (second maximum region) ，包括：可变长度地解码压缩的信息以生成可变长度解码的数据块；基于块大小分配信息和所述数据块中的数据地址来选择量化参数；以及使用所选择的量化参数来反量化所述可变长度解码的数据块。 CN1672177A CLAIM 18 . 根据权利要求14或权利要求15至17中的任何一个的装置，其中，用于选择所述量化参数的装置选择Q-步骤和频率加权掩码表中的一个 (respective root) 或者二者。
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region (种方法) size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root (中的一个) region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN1672177A CLAIM 10 . 一种方法 (second maximum region) ，包括：可变长度地解码压缩的信息以生成可变长度解码的数据块；基于块大小分配信息和所述数据块中的数据地址来选择量化参数；以及使用所选择的量化参数来反量化所述可变长度解码的数据块。 CN1672177A CLAIM 18 . 根据权利要求14或权利要求15至17中的任何一个的装置，其中，用于选择所述量化参数的装置选择Q-步骤和频率加权掩码表中的一个 (respective root) 或者二者。
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region (种方法) size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root (中的一个) region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN1672177A CLAIM 10 . 一种方法 (second maximum region) ，包括：可变长度地解码压缩的信息以生成可变长度解码的数据块；基于块大小分配信息和所述数据块中的数据地址来选择量化参数；以及使用所选择的量化参数来反量化所述可变长度解码的数据块。 CN1672177A CLAIM 18 . 根据权利要求14或权利要求15至17中的任何一个的装置，其中，用于选择所述量化参数的装置选择Q-步骤和频率加权掩码表中的一个 (respective root) 或者二者。

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20050013376A1 Filed: 2003-07-18 Issued: 2005-01-20 Intra 4 x 4 modes 3, 7 and 8 availability determination intra estimation and compensation (Original Assignee) LSI Corp (Current Assignee) Avago Technologies General IP Singapore Pte Ltd Doni Dattani, Lowell Winger, Simon Booth
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level (d line) wherein the first maximum region size (d line) and the first subdivision information are associated with prediction coding (prediction modes) and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set (generate one) of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20050013376A1 CLAIM 1 . An apparatus comprising : a first processing circuit configured to generate a plurality of reconstructed samples in response to one or more macroblocks of an input signal ; a second processing circuit configured to determine availability of intra 4×4 prediction modes (intra-prediction mode, prediction coding) for each luma sub-block of a current macroblock in response to available reconstructed samples adjacent to said current macroblock . US20050013376A1 CLAIM 9 . The apparatus according to claim 8 , wherein said second processing circuit further comprises : a control circuit configured to generate one (second set) or more control signals in response to (i) a first group of said reconstructed samples adjacent to a top edge of said luma sub-block being available , (ii) a second group of said reconstructed samples adjacent to a left edge of said luma sub-block being available and (iii) both said first group and said second group of said reconstructed samples being available . US20050013376A1 CLAIM 22 . The method according to claim 21 , further comprising the steps of : providing an indication that a diagonal down-left prediction mode and a vertical-left prediction mode are available in response to said plurality of reconstructed samples in said line (respective partition, maximum hierarchy level, first maximum region size) adjacent to said top edge of said luma sub-block being available ; providing an indication that a horizontal-up prediction mode is available in response to said plurality of reconstructed samples in said line adjacent to said left edge of said luma sub-block being available ; and providing an indication that at least said diagonal down-left prediction mode , said vertical-left prediction mode and said horizontal-up prediction mode are available in response to said plurality of reconstructed samples in said line adjacent to said top edge of said luma sub-block and said line adjacent to said left edge of said luma sub-block being available .
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal based on an intra-prediction mode (prediction modes) associated with the sub-region and reconstructed samples of a neighboring subset of the second set (generate one) of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	US20050013376A1 CLAIM 1 . An apparatus comprising : a first processing circuit configured to generate a plurality of reconstructed samples in response to one or more macroblocks of an input signal ; a second processing circuit configured to determine availability of intra 4×4 prediction modes (intra-prediction mode, prediction coding) for each luma sub-block of a current macroblock in response to available reconstructed samples adjacent to said current macroblock . US20050013376A1 CLAIM 9 . The apparatus according to claim 8 , wherein said second processing circuit further comprises : a control circuit configured to generate one (second set) or more control signals in response to (i) a first group of said reconstructed samples adjacent to a top edge of said luma sub-block being available , (ii) a second group of said reconstructed samples adjacent to a left edge of said luma sub-block being available and (iii) both said first group and said second group of said reconstructed samples being available .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set of root regions such that the first set of root regions are rectangular blocks of a size determined by the first maximum region size (d line) , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	US20050013376A1 CLAIM 22 . The method according to claim 21 , further comprising the steps of : providing an indication that a diagonal down-left prediction mode and a vertical-left prediction mode are available in response to said plurality of reconstructed samples in said line (respective partition, maximum hierarchy level, first maximum region size) adjacent to said top edge of said luma sub-block being available ; providing an indication that a horizontal-up prediction mode is available in response to said plurality of reconstructed samples in said line adjacent to said left edge of said luma sub-block being available ; and providing an indication that at least said diagonal down-left prediction mode , said vertical-left prediction mode and said horizontal-up prediction mode are available in response to said plurality of reconstructed samples in said line adjacent to said top edge of said luma sub-block and said line adjacent to said left edge of said luma sub-block being available .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule (second group) associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition (d line) rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level (d line) is reached .	US20050013376A1 CLAIM 2 . The apparatus according to claim 1 , wherein said second circuit is further configured to indicate availability of an intra 4×4 prediction mode 3 for each of said luma sub-blocks in response to (i) a first group of said reconstructed samples adjacent to a top edge of said luma sub-block being available and (ii) both said first group and a second group (partition rule) of said reconstructed samples adjacent to a left edge of said luma sub-block being available . US20050013376A1 CLAIM 22 . The method according to claim 21 , further comprising the steps of : providing an indication that a diagonal down-left prediction mode and a vertical-left prediction mode are available in response to said plurality of reconstructed samples in said line (respective partition, maximum hierarchy level, first maximum region size) adjacent to said top edge of said luma sub-block being available ; providing an indication that a horizontal-up prediction mode is available in response to said plurality of reconstructed samples in said line adjacent to said left edge of said luma sub-block being available ; and providing an indication that at least said diagonal down-left prediction mode , said vertical-left prediction mode and said horizontal-up prediction mode are available in response to said plurality of reconstructed samples in said line adjacent to said top edge of said luma sub-block and said line adjacent to said left edge of said luma sub-block being available .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level (d line) from the data stream .	US20050013376A1 CLAIM 22 . The method according to claim 21 , further comprising the steps of : providing an indication that a diagonal down-left prediction mode and a vertical-left prediction mode are available in response to said plurality of reconstructed samples in said line (respective partition, maximum hierarchy level, first maximum region size) adjacent to said top edge of said luma sub-block being available ; providing an indication that a horizontal-up prediction mode is available in response to said plurality of reconstructed samples in said line adjacent to said left edge of said luma sub-block being available ; and providing an indication that at least said diagonal down-left prediction mode , said vertical-left prediction mode and said horizontal-up prediction mode are available in response to said plurality of reconstructed samples in said line adjacent to said top edge of said luma sub-block and said line adjacent to said left edge of said luma sub-block being available .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements associated with the first or second set (generate one) of sub-regions from the data stream in a depth-first traversal order .	US20050013376A1 CLAIM 9 . The apparatus according to claim 8 , wherein said second processing circuit further comprises : a control circuit configured to generate one (second set) or more control signals in response to (i) a first group of said reconstructed samples adjacent to a top edge of said luma sub-block being available , (ii) a second group of said reconstructed samples adjacent to a left edge of said luma sub-block being available and (iii) both said first group and said second group of said reconstructed samples being available .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level (d line) , wherein the first maximum region size (d line) and the first subdivision information are associated with prediction coding (prediction modes) and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set (generate one) of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20050013376A1 CLAIM 1 . An apparatus comprising : a first processing circuit configured to generate a plurality of reconstructed samples in response to one or more macroblocks of an input signal ; a second processing circuit configured to determine availability of intra 4×4 prediction modes (intra-prediction mode, prediction coding) for each luma sub-block of a current macroblock in response to available reconstructed samples adjacent to said current macroblock . US20050013376A1 CLAIM 9 . The apparatus according to claim 8 , wherein said second processing circuit further comprises : a control circuit configured to generate one (second set) or more control signals in response to (i) a first group of said reconstructed samples adjacent to a top edge of said luma sub-block being available , (ii) a second group of said reconstructed samples adjacent to a left edge of said luma sub-block being available and (iii) both said first group and said second group of said reconstructed samples being available . US20050013376A1 CLAIM 22 . The method according to claim 21 , further comprising the steps of : providing an indication that a diagonal down-left prediction mode and a vertical-left prediction mode are available in response to said plurality of reconstructed samples in said line (respective partition, maximum hierarchy level, first maximum region size) adjacent to said top edge of said luma sub-block being available ; providing an indication that a horizontal-up prediction mode is available in response to said plurality of reconstructed samples in said line adjacent to said left edge of said luma sub-block being available ; and providing an indication that at least said diagonal down-left prediction mode , said vertical-left prediction mode and said horizontal-up prediction mode are available in response to said plurality of reconstructed samples in said line adjacent to said top edge of said luma sub-block and said line adjacent to said left edge of said luma sub-block being available .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size (d line) , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set (generate one) of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level (d line) ; and a data stream generator configured to : encode the array of information samples using prediction coding (prediction modes) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20050013376A1 CLAIM 1 . An apparatus comprising : a first processing circuit configured to generate a plurality of reconstructed samples in response to one or more macroblocks of an input signal ; a second processing circuit configured to determine availability of intra 4×4 prediction modes (intra-prediction mode, prediction coding) for each luma sub-block of a current macroblock in response to available reconstructed samples adjacent to said current macroblock . US20050013376A1 CLAIM 9 . The apparatus according to claim 8 , wherein said second processing circuit further comprises : a control circuit configured to generate one (second set) or more control signals in response to (i) a first group of said reconstructed samples adjacent to a top edge of said luma sub-block being available , (ii) a second group of said reconstructed samples adjacent to a left edge of said luma sub-block being available and (iii) both said first group and said second group of said reconstructed samples being available . US20050013376A1 CLAIM 22 . The method according to claim 21 , further comprising the steps of : providing an indication that a diagonal down-left prediction mode and a vertical-left prediction mode are available in response to said plurality of reconstructed samples in said line (respective partition, maximum hierarchy level, first maximum region size) adjacent to said top edge of said luma sub-block being available ; providing an indication that a horizontal-up prediction mode is available in response to said plurality of reconstructed samples in said line adjacent to said left edge of said luma sub-block being available ; and providing an indication that at least said diagonal down-left prediction mode , said vertical-left prediction mode and said horizontal-up prediction mode are available in response to said plurality of reconstructed samples in said line adjacent to said top edge of said luma sub-block and said line adjacent to said left edge of said luma sub-block being available .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size (d line) ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set (generate one) of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level (d line) ; encoding the array of information samples using prediction coding (prediction modes) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20050013376A1 CLAIM 1 . An apparatus comprising : a first processing circuit configured to generate a plurality of reconstructed samples in response to one or more macroblocks of an input signal ; a second processing circuit configured to determine availability of intra 4×4 prediction modes (intra-prediction mode, prediction coding) for each luma sub-block of a current macroblock in response to available reconstructed samples adjacent to said current macroblock . US20050013376A1 CLAIM 9 . The apparatus according to claim 8 , wherein said second processing circuit further comprises : a control circuit configured to generate one (second set) or more control signals in response to (i) a first group of said reconstructed samples adjacent to a top edge of said luma sub-block being available , (ii) a second group of said reconstructed samples adjacent to a left edge of said luma sub-block being available and (iii) both said first group and said second group of said reconstructed samples being available . US20050013376A1 CLAIM 22 . The method according to claim 21 , further comprising the steps of : providing an indication that a diagonal down-left prediction mode and a vertical-left prediction mode are available in response to said plurality of reconstructed samples in said line (respective partition, maximum hierarchy level, first maximum region size) adjacent to said top edge of said luma sub-block being available ; providing an indication that a horizontal-up prediction mode is available in response to said plurality of reconstructed samples in said line adjacent to said left edge of said luma sub-block being available ; and providing an indication that at least said diagonal down-left prediction mode , said vertical-left prediction mode and said horizontal-up prediction mode are available in response to said plurality of reconstructed samples in said line adjacent to said top edge of said luma sub-block and said line adjacent to said left edge of said luma sub-block being available .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US7154952B2 Filed: 2003-07-15 Issued: 2006-12-26 Timestamp-independent motion vector prediction for predictive (P) and bidirectionally predictive (B) pictures (Original Assignee) Microsoft Corp (Current Assignee) Microsoft Technology Licensing LLC Alexandros Tourapis, Shipeng Li, Feng Wu, Gary J. Sullivan
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region (weighting function) size and the first subdivision (weighting function) information are associated with prediction coding (motion vector predictor) and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US7154952B2 CLAIM 1 . A method for use in encoding video data , the method comprising : within a sequence of video pictures , selecting a current video picture to be encoded ; dividing the current video picture into portions and selecting a current portion to be encoded ; establishing at least a first reference picture for said current portion ; and selectively assigning at least one motion vector predictor (prediction coding) (MVP) to said current portion , said MVP including data associated with at least said first reference picture and with at least one other encoded portion of said current video picture , and wherein said MVP is not based on a temporal interpolation of motion vectors used for encoding said first reference picture , and wherein selectively assigning said MVP to said current portion further includes : encoding said current portion using a Copy Mode scheme based on a spatial prediction technique to produce a Copy Mode coded current portion ; encoding said current portion using a Direct Mode scheme based on a temporal prediction technique to produce a Direct Mode coded current portion ; and selecting between said Copy Mode coded current portion and said Direct Mode coded current portion , wherein selecting between said Copy Mode coded current portion and said Direct Mode coded current portion is accomplished using a Rate Distortion Optimization (RDO) technique , wherein said RDO technique uses a Lagrangian parameter λ based on a quantizer (QP) associated with said current portion , and wherein said RDO technique employs an adaptive weighting function (first maximum region, first subdivision) , wherein said adaptive weighting function includes : f ⁡ (QP) = max ⁡ (2 , min ⁡ (4 , QP 6)) .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set of root regions such that the first set of root regions are rectangular blocks of a size determined by the first maximum region (weighting function) size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	US7154952B2 CLAIM 1 . A method for use in encoding video data , the method comprising : within a sequence of video pictures , selecting a current video picture to be encoded ; dividing the current video picture into portions and selecting a current portion to be encoded ; establishing at least a first reference picture for said current portion ; and selectively assigning at least one motion vector predictor (MVP) to said current portion , said MVP including data associated with at least said first reference picture and with at least one other encoded portion of said current video picture , and wherein said MVP is not based on a temporal interpolation of motion vectors used for encoding said first reference picture , and wherein selectively assigning said MVP to said current portion further includes : encoding said current portion using a Copy Mode scheme based on a spatial prediction technique to produce a Copy Mode coded current portion ; encoding said current portion using a Direct Mode scheme based on a temporal prediction technique to produce a Direct Mode coded current portion ; and selecting between said Copy Mode coded current portion and said Direct Mode coded current portion , wherein selecting between said Copy Mode coded current portion and said Direct Mode coded current portion is accomplished using a Rate Distortion Optimization (RDO) technique , wherein said RDO technique uses a Lagrangian parameter λ based on a quantizer (QP) associated with said current portion , and wherein said RDO technique employs an adaptive weighting function (first maximum region, first subdivision) , wherein said adaptive weighting function includes : f ⁡ (QP) = max ⁡ (2 , min ⁡ (4 , QP 6)) .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision (weighting function) information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US7154952B2 CLAIM 1 . A method for use in encoding video data , the method comprising : within a sequence of video pictures , selecting a current video picture to be encoded ; dividing the current video picture into portions and selecting a current portion to be encoded ; establishing at least a first reference picture for said current portion ; and selectively assigning at least one motion vector predictor (MVP) to said current portion , said MVP including data associated with at least said first reference picture and with at least one other encoded portion of said current video picture , and wherein said MVP is not based on a temporal interpolation of motion vectors used for encoding said first reference picture , and wherein selectively assigning said MVP to said current portion further includes : encoding said current portion using a Copy Mode scheme based on a spatial prediction technique to produce a Copy Mode coded current portion ; encoding said current portion using a Direct Mode scheme based on a temporal prediction technique to produce a Direct Mode coded current portion ; and selecting between said Copy Mode coded current portion and said Direct Mode coded current portion , wherein selecting between said Copy Mode coded current portion and said Direct Mode coded current portion is accomplished using a Rate Distortion Optimization (RDO) technique , wherein said RDO technique uses a Lagrangian parameter λ based on a quantizer (QP) associated with said current portion , and wherein said RDO technique employs an adaptive weighting function (first maximum region, first subdivision) , wherein said adaptive weighting function includes : f ⁡ (QP) = max ⁡ (2 , min ⁡ (4 , QP 6)) .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision (weighting function) information includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level is sub-divided .	US7154952B2 CLAIM 1 . A method for use in encoding video data , the method comprising : within a sequence of video pictures , selecting a current video picture to be encoded ; dividing the current video picture into portions and selecting a current portion to be encoded ; establishing at least a first reference picture for said current portion ; and selectively assigning at least one motion vector predictor (MVP) to said current portion , said MVP including data associated with at least said first reference picture and with at least one other encoded portion of said current video picture , and wherein said MVP is not based on a temporal interpolation of motion vectors used for encoding said first reference picture , and wherein selectively assigning said MVP to said current portion further includes : encoding said current portion using a Copy Mode scheme based on a spatial prediction technique to produce a Copy Mode coded current portion ; encoding said current portion using a Direct Mode scheme based on a temporal prediction technique to produce a Direct Mode coded current portion ; and selecting between said Copy Mode coded current portion and said Direct Mode coded current portion , wherein selecting between said Copy Mode coded current portion and said Direct Mode coded current portion is accomplished using a Rate Distortion Optimization (RDO) technique , wherein said RDO technique uses a Lagrangian parameter λ based on a quantizer (QP) associated with said current portion , and wherein said RDO technique employs an adaptive weighting function (first maximum region, first subdivision) , wherein said adaptive weighting function includes : f ⁡ (QP) = max ⁡ (2 , min ⁡ (4 , QP 6)) .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision (weighting function) information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision (spatially neighboring) of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US7154952B2 CLAIM 1 . A method for use in encoding video data , the method comprising : within a sequence of video pictures , selecting a current video picture to be encoded ; dividing the current video picture into portions and selecting a current portion to be encoded ; establishing at least a first reference picture for said current portion ; and selectively assigning at least one motion vector predictor (MVP) to said current portion , said MVP including data associated with at least said first reference picture and with at least one other encoded portion of said current video picture , and wherein said MVP is not based on a temporal interpolation of motion vectors used for encoding said first reference picture , and wherein selectively assigning said MVP to said current portion further includes : encoding said current portion using a Copy Mode scheme based on a spatial prediction technique to produce a Copy Mode coded current portion ; encoding said current portion using a Direct Mode scheme based on a temporal prediction technique to produce a Direct Mode coded current portion ; and selecting between said Copy Mode coded current portion and said Direct Mode coded current portion , wherein selecting between said Copy Mode coded current portion and said Direct Mode coded current portion is accomplished using a Rate Distortion Optimization (RDO) technique , wherein said RDO technique uses a Lagrangian parameter λ based on a quantizer (QP) associated with said current portion , and wherein said RDO technique employs an adaptive weighting function (first maximum region, first subdivision) , wherein said adaptive weighting function includes : f ⁡ (QP) = max ⁡ (2 , min ⁡ (4 , QP 6)) . US7154952B2 CLAIM 10 . The method as recited in claim 1 , wherein said at least one other encoded portion of said current video picture is a spatially neighboring (intermediate subdivision) portion within said current video picture .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region (weighting function) size and the first subdivision (weighting function) information are associated with prediction coding (motion vector predictor) and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US7154952B2 CLAIM 1 . A method for use in encoding video data , the method comprising : within a sequence of video pictures , selecting a current video picture to be encoded ; dividing the current video picture into portions and selecting a current portion to be encoded ; establishing at least a first reference picture for said current portion ; and selectively assigning at least one motion vector predictor (prediction coding) (MVP) to said current portion , said MVP including data associated with at least said first reference picture and with at least one other encoded portion of said current video picture , and wherein said MVP is not based on a temporal interpolation of motion vectors used for encoding said first reference picture , and wherein selectively assigning said MVP to said current portion further includes : encoding said current portion using a Copy Mode scheme based on a spatial prediction technique to produce a Copy Mode coded current portion ; encoding said current portion using a Direct Mode scheme based on a temporal prediction technique to produce a Direct Mode coded current portion ; and selecting between said Copy Mode coded current portion and said Direct Mode coded current portion , wherein selecting between said Copy Mode coded current portion and said Direct Mode coded current portion is accomplished using a Rate Distortion Optimization (RDO) technique , wherein said RDO technique uses a Lagrangian parameter λ based on a quantizer (QP) associated with said current portion , and wherein said RDO technique employs an adaptive weighting function (first maximum region, first subdivision) , wherein said adaptive weighting function includes : f ⁡ (QP) = max ⁡ (2 , min ⁡ (4 , QP 6)) .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region (weighting function) size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision (weighting function) information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding (motion vector predictor) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US7154952B2 CLAIM 1 . A method for use in encoding video data , the method comprising : within a sequence of video pictures , selecting a current video picture to be encoded ; dividing the current video picture into portions and selecting a current portion to be encoded ; establishing at least a first reference picture for said current portion ; and selectively assigning at least one motion vector predictor (prediction coding) (MVP) to said current portion , said MVP including data associated with at least said first reference picture and with at least one other encoded portion of said current video picture , and wherein said MVP is not based on a temporal interpolation of motion vectors used for encoding said first reference picture , and wherein selectively assigning said MVP to said current portion further includes : encoding said current portion using a Copy Mode scheme based on a spatial prediction technique to produce a Copy Mode coded current portion ; encoding said current portion using a Direct Mode scheme based on a temporal prediction technique to produce a Direct Mode coded current portion ; and selecting between said Copy Mode coded current portion and said Direct Mode coded current portion , wherein selecting between said Copy Mode coded current portion and said Direct Mode coded current portion is accomplished using a Rate Distortion Optimization (RDO) technique , wherein said RDO technique uses a Lagrangian parameter λ based on a quantizer (QP) associated with said current portion , and wherein said RDO technique employs an adaptive weighting function (first maximum region, first subdivision) , wherein said adaptive weighting function includes : f ⁡ (QP) = max ⁡ (2 , min ⁡ (4 , QP 6)) .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region (weighting function) size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision (weighting function) information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding (motion vector predictor) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US7154952B2 CLAIM 1 . A method for use in encoding video data , the method comprising : within a sequence of video pictures , selecting a current video picture to be encoded ; dividing the current video picture into portions and selecting a current portion to be encoded ; establishing at least a first reference picture for said current portion ; and selectively assigning at least one motion vector predictor (prediction coding) (MVP) to said current portion , said MVP including data associated with at least said first reference picture and with at least one other encoded portion of said current video picture , and wherein said MVP is not based on a temporal interpolation of motion vectors used for encoding said first reference picture , and wherein selectively assigning said MVP to said current portion further includes : encoding said current portion using a Copy Mode scheme based on a spatial prediction technique to produce a Copy Mode coded current portion ; encoding said current portion using a Direct Mode scheme based on a temporal prediction technique to produce a Direct Mode coded current portion ; and selecting between said Copy Mode coded current portion and said Direct Mode coded current portion , wherein selecting between said Copy Mode coded current portion and said Direct Mode coded current portion is accomplished using a Rate Distortion Optimization (RDO) technique , wherein said RDO technique uses a Lagrangian parameter λ based on a quantizer (QP) associated with said current portion , and wherein said RDO technique employs an adaptive weighting function (first maximum region, first subdivision) , wherein said adaptive weighting function includes : f ⁡ (QP) = max ⁡ (2 , min ⁡ (4 , QP 6)) .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20040028049A1 Filed: 2003-07-07 Issued: 2004-02-12 XML encoding scheme (Original Assignee) Canon Inc (Current Assignee) Canon Inc Ernest Wan
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20040028049A1 CLAIM 1 . A method of communicating at least part of a structure of a document described by a hierarchical representation , said method (root region) comprising the steps of : identifying said representation of said document ; packetizing said representation into a plurality of data packets , said packets having a predetermined size , said packetizing comprising creating at least one link between a pair of said packets , said link representing an interconnection between corresponding components of said representation ; and forming said data packets into a stream for communication wherein said links maintain said representation within said packets .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region (said method) into sub-regions of a first hierarchy level according to a partition rule (coding formats, data types) associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules (coding formats, data types) associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20040028049A1 CLAIM 1 . A method of communicating at least part of a structure of a document described by a hierarchical representation , said method (root region) comprising the steps of : identifying said representation of said document ; packetizing said representation into a plurality of data packets , said packets having a predetermined size , said packetizing comprising creating at least one link between a pair of said packets , said link representing an interconnection between corresponding components of said representation ; and forming said data packets into a stream for communication wherein said links maintain said representation within said packets . US20040028049A1 CLAIM 9 . A method of encoding an XML document , said method comprising the steps of : examining said XML document to identify each data type forming part of said XML document ; identifying a first set of said data types (partition rule, partition rules, partition indication flag) for which a corresponding special encoding format is available ; first encoding each part of said XML document having a data type in said first set with the corresponding special encoding format ; second encoding each remaining part of said XML document with a default encoding format corresponding to the data type of said remaining part ; forming a representation of information referencing at least each said data type in said first set with the corresponding special encoding format ; and associating said representation and said encoded parts as an encoded form of said XML document . US20040028049A1 CLAIM 13 . A method according to claim 9 wherein said first encoding comprises examining said special data type and said corresponding part and determining a one of said encoding formats (partition rule, partition rules, partition indication flag) to be applied to said part .
US10250913B2 CLAIM 5 . The decoder according to claim 4 , wherein the divider is configured to , in accordance with the partition rules (coding formats, data types) associated with the first and higher-order hierarchy levels , sub-divide into sub-regions of equal size , such that there are an equal number of sub-regions at each hierarchy level .	US20040028049A1 CLAIM 9 . A method of encoding an XML document , said method comprising the steps of : examining said XML document to identify each data type forming part of said XML document ; identifying a first set of said data types (partition rule, partition rules, partition indication flag) for which a corresponding special encoding format is available ; first encoding each part of said XML document having a data type in said first set with the corresponding special encoding format ; second encoding each remaining part of said XML document with a default encoding format corresponding to the data type of said remaining part ; forming a representation of information referencing at least each said data type in said first set with the corresponding special encoding format ; and associating said representation and said encoded parts as an encoded form of said XML document . US20040028049A1 CLAIM 13 . A method according to claim 9 wherein said first encoding comprises examining said special data type and said corresponding part and determining a one of said encoding formats (partition rule, partition rules, partition indication flag) to be applied to said part .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision information includes a partition indication flag (coding formats, data types) indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level is sub-divided .	US20040028049A1 CLAIM 9 . A method of encoding an XML document , said method comprising the steps of : examining said XML document to identify each data type forming part of said XML document ; identifying a first set of said data types (partition rule, partition rules, partition indication flag) for which a corresponding special encoding format is available ; first encoding each part of said XML document having a data type in said first set with the corresponding special encoding format ; second encoding each remaining part of said XML document with a default encoding format corresponding to the data type of said remaining part ; forming a representation of information referencing at least each said data type in said first set with the corresponding special encoding format ; and associating said representation and said encoded parts as an encoded form of said XML document . US20040028049A1 CLAIM 13 . A method according to claim 9 wherein said first encoding comprises examining said special data type and said corresponding part and determining a one of said encoding formats (partition rule, partition rules, partition indication flag) to be applied to said part .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20040028049A1 CLAIM 1 . A method of communicating at least part of a structure of a document described by a hierarchical representation , said method (root region) comprising the steps of : identifying said representation of said document ; packetizing said representation into a plurality of data packets , said packets having a predetermined size , said packetizing comprising creating at least one link between a pair of said packets , said link representing an interconnection between corresponding components of said representation ; and forming said data packets into a stream for communication wherein said links maintain said representation within said packets .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20040028049A1 CLAIM 1 . A method of communicating at least part of a structure of a document described by a hierarchical representation , said method (root region) comprising the steps of : identifying said representation of said document ; packetizing said representation into a plurality of data packets , said packets having a predetermined size , said packetizing comprising creating at least one link between a pair of said packets , said link representing an interconnection between corresponding components of said representation ; and forming said data packets into a stream for communication wherein said links maintain said representation within said packets .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20040028049A1 CLAIM 1 . A method of communicating at least part of a structure of a document described by a hierarchical representation , said method (root region) comprising the steps of : identifying said representation of said document ; packetizing said representation into a plurality of data packets , said packets having a predetermined size , said packetizing comprising creating at least one link between a pair of said packets , said link representing an interconnection between corresponding components of said representation ; and forming said data packets into a stream for communication wherein said links maintain said representation within said packets .
US10250913B2 CLAIM 15 . A non-transitory computer readable digital storage medium having stored thereon a computer program (computer program) having a program code for performing , when running on a computer , a method according to claim 12 .	US20040028049A1 CLAIM 62 . A computer readable medium having a computer program (computer program) recorded thereon for performing the method of any one of claims 58 to 60 .
US10250913B2 CLAIM 16 . A non-transitory computer readable digital storage medium having stored thereon a computer program (computer program) having a program code for performing , when running on a computer , a method according to claim 14 .	US20040028049A1 CLAIM 62 . A computer readable medium having a computer program (computer program) recorded thereon for performing the method of any one of claims 58 to 60 .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20040194008A1 Filed: 2003-03-24 Issued: 2004-09-30 Method, apparatus, and system for encoding and decoding side information for multimedia transmission (Original Assignee) Qualcomm Inc (Current Assignee) Qualcomm Inc Harinath Garudadri, Kannan Ramchandran
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding (reconstructed block) and the second maximum region size and the second subdivision information are associated with transform coding (reconstructed block) ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20040194008A1 CLAIM 7 . The method of claim 6 wherein a block is classified based on energy differences between the respective block and a reconstructed block (prediction coding, transform coding, spatial domain transform coding) in the same location .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition (error information) rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20040194008A1 CLAIM 11 . The method of claim 10 wherein the residual data comprises prediction error information (respective partition) generated from the encoding of the input data .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision (residual data) of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20040194008A1 CLAIM 10 . The method of claim 9 wherein a quantizing parameter used to quantize the input data is determined based on statistics of residual data (intermediate subdivision) corresponding to a difference between the input data and the reconstruction of the input data .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding (reconstructed block) to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	US20040194008A1 CLAIM 7 . The method of claim 6 wherein a block is classified based on energy differences between the respective block and a reconstructed block (prediction coding, transform coding, spatial domain transform coding) in the same location .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding (reconstructed block) and the second maximum region size and the second subdivision information are associated with transform coding (reconstructed block) ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20040194008A1 CLAIM 7 . The method of claim 6 wherein a block is classified based on energy differences between the respective block and a reconstructed block (prediction coding, transform coding, spatial domain transform coding) in the same location .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding (reconstructed block) in accordance with the first set of sub-regions and transform coding (reconstructed block) in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20040194008A1 CLAIM 7 . The method of claim 6 wherein a block is classified based on energy differences between the respective block and a reconstructed block (prediction coding, transform coding, spatial domain transform coding) in the same location .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding (reconstructed block) in accordance with the first set of sub-regions and transform coding (reconstructed block) in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20040194008A1 CLAIM 7 . The method of claim 6 wherein a block is classified based on energy differences between the respective block and a reconstructed block (prediction coding, transform coding, spatial domain transform coding) in the same location .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20040184662A1 Filed: 2003-03-20 Issued: 2004-09-23 Method and apparatus for performing fast closest match in pattern recognition (Original Assignee) International Business Machines Corp (Current Assignee) Facebook Inc Kerry Kravec, Ali Saidi, Jan Slyfield, Pascal Tannhof
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size (repeating step) and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region (first minimum) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20040184662A1 CLAIM 1 . A method for finding a closest match of each of a plurality of N input patterns relative to a plurality of R reference patterns using a plurality of K processing units comprising : (a) loading a first input pattern into a first processing unit and a second input pattern into a second processing unit ; (b) sending one of said R reference patterns as a selected reference pattern to said first and second processing units ; (c) calculating a first distance in said first processing unit , said first distance representing a similarity of said selected reference pattern to said first input pattern ; (d) calculating a second distance in said second processing unit , said second distance representing a similarity of said selected reference pattern to said second input pattern ; (e) saving said first distance as a present minimum first distance and saving a first identification corresponding to said selected reference pattern used to calculate said present minimum first distance if said first distance is smaller than a stored previous present minimum first distance ; (f) saving said second distance as a present minimum second distance and saving a second identification corresponding to said selected reference pattern used to calculate said present minimum second distance if said second distance is smaller than a stored previous present minimum second distance ; and (g) repeating step (first maximum region size) s (b)-(f) until all of said R reference patterns have been loaded , wherein said present first minimum (root region) distance is a final first minimum distance of said first input pattern relative to said R reference patterns and said first identification identifies which of said R reference patterns is a closest match to said first input pattern , and said present second minimum distance is a final second minimum distance of said second input pattern relative to said R reference patterns and said second identification identifies which of said R reference patterns is a closest match to said second input pattern .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set of root regions such that the first set of root regions are rectangular blocks of a size determined by the first maximum region size (repeating step) , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	US20040184662A1 CLAIM 1 . A method for finding a closest match of each of a plurality of N input patterns relative to a plurality of R reference patterns using a plurality of K processing units comprising : (a) loading a first input pattern into a first processing unit and a second input pattern into a second processing unit ; (b) sending one of said R reference patterns as a selected reference pattern to said first and second processing units ; (c) calculating a first distance in said first processing unit , said first distance representing a similarity of said selected reference pattern to said first input pattern ; (d) calculating a second distance in said second processing unit , said second distance representing a similarity of said selected reference pattern to said second input pattern ; (e) saving said first distance as a present minimum first distance and saving a first identification corresponding to said selected reference pattern used to calculate said present minimum first distance if said first distance is smaller than a stored previous present minimum first distance ; (f) saving said second distance as a present minimum second distance and saving a second identification corresponding to said selected reference pattern used to calculate said present minimum second distance if said second distance is smaller than a stored previous present minimum second distance ; and (g) repeating step (first maximum region size) s (b)-(f) until all of said R reference patterns have been loaded , wherein said present first minimum distance is a final first minimum distance of said first input pattern relative to said R reference patterns and said first identification identifies which of said R reference patterns is a closest match to said first input pattern , and said present second minimum distance is a final second minimum distance of said second input pattern relative to said R reference patterns and said second identification identifies which of said R reference patterns is a closest match to said second input pattern .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region (first minimum) into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20040184662A1 CLAIM 1 . A method for finding a closest match of each of a plurality of N input patterns relative to a plurality of R reference patterns using a plurality of K processing units comprising : (a) loading a first input pattern into a first processing unit and a second input pattern into a second processing unit ; (b) sending one of said R reference patterns as a selected reference pattern to said first and second processing units ; (c) calculating a first distance in said first processing unit , said first distance representing a similarity of said selected reference pattern to said first input pattern ; (d) calculating a second distance in said second processing unit , said second distance representing a similarity of said selected reference pattern to said second input pattern ; (e) saving said first distance as a present minimum first distance and saving a first identification corresponding to said selected reference pattern used to calculate said present minimum first distance if said first distance is smaller than a stored previous present minimum first distance ; (f) saving said second distance as a present minimum second distance and saving a second identification corresponding to said selected reference pattern used to calculate said present minimum second distance if said second distance is smaller than a stored previous present minimum second distance ; and (g) repeating steps (b)-(f) until all of said R reference patterns have been loaded , wherein said present first minimum (root region) distance is a final first minimum distance of said first input pattern relative to said R reference patterns and said first identification identifies which of said R reference patterns is a closest match to said first input pattern , and said present second minimum distance is a final second minimum distance of said second input pattern relative to said R reference patterns and said second identification identifies which of said R reference patterns is a closest match to said second input pattern .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size (repeating step) and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region (first minimum) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20040184662A1 CLAIM 1 . A method for finding a closest match of each of a plurality of N input patterns relative to a plurality of R reference patterns using a plurality of K processing units comprising : (a) loading a first input pattern into a first processing unit and a second input pattern into a second processing unit ; (b) sending one of said R reference patterns as a selected reference pattern to said first and second processing units ; (c) calculating a first distance in said first processing unit , said first distance representing a similarity of said selected reference pattern to said first input pattern ; (d) calculating a second distance in said second processing unit , said second distance representing a similarity of said selected reference pattern to said second input pattern ; (e) saving said first distance as a present minimum first distance and saving a first identification corresponding to said selected reference pattern used to calculate said present minimum first distance if said first distance is smaller than a stored previous present minimum first distance ; (f) saving said second distance as a present minimum second distance and saving a second identification corresponding to said selected reference pattern used to calculate said present minimum second distance if said second distance is smaller than a stored previous present minimum second distance ; and (g) repeating step (first maximum region size) s (b)-(f) until all of said R reference patterns have been loaded , wherein said present first minimum (root region) distance is a final first minimum distance of said first input pattern relative to said R reference patterns and said first identification identifies which of said R reference patterns is a closest match to said first input pattern , and said present second minimum distance is a final second minimum distance of said second input pattern relative to said R reference patterns and said second identification identifies which of said R reference patterns is a closest match to said second input pattern .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size (repeating step) , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region (first minimum) of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20040184662A1 CLAIM 1 . A method for finding a closest match of each of a plurality of N input patterns relative to a plurality of R reference patterns using a plurality of K processing units comprising : (a) loading a first input pattern into a first processing unit and a second input pattern into a second processing unit ; (b) sending one of said R reference patterns as a selected reference pattern to said first and second processing units ; (c) calculating a first distance in said first processing unit , said first distance representing a similarity of said selected reference pattern to said first input pattern ; (d) calculating a second distance in said second processing unit , said second distance representing a similarity of said selected reference pattern to said second input pattern ; (e) saving said first distance as a present minimum first distance and saving a first identification corresponding to said selected reference pattern used to calculate said present minimum first distance if said first distance is smaller than a stored previous present minimum first distance ; (f) saving said second distance as a present minimum second distance and saving a second identification corresponding to said selected reference pattern used to calculate said present minimum second distance if said second distance is smaller than a stored previous present minimum second distance ; and (g) repeating step (first maximum region size) s (b)-(f) until all of said R reference patterns have been loaded , wherein said present first minimum (root region) distance is a final first minimum distance of said first input pattern relative to said R reference patterns and said first identification identifies which of said R reference patterns is a closest match to said first input pattern , and said present second minimum distance is a final second minimum distance of said second input pattern relative to said R reference patterns and said second identification identifies which of said R reference patterns is a closest match to said second input pattern .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size (repeating step) ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region (first minimum) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20040184662A1 CLAIM 1 . A method for finding a closest match of each of a plurality of N input patterns relative to a plurality of R reference patterns using a plurality of K processing units comprising : (a) loading a first input pattern into a first processing unit and a second input pattern into a second processing unit ; (b) sending one of said R reference patterns as a selected reference pattern to said first and second processing units ; (c) calculating a first distance in said first processing unit , said first distance representing a similarity of said selected reference pattern to said first input pattern ; (d) calculating a second distance in said second processing unit , said second distance representing a similarity of said selected reference pattern to said second input pattern ; (e) saving said first distance as a present minimum first distance and saving a first identification corresponding to said selected reference pattern used to calculate said present minimum first distance if said first distance is smaller than a stored previous present minimum first distance ; (f) saving said second distance as a present minimum second distance and saving a second identification corresponding to said selected reference pattern used to calculate said present minimum second distance if said second distance is smaller than a stored previous present minimum second distance ; and (g) repeating step (first maximum region size) s (b)-(f) until all of said R reference patterns have been loaded , wherein said present first minimum (root region) distance is a final first minimum distance of said first input pattern relative to said R reference patterns and said first identification identifies which of said R reference patterns is a closest match to said first input pattern , and said present second minimum distance is a final second minimum distance of said second input pattern relative to said R reference patterns and said second identification identifies which of said R reference patterns is a closest match to said second input pattern .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20030179940A1 Filed: 2003-03-19 Issued: 2003-09-25 Efficient macroblock header coding for video compression (Original Assignee) Microsoft Corp (Current Assignee) Microsoft Technology Licensing LLC Chih-Lung Lin, Ming-Chieh Lee
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream (computer readable medium, video object) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (video frame) information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision (video frame) information are associated with prediction coding (coded block pattern) and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20030179940A1 CLAIM 1 . In a video coder for coding video images in a block format , a method for improving compression of the video images comprising : for a macroblock in a video frame (second subdivision, first subdivision) , determining whether texture values for the color values of the macroblock are coded and setting the coded block parameters corresponding to the colors to indicate whether or not the texture values are coded ; forming a combined parameter representing all of the coded block parameters for the macroblock ; determining a single variable length code for the combined parameter of the macroblock ; and repeating the above-steps for macroblocks in the video image . US20030179940A1 CLAIM 9 . The method of claim 1 wherein the video image comprises two or more video object (data stream) planes , each being divided into macroblocks , and the steps of claim 1 are repeated for the macroblocks of each of the video object planes . US20030179940A1 CLAIM 10 . A computer readable medium (data stream) on which is stored instructions for performing the steps of claim 1 . US20030179940A1 CLAIM 13 . The method of claim 12 wherein the first variable length coding table stores entries for variable length codes , each representing a combined macroblock parameter that includes coded block pattern (prediction coding) s for chrominance and luminance ; and wherein the second variable length coding table stores entries for variable length codes , each representing a combined macroblock parameter that includes coded block patterns for chrominance and luminance .
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal based on an intra-prediction mode (color value) associated with the sub-region and reconstructed samples of a neighboring subset of the second set of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	US20030179940A1 CLAIM 1 . In a video coder for coding video images in a block format , a method for improving compression of the video images comprising : for a macroblock in a video frame , determining whether texture values for the color value (intra-prediction mode) s of the macroblock are coded and setting the coded block parameters corresponding to the colors to indicate whether or not the texture values are coded ; forming a combined parameter representing all of the coded block parameters for the macroblock ; determining a single variable length code for the combined parameter of the macroblock ; and repeating the above-steps for macroblocks in the video image .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision (video frame) information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20030179940A1 CLAIM 1 . In a video coder for coding video images in a block format , a method for improving compression of the video images comprising : for a macroblock in a video frame (second subdivision, first subdivision) , determining whether texture values for the color values of the macroblock are coded and setting the coded block parameters corresponding to the colors to indicate whether or not the texture values are coded ; forming a combined parameter representing all of the coded block parameters for the macroblock ; determining a single variable length code for the combined parameter of the macroblock ; and repeating the above-steps for macroblocks in the video image .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision (video frame) information includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level is sub-divided .	US20030179940A1 CLAIM 1 . In a video coder for coding video images in a block format , a method for improving compression of the video images comprising : for a macroblock in a video frame (second subdivision, first subdivision) , determining whether texture values for the color values of the macroblock are coded and setting the coded block parameters corresponding to the colors to indicate whether or not the texture values are coded ; forming a combined parameter representing all of the coded block parameters for the macroblock ; determining a single variable length code for the combined parameter of the macroblock ; and repeating the above-steps for macroblocks in the video image .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level from the data stream (computer readable medium, video object) .	US20030179940A1 CLAIM 9 . The method of claim 1 wherein the video image comprises two or more video object (data stream) planes , each being divided into macroblocks , and the steps of claim 1 are repeated for the macroblocks of each of the video object planes . US20030179940A1 CLAIM 10 . A computer readable medium (data stream) on which is stored instructions for performing the steps of claim 1 .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements associated with the first or second set of sub-regions from the data stream (computer readable medium, video object) in a depth-first traversal order .	US20030179940A1 CLAIM 9 . The method of claim 1 wherein the video image comprises two or more video object (data stream) planes , each being divided into macroblocks , and the steps of claim 1 are repeated for the macroblocks of each of the video object planes . US20030179940A1 CLAIM 10 . A computer readable medium (data stream) on which is stored instructions for performing the steps of claim 1 .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream (computer readable medium, video object) , disjoint from a second subset of syntax elements of the data stream including the first subdivision (video frame) information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20030179940A1 CLAIM 1 . In a video coder for coding video images in a block format , a method for improving compression of the video images comprising : for a macroblock in a video frame (second subdivision, first subdivision) , determining whether texture values for the color values of the macroblock are coded and setting the coded block parameters corresponding to the colors to indicate whether or not the texture values are coded ; forming a combined parameter representing all of the coded block parameters for the macroblock ; determining a single variable length code for the combined parameter of the macroblock ; and repeating the above-steps for macroblocks in the video image . US20030179940A1 CLAIM 9 . The method of claim 1 wherein the video image comprises two or more video object (data stream) planes , each being divided into macroblocks , and the steps of claim 1 are repeated for the macroblocks of each of the video object planes . US20030179940A1 CLAIM 10 . A computer readable medium (data stream) on which is stored instructions for performing the steps of claim 1 .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream (computer readable medium, video object) , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	US20030179940A1 CLAIM 9 . The method of claim 1 wherein the video image comprises two or more video object (data stream) planes , each being divided into macroblocks , and the steps of claim 1 are repeated for the macroblocks of each of the video object planes . US20030179940A1 CLAIM 10 . A computer readable medium (data stream) on which is stored instructions for performing the steps of claim 1 .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream (computer readable medium, video object) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (video frame) information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision (video frame) information are associated with prediction coding (coded block pattern) and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20030179940A1 CLAIM 1 . In a video coder for coding video images in a block format , a method for improving compression of the video images comprising : for a macroblock in a video frame (second subdivision, first subdivision) , determining whether texture values for the color values of the macroblock are coded and setting the coded block parameters corresponding to the colors to indicate whether or not the texture values are coded ; forming a combined parameter representing all of the coded block parameters for the macroblock ; determining a single variable length code for the combined parameter of the macroblock ; and repeating the above-steps for macroblocks in the video image . US20030179940A1 CLAIM 9 . The method of claim 1 wherein the video image comprises two or more video object (data stream) planes , each being divided into macroblocks , and the steps of claim 1 are repeated for the macroblocks of each of the video object planes . US20030179940A1 CLAIM 10 . A computer readable medium (data stream) on which is stored instructions for performing the steps of claim 1 . US20030179940A1 CLAIM 13 . The method of claim 12 wherein the first variable length coding table stores entries for variable length codes , each representing a combined macroblock parameter that includes coded block pattern (prediction coding) s for chrominance and luminance ; and wherein the second variable length coding table stores entries for variable length codes , each representing a combined macroblock parameter that includes coded block patterns for chrominance and luminance .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision (video frame) information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (video frame) information and a maximum hierarchy level ; and a data stream (computer readable medium, video object) generator configured to : encode the array of information samples using prediction coding (coded block pattern) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20030179940A1 CLAIM 1 . In a video coder for coding video images in a block format , a method for improving compression of the video images comprising : for a macroblock in a video frame (second subdivision, first subdivision) , determining whether texture values for the color values of the macroblock are coded and setting the coded block parameters corresponding to the colors to indicate whether or not the texture values are coded ; forming a combined parameter representing all of the coded block parameters for the macroblock ; determining a single variable length code for the combined parameter of the macroblock ; and repeating the above-steps for macroblocks in the video image . US20030179940A1 CLAIM 9 . The method of claim 1 wherein the video image comprises two or more video object (data stream) planes , each being divided into macroblocks , and the steps of claim 1 are repeated for the macroblocks of each of the video object planes . US20030179940A1 CLAIM 10 . A computer readable medium (data stream) on which is stored instructions for performing the steps of claim 1 . US20030179940A1 CLAIM 13 . The method of claim 12 wherein the first variable length coding table stores entries for variable length codes , each representing a combined macroblock parameter that includes coded block pattern (prediction coding) s for chrominance and luminance ; and wherein the second variable length coding table stores entries for variable length codes , each representing a combined macroblock parameter that includes coded block patterns for chrominance and luminance .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision (video frame) information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (video frame) information and a maximum hierarchy level ; encoding the array of information samples using prediction coding (coded block pattern) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream (computer readable medium, video object) the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20030179940A1 CLAIM 1 . In a video coder for coding video images in a block format , a method for improving compression of the video images comprising : for a macroblock in a video frame (second subdivision, first subdivision) , determining whether texture values for the color values of the macroblock are coded and setting the coded block parameters corresponding to the colors to indicate whether or not the texture values are coded ; forming a combined parameter representing all of the coded block parameters for the macroblock ; determining a single variable length code for the combined parameter of the macroblock ; and repeating the above-steps for macroblocks in the video image . US20030179940A1 CLAIM 9 . The method of claim 1 wherein the video image comprises two or more video object (data stream) planes , each being divided into macroblocks , and the steps of claim 1 are repeated for the macroblocks of each of the video object planes . US20030179940A1 CLAIM 10 . A computer readable medium (data stream) on which is stored instructions for performing the steps of claim 1 . US20030179940A1 CLAIM 13 . The method of claim 12 wherein the first variable length coding table stores entries for variable length codes , each representing a combined macroblock parameter that includes coded block pattern (prediction coding) s for chrominance and luminance ; and wherein the second variable length coding table stores entries for variable length codes , each representing a combined macroblock parameter that includes coded block patterns for chrominance and luminance .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20030123545A1 Filed: 2003-01-07 Issued: 2003-07-03 Segment-based encoding system using segment hierarchies (Original Assignee) Pulsent Corp (Current Assignee) Altera Corp Adityo Prakash, Eniko Fodor
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set (first set) of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set (second set) of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20030123545A1 CLAIM 1 . A method of encoding uncompressed video data to form compressed video data wherein the video data comprises a plurality of image frames including a set of reference frames and a set of nonkey frames , wherein the set of nonkey frames are encoded with reference at least to a segmentation of at least one of the image frames in the set of reference frames , and further wherein the segmentation is an assignment of some or all of the pixels of the reference frame to at least one segment based on at least one of a color value or a location of the pixels in the reference frame , the method comprising : encoding a first reference frame ; segmenting the first reference frame into a first set (first set) of segments ; segmenting the first reference frame into a second set (second set) of segments , wherein the first set and second set form a hierarchy of segments and each segment encloses a simply connected set of pixels of the first reference frame ; matching segments of the hierarchy of segments to pixels of a nonkey frame ; encoding into the compressed video data a representation of the nonkey frame according to results of the step of matching .
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set (first set) of sub-regions : compute a prediction signal based on an intra-prediction mode (color value) associated with the sub-region and reconstructed samples of a neighboring subset of the second set (second set) of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	US20030123545A1 CLAIM 1 . A method of encoding uncompressed video data to form compressed video data wherein the video data comprises a plurality of image frames including a set of reference frames and a set of nonkey frames , wherein the set of nonkey frames are encoded with reference at least to a segmentation of at least one of the image frames in the set of reference frames , and further wherein the segmentation is an assignment of some or all of the pixels of the reference frame to at least one segment based on at least one of a color value (intra-prediction mode) or a location of the pixels in the reference frame , the method comprising : encoding a first reference frame ; segmenting the first reference frame into a first set (first set) of segments ; segmenting the first reference frame into a second set (second set) of segments , wherein the first set and second set form a hierarchy of segments and each segment encloses a simply connected set of pixels of the first reference frame ; matching segments of the hierarchy of segments to pixels of a nonkey frame ; encoding into the compressed video data a representation of the nonkey frame according to results of the step of matching .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set (first set) of root regions such that the first set of root regions are rectangular blocks of a size determined by the first maximum region size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	US20030123545A1 CLAIM 1 . A method of encoding uncompressed video data to form compressed video data wherein the video data comprises a plurality of image frames including a set of reference frames and a set of nonkey frames , wherein the set of nonkey frames are encoded with reference at least to a segmentation of at least one of the image frames in the set of reference frames , and further wherein the segmentation is an assignment of some or all of the pixels of the reference frame to at least one segment based on at least one of a color value or a location of the pixels in the reference frame , the method comprising : encoding a first reference frame ; segmenting the first reference frame into a first set (first set) of segments ; segmenting the first reference frame into a second set of segments , wherein the first set and second set form a hierarchy of segments and each segment encloses a simply connected set of pixels of the first reference frame ; matching segments of the hierarchy of segments to pixels of a nonkey frame ; encoding into the compressed video data a representation of the nonkey frame according to results of the step of matching .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set (first set) of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20030123545A1 CLAIM 1 . A method of encoding uncompressed video data to form compressed video data wherein the video data comprises a plurality of image frames including a set of reference frames and a set of nonkey frames , wherein the set of nonkey frames are encoded with reference at least to a segmentation of at least one of the image frames in the set of reference frames , and further wherein the segmentation is an assignment of some or all of the pixels of the reference frame to at least one segment based on at least one of a color value or a location of the pixels in the reference frame , the method comprising : encoding a first reference frame ; segmenting the first reference frame into a first set (first set) of segments ; segmenting the first reference frame into a second set of segments , wherein the first set and second set form a hierarchy of segments and each segment encloses a simply connected set of pixels of the first reference frame ; matching segments of the hierarchy of segments to pixels of a nonkey frame ; encoding into the compressed video data a representation of the nonkey frame according to results of the step of matching .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision information includes a partition indication flag indicating whether any of the first set (first set) of root regions or the sub-regions at the first or higher-order hierarchy level is sub-divided .	US20030123545A1 CLAIM 1 . A method of encoding uncompressed video data to form compressed video data wherein the video data comprises a plurality of image frames including a set of reference frames and a set of nonkey frames , wherein the set of nonkey frames are encoded with reference at least to a segmentation of at least one of the image frames in the set of reference frames , and further wherein the segmentation is an assignment of some or all of the pixels of the reference frame to at least one segment based on at least one of a color value or a location of the pixels in the reference frame , the method comprising : encoding a first reference frame ; segmenting the first reference frame into a first set (first set) of segments ; segmenting the first reference frame into a second set of segments , wherein the first set and second set form a hierarchy of segments and each segment encloses a simply connected set of pixels of the first reference frame ; matching segments of the hierarchy of segments to pixels of a nonkey frame ; encoding into the compressed video data a representation of the nonkey frame according to results of the step of matching .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements associated with the first or second set (second set) of sub-regions from the data stream in a depth-first traversal order .	US20030123545A1 CLAIM 1 . A method of encoding uncompressed video data to form compressed video data wherein the video data comprises a plurality of image frames including a set of reference frames and a set of nonkey frames , wherein the set of nonkey frames are encoded with reference at least to a segmentation of at least one of the image frames in the set of reference frames , and further wherein the segmentation is an assignment of some or all of the pixels of the reference frame to at least one segment based on at least one of a color value or a location of the pixels in the reference frame , the method comprising : encoding a first reference frame ; segmenting the first reference frame into a first set of segments ; segmenting the first reference frame into a second set (second set) of segments , wherein the first set and second set form a hierarchy of segments and each segment encloses a simply connected set of pixels of the first reference frame ; matching segments of the hierarchy of segments to pixels of a nonkey frame ; encoding into the compressed video data a representation of the nonkey frame according to results of the step of matching .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set (first set) of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20030123545A1 CLAIM 1 . A method of encoding uncompressed video data to form compressed video data wherein the video data comprises a plurality of image frames including a set of reference frames and a set of nonkey frames , wherein the set of nonkey frames are encoded with reference at least to a segmentation of at least one of the image frames in the set of reference frames , and further wherein the segmentation is an assignment of some or all of the pixels of the reference frame to at least one segment based on at least one of a color value or a location of the pixels in the reference frame , the method comprising : encoding a first reference frame ; segmenting the first reference frame into a first set (first set) of segments ; segmenting the first reference frame into a second set of segments , wherein the first set and second set form a hierarchy of segments and each segment encloses a simply connected set of pixels of the first reference frame ; matching segments of the hierarchy of segments to pixels of a nonkey frame ; encoding into the compressed video data a representation of the nonkey frame according to results of the step of matching .
US10250913B2 CLAIM 11 . The decoder according to claim 1 , wherein the recursive multi-tree partitioning includes a quadtree partitioning (coding one) technique .	US20030123545A1 CLAIM 16 . The method of claim 1 , wherein the hierarchy of segments is usable for coding one (quadtree partitioning, quadtree partitioning technique) or more of motion , residue or other kinetic information .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set (first set) of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set (second set) of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20030123545A1 CLAIM 1 . A method of encoding uncompressed video data to form compressed video data wherein the video data comprises a plurality of image frames including a set of reference frames and a set of nonkey frames , wherein the set of nonkey frames are encoded with reference at least to a segmentation of at least one of the image frames in the set of reference frames , and further wherein the segmentation is an assignment of some or all of the pixels of the reference frame to at least one segment based on at least one of a color value or a location of the pixels in the reference frame , the method comprising : encoding a first reference frame ; segmenting the first reference frame into a first set (first set) of segments ; segmenting the first reference frame into a second set (second set) of segments , wherein the first set and second set form a hierarchy of segments and each segment encloses a simply connected set of pixels of the first reference frame ; matching segments of the hierarchy of segments to pixels of a nonkey frame ; encoding into the compressed video data a representation of the nonkey frame according to results of the step of matching .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set (first set) of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set (second set) of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20030123545A1 CLAIM 1 . A method of encoding uncompressed video data to form compressed video data wherein the video data comprises a plurality of image frames including a set of reference frames and a set of nonkey frames , wherein the set of nonkey frames are encoded with reference at least to a segmentation of at least one of the image frames in the set of reference frames , and further wherein the segmentation is an assignment of some or all of the pixels of the reference frame to at least one segment based on at least one of a color value or a location of the pixels in the reference frame , the method comprising : encoding a first reference frame ; segmenting the first reference frame into a first set (first set) of segments ; segmenting the first reference frame into a second set (second set) of segments , wherein the first set and second set form a hierarchy of segments and each segment encloses a simply connected set of pixels of the first reference frame ; matching segments of the hierarchy of segments to pixels of a nonkey frame ; encoding into the compressed video data a representation of the nonkey frame according to results of the step of matching .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set (first set) of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set (second set) of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20030123545A1 CLAIM 1 . A method of encoding uncompressed video data to form compressed video data wherein the video data comprises a plurality of image frames including a set of reference frames and a set of nonkey frames , wherein the set of nonkey frames are encoded with reference at least to a segmentation of at least one of the image frames in the set of reference frames , and further wherein the segmentation is an assignment of some or all of the pixels of the reference frame to at least one segment based on at least one of a color value or a location of the pixels in the reference frame , the method comprising : encoding a first reference frame ; segmenting the first reference frame into a first set (first set) of segments ; segmenting the first reference frame into a second set (second set) of segments , wherein the first set and second set form a hierarchy of segments and each segment encloses a simply connected set of pixels of the first reference frame ; matching segments of the hierarchy of segments to pixels of a nonkey frame ; encoding into the compressed video data a representation of the nonkey frame according to results of the step of matching .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20030138150A1 Filed: 2002-12-17 Issued: 2003-07-24 Spatial extrapolation of pixel values in intraframe video coding and decoding (Original Assignee) Microsoft Corp (Current Assignee) Microsoft Technology Licensing LLC Sridhar Srinivasan
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream (entropy decoding) representing encoded video information (first count) , information related to first and second maximum region sizes , first and second subdivision (more context) information , and a maximum hierarchy level wherein the first maximum region (causal neighborhood) size and the first subdivision (processing blocks) information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20030138150A1 CLAIM 1 . In a computer system , a computer-implemented method of processing blocks (first subdivision) of pixels in a video frame of a video sequence , the method comprising : for a current block of plural pixels in the video frame of the video sequence , identifying plural context pixels in the video frame , wherein the plural context pixels form at least part of a causal neighborhood (first maximum region) for the current block ; computing a spatial extrapolation for pixel values of the plural pixels of the current block based at least in part upon pixel values of the plural context pixels , wherein the spatial extrapolation comprises one or more pixel value extrapolations from one or more of the plural context pixels into the current block to thereby spatially predict the pixel values of the plural pixels of the current block . US20030138150A1 CLAIM 12 . The method of claim 1 further comprising , based upon one or more context (second subdivision) measures , changing entropy code tables . US20030138150A1 CLAIM 28 . A computer-readable medium having encoded therein computer-executable instructions for causing a computer system programmed thereby to perform a method of video decoding , the method comprising : entropy decoding (data stream) frequency coefficient values for a current set of pixels ; and applying a re-oriented inverse frequency transform to the frequency coefficient values for the current set , wherein the re-oriented inverse frequency transform uses inverse lifting in the frequency domain . US20030138150A1 CLAIM 55 . The method of claim 52 wherein the causal context information includes a first count (video information) of non-zero coefficient values from a first causal block above the current block , and wherein the causal context information further includes a second count of non-zero coefficient values from a second causal block left of the current block .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set of root regions such that the first set of root regions are rectangular blocks of a size determined by the first maximum region (causal neighborhood) size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	US20030138150A1 CLAIM 1 . In a computer system , a computer-implemented method of processing blocks of pixels in a video frame of a video sequence , the method comprising : for a current block of plural pixels in the video frame of the video sequence , identifying plural context pixels in the video frame , wherein the plural context pixels form at least part of a causal neighborhood (first maximum region) for the current block ; computing a spatial extrapolation for pixel values of the plural pixels of the current block based at least in part upon pixel values of the plural context pixels , wherein the spatial extrapolation comprises one or more pixel value extrapolations from one or more of the plural context pixels into the current block to thereby spatially predict the pixel values of the plural pixels of the current block .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision (processing blocks) information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level (discrete cosine transform) according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20030138150A1 CLAIM 1 . In a computer system , a computer-implemented method of processing blocks (first subdivision) of pixels in a video frame of a video sequence , the method comprising : for a current block of plural pixels in the video frame of the video sequence , identifying plural context pixels in the video frame , wherein the plural context pixels form at least part of a causal neighborhood for the current block ; computing a spatial extrapolation for pixel values of the plural pixels of the current block based at least in part upon pixel values of the plural context pixels , wherein the spatial extrapolation comprises one or more pixel value extrapolations from one or more of the plural context pixels into the current block to thereby spatially predict the pixel values of the plural pixels of the current block . US20030138150A1 CLAIM 23 . The computer-readable medium of claim 22 wherein the re-oriented frequency transform is a skewed discrete cosine transform (first hierarchy level) .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision (processing blocks) information includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level is sub-divided .	US20030138150A1 CLAIM 1 . In a computer system , a computer-implemented method of processing blocks (first subdivision) of pixels in a video frame of a video sequence , the method comprising : for a current block of plural pixels in the video frame of the video sequence , identifying plural context pixels in the video frame , wherein the plural context pixels form at least part of a causal neighborhood for the current block ; computing a spatial extrapolation for pixel values of the plural pixels of the current block based at least in part upon pixel values of the plural context pixels , wherein the spatial extrapolation comprises one or more pixel value extrapolations from one or more of the plural context pixels into the current block to thereby spatially predict the pixel values of the plural pixels of the current block .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level from the data stream (entropy decoding) .	US20030138150A1 CLAIM 28 . A computer-readable medium having encoded therein computer-executable instructions for causing a computer system programmed thereby to perform a method of video decoding , the method comprising : entropy decoding (data stream) frequency coefficient values for a current set of pixels ; and applying a re-oriented inverse frequency transform to the frequency coefficient values for the current set , wherein the re-oriented inverse frequency transform uses inverse lifting in the frequency domain .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements associated with the first or second set of sub-regions from the data stream (entropy decoding) in a depth-first traversal order .	US20030138150A1 CLAIM 28 . A computer-readable medium having encoded therein computer-executable instructions for causing a computer system programmed thereby to perform a method of video decoding , the method comprising : entropy decoding (data stream) frequency coefficient values for a current set of pixels ; and applying a re-oriented inverse frequency transform to the frequency coefficient values for the current set , wherein the re-oriented inverse frequency transform uses inverse lifting in the frequency domain .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream (entropy decoding) , disjoint from a second subset of syntax elements of the data stream including the first subdivision (processing blocks) information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20030138150A1 CLAIM 1 . In a computer system , a computer-implemented method of processing blocks (first subdivision) of pixels in a video frame of a video sequence , the method comprising : for a current block of plural pixels in the video frame of the video sequence , identifying plural context pixels in the video frame , wherein the plural context pixels form at least part of a causal neighborhood for the current block ; computing a spatial extrapolation for pixel values of the plural pixels of the current block based at least in part upon pixel values of the plural context pixels , wherein the spatial extrapolation comprises one or more pixel value extrapolations from one or more of the plural context pixels into the current block to thereby spatially predict the pixel values of the plural pixels of the current block . US20030138150A1 CLAIM 28 . A computer-readable medium having encoded therein computer-executable instructions for causing a computer system programmed thereby to perform a method of video decoding , the method comprising : entropy decoding (data stream) frequency coefficient values for a current set of pixels ; and applying a re-oriented inverse frequency transform to the frequency coefficient values for the current set , wherein the re-oriented inverse frequency transform uses inverse lifting in the frequency domain .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream (entropy decoding) , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	US20030138150A1 CLAIM 28 . A computer-readable medium having encoded therein computer-executable instructions for causing a computer system programmed thereby to perform a method of video decoding , the method comprising : entropy decoding (data stream) frequency coefficient values for a current set of pixels ; and applying a re-oriented inverse frequency transform to the frequency coefficient values for the current set , wherein the re-oriented inverse frequency transform uses inverse lifting in the frequency domain .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream (entropy decoding) representing encoded video information (first count) , information related to first and second maximum region sizes , first and second subdivision (more context) information , and a maximum hierarchy level , wherein the first maximum region (causal neighborhood) size and the first subdivision (processing blocks) information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20030138150A1 CLAIM 1 . In a computer system , a computer-implemented method of processing blocks (first subdivision) of pixels in a video frame of a video sequence , the method comprising : for a current block of plural pixels in the video frame of the video sequence , identifying plural context pixels in the video frame , wherein the plural context pixels form at least part of a causal neighborhood (first maximum region) for the current block ; computing a spatial extrapolation for pixel values of the plural pixels of the current block based at least in part upon pixel values of the plural context pixels , wherein the spatial extrapolation comprises one or more pixel value extrapolations from one or more of the plural context pixels into the current block to thereby spatially predict the pixel values of the plural pixels of the current block . US20030138150A1 CLAIM 12 . The method of claim 1 further comprising , based upon one or more context (second subdivision) measures , changing entropy code tables . US20030138150A1 CLAIM 28 . A computer-readable medium having encoded therein computer-executable instructions for causing a computer system programmed thereby to perform a method of video decoding , the method comprising : entropy decoding (data stream) frequency coefficient values for a current set of pixels ; and applying a re-oriented inverse frequency transform to the frequency coefficient values for the current set , wherein the re-oriented inverse frequency transform uses inverse lifting in the frequency domain . US20030138150A1 CLAIM 55 . The method of claim 52 wherein the causal context information includes a first count (video information) of non-zero coefficient values from a first causal block above the current block , and wherein the causal context information further includes a second count of non-zero coefficient values from a second causal block left of the current block .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information (first count) into a first set of root regions based on a first maximum region (causal neighborhood) size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision (processing blocks) information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (more context) information and a maximum hierarchy level ; and a data stream (entropy decoding) generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20030138150A1 CLAIM 1 . In a computer system , a computer-implemented method of processing blocks (first subdivision) of pixels in a video frame of a video sequence , the method comprising : for a current block of plural pixels in the video frame of the video sequence , identifying plural context pixels in the video frame , wherein the plural context pixels form at least part of a causal neighborhood (first maximum region) for the current block ; computing a spatial extrapolation for pixel values of the plural pixels of the current block based at least in part upon pixel values of the plural context pixels , wherein the spatial extrapolation comprises one or more pixel value extrapolations from one or more of the plural context pixels into the current block to thereby spatially predict the pixel values of the plural pixels of the current block . US20030138150A1 CLAIM 12 . The method of claim 1 further comprising , based upon one or more context (second subdivision) measures , changing entropy code tables . US20030138150A1 CLAIM 28 . A computer-readable medium having encoded therein computer-executable instructions for causing a computer system programmed thereby to perform a method of video decoding , the method comprising : entropy decoding (data stream) frequency coefficient values for a current set of pixels ; and applying a re-oriented inverse frequency transform to the frequency coefficient values for the current set , wherein the re-oriented inverse frequency transform uses inverse lifting in the frequency domain . US20030138150A1 CLAIM 55 . The method of claim 52 wherein the causal context information includes a first count (video information) of non-zero coefficient values from a first causal block above the current block , and wherein the causal context information further includes a second count of non-zero coefficient values from a second causal block left of the current block .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information (first count) into a first set of root regions based on a first maximum region (causal neighborhood) size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision (processing blocks) information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (more context) information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream (entropy decoding) the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20030138150A1 CLAIM 1 . In a computer system , a computer-implemented method of processing blocks (first subdivision) of pixels in a video frame of a video sequence , the method comprising : for a current block of plural pixels in the video frame of the video sequence , identifying plural context pixels in the video frame , wherein the plural context pixels form at least part of a causal neighborhood (first maximum region) for the current block ; computing a spatial extrapolation for pixel values of the plural pixels of the current block based at least in part upon pixel values of the plural context pixels , wherein the spatial extrapolation comprises one or more pixel value extrapolations from one or more of the plural context pixels into the current block to thereby spatially predict the pixel values of the plural pixels of the current block . US20030138150A1 CLAIM 12 . The method of claim 1 further comprising , based upon one or more context (second subdivision) measures , changing entropy code tables . US20030138150A1 CLAIM 28 . A computer-readable medium having encoded therein computer-executable instructions for causing a computer system programmed thereby to perform a method of video decoding , the method comprising : entropy decoding (data stream) frequency coefficient values for a current set of pixels ; and applying a re-oriented inverse frequency transform to the frequency coefficient values for the current set , wherein the re-oriented inverse frequency transform uses inverse lifting in the frequency domain . US20030138150A1 CLAIM 55 . The method of claim 52 wherein the causal context information includes a first count (video information) of non-zero coefficient values from a first causal block above the current block , and wherein the causal context information further includes a second count of non-zero coefficient values from a second causal block left of the current block .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20030152146A1 Filed: 2002-12-17 Issued: 2003-08-14 Motion compensation loop with filtering (Original Assignee) Microsoft Corp (Current Assignee) Microsoft Technology Licensing LLC Chih-Lung Lin, Pohsiang Hsu, Thomas Holcomb, Ming-Chieh Lee
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (video encoder) information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20030152146A1 CLAIM 6 . A computer-readable medium storing computer-executable instructions for causing the computer system to perform the method of claim 1 in a video encoder (second subdivision, second subset, second subdivision information) .
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset (pixel value) of the second set of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	US20030152146A1 CLAIM 1 . In a computer system , a computer-implemented method of motion compensation comprising : in a loop that includes motion compensation , adaptively filtering one or more boundaries between sets of pixels in a reference frame to reduce boundary discontinuities , wherein application of the filtering across a given boundary of the one or more boundaries depends at least in part upon plural discontinuity measures , the plural discontinuity measures including : a cross boundary discontinuity measure that quantifies pixel value (neighboring subset) discontinuity across the given boundary ; a first side discontinuity measure that quantifies pixel value discontinuity on a first side of the given boundary , a second side discontinuity measure that quantifies pixel value discontinuity on a second side of the given boundary , wherein the first side is different than the second side ; and performing the motion compensation for a predicted frame relative to the reference frame .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset (video encoder) of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20030152146A1 CLAIM 6 . A computer-readable medium storing computer-executable instructions for causing the computer system to perform the method of claim 1 in a video encoder (second subdivision, second subset, second subdivision information) .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (video encoder) information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20030152146A1 CLAIM 6 . A computer-readable medium storing computer-executable instructions for causing the computer system to perform the method of claim 1 in a video encoder (second subdivision, second subset, second subdivision information) .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (video encoder) information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20030152146A1 CLAIM 6 . A computer-readable medium storing computer-executable instructions for causing the computer system to perform the method of claim 1 in a video encoder (second subdivision, second subset, second subdivision information) .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (video encoder) information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20030152146A1 CLAIM 6 . A computer-readable medium storing computer-executable instructions for causing the computer system to perform the method of claim 1 in a video encoder (second subdivision, second subset, second subdivision information) .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20030156646A1 Filed: 2002-12-17 Issued: 2003-08-21 Multi-resolution motion estimation and compensation (Original Assignee) Microsoft Corp (Current Assignee) Microsoft Technology Licensing LLC Pohsiang Hsu, Chih-Lung Lin, Ming-Chieh Lee
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (frame basis, video encoder) information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding (frame basis, video encoder) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20030156646A1 CLAIM 4 . The method of claim 1 wherein the selecting occurs on a per frame basis (information samples using prediction coding, second subdivision, second subset, second subdivision information) . US20030156646A1 CLAIM 7 . The method of claim 1 wherein a video encoder (information samples using prediction coding, second subdivision, second subset, second subdivision information) performs the selecting based upon evaluation of the plural different fractional pixel motion resolutions .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set of root regions such that the first set of root regions are rectangular blocks (motion prediction) of a size determined by the first maximum region size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	US20030156646A1 CLAIM 25 . In a computer system , a computer-implemented method of exploiting temporal redundancy between plural video frames , the method comprising : defining a motion prediction (rectangular blocks) range in a reference frame of the plural video frames , wherein the defined motion prediction range has a horizontal motion resolution and a vertical motion resolution , and wherein the horizontal motion resolution is different than the vertical motion resolution ; and applying motion information for one or more pixels of a current frame of the plural video frames relative to one or more corresponding pixels in the defined motion prediction range in the reference frame .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset (frame basis, video encoder) of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20030156646A1 CLAIM 4 . The method of claim 1 wherein the selecting occurs on a per frame basis (information samples using prediction coding, second subdivision, second subset, second subdivision information) . US20030156646A1 CLAIM 7 . The method of claim 1 wherein a video encoder (information samples using prediction coding, second subdivision, second subset, second subdivision information) performs the selecting based upon evaluation of the plural different fractional pixel motion resolutions .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (frame basis, video encoder) information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding (frame basis, video encoder) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20030156646A1 CLAIM 4 . The method of claim 1 wherein the selecting occurs on a per frame basis (information samples using prediction coding, second subdivision, second subset, second subdivision information) . US20030156646A1 CLAIM 7 . The method of claim 1 wherein a video encoder (information samples using prediction coding, second subdivision, second subset, second subdivision information) performs the selecting based upon evaluation of the plural different fractional pixel motion resolutions .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (frame basis, video encoder) information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding (frame basis, video encoder) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20030156646A1 CLAIM 4 . The method of claim 1 wherein the selecting occurs on a per frame basis (information samples using prediction coding, second subdivision, second subset, second subdivision information) . US20030156646A1 CLAIM 7 . The method of claim 1 wherein a video encoder (information samples using prediction coding, second subdivision, second subset, second subdivision information) performs the selecting based upon evaluation of the plural different fractional pixel motion resolutions .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (frame basis, video encoder) information and a maximum hierarchy level ; encoding the array of information samples using prediction coding (frame basis, video encoder) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20030156646A1 CLAIM 4 . The method of claim 1 wherein the selecting occurs on a per frame basis (information samples using prediction coding, second subdivision, second subset, second subdivision information) . US20030156646A1 CLAIM 7 . The method of claim 1 wherein a video encoder (information samples using prediction coding, second subdivision, second subset, second subdivision information) performs the selecting based upon evaluation of the plural different fractional pixel motion resolutions .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20030156648A1 Filed: 2002-12-17 Issued: 2003-08-21 Sub-block transform coding of prediction residuals (Original Assignee) Microsoft Corp (Current Assignee) Microsoft Technology Licensing LLC Thomas Holcomb, Chih-Lung Lin
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream (different bit) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (video encoder) information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding (rate-distortion performance) and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set (cost function) of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20030156648A1 CLAIM 31 . The computer-readable medium of claim 29 wherein the evaluating comprises computing values for a cost function (first set) for each of the plural available transform sizes in terms of distortion and/or rate . US20030156648A1 CLAIM 33 . The computer-readable medium of claim 29 wherein the method further comprises selecting one or more transform switch levels based at least in part upon results of the evaluating to trade off rate-distortion performance (prediction coding, prediction signal, information samples using prediction coding) and control overhead . US20030156648A1 CLAIM 37 . In a computer system , a computer-implemented method of processing one or more video frames , the method comprising : switching transform sizes from among plural available transform sizes for data for the one or more video frames , wherein bitstream syntax allows the switching at plural different bit (data stream) stream levels for the one or more video frames ; and processing the data for the one or more video frames with one or more transforms of switched transform size . US20030156648A1 CLAIM 46 . A video encoder (second subdivision, second subset, second subdivision information) comprising : means for switching frequency transform sizes from among plural available frequency transform sizes for prediction residual data for one or more motion-predicted video frames , wherein bitstream syntax allows the switching at plural different bitstream levels for the one or more motion-predicted video frames ; and means for processing the prediction residual data with one or more frequency transforms of switched frequency transform size .
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set (cost function) of sub-regions : compute a prediction signal (rate-distortion performance) based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset of the second set of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	US20030156648A1 CLAIM 31 . The computer-readable medium of claim 29 wherein the evaluating comprises computing values for a cost function (first set) for each of the plural available transform sizes in terms of distortion and/or rate . US20030156648A1 CLAIM 33 . The computer-readable medium of claim 29 wherein the method further comprises selecting one or more transform switch levels based at least in part upon results of the evaluating to trade off rate-distortion performance (prediction coding, prediction signal, information samples using prediction coding) and control overhead .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set (cost function) of root regions such that the first set of root regions are rectangular blocks (motion prediction) of a size determined by the first maximum region size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	US20030156648A1 CLAIM 20 . The method of claim 19 wherein for at least part of the prediction residual data the selected transform size is different than motion prediction (rectangular blocks) block size . US20030156648A1 CLAIM 31 . The computer-readable medium of claim 29 wherein the evaluating comprises computing values for a cost function (first set) for each of the plural available transform sizes in terms of distortion and/or rate .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set (cost function) of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20030156648A1 CLAIM 31 . The computer-readable medium of claim 29 wherein the evaluating comprises computing values for a cost function (first set) for each of the plural available transform sizes in terms of distortion and/or rate .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision information includes a partition indication flag indicating whether any of the first set (cost function) of root regions or the sub-regions at the first or higher-order hierarchy level is sub-divided .	US20030156648A1 CLAIM 31 . The computer-readable medium of claim 29 wherein the evaluating comprises computing values for a cost function (first set) for each of the plural available transform sizes in terms of distortion and/or rate .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level from the data stream (different bit) .	US20030156648A1 CLAIM 37 . In a computer system , a computer-implemented method of processing one or more video frames , the method comprising : switching transform sizes from among plural available transform sizes for data for the one or more video frames , wherein bitstream syntax allows the switching at plural different bit (data stream) stream levels for the one or more video frames ; and processing the data for the one or more video frames with one or more transforms of switched transform size .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements associated with the first or second set of sub-regions from the data stream (different bit) in a depth-first traversal order .	US20030156648A1 CLAIM 37 . In a computer system , a computer-implemented method of processing one or more video frames , the method comprising : switching transform sizes from among plural available transform sizes for data for the one or more video frames , wherein bitstream syntax allows the switching at plural different bit (data stream) stream levels for the one or more video frames ; and processing the data for the one or more video frames with one or more transforms of switched transform size .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream (different bit) , disjoint from a second subset (video encoder) of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set (cost function) of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20030156648A1 CLAIM 31 . The computer-readable medium of claim 29 wherein the evaluating comprises computing values for a cost function (first set) for each of the plural available transform sizes in terms of distortion and/or rate . US20030156648A1 CLAIM 37 . In a computer system , a computer-implemented method of processing one or more video frames , the method comprising : switching transform sizes from among plural available transform sizes for data for the one or more video frames , wherein bitstream syntax allows the switching at plural different bit (data stream) stream levels for the one or more video frames ; and processing the data for the one or more video frames with one or more transforms of switched transform size . US20030156648A1 CLAIM 46 . A video encoder (second subdivision, second subset, second subdivision information) comprising : means for switching frequency transform sizes from among plural available frequency transform sizes for prediction residual data for one or more motion-predicted video frames , wherein bitstream syntax allows the switching at plural different bitstream levels for the one or more motion-predicted video frames ; and means for processing the prediction residual data with one or more frequency transforms of switched frequency transform size .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream (different bit) , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	US20030156648A1 CLAIM 37 . In a computer system , a computer-implemented method of processing one or more video frames , the method comprising : switching transform sizes from among plural available transform sizes for data for the one or more video frames , wherein bitstream syntax allows the switching at plural different bit (data stream) stream levels for the one or more video frames ; and processing the data for the one or more video frames with one or more transforms of switched transform size .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream (different bit) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (video encoder) information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding (rate-distortion performance) and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set (cost function) of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20030156648A1 CLAIM 31 . The computer-readable medium of claim 29 wherein the evaluating comprises computing values for a cost function (first set) for each of the plural available transform sizes in terms of distortion and/or rate . US20030156648A1 CLAIM 33 . The computer-readable medium of claim 29 wherein the method further comprises selecting one or more transform switch levels based at least in part upon results of the evaluating to trade off rate-distortion performance (prediction coding, prediction signal, information samples using prediction coding) and control overhead . US20030156648A1 CLAIM 37 . In a computer system , a computer-implemented method of processing one or more video frames , the method comprising : switching transform sizes from among plural available transform sizes for data for the one or more video frames , wherein bitstream syntax allows the switching at plural different bit (data stream) stream levels for the one or more video frames ; and processing the data for the one or more video frames with one or more transforms of switched transform size . US20030156648A1 CLAIM 46 . A video encoder (second subdivision, second subset, second subdivision information) comprising : means for switching frequency transform sizes from among plural available frequency transform sizes for prediction residual data for one or more motion-predicted video frames , wherein bitstream syntax allows the switching at plural different bitstream levels for the one or more motion-predicted video frames ; and means for processing the prediction residual data with one or more frequency transforms of switched frequency transform size .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set (cost function) of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (video encoder) information and a maximum hierarchy level ; and a data stream (different bit) generator configured to : encode the array of information samples using prediction coding (rate-distortion performance) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20030156648A1 CLAIM 31 . The computer-readable medium of claim 29 wherein the evaluating comprises computing values for a cost function (first set) for each of the plural available transform sizes in terms of distortion and/or rate . US20030156648A1 CLAIM 33 . The computer-readable medium of claim 29 wherein the method further comprises selecting one or more transform switch levels based at least in part upon results of the evaluating to trade off rate-distortion performance (prediction coding, prediction signal, information samples using prediction coding) and control overhead . US20030156648A1 CLAIM 37 . In a computer system , a computer-implemented method of processing one or more video frames , the method comprising : switching transform sizes from among plural available transform sizes for data for the one or more video frames , wherein bitstream syntax allows the switching at plural different bit (data stream) stream levels for the one or more video frames ; and processing the data for the one or more video frames with one or more transforms of switched transform size . US20030156648A1 CLAIM 46 . A video encoder (second subdivision, second subset, second subdivision information) comprising : means for switching frequency transform sizes from among plural available frequency transform sizes for prediction residual data for one or more motion-predicted video frames , wherein bitstream syntax allows the switching at plural different bitstream levels for the one or more motion-predicted video frames ; and means for processing the prediction residual data with one or more frequency transforms of switched frequency transform size .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set (cost function) of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (video encoder) information and a maximum hierarchy level ; encoding the array of information samples using prediction coding (rate-distortion performance) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream (different bit) the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20030156648A1 CLAIM 31 . The computer-readable medium of claim 29 wherein the evaluating comprises computing values for a cost function (first set) for each of the plural available transform sizes in terms of distortion and/or rate . US20030156648A1 CLAIM 33 . The computer-readable medium of claim 29 wherein the method further comprises selecting one or more transform switch levels based at least in part upon results of the evaluating to trade off rate-distortion performance (prediction coding, prediction signal, information samples using prediction coding) and control overhead . US20030156648A1 CLAIM 37 . In a computer system , a computer-implemented method of processing one or more video frames , the method comprising : switching transform sizes from among plural available transform sizes for data for the one or more video frames , wherein bitstream syntax allows the switching at plural different bit (data stream) stream levels for the one or more video frames ; and processing the data for the one or more video frames with one or more transforms of switched transform size . US20030156648A1 CLAIM 46 . A video encoder (second subdivision, second subset, second subdivision information) comprising : means for switching frequency transform sizes from among plural available frequency transform sizes for prediction residual data for one or more motion-predicted video frames , wherein bitstream syntax allows the switching at plural different bitstream levels for the one or more motion-predicted video frames ; and means for processing the prediction residual data with one or more frequency transforms of switched frequency transform size .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	CN101448162A Filed: 2002-12-16 Issued: 2009-06-03 处理视频图像的方法 (Original Assignee) 微软公司 S·斯里尼瓦杉, P·苏
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root (中的一个) region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN101448162A CLAIM 12 . 在计算机系统中，一种处理一个或多个视频图像的计算机实现的方法，其特征在于，所述方法包括：从一组多个可用的编码模式中选择一编码模式；以及对于一个或多个视频图像中P图像的多个预测宏块根据所选择的编码模式处理跳过信息，其中跳过信息指示P图像的多个预测宏块是被跳过还是不被跳过，并且如果满足以下条件，P图像的多个预测宏块中的一个 (respective root) 预测宏块被跳过：所述预测宏块使用基于P图像中一个或多个其它宏块的运动的预测运动；且所述预测宏块没有剩余信息。
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset (码模式中选) of the second set of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	CN101448162A CLAIM 1 . 在计算机系统中，一种对一个或多个视频帧解码的计算机实现的方法，其特征在于，所述方法包括：接收比特流中压缩的视频信息；以及对视频帧解码，包括：从一组多个可用的编码模式中选 (neighboring subset) 择一编码模式；以及如果所选择的编码模式是低等待时间模式，对于视频帧的多个宏块的每一个，使用用于宏块的宏块层语法元素来确定宏块的二进制信息；否则，根据所选择的编码模式使用帧层编码的位平面数据来对位平面解码，其中位平面指示视频帧的多个宏块各自的二进制信息，二进制信息表示视频帧的多个宏块的特征，并且二进制信息包括用于视频帧的多个宏块的每一个的一个二进制码元。
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision information includes a partition indication flag (还包括一个, 信息指示) indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level is sub-divided .	CN101448162A CLAIM 8 . 如权利要求1、 2、 4、 5中任一项所述的方法，其特征在于，所述一组多个可用的编码模式还包括一个 (partition indication flag) 或多个矢量可变长度编码模式。 CN101448162A CLAIM 12 . 在计算机系统中，一种处理一个或多个视频图像的计算机实现的方法，其特征在于，所述方法包括：从一组多个可用的编码模式中选择一编码模式；以及对于一个或多个视频图像中P图像的多个预测宏块根据所选择的编码模式处理跳过信息，其中跳过信息指示 (partition indication flag) P图像的多个预测宏块是被跳过还是不被跳过，并且如果满足以下条件，P图像的多个预测宏块中的一个预测宏块被跳过：所述预测宏块使用基于P图像中一个或多个其它宏块的运动的预测运动；且所述预测宏块没有剩余信息。
US10250913B2 CLAIM 11 . The decoder according to claim 1 , wherein the recursive multi-tree partitioning includes a quadtree partitioning (块信息) technique .	CN101448162A CLAIM 10 . 如权利要求l、 2、 4、 5中任一项所述的方法，其特征在于，所述二进制信息包括跳过宏块信息 (quadtree partitioning, quadtree partitioning technique) 、运动矢量计数信息或半帧/帧标志。
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root (中的一个) region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	CN101448162A CLAIM 12 . 在计算机系统中，一种处理一个或多个视频图像的计算机实现的方法，其特征在于，所述方法包括：从一组多个可用的编码模式中选择一编码模式；以及对于一个或多个视频图像中P图像的多个预测宏块根据所选择的编码模式处理跳过信息，其中跳过信息指示P图像的多个预测宏块是被跳过还是不被跳过，并且如果满足以下条件，P图像的多个预测宏块中的一个 (respective root) 预测宏块被跳过：所述预测宏块使用基于P图像中一个或多个其它宏块的运动的预测运动；且所述预测宏块没有剩余信息。
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root (中的一个) region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator (视频信) configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN101448162A CLAIM 1 . 在计算机系统中，一种对一个或多个视频帧解码的计算机实现的方法，其特征在于，所述方法包括：接收比特流中压缩的视频信 (data stream generator) 息；以及对视频帧解码，包括：从一组多个可用的编码模式中选择一编码模式；以及如果所选择的编码模式是低等待时间模式，对于视频帧的多个宏块的每一个，使用用于宏块的宏块层语法元素来确定宏块的二进制信息；否则，根据所选择的编码模式使用帧层编码的位平面数据来对位平面解码，其中位平面指示视频帧的多个宏块各自的二进制信息，二进制信息表示视频帧的多个宏块的特征，并且二进制信息包括用于视频帧的多个宏块的每一个的一个二进制码元。 CN101448162A CLAIM 12 . 在计算机系统中，一种处理一个或多个视频图像的计算机实现的方法，其特征在于，所述方法包括：从一组多个可用的编码模式中选择一编码模式；以及对于一个或多个视频图像中P图像的多个预测宏块根据所选择的编码模式处理跳过信息，其中跳过信息指示P图像的多个预测宏块是被跳过还是不被跳过，并且如果满足以下条件，P图像的多个预测宏块中的一个 (respective root) 预测宏块被跳过：所述预测宏块使用基于P图像中一个或多个其它宏块的运动的预测运动；且所述预测宏块没有剩余信息。
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root (中的一个) region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	CN101448162A CLAIM 12 . 在计算机系统中，一种处理一个或多个视频图像的计算机实现的方法，其特征在于，所述方法包括：从一组多个可用的编码模式中选择一编码模式；以及对于一个或多个视频图像中P图像的多个预测宏块根据所选择的编码模式处理跳过信息，其中跳过信息指示P图像的多个预测宏块是被跳过还是不被跳过，并且如果满足以下条件，P图像的多个预测宏块中的一个 (respective root) 预测宏块被跳过：所述预测宏块使用基于P图像中一个或多个其它宏块的运动的预测运动；且所述预测宏块没有剩余信息。

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20050018770A1 Filed: 2002-12-14 Issued: 2005-01-27 Transcoding mpeg bittstreams for adding sub-picture content (Original Assignee) Thomson Licensing SAS (Current Assignee) Thomson Licensing SAS Dirk Adolph, Ralf Ostermann
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples (bus interface) representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20050018770A1 CLAIM 15 . Device according to claim 14 , wherein the means for sorting the MPEG2 transport packets in bus packets are included in a IEEE1394 bus interface (information samples) .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples (bus interface) into the first set of root regions such that the first set of root regions are rectangular blocks of a size determined by the first maximum region size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	US20050018770A1 CLAIM 15 . Device according to claim 14 , wherein the means for sorting the MPEG2 transport packets in bus packets are included in a IEEE1394 bus interface (information samples) .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples (bus interface) , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20050018770A1 CLAIM 15 . Device according to claim 14 , wherein the means for sorting the MPEG2 transport packets in bus packets are included in a IEEE1394 bus interface (information samples) .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples (bus interface) from the data stream , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	US20050018770A1 CLAIM 15 . Device according to claim 14 , wherein the means for sorting the MPEG2 transport packets in bus packets are included in a IEEE1394 bus interface (information samples) .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples (bus interface) representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20050018770A1 CLAIM 15 . Device according to claim 14 , wherein the means for sorting the MPEG2 transport packets in bus packets are included in a IEEE1394 bus interface (information samples) .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples (bus interface) representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20050018770A1 CLAIM 15 . Device according to claim 14 , wherein the means for sorting the MPEG2 transport packets in bus packets are included in a IEEE1394 bus interface (information samples) .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples (bus interface) representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20050018770A1 CLAIM 15 . Device according to claim 14 , wherein the means for sorting the MPEG2 transport packets in bus packets are included in a IEEE1394 bus interface (information samples) .
US10250913B2 CLAIM 15 . A non-transitory computer readable digital storage (said video) medium having stored thereon a computer program having a program code for performing , when running on a computer , a method according to claim 12 .	US20050018770A1 CLAIM 8 . Device for merging encoded video picture data from a transport stream including an encoded video bitstream and an encoded sub-picture bitstream , comprising , decoding means for digitally decoding said video (readable digital storage) and sub-picture bitstream , adding means for merging decoded video and sub-picture data and encoding means for digitally encoding said merged video and sub-picture data to generate a new video bitstream .
US10250913B2 CLAIM 16 . A non-transitory computer readable digital storage (said video) medium having stored thereon a computer program having a program code for performing , when running on a computer , a method according to claim 14 .	US20050018770A1 CLAIM 8 . Device for merging encoded video picture data from a transport stream including an encoded video bitstream and an encoded sub-picture bitstream , comprising , decoding means for digitally decoding said video (readable digital storage) and sub-picture bitstream , adding means for merging decoded video and sub-picture data and encoding means for digitally encoding said merged video and sub-picture data to generate a new video bitstream .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	JP2004135252A Filed: 2002-10-09 Issued: 2004-04-30 符号化処理方法、符号化装置及び復号化装置 (Original Assignee) Sony Corp; ソニー株式会社 Kazufumi Sato, Teruhiko Suzuki, Yoichi Yagasaki, 佐藤　数史, 矢ケ崎　陽一, 鈴木　輝彦
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information (データ) , information related to first and second maximum region sizes , first and second subdivision (ブロック) information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	JP2004135252A CLAIM 1 画素ブロック (second subdivision) について所定の区割パターンが指定されることにより得られる区割領域と、当該区割領域に対する予測モードとの組み合わせを表すマクロブロックタイプに対して２値算術符号化処理を施す符号化処理方法であって、上記マクロブロックタイプの種類ごとにそれぞれ割り当てられたコード番号に、２値コードを適用する２値コード適用ステップと、上記コード番号の割り当てを、量子化パラメータ値に応じて切り換える切換ステップとを具えることを特徴とする符号化処理方法。 JP2004135252A CLAIM 2 上記量子化パラメータ値は、最も小さい最小区割領域の発生頻度と、当該最小区割領域に係るマクロブロックタイプに割り当てられたコード番号に対する上記２値コードのデータ (video information) 長とにおける増減の相関関係がほぼ中間となる値であることを特徴とする請求項１に記載の符号化処理方法。
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal based on an intra-prediction mode (予測モード) associated with the sub-region and reconstructed samples of a neighboring subset of the second set of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	JP2004135252A CLAIM 1 画素ブロックについて所定の区割パターンが指定されることにより得られる区割領域と、当該区割領域に対する予測モード (intra-prediction mode) との組み合わせを表すマクロブロックタイプに対して２値算術符号化処理を施す符号化処理方法であって、上記マクロブロックタイプの種類ごとにそれぞれ割り当てられたコード番号に、２値コードを適用する２値コード適用ステップと、上記コード番号の割り当てを、量子化パラメータ値に応じて切り換える切換ステップとを具えることを特徴とする符号化処理方法。
US10250913B2 CLAIM 11 . The decoder according to claim 1 , wherein the recursive multi-tree partitioning includes a quadtree partitioning (量子化パラメータ値) technique .	JP2004135252A CLAIM 1 画素ブロックについて所定の区割パターンが指定されることにより得られる区割領域と、当該区割領域に対する予測モードとの組み合わせを表すマクロブロックタイプに対して２値算術符号化処理を施す符号化処理方法であって、上記マクロブロックタイプの種類ごとにそれぞれ割り当てられたコード番号に、２値コードを適用する２値コード適用ステップと、上記コード番号の割り当てを、量子化パラメータ値 (quadtree partitioning, quadtree partitioning technique) に応じて切り換える切換ステップとを具えることを特徴とする符号化処理方法。
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information (データ) , information related to first and second maximum region sizes , first and second subdivision (ブロック) information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	JP2004135252A CLAIM 1 画素ブロック (second subdivision) について所定の区割パターンが指定されることにより得られる区割領域と、当該区割領域に対する予測モードとの組み合わせを表すマクロブロックタイプに対して２値算術符号化処理を施す符号化処理方法であって、上記マクロブロックタイプの種類ごとにそれぞれ割り当てられたコード番号に、２値コードを適用する２値コード適用ステップと、上記コード番号の割り当てを、量子化パラメータ値に応じて切り換える切換ステップとを具えることを特徴とする符号化処理方法。 JP2004135252A CLAIM 2 上記量子化パラメータ値は、最も小さい最小区割領域の発生頻度と、当該最小区割領域に係るマクロブロックタイプに割り当てられたコード番号に対する上記２値コードのデータ (video information) 長とにおける増減の相関関係がほぼ中間となる値であることを特徴とする請求項１に記載の符号化処理方法。
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information (データ) into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (ブロック) information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	JP2004135252A CLAIM 1 画素ブロック (second subdivision) について所定の区割パターンが指定されることにより得られる区割領域と、当該区割領域に対する予測モードとの組み合わせを表すマクロブロックタイプに対して２値算術符号化処理を施す符号化処理方法であって、上記マクロブロックタイプの種類ごとにそれぞれ割り当てられたコード番号に、２値コードを適用する２値コード適用ステップと、上記コード番号の割り当てを、量子化パラメータ値に応じて切り換える切換ステップとを具えることを特徴とする符号化処理方法。 JP2004135252A CLAIM 2 上記量子化パラメータ値は、最も小さい最小区割領域の発生頻度と、当該最小区割領域に係るマクロブロックタイプに割り当てられたコード番号に対する上記２値コードのデータ (video information) 長とにおける増減の相関関係がほぼ中間となる値であることを特徴とする請求項１に記載の符号化処理方法。
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information (データ) into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (ブロック) information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	JP2004135252A CLAIM 1 画素ブロック (second subdivision) について所定の区割パターンが指定されることにより得られる区割領域と、当該区割領域に対する予測モードとの組み合わせを表すマクロブロックタイプに対して２値算術符号化処理を施す符号化処理方法であって、上記マクロブロックタイプの種類ごとにそれぞれ割り当てられたコード番号に、２値コードを適用する２値コード適用ステップと、上記コード番号の割り当てを、量子化パラメータ値に応じて切り換える切換ステップとを具えることを特徴とする符号化処理方法。 JP2004135252A CLAIM 2 上記量子化パラメータ値は、最も小さい最小区割領域の発生頻度と、当該最小区割領域に係るマクロブロックタイプに割り当てられたコード番号に対する上記２値コードのデータ (video information) 長とにおける増減の相関関係がほぼ中間となる値であることを特徴とする請求項１に記載の符号化処理方法。
US10250913B2 CLAIM 15 . A non-transitory computer readable digital storage medium having stored thereon a computer program having a program code (上記コード) for performing , when running on a computer , a method according to claim 12 .	JP2004135252A CLAIM 1 画素ブロックについて所定の区割パターンが指定されることにより得られる区割領域と、当該区割領域に対する予測モードとの組み合わせを表すマクロブロックタイプに対して２値算術符号化処理を施す符号化処理方法であって、上記マクロブロックタイプの種類ごとにそれぞれ割り当てられたコード番号に、２値コードを適用する２値コード適用ステップと、上記コード (program code) 番号の割り当てを、量子化パラメータ値に応じて切り換える切換ステップとを具えることを特徴とする符号化処理方法。
US10250913B2 CLAIM 16 . A non-transitory computer readable digital storage medium having stored thereon a computer program having a program code (上記コード) for performing , when running on a computer , a method according to claim 14 .	JP2004135252A CLAIM 1 画素ブロックについて所定の区割パターンが指定されることにより得られる区割領域と、当該区割領域に対する予測モードとの組み合わせを表すマクロブロックタイプに対して２値算術符号化処理を施す符号化処理方法であって、上記マクロブロックタイプの種類ごとにそれぞれ割り当てられたコード番号に、２値コードを適用する２値コード適用ステップと、上記コード (program code) 番号の割り当てを、量子化パラメータ値に応じて切り換える切換ステップとを具えることを特徴とする符号化処理方法。

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20030021485A1 Filed: 2002-06-26 Issued: 2003-01-30 Apparatus and method for encoding digital image data in a lossless manner (Original Assignee) Qualcomm Inc (Current Assignee) Qualcomm Inc Vijayalakshmi Raveendran, Kadayam Thyagarajan, John Ratzel, Steven Morley
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information (frame basis) , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding (encoding signal) and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20030021485A1 CLAIM 1 . A method of losslessly compressing and encoding signal (prediction coding) s representing an image , the method comprising : generating a lossy compressed data file ; generating a residual compressed data file ; and combining the lossy data file with the residual data file to create a lossless data file , wherein the lossless data file is substantially identical to the original data file . US20030021485A1 CLAIM 2 . The method as set forth in claim 1 , wherein the lossy compressed data file and the residual compressed data file are generated on an intraframe basis (second subdivision information, information samples using prediction coding) .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level (discrete cosine transform) according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20030021485A1 CLAIM 4 . The method set forth in claim 1 , wherein generating utilizes a combination of discrete cosine transform (first hierarchy level) (DCT) and discrete quadtree transform (DQT) techniques .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision (residual data) of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20030021485A1 CLAIM 1 . A method of losslessly compressing and encoding signals representing an image , the method comprising : generating a lossy compressed data file ; generating a residual compressed data file ; and combining the lossy data file with the residual data (intermediate subdivision) file to create a lossless data file , wherein the lossless data file is substantially identical to the original data file .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information (frame basis) , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding (encoding signal) and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20030021485A1 CLAIM 1 . A method of losslessly compressing and encoding signal (prediction coding) s representing an image , the method comprising : generating a lossy compressed data file ; generating a residual compressed data file ; and combining the lossy data file with the residual data file to create a lossless data file , wherein the lossless data file is substantially identical to the original data file . US20030021485A1 CLAIM 2 . The method as set forth in claim 1 , wherein the lossy compressed data file and the residual compressed data file are generated on an intraframe basis (second subdivision information, information samples using prediction coding) .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information (frame basis) and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding (encoding signal) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20030021485A1 CLAIM 1 . A method of losslessly compressing and encoding signal (prediction coding) s representing an image , the method comprising : generating a lossy compressed data file ; generating a residual compressed data file ; and combining the lossy data file with the residual data file to create a lossless data file , wherein the lossless data file is substantially identical to the original data file . US20030021485A1 CLAIM 2 . The method as set forth in claim 1 , wherein the lossy compressed data file and the residual compressed data file are generated on an intraframe basis (second subdivision information, information samples using prediction coding) .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information (frame basis) and a maximum hierarchy level ; encoding the array of information samples using prediction coding (encoding signal) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20030021485A1 CLAIM 1 . A method of losslessly compressing and encoding signal (prediction coding) s representing an image , the method comprising : generating a lossy compressed data file ; generating a residual compressed data file ; and combining the lossy data file with the residual data file to create a lossless data file , wherein the lossless data file is substantially identical to the original data file . US20030021485A1 CLAIM 2 . The method as set forth in claim 1 , wherein the lossy compressed data file and the residual compressed data file are generated on an intraframe basis (second subdivision information, information samples using prediction coding) .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20030076881A1 Filed: 2002-04-24 Issued: 2003-04-24 Method and apparatus for coding and decoding image data (Original Assignee) Monolith Co Ltd (Current Assignee) Monolith Co Ltd Kozo Akiyoshi, Nobuo Akiyoshi, Yoshihisa Shinagawa
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information (acquired image) , and a maximum hierarchy level wherein the first maximum region size and the first subdivision (frame region) information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding (independent frames) ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set (second function) of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20030076881A1 CLAIM 7 . An image data coding apparatus , comprising : a unit which acquires image data that includes a plurality of frames ; a unit which computes a primary matching between first and second key frames included in the acquired image (second subdivision information) data ; a unit which generates a virtual third key frame based on a result of the primary matching ; a unit which codes an actual third key frame by utilizing the virtual third key frame ; and a unit which computes a secondary matching between adjacent key frames among the first , second and actual third key frames . US20030076881A1 CLAIM 34 . An image data coding apparatus , comprising : a first functional block which acquires a virtual key frame generated based on a result of a matching performed between key frames included in image data ; and a second function (first set) al block which codes an actual key frame included in the image data , by utilizing the virtual key frame . US20030076881A1 CLAIM 48 . A coded image data structure , comprising : an index region which identifies image data ; a reference data region which includes data used in a decoding processing ; an independent frame data region which includes data relating to independent frames (transform coding) which are decoded independent of other frames ; and a coded frame region (first subdivision) which includes data related to dependent frames which are decoded depending on other frames , wherein said regions are integrated to form the coded image data .
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set (second function) of sub-regions : compute a prediction signal based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset of the second set of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	US20030076881A1 CLAIM 34 . An image data coding apparatus , comprising : a first functional block which acquires a virtual key frame generated based on a result of a matching performed between key frames included in image data ; and a second function (first set) al block which codes an actual key frame included in the image data , by utilizing the virtual key frame .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set (second function) of root regions such that the first set of root regions are rectangular blocks of a size determined by the first maximum region size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	US20030076881A1 CLAIM 34 . An image data coding apparatus , comprising : a first functional block which acquires a virtual key frame generated based on a result of a matching performed between key frames included in image data ; and a second function (first set) al block which codes an actual key frame included in the image data , by utilizing the virtual key frame .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set (second function) of root regions , determine whether the first subdivision (frame region) information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20030076881A1 CLAIM 34 . An image data coding apparatus , comprising : a first functional block which acquires a virtual key frame generated based on a result of a matching performed between key frames included in image data ; and a second function (first set) al block which codes an actual key frame included in the image data , by utilizing the virtual key frame . US20030076881A1 CLAIM 48 . A coded image data structure , comprising : an index region which identifies image data ; a reference data region which includes data used in a decoding processing ; an independent frame data region which includes data relating to independent frames which are decoded independent of other frames ; and a coded frame region (first subdivision) which includes data related to dependent frames which are decoded depending on other frames , wherein said regions are integrated to form the coded image data .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision (frame region) information includes a partition indication flag indicating whether any of the first set (second function) of root regions or the sub-regions at the first or higher-order hierarchy level is sub-divided .	US20030076881A1 CLAIM 34 . An image data coding apparatus , comprising : a first functional block which acquires a virtual key frame generated based on a result of a matching performed between key frames included in image data ; and a second function (first set) al block which codes an actual key frame included in the image data , by utilizing the virtual key frame . US20030076881A1 CLAIM 48 . A coded image data structure , comprising : an index region which identifies image data ; a reference data region which includes data used in a decoding processing ; an independent frame data region which includes data relating to independent frames which are decoded independent of other frames ; and a coded frame region (first subdivision) which includes data related to dependent frames which are decoded depending on other frames , wherein said regions are integrated to form the coded image data .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision (frame region) information , spatially neighboring ones of the first set (second function) of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20030076881A1 CLAIM 34 . An image data coding apparatus , comprising : a first functional block which acquires a virtual key frame generated based on a result of a matching performed between key frames included in image data ; and a second function (first set) al block which codes an actual key frame included in the image data , by utilizing the virtual key frame . US20030076881A1 CLAIM 48 . A coded image data structure , comprising : an index region which identifies image data ; a reference data region which includes data used in a decoding processing ; an independent frame data region which includes data relating to independent frames which are decoded independent of other frames ; and a coded frame region (first subdivision) which includes data related to dependent frames which are decoded depending on other frames , wherein said regions are integrated to form the coded image data .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding (independent frames) to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	US20030076881A1 CLAIM 48 . A coded image data structure , comprising : an index region which identifies image data ; a reference data region which includes data used in a decoding processing ; an independent frame data region which includes data relating to independent frames (transform coding) which are decoded independent of other frames ; and a coded frame region which includes data related to dependent frames which are decoded depending on other frames , wherein said regions are integrated to form the coded image data .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information (acquired image) , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision (frame region) information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding (independent frames) ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set (second function) of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20030076881A1 CLAIM 7 . An image data coding apparatus , comprising : a unit which acquires image data that includes a plurality of frames ; a unit which computes a primary matching between first and second key frames included in the acquired image (second subdivision information) data ; a unit which generates a virtual third key frame based on a result of the primary matching ; a unit which codes an actual third key frame by utilizing the virtual third key frame ; and a unit which computes a secondary matching between adjacent key frames among the first , second and actual third key frames . US20030076881A1 CLAIM 34 . An image data coding apparatus , comprising : a first functional block which acquires a virtual key frame generated based on a result of a matching performed between key frames included in image data ; and a second function (first set) al block which codes an actual key frame included in the image data , by utilizing the virtual key frame . US20030076881A1 CLAIM 48 . A coded image data structure , comprising : an index region which identifies image data ; a reference data region which includes data used in a decoding processing ; an independent frame data region which includes data relating to independent frames (transform coding) which are decoded independent of other frames ; and a coded frame region (first subdivision) which includes data related to dependent frames which are decoded depending on other frames , wherein said regions are integrated to form the coded image data .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set (second function) of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision (frame region) information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information (acquired image) and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding (independent frames) in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20030076881A1 CLAIM 7 . An image data coding apparatus , comprising : a unit which acquires image data that includes a plurality of frames ; a unit which computes a primary matching between first and second key frames included in the acquired image (second subdivision information) data ; a unit which generates a virtual third key frame based on a result of the primary matching ; a unit which codes an actual third key frame by utilizing the virtual third key frame ; and a unit which computes a secondary matching between adjacent key frames among the first , second and actual third key frames . US20030076881A1 CLAIM 34 . An image data coding apparatus , comprising : a first functional block which acquires a virtual key frame generated based on a result of a matching performed between key frames included in image data ; and a second function (first set) al block which codes an actual key frame included in the image data , by utilizing the virtual key frame . US20030076881A1 CLAIM 48 . A coded image data structure , comprising : an index region which identifies image data ; a reference data region which includes data used in a decoding processing ; an independent frame data region which includes data relating to independent frames (transform coding) which are decoded independent of other frames ; and a coded frame region (first subdivision) which includes data related to dependent frames which are decoded depending on other frames , wherein said regions are integrated to form the coded image data .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set (second function) of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision (frame region) information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information (acquired image) and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding (independent frames) in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20030076881A1 CLAIM 7 . An image data coding apparatus , comprising : a unit which acquires image data that includes a plurality of frames ; a unit which computes a primary matching between first and second key frames included in the acquired image (second subdivision information) data ; a unit which generates a virtual third key frame based on a result of the primary matching ; a unit which codes an actual third key frame by utilizing the virtual third key frame ; and a unit which computes a secondary matching between adjacent key frames among the first , second and actual third key frames . US20030076881A1 CLAIM 34 . An image data coding apparatus , comprising : a first functional block which acquires a virtual key frame generated based on a result of a matching performed between key frames included in image data ; and a second function (first set) al block which codes an actual key frame included in the image data , by utilizing the virtual key frame . US20030076881A1 CLAIM 48 . A coded image data structure , comprising : an index region which identifies image data ; a reference data region which includes data used in a decoding processing ; an independent frame data region which includes data relating to independent frames (transform coding) which are decoded independent of other frames ; and a coded frame region (first subdivision) which includes data related to dependent frames which are decoded depending on other frames , wherein said regions are integrated to form the coded image data .
US10250913B2 CLAIM 15 . A non-transitory computer readable digital storage medium having stored thereon a computer program (computer program) having a program code for performing , when running on a computer , a method according to claim 12 .	US20030076881A1 CLAIM 19 . A computer program (computer program) executable by a computer , the program comprising the functions of : computing a primary matching between a first key frame and a second key frame included in the image data ; generating a virtual third key frame based on a result of the primary matching ; coding an actual third key frame included in the image data , by utilizing the virtual third key frame ; and computing a secondary matching between adjacent key frames among the first , second and actual third key frames .
US10250913B2 CLAIM 16 . A non-transitory computer readable digital storage medium having stored thereon a computer program (computer program) having a program code for performing , when running on a computer , a method according to claim 14 .	US20030076881A1 CLAIM 19 . A computer program (computer program) executable by a computer , the program comprising the functions of : computing a primary matching between a first key frame and a second key frame included in the image data ; generating a virtual third key frame based on a result of the primary matching ; coding an actual third key frame included in the image data , by utilizing the virtual third key frame ; and computing a secondary matching between adjacent key frames among the first , second and actual third key frames .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20030198290A1 Filed: 2002-04-19 Issued: 2003-10-23 Image encoding system (Original Assignee) Dynamic Digital Depth Pty Ltd (Current Assignee) DYNAMIC DIGITAL DEPTH RESEARCH Pty Ltd ; Dynamic Digital Depth Pty Ltd Andrew Millin, Philip Harman
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream (chrominance components) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level (d line) wherein the first maximum region size (d line) and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20030198290A1 CLAIM 1 . A method of encoding a 2D image with an associated depth map , said 2D image having a plurality of frames making up said 2D image and each frame having a odd and even field , wherein said method (root region) includes the step of recording said associated depth map in at least a portion of said odd or even field . US20030198290A1 CLAIM 4 . The method as claimed in claim 2 , further including the step of interpolating odd line (respective partition, maximum hierarchy level, first maximum region size) s for each frame from image data stored in said even field . US20030198290A1 CLAIM 12 . The method as claimed in claim 1 , further including the step of : copying chrominance components (data stream) of said 2D image into chrominance components of said depth map .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set of root regions such that the first set of root regions are rectangular blocks of a size determined by the first maximum region size (d line) , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	US20030198290A1 CLAIM 4 . The method as claimed in claim 2 , further including the step of interpolating odd line (respective partition, maximum hierarchy level, first maximum region size) s for each frame from image data stored in said even field .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region (said method) into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition (d line) rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level (d line) is reached .	US20030198290A1 CLAIM 1 . A method of encoding a 2D image with an associated depth map , said 2D image having a plurality of frames making up said 2D image and each frame having a odd and even field , wherein said method (root region) includes the step of recording said associated depth map in at least a portion of said odd or even field . US20030198290A1 CLAIM 4 . The method as claimed in claim 2 , further including the step of interpolating odd line (respective partition, maximum hierarchy level, first maximum region size) s for each frame from image data stored in said even field .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level (d line) from the data stream (chrominance components) .	US20030198290A1 CLAIM 4 . The method as claimed in claim 2 , further including the step of interpolating odd line (respective partition, maximum hierarchy level, first maximum region size) s for each frame from image data stored in said even field . US20030198290A1 CLAIM 12 . The method as claimed in claim 1 , further including the step of : copying chrominance components (data stream) of said 2D image into chrominance components of said depth map .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements associated with the first or second set of sub-regions from the data stream (chrominance components) in a depth-first traversal order .	US20030198290A1 CLAIM 12 . The method as claimed in claim 1 , further including the step of : copying chrominance components (data stream) of said 2D image into chrominance components of said depth map .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream (chrominance components) , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20030198290A1 CLAIM 12 . The method as claimed in claim 1 , further including the step of : copying chrominance components (data stream) of said 2D image into chrominance components of said depth map .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream (chrominance components) , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	US20030198290A1 CLAIM 12 . The method as claimed in claim 1 , further including the step of : copying chrominance components (data stream) of said 2D image into chrominance components of said depth map .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream (chrominance components) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level (d line) , wherein the first maximum region size (d line) and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20030198290A1 CLAIM 1 . A method of encoding a 2D image with an associated depth map , said 2D image having a plurality of frames making up said 2D image and each frame having a odd and even field , wherein said method (root region) includes the step of recording said associated depth map in at least a portion of said odd or even field . US20030198290A1 CLAIM 4 . The method as claimed in claim 2 , further including the step of interpolating odd line (respective partition, maximum hierarchy level, first maximum region size) s for each frame from image data stored in said even field . US20030198290A1 CLAIM 12 . The method as claimed in claim 1 , further including the step of : copying chrominance components (data stream) of said 2D image into chrominance components of said depth map .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size (d line) , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level (d line) ; and a data stream (chrominance components) generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20030198290A1 CLAIM 1 . A method of encoding a 2D image with an associated depth map , said 2D image having a plurality of frames making up said 2D image and each frame having a odd and even field , wherein said method (root region) includes the step of recording said associated depth map in at least a portion of said odd or even field . US20030198290A1 CLAIM 4 . The method as claimed in claim 2 , further including the step of interpolating odd line (respective partition, maximum hierarchy level, first maximum region size) s for each frame from image data stored in said even field . US20030198290A1 CLAIM 12 . The method as claimed in claim 1 , further including the step of : copying chrominance components (data stream) of said 2D image into chrominance components of said depth map .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size (d line) ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level (d line) ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream (chrominance components) the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20030198290A1 CLAIM 1 . A method of encoding a 2D image with an associated depth map , said 2D image having a plurality of frames making up said 2D image and each frame having a odd and even field , wherein said method (root region) includes the step of recording said associated depth map in at least a portion of said odd or even field . US20030198290A1 CLAIM 4 . The method as claimed in claim 2 , further including the step of interpolating odd line (respective partition, maximum hierarchy level, first maximum region size) s for each frame from image data stored in said even field . US20030198290A1 CLAIM 12 . The method as claimed in claim 1 , further including the step of : copying chrominance components (data stream) of said 2D image into chrominance components of said depth map .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	KR20030065606A Filed: 2002-01-30 Issued: 2003-08-09 개인 자동독립코드를 이용한 멀티트리구조의 보너스 적립순환 시스템과 그 방법 (Original Assignee) 양송철 양송철, 조재형
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy (최상위) level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	KR20030065606A CLAIM 1 오프라인과 인터넷을 이용한 온라인을 통해 일반회원과 독립 자영사업가인 디스트리뷰터를 연결한 멀티트리구조의 인터넷 전자상거래 쇼핑몰 운영시스템에 있어서 , 온라인 인터넷상에서 다단계 영업을 위한 회원으로 가입하고 , 오프라인 및 온라인에서 제품을 구입시 , 일정하게 지정한 멀티트리구조를 형성시켜 지정된 포인트 적립시 독립코드가 자동적으로 생성되고 유통마진의 일부를 보너스로 회원의 최상위 (maximum hierarchy) 단계인 탑 레벨에 지급하면서 독립코드가 자동적으로 소멸되며 , 상기 영업발명은 온라인 상에서 서버 관리자에 의해 회원관리 프로그램과 결합된 온라인과오프라인상의 개인 독립코드를 이용한 멀티트리구조의 보너스 적립시스템과 그 방법 .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy (최상위) level is reached .	KR20030065606A CLAIM 1 오프라인과 인터넷을 이용한 온라인을 통해 일반회원과 독립 자영사업가인 디스트리뷰터를 연결한 멀티트리구조의 인터넷 전자상거래 쇼핑몰 운영시스템에 있어서 , 온라인 인터넷상에서 다단계 영업을 위한 회원으로 가입하고 , 오프라인 및 온라인에서 제품을 구입시 , 일정하게 지정한 멀티트리구조를 형성시켜 지정된 포인트 적립시 독립코드가 자동적으로 생성되고 유통마진의 일부를 보너스로 회원의 최상위 (maximum hierarchy) 단계인 탑 레벨에 지급하면서 독립코드가 자동적으로 소멸되며 , 상기 영업발명은 온라인 상에서 서버 관리자에 의해 회원관리 프로그램과 결합된 온라인과오프라인상의 개인 독립코드를 이용한 멀티트리구조의 보너스 적립시스템과 그 방법 .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy (최상위) level from the data stream .	KR20030065606A CLAIM 1 오프라인과 인터넷을 이용한 온라인을 통해 일반회원과 독립 자영사업가인 디스트리뷰터를 연결한 멀티트리구조의 인터넷 전자상거래 쇼핑몰 운영시스템에 있어서 , 온라인 인터넷상에서 다단계 영업을 위한 회원으로 가입하고 , 오프라인 및 온라인에서 제품을 구입시 , 일정하게 지정한 멀티트리구조를 형성시켜 지정된 포인트 적립시 독립코드가 자동적으로 생성되고 유통마진의 일부를 보너스로 회원의 최상위 (maximum hierarchy) 단계인 탑 레벨에 지급하면서 독립코드가 자동적으로 소멸되며 , 상기 영업발명은 온라인 상에서 서버 관리자에 의해 회원관리 프로그램과 결합된 온라인과오프라인상의 개인 독립코드를 이용한 멀티트리구조의 보너스 적립시스템과 그 방법 .
US10250913B2 CLAIM 11 . The decoder according to claim 1 , wherein the recursive multi-tree partitioning includes a quadtree partitioning (트리구조를) technique .	KR20030065606A CLAIM 1 오프라인과 인터넷을 이용한 온라인을 통해 일반회원과 독립 자영사업가인 디스트리뷰터를 연결한 멀티트리구조의 인터넷 전자상거래 쇼핑몰 운영시스템에 있어서 , 온라인 인터넷상에서 다단계 영업을 위한 회원으로 가입하고 , 오프라인 및 온라인에서 제품을 구입시 , 일정하게 지정한 멀티트리구조를 (quadtree partitioning) 형성시켜 지정된 포인트 적립시 독립코드가 자동적으로 생성되고 유통마진의 일부를 보너스로 회원의 최상위 단계인 탑 레벨에 지급하면서 독립코드가 자동적으로 소멸되며 , 상기 영업발명은 온라인 상에서 서버 관리자에 의해 회원관리 프로그램과 결합된 온라인과오프라인상의 개인 독립코드를 이용한 멀티트리구조의 보너스 적립시스템과 그 방법 .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy (최상위) level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	KR20030065606A CLAIM 1 오프라인과 인터넷을 이용한 온라인을 통해 일반회원과 독립 자영사업가인 디스트리뷰터를 연결한 멀티트리구조의 인터넷 전자상거래 쇼핑몰 운영시스템에 있어서 , 온라인 인터넷상에서 다단계 영업을 위한 회원으로 가입하고 , 오프라인 및 온라인에서 제품을 구입시 , 일정하게 지정한 멀티트리구조를 형성시켜 지정된 포인트 적립시 독립코드가 자동적으로 생성되고 유통마진의 일부를 보너스로 회원의 최상위 (maximum hierarchy) 단계인 탑 레벨에 지급하면서 독립코드가 자동적으로 소멸되며 , 상기 영업발명은 온라인 상에서 서버 관리자에 의해 회원관리 프로그램과 결합된 온라인과오프라인상의 개인 독립코드를 이용한 멀티트리구조의 보너스 적립시스템과 그 방법 .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy (최상위) level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	KR20030065606A CLAIM 1 오프라인과 인터넷을 이용한 온라인을 통해 일반회원과 독립 자영사업가인 디스트리뷰터를 연결한 멀티트리구조의 인터넷 전자상거래 쇼핑몰 운영시스템에 있어서 , 온라인 인터넷상에서 다단계 영업을 위한 회원으로 가입하고 , 오프라인 및 온라인에서 제품을 구입시 , 일정하게 지정한 멀티트리구조를 형성시켜 지정된 포인트 적립시 독립코드가 자동적으로 생성되고 유통마진의 일부를 보너스로 회원의 최상위 (maximum hierarchy) 단계인 탑 레벨에 지급하면서 독립코드가 자동적으로 소멸되며 , 상기 영업발명은 온라인 상에서 서버 관리자에 의해 회원관리 프로그램과 결합된 온라인과오프라인상의 개인 독립코드를 이용한 멀티트리구조의 보너스 적립시스템과 그 방법 .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy (최상위) level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	KR20030065606A CLAIM 1 오프라인과 인터넷을 이용한 온라인을 통해 일반회원과 독립 자영사업가인 디스트리뷰터를 연결한 멀티트리구조의 인터넷 전자상거래 쇼핑몰 운영시스템에 있어서 , 온라인 인터넷상에서 다단계 영업을 위한 회원으로 가입하고 , 오프라인 및 온라인에서 제품을 구입시 , 일정하게 지정한 멀티트리구조를 형성시켜 지정된 포인트 적립시 독립코드가 자동적으로 생성되고 유통마진의 일부를 보너스로 회원의 최상위 (maximum hierarchy) 단계인 탑 레벨에 지급하면서 독립코드가 자동적으로 소멸되며 , 상기 영업발명은 온라인 상에서 서버 관리자에 의해 회원관리 프로그램과 결합된 온라인과오프라인상의 개인 독립코드를 이용한 멀티트리구조의 보너스 적립시스템과 그 방법 .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20030156652A1 Filed: 2001-10-10 Issued: 2003-08-21 Multistandard video decoder and decompression system for processing encoded bit streams including a video formatter and methods relating thereto (Original Assignee) Wise Adrian P.; Sotheran Martin W.; Robbins William P.; Jones Anthony M.; Finch Helen R.; Boyd Kevin J.; Claydon Anthony Peter J. (Current Assignee) Chartoleaux KG LLC Adrian Wise, Martin Sotheran, William Robbins, Anthony Jones, Helen Finch, Kevin Boyd, Anthony Peter Claydon
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information (second video data, first video data) , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set (first set) of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set (second set) of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20030156652A1 CLAIM 9 . A method of processing video data , the method comprising : receiving a first set (first set) of video data encoded in accordance with a first video standard and having a first start code defined by the first video standard ; determining the video standard of the first set of video data by identifying the first start code included in the first set of video data ; processing the first set of video data in accordance with a first video standard ; receiving a second set (second set) of video data encoded in accordance with a second video standard and having a second start code defined by the second video standard ; determining the video standard of the second set of video data by identifying the second start code included in the second set of video data ; and processing the second set of video data in accordance with the second video standard . US20030156652A1 CLAIM 22 . A method of processing video data , the method comprising : receiving a first video data (video information) code or marker corresponding to a first video standard ; searching video data for the received video code or marker ; receiving a second video data (video information) code or marker corresponding to a second video standard ; and searching video data for the second video data code or marker .
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set (first set) of sub-regions : compute a prediction signal based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset of the second set (second set) of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	US20030156652A1 CLAIM 9 . A method of processing video data , the method comprising : receiving a first set (first set) of video data encoded in accordance with a first video standard and having a first start code defined by the first video standard ; determining the video standard of the first set of video data by identifying the first start code included in the first set of video data ; processing the first set of video data in accordance with a first video standard ; receiving a second set (second set) of video data encoded in accordance with a second video standard and having a second start code defined by the second video standard ; determining the video standard of the second set of video data by identifying the second start code included in the second set of video data ; and processing the second set of video data in accordance with the second video standard .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set (first set) of root regions such that the first set of root regions are rectangular blocks of a size determined by the first maximum region size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	US20030156652A1 CLAIM 9 . A method of processing video data , the method comprising : receiving a first set (first set) of video data encoded in accordance with a first video standard and having a first start code defined by the first video standard ; determining the video standard of the first set of video data by identifying the first start code included in the first set of video data ; processing the first set of video data in accordance with a first video standard ; receiving a second set of video data encoded in accordance with a second video standard and having a second start code defined by the second video standard ; determining the video standard of the second set of video data by identifying the second start code included in the second set of video data ; and processing the second set of video data in accordance with the second video standard .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set (first set) of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level (discrete cosine transform) according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20030156652A1 CLAIM 9 . A method of processing video data , the method comprising : receiving a first set (first set) of video data encoded in accordance with a first video standard and having a first start code defined by the first video standard ; determining the video standard of the first set of video data by identifying the first start code included in the first set of video data ; processing the first set of video data in accordance with a first video standard ; receiving a second set of video data encoded in accordance with a second video standard and having a second start code defined by the second video standard ; determining the video standard of the second set of video data by identifying the second start code included in the second set of video data ; and processing the second set of video data in accordance with the second video standard . US20030156652A1 CLAIM 32 . The method of claim 25 wherein the pipeline comprises instructions for an inverse discrete cosine transform (first hierarchy level) upon a portion of the received video data .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision information includes a partition indication flag indicating whether any of the first set (first set) of root regions or the sub-regions at the first or higher-order hierarchy level is sub-divided .	US20030156652A1 CLAIM 9 . A method of processing video data , the method comprising : receiving a first set (first set) of video data encoded in accordance with a first video standard and having a first start code defined by the first video standard ; determining the video standard of the first set of video data by identifying the first start code included in the first set of video data ; processing the first set of video data in accordance with a first video standard ; receiving a second set of video data encoded in accordance with a second video standard and having a second start code defined by the second video standard ; determining the video standard of the second set of video data by identifying the second start code included in the second set of video data ; and processing the second set of video data in accordance with the second video standard .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements associated with the first or second set (second set) of sub-regions from the data stream in a depth-first traversal order .	US20030156652A1 CLAIM 9 . A method of processing video data , the method comprising : receiving a first set of video data encoded in accordance with a first video standard and having a first start code defined by the first video standard ; determining the video standard of the first set of video data by identifying the first start code included in the first set of video data ; processing the first set of video data in accordance with a first video standard ; receiving a second set (second set) of video data encoded in accordance with a second video standard and having a second start code defined by the second video standard ; determining the video standard of the second set of video data by identifying the second start code included in the second set of video data ; and processing the second set of video data in accordance with the second video standard .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set (first set) of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20030156652A1 CLAIM 9 . A method of processing video data , the method comprising : receiving a first set (first set) of video data encoded in accordance with a first video standard and having a first start code defined by the first video standard ; determining the video standard of the first set of video data by identifying the first start code included in the first set of video data ; processing the first set of video data in accordance with a first video standard ; receiving a second set of video data encoded in accordance with a second video standard and having a second start code defined by the second video standard ; determining the video standard of the second set of video data by identifying the second start code included in the second set of video data ; and processing the second set of video data in accordance with the second video standard .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information (second video data, first video data) , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set (first set) of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set (second set) of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20030156652A1 CLAIM 9 . A method of processing video data , the method comprising : receiving a first set (first set) of video data encoded in accordance with a first video standard and having a first start code defined by the first video standard ; determining the video standard of the first set of video data by identifying the first start code included in the first set of video data ; processing the first set of video data in accordance with a first video standard ; receiving a second set (second set) of video data encoded in accordance with a second video standard and having a second start code defined by the second video standard ; determining the video standard of the second set of video data by identifying the second start code included in the second set of video data ; and processing the second set of video data in accordance with the second video standard . US20030156652A1 CLAIM 22 . A method of processing video data , the method comprising : receiving a first video data (video information) code or marker corresponding to a first video standard ; searching video data for the received video code or marker ; receiving a second video data (video information) code or marker corresponding to a second video standard ; and searching video data for the second video data code or marker .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information (second video data, first video data) into a first set (first set) of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set (second set) of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20030156652A1 CLAIM 9 . A method of processing video data , the method comprising : receiving a first set (first set) of video data encoded in accordance with a first video standard and having a first start code defined by the first video standard ; determining the video standard of the first set of video data by identifying the first start code included in the first set of video data ; processing the first set of video data in accordance with a first video standard ; receiving a second set (second set) of video data encoded in accordance with a second video standard and having a second start code defined by the second video standard ; determining the video standard of the second set of video data by identifying the second start code included in the second set of video data ; and processing the second set of video data in accordance with the second video standard . US20030156652A1 CLAIM 22 . A method of processing video data , the method comprising : receiving a first video data (video information) code or marker corresponding to a first video standard ; searching video data for the received video code or marker ; receiving a second video data (video information) code or marker corresponding to a second video standard ; and searching video data for the second video data code or marker .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information (second video data, first video data) into a first set (first set) of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set (second set) of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20030156652A1 CLAIM 9 . A method of processing video data , the method comprising : receiving a first set (first set) of video data encoded in accordance with a first video standard and having a first start code defined by the first video standard ; determining the video standard of the first set of video data by identifying the first start code included in the first set of video data ; processing the first set of video data in accordance with a first video standard ; receiving a second set (second set) of video data encoded in accordance with a second video standard and having a second start code defined by the second video standard ; determining the video standard of the second set of video data by identifying the second start code included in the second set of video data ; and processing the second set of video data in accordance with the second video standard . US20030156652A1 CLAIM 22 . A method of processing video data , the method comprising : receiving a first video data (video information) code or marker corresponding to a first video standard ; searching video data for the received video code or marker ; receiving a second video data (video information) code or marker corresponding to a second video standard ; and searching video data for the second video data code or marker .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20020009233A1 Filed: 2001-06-14 Issued: 2002-01-24 Color encoding and decoding method (Original Assignee) Koninklijke Philips NV (Current Assignee) Funai Electric Co Ltd Beatrice Pesquet-Popescu
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size (given number) and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set (respective levels) of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set (following steps) of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20020009233A1 CLAIM 1 . An encoding method for the compression of a video sequence including successive frames organized in groups of frames , each frame being decomposed by means of a three-dimensional (3D) wavelet transform leading to a given number (second maximum region size) of successive resolution levels , said encoding method being based on the hierarchical subband encoding process called “set partitioning in hierarchical trees” (SPIHT) and leading from the original set of picture elements (pixels) of each group of frames to wavelet transform coefficients encoded with a binary format and constituting a hierarchical pyramid , said coefficients being organized into a spatio-temporal orientation tree rooted in the lowest frequency (or approximation subband) resulting from the 3D wavelet transform and completed by an offspring in the higher frequency subbands , the coefficients of said tree being ordered into partitioning sets involving the pixels and corresponding to respective levels (first set) of significance , said sets being defined by means of magnitude tests leading to a classification of the significance information in three ordered lists called list of insignificant sets (LIS) , list of insignificant pixels (LIP) and list of significant pixels (LSP) , said tests being carried out in order to divide said original set of pixels into said partitioning sets according to a division process that continues until each significant coefficient is encoded within said binary representation , and said spatio-temporal orientation tree defining the spatio-temporal relationship inside said hierarchical pyramid , and said SPIHT algorithm comprising the following steps (second set) : initialization , sorting pass(es) , refinement pass , and quantization step update , said method (root region) being further characterized in that , according to the algorithm indicated in the appendix B : (a) in the initialization step : the three coefficients corresponding to the same location in the three color planes Y , U and V are put sequentially in the LIS in order to occupy neighboring positions and to remain together in said LIS for the following sorting passes if they all have insignificant offspring when analyzed one after the other at each significance level ; the last bitplane for which insignificant offspring in luminance implies insignificant offspring in chrominance , n i , is computed based on set significance level of the coefficients in the root subband and output in the bitstream ; (b) in the sorting pass(es) going from n max to n i , when a luminance coefficient has insignificant offspring and if the three following conditions are satisfied by the two coefficients that follow said coefficient in the LIS : they are U and V coefficients respectively ; they have the same spatio-temporal coordinates as said luminance coefficient ; they also have insignificant offspring ; then this situation is coded by only a unique symbol , the output bistream being not modified with respect to the original SPIHT algorithm in all the other cases .
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set (respective levels) of sub-regions : compute a prediction signal (lowest frequency) based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset of the second set (following steps) of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	US20020009233A1 CLAIM 1 . An encoding method for the compression of a video sequence including successive frames organized in groups of frames , each frame being decomposed by means of a three-dimensional (3D) wavelet transform leading to a given number of successive resolution levels , said encoding method being based on the hierarchical subband encoding process called “set partitioning in hierarchical trees” (SPIHT) and leading from the original set of picture elements (pixels) of each group of frames to wavelet transform coefficients encoded with a binary format and constituting a hierarchical pyramid , said coefficients being organized into a spatio-temporal orientation tree rooted in the lowest frequency (prediction signal) (or approximation subband) resulting from the 3D wavelet transform and completed by an offspring in the higher frequency subbands , the coefficients of said tree being ordered into partitioning sets involving the pixels and corresponding to respective levels (first set) of significance , said sets being defined by means of magnitude tests leading to a classification of the significance information in three ordered lists called list of insignificant sets (LIS) , list of insignificant pixels (LIP) and list of significant pixels (LSP) , said tests being carried out in order to divide said original set of pixels into said partitioning sets according to a division process that continues until each significant coefficient is encoded within said binary representation , and said spatio-temporal orientation tree defining the spatio-temporal relationship inside said hierarchical pyramid , and said SPIHT algorithm comprising the following steps (second set) : initialization , sorting pass(es) , refinement pass , and quantization step update , said method being further characterized in that , according to the algorithm indicated in the appendix B : (a) in the initialization step : the three coefficients corresponding to the same location in the three color planes Y , U and V are put sequentially in the LIS in order to occupy neighboring positions and to remain together in said LIS for the following sorting passes if they all have insignificant offspring when analyzed one after the other at each significance level ; the last bitplane for which insignificant offspring in luminance implies insignificant offspring in chrominance , n i , is computed based on set significance level of the coefficients in the root subband and output in the bitstream ; (b) in the sorting pass(es) going from n max to n i , when a luminance coefficient has insignificant offspring and if the three following conditions are satisfied by the two coefficients that follow said coefficient in the LIS : they are U and V coefficients respectively ; they have the same spatio-temporal coordinates as said luminance coefficient ; they also have insignificant offspring ; then this situation is coded by only a unique symbol , the output bistream being not modified with respect to the original SPIHT algorithm in all the other cases .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set (respective levels) of root regions such that the first set of root regions are rectangular blocks of a size determined by the first maximum region size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	US20020009233A1 CLAIM 1 . An encoding method for the compression of a video sequence including successive frames organized in groups of frames , each frame being decomposed by means of a three-dimensional (3D) wavelet transform leading to a given number of successive resolution levels , said encoding method being based on the hierarchical subband encoding process called “set partitioning in hierarchical trees” (SPIHT) and leading from the original set of picture elements (pixels) of each group of frames to wavelet transform coefficients encoded with a binary format and constituting a hierarchical pyramid , said coefficients being organized into a spatio-temporal orientation tree rooted in the lowest frequency (or approximation subband) resulting from the 3D wavelet transform and completed by an offspring in the higher frequency subbands , the coefficients of said tree being ordered into partitioning sets involving the pixels and corresponding to respective levels (first set) of significance , said sets being defined by means of magnitude tests leading to a classification of the significance information in three ordered lists called list of insignificant sets (LIS) , list of insignificant pixels (LIP) and list of significant pixels (LSP) , said tests being carried out in order to divide said original set of pixels into said partitioning sets according to a division process that continues until each significant coefficient is encoded within said binary representation , and said spatio-temporal orientation tree defining the spatio-temporal relationship inside said hierarchical pyramid , and said SPIHT algorithm comprising the following steps : initialization , sorting pass(es) , refinement pass , and quantization step update , said method being further characterized in that , according to the algorithm indicated in the appendix B : (a) in the initialization step : the three coefficients corresponding to the same location in the three color planes Y , U and V are put sequentially in the LIS in order to occupy neighboring positions and to remain together in said LIS for the following sorting passes if they all have insignificant offspring when analyzed one after the other at each significance level ; the last bitplane for which insignificant offspring in luminance implies insignificant offspring in chrominance , n i , is computed based on set significance level of the coefficients in the root subband and output in the bitstream ; (b) in the sorting pass(es) going from n max to n i , when a luminance coefficient has insignificant offspring and if the three following conditions are satisfied by the two coefficients that follow said coefficient in the LIS : they are U and V coefficients respectively ; they have the same spatio-temporal coordinates as said luminance coefficient ; they also have insignificant offspring ; then this situation is coded by only a unique symbol , the output bistream being not modified with respect to the original SPIHT algorithm in all the other cases .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set (respective levels) of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region (said method) into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20020009233A1 CLAIM 3 . A decoding method for the decompression of a video sequence which has been processed by means of an encoding method according to anyone of claims 1 and 2 , said method (root region) being characterized in that it follows the same steps as said algorithm indicated in the appendix B , “output” operations being however replaced by “input” ones .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size (given number) and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set (respective levels) of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set (following steps) of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20020009233A1 CLAIM 3 . A decoding method for the decompression of a video sequence which has been processed by means of an encoding method according to anyone of claims 1 and 2 , said method (root region) being characterized in that it follows the same steps as said algorithm indicated in the appendix B , “output” operations being however replaced by “input” ones .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set (respective levels) of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size (given number) , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set (following steps) of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20020009233A1 CLAIM 3 . A decoding method for the decompression of a video sequence which has been processed by means of an encoding method according to anyone of claims 1 and 2 , said method (root region) being characterized in that it follows the same steps as said algorithm indicated in the appendix B , “output” operations being however replaced by “input” ones .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set (respective levels) of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size (given number) ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set (following steps) of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20020009233A1 CLAIM 3 . A decoding method for the decompression of a video sequence which has been processed by means of an encoding method according to anyone of claims 1 and 2 , said method (root region) being characterized in that it follows the same steps as said algorithm indicated in the appendix B , “output” operations being however replaced by “input” ones .

US20020181745A1

Filed: 2001-06-05 Issued: 2002-12-05

Multi-modal motion estimation for video sequences

(Original Assignee) Micron Technology Inc (Current Assignee) Micron Technology Inc

Shane Hu

US10250913B2
CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level (higher levels) according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .

US20020181745A1
CLAIM 29 . The method of claim 24 wherein determining a respective motion vector for each pixel block , identifying the major modes of the motion vectors , and determining for each pixel block if a better match can be made is repeated for successively higher levels (first hierarchy level) of resolution until completed for an original level of resolution .

US10250913B2
CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ;

and a data stream generator (absolute difference) configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .

US20020181745A1
CLAIM 5 . The method of claim 1 wherein the first and second error measures comprise a block sum of absolute difference (data stream generator) s .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20010039487A1 Filed: 2001-03-22 Issued: 2001-11-08 Distributed multiresoluton geometry modeling system and method (Original Assignee) Schlumberger Technology Corp (Current Assignee) Schlumberger Technology Corp Richard Hammersley, Hong-Qian Lu
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level (multiple levels, higher levels) wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20010039487A1 CLAIM 2 . The geometry modeling system of claim 1 , wherein the client program further comprises instructions to : partition the surface into multiple levels (first hierarchy level, hierarchy level) of nodes wherein the root node represents the coarsest level of resolution and each next level away from the root node represents a finer level of resolution ; store a bounding box for each node in the tree corresponding to a surface wherein the bounding box is sized to contain all simplices of the surface representation at the level of the node ; update the model to include a new surface by : traversing the hierarchical tree representation of a first surface in the model and the hierarchical tree representation of the new surface beginning at a root node of each tree and successively visiting nodes in each hierarchical tree representing higher levels (first hierarchy level, hierarchy level) of resolution ; during the tree traversal , requesting from the database management system a bounding box for each node visited in each hierarchical tree ; if the bounding boxes do not intersect , do not continue the traversal to descendant nodes ; and if the bounding boxes intersect , visit descendant nodes of at least one node from one of the hierarchical trees .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level (multiple levels, higher levels) (multiple levels, higher levels) according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20010039487A1 CLAIM 2 . The geometry modeling system of claim 1 , wherein the client program further comprises instructions to : partition the surface into multiple levels (first hierarchy level, hierarchy level) of nodes wherein the root node represents the coarsest level of resolution and each next level away from the root node represents a finer level of resolution ; store a bounding box for each node in the tree corresponding to a surface wherein the bounding box is sized to contain all simplices of the surface representation at the level of the node ; update the model to include a new surface by : traversing the hierarchical tree representation of a first surface in the model and the hierarchical tree representation of the new surface beginning at a root node of each tree and successively visiting nodes in each hierarchical tree representing higher levels (first hierarchy level, hierarchy level) of resolution ; during the tree traversal , requesting from the database management system a bounding box for each node visited in each hierarchical tree ; if the bounding boxes do not intersect , do not continue the traversal to descendant nodes ; and if the bounding boxes intersect , visit descendant nodes of at least one node from one of the hierarchical trees .
US10250913B2 CLAIM 5 . The decoder according to claim 4 , wherein the divider is configured to , in accordance with the partition rules associated with the first and higher-order hierarchy levels , sub-divide into sub-regions of equal size , such that there are an equal number of sub-regions at each hierarchy level (multiple levels, higher levels) .	US20010039487A1 CLAIM 2 . The geometry modeling system of claim 1 , wherein the client program further comprises instructions to : partition the surface into multiple levels (first hierarchy level, hierarchy level) of nodes wherein the root node represents the coarsest level of resolution and each next level away from the root node represents a finer level of resolution ; store a bounding box for each node in the tree corresponding to a surface wherein the bounding box is sized to contain all simplices of the surface representation at the level of the node ; update the model to include a new surface by : traversing the hierarchical tree representation of a first surface in the model and the hierarchical tree representation of the new surface beginning at a root node of each tree and successively visiting nodes in each hierarchical tree representing higher levels (first hierarchy level, hierarchy level) of resolution ; during the tree traversal , requesting from the database management system a bounding box for each node visited in each hierarchical tree ; if the bounding boxes do not intersect , do not continue the traversal to descendant nodes ; and if the bounding boxes intersect , visit descendant nodes of at least one node from one of the hierarchical trees .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision information includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level (multiple levels, higher levels) is sub-divided .	US20010039487A1 CLAIM 2 . The geometry modeling system of claim 1 , wherein the client program further comprises instructions to : partition the surface into multiple levels (first hierarchy level, hierarchy level) of nodes wherein the root node represents the coarsest level of resolution and each next level away from the root node represents a finer level of resolution ; store a bounding box for each node in the tree corresponding to a surface wherein the bounding box is sized to contain all simplices of the surface representation at the level of the node ; update the model to include a new surface by : traversing the hierarchical tree representation of a first surface in the model and the hierarchical tree representation of the new surface beginning at a root node of each tree and successively visiting nodes in each hierarchical tree representing higher levels (first hierarchy level, hierarchy level) of resolution ; during the tree traversal , requesting from the database management system a bounding box for each node visited in each hierarchical tree ; if the bounding boxes do not intersect , do not continue the traversal to descendant nodes ; and if the bounding boxes intersect , visit descendant nodes of at least one node from one of the hierarchical trees .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level (multiple levels, higher levels) from the data stream .	US20010039487A1 CLAIM 2 . The geometry modeling system of claim 1 , wherein the client program further comprises instructions to : partition the surface into multiple levels (first hierarchy level, hierarchy level) of nodes wherein the root node represents the coarsest level of resolution and each next level away from the root node represents a finer level of resolution ; store a bounding box for each node in the tree corresponding to a surface wherein the bounding box is sized to contain all simplices of the surface representation at the level of the node ; update the model to include a new surface by : traversing the hierarchical tree representation of a first surface in the model and the hierarchical tree representation of the new surface beginning at a root node of each tree and successively visiting nodes in each hierarchical tree representing higher levels (first hierarchy level, hierarchy level) of resolution ; during the tree traversal , requesting from the database management system a bounding box for each node visited in each hierarchical tree ; if the bounding boxes do not intersect , do not continue the traversal to descendant nodes ; and if the bounding boxes intersect , visit descendant nodes of at least one node from one of the hierarchical trees .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level (multiple levels, higher levels) , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20010039487A1 CLAIM 2 . The geometry modeling system of claim 1 , wherein the client program further comprises instructions to : partition the surface into multiple levels (first hierarchy level, hierarchy level) of nodes wherein the root node represents the coarsest level of resolution and each next level away from the root node represents a finer level of resolution ; store a bounding box for each node in the tree corresponding to a surface wherein the bounding box is sized to contain all simplices of the surface representation at the level of the node ; update the model to include a new surface by : traversing the hierarchical tree representation of a first surface in the model and the hierarchical tree representation of the new surface beginning at a root node of each tree and successively visiting nodes in each hierarchical tree representing higher levels (first hierarchy level, hierarchy level) of resolution ; during the tree traversal , requesting from the database management system a bounding box for each node visited in each hierarchical tree ; if the bounding boxes do not intersect , do not continue the traversal to descendant nodes ; and if the bounding boxes intersect , visit descendant nodes of at least one node from one of the hierarchical trees .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level (multiple levels, higher levels) ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20010039487A1 CLAIM 2 . The geometry modeling system of claim 1 , wherein the client program further comprises instructions to : partition the surface into multiple levels (first hierarchy level, hierarchy level) of nodes wherein the root node represents the coarsest level of resolution and each next level away from the root node represents a finer level of resolution ; store a bounding box for each node in the tree corresponding to a surface wherein the bounding box is sized to contain all simplices of the surface representation at the level of the node ; update the model to include a new surface by : traversing the hierarchical tree representation of a first surface in the model and the hierarchical tree representation of the new surface beginning at a root node of each tree and successively visiting nodes in each hierarchical tree representing higher levels (first hierarchy level, hierarchy level) of resolution ; during the tree traversal , requesting from the database management system a bounding box for each node visited in each hierarchical tree ; if the bounding boxes do not intersect , do not continue the traversal to descendant nodes ; and if the bounding boxes intersect , visit descendant nodes of at least one node from one of the hierarchical trees .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level (multiple levels, higher levels) ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20010039487A1 CLAIM 2 . The geometry modeling system of claim 1 , wherein the client program further comprises instructions to : partition the surface into multiple levels (first hierarchy level, hierarchy level) of nodes wherein the root node represents the coarsest level of resolution and each next level away from the root node represents a finer level of resolution ; store a bounding box for each node in the tree corresponding to a surface wherein the bounding box is sized to contain all simplices of the surface representation at the level of the node ; update the model to include a new surface by : traversing the hierarchical tree representation of a first surface in the model and the hierarchical tree representation of the new surface beginning at a root node of each tree and successively visiting nodes in each hierarchical tree representing higher levels (first hierarchy level, hierarchy level) of resolution ; during the tree traversal , requesting from the database management system a bounding box for each node visited in each hierarchical tree ; if the bounding boxes do not intersect , do not continue the traversal to descendant nodes ; and if the bounding boxes intersect , visit descendant nodes of at least one node from one of the hierarchical trees .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20020106019A1 Filed: 2001-01-12 Issued: 2002-08-08 Method and apparatus for implementing motion detection in video compression (Original Assignee) Microsoft Corp (Current Assignee) Microsoft Technology Licensing LLC Navin Chaddha, Anoop Gupta, Albert Wang
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level (binary tree) wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20020106019A1 CLAIM 5 . A computer-implemented method as recited in claim 3 wherein the tree map is a binary tree (hierarchy level, order hierarchy level) map .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level (binary tree) according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20020106019A1 CLAIM 5 . A computer-implemented method as recited in claim 3 wherein the tree map is a binary tree (hierarchy level, order hierarchy level) map .
US10250913B2 CLAIM 5 . The decoder according to claim 4 , wherein the divider is configured to , in accordance with the partition rules associated with the first and higher-order hierarchy levels , sub-divide into sub-regions of equal size , such that there are an equal number of sub-regions at each hierarchy level (binary tree) .	US20020106019A1 CLAIM 5 . A computer-implemented method as recited in claim 3 wherein the tree map is a binary tree (hierarchy level, order hierarchy level) map .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision information includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level (binary tree) is sub-divided .	US20020106019A1 CLAIM 5 . A computer-implemented method as recited in claim 3 wherein the tree map is a binary tree (hierarchy level, order hierarchy level) map .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level (binary tree) from the data stream .	US20020106019A1 CLAIM 5 . A computer-implemented method as recited in claim 3 wherein the tree map is a binary tree (hierarchy level, order hierarchy level) map .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level (binary tree) , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20020106019A1 CLAIM 5 . A computer-implemented method as recited in claim 3 wherein the tree map is a binary tree (hierarchy level, order hierarchy level) map .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level (binary tree) ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20020106019A1 CLAIM 5 . A computer-implemented method as recited in claim 3 wherein the tree map is a binary tree (hierarchy level, order hierarchy level) map .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level (binary tree) ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20020106019A1 CLAIM 5 . A computer-implemented method as recited in claim 3 wherein the tree map is a binary tree (hierarchy level, order hierarchy level) map .
US10250913B2 CLAIM 15 . A non-transitory computer readable digital storage medium having stored thereon a computer program (computer program) having a program code for performing , when running on a computer , a method according to claim 12 .	US20020106019A1 CLAIM 15 . A computer-readable medium for furnishing downloadable computer-readable program code instructions configured to cause a computer to process video data , the video data including a current frame and an adjacent frame , the current frame including an uncompressed current block , the adjacent frame including an adjacent block , the computer-readable medium comprising computer program (computer program) code instructions configured to cause a computer to execute the steps of : obtaining the current block and the adjacent block ; calculating a distance between the current block and the adjacent block ; determining if the distance between the current block and the adjacent block is acceptable ; and adaptively compressing the current block when it is determined that the distance between the current block and the adjacent block is not acceptable .
US10250913B2 CLAIM 16 . A non-transitory computer readable digital storage medium having stored thereon a computer program (computer program) having a program code for performing , when running on a computer , a method according to claim 14 .	US20020106019A1 CLAIM 15 . A computer-readable medium for furnishing downloadable computer-readable program code instructions configured to cause a computer to process video data , the video data including a current frame and an adjacent frame , the current frame including an uncompressed current block , the adjacent frame including an adjacent block , the computer-readable medium comprising computer program (computer program) code instructions configured to cause a computer to execute the steps of : obtaining the current block and the adjacent block ; calculating a distance between the current block and the adjacent block ; determining if the distance between the current block and the adjacent block is acceptable ; and adaptively compressing the current block when it is determined that the distance between the current block and the adjacent block is not acceptable .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20010004404A1 Filed: 2000-12-15 Issued: 2001-06-21 Image processing apparatus and method, and storage medium therefor (Original Assignee) Canon Inc (Current Assignee) Canon Inc Osamu Itokawa
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal (image pickup) based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset of the second set of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	US20010004404A1 CLAIM 9 . An image processing apparatus according to claim 1 , wherein said input means comprises image pickup (prediction signal) means for photographing an object image and generating image data .
US10250913B2 CLAIM 15 . A non-transitory computer readable digital storage medium having stored thereon a computer program having a program code (program code) for performing , when running on a computer , a method according to claim 12 .	US20010004404A1 CLAIM 12 . A storage medium for storing program code (program code) s of encoding steps , said encoding steps comprising : a) an inputting step of inputting image data of plural objects ; b) an encoding step of encoding the inputted image data on an object basis ; and c) a controlling step of setting a priority order of code amount allocation for each of the objects and , in accordance with said priority order , controlling encoding conditions for each of the objects in said encoding step , wherein , in said controlling step , the encoding conditions in said encoding step are controlled so that a total code amount obtained by encoding the image data of said plural objects does not exceed a predetermined code amount .
US10250913B2 CLAIM 16 . A non-transitory computer readable digital storage medium having stored thereon a computer program having a program code (program code) for performing , when running on a computer , a method according to claim 14 .	US20010004404A1 CLAIM 12 . A storage medium for storing program code (program code) s of encoding steps , said encoding steps comprising : a) an inputting step of inputting image data of plural objects ; b) an encoding step of encoding the inputted image data on an object basis ; and c) a controlling step of setting a priority order of code amount allocation for each of the objects and , in accordance with said priority order , controlling encoding conditions for each of the objects in said encoding step , wherein , in said controlling step , the encoding conditions in said encoding step are controlled so that a total code amount obtained by encoding the image data of said plural objects does not exceed a predetermined code amount .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	JP2000350207A Filed: 1999-06-08 Issued: 2000-12-15 低解像度ビデオ復号化のための一般化直交変換方法および装置 (Original Assignee) Matsushita Electric Ind Co Ltd; 松下電器産業株式会社 Mi Michael Bi, Kyu Won Min Peter, ビ・ミ・マイケル, ピータ・キュ・ウォン・ミン
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream (バッファ) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (ブロック) information , and a maximum hierarchy level (フレーム, 前記正) wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set (アップ) of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set (アップ) of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	JP2000350207A CLAIM 1 【請求項１】フル解像度ビデオビットストリームを復号化し、また低解像度モニタ上に低解像度復号化ビデオシーケンスを表示するための装置であって：ビデオビットストリームを復号化し、また復号化係数と復号化パラメータとを供給するためのシンタクスパーザおよび可変長復号化手段と；前記復号化係数を逆量子化し、また逆量子化係数を発生するための逆量子化器と；再構築された低解像度映像を記憶するためのフレーム (maximum hierarchy level) バッファ (data stream) と；前記フレームバッファから検索された低解像度基準画素を高解像度空間にマッピングし、また逆動き補償手段のためにアップ (first set, second set) サンプリングされた画素を供給するためのアップサンプリング手段であって、前記逆動き補償手段が、前記復号化パラメータに基づいて前記アップサンプリングされた画素の半画素動き補償を実行して高解像度動き補償画素を得るためにある、アップサンプリング手段と；前記高解像度動き補償画素を低解像度空間にマッピングし、ダウンサンプリングされた画素を供給するためのダウンサンプリング手段と；前記逆量子化係数を受信し、また該逆量子化係数を変換画素に変換するための低解像度一般化逆直交変換手段と；前記フレームバッファに記憶するために低解像度基準画素を得るべく、前記変換画素を前記ダウンサンプリングされた画素に加えるための加算器と；を備える装置。 JP2000350207A CLAIM 5 【請求項５】請求項３に記載の装置において、前記アップサンプリング手段の前記高解像度基準画素が、前記変換基準係数のブロック (second subdivision) と、１組の一般化直角関数から得られるマトリックスとを乗算することによって得られる、装置。 JP2000350207A CLAIM 9 【請求項９】請求項４に記載の装置において、前記ダウンサンプリング手段の前記正 (maximum hierarchy level) 規化された低解像度一般化逆直交変換のオーダが、前記低解像度逆一般化直交変換手段のオーダと同じである、装置。
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set (アップ) of sub-regions : compute a prediction signal based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset of the second set (アップ) of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	JP2000350207A CLAIM 1 【請求項１】フル解像度ビデオビットストリームを復号化し、また低解像度モニタ上に低解像度復号化ビデオシーケンスを表示するための装置であって：ビデオビットストリームを復号化し、また復号化係数と復号化パラメータとを供給するためのシンタクスパーザおよび可変長復号化手段と；前記復号化係数を逆量子化し、また逆量子化係数を発生するための逆量子化器と；再構築された低解像度映像を記憶するためのフレームバッファと；前記フレームバッファから検索された低解像度基準画素を高解像度空間にマッピングし、また逆動き補償手段のためにアップ (first set, second set) サンプリングされた画素を供給するためのアップサンプリング手段であって、前記逆動き補償手段が、前記復号化パラメータに基づいて前記アップサンプリングされた画素の半画素動き補償を実行して高解像度動き補償画素を得るためにある、アップサンプリング手段と；前記高解像度動き補償画素を低解像度空間にマッピングし、ダウンサンプリングされた画素を供給するためのダウンサンプリング手段と；前記逆量子化係数を受信し、また該逆量子化係数を変換画素に変換するための低解像度一般化逆直交変換手段と；前記フレームバッファに記憶するために低解像度基準画素を得るべく、前記変換画素を前記ダウンサンプリングされた画素に加えるための加算器と；を備える装置。
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set (アップ) of root regions such that the first set of root regions are rectangular blocks of a size determined by the first maximum region size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	JP2000350207A CLAIM 1 【請求項１】フル解像度ビデオビットストリームを復号化し、また低解像度モニタ上に低解像度復号化ビデオシーケンスを表示するための装置であって：ビデオビットストリームを復号化し、また復号化係数と復号化パラメータとを供給するためのシンタクスパーザおよび可変長復号化手段と；前記復号化係数を逆量子化し、また逆量子化係数を発生するための逆量子化器と；再構築された低解像度映像を記憶するためのフレームバッファと；前記フレームバッファから検索された低解像度基準画素を高解像度空間にマッピングし、また逆動き補償手段のためにアップ (first set, second set) サンプリングされた画素を供給するためのアップサンプリング手段であって、前記逆動き補償手段が、前記復号化パラメータに基づいて前記アップサンプリングされた画素の半画素動き補償を実行して高解像度動き補償画素を得るためにある、アップサンプリング手段と；前記高解像度動き補償画素を低解像度空間にマッピングし、ダウンサンプリングされた画素を供給するためのダウンサンプリング手段と；前記逆量子化係数を受信し、また該逆量子化係数を変換画素に変換するための低解像度一般化逆直交変換手段と；前記フレームバッファに記憶するために低解像度基準画素を得るべく、前記変換画素を前記ダウンサンプリングされた画素に加えるための加算器と；を備える装置。
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set (アップ) of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy (離散コサイン変換, 周波数ドメイン, プログレッシブ) level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level (フレーム, 前記正) is reached .	JP2000350207A CLAIM 1 【請求項１】フル解像度ビデオビットストリームを復号化し、また低解像度モニタ上に低解像度復号化ビデオシーケンスを表示するための装置であって：ビデオビットストリームを復号化し、また復号化係数と復号化パラメータとを供給するためのシンタクスパーザおよび可変長復号化手段と；前記復号化係数を逆量子化し、また逆量子化係数を発生するための逆量子化器と；再構築された低解像度映像を記憶するためのフレーム (maximum hierarchy level) バッファと；前記フレームバッファから検索された低解像度基準画素を高解像度空間にマッピングし、また逆動き補償手段のためにアップ (first set, second set) サンプリングされた画素を供給するためのアップサンプリング手段であって、前記逆動き補償手段が、前記復号化パラメータに基づいて前記アップサンプリングされた画素の半画素動き補償を実行して高解像度動き補償画素を得るためにある、アップサンプリング手段と；前記高解像度動き補償画素を低解像度空間にマッピングし、ダウンサンプリングされた画素を供給するためのダウンサンプリング手段と；前記逆量子化係数を受信し、また該逆量子化係数を変換画素に変換するための低解像度一般化逆直交変換手段と；前記フレームバッファに記憶するために低解像度基準画素を得るべく、前記変換画素を前記ダウンサンプリングされた画素に加えるための加算器と；を備える装置。 JP2000350207A CLAIM 2 【請求項２】請求項１に記載の装置において、前記低解像度逆一般化直交変換が逆離散コサイン変換 (spatial domain, spatial domain transform coding, first hierarchy, first hierarchy level) と異なる、装置。 JP2000350207A CLAIM 4 【請求項４】請求項１に記載の装置において、前記ダウンサンプリング手段がさらに：前記高解像度動き補償画素を受信し、該動き補償画素を周波数ドメイン (spatial domain, spatial domain transform coding, first hierarchy, first hierarchy level) にマッピングし、また高解像度変換係数を供給するための高解像度一般化マッピング手段と；前記高解像度変換係数を低解像度空間に変換し、また前記ダウンサンプリングされた画素を供給するための正規化された低解像度一般化逆直交変換手段と；を備える装置。 JP2000350207A CLAIM 9 【請求項９】請求項４に記載の装置において、前記ダウンサンプリング手段の前記正 (maximum hierarchy level) 規化された低解像度一般化逆直交変換のオーダが、前記低解像度逆一般化直交変換手段のオーダと同じである、装置。 JP2000350207A CLAIM 17 【請求項１７】請求項１から１１に記載の装置において、低解像度ビデオ復号化がプログレッシブ (spatial domain, spatial domain transform coding, first hierarchy, first hierarchy level) およびインターレースの両方のビデオビットストリームに適用可能である、装置。
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision information includes a partition indication flag indicating whether any of the first set (アップ) of root regions or the sub-regions at the first or higher-order hierarchy level is sub-divided .	JP2000350207A CLAIM 1 【請求項１】フル解像度ビデオビットストリームを復号化し、また低解像度モニタ上に低解像度復号化ビデオシーケンスを表示するための装置であって：ビデオビットストリームを復号化し、また復号化係数と復号化パラメータとを供給するためのシンタクスパーザおよび可変長復号化手段と；前記復号化係数を逆量子化し、また逆量子化係数を発生するための逆量子化器と；再構築された低解像度映像を記憶するためのフレームバッファと；前記フレームバッファから検索された低解像度基準画素を高解像度空間にマッピングし、また逆動き補償手段のためにアップ (first set, second set) サンプリングされた画素を供給するためのアップサンプリング手段であって、前記逆動き補償手段が、前記復号化パラメータに基づいて前記アップサンプリングされた画素の半画素動き補償を実行して高解像度動き補償画素を得るためにある、アップサンプリング手段と；前記高解像度動き補償画素を低解像度空間にマッピングし、ダウンサンプリングされた画素を供給するためのダウンサンプリング手段と；前記逆量子化係数を受信し、また該逆量子化係数を変換画素に変換するための低解像度一般化逆直交変換手段と；前記フレームバッファに記憶するために低解像度基準画素を得るべく、前記変換画素を前記ダウンサンプリングされた画素に加えるための加算器と；を備える装置。
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level (フレーム, 前記正) from the data stream (バッファ) .	JP2000350207A CLAIM 1 【請求項１】フル解像度ビデオビットストリームを復号化し、また低解像度モニタ上に低解像度復号化ビデオシーケンスを表示するための装置であって：ビデオビットストリームを復号化し、また復号化係数と復号化パラメータとを供給するためのシンタクスパーザおよび可変長復号化手段と；前記復号化係数を逆量子化し、また逆量子化係数を発生するための逆量子化器と；再構築された低解像度映像を記憶するためのフレーム (maximum hierarchy level) バッファ (data stream) と；前記フレームバッファから検索された低解像度基準画素を高解像度空間にマッピングし、また逆動き補償手段のためにアップサンプリングされた画素を供給するためのアップサンプリング手段であって、前記逆動き補償手段が、前記復号化パラメータに基づいて前記アップサンプリングされた画素の半画素動き補償を実行して高解像度動き補償画素を得るためにある、アップサンプリング手段と；前記高解像度動き補償画素を低解像度空間にマッピングし、ダウンサンプリングされた画素を供給するためのダウンサンプリング手段と；前記逆量子化係数を受信し、また該逆量子化係数を変換画素に変換するための低解像度一般化逆直交変換手段と；前記フレームバッファに記憶するために低解像度基準画素を得るべく、前記変換画素を前記ダウンサンプリングされた画素に加えるための加算器と；を備える装置。 JP2000350207A CLAIM 9 【請求項９】請求項４に記載の装置において、前記ダウンサンプリング手段の前記正 (maximum hierarchy level) 規化された低解像度一般化逆直交変換のオーダが、前記低解像度逆一般化直交変換手段のオーダと同じである、装置。
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements associated with the first or second set (アップ) of sub-regions from the data stream (バッファ) in a depth-first traversal order .	JP2000350207A CLAIM 1 【請求項１】フル解像度ビデオビットストリームを復号化し、また低解像度モニタ上に低解像度復号化ビデオシーケンスを表示するための装置であって：ビデオビットストリームを復号化し、また復号化係数と復号化パラメータとを供給するためのシンタクスパーザおよび可変長復号化手段と；前記復号化係数を逆量子化し、また逆量子化係数を発生するための逆量子化器と；再構築された低解像度映像を記憶するためのフレームバッファ (data stream) と；前記フレームバッファから検索された低解像度基準画素を高解像度空間にマッピングし、また逆動き補償手段のためにアップ (first set, second set) サンプリングされた画素を供給するためのアップサンプリング手段であって、前記逆動き補償手段が、前記復号化パラメータに基づいて前記アップサンプリングされた画素の半画素動き補償を実行して高解像度動き補償画素を得るためにある、アップサンプリング手段と；前記高解像度動き補償画素を低解像度空間にマッピングし、ダウンサンプリングされた画素を供給するためのダウンサンプリング手段と；前記逆量子化係数を受信し、また該逆量子化係数を変換画素に変換するための低解像度一般化逆直交変換手段と；前記フレームバッファに記憶するために低解像度基準画素を得るべく、前記変換画素を前記ダウンサンプリングされた画素に加えるための加算器と；を備える装置。
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream (バッファ) , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set (アップ) of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	JP2000350207A CLAIM 1 【請求項１】フル解像度ビデオビットストリームを復号化し、また低解像度モニタ上に低解像度復号化ビデオシーケンスを表示するための装置であって：ビデオビットストリームを復号化し、また復号化係数と復号化パラメータとを供給するためのシンタクスパーザおよび可変長復号化手段と；前記復号化係数を逆量子化し、また逆量子化係数を発生するための逆量子化器と；再構築された低解像度映像を記憶するためのフレームバッファ (data stream) と；前記フレームバッファから検索された低解像度基準画素を高解像度空間にマッピングし、また逆動き補償手段のためにアップ (first set, second set) サンプリングされた画素を供給するためのアップサンプリング手段であって、前記逆動き補償手段が、前記復号化パラメータに基づいて前記アップサンプリングされた画素の半画素動き補償を実行して高解像度動き補償画素を得るためにある、アップサンプリング手段と；前記高解像度動き補償画素を低解像度空間にマッピングし、ダウンサンプリングされた画素を供給するためのダウンサンプリング手段と；前記逆量子化係数を受信し、また該逆量子化係数を変換画素に変換するための低解像度一般化逆直交変換手段と；前記フレームバッファに記憶するために低解像度基準画素を得るべく、前記変換画素を前記ダウンサンプリングされた画素に加えるための加算器と；を備える装置。
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream (バッファ) , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	JP2000350207A CLAIM 1 【請求項１】フル解像度ビデオビットストリームを復号化し、また低解像度モニタ上に低解像度復号化ビデオシーケンスを表示するための装置であって：ビデオビットストリームを復号化し、また復号化係数と復号化パラメータとを供給するためのシンタクスパーザおよび可変長復号化手段と；前記復号化係数を逆量子化し、また逆量子化係数を発生するための逆量子化器と；再構築された低解像度映像を記憶するためのフレームバッファ (data stream) と；前記フレームバッファから検索された低解像度基準画素を高解像度空間にマッピングし、また逆動き補償手段のためにアップサンプリングされた画素を供給するためのアップサンプリング手段であって、前記逆動き補償手段が、前記復号化パラメータに基づいて前記アップサンプリングされた画素の半画素動き補償を実行して高解像度動き補償画素を得るためにある、アップサンプリング手段と；前記高解像度動き補償画素を低解像度空間にマッピングし、ダウンサンプリングされた画素を供給するためのダウンサンプリング手段と；前記逆量子化係数を受信し、また該逆量子化係数を変換画素に変換するための低解像度一般化逆直交変換手段と；前記フレームバッファに記憶するために低解像度基準画素を得るべく、前記変換画素を前記ダウンサンプリングされた画素に加えるための加算器と；を備える装置。
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream (バッファ) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (ブロック) information , and a maximum hierarchy level (フレーム, 前記正) , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set (アップ) of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set (アップ) of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	JP2000350207A CLAIM 1 【請求項１】フル解像度ビデオビットストリームを復号化し、また低解像度モニタ上に低解像度復号化ビデオシーケンスを表示するための装置であって：ビデオビットストリームを復号化し、また復号化係数と復号化パラメータとを供給するためのシンタクスパーザおよび可変長復号化手段と；前記復号化係数を逆量子化し、また逆量子化係数を発生するための逆量子化器と；再構築された低解像度映像を記憶するためのフレーム (maximum hierarchy level) バッファ (data stream) と；前記フレームバッファから検索された低解像度基準画素を高解像度空間にマッピングし、また逆動き補償手段のためにアップ (first set, second set) サンプリングされた画素を供給するためのアップサンプリング手段であって、前記逆動き補償手段が、前記復号化パラメータに基づいて前記アップサンプリングされた画素の半画素動き補償を実行して高解像度動き補償画素を得るためにある、アップサンプリング手段と；前記高解像度動き補償画素を低解像度空間にマッピングし、ダウンサンプリングされた画素を供給するためのダウンサンプリング手段と；前記逆量子化係数を受信し、また該逆量子化係数を変換画素に変換するための低解像度一般化逆直交変換手段と；前記フレームバッファに記憶するために低解像度基準画素を得るべく、前記変換画素を前記ダウンサンプリングされた画素に加えるための加算器と；を備える装置。 JP2000350207A CLAIM 5 【請求項５】請求項３に記載の装置において、前記アップサンプリング手段の前記高解像度基準画素が、前記変換基準係数のブロック (second subdivision) と、１組の一般化直角関数から得られるマトリックスとを乗算することによって得られる、装置。 JP2000350207A CLAIM 9 【請求項９】請求項４に記載の装置において、前記ダウンサンプリング手段の前記正 (maximum hierarchy level) 規化された低解像度一般化逆直交変換のオーダが、前記低解像度逆一般化直交変換手段のオーダと同じである、装置。
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set (アップ) of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set (アップ) of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (ブロック) information and a maximum hierarchy level (フレーム, 前記正) ; and a data stream (バッファ) generator (ビデオビットストリーム) configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	JP2000350207A CLAIM 1 【請求項１】フル解像度ビデオビットストリーム (data stream generator) を復号化し、また低解像度モニタ上に低解像度復号化ビデオシーケンスを表示するための装置であって：ビデオビットストリームを復号化し、また復号化係数と復号化パラメータとを供給するためのシンタクスパーザおよび可変長復号化手段と；前記復号化係数を逆量子化し、また逆量子化係数を発生するための逆量子化器と；再構築された低解像度映像を記憶するためのフレーム (maximum hierarchy level) バッファ (data stream) と；前記フレームバッファから検索された低解像度基準画素を高解像度空間にマッピングし、また逆動き補償手段のためにアップ (first set, second set) サンプリングされた画素を供給するためのアップサンプリング手段であって、前記逆動き補償手段が、前記復号化パラメータに基づいて前記アップサンプリングされた画素の半画素動き補償を実行して高解像度動き補償画素を得るためにある、アップサンプリング手段と；前記高解像度動き補償画素を低解像度空間にマッピングし、ダウンサンプリングされた画素を供給するためのダウンサンプリング手段と；前記逆量子化係数を受信し、また該逆量子化係数を変換画素に変換するための低解像度一般化逆直交変換手段と；前記フレームバッファに記憶するために低解像度基準画素を得るべく、前記変換画素を前記ダウンサンプリングされた画素に加えるための加算器と；を備える装置。 JP2000350207A CLAIM 5 【請求項５】請求項３に記載の装置において、前記アップサンプリング手段の前記高解像度基準画素が、前記変換基準係数のブロック (second subdivision) と、１組の一般化直角関数から得られるマトリックスとを乗算することによって得られる、装置。 JP2000350207A CLAIM 9 【請求項９】請求項４に記載の装置において、前記ダウンサンプリング手段の前記正 (maximum hierarchy level) 規化された低解像度一般化逆直交変換のオーダが、前記低解像度逆一般化直交変換手段のオーダと同じである、装置。
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set (アップ) of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set (アップ) of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (ブロック) information and a maximum hierarchy level (フレーム, 前記正) ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream (バッファ) the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	JP2000350207A CLAIM 1 【請求項１】フル解像度ビデオビットストリームを復号化し、また低解像度モニタ上に低解像度復号化ビデオシーケンスを表示するための装置であって：ビデオビットストリームを復号化し、また復号化係数と復号化パラメータとを供給するためのシンタクスパーザおよび可変長復号化手段と；前記復号化係数を逆量子化し、また逆量子化係数を発生するための逆量子化器と；再構築された低解像度映像を記憶するためのフレーム (maximum hierarchy level) バッファ (data stream) と；前記フレームバッファから検索された低解像度基準画素を高解像度空間にマッピングし、また逆動き補償手段のためにアップ (first set, second set) サンプリングされた画素を供給するためのアップサンプリング手段であって、前記逆動き補償手段が、前記復号化パラメータに基づいて前記アップサンプリングされた画素の半画素動き補償を実行して高解像度動き補償画素を得るためにある、アップサンプリング手段と；前記高解像度動き補償画素を低解像度空間にマッピングし、ダウンサンプリングされた画素を供給するためのダウンサンプリング手段と；前記逆量子化係数を受信し、また該逆量子化係数を変換画素に変換するための低解像度一般化逆直交変換手段と；前記フレームバッファに記憶するために低解像度基準画素を得るべく、前記変換画素を前記ダウンサンプリングされた画素に加えるための加算器と；を備える装置。 JP2000350207A CLAIM 5 【請求項５】請求項３に記載の装置において、前記アップサンプリング手段の前記高解像度基準画素が、前記変換基準係数のブロック (second subdivision) と、１組の一般化直角関数から得られるマトリックスとを乗算することによって得られる、装置。 JP2000350207A CLAIM 9 【請求項９】請求項４に記載の装置において、前記ダウンサンプリング手段の前記正 (maximum hierarchy level) 規化された低解像度一般化逆直交変換のオーダが、前記低解像度逆一般化直交変換手段のオーダと同じである、装置。
US10250913B2 CLAIM 15 . A non-transitory computer readable digital storage medium having stored thereon a computer program having a program code (マッピン) for performing , when running on a computer , a method according to claim 12 .	JP2000350207A CLAIM 1 【請求項１】フル解像度ビデオビットストリームを復号化し、また低解像度モニタ上に低解像度復号化ビデオシーケンスを表示するための装置であって：ビデオビットストリームを復号化し、また復号化係数と復号化パラメータとを供給するためのシンタクスパーザおよび可変長復号化手段と；前記復号化係数を逆量子化し、また逆量子化係数を発生するための逆量子化器と；再構築された低解像度映像を記憶するためのフレームバッファと；前記フレームバッファから検索された低解像度基準画素を高解像度空間にマッピン (program code) グし、また逆動き補償手段のためにアップサンプリングされた画素を供給するためのアップサンプリング手段であって、前記逆動き補償手段が、前記復号化パラメータに基づいて前記アップサンプリングされた画素の半画素動き補償を実行して高解像度動き補償画素を得るためにある、アップサンプリング手段と；前記高解像度動き補償画素を低解像度空間にマッピングし、ダウンサンプリングされた画素を供給するためのダウンサンプリング手段と；前記逆量子化係数を受信し、また該逆量子化係数を変換画素に変換するための低解像度一般化逆直交変換手段と；前記フレームバッファに記憶するために低解像度基準画素を得るべく、前記変換画素を前記ダウンサンプリングされた画素に加えるための加算器と；を備える装置。
US10250913B2 CLAIM 16 . A non-transitory computer readable digital storage medium having stored thereon a computer program having a program code (マッピン) for performing , when running on a computer , a method according to claim 14 .	JP2000350207A CLAIM 1 【請求項１】フル解像度ビデオビットストリームを復号化し、また低解像度モニタ上に低解像度復号化ビデオシーケンスを表示するための装置であって：ビデオビットストリームを復号化し、また復号化係数と復号化パラメータとを供給するためのシンタクスパーザおよび可変長復号化手段と；前記復号化係数を逆量子化し、また逆量子化係数を発生するための逆量子化器と；再構築された低解像度映像を記憶するためのフレームバッファと；前記フレームバッファから検索された低解像度基準画素を高解像度空間にマッピン (program code) グし、また逆動き補償手段のためにアップサンプリングされた画素を供給するためのアップサンプリング手段であって、前記逆動き補償手段が、前記復号化パラメータに基づいて前記アップサンプリングされた画素の半画素動き補償を実行して高解像度動き補償画素を得るためにある、アップサンプリング手段と；前記高解像度動き補償画素を低解像度空間にマッピングし、ダウンサンプリングされた画素を供給するためのダウンサンプリング手段と；前記逆量子化係数を受信し、また該逆量子化係数を変換画素に変換するための低解像度一般化逆直交変換手段と；前記フレームバッファに記憶するために低解像度基準画素を得るべく、前記変換画素を前記ダウンサンプリングされた画素に加えるための加算器と；を備える装置。

US6408097B1

Filed: 1999-05-21 Issued: 2002-06-18

Picture coding apparatus and method thereof

(Original Assignee) Sony Corp (Current Assignee) Sony Corp

Tetsujiro Kondo, Yasuhiro Fujimori, Kunio Kawaguchi

US10250913B2
CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset (pixel value) of the second set of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .

US6408097B1
CLAIM 3 . The hierarchical picture coding apparatus according to claim 2 , wherein said hierarchical data generating step generates a hierarchical data having low resolution by averaging the pixel value (neighboring subset) of a plurality of pixels in the block .

US10250913B2
CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision (generating step) of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .

US6408097B1
CLAIM 3 . The hierarchical picture coding apparatus according to claim 2 , wherein said hierarchical data generating step (intermediate subdivision) generates a hierarchical data having low resolution by averaging the pixel value of a plurality of pixels in the block .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US6269192B1 Filed: 1998-06-30 Issued: 2001-07-31 Apparatus and method for multiscale zerotree entropy encoding (Original Assignee) Sharp Corp; Sarnoff Corp (Current Assignee) Sharp Corp ; MediaTek Inc Iraj Sodagar, Bing-Bing Chai, Paul Hatrack, Hung-Ju Lee
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision (order model) information are associated with prediction coding (probability model) and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US6269192B1 CLAIM 1 . A method for encoding an input image into a bitstream using a wavelet transform to produce a wavelet tree having a plurality of wavelet coefficients organized in a parent-child relationship into a plurality subbands , said method (root region) comprising the steps of : (a) generating a wavelet tree having a plurality of original wavelet coefficients for the input image ; (b) quantizing said plurality of original wavelet coefficients with a first quantizer ; (c) applying zerotree scanning to at least one of said plurality of subbands in a depth-first manner to assign a symbol to at least one of said quantized wavelet coefficients of said wavelet tree ; (d) coding said plurality of quantized wavelet coefficients in accordance with said assigned symbol to generate a first scalability layer ; and (e) reconstructing said quantized wavelet coefficients to generate a next scalability layer . US6269192B1 CLAIM 18 . The method of claim 17 , wherein said step of maintaining separate tables comprises the steps of : maintaining at least one table using a zeroth order model (first subdivision) and maintaining at least one table using a first order model . US6269192B1 CLAIM 20 . The method of claim 16 , further comprising the step of : selectively adjusting a maximum frequency of a probability model (prediction coding) of said adaptive arithmetic coder .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision (order model) information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region (said method) into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US6269192B1 CLAIM 1 . A method for encoding an input image into a bitstream using a wavelet transform to produce a wavelet tree having a plurality of wavelet coefficients organized in a parent-child relationship into a plurality subbands , said method (root region) comprising the steps of : (a) generating a wavelet tree having a plurality of original wavelet coefficients for the input image ; (b) quantizing said plurality of original wavelet coefficients with a first quantizer ; (c) applying zerotree scanning to at least one of said plurality of subbands in a depth-first manner to assign a symbol to at least one of said quantized wavelet coefficients of said wavelet tree ; (d) coding said plurality of quantized wavelet coefficients in accordance with said assigned symbol to generate a first scalability layer ; and (e) reconstructing said quantized wavelet coefficients to generate a next scalability layer . US6269192B1 CLAIM 18 . The method of claim 17 , wherein said step of maintaining separate tables comprises the steps of : maintaining at least one table using a zeroth order model (first subdivision) and maintaining at least one table using a first order model .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision (order model) information includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level is sub-divided .	US6269192B1 CLAIM 18 . The method of claim 17 , wherein said step of maintaining separate tables comprises the steps of : maintaining at least one table using a zeroth order model (first subdivision) and maintaining at least one table using a first order model .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision (order model) information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US6269192B1 CLAIM 18 . The method of claim 17 , wherein said step of maintaining separate tables comprises the steps of : maintaining at least one table using a zeroth order model (first subdivision) and maintaining at least one table using a first order model .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision (order model) information are associated with prediction coding (probability model) and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US6269192B1 CLAIM 1 . A method for encoding an input image into a bitstream using a wavelet transform to produce a wavelet tree having a plurality of wavelet coefficients organized in a parent-child relationship into a plurality subbands , said method (root region) comprising the steps of : (a) generating a wavelet tree having a plurality of original wavelet coefficients for the input image ; (b) quantizing said plurality of original wavelet coefficients with a first quantizer ; (c) applying zerotree scanning to at least one of said plurality of subbands in a depth-first manner to assign a symbol to at least one of said quantized wavelet coefficients of said wavelet tree ; (d) coding said plurality of quantized wavelet coefficients in accordance with said assigned symbol to generate a first scalability layer ; and (e) reconstructing said quantized wavelet coefficients to generate a next scalability layer . US6269192B1 CLAIM 18 . The method of claim 17 , wherein said step of maintaining separate tables comprises the steps of : maintaining at least one table using a zeroth order model (first subdivision) and maintaining at least one table using a first order model . US6269192B1 CLAIM 20 . The method of claim 16 , further comprising the step of : selectively adjusting a maximum frequency of a probability model (prediction coding) of said adaptive arithmetic coder .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision (order model) information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding (probability model) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US6269192B1 CLAIM 1 . A method for encoding an input image into a bitstream using a wavelet transform to produce a wavelet tree having a plurality of wavelet coefficients organized in a parent-child relationship into a plurality subbands , said method (root region) comprising the steps of : (a) generating a wavelet tree having a plurality of original wavelet coefficients for the input image ; (b) quantizing said plurality of original wavelet coefficients with a first quantizer ; (c) applying zerotree scanning to at least one of said plurality of subbands in a depth-first manner to assign a symbol to at least one of said quantized wavelet coefficients of said wavelet tree ; (d) coding said plurality of quantized wavelet coefficients in accordance with said assigned symbol to generate a first scalability layer ; and (e) reconstructing said quantized wavelet coefficients to generate a next scalability layer . US6269192B1 CLAIM 18 . The method of claim 17 , wherein said step of maintaining separate tables comprises the steps of : maintaining at least one table using a zeroth order model (first subdivision) and maintaining at least one table using a first order model . US6269192B1 CLAIM 20 . The method of claim 16 , further comprising the step of : selectively adjusting a maximum frequency of a probability model (prediction coding) of said adaptive arithmetic coder .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision (order model) information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding (probability model) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US6269192B1 CLAIM 1 . A method for encoding an input image into a bitstream using a wavelet transform to produce a wavelet tree having a plurality of wavelet coefficients organized in a parent-child relationship into a plurality subbands , said method (root region) comprising the steps of : (a) generating a wavelet tree having a plurality of original wavelet coefficients for the input image ; (b) quantizing said plurality of original wavelet coefficients with a first quantizer ; (c) applying zerotree scanning to at least one of said plurality of subbands in a depth-first manner to assign a symbol to at least one of said quantized wavelet coefficients of said wavelet tree ; (d) coding said plurality of quantized wavelet coefficients in accordance with said assigned symbol to generate a first scalability layer ; and (e) reconstructing said quantized wavelet coefficients to generate a next scalability layer . US6269192B1 CLAIM 18 . The method of claim 17 , wherein said step of maintaining separate tables comprises the steps of : maintaining at least one table using a zeroth order model (first subdivision) and maintaining at least one table using a first order model . US6269192B1 CLAIM 20 . The method of claim 16 , further comprising the step of : selectively adjusting a maximum frequency of a probability model (prediction coding) of said adaptive arithmetic coder .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US6067574A Filed: 1998-05-18 Issued: 2000-05-23 High speed routing using compressed tree process (Original Assignee) Nokia of America Corp (Current Assignee) Nokia of America Corp Hong-Yi Tzeng
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream (different bit) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size (repeating step) and the first subdivision (determined order) information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US6067574A CLAIM 2 . A method of compressing a prefix tree to reduce the number of memory accesses required to look up the interface corresponding to a prefix of an Internet Protocol address , comprising : a) assigning to an array of pages in memory a string of codes to identify an ordered selection of prefix tree nodes ; said selection comprising a subtree beginning at the root node of the prefix tree and including nodes having a predetermined order (first subdivision, first subdivision information, program code) of descent from said root until all nodes rooted at said root node have been included ; b) associating with a first page of said array a pointer to a subsequent page containing a string of codes to identify a similarly ordered selection of the remaining nodes of said prefix tree beginning at a descendent of an egress node of said subtree ; c) associating with said first page of said array a pointer to the interface information corresponding to the first valid prefix stored in said first page ; and d) repeating step (first maximum region size) s (b) and (c) for each remaining page of said array . US6067574A CLAIM 5 . A method according to claim 3 wherein said ordered selection selects the nodes identified by a particular bit value and having successively increasing degree of remoteness (" ; In-Order , Depth-First" ; ) from said root node before selecting any node identified by a different bit (data stream) value .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set of root regions such that the first set of root regions are rectangular blocks of a size determined by the first maximum region size (repeating step) , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	US6067574A CLAIM 2 . A method of compressing a prefix tree to reduce the number of memory accesses required to look up the interface corresponding to a prefix of an Internet Protocol address , comprising : a) assigning to an array of pages in memory a string of codes to identify an ordered selection of prefix tree nodes ; said selection comprising a subtree beginning at the root node of the prefix tree and including nodes having a predetermined order of descent from said root until all nodes rooted at said root node have been included ; b) associating with a first page of said array a pointer to a subsequent page containing a string of codes to identify a similarly ordered selection of the remaining nodes of said prefix tree beginning at a descendent of an egress node of said subtree ; c) associating with said first page of said array a pointer to the interface information corresponding to the first valid prefix stored in said first page ; and d) repeating step (first maximum region size) s (b) and (c) for each remaining page of said array .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision (determined order) information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US6067574A CLAIM 2 . A method of compressing a prefix tree to reduce the number of memory accesses required to look up the interface corresponding to a prefix of an Internet Protocol address , comprising : a) assigning to an array of pages in memory a string of codes to identify an ordered selection of prefix tree nodes ; said selection comprising a subtree beginning at the root node of the prefix tree and including nodes having a predetermined order (first subdivision, first subdivision information, program code) of descent from said root until all nodes rooted at said root node have been included ; b) associating with a first page of said array a pointer to a subsequent page containing a string of codes to identify a similarly ordered selection of the remaining nodes of said prefix tree beginning at a descendent of an egress node of said subtree ; c) associating with said first page of said array a pointer to the interface information corresponding to the first valid prefix stored in said first page ; and d) repeating steps (b) and (c) for each remaining page of said array .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision (determined order) information includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level is sub-divided .	US6067574A CLAIM 2 . A method of compressing a prefix tree to reduce the number of memory accesses required to look up the interface corresponding to a prefix of an Internet Protocol address , comprising : a) assigning to an array of pages in memory a string of codes to identify an ordered selection of prefix tree nodes ; said selection comprising a subtree beginning at the root node of the prefix tree and including nodes having a predetermined order (first subdivision, first subdivision information, program code) of descent from said root until all nodes rooted at said root node have been included ; b) associating with a first page of said array a pointer to a subsequent page containing a string of codes to identify a similarly ordered selection of the remaining nodes of said prefix tree beginning at a descendent of an egress node of said subtree ; c) associating with said first page of said array a pointer to the interface information corresponding to the first valid prefix stored in said first page ; and d) repeating steps (b) and (c) for each remaining page of said array .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level from the data stream (different bit) .	US6067574A CLAIM 5 . A method according to claim 3 wherein said ordered selection selects the nodes identified by a particular bit value and having successively increasing degree of remoteness (" ; In-Order , Depth-First" ; ) from said root node before selecting any node identified by a different bit (data stream) value .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements associated with the first or second set of sub-regions from the data stream (different bit) in a depth-first traversal order .	US6067574A CLAIM 5 . A method according to claim 3 wherein said ordered selection selects the nodes identified by a particular bit value and having successively increasing degree of remoteness (" ; In-Order , Depth-First" ; ) from said root node before selecting any node identified by a different bit (data stream) value .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream (different bit) , disjoint from a second subset of syntax elements of the data stream including the first subdivision (determined order) information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US6067574A CLAIM 2 . A method of compressing a prefix tree to reduce the number of memory accesses required to look up the interface corresponding to a prefix of an Internet Protocol address , comprising : a) assigning to an array of pages in memory a string of codes to identify an ordered selection of prefix tree nodes ; said selection comprising a subtree beginning at the root node of the prefix tree and including nodes having a predetermined order (first subdivision, first subdivision information, program code) of descent from said root until all nodes rooted at said root node have been included ; b) associating with a first page of said array a pointer to a subsequent page containing a string of codes to identify a similarly ordered selection of the remaining nodes of said prefix tree beginning at a descendent of an egress node of said subtree ; c) associating with said first page of said array a pointer to the interface information corresponding to the first valid prefix stored in said first page ; and d) repeating steps (b) and (c) for each remaining page of said array . US6067574A CLAIM 5 . A method according to claim 3 wherein said ordered selection selects the nodes identified by a particular bit value and having successively increasing degree of remoteness (" ; In-Order , Depth-First" ; ) from said root node before selecting any node identified by a different bit (data stream) value .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream (different bit) , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	US6067574A CLAIM 5 . A method according to claim 3 wherein said ordered selection selects the nodes identified by a particular bit value and having successively increasing degree of remoteness (" ; In-Order , Depth-First" ; ) from said root node before selecting any node identified by a different bit (data stream) value .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream (different bit) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size (repeating step) and the first subdivision (determined order) information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US6067574A CLAIM 2 . A method of compressing a prefix tree to reduce the number of memory accesses required to look up the interface corresponding to a prefix of an Internet Protocol address , comprising : a) assigning to an array of pages in memory a string of codes to identify an ordered selection of prefix tree nodes ; said selection comprising a subtree beginning at the root node of the prefix tree and including nodes having a predetermined order (first subdivision, first subdivision information, program code) of descent from said root until all nodes rooted at said root node have been included ; b) associating with a first page of said array a pointer to a subsequent page containing a string of codes to identify a similarly ordered selection of the remaining nodes of said prefix tree beginning at a descendent of an egress node of said subtree ; c) associating with said first page of said array a pointer to the interface information corresponding to the first valid prefix stored in said first page ; and d) repeating step (first maximum region size) s (b) and (c) for each remaining page of said array . US6067574A CLAIM 5 . A method according to claim 3 wherein said ordered selection selects the nodes identified by a particular bit value and having successively increasing degree of remoteness (" ; In-Order , Depth-First" ; ) from said root node before selecting any node identified by a different bit (data stream) value .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size (repeating step) , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision (determined order) information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream (different bit) generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US6067574A CLAIM 2 . A method of compressing a prefix tree to reduce the number of memory accesses required to look up the interface corresponding to a prefix of an Internet Protocol address , comprising : a) assigning to an array of pages in memory a string of codes to identify an ordered selection of prefix tree nodes ; said selection comprising a subtree beginning at the root node of the prefix tree and including nodes having a predetermined order (first subdivision, first subdivision information, program code) of descent from said root until all nodes rooted at said root node have been included ; b) associating with a first page of said array a pointer to a subsequent page containing a string of codes to identify a similarly ordered selection of the remaining nodes of said prefix tree beginning at a descendent of an egress node of said subtree ; c) associating with said first page of said array a pointer to the interface information corresponding to the first valid prefix stored in said first page ; and d) repeating step (first maximum region size) s (b) and (c) for each remaining page of said array . US6067574A CLAIM 5 . A method according to claim 3 wherein said ordered selection selects the nodes identified by a particular bit value and having successively increasing degree of remoteness (" ; In-Order , Depth-First" ; ) from said root node before selecting any node identified by a different bit (data stream) value .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size (repeating step) ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision (determined order) information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream (different bit) the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US6067574A CLAIM 2 . A method of compressing a prefix tree to reduce the number of memory accesses required to look up the interface corresponding to a prefix of an Internet Protocol address , comprising : a) assigning to an array of pages in memory a string of codes to identify an ordered selection of prefix tree nodes ; said selection comprising a subtree beginning at the root node of the prefix tree and including nodes having a predetermined order (first subdivision, first subdivision information, program code) of descent from said root until all nodes rooted at said root node have been included ; b) associating with a first page of said array a pointer to a subsequent page containing a string of codes to identify a similarly ordered selection of the remaining nodes of said prefix tree beginning at a descendent of an egress node of said subtree ; c) associating with said first page of said array a pointer to the interface information corresponding to the first valid prefix stored in said first page ; and d) repeating step (first maximum region size) s (b) and (c) for each remaining page of said array . US6067574A CLAIM 5 . A method according to claim 3 wherein said ordered selection selects the nodes identified by a particular bit value and having successively increasing degree of remoteness (" ; In-Order , Depth-First" ; ) from said root node before selecting any node identified by a different bit (data stream) value .
US10250913B2 CLAIM 15 . A non-transitory computer readable digital storage medium having stored thereon a computer program having a program code (determined order) for performing , when running on a computer , a method according to claim 12 .	US6067574A CLAIM 2 . A method of compressing a prefix tree to reduce the number of memory accesses required to look up the interface corresponding to a prefix of an Internet Protocol address , comprising : a) assigning to an array of pages in memory a string of codes to identify an ordered selection of prefix tree nodes ; said selection comprising a subtree beginning at the root node of the prefix tree and including nodes having a predetermined order (first subdivision, first subdivision information, program code) of descent from said root until all nodes rooted at said root node have been included ; b) associating with a first page of said array a pointer to a subsequent page containing a string of codes to identify a similarly ordered selection of the remaining nodes of said prefix tree beginning at a descendent of an egress node of said subtree ; c) associating with said first page of said array a pointer to the interface information corresponding to the first valid prefix stored in said first page ; and d) repeating steps (b) and (c) for each remaining page of said array .
US10250913B2 CLAIM 16 . A non-transitory computer readable digital storage medium having stored thereon a computer program having a program code (determined order) for performing , when running on a computer , a method according to claim 14 .	US6067574A CLAIM 2 . A method of compressing a prefix tree to reduce the number of memory accesses required to look up the interface corresponding to a prefix of an Internet Protocol address , comprising : a) assigning to an array of pages in memory a string of codes to identify an ordered selection of prefix tree nodes ; said selection comprising a subtree beginning at the root node of the prefix tree and including nodes having a predetermined order (first subdivision, first subdivision information, program code) of descent from said root until all nodes rooted at said root node have been included ; b) associating with a first page of said array a pointer to a subsequent page containing a string of codes to identify a similarly ordered selection of the remaining nodes of said prefix tree beginning at a descendent of an egress node of said subtree ; c) associating with said first page of said array a pointer to the interface information corresponding to the first valid prefix stored in said first page ; and d) repeating steps (b) and (c) for each remaining page of said array .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US5809270A Filed: 1997-09-25 Issued: 1998-09-15 Inverse quantizer (Original Assignee) Discovision Associates (Current Assignee) Coases Investments Bros LLC William Philip Robbins
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level (discrete cosine transform) according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US5809270A CLAIM 1 . In a pipeline system having an inverse modeller stage and an inverse discrete cosine transform (first hierarchy level) stage , the improvement comprising : a processing stage , positioned between said inverse modeller stage and said inverse discrete cosine transform stage , responsive to tokens for processing data , wherein said tokens each comprise a plurality of data words , each said word including an extension indicator which indicates a presence or an absence of additional words in said token , a length of said token being determined by said extension indicators , whereby the length of said token can be unlimited ; wherein said tokens are communicated from said inverse modeller stage to said processing stage .
US10250913B2 CLAIM 15 . A non-transitory computer readable digital storage medium having stored thereon a computer program having a program code (data word) for performing , when running on a computer , a method according to claim 12 .	US5809270A CLAIM 1 . In a pipeline system having an inverse modeller stage and an inverse discrete cosine transform stage , the improvement comprising : a processing stage , positioned between said inverse modeller stage and said inverse discrete cosine transform stage , responsive to tokens for processing data , wherein said tokens each comprise a plurality of data word (program code) s , each said word including an extension indicator which indicates a presence or an absence of additional words in said token , a length of said token being determined by said extension indicators , whereby the length of said token can be unlimited ; wherein said tokens are communicated from said inverse modeller stage to said processing stage .
US10250913B2 CLAIM 16 . A non-transitory computer readable digital storage medium having stored thereon a computer program having a program code (data word) for performing , when running on a computer , a method according to claim 14 .	US5809270A CLAIM 1 . In a pipeline system having an inverse modeller stage and an inverse discrete cosine transform stage , the improvement comprising : a processing stage , positioned between said inverse modeller stage and said inverse discrete cosine transform stage , responsive to tokens for processing data , wherein said tokens each comprise a plurality of data word (program code) s , each said word including an extension indicator which indicates a presence or an absence of additional words in said token , a length of said token being determined by said extension indicators , whereby the length of said token can be unlimited ; wherein said tokens are communicated from said inverse modeller stage to said processing stage .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US6057884A Filed: 1997-06-05 Issued: 2000-05-02 Temporal and spatial scaleable coding for video object planes (Original Assignee) Arris Technology Inc (Current Assignee) Google Technology Holdings LLC Xuemin Chen, Ajay Luthra, Ganesh Rajan, Mandayam Narasimhan
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream (data stream) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US6057884A CLAIM 8 . A method for recovering an input video sequence comprising video object planes (VOPs) which were scaled and communicated in a corresponding base layer and enhancement layer , said VOPs in said input video sequence having an associated spatial resolution and temporal resolution , wherein : pixel data of a first particular one of said VOPs of said input video sequence is downsampled and carried as a first base layer VOP having a reduced spatial resolution ; pixel data of at least a portion of said first base layer VOP is upsampled and carried as a first upsampled VOP in said enhancement layer at a temporal position corresponding to said first base layer VOP ; and said first upsampled VOP is differentially encoded using said first particular one of said VOPs of said input video sequence ; said method (root region) comprising the steps of : upsampling said pixel data of said first base layer VOP to restore said associated spatial resolution ; and processing said first upsampled VOP and said first base layer VOP with said restored associated spatial resolution to provide an output video signal with said associated spatial resolution ; wherein : a second particular one of said VOPs of said input video sequence is downsampled to provide a second base layer VOP having a reduced spatial resolution ; pixel data of at least a portion of said second base layer VOP is upsampled to provide a second upsampled VOP in said enhancement layer which corresponds to said first upsampled VOP ; at least one of said first and second base layer VOPs is used to predict an intermediate VOP corresponding to said first and second upsampled VOPs ; and said intermediate VOP is encoded for communication in said enhancement layer at a temporal position which is intermediate to that of said first and second upsampled VOPs . US6057884A CLAIM 12 . A method for recovering an input video sequence comprising video object planes (VOPs) which was scaled and communicated in a corresponding base layer and enhancement layer in a data stream (data stream) , said VOPs in said input video sequence having an associated spatial resolution and temporal resolution , wherein : first and second base layer VOPs are provided in said base layer which correspond to said input video sequence VOPs ; said second base layer VOP is predicted from said first base layer VOP according to a motion vector MV B ; a bi-directionally predicted video object plane (B-VOP) is provided in said enhancement layer at a temporal position which is intermediate to that of said first and second base layer VOPs ; and said B-VOP is encoded using a forward motion vector MV f and a backward motion vector MV p which are obtained by scaling said motion vector MV p ; said method comprising the steps of : recovering said forward motion vector MV f and said backward motion vector MV B from said data stream ; and decoding said B-VOP using said forward motion vector MV f and said backward motion vector MV B .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region (said method) into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US6057884A CLAIM 8 . A method for recovering an input video sequence comprising video object planes (VOPs) which were scaled and communicated in a corresponding base layer and enhancement layer , said VOPs in said input video sequence having an associated spatial resolution and temporal resolution , wherein : pixel data of a first particular one of said VOPs of said input video sequence is downsampled and carried as a first base layer VOP having a reduced spatial resolution ; pixel data of at least a portion of said first base layer VOP is upsampled and carried as a first upsampled VOP in said enhancement layer at a temporal position corresponding to said first base layer VOP ; and said first upsampled VOP is differentially encoded using said first particular one of said VOPs of said input video sequence ; said method (root region) comprising the steps of : upsampling said pixel data of said first base layer VOP to restore said associated spatial resolution ; and processing said first upsampled VOP and said first base layer VOP with said restored associated spatial resolution to provide an output video signal with said associated spatial resolution ; wherein : a second particular one of said VOPs of said input video sequence is downsampled to provide a second base layer VOP having a reduced spatial resolution ; pixel data of at least a portion of said second base layer VOP is upsampled to provide a second upsampled VOP in said enhancement layer which corresponds to said first upsampled VOP ; at least one of said first and second base layer VOPs is used to predict an intermediate VOP corresponding to said first and second upsampled VOPs ; and said intermediate VOP is encoded for communication in said enhancement layer at a temporal position which is intermediate to that of said first and second upsampled VOPs .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level from the data stream (data stream) .	US6057884A CLAIM 12 . A method for recovering an input video sequence comprising video object planes (VOPs) which was scaled and communicated in a corresponding base layer and enhancement layer in a data stream (data stream) , said VOPs in said input video sequence having an associated spatial resolution and temporal resolution , wherein : first and second base layer VOPs are provided in said base layer which correspond to said input video sequence VOPs ; said second base layer VOP is predicted from said first base layer VOP according to a motion vector MV B ; a bi-directionally predicted video object plane (B-VOP) is provided in said enhancement layer at a temporal position which is intermediate to that of said first and second base layer VOPs ; and said B-VOP is encoded using a forward motion vector MV f and a backward motion vector MV p which are obtained by scaling said motion vector MV p ; said method comprising the steps of : recovering said forward motion vector MV f and said backward motion vector MV B from said data stream ; and decoding said B-VOP using said forward motion vector MV f and said backward motion vector MV B .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements associated with the first or second set of sub-regions from the data stream (data stream) in a depth-first traversal order .	US6057884A CLAIM 12 . A method for recovering an input video sequence comprising video object planes (VOPs) which was scaled and communicated in a corresponding base layer and enhancement layer in a data stream (data stream) , said VOPs in said input video sequence having an associated spatial resolution and temporal resolution , wherein : first and second base layer VOPs are provided in said base layer which correspond to said input video sequence VOPs ; said second base layer VOP is predicted from said first base layer VOP according to a motion vector MV B ; a bi-directionally predicted video object plane (B-VOP) is provided in said enhancement layer at a temporal position which is intermediate to that of said first and second base layer VOPs ; and said B-VOP is encoded using a forward motion vector MV f and a backward motion vector MV p which are obtained by scaling said motion vector MV p ; said method comprising the steps of : recovering said forward motion vector MV f and said backward motion vector MV B from said data stream ; and decoding said B-VOP using said forward motion vector MV f and said backward motion vector MV B .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream (data stream) , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US6057884A CLAIM 12 . A method for recovering an input video sequence comprising video object planes (VOPs) which was scaled and communicated in a corresponding base layer and enhancement layer in a data stream (data stream) , said VOPs in said input video sequence having an associated spatial resolution and temporal resolution , wherein : first and second base layer VOPs are provided in said base layer which correspond to said input video sequence VOPs ; said second base layer VOP is predicted from said first base layer VOP according to a motion vector MV B ; a bi-directionally predicted video object plane (B-VOP) is provided in said enhancement layer at a temporal position which is intermediate to that of said first and second base layer VOPs ; and said B-VOP is encoded using a forward motion vector MV f and a backward motion vector MV p which are obtained by scaling said motion vector MV p ; said method comprising the steps of : recovering said forward motion vector MV f and said backward motion vector MV B from said data stream ; and decoding said B-VOP using said forward motion vector MV f and said backward motion vector MV B .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream (data stream) , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	US6057884A CLAIM 12 . A method for recovering an input video sequence comprising video object planes (VOPs) which was scaled and communicated in a corresponding base layer and enhancement layer in a data stream (data stream) , said VOPs in said input video sequence having an associated spatial resolution and temporal resolution , wherein : first and second base layer VOPs are provided in said base layer which correspond to said input video sequence VOPs ; said second base layer VOP is predicted from said first base layer VOP according to a motion vector MV B ; a bi-directionally predicted video object plane (B-VOP) is provided in said enhancement layer at a temporal position which is intermediate to that of said first and second base layer VOPs ; and said B-VOP is encoded using a forward motion vector MV f and a backward motion vector MV p which are obtained by scaling said motion vector MV p ; said method comprising the steps of : recovering said forward motion vector MV f and said backward motion vector MV B from said data stream ; and decoding said B-VOP using said forward motion vector MV f and said backward motion vector MV B .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream (data stream) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US6057884A CLAIM 8 . A method for recovering an input video sequence comprising video object planes (VOPs) which were scaled and communicated in a corresponding base layer and enhancement layer , said VOPs in said input video sequence having an associated spatial resolution and temporal resolution , wherein : pixel data of a first particular one of said VOPs of said input video sequence is downsampled and carried as a first base layer VOP having a reduced spatial resolution ; pixel data of at least a portion of said first base layer VOP is upsampled and carried as a first upsampled VOP in said enhancement layer at a temporal position corresponding to said first base layer VOP ; and said first upsampled VOP is differentially encoded using said first particular one of said VOPs of said input video sequence ; said method (root region) comprising the steps of : upsampling said pixel data of said first base layer VOP to restore said associated spatial resolution ; and processing said first upsampled VOP and said first base layer VOP with said restored associated spatial resolution to provide an output video signal with said associated spatial resolution ; wherein : a second particular one of said VOPs of said input video sequence is downsampled to provide a second base layer VOP having a reduced spatial resolution ; pixel data of at least a portion of said second base layer VOP is upsampled to provide a second upsampled VOP in said enhancement layer which corresponds to said first upsampled VOP ; at least one of said first and second base layer VOPs is used to predict an intermediate VOP corresponding to said first and second upsampled VOPs ; and said intermediate VOP is encoded for communication in said enhancement layer at a temporal position which is intermediate to that of said first and second upsampled VOPs . US6057884A CLAIM 12 . A method for recovering an input video sequence comprising video object planes (VOPs) which was scaled and communicated in a corresponding base layer and enhancement layer in a data stream (data stream) , said VOPs in said input video sequence having an associated spatial resolution and temporal resolution , wherein : first and second base layer VOPs are provided in said base layer which correspond to said input video sequence VOPs ; said second base layer VOP is predicted from said first base layer VOP according to a motion vector MV B ; a bi-directionally predicted video object plane (B-VOP) is provided in said enhancement layer at a temporal position which is intermediate to that of said first and second base layer VOPs ; and said B-VOP is encoded using a forward motion vector MV f and a backward motion vector MV p which are obtained by scaling said motion vector MV p ; said method comprising the steps of : recovering said forward motion vector MV f and said backward motion vector MV B from said data stream ; and decoding said B-VOP using said forward motion vector MV f and said backward motion vector MV B .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream (data stream) generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US6057884A CLAIM 8 . A method for recovering an input video sequence comprising video object planes (VOPs) which were scaled and communicated in a corresponding base layer and enhancement layer , said VOPs in said input video sequence having an associated spatial resolution and temporal resolution , wherein : pixel data of a first particular one of said VOPs of said input video sequence is downsampled and carried as a first base layer VOP having a reduced spatial resolution ; pixel data of at least a portion of said first base layer VOP is upsampled and carried as a first upsampled VOP in said enhancement layer at a temporal position corresponding to said first base layer VOP ; and said first upsampled VOP is differentially encoded using said first particular one of said VOPs of said input video sequence ; said method (root region) comprising the steps of : upsampling said pixel data of said first base layer VOP to restore said associated spatial resolution ; and processing said first upsampled VOP and said first base layer VOP with said restored associated spatial resolution to provide an output video signal with said associated spatial resolution ; wherein : a second particular one of said VOPs of said input video sequence is downsampled to provide a second base layer VOP having a reduced spatial resolution ; pixel data of at least a portion of said second base layer VOP is upsampled to provide a second upsampled VOP in said enhancement layer which corresponds to said first upsampled VOP ; at least one of said first and second base layer VOPs is used to predict an intermediate VOP corresponding to said first and second upsampled VOPs ; and said intermediate VOP is encoded for communication in said enhancement layer at a temporal position which is intermediate to that of said first and second upsampled VOPs . US6057884A CLAIM 12 . A method for recovering an input video sequence comprising video object planes (VOPs) which was scaled and communicated in a corresponding base layer and enhancement layer in a data stream (data stream) , said VOPs in said input video sequence having an associated spatial resolution and temporal resolution , wherein : first and second base layer VOPs are provided in said base layer which correspond to said input video sequence VOPs ; said second base layer VOP is predicted from said first base layer VOP according to a motion vector MV B ; a bi-directionally predicted video object plane (B-VOP) is provided in said enhancement layer at a temporal position which is intermediate to that of said first and second base layer VOPs ; and said B-VOP is encoded using a forward motion vector MV f and a backward motion vector MV p which are obtained by scaling said motion vector MV p ; said method comprising the steps of : recovering said forward motion vector MV f and said backward motion vector MV B from said data stream ; and decoding said B-VOP using said forward motion vector MV f and said backward motion vector MV B .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region (said method) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream (data stream) the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US6057884A CLAIM 8 . A method for recovering an input video sequence comprising video object planes (VOPs) which were scaled and communicated in a corresponding base layer and enhancement layer , said VOPs in said input video sequence having an associated spatial resolution and temporal resolution , wherein : pixel data of a first particular one of said VOPs of said input video sequence is downsampled and carried as a first base layer VOP having a reduced spatial resolution ; pixel data of at least a portion of said first base layer VOP is upsampled and carried as a first upsampled VOP in said enhancement layer at a temporal position corresponding to said first base layer VOP ; and said first upsampled VOP is differentially encoded using said first particular one of said VOPs of said input video sequence ; said method (root region) comprising the steps of : upsampling said pixel data of said first base layer VOP to restore said associated spatial resolution ; and processing said first upsampled VOP and said first base layer VOP with said restored associated spatial resolution to provide an output video signal with said associated spatial resolution ; wherein : a second particular one of said VOPs of said input video sequence is downsampled to provide a second base layer VOP having a reduced spatial resolution ; pixel data of at least a portion of said second base layer VOP is upsampled to provide a second upsampled VOP in said enhancement layer which corresponds to said first upsampled VOP ; at least one of said first and second base layer VOPs is used to predict an intermediate VOP corresponding to said first and second upsampled VOPs ; and said intermediate VOP is encoded for communication in said enhancement layer at a temporal position which is intermediate to that of said first and second upsampled VOPs . US6057884A CLAIM 12 . A method for recovering an input video sequence comprising video object planes (VOPs) which was scaled and communicated in a corresponding base layer and enhancement layer in a data stream (data stream) , said VOPs in said input video sequence having an associated spatial resolution and temporal resolution , wherein : first and second base layer VOPs are provided in said base layer which correspond to said input video sequence VOPs ; said second base layer VOP is predicted from said first base layer VOP according to a motion vector MV B ; a bi-directionally predicted video object plane (B-VOP) is provided in said enhancement layer at a temporal position which is intermediate to that of said first and second base layer VOPs ; and said B-VOP is encoded using a forward motion vector MV f and a backward motion vector MV p which are obtained by scaling said motion vector MV p ; said method comprising the steps of : recovering said forward motion vector MV f and said backward motion vector MV B from said data stream ; and decoding said B-VOP using said forward motion vector MV f and said backward motion vector MV B .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US6005981A Filed: 1996-04-11 Issued: 1999-12-21 Quadtree-structured coding of color images and intra-coded images (Original Assignee) National Semiconductor Corp (Current Assignee) National Semiconductor Corp Hak-Leong Ng, Xiaonong Ran
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information (coded blocks) , and a maximum hierarchy level wherein the first maximum region (components a) size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US6005981A CLAIM 2 . The method of claim 1 , wherein the first components a (first maximum region) re luminances of the pixels , and the second components are chrominances of pixels . US6005981A CLAIM 8 . A method for intra-coding an image , comprising : partitioning the image into root blocks ; forming a quadtree partition of each root block , each quadtree partition including blocks of different sizes , wherein forming the quadtree partition of each root block , comprises : determining a first quadtree partition for a first array representing the root block , wherein the first array contains first color components of pixels in the root block , the first quadtree partition being associated with a first quadtree structure ; partitioning a second array into a second partition associated with the first quadtree structure , wherein the second array contains second color components of pixels in the root block ; and merging blocks of the second partition to determine a third partition , the third partition being associated with a second quadtree structure that is a sub-tree of the first quadtree structure and is formed by removing branches from the first quadtree structure ; and encoding the blocks , wherein for each block in each quadtree partition , encoding comprises : determining a vector indicating image content within the block ; selecting a base vector for the block , wherein if the block is encoded after at least one other block in the quadtree partition , the base vector depends upon vectors for one or more previously encoded blocks (second subdivision information) in the quadtree partition ; determining a difference between the vector and the base vector ; and encoding the difference .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set of root regions such that the first set of root regions are rectangular blocks of a size determined by the first maximum region (components a) size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	US6005981A CLAIM 2 . The method of claim 1 , wherein the first components a (first maximum region) re luminances of the pixels , and the second components are chrominances of pixels .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information (coded blocks) , and a maximum hierarchy level , wherein the first maximum region (components a) size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US6005981A CLAIM 2 . The method of claim 1 , wherein the first components a (first maximum region) re luminances of the pixels , and the second components are chrominances of pixels . US6005981A CLAIM 8 . A method for intra-coding an image , comprising : partitioning the image into root blocks ; forming a quadtree partition of each root block , each quadtree partition including blocks of different sizes , wherein forming the quadtree partition of each root block , comprises : determining a first quadtree partition for a first array representing the root block , wherein the first array contains first color components of pixels in the root block , the first quadtree partition being associated with a first quadtree structure ; partitioning a second array into a second partition associated with the first quadtree structure , wherein the second array contains second color components of pixels in the root block ; and merging blocks of the second partition to determine a third partition , the third partition being associated with a second quadtree structure that is a sub-tree of the first quadtree structure and is formed by removing branches from the first quadtree structure ; and encoding the blocks , wherein for each block in each quadtree partition , encoding comprises : determining a vector indicating image content within the block ; selecting a base vector for the block , wherein if the block is encoded after at least one other block in the quadtree partition , the base vector depends upon vectors for one or more previously encoded blocks (second subdivision information) in the quadtree partition ; determining a difference between the vector and the base vector ; and encoding the difference .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region (components a) size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information (coded blocks) and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US6005981A CLAIM 2 . The method of claim 1 , wherein the first components a (first maximum region) re luminances of the pixels , and the second components are chrominances of pixels . US6005981A CLAIM 8 . A method for intra-coding an image , comprising : partitioning the image into root blocks ; forming a quadtree partition of each root block , each quadtree partition including blocks of different sizes , wherein forming the quadtree partition of each root block , comprises : determining a first quadtree partition for a first array representing the root block , wherein the first array contains first color components of pixels in the root block , the first quadtree partition being associated with a first quadtree structure ; partitioning a second array into a second partition associated with the first quadtree structure , wherein the second array contains second color components of pixels in the root block ; and merging blocks of the second partition to determine a third partition , the third partition being associated with a second quadtree structure that is a sub-tree of the first quadtree structure and is formed by removing branches from the first quadtree structure ; and encoding the blocks , wherein for each block in each quadtree partition , encoding comprises : determining a vector indicating image content within the block ; selecting a base vector for the block , wherein if the block is encoded after at least one other block in the quadtree partition , the base vector depends upon vectors for one or more previously encoded blocks (second subdivision information) in the quadtree partition ; determining a difference between the vector and the base vector ; and encoding the difference .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region (components a) size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information (coded blocks) and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US6005981A CLAIM 2 . The method of claim 1 , wherein the first components a (first maximum region) re luminances of the pixels , and the second components are chrominances of pixels . US6005981A CLAIM 8 . A method for intra-coding an image , comprising : partitioning the image into root blocks ; forming a quadtree partition of each root block , each quadtree partition including blocks of different sizes , wherein forming the quadtree partition of each root block , comprises : determining a first quadtree partition for a first array representing the root block , wherein the first array contains first color components of pixels in the root block , the first quadtree partition being associated with a first quadtree structure ; partitioning a second array into a second partition associated with the first quadtree structure , wherein the second array contains second color components of pixels in the root block ; and merging blocks of the second partition to determine a third partition , the third partition being associated with a second quadtree structure that is a sub-tree of the first quadtree structure and is formed by removing branches from the first quadtree structure ; and encoding the blocks , wherein for each block in each quadtree partition , encoding comprises : determining a vector indicating image content within the block ; selecting a base vector for the block , wherein if the block is encoded after at least one other block in the quadtree partition , the base vector depends upon vectors for one or more previously encoded blocks (second subdivision information) in the quadtree partition ; determining a difference between the vector and the base vector ; and encoding the difference .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20100046906A1 Filed: 2009-11-04 Issued: 2010-02-25 Image Processing Method, Image Recording Method, Image Processing Device and Image File Format (Original Assignee) Panasonic Corp (Current Assignee) Panasonic Corp Katsuhiro Kanamori, Hiroyoshi Komobuchi, Hideto Motomura, Kenji Kondo, Takeo Azuma
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy (color component) level wherein the first maximum region (components a) size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20100046906A1 CLAIM 8 . The image processing device of claim 7 , wherein the multi-pixel-resolution image pick-up section splits a taken color image into a plurality of primary color component (maximum hierarchy, maximum hierarchy level, hierarchy level) s and splits one of the primary color components into a specular reflection component and a diffuse reflection component , and wherein a diffuse reflection component and a specular reflection component of the color image are obtained by using the obtained specular reflection component and diffuse reflection component .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set of root regions such that the first set of root regions are rectangular blocks (filtering process) of a size determined by the first maximum region (components a) size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	US20100046906A1 CLAIM 2 . An image processing device , comprising : a multi-pixel-resolution image pick-up section for obtaining multi-pixel-resolution video data by taking an image with a high resolution in a window region being a portion of an entire image and whose position changes every frame while taking an image with a low resolution outside the window region ; a downward resolution conversion section for performing an image filtering process (rectangular blocks) on the high-resolution image in the window region to decrease a resolution of the high-resolution image ; a low-resolution video recording section for recording low-resolution video data obtained from an output of the downward resolution conversion section and the multi-pixel-resolution video data ; a resolution increasing parameter learning section for learning a resolution increasing parameter by using the high-resolution image in the window region and the output of the downward resolution conversion section ; and a resolution increasing parameter recording section for recording the resolution increasing parameter . US20100046906A1 CLAIM 8 . The image processing device of claim 7 , wherein the multi-pixel-resolution image pick-up section splits a taken color image into a plurality of primary color components a (first maximum region) nd splits one of the primary color components into a specular reflection component and a diffuse reflection component , and wherein a diffuse reflection component and a specular reflection component of the color image are obtained by using the obtained specular reflection component and diffuse reflection component .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level (color component) according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition (data record) rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy (color component) level is reached .	US20100046906A1 CLAIM 8 . The image processing device of claim 7 , wherein the multi-pixel-resolution image pick-up section splits a taken color image into a plurality of primary color component (maximum hierarchy, maximum hierarchy level, hierarchy level) s and splits one of the primary color components into a specular reflection component and a diffuse reflection component , and wherein a diffuse reflection component and a specular reflection component of the color image are obtained by using the obtained specular reflection component and diffuse reflection component . US20100046906A1 CLAIM 14 . An image processing device for obtaining a resolution increasing parameter by using multi-pixel-resolution video data record (respective partition) ed by another image processing device comprising a) a multi-pixel-resolution image pick-up section for obtaining multi-pixel-resolution video data by taking an image with a high resolution in a window region being a portion of an entire image and whose position changes every frame while taking an image with a low resolution outside the window region and b) a multi-pixel-resolution video recording section for recording the multi-pixel-resolution video data while the multi-pixel-resolution video data is split into low-resolution video data and differential video data representing a difference between the multi-pixel-resolution video data and the low-resolution video data , the image processing device comprising : a video separation section for reading the multi-pixel-resolution video data and separating the low-resolution video data therefrom and for obtaining the high-resolution image in the window region by using the differential video data ; a resolution increasing parameter learning section for learning a resolution increasing parameter by using the high-resolution image in the window region and the low-resolution video data ; and a resolution increasing parameter recording section for recording the resolution increasing parameter .
US10250913B2 CLAIM 5 . The decoder according to claim 4 , wherein the divider is configured to , in accordance with the partition rules associated with the first and higher-order hierarchy levels , sub-divide into sub-regions of equal size , such that there are an equal number of sub-regions at each hierarchy level (color component) .	US20100046906A1 CLAIM 8 . The image processing device of claim 7 , wherein the multi-pixel-resolution image pick-up section splits a taken color image into a plurality of primary color component (maximum hierarchy, maximum hierarchy level, hierarchy level) s and splits one of the primary color components into a specular reflection component and a diffuse reflection component , and wherein a diffuse reflection component and a specular reflection component of the color image are obtained by using the obtained specular reflection component and diffuse reflection component .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision information includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level (color component) is sub-divided .	US20100046906A1 CLAIM 8 . The image processing device of claim 7 , wherein the multi-pixel-resolution image pick-up section splits a taken color image into a plurality of primary color component (maximum hierarchy, maximum hierarchy level, hierarchy level) s and splits one of the primary color components into a specular reflection component and a diffuse reflection component , and wherein a diffuse reflection component and a specular reflection component of the color image are obtained by using the obtained specular reflection component and diffuse reflection component .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy (color component) level from the data stream .	US20100046906A1 CLAIM 8 . The image processing device of claim 7 , wherein the multi-pixel-resolution image pick-up section splits a taken color image into a plurality of primary color component (maximum hierarchy, maximum hierarchy level, hierarchy level) s and splits one of the primary color components into a specular reflection component and a diffuse reflection component , and wherein a diffuse reflection component and a specular reflection component of the color image are obtained by using the obtained specular reflection component and diffuse reflection component .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy (color component) level , wherein the first maximum region (components a) size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20100046906A1 CLAIM 8 . The image processing device of claim 7 , wherein the multi-pixel-resolution image pick-up section splits a taken color image into a plurality of primary color component (maximum hierarchy, maximum hierarchy level, hierarchy level) s and splits one of the primary color components into a specular reflection component and a diffuse reflection component , and wherein a diffuse reflection component and a specular reflection component of the color image are obtained by using the obtained specular reflection component and diffuse reflection component .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region (components a) size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy (color component) level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20100046906A1 CLAIM 8 . The image processing device of claim 7 , wherein the multi-pixel-resolution image pick-up section splits a taken color image into a plurality of primary color component (maximum hierarchy, maximum hierarchy level, hierarchy level) s and splits one of the primary color components into a specular reflection component and a diffuse reflection component , and wherein a diffuse reflection component and a specular reflection component of the color image are obtained by using the obtained specular reflection component and diffuse reflection component .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region (components a) size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy (color component) level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20100046906A1 CLAIM 8 . The image processing device of claim 7 , wherein the multi-pixel-resolution image pick-up section splits a taken color image into a plurality of primary color component (maximum hierarchy, maximum hierarchy level, hierarchy level) s and splits one of the primary color components into a specular reflection component and a diffuse reflection component , and wherein a diffuse reflection component and a specular reflection component of the color image are obtained by using the obtained specular reflection component and diffuse reflection component .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	WO2010039731A2 Filed: 2009-09-29 Issued: 2010-04-08 Video coding with large macroblocks (Original Assignee) Qualcomm Incorporated Peisong Chen, Yan Ye, Marta Karczewicz
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (video encoder) information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding (code one) ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	WO2010039731A2 CLAIM 1 . A method comprising : receiving , with a video encoder (second subdivision, second subset, second subdivision information) , a video block having a size of more than 16x16 pixels ; partitioning the block into partitions ; encoding one of the partitions using a first encoding mode ; encoding another of the partitions using a second encoding mode different from the first encoding mode ; and generating block-type syntax information that indicates the size of the block and identifies the partitions and the encoding modes used to encode the partitions . WO2010039731A2 CLAIM 10 . An apparatus comprising a video encoder configured to : receive a video block having a size of more than 16x16 pixels ; partition the block into partitions ; encode one (transform coding) of the partitions using a first encoding mode ; encode another of the partitions using a second encoding mode different from the first encoding mode ; and generate block-type syntax information that indicates the size of the block and identifies the partitions and the encoding modes used to encode the partitions .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset (video encoder) of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	WO2010039731A2 CLAIM 1 . A method comprising : receiving , with a video encoder (second subdivision, second subset, second subdivision information) , a video block having a size of more than 16x16 pixels ; partitioning the block into partitions ; encoding one of the partitions using a first encoding mode ; encoding another of the partitions using a second encoding mode different from the first encoding mode ; and generating block-type syntax information that indicates the size of the block and identifies the partitions and the encoding modes used to encode the partitions .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding (code one) to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	WO2010039731A2 CLAIM 10 . An apparatus comprising a video encoder configured to : receive a video block having a size of more than 16x16 pixels ; partition the block into partitions ; encode one (transform coding) of the partitions using a first encoding mode ; encode another of the partitions using a second encoding mode different from the first encoding mode ; and generate block-type syntax information that indicates the size of the block and identifies the partitions and the encoding modes used to encode the partitions .
US10250913B2 CLAIM 11 . The decoder according to claim 1 , wherein the recursive multi-tree partitioning includes a quadtree partitioning (coding one) technique .	WO2010039731A2 CLAIM 1 . A method comprising : receiving , with a video encoder , a video block having a size of more than 16x16 pixels ; partitioning the block into partitions ; encoding one (quadtree partitioning, quadtree partitioning technique) of the partitions using a first encoding mode ; encoding another of the partitions using a second encoding mode different from the first encoding mode ; and generating block-type syntax information that indicates the size of the block and identifies the partitions and the encoding modes used to encode the partitions .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (video encoder) information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding (code one) ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	WO2010039731A2 CLAIM 1 . A method comprising : receiving , with a video encoder (second subdivision, second subset, second subdivision information) , a video block having a size of more than 16x16 pixels ; partitioning the block into partitions ; encoding one of the partitions using a first encoding mode ; encoding another of the partitions using a second encoding mode different from the first encoding mode ; and generating block-type syntax information that indicates the size of the block and identifies the partitions and the encoding modes used to encode the partitions . WO2010039731A2 CLAIM 10 . An apparatus comprising a video encoder configured to : receive a video block having a size of more than 16x16 pixels ; partition the block into partitions ; encode one (transform coding) of the partitions using a first encoding mode ; encode another of the partitions using a second encoding mode different from the first encoding mode ; and generate block-type syntax information that indicates the size of the block and identifies the partitions and the encoding modes used to encode the partitions .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (video encoder) information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding (code one) in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	WO2010039731A2 CLAIM 1 . A method comprising : receiving , with a video encoder (second subdivision, second subset, second subdivision information) , a video block having a size of more than 16x16 pixels ; partitioning the block into partitions ; encoding one of the partitions using a first encoding mode ; encoding another of the partitions using a second encoding mode different from the first encoding mode ; and generating block-type syntax information that indicates the size of the block and identifies the partitions and the encoding modes used to encode the partitions . WO2010039731A2 CLAIM 10 . An apparatus comprising a video encoder configured to : receive a video block having a size of more than 16x16 pixels ; partition the block into partitions ; encode one (transform coding) of the partitions using a first encoding mode ; encode another of the partitions using a second encoding mode different from the first encoding mode ; and generate block-type syntax information that indicates the size of the block and identifies the partitions and the encoding modes used to encode the partitions .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (video encoder) information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding (code one) in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	WO2010039731A2 CLAIM 1 . A method comprising : receiving , with a video encoder (second subdivision, second subset, second subdivision information) , a video block having a size of more than 16x16 pixels ; partitioning the block into partitions ; encoding one of the partitions using a first encoding mode ; encoding another of the partitions using a second encoding mode different from the first encoding mode ; and generating block-type syntax information that indicates the size of the block and identifies the partitions and the encoding modes used to encode the partitions . WO2010039731A2 CLAIM 10 . An apparatus comprising a video encoder configured to : receive a video block having a size of more than 16x16 pixels ; partition the block into partitions ; encode one (transform coding) of the partitions using a first encoding mode ; encode another of the partitions using a second encoding mode different from the first encoding mode ; and generate block-type syntax information that indicates the size of the block and identifies the partitions and the encoding modes used to encode the partitions .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20100086030A1 Filed: 2009-09-18 Issued: 2010-04-08 Video coding with large macroblocks (Original Assignee) Qualcomm Inc (Current Assignee) Velos Media LLC Peisong Chen, Yan Ye, Marta Karczewicz
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (video encoder) information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding (code one) ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20100086030A1 CLAIM 1 . A method comprising : receiving , with a video encoder (second subdivision, second subset, second subdivision information) , a video block having a size of more than 16×16 pixels ; partitioning the block into partitions ; encoding one of the partitions using a first encoding mode ; encoding another of the partitions using a second encoding mode different from the first encoding mode ; and generating block-type syntax information that indicates the size of the block and identifies the partitions and the encoding modes used to encode the partitions . US20100086030A1 CLAIM 10 . An apparatus comprising a video encoder configured to : receive a video block having a size of more than 16×16 pixels ; partition the block into partitions ; encode one (transform coding) of the partitions using a first encoding mode ; encode another of the partitions using a second encoding mode different from the first encoding mode ; and generate block-type syntax information that indicates the size of the block and identifies the partitions and the encoding modes used to encode the partitions .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset (video encoder) of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20100086030A1 CLAIM 1 . A method comprising : receiving , with a video encoder (second subdivision, second subset, second subdivision information) , a video block having a size of more than 16×16 pixels ; partitioning the block into partitions ; encoding one of the partitions using a first encoding mode ; encoding another of the partitions using a second encoding mode different from the first encoding mode ; and generating block-type syntax information that indicates the size of the block and identifies the partitions and the encoding modes used to encode the partitions .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding (code one) to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	US20100086030A1 CLAIM 10 . An apparatus comprising a video encoder configured to : receive a video block having a size of more than 16×16 pixels ; partition the block into partitions ; encode one (transform coding) of the partitions using a first encoding mode ; encode another of the partitions using a second encoding mode different from the first encoding mode ; and generate block-type syntax information that indicates the size of the block and identifies the partitions and the encoding modes used to encode the partitions .
US10250913B2 CLAIM 11 . The decoder according to claim 1 , wherein the recursive multi-tree partitioning includes a quadtree partitioning (coding one) technique .	US20100086030A1 CLAIM 1 . A method comprising : receiving , with a video encoder , a video block having a size of more than 16×16 pixels ; partitioning the block into partitions ; encoding one (quadtree partitioning, quadtree partitioning technique) of the partitions using a first encoding mode ; encoding another of the partitions using a second encoding mode different from the first encoding mode ; and generating block-type syntax information that indicates the size of the block and identifies the partitions and the encoding modes used to encode the partitions .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (video encoder) information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding (code one) ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20100086030A1 CLAIM 1 . A method comprising : receiving , with a video encoder (second subdivision, second subset, second subdivision information) , a video block having a size of more than 16×16 pixels ; partitioning the block into partitions ; encoding one of the partitions using a first encoding mode ; encoding another of the partitions using a second encoding mode different from the first encoding mode ; and generating block-type syntax information that indicates the size of the block and identifies the partitions and the encoding modes used to encode the partitions . US20100086030A1 CLAIM 10 . An apparatus comprising a video encoder configured to : receive a video block having a size of more than 16×16 pixels ; partition the block into partitions ; encode one (transform coding) of the partitions using a first encoding mode ; encode another of the partitions using a second encoding mode different from the first encoding mode ; and generate block-type syntax information that indicates the size of the block and identifies the partitions and the encoding modes used to encode the partitions .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (video encoder) information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding (code one) in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20100086030A1 CLAIM 1 . A method comprising : receiving , with a video encoder (second subdivision, second subset, second subdivision information) , a video block having a size of more than 16×16 pixels ; partitioning the block into partitions ; encoding one of the partitions using a first encoding mode ; encoding another of the partitions using a second encoding mode different from the first encoding mode ; and generating block-type syntax information that indicates the size of the block and identifies the partitions and the encoding modes used to encode the partitions . US20100086030A1 CLAIM 10 . An apparatus comprising a video encoder configured to : receive a video block having a size of more than 16×16 pixels ; partition the block into partitions ; encode one (transform coding) of the partitions using a first encoding mode ; encode another of the partitions using a second encoding mode different from the first encoding mode ; and generate block-type syntax information that indicates the size of the block and identifies the partitions and the encoding modes used to encode the partitions .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (video encoder) information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding (code one) in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20100086030A1 CLAIM 1 . A method comprising : receiving , with a video encoder (second subdivision, second subset, second subdivision information) , a video block having a size of more than 16×16 pixels ; partitioning the block into partitions ; encoding one of the partitions using a first encoding mode ; encoding another of the partitions using a second encoding mode different from the first encoding mode ; and generating block-type syntax information that indicates the size of the block and identifies the partitions and the encoding modes used to encode the partitions . US20100086030A1 CLAIM 10 . An apparatus comprising a video encoder configured to : receive a video block having a size of more than 16×16 pixels ; partition the block into partitions ; encode one (transform coding) of the partitions using a first encoding mode ; encode another of the partitions using a second encoding mode different from the first encoding mode ; and generate block-type syntax information that indicates the size of the block and identifies the partitions and the encoding modes used to encode the partitions .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20100086049A1 Filed: 2009-07-23 Issued: 2010-04-08 Video coding using transforms bigger than 4x4 and 8x8 (Original Assignee) Qualcomm Inc (Current Assignee) Qualcomm Inc Yan Ye, Peisong Chen, Marta Karczewicz
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream (entropy decoding) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (video frame) information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision (video frame) information are associated with prediction coding (coded block pattern) and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20100086049A1 CLAIM 1 . A method of encoding video data , the method comprising : applying spatial prediction or motion compensation to an original video block within a video frame (second subdivision, first subdivision) to generate a prediction video block based on a prediction mode ; subtracting the prediction video block from the original video block within the video frame to form a residual block ; selecting a transform having a first transform size to apply to the residual block ; generating header data indicative of the selected transform , the header data comprising a first syntax element having a first value indicative of at least one transform size and a second syntax element indicative of a prediction block size of the prediction video block , wherein the first syntax element and the second syntax element in conjunction are indicative of the first transform size ; applying the selected transform to the residual block to generate residual transform coefficients ; and generating a video signal based on the header data and the residual transform coefficients . US20100086049A1 CLAIM 2 . The method of claim 1 , wherein the header data further comprises a third syntax element indicative of a coded block pattern (prediction coding) , the third syntax element comprising a second value , and wherein the first syntax element sequentially follows after the third syntax element if the second value is non-zero . US20100086049A1 CLAIM 36 . The apparatus of claim 35 , wherein the means for receiving comprises a receiver , the means for applying spatial prediction or motion compensation comprises a prediction unit , the means for determining the first transform size comprises an entropy decoding (data stream) unit , the means for applying inverse transform comprises an inverse transform unit , and the means for adding comprises a summer .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision (video frame) information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level (discrete cosine transform) according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20100086049A1 CLAIM 1 . A method of encoding video data , the method comprising : applying spatial prediction or motion compensation to an original video block within a video frame (second subdivision, first subdivision) to generate a prediction video block based on a prediction mode ; subtracting the prediction video block from the original video block within the video frame to form a residual block ; selecting a transform having a first transform size to apply to the residual block ; generating header data indicative of the selected transform , the header data comprising a first syntax element having a first value indicative of at least one transform size and a second syntax element indicative of a prediction block size of the prediction video block , wherein the first syntax element and the second syntax element in conjunction are indicative of the first transform size ; applying the selected transform to the residual block to generate residual transform coefficients ; and generating a video signal based on the header data and the residual transform coefficients . US20100086049A1 CLAIM 15 . The method of claim 1 , wherein the selected transform is a discrete cosine transform (first hierarchy level) .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision (video frame) information includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level is sub-divided .	US20100086049A1 CLAIM 1 . A method of encoding video data , the method comprising : applying spatial prediction or motion compensation to an original video block within a video frame (second subdivision, first subdivision) to generate a prediction video block based on a prediction mode ; subtracting the prediction video block from the original video block within the video frame to form a residual block ; selecting a transform having a first transform size to apply to the residual block ; generating header data indicative of the selected transform , the header data comprising a first syntax element having a first value indicative of at least one transform size and a second syntax element indicative of a prediction block size of the prediction video block , wherein the first syntax element and the second syntax element in conjunction are indicative of the first transform size ; applying the selected transform to the residual block to generate residual transform coefficients ; and generating a video signal based on the header data and the residual transform coefficients .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level from the data stream (entropy decoding) .	US20100086049A1 CLAIM 36 . The apparatus of claim 35 , wherein the means for receiving comprises a receiver , the means for applying spatial prediction or motion compensation comprises a prediction unit , the means for determining the first transform size comprises an entropy decoding (data stream) unit , the means for applying inverse transform comprises an inverse transform unit , and the means for adding comprises a summer .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements associated with the first or second set of sub-regions from the data stream (entropy decoding) in a depth-first traversal order .	US20100086049A1 CLAIM 36 . The apparatus of claim 35 , wherein the means for receiving comprises a receiver , the means for applying spatial prediction or motion compensation comprises a prediction unit , the means for determining the first transform size comprises an entropy decoding (data stream) unit , the means for applying inverse transform comprises an inverse transform unit , and the means for adding comprises a summer .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream (entropy decoding) , disjoint from a second subset of syntax elements of the data stream including the first subdivision (video frame) information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	US20100086049A1 CLAIM 1 . A method of encoding video data , the method comprising : applying spatial prediction or motion compensation to an original video block within a video frame (second subdivision, first subdivision) to generate a prediction video block based on a prediction mode ; subtracting the prediction video block from the original video block within the video frame to form a residual block ; selecting a transform having a first transform size to apply to the residual block ; generating header data indicative of the selected transform , the header data comprising a first syntax element having a first value indicative of at least one transform size and a second syntax element indicative of a prediction block size of the prediction video block , wherein the first syntax element and the second syntax element in conjunction are indicative of the first transform size ; applying the selected transform to the residual block to generate residual transform coefficients ; and generating a video signal based on the header data and the residual transform coefficients . US20100086049A1 CLAIM 36 . The apparatus of claim 35 , wherein the means for receiving comprises a receiver , the means for applying spatial prediction or motion compensation comprises a prediction unit , the means for determining the first transform size comprises an entropy decoding (data stream) unit , the means for applying inverse transform comprises an inverse transform unit , and the means for adding comprises a summer .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream (entropy decoding) , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	US20100086049A1 CLAIM 36 . The apparatus of claim 35 , wherein the means for receiving comprises a receiver , the means for applying spatial prediction or motion compensation comprises a prediction unit , the means for determining the first transform size comprises an entropy decoding (data stream) unit , the means for applying inverse transform comprises an inverse transform unit , and the means for adding comprises a summer .
US10250913B2 CLAIM 11 . The decoder according to claim 1 , wherein the recursive multi-tree partitioning includes a quadtree partitioning (prediction unit, partition size) technique .	US20100086049A1 CLAIM 34 . The apparatus of claim 33 , wherein the means for applying spatial prediction or motion compensation comprises a prediction unit (quadtree partitioning, quadtree partitioning technique) , the means for subtracting comprises a summer , the means for selecting the transform size comprises a mode decision unit , the means for generating header data comprises an entropy encoding unit , the means for applying the selected transform comprises a block transform unit , and the means for generating a video signal comprises the entropy encoding unit . US20100086049A1 CLAIM 35 . An apparatus for decoding video data , the apparatus comprising : means for receiving a video signal indicative of at least one block within a frame of video comprising header data for the at least one block and residual transform coefficients for the at least one block , the header data comprising a first syntax element having a first value indicative of at least one transform size and a second syntax element indicative of a motion partition size (quadtree partitioning, quadtree partitioning technique) of the at least one block , wherein the first syntax element and the second syntax element in conjunction are indicative of a transform having a first transform size used to encode the at least one block ; means for applying spatial prediction or motion compensation to the at least one block to generate a prediction video block of the prediction block size of the at least one block ; means for determining the first transform size used to encode the at least one block based on the first syntax element and the second syntax element ; means for applying an inverse transform of the determined first transform size on the residual transform coefficients to obtain a decoded residual block ; and means for adding the decoded residual block to the prediction video block to obtain a decoded video block .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream (entropy decoding) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision (video frame) information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision (video frame) information are associated with prediction coding (coded block pattern) and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20100086049A1 CLAIM 1 . A method of encoding video data , the method comprising : applying spatial prediction or motion compensation to an original video block within a video frame (second subdivision, first subdivision) to generate a prediction video block based on a prediction mode ; subtracting the prediction video block from the original video block within the video frame to form a residual block ; selecting a transform having a first transform size to apply to the residual block ; generating header data indicative of the selected transform , the header data comprising a first syntax element having a first value indicative of at least one transform size and a second syntax element indicative of a prediction block size of the prediction video block , wherein the first syntax element and the second syntax element in conjunction are indicative of the first transform size ; applying the selected transform to the residual block to generate residual transform coefficients ; and generating a video signal based on the header data and the residual transform coefficients . US20100086049A1 CLAIM 2 . The method of claim 1 , wherein the header data further comprises a third syntax element indicative of a coded block pattern (prediction coding) , the third syntax element comprising a second value , and wherein the first syntax element sequentially follows after the third syntax element if the second value is non-zero . US20100086049A1 CLAIM 36 . The apparatus of claim 35 , wherein the means for receiving comprises a receiver , the means for applying spatial prediction or motion compensation comprises a prediction unit , the means for determining the first transform size comprises an entropy decoding (data stream) unit , the means for applying inverse transform comprises an inverse transform unit , and the means for adding comprises a summer .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision (video frame) information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (video frame) information and a maximum hierarchy level ; and a data stream (entropy decoding) generator configured to : encode the array of information samples using prediction coding (coded block pattern) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20100086049A1 CLAIM 1 . A method of encoding video data , the method comprising : applying spatial prediction or motion compensation to an original video block within a video frame (second subdivision, first subdivision) to generate a prediction video block based on a prediction mode ; subtracting the prediction video block from the original video block within the video frame to form a residual block ; selecting a transform having a first transform size to apply to the residual block ; generating header data indicative of the selected transform , the header data comprising a first syntax element having a first value indicative of at least one transform size and a second syntax element indicative of a prediction block size of the prediction video block , wherein the first syntax element and the second syntax element in conjunction are indicative of the first transform size ; applying the selected transform to the residual block to generate residual transform coefficients ; and generating a video signal based on the header data and the residual transform coefficients . US20100086049A1 CLAIM 2 . The method of claim 1 , wherein the header data further comprises a third syntax element indicative of a coded block pattern (prediction coding) , the third syntax element comprising a second value , and wherein the first syntax element sequentially follows after the third syntax element if the second value is non-zero . US20100086049A1 CLAIM 36 . The apparatus of claim 35 , wherein the means for receiving comprises a receiver , the means for applying spatial prediction or motion compensation comprises a prediction unit , the means for determining the first transform size comprises an entropy decoding (data stream) unit , the means for applying inverse transform comprises an inverse transform unit , and the means for adding comprises a summer .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision (video frame) information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision (video frame) information and a maximum hierarchy level ; encoding the array of information samples using prediction coding (coded block pattern) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream (entropy decoding) the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20100086049A1 CLAIM 1 . A method of encoding video data , the method comprising : applying spatial prediction or motion compensation to an original video block within a video frame (second subdivision, first subdivision) to generate a prediction video block based on a prediction mode ; subtracting the prediction video block from the original video block within the video frame to form a residual block ; selecting a transform having a first transform size to apply to the residual block ; generating header data indicative of the selected transform , the header data comprising a first syntax element having a first value indicative of at least one transform size and a second syntax element indicative of a prediction block size of the prediction video block , wherein the first syntax element and the second syntax element in conjunction are indicative of the first transform size ; applying the selected transform to the residual block to generate residual transform coefficients ; and generating a video signal based on the header data and the residual transform coefficients . US20100086049A1 CLAIM 2 . The method of claim 1 , wherein the header data further comprises a third syntax element indicative of a coded block pattern (prediction coding) , the third syntax element comprising a second value , and wherein the first syntax element sequentially follows after the third syntax element if the second value is non-zero . US20100086049A1 CLAIM 36 . The apparatus of claim 35 , wherein the means for receiving comprises a receiver , the means for applying spatial prediction or motion compensation comprises a prediction unit , the means for determining the first transform size comprises an entropy decoding (data stream) unit , the means for applying inverse transform comprises an inverse transform unit , and the means for adding comprises a summer .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	WO2009158113A2 Filed: 2009-05-29 Issued: 2009-12-30 Adaptive quantization for enhancement layer video coding (Original Assignee) Microsoft Corporation Shankar Regunathan, Shijun Sun, Chengjie Tu, Chih-Lung Lin
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information (respective color) , information related to first and second maximum region (picture basis) sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding (digital media data) ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	WO2009158113A2 CLAIM 3 . The computer-readable storage medium of claim 2 wherein the method includes , on a picture-by-picture basis (second maximum region, second maximum region sizes) for each of plural pictures , repeating the determining whether to use spatial quantization variation , the determining whether to use quantization variation between channels , and the signaling information that indicates the on/off decision for the spatial quantization variation and the on/off decision for the quantization variation between channels . WO2009158113A2 CLAIM 6 . The computer-readable storage medium of claim 1 wherein the signaling the quantization parameter information comprises : signaling picture-level information that indicates one or more picture-level quantization parameters for the enhancement layer video for the picture or respective color (video information) channels of the enhancement layer video for the picture ; and for each of plural macrob locks of the enhancement layer video for the picture , signaling macroblock-level information that indicates a macroblock-level quantization parameter for the macroblock . WO2009158113A2 CLAIM 18 . A decoder system comprising : a memory for storing digital media data (transform coding, spatial domain transform coding) ; and a digital media processor programmed to decode the digital media data , wherein the decoding includes : receiving picture-level information indicating a default quantization parameter and one or more alternative quantization parameters for a picture ; defining the default quantization parameter and the one or more alternative quantization parameters for the picture ; and for each of plural macrob locks of the picture : predicting (1010) a quantization parameter for the macrob lock using one or more quantization parameters for spatially neighboring macroblocks ; receiving (1005) macroblock-level information representing a quantization parameter selection ; based at least in part on the macroblock-level information , selecting (1015) between the predicted quantization parameter and another quantization parameter , wherein selection of the other quantization parameter includes selecting between the default quantization parameter and the one or more defined alternative quantization parameters using the macroblock-level information ; and using the selected quantization parameter in reconstruction of the current macroblock .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision (spatially neighboring) of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	WO2009158113A2 CLAIM 9 . The computer-readable storage medium of claim 1 wherein the encoding includes , for a current macroblock of the enhancement layer video for the picture , predicting a macroblock-level quantization parameter for the current macroblock using one or more macroblock-level quantization parameters for spatially neighboring (intermediate subdivision) macroblocks .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding (digital media data) to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	WO2009158113A2 CLAIM 18 . A decoder system comprising : a memory for storing digital media data (transform coding, spatial domain transform coding) ; and a digital media processor programmed to decode the digital media data , wherein the decoding includes : receiving picture-level information indicating a default quantization parameter and one or more alternative quantization parameters for a picture ; defining the default quantization parameter and the one or more alternative quantization parameters for the picture ; and for each of plural macrob locks of the picture : predicting (1010) a quantization parameter for the macrob lock using one or more quantization parameters for spatially neighboring macroblocks ; receiving (1005) macroblock-level information representing a quantization parameter selection ; based at least in part on the macroblock-level information , selecting (1015) between the predicted quantization parameter and another quantization parameter , wherein selection of the other quantization parameter includes selecting between the default quantization parameter and the one or more defined alternative quantization parameters using the macroblock-level information ; and using the selected quantization parameter in reconstruction of the current macroblock .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information (respective color) , information related to first and second maximum region (picture basis) sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding (digital media data) ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	WO2009158113A2 CLAIM 3 . The computer-readable storage medium of claim 2 wherein the method includes , on a picture-by-picture basis (second maximum region, second maximum region sizes) for each of plural pictures , repeating the determining whether to use spatial quantization variation , the determining whether to use quantization variation between channels , and the signaling information that indicates the on/off decision for the spatial quantization variation and the on/off decision for the quantization variation between channels . WO2009158113A2 CLAIM 6 . The computer-readable storage medium of claim 1 wherein the signaling the quantization parameter information comprises : signaling picture-level information that indicates one or more picture-level quantization parameters for the enhancement layer video for the picture or respective color (video information) channels of the enhancement layer video for the picture ; and for each of plural macrob locks of the enhancement layer video for the picture , signaling macroblock-level information that indicates a macroblock-level quantization parameter for the macroblock . WO2009158113A2 CLAIM 18 . A decoder system comprising : a memory for storing digital media data (transform coding, spatial domain transform coding) ; and a digital media processor programmed to decode the digital media data , wherein the decoding includes : receiving picture-level information indicating a default quantization parameter and one or more alternative quantization parameters for a picture ; defining the default quantization parameter and the one or more alternative quantization parameters for the picture ; and for each of plural macrob locks of the picture : predicting (1010) a quantization parameter for the macrob lock using one or more quantization parameters for spatially neighboring macroblocks ; receiving (1005) macroblock-level information representing a quantization parameter selection ; based at least in part on the macroblock-level information , selecting (1015) between the predicted quantization parameter and another quantization parameter , wherein selection of the other quantization parameter includes selecting between the default quantization parameter and the one or more defined alternative quantization parameters using the macroblock-level information ; and using the selected quantization parameter in reconstruction of the current macroblock .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information (respective color) into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region (picture basis) size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding (digital media data) in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	WO2009158113A2 CLAIM 3 . The computer-readable storage medium of claim 2 wherein the method includes , on a picture-by-picture basis (second maximum region, second maximum region sizes) for each of plural pictures , repeating the determining whether to use spatial quantization variation , the determining whether to use quantization variation between channels , and the signaling information that indicates the on/off decision for the spatial quantization variation and the on/off decision for the quantization variation between channels . WO2009158113A2 CLAIM 6 . The computer-readable storage medium of claim 1 wherein the signaling the quantization parameter information comprises : signaling picture-level information that indicates one or more picture-level quantization parameters for the enhancement layer video for the picture or respective color (video information) channels of the enhancement layer video for the picture ; and for each of plural macrob locks of the enhancement layer video for the picture , signaling macroblock-level information that indicates a macroblock-level quantization parameter for the macroblock . WO2009158113A2 CLAIM 18 . A decoder system comprising : a memory for storing digital media data (transform coding, spatial domain transform coding) ; and a digital media processor programmed to decode the digital media data , wherein the decoding includes : receiving picture-level information indicating a default quantization parameter and one or more alternative quantization parameters for a picture ; defining the default quantization parameter and the one or more alternative quantization parameters for the picture ; and for each of plural macrob locks of the picture : predicting (1010) a quantization parameter for the macrob lock using one or more quantization parameters for spatially neighboring macroblocks ; receiving (1005) macroblock-level information representing a quantization parameter selection ; based at least in part on the macroblock-level information , selecting (1015) between the predicted quantization parameter and another quantization parameter , wherein selection of the other quantization parameter includes selecting between the default quantization parameter and the one or more defined alternative quantization parameters using the macroblock-level information ; and using the selected quantization parameter in reconstruction of the current macroblock .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information (respective color) into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region (picture basis) size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding (digital media data) in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	WO2009158113A2 CLAIM 3 . The computer-readable storage medium of claim 2 wherein the method includes , on a picture-by-picture basis (second maximum region, second maximum region sizes) for each of plural pictures , repeating the determining whether to use spatial quantization variation , the determining whether to use quantization variation between channels , and the signaling information that indicates the on/off decision for the spatial quantization variation and the on/off decision for the quantization variation between channels . WO2009158113A2 CLAIM 6 . The computer-readable storage medium of claim 1 wherein the signaling the quantization parameter information comprises : signaling picture-level information that indicates one or more picture-level quantization parameters for the enhancement layer video for the picture or respective color (video information) channels of the enhancement layer video for the picture ; and for each of plural macrob locks of the enhancement layer video for the picture , signaling macroblock-level information that indicates a macroblock-level quantization parameter for the macroblock . WO2009158113A2 CLAIM 18 . A decoder system comprising : a memory for storing digital media data (transform coding, spatial domain transform coding) ; and a digital media processor programmed to decode the digital media data , wherein the decoding includes : receiving picture-level information indicating a default quantization parameter and one or more alternative quantization parameters for a picture ; defining the default quantization parameter and the one or more alternative quantization parameters for the picture ; and for each of plural macrob locks of the picture : predicting (1010) a quantization parameter for the macrob lock using one or more quantization parameters for spatially neighboring macroblocks ; receiving (1005) macroblock-level information representing a quantization parameter selection ; based at least in part on the macroblock-level information , selecting (1015) between the predicted quantization parameter and another quantization parameter , wherein selection of the other quantization parameter includes selecting between the default quantization parameter and the one or more defined alternative quantization parameters using the macroblock-level information ; and using the selected quantization parameter in reconstruction of the current macroblock .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	JP2009246972A Filed: 2009-03-27 Issued: 2009-10-22 動きベクトル情報の符号化／復号化方法及び装置 (Original Assignee) Samsung Electronics Co Ltd; Sungkyunkwan Univ Foundation For Corporate Collaboration; 三星電子株式会社ＳａｍｓｕｎｇＥｌｅｃｔｒｏｎｉｃｓＣｏ．，Ｌｔｄ．; 成均▲館▼大學校産學協力團 Kwang-Pyo Choi, Junsai Go, Byeung-Woo Jeon, Young-Hoon Joo, Bong-Soo Jung, 炳宇全, 潤濟呉, 永勳周, 光杓崔, 鳳洙鄭
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream (ビット) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level (フレーム) wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	JP2009246972A CLAIM 7 前記参照ピクチャーは、フレーム (maximum hierarchy level) メモリに記憶されているピクチャーから選択され、前記符号化動きベクトルデータは、前記参照ピクチャーを示す情報を含むことを特徴とする請求項５に記載の方法。 JP2009246972A CLAIM 9 動きベクトル取得単位を示す識別子（ＩＤ）を含むビット (data stream, data stream generator) ストリームから動きベクトル情報を復元する方法であって、前記ビットストリームをパーシングし、動きベクトル符号化モード（ＭＶＣＭ）を前記識別子から取得するステップと、前記動きベクトル符号化モードが副単位基盤の動きベクトルスキップモードを示す場合に、符号化器と予め設定された条件に従って、予測動きベクトル（ＰＭＶ）を計算し、参照ピクチャーに関する情報を取得するステップと、前記予測動きベクトルを前記参照ピクチャーに適用することにより符号化単位の映像情報を復元するステップと、を有することを特徴とする方法。
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal based on an intra-prediction mode (予測モード) associated with the sub-region and reconstructed samples of a neighboring subset of the second set of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	JP2009246972A CLAIM 2 複数の動きベクトル予測モード (intra-prediction mode) （ＭＶＰＭ）の各々で動きベクトルを推定するステップと、前記推定された動きベクトルを参照ピクチャーに適用することにより符号化単位の映像情報を復元するステップと、前記符号化単位の前記復元された映像情報と元映像情報との間の剰余データを計算し、前記剰余データの符号化及び復号化を行うステップと、前記符号化及び復号化が行われた剰余データを前記復元された映像情報に適用することにより再復元された映像情報を生成するステップと、前記再復元された映像情報と前記元映像情報との間のコストを計算するステップと、最小のコストを有する動きベクトル予測モードを選択し、前記最小のコストを第１のコストとして設定するステップと、前記予測動きベクトルを前記参照ピクチャーに適用することにより、前記符号化単位の映像情報を復元し、前記復元された映像情報と前記元映像情報との間の第２のコストを計算するステップとをさらに含み、前記所定の条件は、前記第２のコストが第１のコストより小さい値を有する条件であることを特徴とする請求項１に記載の方法。
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level (フレーム) is reached .	JP2009246972A CLAIM 7 前記参照ピクチャーは、フレーム (maximum hierarchy level) メモリに記憶されているピクチャーから選択され、前記符号化動きベクトルデータは、前記参照ピクチャーを示す情報を含むことを特徴とする請求項５に記載の方法。
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level (フレーム) from the data stream (ビット) .	JP2009246972A CLAIM 7 前記参照ピクチャーは、フレーム (maximum hierarchy level) メモリに記憶されているピクチャーから選択され、前記符号化動きベクトルデータは、前記参照ピクチャーを示す情報を含むことを特徴とする請求項５に記載の方法。 JP2009246972A CLAIM 9 動きベクトル取得単位を示す識別子（ＩＤ）を含むビット (data stream, data stream generator) ストリームから動きベクトル情報を復元する方法であって、前記ビットストリームをパーシングし、動きベクトル符号化モード（ＭＶＣＭ）を前記識別子から取得するステップと、前記動きベクトル符号化モードが副単位基盤の動きベクトルスキップモードを示す場合に、符号化器と予め設定された条件に従って、予測動きベクトル（ＰＭＶ）を計算し、参照ピクチャーに関する情報を取得するステップと、前記予測動きベクトルを前記参照ピクチャーに適用することにより符号化単位の映像情報を復元するステップと、を有することを特徴とする方法。
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements associated with the first or second set of sub-regions from the data stream (ビット) in a depth-first traversal order .	JP2009246972A CLAIM 9 動きベクトル取得単位を示す識別子（ＩＤ）を含むビット (data stream, data stream generator) ストリームから動きベクトル情報を復元する方法であって、前記ビットストリームをパーシングし、動きベクトル符号化モード（ＭＶＣＭ）を前記識別子から取得するステップと、前記動きベクトル符号化モードが副単位基盤の動きベクトルスキップモードを示す場合に、符号化器と予め設定された条件に従って、予測動きベクトル（ＰＭＶ）を計算し、参照ピクチャーに関する情報を取得するステップと、前記予測動きベクトルを前記参照ピクチャーに適用することにより符号化単位の映像情報を復元するステップと、を有することを特徴とする方法。
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream (ビット) , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	JP2009246972A CLAIM 9 動きベクトル取得単位を示す識別子（ＩＤ）を含むビット (data stream, data stream generator) ストリームから動きベクトル情報を復元する方法であって、前記ビットストリームをパーシングし、動きベクトル符号化モード（ＭＶＣＭ）を前記識別子から取得するステップと、前記動きベクトル符号化モードが副単位基盤の動きベクトルスキップモードを示す場合に、符号化器と予め設定された条件に従って、予測動きベクトル（ＰＭＶ）を計算し、参照ピクチャーに関する情報を取得するステップと、前記予測動きベクトルを前記参照ピクチャーに適用することにより符号化単位の映像情報を復元するステップと、を有することを特徴とする方法。
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream (ビット) , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	JP2009246972A CLAIM 9 動きベクトル取得単位を示す識別子（ＩＤ）を含むビット (data stream, data stream generator) ストリームから動きベクトル情報を復元する方法であって、前記ビットストリームをパーシングし、動きベクトル符号化モード（ＭＶＣＭ）を前記識別子から取得するステップと、前記動きベクトル符号化モードが副単位基盤の動きベクトルスキップモードを示す場合に、符号化器と予め設定された条件に従って、予測動きベクトル（ＰＭＶ）を計算し、参照ピクチャーに関する情報を取得するステップと、前記予測動きベクトルを前記参照ピクチャーに適用することにより符号化単位の映像情報を復元するステップと、を有することを特徴とする方法。
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream (ビット) representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level (フレーム) , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	JP2009246972A CLAIM 7 前記参照ピクチャーは、フレーム (maximum hierarchy level) メモリに記憶されているピクチャーから選択され、前記符号化動きベクトルデータは、前記参照ピクチャーを示す情報を含むことを特徴とする請求項５に記載の方法。 JP2009246972A CLAIM 9 動きベクトル取得単位を示す識別子（ＩＤ）を含むビット (data stream, data stream generator) ストリームから動きベクトル情報を復元する方法であって、前記ビットストリームをパーシングし、動きベクトル符号化モード（ＭＶＣＭ）を前記識別子から取得するステップと、前記動きベクトル符号化モードが副単位基盤の動きベクトルスキップモードを示す場合に、符号化器と予め設定された条件に従って、予測動きベクトル（ＰＭＶ）を計算し、参照ピクチャーに関する情報を取得するステップと、前記予測動きベクトルを前記参照ピクチャーに適用することにより符号化単位の映像情報を復元するステップと、を有することを特徴とする方法。
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level (フレーム) ; and a data stream (ビット) generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	JP2009246972A CLAIM 7 前記参照ピクチャーは、フレーム (maximum hierarchy level) メモリに記憶されているピクチャーから選択され、前記符号化動きベクトルデータは、前記参照ピクチャーを示す情報を含むことを特徴とする請求項５に記載の方法。 JP2009246972A CLAIM 9 動きベクトル取得単位を示す識別子（ＩＤ）を含むビット (data stream, data stream generator) ストリームから動きベクトル情報を復元する方法であって、前記ビットストリームをパーシングし、動きベクトル符号化モード（ＭＶＣＭ）を前記識別子から取得するステップと、前記動きベクトル符号化モードが副単位基盤の動きベクトルスキップモードを示す場合に、符号化器と予め設定された条件に従って、予測動きベクトル（ＰＭＶ）を計算し、参照ピクチャーに関する情報を取得するステップと、前記予測動きベクトルを前記参照ピクチャーに適用することにより符号化単位の映像情報を復元するステップと、を有することを特徴とする方法。
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level (フレーム) ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream (ビット) the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	JP2009246972A CLAIM 7 前記参照ピクチャーは、フレーム (maximum hierarchy level) メモリに記憶されているピクチャーから選択され、前記符号化動きベクトルデータは、前記参照ピクチャーを示す情報を含むことを特徴とする請求項５に記載の方法。 JP2009246972A CLAIM 9 動きベクトル取得単位を示す識別子（ＩＤ）を含むビット (data stream, data stream generator) ストリームから動きベクトル情報を復元する方法であって、前記ビットストリームをパーシングし、動きベクトル符号化モード（ＭＶＣＭ）を前記識別子から取得するステップと、前記動きベクトル符号化モードが副単位基盤の動きベクトルスキップモードを示す場合に、符号化器と予め設定された条件に従って、予測動きベクトル（ＰＭＶ）を計算し、参照ピクチャーに関する情報を取得するステップと、前記予測動きベクトルを前記参照ピクチャーに適用することにより符号化単位の映像情報を復元するステップと、を有することを特徴とする方法。

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	WO2009091383A2 Filed: 2008-12-18 Issued: 2009-07-23 Video and depth coding (Original Assignee) Thomson Licensing Purvin Bibhas Pandit, Peng Yin, Dong Tian
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level (high level syntax) wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding (chroma component) ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	WO2009091383A2 CLAIM 7 . The method of claim 6 , wherein the indication is provided using at least one high level syntax (hierarchy level) element . WO2009091383A2 CLAIM 12 . The method of claim 1 , wherein the data structure is generated by arranging the depth information as an additional component of the selected video information , the selected video information further including at least one luma component and at least one chroma component (transform coding) (1065) .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level (high level syntax) according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	WO2009091383A2 CLAIM 7 . The method of claim 6 , wherein the indication is provided using at least one high level syntax (hierarchy level) element .
US10250913B2 CLAIM 5 . The decoder according to claim 4 , wherein the divider is configured to , in accordance with the partition rules associated with the first and higher-order hierarchy levels , sub-divide into sub-regions of equal size , such that there are an equal number of sub-regions at each hierarchy level (high level syntax) .	WO2009091383A2 CLAIM 7 . The method of claim 6 , wherein the indication is provided using at least one high level syntax (hierarchy level) element .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision information includes a partition indication flag indicating whether any of the first set of root regions or the sub-regions at the first or higher-order hierarchy level (high level syntax) is sub-divided .	WO2009091383A2 CLAIM 7 . The method of claim 6 , wherein the indication is provided using at least one high level syntax (hierarchy level) element .
US10250913B2 CLAIM 7 . The decoder according to claim 1 , wherein the extractor is configured to extract the maximum hierarchy level (high level syntax) from the data stream .	WO2009091383A2 CLAIM 7 . The method of claim 6 , wherein the indication is provided using at least one high level syntax (hierarchy level) element .
US10250913B2 CLAIM 8 . The decoder according to claim 1 , wherein the extractor is configured to extract syntax elements (syntax element) associated with the first or second set of sub-regions from the data stream in a depth-first traversal order .	WO2009091383A2 CLAIM 7 . The method of claim 6 , wherein the indication is provided using at least one high level syntax element (syntax elements) .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements (syntax element) of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	WO2009091383A2 CLAIM 7 . The method of claim 6 , wherein the indication is provided using at least one high level syntax element (syntax elements) .
US10250913B2 CLAIM 10 . The decoder according to claim 1 , further comprising : a predictor configured to predict the array of information samples from the data stream , wherein the reconstructor is configured to perform a spectral-to-spatial domain transform coding (chroma component) to obtain a residual for the array of information samples , and combine the residual and the prediction of the array of information samples to reconstruct the array of information samples .	WO2009091383A2 CLAIM 12 . The method of claim 1 , wherein the data structure is generated by arranging the depth information as an additional component of the selected video information , the selected video information further including at least one luma component and at least one chroma component (transform coding) (1065) .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level (high level syntax) , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding (chroma component) ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	WO2009091383A2 CLAIM 7 . The method of claim 6 , wherein the indication is provided using at least one high level syntax (hierarchy level) element . WO2009091383A2 CLAIM 12 . The method of claim 1 , wherein the data structure is generated by arranging the depth information as an additional component of the selected video information , the selected video information further including at least one luma component and at least one chroma component (transform coding) (1065) .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level (high level syntax) ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding (chroma component) in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	WO2009091383A2 CLAIM 7 . The method of claim 6 , wherein the indication is provided using at least one high level syntax (hierarchy level) element . WO2009091383A2 CLAIM 12 . The method of claim 1 , wherein the data structure is generated by arranging the depth information as an additional component of the selected video information , the selected video information further including at least one luma component and at least one chroma component (transform coding) (1065) .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level (high level syntax) ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding (chroma component) in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	WO2009091383A2 CLAIM 7 . The method of claim 6 , wherein the indication is provided using at least one high level syntax (hierarchy level) element . WO2009091383A2 CLAIM 12 . The method of claim 1 , wherein the data structure is generated by arranging the depth information as an additional component of the selected video information , the selected video information further including at least one luma component and at least one chroma component (transform coding) (1065) .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	WO2009018277A1 Filed: 2008-07-29 Issued: 2009-02-05 Application management framework for web applications (Original Assignee) Palm, Inc. Manjirnath Chatterjee, Gregory R. Simon, Roderick Swift
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set (more event) of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	WO2009018277A1 CLAIM 4 . The mobile device of any preceding claim , wherein the application management framework user interface is operative to advance through the set of icons in response to one or more event (first set) s .
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set (more event) of sub-regions : compute a prediction signal based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset of the second set of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	WO2009018277A1 CLAIM 4 . The mobile device of any preceding claim , wherein the application management framework user interface is operative to advance through the set of icons in response to one or more event (first set) s .
US10250913B2 CLAIM 3 . The decoder according to claim 1 , wherein the divider is configured to perform the division of the array of information samples into the first set (more event) of root regions such that the first set of root regions are rectangular blocks of a size determined by the first maximum region size , the rectangular blocks are arranged in an order to gaplessly cover the array of information samples .	WO2009018277A1 CLAIM 4 . The mobile device of any preceding claim , wherein the application management framework user interface is operative to advance through the set of icons in response to one or more event (first set) s .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set (more event) of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	WO2009018277A1 CLAIM 4 . The mobile device of any preceding claim , wherein the application management framework user interface is operative to advance through the set of icons in response to one or more event (first set) s .
US10250913B2 CLAIM 6 . The decoder according to claim 4 , wherein the first subdivision information includes a partition indication flag indicating whether any of the first set (more event) of root regions or the sub-regions at the first or higher-order hierarchy level is sub-divided .	WO2009018277A1 CLAIM 4 . The mobile device of any preceding claim , wherein the application management framework user interface is operative to advance through the set of icons in response to one or more event (first set) s .
US10250913B2 CLAIM 9 . The decoder according to claim 1 , further comprising : a merger configured to combine , based on a first subset of syntax elements of the data stream , disjoint from a second subset of syntax elements of the data stream including the first subdivision information , spatially neighboring ones of the first set (more event) of sub-regions to obtain an intermediate subdivision of the array of information samples , wherein the reconstructor is configured to reconstruct the array of information samples using the intermediate subdivision .	WO2009018277A1 CLAIM 4 . The mobile device of any preceding claim , wherein the application management framework user interface is operative to advance through the set of icons in response to one or more event (first set) s .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set (more event) of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	WO2009018277A1 CLAIM 4 . The mobile device of any preceding claim , wherein the application management framework user interface is operative to advance through the set of icons in response to one or more event (first set) s .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set (more event) of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	WO2009018277A1 CLAIM 4 . The mobile device of any preceding claim , wherein the application management framework user interface is operative to advance through the set of icons in response to one or more event (first set) s .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set (more event) of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	WO2009018277A1 CLAIM 4 . The mobile device of any preceding claim , wherein the application management framework user interface is operative to advance through the set of icons in response to one or more event (first set) s .
US10250913B2 CLAIM 15 . A non-transitory computer readable digital storage medium having stored thereon a computer program (computer program) having a program code for performing , when running on a computer , a method according to claim 12 .	WO2009018277A1 CLAIM 12 . A computer-readable storage medium comprising a computer program (computer program) including computer-readable program elements operative in a computing device to implement the method of any of claims 8 to 11 .
US10250913B2 CLAIM 16 . A non-transitory computer readable digital storage medium having stored thereon a computer program (computer program) having a program code for performing , when running on a computer , a method according to claim 14 .	WO2009018277A1 CLAIM 12 . A computer-readable storage medium comprising a computer program (computer program) including computer-readable program elements operative in a computing device to implement the method of any of claims 8 to 11 .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20090262840A1 Filed: 2008-07-29 Issued: 2009-10-22 Synchronization Signal Extraction Device and Related Method (Original Assignee) Novatek Microelectronics Corp (Current Assignee) Novatek Microelectronics Corp Chung-Jr Jan, Shang-Hsiu Wu, Kuo-Chi Chen, Ying-Jie Su, Po-Jui Huang, Chien-Cheng Tu, Po-Ju Lee
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region (second input terminal) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20090262840A1 CLAIM 23 . A synchronization signal extraction device comprising : a signal reception terminal for receiving a composite video signal ; a threshold voltage adjuster , coupled to the signal reception terminal , for outputting a threshold voltage according to a first characteristic level and a second characteristic level of the composite video signal , wherein the threshold voltage is a ratio of the first characteristic level and the second characteristic level ; a multiplexer , having a first input terminal coupled to the threshold voltage , a second input terminal (root region) coupled to a predetermined threshold voltage , and an output terminal , for selectively outputting the threshold voltage or the predetermined threshold voltage via the output terminal ; a slicer , coupled to the signal reception terminal and the output terminal of the multiplexer , for slicing the composite video signal to extract a synchronization signal in the composite video signal according to the threshold voltage or the predetermined threshold voltage ; and a signal output terminal , coupled to the slicer , for outputting the extracted synchronization signal .
US10250913B2 CLAIM 2 . The decoder according to claim 1 , wherein the reconstructor is configured to , for a sub-region of the first set of sub-regions : compute a prediction signal (first switch) based on an intra-prediction mode associated with the sub-region and reconstructed samples of a neighboring subset of the second set of sub-regions , compute a reconstructed signal by adding the prediction signal to a reconstructed residual of a subset of the second set of sub-regions associated with the sub-region , and store the reconstructed signal in a buffer for a next intra-prediction cycle .	US20090262840A1 CLAIM 6 . The synchronization signal extraction device of claim 1 , wherein the threshold voltage adjuster comprises : a first sampling capacitor ; a second sampling capacitor ; a first switch (prediction signal) , coupled between the signal reception terminal and the first sampling capacitor , for coupling the first sampling capacitor to the signal reception terminal during a first phase such that the first sampling capacitor samples the first characteristic level ; a second switch , coupled between the signal reception terminal and the second sampling capacitor , for coupling the second sampling capacitor to the signal reception terminal during a second phase such that the second sampling capacitor samples the second characteristic level ; a third switch , coupled between the first sampling capacitor and the slicer , for coupling the first sampling capacitor to the slicer during a third phase such that the first sampling capacitor outputs a sampled voltage to the slicer ; and a fourth switch , coupled between the second sampling capacitor and the slicer , for coupling the second sampling capacitor to the slicer during the third phase to enable the second sampling capacitor to output a sampled voltage to the slicer ; wherein the first sampling capacitor and the second sampling capacitor perform a charge sharing operation during the third phase to output the ratio of the first characteristic level and the second characteristic level to the slicer according to capacitances of the first sampling capacitor and the second sampling capacitor .
US10250913B2 CLAIM 4 . The decoder according to claim 1 , wherein the divider is configured to , in sub-dividing at least some of the first set of root regions , determine whether the first subdivision information indicates that each of the at least some of the first set of root regions is to be sub-divided , based on a determination that each of the at least some of the first set of root regions is to be sub-divided , sub-divide that root region (second input terminal) into sub-regions of a first hierarchy level according to a partition rule associated with the first hierarchy level , and recursively repeat the determination and sub-division for the sub-regions of the first hierarchy level in order to obtain regions of higher-order hierarchy levels using respective partition rules associated therewith , wherein the determination and sub-division is performed until no further division is to be performed according to the first subdivision information or another maximum hierarchy level is reached .	US20090262840A1 CLAIM 23 . A synchronization signal extraction device comprising : a signal reception terminal for receiving a composite video signal ; a threshold voltage adjuster , coupled to the signal reception terminal , for outputting a threshold voltage according to a first characteristic level and a second characteristic level of the composite video signal , wherein the threshold voltage is a ratio of the first characteristic level and the second characteristic level ; a multiplexer , having a first input terminal coupled to the threshold voltage , a second input terminal (root region) coupled to a predetermined threshold voltage , and an output terminal , for selectively outputting the threshold voltage or the predetermined threshold voltage via the output terminal ; a slicer , coupled to the signal reception terminal and the output terminal of the multiplexer , for slicing the composite video signal to extract a synchronization signal in the composite video signal according to the threshold voltage or the predetermined threshold voltage ; and a signal output terminal , coupled to the slicer , for outputting the extracted synchronization signal .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region (second input terminal) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20090262840A1 CLAIM 23 . A synchronization signal extraction device comprising : a signal reception terminal for receiving a composite video signal ; a threshold voltage adjuster , coupled to the signal reception terminal , for outputting a threshold voltage according to a first characteristic level and a second characteristic level of the composite video signal , wherein the threshold voltage is a ratio of the first characteristic level and the second characteristic level ; a multiplexer , having a first input terminal coupled to the threshold voltage , a second input terminal (root region) coupled to a predetermined threshold voltage , and an output terminal , for selectively outputting the threshold voltage or the predetermined threshold voltage via the output terminal ; a slicer , coupled to the signal reception terminal and the output terminal of the multiplexer , for slicing the composite video signal to extract a synchronization signal in the composite video signal according to the threshold voltage or the predetermined threshold voltage ; and a signal output terminal , coupled to the slicer , for outputting the extracted synchronization signal .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region (second input terminal) of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20090262840A1 CLAIM 23 . A synchronization signal extraction device comprising : a signal reception terminal for receiving a composite video signal ; a threshold voltage adjuster , coupled to the signal reception terminal , for outputting a threshold voltage according to a first characteristic level and a second characteristic level of the composite video signal , wherein the threshold voltage is a ratio of the first characteristic level and the second characteristic level ; a multiplexer , having a first input terminal coupled to the threshold voltage , a second input terminal (root region) coupled to a predetermined threshold voltage , and an output terminal , for selectively outputting the threshold voltage or the predetermined threshold voltage via the output terminal ; a slicer , coupled to the signal reception terminal and the output terminal of the multiplexer , for slicing the composite video signal to extract a synchronization signal in the composite video signal according to the threshold voltage or the predetermined threshold voltage ; and a signal output terminal , coupled to the slicer , for outputting the extracted synchronization signal .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region (second input terminal) of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20090262840A1 CLAIM 23 . A synchronization signal extraction device comprising : a signal reception terminal for receiving a composite video signal ; a threshold voltage adjuster , coupled to the signal reception terminal , for outputting a threshold voltage according to a first characteristic level and a second characteristic level of the composite video signal , wherein the threshold voltage is a ratio of the first characteristic level and the second characteristic level ; a multiplexer , having a first input terminal coupled to the threshold voltage , a second input terminal (root region) coupled to a predetermined threshold voltage , and an output terminal , for selectively outputting the threshold voltage or the predetermined threshold voltage via the output terminal ; a slicer , coupled to the signal reception terminal and the output terminal of the multiplexer , for slicing the composite video signal to extract a synchronization signal in the composite video signal according to the threshold voltage or the predetermined threshold voltage ; and a signal output terminal , coupled to the slicer , for outputting the extracted synchronization signal .

US10250913B2 Filed: 2010-04-13 Issued: 2019-04-02 Coding of a spatial sampling of a two-dimensional information signal using sub-division (Original Assignee) GE Video Compression LLC (Current Assignee) GE Video Compression LLC Heiner Kirchhoffer, Martin Winken, Philipp HELLE, Detlev Marpe, Heiko Schwarz, Thomas Wiegand	US20090175334A1 Filed: 2008-07-08 Issued: 2009-07-09 Adaptive coding of video block header information (Original Assignee) Qualcomm Inc (Current Assignee) Qualcomm Inc Yan Ye, Marta Karczewicz, Rahul Panchal
US10250913B2 CLAIM 1 . A decoder comprising : an extractor configured to extract , from a data stream representing encoded video information , information related to first and second maximum region (decoding device) sizes , first and second subdivision information , and a maximum hierarchy level wherein the first maximum region size and the first subdivision information are associated with prediction coding (predicted prediction block) and the second maximum region size and the second subdivision information are associated with transform coding ; a divider configured to : divide an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , divide at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , and determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and a reconstructor configured to reconstruct the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20090175334A1 CLAIM 62 . The method of claim 61 , wherein the flag is a first flag , and separately decoding each of the prediction mode , the luma CBP , and the chroma CBP comprises : predicting the prediction mode of the current video block based on one of the one or more previously decoded video blocks ; and selecting the predicted prediction block (prediction coding, information samples using prediction coding) as the prediction mode of the current video block when a second flag indicates that the prediction of the prediction mode is successful . US20090175334A1 CLAIM 66 . A decoding device (second maximum region, second maximum region sizes) comprising : a selection unit that selects a coding table to use for decoding a syntax element of a current encoded video block of a coded unit based on a corresponding syntax element of one or more previously decoded video blocks of the coded unit ; and a decoding unit that decodes the syntax element of the current video block using the selected coding table .
US10250913B2 CLAIM 11 . The decoder according to claim 1 , wherein the recursive multi-tree partitioning includes a quadtree partitioning (prediction unit) technique .	US20090175334A1 CLAIM 18 . The device of claim 14 , wherein the syntax element comprises a first header syntax element of the current video block , the device further comprising : a prediction unit (quadtree partitioning, quadtree partitioning technique) that predicts at least one other header syntax element of the current video block based on one of the one or more previously encoded video blocks ; wherein the coding unit encodes a flag to indicate that the prediction of the at least one other header syntax element is successful when the at least one predicted header syntax element is the same as the actual header syntax element of the current video block .
US10250913B2 CLAIM 12 . A method for decoding comprising : extracting , from a data stream representing encoded video information , information related to first and second maximum region (decoding device) sizes , first and second subdivision information , and a maximum hierarchy level , wherein the first maximum region size and the first subdivision information are associated with prediction coding (predicted prediction block) and the second maximum region size and the second subdivision information are associated with transform coding ; dividing an array of information samples representing a spatially sampled portion of the video information into a first set of root regions based on the first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on the first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds the second maximum region size ; responsive to a determination that the size of at least one of the first set of sub-regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on the second subdivision information and the maximum hierarchy level ; and reconstructing the array of information samples using prediction coding in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions .	US20090175334A1 CLAIM 62 . The method of claim 61 , wherein the flag is a first flag , and separately decoding each of the prediction mode , the luma CBP , and the chroma CBP comprises : predicting the prediction mode of the current video block based on one of the one or more previously decoded video blocks ; and selecting the predicted prediction block (prediction coding, information samples using prediction coding) as the prediction mode of the current video block when a second flag indicates that the prediction of the prediction mode is successful . US20090175334A1 CLAIM 66 . A decoding device (second maximum region, second maximum region sizes) comprising : a selection unit that selects a coding table to use for decoding a syntax element of a current encoded video block of a coded unit based on a corresponding syntax element of one or more previously decoded video blocks of the coded unit ; and a decoding unit that decodes the syntax element of the current video block using the selected coding table .
US10250913B2 CLAIM 13 . An encoder comprising : a divider configured to : divide an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size , sub-divide at least some of the first set of root regions into a first set of sub-regions using recursive multi-tree partitioning based on first subdivision information , determine whether a size of at least one of the first set of sub-regions exceeds a second maximum region (decoding device) size , responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , divide the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size , determine , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub- divided , and responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-divide the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; and a data stream generator configured to : encode the array of information samples using prediction coding (predicted prediction block) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub- regions , and insert into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20090175334A1 CLAIM 62 . The method of claim 61 , wherein the flag is a first flag , and separately decoding each of the prediction mode , the luma CBP , and the chroma CBP comprises : predicting the prediction mode of the current video block based on one of the one or more previously decoded video blocks ; and selecting the predicted prediction block (prediction coding, information samples using prediction coding) as the prediction mode of the current video block when a second flag indicates that the prediction of the prediction mode is successful . US20090175334A1 CLAIM 66 . A decoding device (second maximum region, second maximum region sizes) comprising : a selection unit that selects a coding table to use for decoding a syntax element of a current encoded video block of a coded unit based on a corresponding syntax element of one or more previously decoded video blocks of the coded unit ; and a decoding unit that decodes the syntax element of the current video block using the selected coding table .
US10250913B2 CLAIM 14 . A method for encoding comprising : dividing an array of information samples representing a spatially sampled portion of video information into a first set of root regions based on a first maximum region size ; sub-dividing at least some of the first set of root regions into a first set of sub- regions using recursive multi-tree partitioning based on first subdivision information ; determining whether a size of at least one of the first set of sub-regions exceeds a second maximum region (decoding device) size ; responsive to a determination that the size of at least one of the first set of sub- regions does exceed the second maximum region size , dividing the at least one of the first set of sub-regions into a second set of root regions of the second maximum region size ; determining , for each of the second set of root regions of the second maximum region size , whether the respective root region of the second set of root regions is to be sub-divided ; responsive to a determination that the respective root region of the second set of root regions is to be sub-divided , sub-dividing the respective root region of the second set of root regions into a second set of sub-regions using recursive multi-tree partitioning based on second subdivision information and a maximum hierarchy level ; encoding the array of information samples using prediction coding (predicted prediction block) in accordance with the first set of sub-regions and transform coding in accordance with the second set of sub-regions ; and inserting into a data stream the encoded array of information samples , information related to the first and second maximum region sizes and the maximum hierarchy level , and the first and second subdivision information , wherein the first maximum region size and the first subdivision information are associated with prediction coding and the second maximum region size and the second subdivision information are associated with transform coding .	US20090175334A1 CLAIM 62 . The method of claim 61 , wherein the flag is a first flag , and separately decoding each of the prediction mode , the luma CBP , and the chroma CBP comprises : predicting the prediction mode of the current video block based on one of the one or more previously decoded video blocks ; and selecting the predicted prediction block (prediction coding, information samples using prediction coding) as the prediction mode of the current video block when a second flag indicates that the prediction of the prediction mode is successful . US20090175334A1 CLAIM 66 . A decoding device (second maximum region, second maximum region sizes) comprising : a selection unit that selects a coding table to use for decoding a syntax element of a current encoded video block of a coded unit based on a corresponding syntax element of one or more previously decoded video blocks of the coded unit ; and a decoding unit that decodes the syntax element of the current video block using the selected coding table .