Sun Patent Trust

Panasonic Intellectual Property Corporation of America

Panasonic Intellectual Property Management Co., Ltd.

Panasonic Corporation

Tagivan Ii LLC

Velos Media, LLC

Other

Intellectual Property Corporation of America

Velos Media International Limited

Toshiyasu Sugio

Takahiro Nishi

Hisao Sasai

Youji Shibahara

Toru Matsunobu

Kyoko Tanikawa

Kengo Terada

Chong Soon Lim

Viktor Wahadaniah

Sue Mon Thet Naing

Noritaka Iguchi

Hai Wei Sun

Pongsak Lasang

Tatsuya Koyama

Tadamasa Toma

Satoshi Yoshikawa

Chi Wang

Chung Dean Han

Hiroshi Yahata

Daisaku Komiya

Yoichi Sugino

Masaki Fukuda

Satoshi Kondo

Daisuke Sato

Yuki Maruyama

Virginie Drugeon

Masato Ohkawa

David Michael Duffy

Masayasu Iguchi

Sheng Mei Shen

Kazuya Takagi

Mikihiro Ouchi

Yasuhisa Inada

Yumiko Kato

Takako Hori

Yoshinori Matsui

Nobuhiko Hashida

Masanori Kimura

Kyaw Kyaw Win

Sue Mon Naing

Keng Liang Loi

Pradit Mittrapiyanuruk

Zheng Wu

Kensho Teranishi

Christopher John Wright

Jin Li

Yi Xuan Zhang

Bernadette Elliott Bowman

Seiji Higuchi

Teo Han Boon

Haiwei Sun

Kyoto Tanikawa

Natsuki Nagamori

Junichi Fujihira

Zhen Peng Bian

Tomoaki Itoh

Xuan Jing

Kuniaki Isogai

Hiroaki Toida

Jian Gao

Ryuji Muta

Chisato Yamashita

Ukyou Katsura

Youji Sibahara

Vikto Wahadaniah

Shuuhei Sasakura

Yohei Watakabe

Shunsuke Yasugi

Toru Matsunobo

Nishi Takahiro

Tomokazu Ichiriki

Victor Wahadaniah

An image coding method includes: adding, to a candidate list, a first adjacent motion vector as a candidate for a predicted motion vector to be used for coding the current motion vector; selecting the predicted motion vector from the candidate list; and coding the current motion vector, wherein in the adding, the first adjacent motion vector indicating a position in a first reference picture included in a first reference picture list is added to the candidate list for the current motion vector indicating a position in a second reference picture included in a second reference picture list.

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

A three-dimensional data encoding method includes: encoding, for each of second units, information about positions of three-dimensional points included in a first unit, to generate encoded data items, the second units being smaller than the first unit that is an encoding unit; and outputting the encoded data items. Each of the encoded data items includes no individual additional information. The encoded data items include common additional information. The common additional information includes first information indicating a size of a first encoded data item included in the encoded data items.

Three-dimensional data encoding method, three-dimensional data decoding method, three-dimensional data encoding device, and three-dimensional data decoding device

A three-dimensional data encoding method includes: generating encoded data by encoding third point cloud data that is a combination of first point cloud data and second point cloud data; and generating a bitstream including the encoded data and control information. The encoded data includes a piece of geometry information and pieces of attribute information of each of three-dimensional points included in the third point cloud data. One of the pieces of attribute information includes first information indicating whether a corresponding one of the three-dimensional points belongs to the first point cloud data or the second point cloud data. The control information includes second information indicating, among the pieces of attribute information, a piece of attribute information including the first information.

A three-dimensional data encoding method includes: encoding geometry information of a plurality of three-dimensional points represented by a tree structure; and generating a bitstream including the geometry information encoded and division number information indicating a total number of divisions of each of a plurality of nodes included in the tree structure. The division number information includes common division number information collectively indicating the total number of divisions of two or more nodes among the plurality of nodes.

A three-dimensional data encoding method includes: generating quantized values by quantizing, using one or more first parameters for one or more groups to which one or more attribute information belong, a coefficient value calculated for each node included in a layered structure of three-dimensional points. At least one attribute information belongs to any of the one or more groups. The calculating includes calculating, using two first coefficient values of two first nodes of a first layer, a second coefficient value of a second node of a second layer which is one layer higher. The quantizing includes: shifting-up the one or more first parameters by N bits (N is a natural number); shifting-down, by one bit, a sum of two second parameters of the two first nodes; shifting-down the result by N bits; and quantizing the second coefficient value using the obtained parameter.

An encoding method for encoding three-dimensional points each having a position represented by a distance and an angle, the encoding method comprising: identifying three-dimensional points that belong to a second processing unit and have been encoded, for inter prediction of a first three-dimensional point belonging to a first processing unit; and selecting a reference three-dimensional point from the three-dimensional points identified to calculate an inter predicted value of the first three-dimensional point. The three-dimensional points identified include a second three-dimensional point and a third three-dimensional point, the second three-dimensional point having a second angle corresponding to a first angle of the first three-dimensional point, the third three-dimensional point having a third angle greater than the second angle.

