CN109587490B - Tile fragment filling method, device, equipment, storage medium and decoding method - Google Patents

Tile fragment filling method, device, equipment, storage medium and decoding method Download PDF

Info

Publication number
CN109587490B
CN109587490B CN201811306191.9A CN201811306191A CN109587490B CN 109587490 B CN109587490 B CN 109587490B CN 201811306191 A CN201811306191 A CN 201811306191A CN 109587490 B CN109587490 B CN 109587490B
Authority
CN
China
Prior art keywords
tile
filling
fragments
decoding
decoded
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201811306191.9A
Other languages
Chinese (zh)
Other versions
CN109587490A (en
Inventor
王曜
梁峰
谭建军
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shenzhen Weier Vision Technology Co ltd
Original Assignee
Shenzhen Weier Visual Sense Medium Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Shenzhen Weier Visual Sense Medium Co ltd filed Critical Shenzhen Weier Visual Sense Medium Co ltd
Priority to CN201811306191.9A priority Critical patent/CN109587490B/en
Publication of CN109587490A publication Critical patent/CN109587490A/en
Application granted granted Critical
Publication of CN109587490B publication Critical patent/CN109587490B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/169Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
    • H04N19/17Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object
    • H04N19/174Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object the region being a slice, e.g. a line of blocks or a group of blocks
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/44Decoders specially adapted therefor, e.g. video decoders which are asymmetric with respect to the encoder

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)

Abstract

The invention discloses a low-complexity Tile fragment filling method, which comprises the following steps: acquiring filling information, wherein the filling information comprises the number and the position of Tile fragments needing to be filled during decoding; and filling by using a filling Tile fragment with low complexity according to the filling information. The complexity of the filling Tile fragment adopted by the invention is less than that of the received decoding Tile fragment, the filling Tile fragment is a simple pure color video sequence, the code stream is less, and the decoding complexity can be effectively reduced, so that the decoding power consumption of the filling data can be effectively reduced.

Description

