УСТРОЙСТВО КОДИРОВАНИЯ ВИДЕО С ПРЕДСКАЗАНИЕМ, СПОСОБ КОДИРОВАНИЯ ВИДЕО С ПРЕДСКАЗАНИЕМ, ПРОГРАММА КОДИРОВАНИЯ ВИДЕО С ПРЕДСКАЗАНИЕМ, УСТРОЙСТВО ДЕКОДИРОВАНИЯ ВИДЕО С ПРЕДСКАЗАНИЕМ, СПОСОБ ДЕКОДИРОВАНИЯ ВИДЕО С ПРЕДСКАЗАНИЕМ И ПРОГРАММА ДЕКОДИРОВАНИЯ ВИДЕО С ПРЕДСКАЗАНИЕМ

Изобретение относится к области кодирования и декодирования видео с предсказанием. Технический результат заключается в повышении эффективности использования заголовка блока уровня сетевой абстракции (NAL). Технический результат достигается за счет ввода данных сжатого изображения множества изображений, образующих видеопоследовательность, при этом эти данные сжатого изображения инкапсулированы в блок NAL с информацией заголовка, а множество изображений, образующих видеопоследовательность, разделены на множество временных уровней, при этом информация заголовка блока NAL содержит nal_unit_type, однозначно указывающий, используются ли данные кодированного или восстановленного изображения для ссылки при декодировании другого изображения в том же самом временном уровне. 4 н.п. ф-лы, 10 ил., 5 табл.

СПОСОБ ОБРАБОТКИ ДВИЖУЩЕГОСЯ ИЗОБРАЖЕНИЯ, НОСИТЕЛЬ ЗАПИСИ, НА КОТОРОМ ЗАПИСАНА ПРОГРАММА СПОСОБА ОБРАБОТКИ ДВИЖУЩЕГОСЯ ИЗОБРАЖЕНИЯ, И УСТРОЙСТВО ОБРАБОТКИ ДВИЖУЩЕГОСЯ ИЗОБРАЖЕНИЯ

Изобретение относится к способу обработки движущегося изображения и может быть применено, например, в устройстве кодирования и декодирования движущихся изображений. Техническим результатом является повышение скорости обработки движущегося изображения. Указанный технический результат достигается тем, что элементы синтаксиса с высокой частотой появления обрабатывают, используя переменные состояния вероятности, содержащиеся во втором запоминающем устройстве, задержка доступа которого мала, и другие элементы синтаксиса обрабатывают, используя переменные состояния вероятности, содержащиеся в первом запоминающем устройстве, задержка доступа которого велика. 3 н. и 5 з.п ф-лы, 12 ил.

КОДИРОВАНИЕ И ДЕКОДИРОВАНИЕ ЗНАЧАЩИХ КОЭФФИЦИЕНТОВ В ЗАВИСИМОСТИ ОТ ПАРАМЕТРА УКАЗАННЫХ ЗНАЧАЩИХ КОЭФФИЦИЕНТОВ

Изобретение относится к вычислительной технике. Технический результат заключается в генерировании меньшего количества кодированных данных. Способ кодирования данных для кодирования массива значений данных, в качестве наборов данных и кодов перехода для значений, не кодированных наборами данных, при этом код перехода содержит унарно кодированную часть и неунарно кодированную часть, в котором устанавливают параметр кодирования, определяющий минимальное количество битов неунарной кодированной части, где параметр кодирования находится между 0 и заданным верхним пределом; добавляют значения смещения, равные 1 или больше, к параметру кодирования, для определения минимального размера части младших значащих данных; генерируют один или больше наборов данных, указывающих положения относительно массива значений данных, для значений данных заданных диапазонов магнитуды, для кодирования значения по меньшей мере одного младшего значащего бита каждого значения данных; генерируют, из по меньшей мере части ...

СПОСОБ ПРОСТРАНСТВЕННОГО ПРОГНОЗИРОВАНИЯ, СПОСОБ ДЕКОДИРОВАНИЯ ИЗОБРАЖЕНИЙ И СПОСОБ КОДИРОВАНИЯ ИЗОБРАЖЕНИЙ

Изобретение относится к системам кодирования и декодирования видеоданных. Техническим результатом является уменьшение сложности пространственного прогнозирования за счет обнаружения целочисленного наклона края для текущего блока на основе вертикального и горизонтального градиента. Предложен способ пространственного прогнозирования для пространственного прогнозирования пиксельного значения в каждой пиксельной позиции в текущем блоке, включенном в изображение. Способ включает в себя этап, на котором вычисляют целочисленный наклон, который применен к краю изображения, который перекрывает текущий блок, на основе, по меньшей мере, одного из направления горизонтального градиента и направления вертикального градиента между пикселями в блоке, смежном с текущим блоком, каждое из которых указано посредством номера режима пространственного прогнозирования, причем целочисленный наклон указывает целочисленное значение наклона, подлежащего применению к обнаруженному краю. А также, определяют субпиксельную ...

МУЛЬТИМЕТРИЧЕСКАЯ ФИЛЬТРАЦИЯ

Изобретение относится к технологиям кодирования/декодирования видеоданных. Техническим результатом является сокращение количества битов, необходимых для сигнализации коэффициентов фильтра. Предложен способ декодирования данных видео. Способ включает в себя этап, на котором определяют первую метрику для группы пикселей внутри блока пикселей, при этом первая метрика определяется на основе сравнения пиксельных значений группы пикселей с пиксельными значениями упомянутого блока пикселей. Далее, согласно способу, определяют вторую метрику для группы пикселей, при этом определение второй метрики содержит определение направления группы пикселей из набора направлений, при этом набор направлений включает в себя горизонтальное направление, вертикальное направление, направление 45 градусов и направление 135 градусов. 4 н. и 39 з.п. ф-лы, 19 ил., 2 табл.

ВИДЕОДЕКОДЕР С ОБРАБОТКОЙ ПЕРЕМЕЖАЮЩИХСЯ ДАННЫХ

Изобретение относится к обработке информации, представляющей цифровые изображения. Техническим результатом является использование операции обработки с повторным уплотнением с использованием сокращенного количества операций уплотнения и представляющей собой перемежающуюся операцию, выполняемую совместно с другими операциями обработки. Технический результат достигается тем, что декодер MPEG в телеприемнике высокой четкости декодирует и распаковывает закодированные согласно MPEG данные для получения распакованных блоков пикселей изображения и содержит цепь компенсации движения, связанную с памятью кадров для создания окончательно декодированных пикселей для отображения. Распакованные данные вновь уплотняются множеством параллельных устройств повторного уплотнения до запоминания их в памяти кадров, причем каждое устройство повторного уплотнения получает поток перемежающихся данных пикселей, выполняет предсказание и уплотняет перемежающиеся значения пикселей во время каждого такта соответственно ...

ГРУППИРОВАНИЕ КАДРОВ ИЗОБРАЖЕНИЯ НА ВИДЕОКОДИРОВАНИИ

Изобретение относится к группированию мультимедийных файлов и может использоваться при потоковой передаче мультимедийных данных. Технический результат - уменьшение недостатков, обусловленных проблемами выбора эталонного изображения, оповещения о значимости P-кадров, регулировки масштабируемости, вставке видеопоследовательности в середину другой видеопоследовательности, достигается тем, что кодируют видеокадры с целью формирования масштабируемой сжатой видеопоследовательности, содержащей видеокадры, закодированные согласно первому и второму форматам кадров. Видеокадры первого формата кадров являются независимыми видеокадрами, а видеокадры второго формата кадров прогнозируются на основе одного из множества других видеокадров. Видеопоследовательность имеет первую подпоследовательность, определенную в ней, причем часть первой подпоследовательности формируется кодированием видеокадров первого формата кадров; а также вторую подпоследовательность, часть которой формируется кодированием видеокадров ...

АРХИТЕКТУРА ПАМЯТИ ДЛЯ МНОГОФОРМАТНОГО ПРОЦЕССОРА ВИДЕОСИГНАЛА

Изобретение относится к средствам обработки видеосигналов для отображения. Техническим результатом является возможность одновременной обработки данных стандартного разрешения и данных высокого разрешения. Цифровой процессор имеет стандартную архитектуру и содержит входную цепь, декодер, память для хранения отформатированных данных высокого разрешения и данных стандартного разрешения, процессор отображения, предназначенный для обработки указанных данных различного разрешения. При обработке видеосигналов их принимают, идентифицируют, декодируют, преобразуют данные блочного пиксельного формата к формату, подходящему для отображения, сохраняют упомянутые предварительно обработанные данные формата стандартного разрешения в упомянутой памяти во время обработки. 2 с. и 12 з.п.ф-лы, 2 табл., 16 ил.

ДЕКОДИРОВАНИЕ И СИНТЕЗИРОВАНИЕ КАДРОВ ДЛЯ НЕПОЛНЫХ ВИДЕОДАННЫХ

Изобретение относится к вычислительной технике. Технический результат заключается в декодировании неполных видеоданных. Машинореализуемый способ декодирования неполных видеоданных, в котором осуществляют доступ к по меньшей мере одной первой части первого кадра, содержащегося в видеоданных; декодируют эту по меньшей мере одну первую часть первого кадра, к которой осуществляется доступ, перед приемом по меньшей мере одной второй части первого кадра; определяют, что первый кадр является неполным, посредством определения того, что вторая часть первого кадра не принята; в ответ на определение того, что первый кадр является неполным, синтезируют по меньшей мере одну заменяющую часть для первого кадра, используя по меньшей мере часть данных кадра, относящихся к по меньшей мере одному предыдущему кадру; отображают поврежденный вариант первого кадра, причем поврежденный вариант первого кадра включает в себя упомянутую по меньшей мере одну первую часть и упомянутую заменяющую часть; отправляют во ...

УПРАВЛЕНИЕ ВЫЧИСЛИТЕЛЬНОЙ СЛОЖНОСТЬЮ И ТОЧНОСТЬЮ В МУЛЬТИМЕДИЙНОМ КОДЕКЕ, ОСНОВАННОМ НА ПРЕОБРАЗОВАНИИ

Изобретение относится к кодированию на основе блочного преобразования. Техническим результатом является обеспечение управления вычислительной сложностью и точностью декодирования посредством кодека цифровых мультимедийных данных. Предложенный кодер/декодер цифровых мультимедийных данных включает в себя сигнализацию различных режимов, относящихся к вычислительной сложности и точности при декодировании. Кодер может передавать синтаксический элемент, указывающий арифметическую точность (например, применение 16-битных или 32-битных операций) операций преобразования, выполняемых при декодировании. Кодер также может сигнализировать, необходимо ли применять масштабирование к выводу декодера, что обеспечивает более широкий динамический диапазон промежуточных данных при декодировании, но увеличивает вычислительную сложность из-за операции масштабирования. 6 н. и 21 з.п. ф-лы, 6 ил.

ПАРАЛЛЕЛЬНОЕ ДЕКОДИРОВАНИЕ ПОТОКОВ ПЕРЕМЕЖАЮЩИХСЯ ДАННЫХ С ПОМОЩЬЮ ДЕКОДЕРА ЭГПИ

Изобретение относится к области вычислительной техники и может быть использовано в системах связи. Техническим результатом является повышение разрешающей способности. Система содержит входную цепь, перемежитель и процессор сигналов изображения. Варианты способа заключаются в создании множества потоков данных, каждый из которых содержит последовательности взаимно перемеженных составляющих блока пикселей. Затем обрабатывают блоки данных и запоминают их. 3 с. и 12 з.п.ф-лы, 28 ил.

УСТРОЙСТВО КОДИРОВАНИЯ ИЗОБРАЖЕНИЯ, СПОСОБ КОДИРОВАНИЯ ИЗОБРАЖЕНИЯ И ПРОГРАММА, А ТАКЖЕ УСТРОЙСТВО ДЕКОДИРОВАНИЯ ИЗОБРАЖЕНИЯ, СПОСОБ ДЕКОДИРОВАНИЯ ИЗОБРАЖЕНИЯ И ПРОГРАММА

Изобретение относится к области кодирования и декодирования изображений. Технический результат – обеспечение возможности управления качеством изображения. Устройство кодирования содержит: модуль получения, сконфигурированный с возможностью получения информации, соответствующей размеру блока для подлежащего кодированию целевого блока; модуль кодирования, сконфигурированный с возможностью кодирования параметра квантования упомянутого целевого блока в случае, когда информация, полученная посредством модуля получения, указывает, что упомянутый целевой блок меньше, чем блок управления квантованием, и параметр квантования, использованный для управления квантованием блока в блоке управления квантованием, который содержит подлежащий кодированию целевой блок, не был кодирован. 12 н. и 6 з.п. ф-лы, 32 ил.

ОТДЕЛИМЫЕ НАПРАВЛЕННЫЕ ПРЕОБРАЗОВАНИЯ

Изобретение относится к цифровому видеокодированию и, в частности, касается энтропийного кодирования коэффициентов видеоблоков. Техническим результатом является обеспечение эффективной группировки ненулевых коэффициентов вблизи передней части одномерного вектора коэффициентов для повышения эффективности энтропийного кодирования. Указанный технический результат достигается тем, что избирательно применяют множество различных преобразований к остаточным блокам на основе режима предсказания видеоблоков. По меньшей мере часть из множества преобразований является отделимыми направленными преобразованиями, подготовленными для соответствующего режима предсказания, для обеспечения более эффективного уплотнения энергии для остаточных блоков данного режима предсказания. Использование отделимых направленных преобразований дает преимущества, состоящие в снижении сложности вычислений и требований к памяти по сравнению с использованием неотделимых направленных преобразований. Вдобавок, при применении ...

СИСТЕМА ДЛЯ РЕКУРСИВНОГО ВОССТАНОВЛЕНИЯ ПОТОКОВОГО ИНТЕРАКТИВНОГО ВИДЕО

Изобретение относится к обеспечению серверного центра для размещения потокового интерактивного видео с малой задержкой. Техническим результатом является обеспечение рекурсивного восстановления потокового видео на сервере службы хостинга, за счет чего пользователи видеоигр-боевиков или приложений получают восприятие мгновенное ответной реакции в игре. Машинно-реализуемый способ удаленного размещения потокового интерактивного видео включает в себя исполнение видеоигр-боевиков или приложений на одном или более серверах центра службы хостинга, посредством чего формируются выводы видео. Способ также содержит сжатие выводов видео, посредством чего формируется сжатое потоковое интерактивное видео. Далее согласно способу осуществляется передача сжатого потокового интерактивного видео одному или более пользователям, воспроизводящим или использующим видеоигры-боевики или приложения на одном или более соответствующих клиентских устройствах, находящихся на удаленном расстоянии от центра службы хостинга ...

УСТРОЙСТВО КОДИРОВАНИЯ ВИДЕО С ПРЕДСКАЗАНИЕМ, СПОСОБ КОДИРОВАНИЯ ВИДЕО С ПРЕДСКАЗАНИЕМ, ПРОГРАММА КОДИРОВАНИЯ ВИДЕО С ПРЕДСКАЗАНИЕМ, УСТРОЙСТВО ДЕКОДИРОВАНИЯ ВИДЕО С ПРЕДСКАЗАНИЕМ, СПОСОБ ДЕКОДИРОВАНИЯ ВИДЕО С ПРЕДСКАЗАНИЕМ И ПРОГРАММА ДЕКОДИРОВАНИЯ ВИДЕО С ПРЕДСКАЗАНИЕМ

Изобретение относится к области кодирования и декодирования видео с предсказанием. Технический результат заключается в повышении эффективности использования заголовка блока уровня сетевой абстракции. Технический результат достигается за счет ввода данных сжатого изображения для множества изображений, образующих видеопоследовательность, при этом данные сжатого изображения инкапсулируются в блок NAL с информацией заголовка блока NAL, декодирования информации заголовка блока NAL и восстанавления данных сжатого изображения в качестве данных восстановленного изображения, при этом информация заголовка блока NAL содержит nal_unit_type, уникально указывающий, используются ли данные восстановленного изображения для ссылки при декодировании другого изображения, а декодирование восстанавливает данные сжатого изображения на основе nal_unit_type. 2 н.п. ф-лы, 10 ил., 5 табл.

СПОСОБ КОДИРОВАНИЯ ВИДЕО С ПРЕДСКАЗАНИЕМ ДВИЖЕНИЯ, УСТРОЙСТВО КОДИРОВАНИЯ ВИДЕО С ПРЕДСКАЗАНИЕМ ДВИЖЕНИЯ, ПРОГРАММА КОДИРОВАНИЯ ВИДЕО С ПРЕДСКАЗАНИЕМ ДВИЖЕНИЯ, СПОСОБ ДЕКОДИРОВАНИЯ ВИДЕО С ПРЕДСКАЗАНИЕМ ДВИЖЕНИЯ, УСТРОЙСТВО ДЕКОДИРОВАНИЯ ВИДЕО С ПРЕДСКАЗАНИЕМ ДВИЖЕНИЯ И ПРОГРАММА ДЕКОДИРОВАНИЯ ВИДЕО С ПРЕДСКАЗАНИЕМ ДВИЖЕНИЯ

Изобретение относится к декодированию видео с предсказанием. Технический результат заключается в повышении эффективности кодирования информации за счет уменьшении избыточной информации и обеспечении отсутствия необходимости повторного кодирования и декодирования информации, характерной для каждой опорной картинки. Такой результат достигается за счет того, что способы декодирования информации описания буфера используют свойство многократного использования одной и той же опорной картинки в процессах кодирования с предсказанием и декодирования для множества картинок, чтобы использовать корреляцию между элементами информации BD[k] описания буфера, используемыми для различных картинок, а информация, характерная для каждой опорной картинки (информация зависимости), является той же самой, что и для картинки, на которую делается ссылка, и, таким образом, информация может быть унаследована без изменений. 2 н.п. ф-лы, 24 ил.

