Techniques for avoiding re-encoding of media content items

Patent metadata

Field	Value
Publication number	US-12464147-B1
Application number	US-202418656512-A
Country	US
Kind code	B1
Filing date	May 6, 2024
Priority date	May 6, 2024
Publication date	Nov 4, 2025
Grant date	Nov 4, 2025

Abstract

In various embodiments, a video editing application receives, from an encoding application, a list of random access points of an encoded media content item. When an operator specifies a point of interest for the media content item, the video editing application determines a closest random access point to the point of interest and modifies the point of interest to coincide with the closest random access point. The encoding application can also modify the point of interest to coincide with an existing random access point if the point of interest is within a tolerance of the existing random access point and the point of interest is not frame specific. Further, the encoding application can modify media metrics, computed using pre-encoded versions of the media content item, using heuristics to account for operator-specified points of interest that do not coincide with, or are not within a tolerance of, existing random access points.

First claim

What is claimed is:

1. A computer-implemented method for avoiding re-encoding of video sequences, the method comprising:
performing one or more encoding operations on a source video sequence to generate a first encoded video sequence that includes a first set of random access points;
transmitting, to a video editing application, a list of the first set of random access points; and
receiving, from the video editing application, one or more points of interest, wherein a first point of interest included in the one or more points of interest is modified by the video editing application to coincide with a first random access point included in the first set of random access points.

2. The computer-implemented method of claim 1 , wherein the first set of random access points includes a plurality of random access points associated with a plurality of boundaries of one or more shots included in the source video sequence.

3. The computer-implemented method of claim 1 , wherein the first set of random access points includes one or more random access points associated with one or more segments of the source video sequence, and wherein each of the one or more segments has a predefined length.

4. The computer-implemented method of claim 1 , further comprising:
determining that a second point of interest included in the one or more points of interest is within a predefined tolerance of a second random access point included in the first set of random access points; and
in response, modifying the second point of interest to coincide with the second random access point.

5. The computer-implemented method of claim 1 , further comprising:
modifying, based on the one or more points of interest, at least one of a size of or a quality score associated with at least one pre-encoded video sequence to generate at least one of a modified size or a modified quality score;
selecting at least one of a resolution or an encoding parameter based on the at least one of the modified size or the modified quality score; and
performing one or more encoding operations on the first encoded video sequence based on the at least one of the resolution or the encoding parameter to generate at least one additional encoded video sequence.

6. The computer-implemented method of claim 1 , further comprising, for each rung included in a plurality of rungs of an encoding ladder, performing one or more encoding operations on the first encoded video sequence based on the one or more points of interest, a respective resolution, and a respective set of encoding parameters to generate a respective encoded video sequence.

7. The computer-implemented method of claim 1 , wherein the first point of interest is closer to the first random access point than to any other random access point included in the first set of random access points.

8. The computer-implemented method of claim 1 , wherein the list of the first set of random access points indicates at least one of a set of frames of the source video sequence or a set of timestamps associated with the first set of random access points.

9. The computer-implemented method of claim 1 , further comprising performing one or more packaging operations based on the first encoded video sequence to generate a packaging for the first encoded video sequence.

10. The computer-implemented method of claim 1 , further comprising performing one or more encoding operations on the first encoded video sequence to generate a second encoded video sequence, wherein the second encoded video sequence comprises a second set of random access points, and the second set of random access points includes at least one random access point corresponding to at least one point of interest included in the one or more points of interest.

11. One or more non-transitory computer-readable media storing instructions that, when executed by at least one processor, cause the at least one processor to perform steps comprising:
performing one or more encoding operations on a source video sequence to generate a first encoded video sequence that includes a first set of random access points;
transmitting, to a video editing application, a list of the first set of random access points; and
receiving, from the video editing application, one or more points of interest, wherein a first point of interest included in the one or more points of interest is modified by the video editing application to coincide with a first random access point included in the first set of random access points.

12. The one or more non-transitory computer-readable media of claim 11 , wherein the first set of random access points includes a plurality of random access points associated with a plurality of boundaries of one or more shots included in the source video sequence.

13. The one or more non-transitory computer-readable media of claim 11 , wherein the first set of random access points includes one or more random access points associated with one or more segments of the source video sequence, and wherein each of the one or more segments has a predefined length.

14. The one or more non-transitory computer-readable media of claim 11 , wherein the instructions, when executed by the at least one processor, further cause the at least one processor to perform the steps of:
determining that a second point of interest included in the one or more points of interest is within a predefined tolerance of a second random access point included in the first set of random access points; and
in response, modifying the second point of interest to coincide with the second random access point.

15. The one or more non-transitory computer-readable media of claim 11 , wherein the instructions, when executed by the at least one processor, further cause the at least one processor to perform the steps of:
modifying, based on the one or more points of interest, at least one of a size of or a quality score associated with at least one pre-encoded video sequence to generate at least one of a modified size or a modified quality score;
selecting at least one of a resolution or an encoding parameter based on the at least one of the modified size or the modified quality score; and
performing one or more encoding operations on the first encoded video sequence based on the at least one of the resolution or the encoding parameter to generate at least one additional encoded video sequence.

16. The one or more non-transitory computer-readable media of claim 11 , wherein the instructions, when executed by the at least one processor, further cause the at least one processor to perform the step of, for each rung included in a plurality of rungs of an encoding ladder, performing one or more encoding operations on the first encoded video sequence based on the one or more points of interest, a respective resolution, and a respective set of encoding parameters to generate a respective encoded video sequence.

17. The one or more non-transitory computer-readable media of claim 11 , wherein the instructions, when executed by the at least one processor, further cause the at least one processor to perform the step of, for each rung included in a plurality of rungs of an encoding ladder, performing one or more encoding operations on the first encoded video sequence based on the one or more points of interest, a respective resolution, and a respective set of encoding parameters to generate a respective encoded video sequence.

18. The one or more non-transitory computer-readable media of claim 11 , wherein the first point of interest is closer to the first random access point than to

Assignees

• Netflix Inc

Inventors

• Prakash Adithya
• Mavlankar Aditya
• Guo Liwei
• Moorthy Anush
• Swanson Kyle Christopher
• Chen Li-Heng

Classifications

• G11B27/031

  Electronic editing of digitised analogue information signals, e.g. audio or video signals · CPC title

• H04N19/40 Primary

  using video transcoding, i.e. partial or full decoding of a coded input stream followed by re-encoding of the decoded output stream · CPC title

• H04N21/23439

  for generating different versions · CPC title

• H04N21/8455

  involving pointers to the content, e.g. pointers to the I-frames of the video stream · CPC title

• G11B27/102

  Programmed access in sequence to addressed parts of tracks of operating record carriers (access by moving the head G11B3/08, G11B5/54, G11B7/085, G11B21/022; by moving the record carrier G11B15/005, G11B17/005, by driving of both record carrier and head G11B15/1816) · CPC title