InnovationQ will be updated on Sunday, Oct. 22, from 10am ET - noon. You may experience brief service interruptions during that time.
Browse Prior Art Database

Method of speeding up the video seeking in streaming video

IP.com Disclosure Number: IPCOM000246270D
Publication Date: 2016-May-23
Document File: 4 page(s) / 120K

Publishing Venue

The IP.com Prior Art Database


The proposed idea is to speed up the video seeking in streaming video. Becasue online streaming video viewing is always suspended when video seeking. The disclosure proposed a method to improve the speed by comparing the key frame with the buffered ones. If there are similar key frames, we can adopt it to speeding up the seeking behavior.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 50% of the total text.

Page 01 of 4

Method of speeding up the video seeking in streaming video

Video streaming enables us to watch videos on line rather than download them. Hot movies, shows, dramas, and many other video programs are all provided directly on line. They are all able to viewed through video streaming. That is, portions of the video file can be provided piecemeal allowing the end user to begin playback of the video prior to having downloaded the entire video. So frames of the video are downloaded according to the playback progress. To transmit all the video frames to the client video player requires certain bandwidth, the higher definition of the video, the more bandwidth is needed. In current solution, when seeking from one position to another, e.g. 3:00 position to 5:00 position, the waiting time for downloading the coming frames is long and it could affect the user experience. Our method provided here is aimed to solve such problem.

Claim point:
Our method suggests sending the change data of the upcoming I-frame and one of the buffered I-frame, Instead of sending a whole I-frame to the client when user is seeking in the streaming video. In this way, the transmitting data needs less, so the waiting time will reduces.

1. Less transmitting data due to leveraging the buffered I-frames
2. Less waiting time when seeking in the streaming video
3. Just needs slightly modifying the current video streaming protocol

The I means I-frame, B means B-frame, P means P-frame in the image.

In the field of video compression, a video frame is compressed using different algorithms with different advantages and disadvantages, centered mainly around amount of data compression. These different algorithms for video frames are called picture types or frame types. The three major picture types used in


Page 02 of 4

the different video algorithms are I, P and B. They are different in the following characteristics:

I frames are the least compressible but don

P frames can use data from previous frames to decompress and are more compressible than I frames


B frames can use both previous and forward frames for data reference to get the highest amount of datacompression

Among these pictures types, I frames are the major frames(the largest frame and do not need any other frames to decode), and P or B frames are all based on I frames(Variation of I frames, always a small amount of data), so videos compressed using IPB frames.

For current solution, when seeking during a video, the previous I frame is transmitted to the client player, and then the actual seeking frame(maybe a P or B frame), because to render the expected frame, the base I frame is needed. So it takes time to receive the I frame before the picture displays.

In our method, we define a Approximation table in server. Approximation table stores the approximation ratio between all I frames.

Cell(a,b) store the approximation ratio between I-frame(a) and I- frame(b). A cell is comprised by 2 bits. So...