НОВЫЕ НАБОРЫ ВЫБОРОК И НОВЫЕ СХЕМЫ ПОНИЖАЮЩЕЙ ДИСКРЕТИЗАЦИИ ДЛЯ ПРЕДСКАЗАНИЯ ВЫБОРКИ ЛИНЕЙНОЙ КОМПОНЕНТЫ

Группа изобретений относится к технологиям кодирования/декодирования блоков заданной компоненты видео, в частности интра-предсказанию таких блоков компоненты или получению выборок таких блоков. Техническим результатом является повышение эффективности кодирования/декодирования изображений. Предложен способ декодирования одного или более изображений из битового потока путем вывода параметров, представляющих прямую линию, проходящую через две точки, для получения выборки хромы целевого блока из связанной выборки люмы целевого блока. Способ содержит этап, на котором определяют две точки прямой линии, причем каждая из двух точек задается двумя переменными, причем первая переменная из двух переменных соответствует выборке люмы, и вторая переменная соответствует выборке хромы. Причем одна из двух точек определяется на основании максимального значения, относящегося к люме, и максимального значения, относящегося к хроме, причем максимальное значение, относящееся к люме, является значением, базирующимся ...

СПОСОБ КОДИРОВАНИЯ ВИДЕО С ПРЕДСКАЗАНИЕМ ДВИЖЕНИЯ, УСТРОЙСТВО КОДИРОВАНИЯ ВИДЕО С ПРЕДСКАЗАНИЕМ ДВИЖЕНИЯ, ПРОГРАММА КОДИРОВАНИЯ ВИДЕО С ПРЕДСКАЗАНИЕМ ДВИЖЕНИЯ, СПОСОБ ДЕКОДИРОВАНИЯ ВИДЕО С ПРЕДСКАЗАНИЕМ ДВИЖЕНИЯ, УСТРОЙСТВО ДЕКОДИРОВАНИЯ ВИДЕО С ПРЕДСКАЗАНИЕМ ДВИЖЕНИЯ И ПРОГРАММА ДЕКОДИРОВАНИЯ ВИДЕО С ПРЕДСКАЗАНИЕМ ДВИЖЕНИЯ