Tile fragment filling method, device, equipment, storage medium and decoding method
Technical Field
The invention relates to the field of video coding, in particular to a Tile fragment filling method, a device, equipment, a storage medium and a decoding method.
Background
At present, in video coding application based on Tile fragments, during decoding, a player downloads a certain number of Tile fragment data (for example, M × N Tile fragments) each time, and merges the downloaded Tile fragment data into one path of coding code stream, and sends the coding code stream to a hardware decoder for decoding. In order to ensure the continuity of hardware decoding, the number of Tile fragments downloaded each time is generally not easily changed in the decoding process, so when the number of received Tile fragments is smaller than the number of Tile fragments required for decoding, Tile fragment filling needs to be performed on the remaining positions.
In the prior art, the last Tile fragment is repeated or the Tile fragment with the smallest data amount in the received Tile fragments is used for filling, but the filling method still has the technical problems of larger data amount, higher decoding complexity and relatively more decoding time consumption, so that a low-complexity Tile fragment filling method is very necessary.
Disclosure of Invention
The present invention is directed to solving, at least to some extent, one of the technical problems in the related art. Therefore, the invention aims to provide a Tile fragment filling method, a device, equipment, a storage medium and a decoding method which can effectively reduce the decoding complexity.
The technical scheme adopted by the invention is as follows:
in a first aspect, the present invention provides a low complexity Tile fragment filling method, including the steps of:
acquiring filling information, wherein the filling information comprises the number and the position of Tile fragments needing to be filled during decoding;
and filling by using a filling Tile fragment with low complexity according to the filling information.
Further, the step of acquiring the filling information specifically includes:
downloading a Tile fragment to be decoded;
and obtaining the number and the position of the Tile fragments needing to be filled according to the number of the Tile fragments to be decoded and the format of the Tile list.
Further, the Tile list format is a Tile list format with M × N filling positions, and the step obtains the number and positions of Tile fragments to be filled according to the number of the Tile fragments to be decoded and the Tile list format, and specifically includes:
when the number of Tile fragments to be decoded is less than M x N,
firstly filling the Tile fragments to be decoded into the Tile list format, wherein the positions and the number of the positions of the Tile fragments which are not filled by the Tile fragments to be decoded in the Tile list format are the number and the positions of the Tile fragments which need to be filled.
Further, the filling Tile slice is a Tile slice which simulates a pure color video sequence and is coded by an HEVC coding mode.
In a second aspect, the present invention provides a low complexity Tile fragment decoding method, including obtaining a code stream to be decoded according to the filling method of claims 1 to 6, decoding the code stream to be decoded, and discarding the filled Tile fragment information in the code stream to be decoded when rendering is performed after decoding.
Further, during decoding, the decoding Tile fragment and the padding Tile fragment are combined into one HEVC coding code stream for decoding.
In a third aspect, the present invention provides a low complexity Tile fragment filling apparatus, including:
the device comprises a filling information acquisition module, a decoding module and a display module, wherein the filling information acquisition module is used for acquiring filling information, and the filling information comprises the number and the position of Tile fragments needing to be filled during decoding;
a filling module: and the system is used for filling by using the filling Tile with low complexity according to the filling information.
In a fourth aspect, the present invention provides a control device for low complexity Tile fragment filling, including:
at least one processor; and the number of the first and second groups,
a memory communicatively coupled to the at least one processor; wherein the content of the first and second substances,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform any of the low complexity Tile fragment padding methods described above.
In a fifth aspect, the present invention provides a computer-readable storage medium having stored thereon computer-executable instructions for causing a computer to perform any one of the low complexity Tile fragment filling methods described above.
The invention has the beneficial effects that:
according to the invention, the filling information required by decoding is obtained, and the filling is carried out by using the filling Tile fragment with low complexity according to the filling information, the complexity of the adopted filling Tile fragment is less than that of the received decoding Tile fragment, the filling Tile fragment is a simple simulated pure color video sequence, the code stream is small, the decoding complexity can be effectively reduced, and the decoding power consumption of the filling data can be effectively reduced.
Drawings
Fig. 1 is a schematic diagram of a Tile fragment list composed of M × N fragments in the prior art;
FIG. 2 is a schematic diagram of Tile fragment filling in the prior art;
FIG. 3 is a flowchart of a low complexity Tile fragment filling method according to an embodiment of the present invention;
fig. 4 is a block diagram of a low complexity Tile fragment filling apparatus according to an embodiment of the present invention.
Detailed Description
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the following description will be made with reference to the accompanying drawings. It is obvious that the drawings in the following description are only some examples of the invention, and that for a person skilled in the art, other drawings and embodiments can be derived from them without inventive effort.
In the Tile-based video coding application, a player downloads a plurality of Tile fragment data according to a set download number and a Tile list format, for example, downloads at most M × N Tile fragments, as shown in fig. 1, the Tile fragment list is a schematic diagram of a Tile fragment list composed of M × N fragments, where M is 6 and N is 3, and there are 18 Tile fragments in total, and the most M × N downloaded Tile fragment data are merged into one Tile coding stream of HEVC and sent to a hardware decoder for decoding.
In order to ensure the continuity of hardware decoding, the number of M × N cannot be easily changed in one decoding process, because once M, N are changed, the resolution of the combined Tile encoded code stream is changed, so the hardware decoder needs to be reinitialized according to the new resolution, and the operation of reconfiguring the hardware decoder consumes much time, so the operation cannot be performed generally, that is, the number of Tile fragments required for decoding M × N is considered to be unchanged in one decoding process.
When the number of downloaded Tile fragments is smaller than the number of Tile fragments required for decoding, the Tile fragments need to be filled to the rest positions, as shown in fig. 2, a Tile fragment filling schematic diagram is shown, where the received decoded Tile fragments are {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}, and the Tile fragments required for decoding are M × N-6-3-18 fragments, so that in addition to the received 10 Tile fragments, the rest 8 Tile fragments need to be filled, as shown in fig. E, the filling position may be filled with a repeated last fragment (e.g., Tile10), or may be filled with the smallest data amount one of Tile1-Tile 10.
As shown in fig. 3, a flowchart of a low complexity Tile fragment filling method according to an embodiment of the present invention includes the steps of: s1, acquiring filling information, specifically: downloading required decoding Tile fragments, wherein the number and the position of the Tile fragments to be decoded are obtained according to the number of the Tile fragments to be decoded and the Tile list format, and the filling information refers to the number and the position of the Tile fragments to be filled, which are obtained according to the number of the Tile fragments to be decoded and the Tile list format; s2: filling by using a low-complexity filling Tile fragment according to filling information, specifically: when the number of the Tile fragments to be decoded is less than M × N, filling the Tile fragments to be decoded into the Tile list format, wherein the positions of the Tile list format which are not filled by the Tile fragments to be decoded and the positions of the positions are the number and the positions of the Tile fragments which need to be filled
The purpose of padding is only to ensure that the resolution of the Tile-merged HEVC code stream is not changed during decoding, and Tile decoded data used for padding is discarded during rendering, that is, the Tile-padded decoded data is not actually used, so that what data is after decoding the portion of the code stream is not important, and the simpler the code stream data of the padding data is, the better the decoding complexity is reduced as much as possible.
The low-complexity Tile fragmentation adopted in this embodiment refers to: the complexity of the filling Tile fragment is lower than that of the decoding Tile fragment, a simulated pure color video sequence is adopted as the filling Tile fragment, the pure color video sequence is coded by an HEVC coding mode, for example, a whole frame SKIP type coding mode is adopted, one P frame data is about 31 bytes (640x640 resolution ratio), the data volume is very small, the decoding burden of a decoder is slightly increased, and a SKIP mode is a special block type in the HEVC standard and is characterized in that only a block type is output in coding, and residual information and motion information of a data block do not need to be output.
Example two:
the embodiment provides a low-complexity Tile fragment decoding method, which includes the steps of obtaining a code stream to be decoded according to the filling method of the first embodiment, decoding the code stream to be decoded, and discarding filling Tile fragment information in the code stream to be decoded when rendering is performed after decoding.
During actual decoding, the decoding Tile fragment and the filling Tile fragment are combined into one path of HEVC coding code stream for decoding, and the filling Tile fragment is used for effectively reducing the decoding power consumption of filling data.
On the other hand, as shown in fig. 4, a block diagram of a low complexity Tile fragment filling apparatus according to an embodiment of the present invention includes:
the filling information acquisition module is used for acquiring filling information, and the filling information comprises the number and the positions of Tile fragments needing to be filled during decoding; a filling module: for padding with low complexity padding Tile according to the padding information.
On the other hand, the invention also provides a control device for low-complexity Tile fragment filling, which comprises: at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor to enable the at least one processor to perform any one of the low complexity Tile fragment filling methods described above.
In another aspect, the present invention further provides a computer-readable storage medium storing computer-executable instructions for causing a computer to perform any one of the low complexity Tile fragment filling methods described above.
According to the invention, the filling information required by decoding is obtained, and the filling is carried out by using the filling Tile fragment with low complexity according to the filling information, the complexity of the adopted filling Tile fragment is less than that of the received decoding Tile fragment, the filling Tile fragment is a simple simulated pure color video sequence, the code stream is small, the decoding complexity can be effectively reduced, and the decoding power consumption of the filling data can be effectively reduced.
While the preferred embodiments of the present invention have been illustrated and described, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the invention as defined by the appended claims.

