Code stream transmission method and device

Abstract

The invention discloses a code stream transmission method and device. According to the method, when an access command sent by a user is received, a coder generates refreshing frames by coding; the refreshing frames and latter code stream are sent to a decoder with existing connection; I frames as the reference frames of the refreshing frames, the refreshing frames and the latter stream are sent to the decoder with newly built connection; and the reference frame of the refreshing frames obtained through inter-frame prediction is a first I frame in a current image set. According to the method and the device, rapid random access can be realized; the refreshing frames are generated by force; high instantaneous code rate fluctuation will not be caused; and the influence on the existing connection is low.

Description

technical field [0001] The invention belongs to the technical field of video coding and decoding, and in particular relates to a code stream transmission method and device capable of realizing fast random access. Background technique [0002] With the development of society and economy, people's need for safety is more and more urgent, and video surveillance technology is correspondingly applied more and more widely. Video surveillance equipment is required in public places, traffic roads, inside buildings and even inside private houses to provide fast and clear video images in real time or afterwards. [0003] At present, there are still many technical defects in the field of video surveillance technology. For example, in order to achieve a low bit rate, it is usually necessary to set the I frame interval to be very long. However, since decoding needs to find an I frame forward to start decoding, it means that the longer the I frame interval is, the more difficult it is d...

AI Technical Summary

Problems solved by technology

[0006] However, the above-mentioned technical solution has the following problems: due to the fixed interval of queue-cutting frames (set as N1), after receiving the information that a new user cuts in, this scheme cannot insert a queue-cutting frame immediately, but waits for a fixed moment, that is, waits for It cannot be played until the next queue-cutting frame arrives

The waiting time of each user is related to the specific time point when the user cuts in. When the user accesses at the moment after the queue-cutting frame, it will wait for a time close to the distance N1, and when connecting at the moment before the queue-cutting frame, it will Can get the fastest feedback, so using this technical solution, the user's waiting time is uncontrollable

Images