Изобретение относится к вычислительным технологиям для декодирования видео. Технический результат заключается в повышении эффективности декодирования видео. Технический результат достигается за счет декодирования закодированных данных информации BD[0] описания буфера для первого воспроизведенного изображения без ссылки на какую-либо информацию описания буфера для воспроизведенных изображений, отличных от упомянутого первого воспроизведенного изображения; декодирования закодированных данных информации BD[k] описания буфера (k>0) для последующего воспроизведенного изображения со ссылкой на информацию BD[m] описания буфера (m0) для упомянутого последующего воспроизведенного изображения; и управления этапом сохранения изображения на основе декодированной информации BD[k ...

ВЫБОР ТОЧНОСТИ ВЕКТОРА ДВИЖЕНИЯ

Изобретение относится к способу кодирования искусственно созданного видео, вычислительному устройству и считываемому компьютером носителю. Технический результат заключается в обеспечении возможности выбора точности вектора движения. Способ содержит кодирование видео, включающее в себя определение точности вектора движения (MV) для единицы видео, причем единица содержит множество блоков, и кодирование этой единицы с использованием упомянутой точности MV для единицы, при этом значения MV для упомянутых блоков внутри единицы видео имеют точность MV для единицы, и при этом определение точности MV для единицы включает в себя идентификацию набора значений MV, имеющих точность MV дробного отсчета, посредством идентификации значения MV для каждого блока единицы, и выбор точности MV для блоков единицы на основе, по меньшей мере частично, преобладания, внутри набора значений MV блоков, значений MV, имеющих дробную часть, равную нулю, и вывод кодированного видео. 3 н. и 9 з.п. ф-лы, 13 ил.

УСТРОЙСТВО ОБРАБОТКИ ИЗОБРАЖЕНИЙ И СПОСОБ ОБРАБОТКИ ИЗОБРАЖЕНИЙ

Изобретение относится к вычислительной технике. Технический результат заключается в повышении эффективности деблокирующей фильтрации. Устройство обработки изображений содержит модуль фильтрации, выполненный с возможностью применения деблокирующего фильтра, включающего в себя первый деблокирующий фильтр и второй деблокирующий фильтр, интенсивность фильтрации которого больше, чем у первого деблокирующего фильтра, к соседним пикселям, прилегающим к границе блоков в пределах локально декодированного изображения; контроллер, выполненный с возможностью управления, в качестве условия применения второго деблокирующего фильтра, вторым деблокирующим фильтром для применения процесса ограничения к разностному значению, изменяемому вторым деблокирующим фильтром, с использованием второго значения ограничения, превышающего первое значение ограничения, используемого в случае применения процесса ограничения к разностному значению, изменяемому первым деблокирующим фильтром; и модуль кодирования, выполненный ...

УСТРОЙСТВО И СПОСОБ ДЛЯ ОБРАБОТКИ, ПО МЕНЬШЕЙ МЕРЕ, ДВУХ ВХОДНЫХ ЗНАЧЕНИЙ

... 1. Устройство для обработки, по меньшей мере, двух входных значений, содержащее средство (202, 250, 252, 254, 256, 258, 260, 262) для обеспечения первого нецелочисленного входного значения и второго нецелочисленного входного значения, причем средство для обеспечения выполнено с возможностью взвешивания первого исходного значения для получения первого входного значения и вычисления второго входного значения посредством преобразования из последовательности исходных входных значений, к которой относится исходное первое значение (х1), или формирования первого входного значения из первого исходного значения и третьего значения (х3) посредством первого и второго этапов поднятия и последующего взвешивания (262), и формирования второго входного значения посредством взвешивания (270) из исходного второго входного значения (х2), и средство (268) для комбинирования первого входного значения и второго входного значения для получения нецелочисленного результирующего значения и для округления результирующего ...

УСТРОЙСТВО КОДИРОВАНИЯ ВИДЕО С ПРЕДСКАЗАНИЕМ, СПОСОБ КОДИРОВАНИЯ ВИДЕО С ПРЕДСКАЗАНИЕМ, ПРОГРАММА КОДИРОВАНИЯ ВИДЕО С ПРЕДСКАЗАНИЕМ, УСТРОЙСТВО ДЕКОДИРОВАНИЯ ВИДЕО С ПРЕДСКАЗАНИЕМ, СПОСОБ ДЕКОДИРОВАНИЯ ВИДЕО С ПРЕДСКАЗАНИЕМ И ПРОГРАММА ДЕКОДИРОВАНИЯ ВИДЕО С ПРЕДСКАЗАНИЕМ

Изобретение относится к области кодирования и декодирования видео с предсказанием. Технический результат заключается в повышении эффективности кодирования и декодирования видео с предсказанием. Технический результат достигается за счет этапа ввода, на котором вводят множество изображений, образующих видеопоследовательность; этапа кодирования, на котором кодируют эти изображения для генерирования данных сжатых изображений, включающих в себя набор опорных изображений (RPS), и инкапсулируют эти данные сжатых изображений в блок NAL с информацией заголовка блока NAL, и этапа декодирования, на котором декодируют информацию заголовка блока NAL и упомянутый RPS, и восстанавливают данные сжатых изображений в качестве данных восстановленных изображений, при этом упомянутый RPS идентифицирует набор изображений, который используется для внешнего предсказания ассоциированного изображения, при этом информация заголовка блока NAL содержит nal_unit_type. 2 н. и 2 з.п. ф-лы, 10 ил., 5 табл.

УСТРОЙСТВО ОБРАБОТКИ ИЗОБРАЖЕНИЙ И СПОСОБ ОБРАБОТКИ ИЗОБРАЖЕНИЙ

Изобретение относится к вычислительной технике. Технический результат заключается в повышении эффективности деблокирующей фильтрации. Устройство обработки изображений содержит схему, выполненную с возможностью: декодирования кодированного потока для генерирования декодированного изображения; применения деблокирующего фильтра, включающего в себя первый деблокирующий фильтр и второй деблокирующий фильтр, интенсивность фильтрации которого больше, чем у первого деблокирующего фильтра, к соседним пикселям, прилегающим к границе блоков в пределах декодированного изображения, генерируемого упомянутой схемой; и управления, в качестве условия применения второго деблокирующего фильтра, вторым деблокирующим фильтром для применения процесса ограничения к разностному значению, изменяемому вторым деблокирующим фильтром, с использованием второго значения ограничения первого деблокирующего фильтра. 2 н. и 13 з.п. ф-лы, 38 ил., 1 табл.

СПОСОБ КОДИРОВАНИЯ ВИДЕО С ПРЕДСКАЗАНИЕМ ДВИЖЕНИЯ, УСТРОЙСТВО КОДИРОВАНИЯ ВИДЕО С ПРЕДСКАЗАНИЕМ ДВИЖЕНИЯ, ПРОГРАММА КОДИРОВАНИЯ ВИДЕО С ПРЕДСКАЗАНИЕМ ДВИЖЕНИЯ, СПОСОБ ДЕКОДИРОВАНИЯ ВИДЕО С ПРЕДСКАЗАНИЕМ ДВИЖЕНИЯ, УСТРОЙСТВО ДЕКОДИРОВАНИЯ ВИДЕО С ПРЕДСКАЗАНИЕМ ДВИЖЕНИЯ И ПРОГРАММА ДЕКОДИРОВАНИЯ ВИДЕО С ПРЕДСКАЗАНИЕМ ДВИЖЕНИЯ

Изобретение относится к технологиям кодирования/декодирования видеоданных. Техническим результатом является повышение эффективности кодирования/декодирования изображений за счет многократного использования одного и того же опорного изображения для множества изображений. Предложен способ декодирования видео с предсказанием, исполняемый устройством декодирования видео с предсказанием. Способ содержит этап, на котором осуществляют декодирование значения deltaBD, представляющего разность между идентификационной информацией соответствующих опорных изображений в BD[m] и BD[k]. Далее согласно способу осуществляют декодирование множества флагов ibd_flag[j], указывающих и то, используется ли идентификационный номер j-го опорного изображения, включенного в BD[m], для декодирования идентификационного номера опорного изображения, включенного в BD[k]. 2 н.п. ф-лы, 24 ил.

КОДИРОВАНИЕ И ДЕКОДИРОВАНИЕ ЗНАЧАЩИХ КОЭФФИЦИЕНТОВ В ЗАВИСИМОСТИ ОТ ПАРАМЕТРА УКАЗАННЫХ ЗНАЧАЩИХ КОЭФФИЦИЕНТОВ

СИСТЕМА И СПОСОБ СЖАТИЯ ИНТЕРАКТИВНОГО ПОТОКОВОГО ВИДЕО

Устройство, содержащее множество серверов с видеовыходом, соединенным с устройством сжатия видео, которое передает интерактивное потоковое видео множеству пользователей, контур обратной связи, посредством которого интерактивное потоковое видео рекурсивно объединяется внутри видеовыхода множества серверов.

СПОСОБ ПРОВЕРКИ СОВПАДЕНИЯ СОСТОЯНИЙ ВИДЕОКОДЕРА И ВИДЕОДЕКОДЕРА

... 1. Способ проверки совпадения между состоянием первого видеопроцессора и состоянием второго видеопроцессора, где один из указанных видеопроцессоров является видеокодером с использованием видеокодирования с предсказанием, а другой из указанных видеопроцессоров является видеодекодером, способным восстанавливать декодированную видеопоследовательность из кодированного потока битов, сформированного указанным видеокодером, причем данный способ включает: ! формирование в указанном первом видеопроцессоре первого признака одного или более свойств первого состояния указанного первого видеопроцессора; и ! передачу сообщения, содержащего указанный признак, указанному второму видеопроцессору. ! 2. Способ по п.1, включающий также: ! формирование в указанном втором видеопроцессоре второго признака указанных свойств второго состояния указанного второго видеопроцессора; и ! проверку совпадения указанных первого и второго состояний указанных первого и второго видеопроцессоров путем сравнения указанных первого ...

УСТРОЙСТВО КОМПРЕССИИ С ДИФФЕРЕНЦИАЛЬНОЙ ИМПУЛЬСНО-КОДОВОЙ МОДУЛЯЦИЕЙ

Схемы шумоподавления в устройстве компрессии видеосигнала типа компрессии с дифференциальной импульсно-кодовой модуляцией (DPCM) с предсказанием содержат простой элемент нелинейной обработки (500) в системе DPCM (12, 15, 16, 18, 1333) для исключения остатков между предсказанными и реальными сигналами изображения, которые меньше, чем предварительно определенное значение. Исключение таких остатков резко уменьшает количество уплотненных данных, порожденных для сигналов, содержащих даже самые умеренные количества шума.

СПОСОБ И УСТРОЙСТВО ДЛЯ КОМПЕНСАЦИИ ДВИЖЕНИЯ С ПРЕДСКАЗАНИЕМ

СПОСОБ ДЛЯ КВАНТОВАННЫХ КОЭФФИЦИЕНТОВ, ПРЕДСТАВЛЯЮЩИХ БЛОК ВИДЕО

УСТРОЙСТВО КОДИРОВАНИЯ ИЗОБРАЖЕНИЯ, СПОСОБ КОДИРОВАНИЯ ИЗОБРАЖЕНИЯ И ПРОГРАММА, А ТАКЖЕ УСТРОЙСТВО ДЕКОДИРОВАНИЯ ИЗОБРАЖЕНИЯ, СПОСОБ ДЕКОДИРОВАНИЯ ИЗОБРАЖЕНИЯ И ПРОГРАММА

... 1. Устройство кодирования изображения, сконфигурированное с возможностью деления изображения на разделительные блоки и выполнения кодирования упомянутого изображения в модулях разделительных блоков, причем упомянутое устройство кодирования изображения содержит:модуль получения, сконфигурированный с возможностью получения размера блока для подлежащего кодированию целевого блока;модуль установки, сконфигурированный с возможностью установки размера блока для блока управления квантованием, используемого для управления квантованием изображения;модуль кодирования, сконфигурированный с возможностью кодирования параметра квантования, соответствующего подлежащему кодированию целевому блоку, в случае, когда размер блока, полученный посредством модуля получения, больше, чем или равен размеру блока, установленному посредством модуля установки; и кодирования общего параметра квантования для блока управления квантованием, содержащего подлежащий кодированию целевой блок, в случае, когда размер блока, ...

РАЗМЕР ЭЛЕМЕНТА МОЗАИЧНОГО ИЗОБРАЖЕНИЯ ПРИ КОДИРОВАНИИ ВИДЕО

... 1. Видеокодер, выполненный с возможностью кодирования видеопоследовательности, причем видеокодер содержит:модуль разделения, выполненный с возможностью разделения видеопоследовательности на элементы мозаичного изображения, при этом размер элемента мозаичного изображения больше, чем предварительно определенный минимальный размер элемента мозаичного изображения; ипо меньшей мере один модуль кодирования, выполненный с возможностью кодирования элементов мозаичного изображения.2. Видеокодер по п. 1, при этом кодер выполнен с возможностью оптимизации кодирования для конкретного видеодекодера, причем конкретный декодер выполнен с возможностью сохранения правой границы элемента мозаичного изображения в памяти вне кристалла.3. Видеокодер по п. 1 или 2, в котором минимальный размер элемента мозаичного изображения зависит от профиля кодирования и/или уровня кодирования.4. Видеокодер по п. 1 или 2, в котором размер элемента мозаичного изображения также меньше чем максимальный размер элемента мозаичного ...

SIGNALVERARBEITUNGSSYSTEM

BILDCODIERSYSTEM

A picture encoding system performs a prediction 15 of picture element values within a block having a plurality of picture elements into which an original picture is divided, a discrete sine transform 18 with respect to prediction error signals for obtaining a transform coefficient, a quantization 21 of the transform coefficient for encoding quantized indexes, an inverse quantization 25 of the quantized indexes for reproduction of the transform coefficient, an inverse discrete sine transform 16 of the reproduced coefficient to reproduce the prediction error signal, and an addition thereto of the predicted picture element value for reproducing the picture element values within the block to employ them in predicting a next stage block to be encoded, whereby the block can be minimized in size while simplifying required transform operation. ...

Verfahren und Vorrichtung zur VLC-Verschlüsselung bei einem Videoverschlüsselungssystem

Ein Verfahren und eine Vorrichtung zur Verschlüsselung mit einem Code einer variablen Länge (VLC) sind beschrieben. Bei einigen Beispielen wird ein Symbol von Frequenztransformationswerten, das eine Reihe und einen Pegel hat, VLC-verschlüsselt. Eine Adresse wird bei einem Prozessor für eine Nachschlagtabelle (LUT) in einem Speicher basierend auf der Reihe und dem Pegel erzeugt, wobei die LUT VLC-Einträge für alle möglichen Kombinationen von Reihenwerten, die von minimalen zu maximalen Reihen schwanken, und Pegelwerten, die von minimalen zu maximalen Pegeln schwanken, speichert, wobei jeder der VLC-Einträge eine Flag, die einen Umschaltmodus angibt, aufweist. Ein VLC-Eintrag wird unter Verwendung der Adresse aus der LUT gelesen. Ein VLC-Code und eine Bitlänge werden aus dem VLC-Eintrag erhalten, wenn die Flag in dem VLC-Eintrag ein erster Wert ist. Ein VLC-Code einer festen Länge wird aus einem Umschaltcode, der Reihe und dem Pegel erzeugt, wenn die Flag in dem VLC-Eintrag ein zweiter Wert ...

Verknüpfte Quantisierung und Normalisierung stützend auf eine Mantisse - Exponent Darstellung einer Quantisierungsparameterfunktion

SYSTEM ZUR VERARBEITUNG VON SIGNALEN NACH EINEM PYRAMIDEN-ALGORITHMUS IN REALZEIT

Bewegungsvektorerfassungsgerät

Verfahren zum Codieren und Decodieren von Daten

PYRAMIDENFÖRMIGER PIPELINE-PROZESSOR FÜR EIN BILDVERARBEITUNGSSYSTEM

Videocodierverfahren, Videodecoder und digitales Fernsehsystem unter Verwendung eines solchen Verfahrens und eines solchen Decoders

Verfahren zur hochauflösenden, skalierbaren Domänen-Übersetzung

Verfahren (100) zur Verarbeitung eines m-dimensionalen Eingangsdatensatzes (1) zu einem n-dimensionalen Ausgangsdatensatz (2) mit einem KI-Modul (3), welches dazu ausgebildet ist, k-dimensionale Eingangsdatensätze (31a-31d) mit einer durch trainierbare Parameter (33) festgelegten internen Verarbeitungskette (32) zu l-dimensionalen Ausgangsdatensätzen (34a-34d) zu verarbeiten, wobei k < m und I < n, mit den Schritten:• aus dem m-dimensionalen Eingangsdatensatz (1) werden überlappende Teilmengen (1a-1d) gebildet (110);• die Teilmengen (1a-1d) werden dem KI-Modul (3) als k-dimensionale Eingangsdatensätze (31a-31d) zugeführt und von dem KI-Modul (3) zu l-dimensionalen Ausgangsdatensätzen (34a-34d) verarbeitet (120);• Beiträge (2a-2d), die die l-dimensionalen Ausgangsdatensätze (34a-34d) jeweils zu jeder der n Dimensionen des n-dimensionalen Ausgangsdatensatzes (2) leisten, werden aggregiert (130).Zugehöriges Computerprogramm.

ENTBLOCKIERUNGSFILTERUNGSTECHNIKEN FÜR DIE VIDEOCODIERUNG GEMÄSS MEHRERER VIDEOSTANDARDS

System von Komplexitätsvorverarbeitung innerhalb eines Bildes

Ein Verfahren aufweisend: Erhalten eines ersten Datensatzes, der einen ersten Teil eines zu komprimierenden Videobildes darstellt; Feststellen einer ersten Mehrzahl von Variationswerten, wobei jeder Variationswert auf einer entsprechenden Teilmenge des ersten Datensatzes basiert; Feststellen eines DCT Typs, basierend auf der ersten Mehrzahl von Variationswerten; Bereitstellen von wenigstens einem Variationswert, um in einem Speicher gespeichert zu werden, wobei der wenigstens eine Variationswert auf wenigstens einem der Mehrzahl von Variationswerten basiert; Bereitstellen eines Indikators des DCT Typs, um im Speicher gespeichert zu werden; und wobei der Indikator des DCT Typs und der eine Variationswert in einem gemeinsamen Datenwort gespeichert werden.

Data transform apparatus

Residual entropy compression for cloud-based video applications

Tile copying for video compression

Method and system for compressed video processing

Scratch for storing intermediate loop filter data

Syntax error correction in an MPEG data stream

An incoming data stream which is in MPEG format or is to be converted to MPEG format is parsed to detect coding parameters and any errors in the syntax of a macroblock or slice are detected and the block or slice is replaced by a predetermined block or slice having acceptable syntax. The error may occur in the header or data block and correction may occur before or after variable length decoding. The predetermined block or slice may represent black or a grey level. The invention finds particular application in MPEG to SX conversion which is appropriate for recording on video tape in compressed format where MPEG coded signals would be incorrectly replayed at non-standard replay speeds.

Data compression

A method of compressing a data set, said method comprising: inserting a plurality of reset tokens at pre-determined intervals within said data set, to convert said data set into a plurality if smaller data chunks; compressing a plurality of said data chunks simultaneously in parallel with each other 202, 203, to produce a plurality of compressed data chunks. The method may be applied in a data storage device such as in a tape drive storage system. Other embodiments disclosed include:

Method and apparatus for compression using reversible wavelet transforms and an embedded codestream

Video decoding and time synchronisation

An MPEG video decompression method and apparatus describe several inventions including memory addressing, transforming data using a common processing block, time synchronization, asynchronous swing buffering, storing of video information and a parallel Huffman decoder. The time synchronisation, of e.g. system decoder 256 and video decoder 270, involves clock references 253 for initialising system time in at least the decoder 256, video time stamps for defining the time at which the picture is decoded or displayed, and time counters 255, 258 in each circuit 256, 270. ...

Coding and reproducing compression-encoded video data

A method for encoding and reproducing compression-encoded video data of an MPEG specification is comprised of: selecting a user and multiplexing level according to video data kinds by a sequence and GOP (group of picture) unit to be set as a reproducing level in the user data of the MPEG specification when the video data is compression-encoded according to the MPEG specification; checking 602 whether the reproducing level is set in every sequence when the compression-encoded video data is reproduced; comparing 608 with the reproducing level an assigned level input by a user; halting decoding when the assigned level is not suitable for the reproducing level; checking 610 whether the reproducing level is set in the user data every GOP of the corresponding sequence when the reproducing level is not set in the corresponding sequence or the assigned level is suitable for the reproducing level of the corresponding sequence; comparing 612 the reproducing level with the assigned level when the ...

A symmetric filtering based VLSI architecture for image compression

An apparatus to perform symmetric filtering image compression is provided. The apparatus includes an N-element shift circuit, that has N shifting blocks (SB), to store and shift data elements. Each data element represents a pixel of an image. The apparatus also includes a first plurality of adder circuits to add data elements from a first plurality of pairs of SBs of the N SBs. The apparatus further includes a second plurality of adder circuits to add data elements from a second plurality of pairs of SBs of the N SBs. Additionally, the apparatus includes a first plurality of multiplier circuits, to multiply by corresponding low pass coefficients results of additions performed by the first plurality of adder circuits. The apparatus also includes a second plurality of multiplier circuits, to multiply by corresponding high pass coefficients results of additions performed by the second plurality of adder circuits.

A method and device for encoding and decoding source data using a shared databases

In the encoding process portions (i.e. blocks) of source data 20 are matched to elements in one or more databases (such as a code-book) 100, the elements being representative of corresponding data blocks. A reference value (or code) is recorded for each block of the source data that relates it to its matched elements. These references values are then included in the encoded data together with the databases and/or information identifying the databases. The decoding process involves decoding from the encoded data the reference values and then using then to identify the corresponding elements in the databases The decoded data is then generated by assembling the data blocks represented by the elements that have been indicated by the decoded reference values. The encoder and decoder can be used in a codec system 5 in which an encoder 10 and decoder 50 share one or more databases referred to by the reference values included in the encoded data.

Image compression

A method of processing image data for transmittal to a display device involves receiving a frame of image data, the frame being divided into tile groups composed of tiles of pixels, each having a number of colour component values of a first colour space. Each tile includes a number of colour component planes of the first colour space having the colour component values for the pixels forming the tile. Each tile group is processed in an execution unit, formed by arithmetic logic units (ALUs) and a local shared memory, where each ALU includes dedicated register space for use solely by the ALU, and each tile of each tile group is processed by a number of the ALUs of the execution unit. Each ALU performs a reversible colour transformation (S1) on the colour component values from the first colour space to a second colour space and discards the remaining colour component values and then performs a discrete wavelet transformation (S2) on the colour component values of one colour component plane ...

Encoder of digital data stream determines encoding technique according to available power

An encoder encodes a data stream comprising a sequence of digital values. The encoder comprises first and second logical blocks and a software driver. The driver receives an indication of an amount of available power 512, 513, 514, (210, fig.2), possibly from a power management module, and determines whether to encode the data stream using either a first encoding technique 520, 530 or a second encoding technique 530, 540, (220, fig.2). If the power indication is above a certain threshold, the first block performs an encoding operation based on the first technique; otherwise the second block performs an encoding operation based on the second technique (240, fig.2). If the sequence of digital values are encoded using the second technique, the driver switches off the first block whereas, if the sequence of digital values are encoded using the first technique, the driver switches off the second block. Selection and use of an appropriate encoding technique may be applied to sequential subsets ...

Piecewise processing of overlap smoothing and in-loop deblocking

Systems and methods for rendering & pre-encoded load estimation based encoder hinting

Systems and methods for rendering & pre-encoded load estimation based encoder hinting

Encoding video data in a game environment, comprising: recording one or more playthroughs 700, 702 of a game environment; sorting a plurality of frames from the one or more playthroughs into cells 706 according to their location in the game environment; calculating an average encoded frame size 714 for each frame 708 associated with a given cell; calculating an average frame size 718 across all cells; based on these calculations, associating a quality setting 720 for each cell; encoding frames based on the quality setting associated to each cell. The cells are cells of a heatmap 704 tracking locations of frames in the playthroughs on a game environment map. Preferably the quality is adapted via setting a quantisation parameter used in transform encoding the video frames.

Guaranteed data compression

Data processing systems

Encoding image or graphics texture map data by dividing the array into block and representing sample data of each block using a tree or quadtree. The image or texture data is intended for display such that higher resolution is required in central or foveal regions, so the tree data may be truncated to store lower spatial resolution data for certain blocks. Each node of a tree is associated with a differential value that is added to a pixel value derived from a parent node to derive a pixel value for the current node. In this way, when truncated at a node, the sample of the block represented by the node is populated by the pixel value associated to the node. Preferably this is either a minimum value 65 or an average 63 of the pixels in the associated sub-block of the data array. Data indicative of a resolution that is to be used by the consumer circuitry such as a graphics processor or a display for at least one region of the array of data elements is provided to the encoding circuitry, ...

Wavelet transform filter

Random accessible image data compression

Methods and compression units for compressing a block of image data. The block of image data comprising a plurality of image element values. Each image element value is divisible into at least a first value and a second value such that the block of image data comprises a two dimensional block of first values and a two-dimensional block of second values. The method comprises: compressing each of a first data set and a second data set in accordance with a fixed-length compression algorithm of one or more fixed-length compression algorithms to generate first and second compressed blocks respectively, the first data set comprising all or a portion of the two-dimensional block of first values and the second data set comprising all or a portion of the two-dimensional block of second values, wherein each data set is compressed in accordance with the fixed-length compression algorithm by: identifying common base information for the data set; and identifying a fixed-length parameter for each value ...

Method, device, and computer program for enhancing encoding and encapsulation of point cloud data

A method comprising obtaining point cloud data comprising frames comprising 3D points, associated attributes, and first metadata describing the attribute values; and encoding the point cloud and first metadata in geometry, attribute, and metadata units in a bit stream. The first metadata may be encoded in a parameter or dedicated data unit and the attribute value may be a frame index (frame_idx) describing sub-frames within the frame . Also disclosed is a method comprising generating second metadata based on the first, and encapsulating the encoded geometry and attribute units and second metadata in a media file 700. Also disclosed is a method comprising encapsulating the encoded geometry and attribute units in a media file based on the first metadata. The bit-stream may be a G-PCC bit stream complicit with an ISOBMFF standard. The second metadata may comprise a sub-sample information box (subs) 725 and the method may be achieved by extending the sub-sample definition to allow mapping of ...

Low complexity enhancement video coding

A bitstream for transmitting one or more enhancement residuals planes suitable to be added to a set of preliminary pictures obtained from a decoder reconstructed video, comprises a decoder configuration for controlling a decoding process of the bitstream, and encoded enhancement data comprising encoded residual data representing differences between a reference video frame and a decoded version of the video frame (as per LCEVC / MPEG 5). The decoder configuration comprises scaling mode parameter(s), wherein each scaling mode parameter indicates a transform matrix that should be used for decoding coefficient groups of transform coefficients. The enhancement coding may operate on top of a base layer, which may provide base encoding and decoding. Spatial scaling may be applied across different layers. Only the base layer encodes full video, which may be at a lower resolution. The enhancement coding instead operates on computed sets of residuals. The sets of residuals are computed for layers ...

Methods and apparatus for preventing rounding errors when transform coefficients representing a motion picture signal are inversely transformed

DEVICE AND PROCEDURE FOR PROCESSING AT LEAST TWO INPUT VALUES

FILTER CIRCUIT FOR VIDEO DATA IN THE FREQUENCY RANGE

DEVICE FOR MANIPULATING COMPRESSED VIDEO SEQUENCES

SYSTEM AND PROCEDURE FOR THE PARALLEL DATA COMPRESSION AND - DECOMPRESSION

DEVICE FOR THE AVOIDANCE OF ROUNDING ERRORS WITH THE INVERSE TRANSFORMATION OF TRANSFORMATION COEFFICIENTS OF A MOVING PICTURE SIGNAL

Adaptive video decompression

Memory reduction for non-separable transforms

Techniques are described in which a decoder is configured to receive an input data block and apply an inverse non-separable transform to at least part of the input data block to generate an inverse non-separable transform output coefficient block. The applying the inverse non-separable transform comprises assigning a window, assigning a weight for each position inside the assigned window, and determining the inverse non-separable transform output coefficient block based on the assigned weights. The decoder is further configured to forming a decoded video block based on the determined inverse non-separable transform output coefficient block, wherein forming the decoded video block comprises summing the residual video block with one or more predictive blocks.

An image processing device and method for performing efficient deblocking

The present invention relates to the field of picture processing. Especially, the invention deals with improving the deblocking filter of an image processing device. To this end, the present invention presents an image processing device intended for use in an image encoder and/or an image decoder, for deblocking a block edge between a first coding block and a second coding block of an image encoded with a block code is provided. The first block has a block size (S ...

Video predictive encoding device, video predictive encoding method, video predictive encoding program, video predictive decoding device, video predictive decoding method, and video predictive decoding program

A NAL unit header in the conventional method is inefficient, even in cases where a value of nalref flag is uniquely determined according to a value of nal-unittype, since respective bits are assigned to nal-ref flag and nal-unittype. A solution to this problem is a video predictive encoding device provided with an input device to input pictures forming a video sequence, and an encoding unit to encode the pictures by either intra prediction or inter prediction to generate compressed picture data, and to packetize the compressed image data along with packet header information. The packet header information contains a picture type, and wherein the encoding unit determines the picture type so as to uniquely indicate whether encoded picture data is used for reference in decoding of another picture. Reference should be made to Fig. 1. zz j k ~ 00 c CcC u--j o 22 (D c =1 (0 CD ___ _ jc Lii CD2 ...

METHOD AND APPARATUS FOR SELECTING PARTICULAR DECODER BASED ON BITSTREAM FORMAT DETECTION

Method and apparatus for motion compensation prediction

The invention relates to a motion compensation performed under an inter- frame prediction. A fractional sample interpolation is applied on retrieved samples to generate fractional samples. The fractional sample interpolation comprises a plurality of filtering operations, and all of filtered results from the filtering operations are truncated down to a predetermined bit depth independent of the bit depth of the samples stored in the reference picture memory.

Multi-metric filtering

A filter unit of a video encoder or video decoder can determine a first metric for a group of pixels within a block of pixels, determine a second metric for the group of pixels, determine a filter based on the first metric and the second metric, and generate a filtered image by applying the filter to the group of pixels. The first metric and second metric can be an activity metric and a direction metric, respectively, or can be other metrics such as an edge metric, horizontal activity metric, vertical activity metric, or diagonal activity metric.

Spatial prediction method, image decoding method, and image coding method

In a spatial prediction method which can reduce the complexity of spatial prediction, a horizontal gradient (Gy) and a vertical gradient (Gx) between pixels in an adjacent block which is adjacent to a block which is the subject of prediction are acquired, and thus an edge (E) which overlaps with the block which is the subject of prediction is detected (S10); the integer incline of the detected edge is calculated (S11); and for each pixel position in the block which is the subject of prediction, a fractional pixel position (450) which has the calculated integer incline, and is the intersection point between a line (430) which passes through the pixel position (440), and the boundary of the adjacent block is determined (S12); the pixel value of the pixel position (440) for each pixel position in the block which is the subject of prediction is predicted on the basis of a pixel value which has been interpolated by the fractional pixel position (450) determined for said pixel position (S13).

Method, apparatus and system for encoding video data

Abstract METHOD, APPARATUS AND SYSTEM FOR ENCODING VIDEO DATA A video encoding (100) and decoding (200) system that can reallocate arithmetically coded symbols to reduce buffering requirements is disclosed. The reallocation occurs by mapping bins used to represent each syntax element in a video bitstream between a probability level contained in a context model and an arithmetic encoder or decoder. A process for deriving a mapping is performed in the encoder and the decoder. ) ...

QUALITY PRIORITY

SYSTEM AND METHOD FOR BIT-PLANE DECODING OF FINE-GRANULARITY SCALABLE (FGS) VIDEO STREAM

Determining palette size, palette entries and filtering of palette coded blocks in video coding

Techniques are described for palette-based coding. In palette-based coding, a video coder may form a palette as a table of colors for representing video data of a given block. Palette-based coding may be useful for coding blocks of video data having a relatively small number of colors. Rather than coding actual pixel values or their residuals for the given block, the video coder may code index values for one or more of the pixels. The index values map the pixels to entries in the palette representing the colors of the pixels. Techniques are described for determining whether to disable filtering, such as deblocking filtering or sample adaptive offset (SAO) filtering, of palette coded blocks at a video encoder or a video decoder. Techniques are also described for modify a palette size and palette entries of a palette at the video encoder based on rate-distortion costs.

Slice level intra block copy and other video coding improvements

A device for decoding video data includes a memory configured to store the video data and one or more processors configured to receive a slice of the video data, parse an intra block copy (IBC) syntax element to determine that an IBC mode is enabled for the slice, parse a slice type syntax element associated with the slice to determine the slice is an I slice, and decode the slice as an I slice by decoding all blocks of the slice using intra prediction coding modes.

Clipping for cross-component prediction and adaptive color transform for video coding

A device for encoding or decoding video data may clip first residual data based on a bit depth of the first residual data. The device may generate second residual data at least in part by applying an inverse Adaptive Color Transform (IACT) to the first residual data. Furthermore, the device may reconstruct, based on the second residual data, a coding block of a coding unit (CU) of the video data.

VIDEO ENCODING METHOD WITH BIT DEPTH ADJUSTMENT FOR FIXED-POINT CONVERSION AND APPARATUS THEREFOR, AND VIDEO DECODING METHOD AND APARATUS THEREFOR

... [Abstract] Disclosed are a video encoding method which adjusts the range of output data, which has been encoded so that the bit depth can be controlled during the decoding process of encoded samples, and a video decoding method, which prevents overflow of output data in each step of the decoding process. The video decoding method comprises: decoding by parsing quantized conversion factors for each block in an image from a received bitstream; decoding conversion factors which are less than or equal to a first bit depth by executing an inversion quantization of the quantized conversion factors; and decoding samples which are less than or equal to a second bit depth by executing a first level quantization and inverse scaling of the conversion factors.

Lossless compression and decompression of digital images using prior image context

Techniques for image recompression. In one implementation, the techniques are implemented to recompress a baseline joint photographic experts group (JPEG) image with compression savings. 5 The techniques replace the Huffman coding of baseline JPEG with an arithmetic coding that uses a sophisticated adaptive probability model. The arithmetic coding techniques avoid global operations such as global sorting that would prevent distributed and multithreaded decompression operations when recovering the original JPEG image from the recompressed image. At the same time, the techniques realize substantial compression savings relative to baseline JPEG, on average 10 23% compressing savings in some implementations.

A parallel huffman decoder

System and method for parallel data compression and decompression

SYSTEM AND METHODS FOR EFFICIENT QUANTIZATION

... ²²²A method in a signal processor for quantizing a digital signal is provided. A ²fixed-point approximation of a value X.div.Q is generated, wherein X is a ²fixed-point value based on one or more samples in the digital signal, and ²wherein Q is a fixed-point quantization parameter. A correction is generated, ²and the approximation is modified with the correction.² ...

SYSTEM AND FORMAT FOR ENCODING DATA AND THREE-DIMENSIONAL RENDERING

... 3D+F encoding of data and three-dimensional rendering includes generating a fused view 2D image and associated generating- vectors, by combining first and second 2D images such that the fused view 2D image contains information associated with elements of the first and second 2D images, and the generating-vectors indicate operations to be performed on the elements of the fused view 2D image to recover the first and second 2D images. The facilitates 3D rendering using reduced power requirements compared to conventional techniques, while providing high quality, industry standard image quality.

NONLINEAR ADAPTIVE LOOP FILTERING IN VIDEO PROCESSING

Devices, systems and methods for video processing are described. In an exemplary aspect, a method for video processing includes encoding a video unit of a video as an encoded video unit; generating reconstruction samples from the encoded video unit; performing a clipping operation on the reconstruction samples, wherein a clipping parameter used in the clipping operation is a function of a clipping index and a bit-depth of the reconstruction samples or a bit-depth of samples of the video unit; applying a non-linear adaptive loop filter to an output of the clipping operation; and generating a coded representation of the video using the encoded video unit.

VIDEO PROCESSING

PROCESSING MODE SELECTION FOR CHANNELS IN A VIDEO MULTI-PROCESSOR SYSTEM

An efficient processing system, such as for transcoding video data. In an embodiment that is suitable for single or multiple processor embodiments, a processing mode is set for each input video frame, e.g., as a full transcode mode (740), which uses motion compensation, a requantization mode (755), which avoids motion compensation, or a bypass mode (750). The processing mode selection is based on a number or processing cycles that are available to process a frame, and an expected processing requirement of the frame. The bypass or requantization modes are selected to avoid a buffer overflow of the processor.

IMAGE DECODING METHOD USING RESIDUAL INFORMATION IN IMAGE CODING SYSTEM, AND DEVICE FOR SAME

An image decoding method performed by a decoding device, according to the present document, comprises the steps of: receiving a bitstream including residual information of a current block; deriving a specific number of context-encoding bins for context syntax elements for a current sub-block of the current block; decoding the context syntax elements for the current sub-block included in the residual information on the basis of the specific number; deriving transform coefficients for the current sub-block on the basis of the decoded context syntax elements; deriving residual samples for the current block on the basis of the transform coefficients; and generating a reconstructed picture on the basis of the residual samples.

MOTION VIDEO PREDICT CODING METHOD, MOTION VIDEO PREDICT CODING DEVICE, MOTION VIDEO PREDICT CODING PROGRAM, MOTION VIDEO PREDICT DECODING METHOD, MOTION VIDEO PREDICT DECODING DEVICE, AND MOTION VIDEO PREDICT DECODING PROGRAM

The problem of the conventional technology was to repeatedly encode the same information using many bits in encoding of buffer description information about reference pictures to be used in video predictive encoding. A video predictive encoding device includes: input means to implement input of pictures constituting a video sequence; encoding means which conducts predictive coding of a target picture using, as reference pictures, pictures having been encoded and then reconstructed in the past, to generate compressed picture data; reconstruction means to decode the compressed picture data to reconstruct a reproduced picture; picture storage means to store the reproduced picture as a reference picture for encoding of a subsequent picture; and buffer management means to control the picture storage means, wherein the buffer management means controls the picture storage means, (prior to predictive encoding of the target picture), on the basis of buffer description information BD[k] related to ...

METHOD AND APPARATUS FOR MOTION COMPENSATION PREDICTION WITH MULTIPLE FRACTIONAL SAMPLE INTERPOLATIONS

Video decoding apparatus and method

A video decoding apparatus for decoding an encoded video bitstream having frames of video data encoded in rows of macroblocks. The video decoding apparatus comprises a parsing unit configured to receive the encoded video bitstream and to interpret the encoded video bitstream to generate items of macroblock information to be used for reconstructing the video frames of video data. The parsing unit is configured to store the items of macroblock information in a memory in bitstream order. The video decoding apparatus further comprises a line control unit configured to generate line control information associated with each row of macroblocks, the line control information comprising a sequence of pointers to the items of macroblock information stored in the memory, such that sequentially reading the sequence of pointers accesses the items of macroblock information in raster scan order. The line control information is stored in said memory in association with said items of macroblock information. A reconstruction pipeline is configured to reconstruct the frames of video data with reference to the line control information.

Multiple image buffer simulation

Various embodiments related to a host computing device for rendering and sending image data to a peripheral device for display at the peripheral device. For example, one embodiment comprises a host computing device, the host computing device comprising a data storage subsystem and a logic subsystem. The host computing device further comprises instructions stored in the data storage subsystem and executable by the logic subsystem to output to the peripheral device a frame of image data representing a difference between a currently rendered image and an (N−1)-th previously rendered image, N being an integer and having a value of 3 or more.

Context-based adaptations of video decoder

A receive device receives video data in the form of an encoded video bit stream. A video decoder of the receive device identifies a portion of the video data corresponding to a first scene and determines a complexity for this first scene and also determines a quality of service for the receive device. If the complexity of the first portion of video data is greater than a complexity threshold value or the quality of service is less than a quality of service threshold value, then the video decoder uses a hardware accelerator to decode the portion of video data. If, however, the complexity of the portion of video data is less than the complexity threshold value and the quality of service is greater than the quality of service threshold value, then the video decoder may use software decoding to decode the portion of video data.

Graphics display system with video scaler

A method for processing video data includes performing by one or more processors and/or circuits in a video processing device, the one or more processors and/or circuits including a video scaler, a memory, and a scaler engine, functions including receiving a video image by the video processing device. The functions also include determining whether the video scaler requires less memory bandwidth to scale the video image before writing the video image to the memory or after reading the video image from the memory, and scaling the video image based on the determination. If the video scaler requires less memory bandwidth to scale the video image before writing the video image to the memory, performing by the one or more processors and/or circuits scaling of the video image in the video scaler using a video input clock of the video scaler to generate a first scaled video image.

Real-time video coding/decoding

A video codec having a modular structure for encoding/decoding a digitized sequence of video frames in a multi-core system is described. The video codec comprises a memory unit; a multithreading engine. and a plurality of control and task modules organized in a tree structure, each module corresponding to a coding operation. The modules communicate with each other by control messages and shared memory. The control modules control all coding logic and workflow, and lower level task modules perform tasks and provide calculations upon receiving messages from the control task modules. The multithreading engine maintains context of each task and assigns at least one core to each task for execution. The method of coding/decoding comprises an error resilient algorithm.

Image decoding apparatus, image decoding method, image encoding apparatus, image encoding method, and program

An image decoding apparatus includes a first decoding unit configured to decode a bit stream that is generated by using a first variable length encoding system, so as to generate an intermediate stream, a second decoding unit configured to decode a bit stream that is generated by using a second variable length encoding system, so as to generate a syntax element, a syntax conversion unit configured to convert the syntax element that is generated, from syntax of the second variable length encoding system into syntax of the first variable length encoding system, and a first encoding unit configured to encode the syntax element that is syntax-converted, so as to generate the intermediate stream.

Methods and Systems for Facilitating Multimedia Data Encoding

Several methods and systems for facilitating multimedia data encoding are disclosed. In an embodiment, a plurality of picture buffers associated with multimedia data are received in an order of capture associated with the plurality of picture buffers. Buffer information is configured for each picture buffer from among the plurality of picture buffers comprising at least one of a metadata associated with the corresponding picture buffer and one or more encoding parameters for the corresponding picture buffer. A provision of picture buffers in an order of encoding is facilitated based on the configured buffer information.

Multi-metric filtering

An encoder can generate a series of codewords to signal to a decoder a mapping of range combinations for two or more metrics. The encoder can generate a first codeword to indicate a current combination being decoded maps to the same filter as the most recently decoded combination that shares the same range for the first metric. The encoder can generate a second codeword to indicate that the current combination maps to the same filter as the most recently decoded combination that shares the same range for the second metric. If the current combination does not map to the same filter as either of these most recently decoded combinations, then the encoder can generate a third codeword that indicates the filter that maps to the current combination.

Multi-metric filtering

A filter unit determines a mapping of range combinations to filters. Each range combination includes a range for a first metric and a range for a second metric. The filter unit determines a unique range combination identification (ID) for each range combination, with each unique range combination ID corresponding to a sequential value. The filter unit assigns a unique group ID to each group of range combinations. A group of range combinations includes range combinations mapped to the same filter, and the unique group IDs correspond to a set of sequential values. The filter unit signals or reconstructs coefficients for the filters in an order based on the sequential values of the group IDs.

Image coding method, image decoding method, image coding apparatus, image decoding apparatus, and image coding and decoding apparatus

The image coding method is used to code images to generate a coded stream. The image coding method includes: writing, into a sequence parameter set in the coded stream to be generated, a first parameter representing a first bit-depth that is a bit-depth of a reconstructed sample in the images; and writing, into the sequence parameter set, a second parameter which is different from the first parameter and represents a second bit-depth that is a bit-depth of an Intra Pulse Code Modulation (IPCM) sample in the images.

Image coding method and decoding method, image coding apparatus and decoding apparatus, camera, and imaging device

An image coding method includes: a predictive pixel generation step of generating a predictive value from at least one surrounding pixel located near a compression target pixel; a code conversion step of code-converting the pixel data to generate a Gray code; and quantizing bit change information (exclusive OR) between the generated Gray code and a Gray code of the predictive value to a quantization value, to compress the pixel data. This prevents significant image quality degradation, so that high image quality can be achieved.

Wavelet transformation using multicore processors

A method for wavelet based data compression comprising: receiving data associated, with a set of pixels, computing wavelet coefficients by applying a series of Discrete Wavelet Transform (DWT) low-pass and high-pass filtering operations, wherein a number of filtering operations is reduced by: identifying common partial products for at least one of the lowpass filtering operations and the high-pass filtering operations, classifying a first portion of the wavelet coefficients as low magnitude coefficients and a second portion of the wavelet coefficients as high magnitude coefficients, eliminating the common partial products for the high magnitude wavelet coefficients, replacing multiplication operations for the low magnitude wavelet coefficients with shift-and-add operations, and eliminating the common partial products, and applying the DWT based on remaining filtering operations.

Method and Apparatus for Determining Motion Between Video Images

Systems and methods of determining motion vectors, such as for video encoding, are disclosed. In one example, motion vectors are determined for a current frame, using sampled pixel information from a reference frame. Sampled pixel information is obtained using a sampling pattern. The sampling pattern, in one example, includes subsampling pixels at different rates for horizontal and vertical directions. The subsampling rate can differ, based on an amount of motion represented by a matching block (e.g., the farther a match is found away from an origin of the block, the more subsampling can be done). In another example, a full pixel resolution is maintained proximal an original location of the block; as distance increases in one or more directions, subsampling can begin and/or increase. Sampled pixels can be stored. Interpolation of the sampled pixels can be performed and the sampled and resulting interpolated pixels can be used for comparison.

Methods and apparatus for adaptive coupled pre-processing and post-processing filters for video encoding and decoding

Methods and apparatus are provided for adaptive coupled pre-processing and post-processing filters for video encoding and decoding. The apparatus and method encode input data for a picture into a resultant bitstream, wherein said video encoder comprises a pre-filter and a post-filter coupled to the pre-filter, wherein said pre-filter filters the input data for the picture and the post-filter filters in-loop reconstructed data for the picture.

Low resolution intra prediction

A video decoder decodes video from a bit-stream including a low resolution predictor that predicts pixel values based upon both a low resolution reference image and an interpolated high resolution reference image at positions different from the low resolution reference image using low resolution motion data. A high resolution predictor predicts pixel values using a non-interpolated high resolution reference image at positions different from the low resolution reference image using the low resolution motion data, wherein the non-interpolated high resolution reference image and the interpolated high resolution reference image are co-sited.

Prediction-Based Image Processing

A pixel block is compressed by providing a respective color component prediction for each pixel in the block. A difference between color components of two neighboring pixels is calculated and compared to a threshold. If the difference is smaller than the threshold, the prediction is calculated based on a first linear combination of the color components of these two neighboring pixels. However, if the difference exceeds the threshold, a second or third linear combination of the color components of the neighboring pixels is employed in the prediction. A guiding bit associated with the selected linear combination may be used. A prediction error is calculated based on the color component of the pixel and the provided prediction. The compressed block comprises an encoded representation of the prediction error and any guiding bit.

Image compression method with fixed compression ratio, image decompression method, and electronic device thereof

An electronic device includes a multi-field sensor, a memory, and a codec wrapper module, in which the codec wrapper module includes at least one encoder and at least one decoder. The encoder compresses raw data of an image into an image bit stream with a compression ratio through the following steps. The image is segmented into various image bands. Storage space is allocated in the memory and is segmented into various compressed band regions according to the compression ratio and a bit stream length of the raw data. A starting position of each compressed band region is recorded as a current ending position. Lines, sequentially received, are compressed into compressed bit streams respectively. The compressed bit streams are sequentially written into the corresponding compressed band regions according to field indexes of the lines, an output field order, and a group formed by the image bands corresponding to the lines.

Video Decoding System Supporting Multiple Standards

System and method for decoding digital video data. The decoding system employs hardware accelerators that assist a core processor in performing selected decoding tasks. The hardware accelerators are configurable to support a plurality of existing and future encoding/decoding formats. The accelerators are configurable to support substantially any existing or future encoding/decoding formats that fall into the general class of DCT-based, entropy decoded, block-motion-compensated compression algorithms. The hardware accelerators illustratively comprise a programmable entropy decoder, an inverse quantization module, a inverse discrete cosine transform module, a pixel filter, a motion compensation module and a de-blocking filter. The hardware accelerators function in a decoding pipeline wherein at any given stage in the pipeline, while a given function is being performed on a given macroblock, the next macroblock in the data stream is being worked on by the previous function in the pipeline.

Inter-prediction method and video encoding/decoding method using the inter-prediction method

An inter-prediction method and a video encoding/decoding method using the inter-prediction method are disclosed. The video encoding method using inter-prediction includes: encoding a first picture that serves as a reference for random access; inter-prediction encoding a block included in a second picture, which is displayed before the first picture, by using a plurality of reference pictures; generating reference picture information representing whether a past picture, which is displayed before the second picture, is used as a reference picture for encoding the second picture; and transmitting the encoded first and second pictures and the reference picture information.

Applying partition-based filters

In general, techniques are described for applying partition-based filters when coding video data. A device comprising at least one processor may be configured to implement the techniques. The processor selects a filter to apply near a boundary of a first portion of the video data and determines at least one of the plurality of filter coefficients of the selected filter for which the video data will not be available to be filtered. Based on the determination, the processor determines a partial filter that does not include the at least one of the plurality of filter coefficients for which the video data will not be available to be filtered. The processor renormalizes the plurality of filter coefficients included within the partial filter and applies the renormalized partial filter near the boundary of the first portion of the video data to generate a filtered first portion of the video data.

Adaptive coding of video block prediction mode

This disclosure describes techniques for coding of header information of video blocks. In particular, the techniques of this disclosure select one of a plurality of prediction modes for use in generating a prediction block of a video block of a coding unit, the plurality of prediction modes including unidirectional prediction modes and multi-directional prediction modes that combine at least two unidirectional prediction modes. An encoding device encodes the prediction mode of the current video block based on prediction modes of one or more previously encoded video blocks of the coding unit. Likewise, a decoding unit receives encoded video data of a video block of a coding unit and decodes the encoded video data to identify one of a plurality of prediction modes for use in generating a prediction block of the video block based on prediction modes of one or more previously decoded video blocks of the coding unit.

Method and apparatus for accessing data of multi-tile encoded picture stored in buffering apparatus

A method for read pointer maintenance of a buffering apparatus, which is arranged to buffer data of a multi-tile encoded picture having a plurality of tiles included therein, includes the following steps: judging if decoding of a first tile of the multi-tile encoded picture encounters a tile boundary of the first tile; and when it is judged that the tile boundary of the first tile is encountered, storing a currently used read pointer into a pointer buffer, and loading a selected read pointer from the pointer buffer to act as the currently used read pointer.

Texture compression and decompression

A compressing of a texel block ( 10 ) consisting of two texel sub-blocks ( 12, 14 ) involves determining respective value codewords ( 31, 32 ) and table codewords ( 33, 34 ) for the two texel sub-blocks ( 12, 14 ). The value codewords ( 31, 32 ) represent respective base texel values and the table codewords ( 33, 34 ) represent respective modifier sets comprising multiple value modifiers for modifying the base texel value associated with the given texel sub-block ( 12, 14 ). Each texel ( 20 ) in the texel block ( 10 ) is assigned a texel index associated with one of the value modifiers of the modifier set for the texel sub-block ( 12, 14 ) to which the texel ( 20 ) belongs or indicates that the base texel value of the other texel sub-block ( 12, 14 ) is to be used for the texel ( 20 ).

Display driver and method of operating image data processing device

A display driver is provided. The display driver includes a compressor outputting first data by compressing input data, a first selection circuit transmitting the input data or the first data to a memory in response to a first selection signal, a de-compressor outputting third data by de-compressing second data output from the memory, and a display interface for transmitting fourth data generated by processing the third data to a display.

Memory Controller for Video Analytics and Encoding

Video analytics may be used to assist video encoding by selectively encoding only portions of a frame and using, instead, previously encoded portions. Previously encoded portions may be used when succeeding frames have a level of motion less than a threshold. In such case, all or part of succeeding frames may not be encoded, increasing bandwidth and speed in some embodiments.

Method and Apparatus of Video Encoding with Partitioned Bitstream

A method and apparatus for video encoding to generate a partitioned bitstream without buffering transform coefficient and/or prediction data for subsequent coding units are disclosed. An encoder incorporating an embodiment according to the present invention receives first video parameters associated with a current coding unit, wherein no first video parameters associated with subsequent coding units are buffered. The encoder then encodes the first video parameters to generate a current first compressed data corresponding to the current coding unit. A first memory address in the first logic unit is determined and the encoder provides the current first compressed data at the first memory address in the first logic unit.

Activation of parameter sets for multiview video coding (mvc) compatible three-dimensional video coding (3dvc)

In general, techniques are described for separately coding depth and texture components of video data. A video coding device for coding video data that includes a view component comprised of a depth component and a texture component may perform the techniques. The video coding device may comprise, as one example, a processor configured to activate a parameter set as a texture parameter set for the texture component of the view component, and code the texture component of the view component based on the activated texture parameter set.

Image processing apparatus and method thereof

An image processing apparatus and a method thereof are provided. The image processing apparatus includes a memory device and a first and a second image data transformation unit. A first image data is written into and read from the memory device. Each pixel value has a first data format. The first data format is compatible with a dedicated format accessible by the memory device. The first image data transformation unit transforms a second image data into the first image data. The second image data includes a plurality of pixel values each having a second data format. The second data format is not compatible with the dedicated format. The second image data transformation unit transforms the first image data into a third image data. The third image data includes a plurality of pixel values each having a third data format. The third data format is not compatible with the dedicated format.

Coefficient level coding

In one example, a device includes a video coder configured to code a first set of syntax elements for the coefficients of a residual block of video data, and code, using at least a portion of the first set of syntax elements as context data, a second set of syntax elements for the coefficients, wherein the first set of syntax elements each correspond to a first type of syntax element for the coefficients, and wherein the second set of syntax elements each correspond to a second, different type of syntax element for the coefficients. For example, the first set of syntax elements may comprise values indicating whether the coefficients are significant (that is, have non-zero level values), and the second set of syntax elements may comprise values indicating whether level values for the coefficients have absolute values greater than one.

Game Execution Environments

Systems and methods for executing multiple video games, or other sources of video, include a game execution environment in which each game application is executed on the same operating system but within a virtual I/O shell. The virtual I/O shell includes virtual video, audio and input channels that allow each game application to operate as if it had dedicated drivers. In some embodiments, the systems and methods of the invention are used to provide video streams to a plurality of clients over the internet.

Method and arrangement for recording a media stream,

The present invention relates to the field of digital media recording such as video or audio, where compression is used to reduce the amount of data to save onto a data storage. In particular the invention relates to recording media, wherein the memory area required to store the media is unknown. The invention discloses a method for recording digital streamed media with a number of media frames in a memory by encoding each media frame into an encoded frame comprising a first number of quality layers, such as the quality layers in JPEG2000. The invention further relates to detecting if the data storage is full and if the data storage is full, storing new frames in the data storage previously occupied by the quality layer representing the highest resolution of the previously stored encoded frames. The invention also relates to a corresponding media recorder and computer program.

System and Method for Adaptive Frame Re-compression in Video Processing System

Method and system of video decoding incorporating frame compression to reduce frame buffer size are disclosed. The method adjusts parameters of the frame compression according to decoder system information or syntax element in the video bitstream. The decoder system information may be selected from a group consisting of system status, system parameter and a combination of system status and system parameter. The decoder system information may include system bandwidth, frame buffer size, frame buffer status, system power consumption, and system processing load. The syntax element comprises reference frame indicator, initial picture QP (quantization parameter), picture type, and picture size. The adaptive frame compression may be applied to adjust compression ratio. Furthermore, the adaptive frame compression may be applied to a decoder for a scalable video coding system or a multi-layer video coding system.

Method and system for decoding encoded images and reducing the size of said images

A method and system for reducing the number of mathematical operations required in the JPEG decoding process without substantially impacting the quality of the image displayed is disclosed. Embodiments provide an efficient JPEG decoding process for the purposes of displaying an image on a display smaller than the source image, for example, the screen of a handheld device. According to one aspect of the invention, this is accomplished by reducing the amount of processing required for dequantization and inverse DCT (IDCT) by effectively reducing the size of the image in the quantized, DCT domain prior to dequantization and IDCT. This can be done, for example, by discarding unnecessary DCT index rows and columns prior to dequantization and IDCT. In one embodiment, columns from the right, and rows from the bottom are discarded such that only the top left portion of the block of quantized, and DCT coefficients are processed.

Chroma Information Signaling for Video Streams

Embodiments of systems and methods for signaling chroma information for a picture in a compressed video stream are provided. One system embodiment, among others, comprises a memory with logic, and a processor configured with the logic to provide a compressed video stream that includes a picture having chroma samples and luma samples, and provide in the compressed video stream a flag for signaling information corresponding to the location of the chroma samples in relation to the luma samples in the picture, wherein a first defined flag value indicates default locations of the chroma samples in relation to the luma samples in the picture, wherein a second defined flag value indicates a presence in the compressed video stream of auxiliary chroma information corresponding to relative locations of the chroma samples to the luma samples in the picture, and wherein the number of chroma samples in the picture implied by the first defined flag value is equal to the number of chroma samples in the picture implied by the second defined flag value. Other embodiments for signaling chroma information for a picture in a compressed video stream are included herein.

Image coding method, image decoding method, image coding apparatus, and image decoding apparatus

An image coding method, comprising: subtracting a prediction signal from the input image signal for each coding unit, thereby generating respective prediction error signals; performing orthogonal transform and quantization on a corresponding one of the prediction error signals for each transform unit, eventually generating quantization coefficients; and coding pieces of management information indicating a structure of the transform units and the quantization coefficients into a tree structure. Each of the transform units corresponds to a corresponding one of leaf nodes in the tree structure. In the coding, for each leaf node, management information and a quantization coefficient are coded, eventually generating a coded signal in which the coded management information and the coded quantization coefficient are arranged in succession for each leaf node.

Centralised interactive graphical application server

This invention relates to a method of processing a plurality of graphical programs on a centralized computer system whereby the images produced by the programs are compressed and transmitted to remote processing devices where they are decompressed. Compression assistance data (CAD) is produced by inspecting instructions outputted by the programs and the CAD is then used in the compression step.

Method and apparatus for encoding/decoding images using a motion vector

The present invention relates to a method and apparatus for encoding/decoding image using a motion vector.According to one embodiment of the present invention, an image-decoding method is provided. The image-decoding method comprises the following steps: clipping a motion vector of a reference picture with a predetermined dynamic range so as to generate a clipped motion vector; storing the clipped motion vector in a buffer; deriving a motion vector of a block to be decoded using the motion vector stored in the buffer; and performing inter-prediction decoding using the motion vector of the block to be decoded. According to the present invention, the size of a memory space required to store a motion vector may be reduced.

Motion sensor assisted rate control for video encoding

The system and methods for motion sensor assisted rate control for video encoding are described herein. An apparatus for encoding video content comprises a sensor and an encoder. The sensor is configured to provide motion information relating to the apparatus. The encoder is configured to encode the video content based at least in part on a quantization parameter. The encoder is further configured to increase the value of the quantization parameter in response to the provided motion information.

Encoding and reconstruction of residual data based on support information

Decoder processor hardware reproduces a support plane including a set of support values. The set of support values is derived from combining a sequence of multiple original sets of values. The decoder processor hardware receives compensation information. The decoder processor hardware utilizes the compensation information to produce preliminary renditions of the multiple original sets of values based on the set of support values. Encoder processor hardware processes a sequence of original sets of values. The encoder processor hardware utilizes the values of the original sets in the sequence to produce a set of support values, the set of support values representing a baseline to reproduce a rendition of each of the original sets of values. The encoder processor hardware generates reconstruction data to include data corresponding to the set of support values, the reconstruction data indicates how to reconstruct the original sets of values using the set of support values.

Memory Look Ahead Engine for Video Analytics

Video analytics may be used to assist video encoding by selectively encoding only portions of a frame and using, instead, previously encoded portions. Previously encoded portions may be used when succeeding frames have a level of motion less than a threshold. In such case, all or part of succeeding frames may not be encoded, increasing bandwidth and speed in some embodiments.

Apparatus, a method and a computer program for video coding and decoding

There is disclosed a method, apparatus and computer program product in which a view synthesis prediction utilizes a depth map, disparity information or other ranging information of a co-located reference frame in another view. A first uncompressed texture block of a first texture picture representing a first view and ranging information associated with the first uncompressed texture block are obtained. Disparity information with reference to a second view is derived on the basis of the ranging information. Reference samples of the second view are obtained on the basis of the disparity information. A view synthesis prediction is performed by using the reference samples to obtain a reference block for encoding the first uncompressed texture block.

Streaming adaption based on clean random access (cra) pictures

Systems, methods, and devices for processing video data are disclosed. Some examples systems, methods, and devices receive an external indication at a video decoder. The example systems, methods, and devices treat a clean random access (CRA) picture as a broken link access (BLA) picture based on the external indication.

Video image encoding device and video image encoding method

A video image encoding device, in a first mode, variable-length-encodes a residual coefficient to generate a coefficient code string, outputs the coefficient code string and the header information in a state in which the header information is associated with the coefficient code string, in a second mode, directly uses a differential image as a coefficient code string without variable-length-encoding the differential image, and outputs the coefficient code string and the header information in a state in which the header information is associated with the coefficient code string.

Image processing apparatus and associated method

An image processing apparatus including a processor and a memory is provided. The processor generates a target frame according to a reference frame stored in a storage region. The target frame has a first image data amount, and the reference frame has a second image data amount. The memory includes the storage region for storing the reference image and the target image. The processor has the target frame selectively overwrite a part of the reference frame. The capacity of the storage region is smaller than a sum of the first image data amount and the second image data amount, and is greater than the second image data amount.

Support for Variable Number of Picture Buffers in Decoded Picture Buffer

In one method embodiment a method of processing of a bitstream is disclosed. The method may include receiving at a processing device a bitstream comprising a first portion of compressed pictures having a first picture resolution format and a second portion having a second picture resolution format during transmission over a given channel, wherein the first compressed picture of the second portion of compressed pictures is the first compressed picture in the video stream after the last compressed picture of the first portion of compressed pictures; determining by the processing device a first number of picture buffers in a decodable picture buffer (DPB) for decoding the first portion of the compressed pictures; allocating a linear memory corresponding to the first number of picture buffers for decoding of the first portion of the bitstream; determining a second number of picture decode buffers in the DPB for decoding the second portion of the compressed pictures, wherein the second number of picture decode buffers are determined based on a ratio of picture size of pictures from the first portion and the second portion; and reusing the linear buffer for decoding the second portion without deallocating and reallocating the linear memory.

Method and Apparatus for Inverse Scan of Transform Coefficients in HEVC

A method and apparatus for decoding two-level scanned transform coefficients corresponding to a transform unit (TU) are disclosed. The TU is divided into sub-blocks and the transform coefficients of the TU are scanned across the sub-blocks according to a first scan pattern, and each sub-block is scanned according to a second scan pattern. In one embodiment, the sub-blocks of the transform coefficients received from the variable length decoding are stored in an inverse scan buffer (or TC buffer) and the transform coefficients are retrieved from the inverse scan buffer row-by-row or column-by-column in a selected direction after a corresponding row or column of the transform coefficients is fully received. In a system incorporating an embodiment of the present invention, at least a leading row or a leading column of the transform coefficients is available in the selected direction before a last sub-block of the transform coefficients arrives.

Image processing device and method

The present technique relates to image processing devices and methods that realize reductions of memory usage in orthogonal transform operations and inverse orthogonal transform operations. This disclosure includes: a horizontal one-dimensional inverse transform unit that performs a horizontal inverse orthogonal transform on an orthogonal transform coefficient generated by performing an orthogonal transform on image data in a horizontal direction and a vertical direction; a bit width processing unit that performs a clip operation on a coefficient to reduce a bit width, the coefficient being obtained by the horizontal one-dimensional inverse transform unit performing the horizontal inverse orthogonal transform; a storage unit that stores the coefficient as intermediate data, the coefficient having the bit width reduced by the bit width processing unit performing the clip operation; and a vertical one-dimensional inverse transform unit that reads the intermediate data from the storage unit one line at a time in the vertical direction, and performs a vertical inverse orthogonal transform. This disclosure can be applied to image processing devices.

Pixel buffering

In an example method and system, image data to an image processing module. Image data is read from memory into a down-scaler, which down-scales the image data to a first resolution, which is stored in a first buffer. A region of image data which the image processing module will request is predicted, and image data corresponding to at least part of the predicted region of image data is stored in a first buffer, in a second resolution, higher than the first. When a request for image data is received, it is then determined whether image data corresponding to the requested image data is in the second buffer, and if so, then image data is provided to the image processing module from the second buffer. If not, then image data from the first buffer is up-scaled, and the up-scaled image data is provided to the image processing module.

Motion vector calculation method

When a block (MB 22 ) of which motion vector is referred to in the direct mode contains a plurality of motion vectors, 2 motion vectors MV 23 and MV 24 , which are used for inter picture prediction of a current picture (P 23 ) to be coded, are determined by scaling a value obtained from averaging the plurality of motion vectors or selecting one of the plurality of the motion vectors.

Moving picture coding method, moving picture coding apparatus, moving picture decoding method, and moving picture decoding apparatus

Obtaining one or more motion vector predictor candidates includes: (a1) generating a motion vector predictor candidate, based on motion vectors of first adjacent blocks adjacent to a block to be processed in a first direction; and (a2) generating a motion vector predictor candidate, based on motion vectors of second adjacent blocks adjacent to the block to be processed in a second direction, and step (a2) (S 500 ) includes: (S 520 ) determining whether the first adjacent blocks include an inter-predicted block; and (S 530 ) searching for a motion vector on which scaling processing can be performed from among the motion vectors of the second adjacent blocks when it is determined that the first adjacent blocks do not include an inter-predicted block, and executing, when the motion vector on which scaling processing can be performed is obtained in the search, scaling processing on the motion vector obtained in the search.

Method and device for encoding and decoding an image

A method for encoding an image. The method comprises: dividing the image into a plurality of variable sized blocks, encoding each sub-block using variable bit rate encoding, storing the encoded sub-blocks, generating a marker matrix, and storing the marker matrix for use in decoding the image.

Indication and activation of parameter sets for video coding

In some examples, a video encoder includes multiple sequence parameter set (SPS) IDs in an SEI message, such that multiple active SPSs can be indicated to a video decoder. In some examples, a video decoder activates a video parameter set (VPS) and/or one or more SPSs through referencing an SEI message, e.g., based on the inclusion of the VPS ID and one or more SPS IDs in the SEI message. The SEI message may be, as examples, an active parameter sets SEI message or a buffering period SEI message.

Expanded decoding unit definition

A video coding device, such as a video encoder or a video decoder, may be configured to decode a duration between coded picture buffer (CPB) removal time of a first decoding unit (DU) in an access unit (AU) and CPB removal time of a second DU, wherein the first DU comprises a non-video coding layer (VCL) network abstraction layer (NAL) unit with nal_unit_type equal to UNSPEC0, EOS_NUT, EOB_NUT, in the range of RSV_NVCL44 to RSV_NVCL47 or in the range of UNSPEC48 to UNSPEC63. The video decoder determines a removal time of the first DU based at least in part on the decoded duration and decodes video data of the first DU based at least in part on the removal time.

Image coding method, image decoding method, image coding apparatus, image decoding apparatus, and image coding and decoding apparatus

A dependency indication is signaled within the beginning of a packet, that is, within the adjacent of a slice header to be parsed or a parameter set. This is achieved, for example, by including the dependency indication at the beginning of the slice header, preferably after a syntax element identifying the parameter set and before the slice address, by including the dependency indication before the slice address, by providing the dependency indication to a NALU header using a separate message, or by using a special NALU type for NALUs carrying dependent slices.

Neighbor determination in video decoding

Video decoding innovations for multithreading implementations and graphics processor unit (“GPU”) implementations are described. For example, for multithreaded decoding, a decoder uses innovations in the areas of layered data structures, picture extent discovery, a picture command queue, and/or task scheduling for multithreading. Or, for a GPU implementation, a decoder uses innovations in the areas of inverse transforms, inverse quantization, fractional interpolation, intra prediction using waves, loop filtering using waves, memory usage and/or performance-adaptive loop filtering. Innovations are also described in the areas of error handling and recovery, determination of neighbor availability for operations such as context modeling and intra prediction, CABAC decoding, computation of collocated information for direct mode macroblocks in B slices, reduction of memory consumption, implementation of trick play modes, and picture dropping for quality adjustment.

HARDWARE-ADAPTABLE WATERMARK SYSTEMS

There are many advantages to implementing a watermark-based system using dedicated hardware, rather than using software executing on a general purpose processor. These include higher speed and lower power consumption. However, hardware implementations incur substantial design and development costs. Moreover, because each watermarking application has its own design constraints and parameters, it has not been cost-effective to develop a hardware chip design for each, since such chips would typically not be manufactured in volumes sufficient to bring per-unit costs down to an acceptable level. The present technology provides various techniques for making watermarking hardware adaptable, so that a single chip can serve multiple diverse watermark applications. By so-doing, the advantages of hardware implementation are made available where it was formerly cost-prohibitive, thereby enhancing operation of a great variety of watermark-based systems. 1. A watermark decoder comprising:a synchronization portion; anda decoding portion;at least one of said portions being implemented using hardware circuitry that was designed and fabricated to form part of a watermark decoder, rather than serve as a general purpose processor, said at least one portion including first means for re-parameterizing one or more facets of its operation to permit customization of said portion, either at a time when the decoder is built, or after it has been placed into service.2. The watermark decoder of in which said first means comprises an ASIP processor claim 1 , a cross-bar interconnect claim 1 , and a memory claim 1 , the memory being controlled to issue a timed sequence of on/off instructions to plural cross-bar junctions in said cross-bar interconnect.3. The watermark decoder of that further includes a series of pipelined modules claim 1 , wherein first means includes data packet intercept control logic that selectively intercepts data output from one pipelined module in said series claim 1 , and ...

Shared local memory tiling mechanism

An apparatus to facilitate memory tiling is disclosed. The apparatus includes a memory, one or more execution units (EUs) to execute a plurality of processing threads via access to the memory and tiling logic to apply a tiling pattern to memory addresses for data stored in the memory.

UV MAPPING AND COMPRESSION

A machine can be specially configured to generate one or more atlases that include two-dimensional texture maps and their corresponding UV maps from a three-dimensional object, compress the atlases, decompress the atlases, store the atlases, access the atlases, communicate the atlases, apply the texture maps from the atlases to a three-dimensional model, or otherwise process the atlases, the texture maps, the UV maps, or any suitable combination thereof. The atlases, texture maps, UV maps, or any suitable combination thereof can be generated, compiled or otherwise created by the machine in a manner that is computationally efficient to compress and decompress using video compression and decompression techniques. 1. A method comprising:accessing, by one or more processors of a machine, a two-dimensional (2D) image that specifies color information of a three-dimensional (3D) surface and includes grouped 2D blocks each of whose color information is defined by a corresponding orthogonal projection of a corresponding 3D block that intersects a corresponding portion of the 3D surface within a 3D volume that encompasses the 3D surface;by one or more processors of the machine, for each 2D block among the grouped 2D blocks included in the 2D image, determining a corresponding 2D face of the 3D volume that encompasses the 3D surface based on a corresponding dominant direction of the corresponding 3D block that intersects the corresponding portion of the 3D surface; andby one or more processors of the machine, for each 2D block among the grouped 2D blocks included in the 2D image, mapping its corresponding color information to a corresponding portion of a 3D model of the 3D surface based on the corresponding 2D face of the 3D volume.2. The method of claim I , wherein:for at least one 2D block among the grouped 2D blocks included in the 2D image, the determining of the corresponding 2D face of the 3D volume includes determining the corresponding dominant direction of the ...

SCALABLE AND AREA EFFICIENT CONVERSION OF LINEAR IMAGE DATA INTO MULTI-DIMENSIONAL IMAGE DATA FOR MULTIMEDIA APPLICATIONS

Certain aspects of the present disclosure provide techniques for scalably and efficiently converting linear image data into multi-dimensional image data for multimedia applications. In one example, a method for managing image data includes receiving a line of image data in a linear format via a system bus of width T, wherein the image data's native format is a tile format of H lines per tile; forming H subsets of image data from the line of image data in the linear format; writing the H subsets of image data to a memory comprising B=H banks of B=T/Bpixel width, wherein each subset of the H subsets is written to a different bank of the Bbanks; and outputting the H subsets of image data in the tile format. 1. A method for managing image data , comprising:receiving a line of image data in a linear format via a system bus of width T, wherein the image data's native format is a tile format of H lines per tile;forming H subsets of image data from the line of image data in the linear format;{'sub': N', 'W', 'N', 'N, 'writing the H subsets of image data to a memory comprising B=H banks of B=T/Bpixel width, wherein each subset of the H subsets of image data is written to a different bank of the Bbanks; and'}outputting the H subsets of image data in the tile format.2. The method of claim 1 , wherein the image data is from one of:a still image; ora moving image frame of a video.3. The method of claim 1 , wherein writing the H subsets of image data further comprises: writing each subset of the H subsets of image data into different banks and lines in the memory.4. The method of claim 3 , wherein each subset of the H subsets of image data comprises image data in a single line of an image.5. The method of claim 1 , wherein outputting the H subsets of image data in the tile format further comprises:{'sub': 'N', 'reading H subsets of image data from Bbanks of a single line in the memory; and'}{'sub': 'N', 'rearranging the H subsets of image data from the Bbanks of a single line in ...

VIDEO CAMERA

Embodiments provide a video camera that can be configured to highly compress video data in a visually lossless manner. The camera can be configured to transform blue, red, and/or green image data in a manner that enhances the compressibility of the data. The camera can be configured to transform at least a portion of the green image data in a manner that enhances the compressibility of the data. The data can then be compressed and stored in this form. This allows a user to reconstruct the red, blue, and/or green image data to obtain the original raw data or a modified version of the original raw data that is visually lossless when demosacied. Additionally, the data can be processed in a manner in which at least some of the green image elements are demosaiced first and then the red, blue, and/or some green elements are reconstructed based on values of the demosaiced green image elements. 1. (canceled)2. A portable electronic device capable of capturing digital images , the portable electronic device comprising:at least one memory device;one or more image sensors configured to convert light incident on the one or more image sensors into mosaiced color image data, the mosaiced color image data mosaiced according to a pattern and comprising a plurality of picture element values for each of a plurality of spatially interleaved color channels, the spatially interleaved color channels comprising a first green color channel, a second green color channel, a red color channel, and a blue color channel; and for each respective picture element of a plurality of picture elements of the second green color channel, modify an initial value corresponding to the respective picture element using a calculated value derived from values of a plurality of picture elements of the first green color channel that are in spatial proximity to the respective picture element, to generate transformed second green color channel data;', 'compress the transformed second green color channel data, data ...

METHOD AND SYSTEM OF ADAPTIVE REFERENCE FRAME CACHING FOR VIDEO CODING

Techniques related to adaptive reference frame caching for video coding are described herein. 1. A computer-implemented method of adaptive reference frame caching for video coding comprising:receiving image data comprising frames and motion vector data;using the motion vector data to determine which frames are reference frames for an individual frame being reconstructed;modifying a binning count of the frequency individual frames are used as reference frames; andplacing reference frame(s) in cache memory depending, at least in part, on the binning count.2. The method of wherein modifying the binning count comprises modifying a count in bins on at least one reference frame binning table where each bin comprises a count of the number of times a frame in a video sequence formed by the frames is used as a reference frame for another frame in the video sequence.3. The method of wherein the binning table(s) comprises bins for a number of frames before the individual frame being reconstructed claim 2 , after the individual frame being reconstructed claim 2 , or both.4. The method of wherein modifying the binning count comprises using one binning table of 32 fields ortwo binning tables comprising a first binning table of 16 bins associated with 16 frames before the individual frame in the video sequence, and a second binning table of 16 bins associated with 16 frames after the individual frame in the video sequence.5. The method of comprising obtaining the motion vectors before pixel coding of a current frame occurs to provide a binning count and reference frames in cache to be used to reconstruct the current frame.6. The method of comprising obtaining the motion vectors after pixel coding of the individual frame to provide a binning count and reference frames in cache to be used to reconstruct a next frame.7. The method of comprising identifying a number of the most frequently used frames and of the binning count as references frames to place the identified reference ...

IMAGE PROVIDING SERVICE

The described technology is directed towards an image providing service, including an image processing service that composites a base image into a resultant image, e.g., by resizing an image, overlaying text and so forth based upon a purpose for that image and/or a client device class; other parameters such as design information, protection and so forth also may be specified. When a client requests an image including by specifying a purpose and size in a request to an endpoint (e.g., URL) for an image, the image processing service locates or composites a resultant image corresponding to the request, and returns the resultant image or a modified (e.g., resized) resultant image in response to the request. Clients thus obtain images based upon a desired purpose without having to do client-side image processing including image compositing. 1. A method comprising , processing a base image into a resultant image , including composting the base image based upon purpose information into the resultant image , and associating an endpoint reference with the resultant image , including encoding an image identifier and into the endpoint reference to provide for querying for the resultant image with a purpose query parameter via the endpoint reference.2. The method of further comprising receiving a request for the resultant image from a content delivery network.3. The method of further comprising caching the resultant image at a cache of a content delivery network.4. The method of further comprising receiving a request for an image based upon the resultant image claim 1 , in which the request specifies a size.5. The method of further comprising receiving a request for an image based upon the resultant image claim 1 , in which the request specifies a version identifier as a query parameter.6. The method of wherein composting the base image further comprises overlaying text relative to the base image to composite the resultant image.7. The method of wherein overlaying the text ...

Encoder, decoder, encoding method, and decoding method

An encoder includes memory, and circuitry accessible to the memory. The circuitry accessible to the memory: determines whether OBMC is applicable to generation of a prediction image of a current block, according to whether BIO is to be applied to the generation of the prediction image of the current block; when BIO is to be applied to the generation of the prediction image of the current block, determines that OBMC is not applicable to the generation of the prediction image of the current block, and applies BIO to the generation of the prediction image of the current block without applying OBMC.

DYNAMIC BANDWIDTH VOTING

In some aspects, the present disclosure provides a method for bandgap voting. In some configurations, the method includes receiving, at a hardware voting component associated with a destination subsystem, metadata for each of a plurality of compressed display tiles, wherein for each of the plurality of compressed display tiles the metadata indicates an amount of compression of the compressed display tile. In some configurations, the method includes dividing the plurality of compressed display tiles into a plurality of sets of compressed display tiles. In some configurations, for each of the plurality of sets of compressed display tiles, the method includes determining a desired bandwidth for communicating the set of compressed display tiles over a bus, and receiving the set of compressed display tiles at the destination subsystem over the bus at an actual bandwidth that is based on the desired bandwidth. 1. A method for bandwidth voting , comprising:receiving, at a hardware voting component associated with a destination subsystem, metadata for each of a plurality of compressed display tiles, wherein for each of the plurality of compressed display tiles the metadata indicates an amount of compression of the compressed display tile;dividing the plurality of compressed display tiles into a plurality of sets of compressed display tiles; and determining a desired bandwidth for communicating the set of compressed display tiles over a bus based on the metadata corresponding to the set of compressed display tiles; and', 'receiving the set of compressed display tiles at the destination subsystem over the bus at an actual bandwidth that is based on the desired bandwidth., 'for each of the plurality of sets of compressed display tiles2. The method of claim 1 , further comprising claim 1 , for each of the plurality of sets of compressed display tiles:transmitting a request for the desired bandwidth to a controller; anddetermining, by the controller, the actual bandwidth based ...

Guaranteed Data Compression

A method of converting 10-bit pixel data (e.g. 10:10:10:2 data) into 8-bit pixel data involves converting the 10-bit values to 8-bits using a technique that is selected dependent upon the values of the MSBs of the 10-bit values and setting the value of an HDR flag dependent upon the values of the MSBs. The HDR flag is appended to the 3-bit channel. 1. A method of converting 10-bit pixel data into 8-bit pixel data , the method comprising:determining whether an MSB of any of red, green or blue channel values is equal to one;in response to determining that at least one MSB is equal to one, setting a flag to a first value and converting each of the red, green and blue channel values from 10-bits to 8-bits;in response to determining that no MSB is equal to one, setting the flag to a second value and truncating each of the red, green and blue channel values by removing the MSB and LSB from each value; andappending the flag to an alpha channel value.2. The method of claim 1 , wherein the 10-bit pixel data comprises RGBX10:10:10:2 format pixel data.3. The method of claim 1 , wherein the 8-bit pixel data comprises RGBX8883 format pixel data.4. The method of claim 1 , wherein converting a red claim 1 , green or blue channel value from 10-bits to 8-bits claim 1 , comprises truncating the value.5. The method of claim 2 , wherein converting a red claim 2 , green or blue channel value from 10-bits to 8-bits further comprises: determining an adjustment value and adding the adjustment value to the truncated data value.6. A method of compressing 10-bit pixel data comprising:{'claim-ref': {'@idref': 'CLM-00001', 'claim 1'}, 'converting the 10-bit pixel data into 8-bit pixel data according to ; and'}compressing the RGBX data using a lossy compression technique.7. The method of claim 6 , wherein compressing the RGBX data using a lossy compression technique comprises:dividing a block of pixels into a plurality of sub-blocks; and analysing an alpha channel value for each pixel in the sub ...

Guaranteed Data Compression

Lossy methods and hardware for compressing data and the corresponding decompression methods and hardware are described. The lossy compression method comprises dividing a block of pixels into a number of sub-blocks and then analysing, for each sub-block, and selecting one of a candidate set of lossy compression modes. The analysis may, for example, be based on the alpha values for the pixels in the sub-block. In various examples, the candidate set of lossy compression modes comprises at least one mode that uses a fixed alpha channel value for all pixels in the sub-block and one or more modes that encode a variable alpha channel value. 1. A lossy method of compressing data comprising:dividing a block of pixels into a plurality of sub-blocks; and analysing an alpha channel value for each pixel in the sub-block to select a lossy compression mode from a set of candidate lossy compression modes, wherein the set of candidate lossy compression modes comprises two or more lossy compression modes including at least one compression mode which uses a fixed alpha channel value for all pixels in the sub-block; and', 'compressing the sub-block using the selected lossy compression mode., 'for each sub-block2. The method according to claim 1 , wherein analysing an alpha channel value for each pixel in the sub-block to select a lossy compression mode from a set of candidate lossy compression modes comprises:determining a minimum alpha channel value and a maximum alpha channel value from the alpha channel values for all the pixels in the sub-block;in response to determining that a difference between the maximum alpha channel value and the minimum alpha channel value is larger than a difference value, selecting a compression mode which uses a variable alpha channel value for the pixels in the sub-block; andin response to determining that the difference between the maximum alpha channel value and the minimum alpha channel value is not larger than the difference value, selecting a ...

ENCODING APPARATUSES AND SYSTEMS

Encoding apparatuses are provided. The encoding apparatus includes: a first buffer configured to buffer a quantized coefficient of an image block that is input by a quantization circuit; an information generation circuit configured to detect the quantized coefficient of the image block sequentially to obtain run-length encoding information; a second buffer configured to buffer the run-length encoding information generated by the information generation circuit; and a processing circuit configured to: when the second buffer stores run-length encoding information, read the run-length encoding information from the second buffer, read the quantized coefficient corresponding to the run-length encoding information from the first buffer, and output the run-length encoding information and the corresponding quantized coefficient to an entropy encoding circuit. 1. An encoding apparatus , comprising:a first buffer, configured to buffer a quantized coefficient of an image block that is input by a quantization circuit;an information generation circuit, configured to detect the quantized coefficient of the image block sequentially to obtain run-length encoding information, wherein the run-length encoding information includes at least one of level-run information, zero-run information, or identification information of a direct current (DC) coefficient;a second buffer, configured to buffer the run-length encoding information generated by the information generation circuit; and read the run-length encoding information from the second buffer,', 'read the quantized coefficient corresponding to the run-length encoding information from the first buffer, and', 'output the run-length encoding information and the corresponding quantized coefficient to an entropy encoding circuit., 'a processing circuit, wherein when the second buffer stores run-length encoding information, the processing circuit is configured to2. The encoding apparatus according to claim 1 , wherein the information ...

METHOD AND DEVICE FOR ENCODING AND DECODING IMAGE

An image decoding method according to the present invention includes reconstructing a residual block by inverse-quantizing and inverse-transforming an entropy-decoded residual block, generating a prediction block by performing intra prediction on a current block, and reconstructing an picture by adding the reconstructed residual block to the prediction block, wherein generating the prediction block includes generating a final prediction value of a prediction target pixel included in the current block based on a first prediction value of the prediction target pixel and a final correction value calculated by performing an arithmetic right shift on a two's complementary integer representation for an initial correction value of the prediction target pixel by a binary digit of 1. Accordingly, upon image encoding/decoding, computation complexity may be reduced. 1. A video decoding method comprising:generating a prediction block by performing intra prediction for a current block;reconstructing a residual block by entropy-decoding information on the residual block included in a bitstream; andreconstructing the current block based on the reconstructed residual block and the prediction block, obtaining a first prediction value of a prediction target pixel of the prediction block;', 'determining an initial correction value of the prediction target pixel;', 'calculating a final correction value of the prediction target pixel by performing an arithmetic right shift on the initial correction value by a binary digit of n, n being an integer equal to or greater than 1; and', 'generating a final prediction value of the prediction target pixel based on the first prediction value and the final correction value., 'wherein the generating the prediction block comprising'}2. The video decoding method of claim 1 , wherein a determination of whether to correct the first prediction value is dependent on encoding information on the current block and a position of the prediction target pixel ...

Efficient context handling in arithmetic coding

Coding using efficient context handling in arithmetic coding is disclosed. A method for decoding a current block in a scan order includes identifying a current entropy coded transform coefficient from the current block, and entropy decoding the current entropy coded transform coefficient. Entropy decoding the current entropy coded transform coefficient may include determining, based on the scan order, a first scan order distance between a scan order location corresponding to the current entropy coded transform coefficient and a scan order location corresponding to a first context coefficient, identifying a first context coefficient value from a first location in a context coefficient register, the first location corresponding to the first scan order distance, and entropy decoding the current entropy coded transform coefficient based on the first context coefficient value. The method also includes including the entropy decoded current transform coefficient in an output bitstream.

Image encoding and decoding methods and devices thereof

Image encoding and decoding methods and devices thereof are provided. The encoding method includes: performing downsampling on a first image to obtain a second image; encoding the second image to obtain a second image bit stream, and sending the second image bit stream to a decoding end; processing the second image to obtain a third image having a resolution the same as that of the first image; calculating a difference between the third image and the first image to obtain a first difference image; regulating pixel values of the first difference image to fall within a pre-set range, to obtain a second difference image; and encoding the second difference image to obtain a second difference image bit stream, and sending the second difference image bit stream to the decoding end to enable the decoding end to reconstruct the first image.

Multimedia Redirection Method, Device, and System

A multimedia redirection method comprising receiving, by a server, a hardware decoding capability sent by a client, where the hardware decoding capability is a hardware decoding capability that is in a video hardware acceleration specification and that is converted from a hardware decoding capability of a non-Windows operating system by the client; restoring, by the server, video data to a video code stream of a standard encoding format after receiving the hardware decoding capability; and sending, by the server, the video code stream to the client for decoding and display.

Guaranteed Data Compression

A method of converting 10-bit pixel data (e.g. 10:10:10:2 data) into 8-bit pixel data involves converting the 10-bit values to 7-bits or 8-bits and generating error values for each of the converted values. Two of the 8-bit output channels comprise a combination of a converted 7-bit value and one of the bits from the fourth input channel. A third 8-bit output channel comprises the converted 8-bit value and the fourth 8-bit output channel comprises the error values. In various examples, the bits of the error values may be interleaved when they are packed into the fourth output channel. 1. A method of converting 10:10:10:2 format pixel data into 8888 format data , the method comprising , for each pixel:truncating the three 10-bit input data channels such that a first truncated channel and a third truncated channel each comprises 7 bits and a second truncated channel comprises 8 bits;appending a different bit from the 2-bit input data channel to each of the truncated first and third channels;generating an error value for each of the 10-bit input data channels by comparing, for each of the first and third channels, three LSBs of the input data channel and three bits derived from the truncated channel, and for the second channel, two LSBs of the input data channel and two bits derived from the truncated channel;outputting a first 8-bit channel comprising the truncated first channel with the appended bit from the 2-bit input data channel, a second 8-bit channel comprising the truncated second channel, a third 8-bit channel comprising the truncated third channel with the appended bit from the 2-bit input data channel and a fourth 8-bit channel comprising the three error values.2. The method according to claim 1 , wherein generating an error value for each of the 10-bit input data channels by comparing claim 1 , for each of the first and third channels claim 1 , three LSBs of the input data channel and three bits derived from the truncated channel claim 1 , and for the ...

Low complexity affine merge mode for versatile video coding

In some aspects, the disclosure is directed to methods and systems for reducing memory utilization and increasing efficiency during affine merge mode for versatile video coding by utilizing motion vectors stored in a motion data line buffer for a prediction unit of a second coding tree unit neighboring a first coding tree unit to derive control point motion vectors for the first coding tree unit.

Block sized based transform restrictions

A coding unit having a size multiple of three in horizontal or vertical direction is coded through one of several embodiments. In one embodiment, for some block sizes, the coding unit is coded and decoded systematically through SKIP mode. In another embodiment, the coding units can be coded in SKIP mode or with a DC coefficient. In another embodiment, an asymmetric division of a common coding unit parent is performed and transform coefficients are factorized among at least two sub-blocks to encode a coding unit. In another embodiment, a separable two dimensional transform can be applied by applying a transform over the block in one direction, and using two one-dimensional transforms on sub-blocks in the other direction to code. Methods, apparatus, and signal embodiments are provided for encoding and decoding.

Decoding a picture based on a reference picture set on an electronic device

A method for decoding a picture on an electronic device is described. The method includes obtaining a bitstream. The method also includes obtaining a current picture. The method further includes obtaining a relative reference picture set (RPS) parameter. The method additionally includes initializing an index value. Furthermore, the method includes processing another RPS parameter based on the index value. The method also includes decoding the current picture.

Encoding and decoding selectively retrievable representations of video content

A system and method disposed to enable encoding, decoding and manipulation of digital video with substantially less processing load than would otherwise be required. In particular, one disclosed method is directed to generating a compressed video data structure that is selectively decodable to a plurality of resolutions including the full resolution of the uncompressed stream. The desired number of data components and the content of the data components that make up the compressed video data, which determine the available video resolutions, are variable based upon the processing carried out and the resources available to decode and process the data components. During decoding, efficiency is substantially improved because only the data components necessary to generate a desired resolution are decoded. In variations, both temporal and spatial decoding are utilized to reduce frame rates, and hence, further reduce processor load. The system and method are particularly useful for real-time video editing applications.

METHODS AND APPARATUSES FOR PERFORMING ENCODING AND DECODING ON IMAGE

Provided is a computer-recordable recording medium having stored thereon a video file including artificial intelligence (AI) encoding data, wherein the AI encoding data includes: image data including encoding information of a low resolution image generated by AI down-scaling a high resolution image; and AI data about AI up-scaling of the low resolution image reconstructed according to the image data, wherein the AI data includes: AI target data indicating whether AI up-scaling is to be applied to at least one frame; and AI supplementary data about up-scaling deep neural network (DNN) information used for AI up-scaling of the at least one frame from among a plurality of pieces of pre-set default DNN configuration information, when AI up-scaling is applied to the at least one frame. 1. A server for providing an image by using artificial intelligence (AI) , the server comprising:one or more processors configured to execute one or more instructions stored in the server to:select a down-scaling deep neural network (DNN) setting information among a plurality of down-scaling DNN setting information for AI down-scaling an original image of at least one frame,obtain a down-scaled image of the at least one frame by performing the AI down-scaling of the original image of the at least one frame through a down-scaling DNN which is set with the selected down-scaling DNN setting information, andobtain AI data related to the AI down-scaling and obtain image data by encoding the down-scaled image of the at least one frame,to obtain a video file including the image data and the AI data.2. An electronic device for displaying an image by using an artificial intelligence (AI) , the electronic device comprising:a display; andone or more processors configured to execute one or more instructions stored in the electronic device to:receive a video file including image data and AI data about AI up-scaling of the image data,obtain the AI data and obtain the image data, reconstruct a down- ...

SHARED LOCAL MEMORY TILING MECHANISM

An apparatus to facilitate memory tiling is disclosed. The apparatus includes a memory, one or more execution units (EUs) to execute a plurality of processing threads via access to the memory and tiling logic to apply a tiling pattern to memory addresses for data stored in the memory. 119-. (canceled)20. An apparatus comprising:a shared local memory; andone or more processors including a graphics processing unit (GPU) to process a machine learning algorithm, wherein processing of the machine learning algorithm includes processing of a plurality of thread groups, each thread group including a plurality of processing threads, wherein the one or more processors are to:detect an access pattern and a shared local memory banking architecture for each of the plurality of thread groups;generate shared local memory tiling for each thread group based at least in part on the detected access pattern and the shared local memory banking architecture for the thread group; andapply the generated local memory tiling for each thread group for data stored in the shared local memory.21. The apparatus of claim 20 , wherein the one or more processors are further to:generate memory tiling parameters for each thread group of the plurality of thread groups based at least in part on the detected access pattern and shared local memory banking architecture for the thread group, the shared local memory tiling being based at least in part on the generated memory tiling parameters.22. The apparatus of claim 21 , wherein the memory tiling parameters include one or more of a pitch or element width of shared local memory tiles.23. The apparatus of claim 20 , wherein the one or more processors are further to generate and store a per thread group shared local memory state for each of the plurality of thread groups claim 20 , the shared local memory state for each thread group of the plurality of thread groups being based at least in part on the generated shared local memory tiling.24. The apparatus of ...

Memory Management for Systems for Generating 3-Dimensional Computer Images

A memory management system for generating 3-dimensional computer images is provided. The memory management system includes a device for subdividing an image into a plurality of rectangular areas, a memory for storing object data pertaining to objects in the image which fall in each rectangular area, a device for storing the object data in the memory, a device for deriving image data and shading data for each rectangular area from the object data, a device for supplying object data for each rectangular area from the respective portion of the memory and, if the rectangular area contains objects also falling in at least one other rectangular area, also from the global list, to the deriving device, and a device for storing the image data and shading data derived by the deriving device for display. The memory includes at least one portion allocated to each rectangular area and at least one portion allocated as a global list. 1. A method of rendering in a graphics system having an image plane subdivided into a plurality of tiles , the method comprising:deriving, from object data for a tile, image data and shading data for the tile, the image data comprising depth data;compressing the depth data;storing the image data comprising the compressed depth data and the shading data in a memory;retrieving the image data comprising the compressed depth data stored in the memory and decompressing the compressed depth data;deriving, from additional object data for the tile and the retrieved data, additional image data and shading data for the tile; andproviding at least one of the additional shading data and shading data stored in the memory for display.2. The method according to claim 1 , wherein the depth data relates to a polygon representable by a planar equation claim 1 , the planar equation being defined by a set of parameters claim 1 , and the method further comprises compressing the depth data by storing the set of parameters.3. The method according to claim 1 , wherein the ...

DISPLAY STREAM COMPRESSION PIXEL FORMAT EXTENSIONS USING SUBPIXEL PACKING

Methods and apparatuses for display stream compression pixel format extension using subpixel packing are disclosed. In one aspect, the method involves packing pixel values arranged in an O-channel format for encoding by an M-channel codec. The method may further involve receiving a set of input pixel values, each input pixel value including O input subpixel values arranged in the O-channel format. The method may involve rearranging each of the input subpixel values into a set of output pixel values, each set of output pixel values comprising M output subpixel values arranged in an M-channel format, O having a greater value than M, wherein at least a portion of the rearranged M output subpixels maintain their relative spatial positioning from prior to being rearranged from the O input subpixel values. The method may also involve providing the output pixel values to the M-channel codec. 1. A method of packing pixel values arranged in an O-channel format for encoding by an M-channel codec , comprising:receiving a set of input pixel values, each input pixel value comprising O input subpixel values arranged in the O-channel format;rearranging each of the input subpixel values into a set of output pixel values, each set of output pixel values comprising M output subpixel values arranged in an M-channel format, O having a greater value than M, wherein at least a portion of the rearranged M output subpixels maintain their relative spatial positioning from prior to being rearranged from the O input subpixel values; andproviding the output pixel values to the M-channel codec.2. The method of claim 1 , wherein the M-channel format includes M different color channels and wherein the O-channel format includes the M color channels and at least one additional color channel claim 1 , the method further comprising:arranging each of the input subpixel values of the M color channels in the corresponding M color channels of the output pixel values; andarranging each of the input ...

Video chat data processing

A graphics processing unit and a system are described herein. The graphics processing unit includes a decoder, a post processor, and a renderer. The decoder is to decode a video data stream from an incoming data stream. The post processor is to perform post-processing of the decoded video data stream. The renderer is to render the post processed video data stream and discard a null video data stream from a video chat application during a video chat session.

SIGNALING COLOR VALUES FOR 3D LOOKUP TABLE FOR COLOR GAMUT SCALABILITY IN MULTI-LAYER VIDEO CODING

Techniques are described for signaling information used to generate three-dimensional (3D) color lookup tables for color gamut scalability in multi-layer video coding. A lower layer of video data may include color data in a first color gamut and a higher layer of the video data may include color data in a second color gamut. To generate inter-layer reference pictures, a video encoder and/or video decoder performs color prediction to convert the color data of a reference picture in the first color gamut to the second color gamut. The video coder may perform color prediction using a 3D lookup table. According to the techniques, a video encoder may encode partition information and/or color values of a 3D lookup table generated for color gamut scalability. A video decoder may decode the partition information and/or color values to generate the 3D lookup table in order to perform color gamut scalability. 1. A method of decoding video data , the method comprising:determining a number of octants for each of three color components of a three-dimensional (3D) lookup table for color gamut scalability;for each of the octants for each of the color components, decoding color mapping coefficients for a linear color mapping function of color values in the 3D lookup table used to convert color data in a first color gamut for a lower layer of the video data to a second color gamut for a higher layer of the video data, wherein decoding the color mapping coefficients comprises, for a first one of the octants for each of the color components, decoding at least one coefficient of the color mapping coefficients based on a predicted value of the at least one coefficient of the color mapping coefficients, and wherein decoding the color mapping coefficients further comprises, for each remaining one of the octants for each of the color components, decoding the color mapping coefficients based on predicted values from at least one previously decoded octant;generating the 3D lookup table based ...

Signaling color values for 3d lookup table for color gamut scalability in multi-layer video coding

Techniques are described for signaling information used to generate three-dimensional (3D) color lookup tables for color gamut scalability in multi-layer video coding. A lower layer of video data may include color data in a first color gamut and a higher layer of the video data may include color data in a second color gamut. To generate inter-layer reference pictures, a video encoder and/or video decoder performs color prediction to convert the color data of a reference picture in the first color gamut to the second color gamut. The video coder may perform color prediction using a 3D lookup table. According to the techniques, a video encoder may encode partition information and/or color values of a 3D lookup table generated for color gamut scalability. A video decoder may decode the partition information and/or color values to generate the 3D lookup table in order to perform color gamut scalability.

Fast Switching Hybrid Video Decoder

Techniques are presented herein for switching between a software decoder and a hardware decoder in a hybrid decoder. A video bit stream is received. The video bit stream is analyzed to determine whether or not the video bit stream can be decoded by the hardware decoder. When the video bit stream can be decoded by the hardware decoder, the video bit stream is routed to the hardware decoder and also stored in a first buffer. The video bit stream is decoded by the hardware decoder and when a reference frame is decoded, the reference frame is stored in a second buffer. When the video bit stream cannot be decoded by the hardware decoder, the video bit stream is routed to the software decoder for decoding. When an instantaneous decoder refresh (IDR) frame is decoded by the software decoder, the IDR frame is stored in the first buffer. 1. A method comprising:receiving a video bit stream at a hybrid decoder comprising a software decoder and a hardware decoder, with the video bit stream routed to the software decoder;analyzing the video bit stream to determine whether or not the video bit stream can be decoded by the hardware decoder; routing the video bit stream from the software decoder to the hardware decoder;', 'storing the video bit stream in a first buffer;', 'decoding the video bit stream by the hardware decoder utilizing contents of the first buffer, the first buffer comprising one or more instantaneous decoder refresh (IDR) frames; and', 'when a reference frame is decoded, storing the reference frame in a second buffer., 'responsive to determining that the video bit stream can be decoded by the hardware decoder, switching decoding from the software decoder to the hardware decoder comprising2. The method of claim 1 , further comprising:if while routing the video bit stream to the software decoder it is determined that the video bit stream can be decoded by the hardware decoder, routing the video bit stream to the hardware decoder after an IDR frame is received.3. The ...

Method and apparatus for decoding an enhanced video stream

A method of decoding am enhanced video stream composed of base layer video access units and enhancement layer video access units, each access unit comprising a plurality of syntax structures, includes passing the syntax structures of the base layer access units to a base layer buffer, passing syntax structures of the enhancement layer access units to an enhancement layer buffer, outputting the syntax structures passed to the base layer buffer in a predetermined sequence, outputting the syntax structures passed to the enhancement layer buffer in a predetermined sequence, and recombining the sequences of syntax structures output by the base layer buffer and. the enhancement layer buffer respectively to form a complete enhanced access unit, composed of base layer syntax structures and enhancement layer syntax structures in a predetermined sequence.

Physical adapter, signal processing equipment, methods and computer programs

A physical adapter receives a data stream comprising data usable to derive a rendition of a signal at a first level of quality and reconstruction data produced by processing a rendition of the signal at a second, higher level of quality and indicating how to reconstruct the rendition at the second level of quality using the rendition at the first level of quality. The physical adapter reconstructs the rendition at the second level of quality and outputs the reconstructed rendition and/or data derived from the reconstructed rendition. The physical adapter is connectable to signal processing equipment that outputs the data usable to derive the rendition at the first level of quality. The physical adapter increases the quality of the rendition of the signal relative to the first level of quality and enhances the functionality of the signal processing equipment.

IMAGE DECODING DEVICE

An input control unit collectively sends a plurality of pieces of variable length code data. A primary analysis processing unit processes a first piece of variable length code data, recognizes zero run information, group number information, and overhead bit information relating thereto, and outputs them to a frequency conversion unit. A continuous analysis processing unit processes one or more pieces of variable length code data subsequent to the first piece of variable length code data. In the case of variable length code data targeted for a predetermined process, the continuous analysis processing unit recognizes zero run information, group number information, and overhead bit information relating thereto, and output them to the frequency conversion unit. In the case of not the variable length code data targeted for the predetermined process, the continuous analysis processing unit discards this and subsequent pieces of data. 1. An image decoding device comprising a Huffman decoding unit configured to decode compressed image data , the compressed image data being compressed by a Huffman encoding process , the compressed image data having a structure in which Huffman codes and pieces of variable length code data are connected continuously , each Huffman code encoding zero run information and group number information , the pieces of variable length code data being subsequent to the respective Huffman codes , each of the pieces of variable length code data having an additional bit handled as a unit , whereinthe Huffman decoding unit includea code analysis unit configured to analyze the pieces of variable length code data sequentially received, and sequentially recognize and output pieces of zero run information and group number information relating to the pieces of variable length code data, anda frequency conversion unit configured to sequentially generate pieces of coefficient information based on the pieces of zero run information and group number information ...

IMAGE ENCODING METHOD AND IMAGE DECODING METHOD

A method of dividing an input image signal into pixel blocks, and performing inter-prediction on the divided pixel blocks. This method includes selecting predicted motion information from a motion information buffer storing motion information in an encoded region, and predicting motion information of an encoding target block by using the predicted motion information. The method further includes acquiring representative motion information from a plurality of items of motion information in an encoded region in accordance with first information indicating a method of selecting the predicted motion information, thereby obtaining only the representative motion information. 1. (canceled)2. A method performed at least partially by electronic circuitry , comprising:inputting encoded data comprising at least a target block in a first picture;decoding a merge flag specifying whether at least a motion vector of an inter prediction mode is inferred from a merging block;deriving a first candidate motion vector from at least one neighboring block of the target block in the first picture, when the merge flag specifies that at least the motion vector of the inter prediction mode is inferred from the merging block, wherein the at least one neighboring block of the target block comprises at least one of a block on bottom left side of the target block, a block on left side of the target block, a block on upper right side of the target block, a block on upper side of the target block, and a block on upper left side of the target block;deriving a second candidate motion vector from a collocated block in a second picture different from the first picture, when the merge flag specifies that at least the motion vector of the inter prediction mode is inferred from the merging block, wherein the collocated block is selected according to a center position of the target block or a corner position of the target block, and information specifying whether the collocated block is selected according ...

IMAGE ENCODING METHOD AND IMAGE DECODING METHOD

A method of dividing an input image signal into pixel blocks, and performing inter-prediction on the divided pixel blocks. This method includes selecting predicted motion information from a motion information buffer storing motion information in an encoded region, and predicting motion information of an encoding target block by using the predicted motion information. The method further includes acquiring representative motion information from a plurality of items of motion information in an encoded region in accordance with first information indicating a method of selecting the predicted motion information, thereby obtaining only the representative motion information. 1. (canceled)2: A method performed at least partially by electronic circuitry , comprising:inputting encoded data comprising at least a target block in a first picture;decoding a merge flag specifying whether at least a motion vector of an inter prediction mode is inferred from a merging block;deriving a first candidate motion vector from at least one neighboring block of the target block in the first picture, when the merge flag specifies that at least the motion vector of the inter prediction mode is inferred from the merging block, wherein the at least one neighboring block of the target block comprises at least one of a block on bottom left side of the target block, a block on left side of the target block, a block on upper right side of the target block, a block on upper side of the target block, and a block on upper left side of the target block;deriving a second candidate motion vector from a collocated block in a second picture different from the first picture, when the merge flag specifies that at least the motion vector of the inter prediction mode is inferred from the merging block, wherein the collocated block is selected according to a center position of the target block or a corner position of the target block, and information specifying whether the collocated block is selected according ...

IMAGE ENCODING METHOD AND IMAGE DECODING METHOD

A method of dividing an input image signal into pixel blocks, and performing inter-prediction on the divided pixel blocks. This method includes selecting predicted motion information from a motion information buffer storing motion information in an encoded region, and predicting motion information of an encoding target block by using the predicted motion information. The method further includes acquiring representative motion information from a plurality of items of motion information in an encoded region in accordance with first information indicating a method of selecting the predicted motion information, thereby obtaining only the representative motion information. 1. (canceled)2: A method performed at least partially by electronic circuitry , comprising:inputting encoded data comprising at least a target block in a first picture;decoding a merge flag specifying whether at least a motion vector of an inter prediction mode is inferred from a merging block;deriving a first candidate motion vector from at least one neighboring block of the target block in the first picture, when the merge flag specifies that at least the motion vector of the inter prediction mode is inferred from the merging block;deriving a second candidate motion vector from a collocated block in a second picture different from the first picture, when the merge flag specifies that at least the motion vector of the inter prediction mode is inferred from the merging block, wherein the collocated block is selected according to a center position of the target block or a corner position of the target block, and whether the collocated block is determined according to the center position of the target block or the corner position of the target block is determined based on at least one of both a position and a size of the target block;decoding a merge index specifying the merging block from the at least one neighboring block and the collocated block; andderiving a first motion vector for the target block ...

IMAGE PROCESSING APPARATUS AND METHOD

There is provided an image processing apparatus and a method that can suppress an increase in the memory capacity necessary for an orthogonal transform and an inverse orthogonal transform. A submatrix as part of a transform matrix in a first size is used to derive a transform matrix in a second size that is a size smaller than the first size. The derived transform matrix is used to apply an inverse orthogonal transform to coefficient data in which a predicted residual of an image is orthogonally transformed. In this way, an image is generated. The present disclosure can be applied to, for example, an image processing apparatus, an image decoding apparatus, an image encoding apparatus, or the like. 1An image processing apparatus comprising:a decoding section that decodes a bitstream to generate coefficient data in which a predicted residual of an image is orthogonally transformed;a derivation section that derives, from a submatrix as part of a first transform matrix in a first size, a second transform matrix in a second size that is a size smaller than the first size; andan inverse orthogonal transform section that uses the second transform matrix derived by the derivation section, to apply an inverse orthogonal transform to the coefficient data generated by the decoding section.2The image processing apparatus according to claim 1 , whereinthe derivation section derives, as the submatrix, a matrix obtained by sampling matrix elements of the first transform matrix.3The image processing apparatus according to claim 2 , whereinthe derivation section derives, as the submatrix, an even low-order matrix including matrix elements in a left half of matrix elements of an even matrix including matrix elements of even rows of the first transform matrix.4The image processing apparatus according to claim 2 , whereinthe derivation section derives, as the submatrix, an even high-order matrix including matrix elements in a right half of matrix elements of an even matrix including ...

Method and apparatus for video coding

Aspects of the disclosure provide method and apparatus for video coding. In some examples, an apparatus includes processing circuitry. The processing circuitry decodes a first portion of video data to obtain first decoded data corresponding to at least two pictures of a plurality of pictures. The processing circuitry identifies one or more pictures of the at least two pictures for decoding a second portion of the video data corresponding to a current picture. In a case that the one or more identified pictures includes two or more identified pictures, the processing circuitry selects a collocated reference picture based on one of (i) the POC numbers of the two or more identified pictures and the current picture, and (ii) a selection index provided in the video data. The processing circuitry also decodes the second portion of the video data using the collocated reference picture.

METHOD AND APPARATUS FOR RATE CONTROL FOR CONSTANT-BIT-RATE-FINITE-BUFFER-SIZE VIDEO ENCODER

A method and apparatus for rate control for a constant-bit-rate finite-buffer-size video encoder is described. Rate control is provided by adjusting the size of non-intra frames based on the size of intra frames. A sliding window approach is implemented to avoid excessive adjustment of non-intra frames located near the end of a group of pictures. A measurement of “power” based on a sum of absolute values of pixel values is used. The “power” measurement is used to adjust a global complexity value, which is used to adjust the sizes of frames. The global complexity value responds to scene changes. An embodiment of the invention calculates and uses L1 distances and pixel block complexities to provide rate control. An embodiment of the invention implements a number of bit predictor block. Predictions may be performed at a group-of-pictures level, at a picture level, and at a pixel block level. An embodiment of the invention resets a global complexity parameter when a scene change occurs. 1. Apparatus for rate control for a constant-bit-rate finite-buffer-size video encoder comprising:a preprocessing stage for determining a power value based on pixel values of only a first frame; anda group-of-pictures-level rate control block operatively coupled to the preprocessing stage to receive the power value and to provide a target quantizer step size used to provide rate control for the video encoder;wherein the group-of-pictures-level rate control block causes an adjustment of sizes of non-intra frames based on expected sizes of future intra frames.2. The apparatus of wherein the preprocessing stage updates the power value for each subsequent picture being encoded.3. Apparatus for rate control for a constant-bit-rate finite-buffer-size video encoder comprising:a prediction error image block to determine L1 distances according to sums of absolute differences;a picture-level rate control block operatively coupled to the prediction error image block to receive the L1 distances and ...

RESILIENT IMAGE COMPRESSION AND DECOMPRESSION

An image processing method includes selecting an image in fixed storage of a computer and loading the selected image into memory of the computer. The method further includes representing the loaded image by a processor of the computer in the memory as an initial two-dimensional array of pixel values. Thereafter, the initial two-dimensional array of pixel values may be transformed into a hierarchy of progressively axially decremented two-dimensional arrays of signs and a pair of one-dimensional values for each 2×2 array of signs amongst the decremented two-dimensional arrays of signs. Finally, each of the two-dimensional arrays of signs and each pair of one-dimensional values may be stored in the fixed storage as a compressed form of the selected image. 1. An image processing method comprising:selecting an image in fixed storage of a computer;loading the selected image into memory of the computer;representing the loaded image by a processor of the computer in the memory as an initial two-dimensional array of pixel values;transforming the initial two-dimensional array of pixel values into a hierarchy of progressively axially decremented two-dimensional arrays of signs and a pair of one-dimensional values for each 2×2 array of signs amongst the decremented two-dimensional arrays of signs; and,storing in the fixed storage each of the two-dimensional arrays of signs and each pair of one-dimensional values as a compressed form of the selected image.2. The method of claim 1 , wherein the pixel values include at least one color intensity value.3. The method of claim 2 , wherein each color intensity value is a combination of three eight-bit intensity values of a color space.4. The method of claim 1 , wherein the transformation of the initial two-dimensional array of pixel values into the hierarchy comprises submitting the initial two-dimensional array to a recursive encoding operation that receives as input claim 1 , a grid of specified dimension and that produces as output ...

Application acceleration

A system including an acceleration device including input circuitry configured, for each of a first plurality of video frames to be encoded, to receive an input including at least one raw video frame and at least one reference frame, and to divide each of the first plurality of video frames to be encoded into a second plurality of blocks, and similarity computation circuitry configured, for each one of the first plurality of video frame to be encoded: for each block of the second plurality of blocks, to produce a score of result blocks based on similarity of each block in each frame to be encoded to every block of the reference frame, an AC energy coefficient, and a displacement vector. Related apparatus and methods are also provided. 1. A system comprising: input circuitry configured, for each of a first plurality of video frames to be encoded, to receive an input comprising at least one raw video frame and at least one reference frame, and to divide each of said first plurality of video frames to be encoded into a second plurality of blocks; and', 'for each said block of said second plurality of blocks, to produce: a score of result blocks based on similarity of each said block in each frame to be encoded to every block of the reference frame; an AC energy coefficient; and a displacement vector.', 'similarity computation circuitry configured, for each one of said first plurality of video frame to be encoded], 'an acceleration device comprising2. The system according to and wherein said at least one raw video frame and said at least one reference frame are identical.3. The system according to and wherein the score of result blocks comprises a ranked list.4. The system according to and wherein the result blocks are one of: fixed size; and variable size.5. The system according to and also comprising weighting circuitry configured to weight at least some of the second plurality of blocks.7. The system according to and also comprising upsampling circuitry configured to ...

DEVICE AND METHOD FOR FAST BLOCK-MATCHING MOTION ESTIMATION IN VIDEO ENCODERS

A solution is provided to estimate motion vectors of a video. A multistage motion vector prediction engine is configured to estimate multiple best block-matching motion vectors for each block in each video frame of the video. For each stage of the motion vector estimation for a block of a video frame, the prediction engine selects a test vector form a predictor set of test vectors, computes a rate-distortion optimization (RDO) based metric for the selected test vector, and selects a subset of test vectors as individual best matched motion vectors based on the RDO based metric. The selected individual best matched motion vectors are compared and a total best matched motion vector is selected based on the comparison. The prediction engine selects iteratively applies one or more global matching criteria to the selected best matched motion vector to select a best matched motion vector for the block of pixels. 1receive a video comprising a plurality of video frames, each frame comprising a plurality of blocks; selecting a center position motion vector as a best matched motion vector by iteratively checking a set of test motion vectors based on a first rate-distortion optimization (RDO)-based metric, the set of test motion vectors expected to include highly reliable predictors based on at least one of a priori knowledge of a video including the video frame and a priori knowledge of a plurality of video sequences stored in a database, the set of test motion vectors comprising one or more of a zero-motion vector, a motion vector predictor (MVP), and one or more individual motion vectors from neighboring blocks adjacent to the block, the MVP being a median of a plurality of motion vectors for a plurality of neighboring blocks adjacent to the block; and', [ determining whether a candidate total best matched motion vector for the iteration meets one or more first adaptive threshold criteria based on a second RDO-based metric; and', 'responsive to the candidate total best ...

IMAGE PROCESSING APPARATUS AND IMAGE PROCESSING METHOD

To display images by suitably superimposing a graphics image on a high-dynamic-range image in an easily visible manner. 1. An image processing apparatus comprising:a metadata acquiring unit that acquires metadata of image data; anda processor that processes a graphics image to be superimposed on the image data based on the metadata; anda combiner that combines the graphics image processed by the processor with the image data,whereinthe metadata acquiring unit acquires a Diffuse White luminance indicating a luminance value of white serving as a reference of the image data as the metadata, andthe processor adjusts a luminance of the graphics image based on the Diffuse White luminance.2. The image processing apparatus according to claim 1 , further comprising:a dynamic range converter that adjusts a dynamic range of luminance of the image data combined with the graphics image so as to match a display that displays the image data.3. The image processing apparatus according to claim 1 , whereinthe processor compares the Diffuse White luminance with a reference luminance of a display that displays the image data and adjusts the luminance of the graphics image based on the larger luminance information.4. The image processing apparatus according to claim 3 , whereinthe processor adjusts the luminance of the graphics image based on the reference luminance of the display when the metadata acquiring unit is unable to acquire the Diffuse White luminance of the image data.5. The image processing apparatus according to claim 1 , whereinthe processor compares the Diffuse White luminance with a reference luminance of a dynamic range of a predetermined luminance and adjusts the luminance of the graphics image based on the larger luminance information.6. The image processing apparatus according to claim 5 , whereinthe processor adjusts the luminance of the graphics image based on the reference luminance of the dynamic range of the predetermined luminance when the metadata acquiring ...

VIDEO PROCESSING SYSTEM USING RING BUFFER AND RACING-MODE RING BUFFER ACCESS CONTROL SCHEME

A video processing system has a storage device, an audio/video demultiplexing circuit, and a video decoder. The storage device has a bitstream buffer that is a ring buffer. The audio/video demultiplexing circuit receives an input data, and performs an audio/video demultiplexing operation upon the input data to write data of a video bitstream into the ring buffer. The video decoder fetches data of the video bitstream from the ring buffer, and performs a video decoding operation upon the fetched data of the video bitstream. 1. A video processing system comprising: 'a bitstream buffer, wherein the bitstream buffer is a ring buffer;', 'a storage device, comprisingan audio/video demultiplexing circuit, arranged to receive an input data, and perform an audio/video demultiplexing operation upon the input data to write data of a video bitstream into the ring buffer; anda video decoder, arranged to fetch data of the video bitstream from the ring buffer, and perform a video decoding operation upon the fetched data of the video bitstream.2. The video processing system of claim 1 , wherein the audio/video demultiplexing circuit is further arranged to update a write pointer to the video decoder claim 1 , where the write pointer is indicative of a current write address of writing data of the video bitstream into the ring buffer by the audio/video demultiplexing circuit; and the video decoder comprises:a read controller, arranged to compare the write pointer with a read pointer, and stop fetching data of the video bitstream from the ring buffer when the read pointer catches up the write pointer, where the read pointer is indicative of a current read address of fetching data of the video bitstream from the ring buffer by the video decoder.3. The video processing system of claim 2 , wherein the read controller does not resume fetching data of the video bitstream from the ring buffer until the audio/video demultiplexing circuit updates the write pointer to a new value.4. The video ...

Image processing device and image processing method

Provided is an image processing device including a selection section configured to select, from a plurality of transform units with different sizes, a transform unit used for inverse orthogonal transformation of image data to be decoded, a generation section configured to generate, from a first quantization matrix corresponding to a transform unit for a first size, a second quantization matrix corresponding to a transform unit for a second size from a first quantization matrix corresponding to a transform unit for a first size, and an inverse quantization section configured to inversely quantize transform coefficient data for the image data using the second quantization matrix generated by the generation section when the selection section selects the transform unit for the second size.

TRANSPORT STREAM FOR CARRIAGE OF VIDEO CODING EXTENSIONS

A video processing device may obtain, from a descriptor for a program comprising one or more elementary streams, a plurality of profile, tier, level (PTL) syntax element sets. The video processing device may obtain, from the descriptor, a plurality of operation point syntax element sets. For each respective operation point syntax element set of the plurality of operation point syntax element sets, the video processing device may determine, for each respective layer of the respective operation point specified by the respective operation point syntax element set, based on a respective syntax element in the respective operation point syntax element set, which of the PTL syntax element sets specifies the PTL information assigned to the respective layer, the respective operation point having a plurality of layers.