Claims (8)

1. A low-complexity Tile fragment filling method is characterized by comprising the following steps:
acquiring filling information, wherein the filling information comprises the number and the position of Tile fragments needing to be filled during decoding;
the acquiring of the filling information specifically includes: downloading Tile fragments to be decoded, and obtaining the number and the position of the Tile fragments to be filled according to the number of the Tile fragments to be decoded and a Tile list format, wherein the Tile list format is used for reflecting the number of the Tile fragments required by one-time decoding and the position of the Tile fragments required by one-time decoding;
and filling by using a filling Tile fragment with low complexity according to the filling information.
2. The method according to claim 1, wherein the Tile list format is a Tile list format having M × N filling positions, and the obtaining of the number and positions of Tile fragments to be filled according to the number of Tile fragments to be decoded and the Tile list format specifically includes:
when the number of Tile fragments to be decoded is less than M x N,
filling the Tile fragments to be decoded into the Tile list format, wherein the positions and the number of the positions of the Tile list format which are not filled by the Tile fragments to be decoded are the number and the positions of the Tile fragments which need to be filled.
3. The method according to claim 1, wherein the filler Tile is a Tile that simulates a pure color video sequence and is encoded by HEVC.
4. A low-complexity Tile decoding method is characterized by comprising the steps of obtaining a code stream to be decoded according to the filling method of any one of claims 1 to 3, decoding the code stream to be decoded, and discarding filling Tile Tile fragment information in the code stream to be decoded when rendering is carried out after decoding.
5. The method according to claim 4, wherein the Tile to be decoded and the filling Tile are merged into one HEVC code stream for decoding during decoding.
6. A low complexity Tile filling device, comprising:
the filling information acquisition module is used for acquiring filling information, the filling information comprises the number and the positions of Tile fragments needing to be filled during decoding, and the acquisition of the filling information specifically comprises the following steps: downloading Tile fragments to be decoded, and obtaining the number and the position of the Tile fragments to be filled according to the number of the Tile fragments to be decoded and a Tile list format, wherein the Tile list format is used for reflecting the number of the Tile fragments required by one-time decoding and the position of the Tile fragments required by one-time decoding;
a filling module: and the system is used for filling by using the filling Tile with low complexity according to the filling information.
7. A control device for low complexity Tile fragment filling, comprising:
at least one processor; and the number of the first and second groups,
a memory communicatively coupled to the at least one processor; wherein the content of the first and second substances,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of any one of claims 1 to 3.
8. A computer-readable storage medium having stored thereon computer-executable instructions for causing a computer to perform the method of any one of claims 1 to 3.
CN201811306191.9A 2018-11-05 2018-11-05 Tile fragment filling method, device, equipment, storage medium and decoding method Active CN109587490B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201811306191.9A CN109587490B (en) 2018-11-05 2018-11-05 Tile fragment filling method, device, equipment, storage medium and decoding method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811306191.9A CN109587490B (en) 2018-11-05 2018-11-05 Tile fragment filling method, device, equipment, storage medium and decoding method