Encoding method, decoding method, encoding device, and decoding device

A three-dimensional data encoding method of encoding three-dimensional points obtained by a sensor includes: encoding local coordinate information indicating sets of local coordinates that are coordinates of the three-dimensional points and are dependent on a location of the sensor; and generating an encoded bitstream including the local coordinate information encoded and global coordinate information indicating global coordinates that are coordinates of a reference point or at least one of the three-dimensional points and are independent from the location of the sensor.

Three-dimensional data encoding method, three-dimensional data decoding method, three- dimensional data encoding device, and three- dimensional data decoding device

A three-dimensional data encoding method includes: obtaining second attribute information obtained by transforming first attribute information of a three-dimensional point in at least one frame among frames, the frames constituting a sequence; and encoding the second attribute information to generate a bitstream. The transforming is different from quantization, and the bitstream further includes: at least one first parameter provided for the sequence for the transforming; and at least one second parameter provided for each of the at least one frame for the transforming.

A three-dimensional data encoding method is a method of encoding three-dimensional points each having an attribute information item. The three-dimensional data encoding method includes: assigning each of the three-dimensional points to any one of layers; encoding the attribute information item of each three-dimensional point using the layers; and encoding information indicating a total number of three-dimensional points belonging to each of the layers.

An image coding method includes: determining a maximum number of merging candidates; deriving first merging candidates based on blocks spatially or temporally neighboring a current block; determining whether or not a total number of the first merging candidates is smaller than the maximum number; deriving, by making a combination out of the derived first merging candidates, a second merging candidate for bi-directional prediction when it is determined that the total number of the first merging candidates is smaller than the maximum number; selecting a merging candidate to be used for the coding of the current block from the first merging candidates and the second merging candidate; and coding, using the determined maximum number, an index for identifying the selected merging candidate, and attaching the coded index to the bitstream.

Image decoding method and image decoding apparatus using candidate motion vectors

A three-dimensional data encoding method includes: calculating a prediction residual that is a difference between geometry information of a three-dimensional point included in point cloud data and a predicted value; quantizing the prediction residual using a first quantization parameter; and generating a bitstream including (i) first information indicating the prediction residual quantized, (ii) second information indicating a second quantization parameter, (iii) third information indicating a first difference between the second quantization parameter and the first quantization parameter, (iv) fourth information indicating a first bit count of the first information, and (v) fifth information indicating a second bit count of the fourth information. When the first difference is not zero, the bitstream further includes sixth information indicating an amount of change in the fifth information that is in accordance with the first difference, and when the first difference is zero, the bitstream does not include the sixth information.

A three-dimensional data encoding method includes: appending, to a bitstream, first information indicating whether a leaf to be included in an N-ary tree structure of three-dimensional points included in three-dimensional data is to include a single three-dimensional point or two or more three-dimensional points, where N is an integer greater than or equal to 2; when the first information indicates that the leaf is to include a single three-dimensional point, generating an N-ary tree structure in which a leaf includes a single three-dimensional point, and encoding the N-ary tree structure; and when the first information indicates that the leaf is to include two or more three-dimensional points, generating an N-ary tree structure in which a leaf includes two or more three-dimensional points, and encoding the N-ary tree structure.

A three-dimensional data encoding method includes: determining whether to encode, using an octree structure, a current space unit among a plurality of space units included in three-dimensional data; encoding the current space unit using the octree structure, when it is determined that the current space unit is to be encoded using the octree structure; encoding the current space unit using a different method that is not the octree structure, when it is determined that the current space unit is not to be encoded using the octree structure; and appending, to a bitstream, information that indicates whether the current space unit has been encoded using the octree structure.

A three-dimensional data encoding method includes: calculating a predicted value of a position of a three-dimensional point according to one of inter prediction and intra prediction; calculating a residual between the predicted value and the position; arithmetic-encoding the residual using a first context when the predicted value is calculated according to the inter prediction; and arithmetic-encoding the residual using a second context different from the first context when the predicted value is calculated according to the intra prediction. The residual is expressed by third residual information indicating a bit count of the residual.

A motion vector calculation method which attains a higher compression rate, includes: a selection step of selecting one of at least one reference motion vector of a reference block; and a calculation step of calculating a motion vector of a current block to be processed, using the one reference motion vector selected in the selection step, and in the selection step, when the reference block has two reference motion vectors, one of the two reference motion vectors is selected based on whether the reference block is located before or after the current block in display time order, and when the reference block has only one reference motion vector, the one reference motion vector is selected.

Motion vector calculation method, picture coding method, picture decoding method, motion vector calculation apparatus, and picture coding and decoding apparatus

Growing community of inventors

Osaka, Japan

Toshiyasu Sugio