Publications (2)

Publication Number Publication Date
CN109587490A CN109587490A (en) 2019-04-05
CN109587490B true CN109587490B (en) 2022-05-31

Family

ID=65921406

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811306191.9A Active CN109587490B (en) 2018-11-05 2018-11-05 Tile fragment filling method, device, equipment, storage medium and decoding method

Country Status (1)

Country Link
CN (1) CN109587490B (en)

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103262123A (en) * 2010-12-14 2013-08-21 瑞典爱立信有限公司 Tile encoding and decoding
CN103907350A (en) * 2012-09-29 2014-07-02 华为技术有限公司 Method, apparatus and system for encoding and decoding video
CN103959781A (en) * 2011-11-04 2014-07-30 高通股份有限公司 Padding of segments in coded slice NAL units
CN105191303A (en) * 2014-02-21 2015-12-23 华为技术有限公司 Method for processing video, terminal and server
CN106233745A (en) * 2013-07-29 2016-12-14 皇家Kpn公司 Tile video flowing is provided to client
CN107113476A (en) * 2015-01-12 2017-08-29 诺基亚技术有限公司 For the method for video flowing, device and computer-readable recording medium
KR20180101123A (en) * 2017-03-03 2018-09-12 에스케이텔레콤 주식회사 Apparatus and Method for Video Encoding or Decoding

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103262123A (en) * 2010-12-14 2013-08-21 瑞典爱立信有限公司 Tile encoding and decoding
CN103959781A (en) * 2011-11-04 2014-07-30 高通股份有限公司 Padding of segments in coded slice NAL units
CN103907350A (en) * 2012-09-29 2014-07-02 华为技术有限公司 Method, apparatus and system for encoding and decoding video
CN106233745A (en) * 2013-07-29 2016-12-14 皇家Kpn公司 Tile video flowing is provided to client
CN105191303A (en) * 2014-02-21 2015-12-23 华为技术有限公司 Method for processing video, terminal and server
CN107113476A (en) * 2015-01-12 2017-08-29 诺基亚技术有限公司 For the method for video flowing, device and computer-readable recording medium
KR20180101123A (en) * 2017-03-03 2018-09-12 에스케이텔레콤 주식회사 Apparatus and Method for Video Encoding or Decoding

Also Published As

Publication number Publication date
CN109587490A (en) 2019-04-05

Similar Documents

Publication Publication Date Title
US8755443B2 (en) Video source coding with decoder side information
US7365659B1 (en) Method of context adaptive binary arithmetic coding and coding apparatus using the same
US9900624B2 (en) Methods and apparatus of decoding process for palette syntax
GB2550965B (en) Encoding and decoding arrays of data elements
CN110121072B (en) Apparatus and method for encoding an array of data elements or a stream of arrays of data elements
US11321905B2 (en) Error concealment in split rendering
CN111790145A (en) Data processing method and device, cloud game engine and computer storage medium
CN110636309A (en) Data processing system
CN110049347B (en) Method, system, terminal and device for configuring images on live interface
CN108353180A (en) Video coding with delay reconstruction
CN109587490B (en) Tile fragment filling method, device, equipment, storage medium and decoding method
KR20230130756A (en) Error concealment in segmented rendering using shading atlases.
CN113228663A (en) Method, device, computer program and computer readable medium for scalable image coding
CN114205662A (en) Low-delay video rendering method and device for iOS (internet operating system) end
CN110493242B (en) Method, device and storage medium for improving image enhancement based on WGAN-GP and U-net
CN105704488B (en) Video image data encoding method, apparatus and computer readable medium
US20240040147A1 (en) Data processing method and apparatus, computer device, and storage medium
CN108184126A (en) Video coding and coding/decoding method, the encoder and decoder of snapshot image
CN116668741A (en) Cloud desktop display method, image display method, device and storage medium
US10262632B2 (en) Providing output surfaces for display in data processing systems
CN112367521B (en) Display screen content sharing method and device, computer equipment and storage medium
CN115225902A (en) High-resolution VR cloud game solution method based on scatter coding and computer equipment
CN114079823A (en) Video rendering method, device, equipment and medium based on Flutter
CN108028943A (en) Recovered using long-term reference picture come authentication error to carry out Video coding
CN110392262A (en) A kind of method and device for compressing virtual desktop image

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
CP03 Change of name, title or address

Address after: 518000 building 101, No. 1, building 10 (M-10, Central District, high tech Zone), Maling Industrial Zone, Maling community, Yuehai street, Nanshan District, Shenzhen, Guangdong

Patentee after: Shenzhen Weier Vision Technology Co.,Ltd.

Address before: 519125 floors 1-2, tefa information technology building, Qiongyu Road, Science Park, Nanshan District, Shenzhen, Guangdong Province

Patentee before: SHENZHEN WEIER VISUAL SENSE MEDIUM Co.,Ltd.

CP03 Change of name, title or address