KR102331537B1 - Apparatus and method for decoding - Google Patents

Abstract

The present invention relates to a decoding apparatus and method capable of reproducing a seamless screen by supporting decoding of all frames during high-speed reproduction of a digital video image. The decoding device buffers a decoder pool including at least one software decoder, an input digital video compression signal, and allocates the buffering signal to the idle software decoder when there is an idle software decoder in the decoder pool, and the idle software decoder is all operated In the case of being, it includes a host module for creating a new software decoder in the decoder pool and allocating a buffering signal to the new software decoder, and an alignment module for receiving and arranging the decoded digital video signals in the decoder pool in order.

Description

Decoding apparatus and method {APPARATUS AND METHOD FOR DECODING}

The present invention relates to a decoding apparatus and method capable of reproducing a seamless screen by supporting decoding of all frames during high-speed reproduction of a digital video image.

CCTV footage is largely monitored in two ways. The first is to monitor the on-site situation in real time, and the second is to watch the recorded video and monitor it for post-analysis. Currently, network CCTV cameras use a computer video compression method to reduce the amount of data transmitted over the network to reduce the amount of recorded data. In the digital video compression technique, a spatial compression technique for independently compressing each image and a temporal compression technique for compressing only the changed part by utilizing the similarity of the before/after images are used at the same time.

Since the video has a large amount of data and the computation process during compression and decompression is complicated, it can handle the load of decompressing in real time, but it is difficult to digest the load of reproducing the recorded video at high speed to check the recorded video afterwards. Decompression has a large load, and since compression must be sequentially released by the time compression technique, there is a limit to speed improvement of double speed reproduction. Therefore, the current double speed playback of the video recorded by the current network CCTV cameras normally only supports 2X playback in a continuous form, and when playing at 4 or 8 speed or higher, only intra frames that can be decoded immediately are played, so the playback screen looks very cut off. Occurs. Therefore, there is a difficulty in not being able to process the post-mortem analysis at high speed.

Japanese Laid-Open Patent Publication No. 2006-0049140

SUMMARY The technical problem to be solved by the present invention is to provide a decoding apparatus and method capable of reproducing a seamless screen by supporting decoding of all frames during high-speed reproduction of a digital video image.

A decoding apparatus for solving the technical problem to be achieved by the present invention includes: a decoder pool including at least one software decoder; Buffers the input digital video compression signal, allocates the buffering signal to the idle software decoder when there is an idle software decoder in the decoder pool, and adds a new software decoder in the decoder pool when all of the idle software decoders are in operation a host module generating and allocating the buffering signal to the new software decoder; and an alignment module for receiving the decoded digital video signals in the decoder pool and arranging them in order.

In the present invention, the host module is characterized in that the input digital video compression signal is buffered in units of a group of pictures (GOP).

In the present invention, the alignment module is characterized in that the frame is dropped according to the rendering performance of the aligned digital video signal.

A decoding method for solving the technical problem to be achieved by the present invention is a method of decoding a video signal including a decoder pool including at least one software decoder, the method comprising: buffering an input digital video compressed signal; allocating the buffering signal to the idle software decoder if there is an idle software decoder in the decoder pool; creating a new software decoder in the decoder pool when all of the idle software decoders are in operation, and allocating the buffering signal to the new software decoder; and receiving the decoded digital video signals in the decoder pool and arranging them in order.

In the present invention, the buffering may include buffering the input digital video compressed signal in a group of picture (GOP) unit.

In the present invention, the aligning may further include dropping the aligned digital video signal according to rendering performance.

As described above, according to the present invention, since decoding of all frames is supported during reproduction of a digital video image, so that the screen can be viewed without interruption even in high-speed reproduction of 4x or 8x or higher, post-analysis can be performed more efficiently.

1 is a block diagram showing the configuration of a decoding apparatus according to an embodiment of the present invention.
2 to 4 are diagrams for explaining 4x decoding by a decoding apparatus according to an embodiment of the present invention.
5 is a flowchart illustrating an operation of a decoding method according to an embodiment of the present invention.

Advantages and features of the present invention, and methods for achieving them will become apparent with reference to the detailed description in conjunction with the accompanying drawings. However, it should be understood that the present invention is not limited to the embodiments presented below, but may be implemented in a variety of different forms, and includes all transformations, equivalents, and substitutes included in the spirit and scope of the present invention. . The embodiments presented below are provided to complete the disclosure of the present invention, and to fully inform those of ordinary skill in the art to the scope of the present invention. In describing the present invention, if it is determined that a detailed description of a related known technology may obscure the gist of the present invention, the detailed description thereof will be omitted.

The terms used in the present application are only used to describe specific embodiments, and are not intended to limit the present invention. The singular expression includes the plural expression unless the context clearly dictates otherwise. In the present application, terms such as “comprise” or “have” are intended to designate that a feature, number, step, operation, component, part, or combination thereof described in the specification exists, but one or more other features It should be understood that this does not preclude the existence or addition of numbers, steps, operations, components, parts, or combinations thereof. Terms such as first, second, etc. may be used to describe various elements, but the elements should not be limited by the terms. The above terms are used only for the purpose of distinguishing one component from another.

Hereinafter, embodiments according to the present invention will be described in detail with reference to the accompanying drawings, and in the description with reference to the accompanying drawings, the same or corresponding components are given the same reference numerals, and overlapping descriptions thereof are omitted. decide to do

1 is a block diagram showing the configuration of a decoding apparatus according to an embodiment of the present invention.

Referring to FIG. 1 , the decoding apparatus 10 includes a host module 100 , a decoder pool 200 , and an alignment module 300 . Here, the host module 100 may include a buffering unit 110 and a decoder allocating unit 120 . Also, the decoder pool 200 may include at least one or more idle software decoders 210 and at least one or more new software decoders 220 generated by the host module 100 .

The host module 100 buffers the input digital video compression signal, and when there is an idle software decoder in the decoder pool 200 , allocates the buffering signal to the idle software decoder, and the idle software decoder included in the decoder pool 200 . When all of the software decoders are in operation, a new software decoder is created in the decoder pool 200 and a buffering signal is allocated to the new software decoder.

The buffering unit 110 buffers the input digital compressed video signal in a series of units. Here, the series of units may be a group of picture (GOP) unit. The MPEG standard or modified method is typically used for video compression and decompression methods. Even with the transformation method, the core data saving method based on time compression is not much different. The method of compression using a temporal model cross-referencing image information that changes over time, leaving only the information of the changed part, and reusing the reference image frame (intra frame) or the information of the previous image frame for the image of the unchanged part. indicates. Two adjacent still images constituting a moving image are very similar to each other, so a compression method using such a temporal model has a great effect. For example, it is possible to save data by detecting only motion information of a part that has changed compared to a previous image or a reference image, and providing only coordinate information for the corresponding part, not image information. Also, when decompressing, decompression is performed using only the corresponding coordinate information. Therefore, in order to implement the current image, information on the previous image frame and the reference image frame is absolutely necessary. A series of frames before a new reference image frame is generated around the reference image frame is called a GOP. The GOP includes an intra (I: intra) frame, a predicted (P: predicted) frame, and a bidirectional (B: bidirectional) frame as a reference video frame. Here, the intra (I) frame is an independent frame that is compressed without referring to previous frames as a key frame, and has the best picture quality and the largest capacity. A prediction (P) frame is a frame constructed based on information on a previous intra (I) frame or a previous prediction (P) frame, and has an intermediate image quality and capacity. The prediction (P) frame compresses only the changed contents with reference to the previous intra (I) frame or the previous prediction (P) frame. The intra (I) frame and the prediction (P) frame are used as reference frames for the following other frames. In addition, the bidirectional (B) frame has the lowest picture quality and capacity, and for compression, front and rear reference frames, that is, an intra (I) frame and a prediction (P) frame are required. A video compression method using a temporal model is necessarily configured in GOP units to handle random access. In general, the GOP does not exceed several seconds, and there are many cases in which the GOP is configured in units of 0.5 seconds for agile reproduction. In addition, each GOP can be regarded as a separate and independent image, since previous data should not be required for random access.

When the buffering of the GOP digital compressed video signal in the buffering unit 110 is completed, the decoder allocating unit 120 finds the idle software decoder 210 from the decoder list in the decoder pool 200 and finds the buffered GOP digital video signal. Allocate a compressed video signal. However, when all idle software decoders 210 in the decoder pool 200 are in operation, a new software decoder 220 is created, and a digital compressed video signal of a buffered GOP amount is allocated to the new software decoder 220 . Here, when the idle software decoder 210 completes the corresponding decoding operation, the decoder allocator 120 first allocates the digital compressed video signal buffered in the idle software decoder 210 and then the GOP amount.

An idle software decoder 210 or/and a new software decoder 220 in the decoder pool 200 decodes the buffered GOP amount of the digitally compressed video signal. Here, each of the software decoders 210 and 220 may have different decoding completion times according to the characteristics of the data to be decoded.

The sorting module 300 receives the digital video signals of the GOP amount decoded from the idle software decoder 210 or/and the new software decoder 220 and arranges them in order. In this case, the alignment module 300 drops a frame according to rendering performance and then transfers a digital video signal to a renderer (not shown).

2 to 4 are diagrams for explaining 4x decoding by a decoding apparatus according to an embodiment of the present invention.

Referring to FIG. 2 , the host module 100 buffers 30 frames of a GOP digital compressed video signal received at 120 frames per second for 4x reproduction for 0-1 seconds. When the 0-1 buffering (30 frames of GOP amount) is completed, the 0-1 buffering signal is allocated to the idle software decoder 210 in the decoder pool 200 to be decoded. For the 0-2th buffering signal, since the idle software decoder 210 is currently operating, the first new software decoder 221 is generated and the 0-2th buffering signal is allocated. For the 0-3 buffering signal and the 0-4 buffering signal, since all the software decoders 210 and 221 are being decoded, a second new software decoder 222 and a third new software decoder 223 are generated, respectively, and The 0-3 buffering signal and the 0-4th buffering signal are allocated and decoded.

Referring to FIG. 3 , decoding of the idle software decoder 210 and the first new software decoder 221 is completed, and the decoded 0-1 buffering signal and 0-2 buffering signal are transmitted to the alignment module 300 . do. Here, the second new software decoder 222 and the third new software decoder 223 are decoding. Accordingly, the host module 100 allocates the 1-1 buffering signal and the 1-2 buffering signal to the idle software decoder 210 and the first new software decoder 221, which have been decoded, to be decoded. For the 1-3 and 1-4 buffering signals, since all the software decoders 210, 221, 222, 223 are being decoded, a fourth new software decoder 224 and a fifth new software decoder 225 are generated, , to be decoded by allocating the 1-3 and 1-4 buffering signals to the fourth new software decoder 224 and the fifth new software decoder 225 .

Referring to FIG. 4 , in chronological order, a second new software decoder 222 , a third new software decoder 223 , an idle software decoder 210 , a first new software decoder 221 , and a fourth new software decoder 224 . ) and the fifth new software decoder 225 is completed decoding, the decoded 0-3 buffering signal, 0-4 buffering signal, 1-1 buffering signal to 1-4 buffering signal are arranged in the alignment module 300 ) is sent to The host module 100 is configured to provide the decoding-completed idle software decoder 210 , the first new software decoder 221 , the second new software decoder 222 , and the third new software decoder 223 , 2-1 to second -4 Allocate a buffering signal to be decoded. In the case of FIG. 4, since all the software decoders 210 and 221-225 are in an idle state, all of the buffering signals (No. 2-1 to No. 2-4 buffering signals) of 30 frames of GOPs per second are allotted without creating a new decoder. can do.

2 to 4 , the sorting module 300 sorts the decoded digital video signals in order and outputs them to the renderer.

5 is a flowchart illustrating an operation of a decoding method according to an embodiment of the present invention. The decoding method according to the present invention may be performed in the decoding apparatus 10 with the help of peripheral components as shown in FIG. 1 . In the following description, descriptions of parts overlapping with those of FIGS. 1 to 4 will be omitted.

Referring to FIG. 5 , the decoding apparatus 10 performs a step of buffering an input digital video compressed signal ( S501 ). Here, the digital video compression signal is buffered in units of a group of pictures (GOP).

Thereafter, the decoding apparatus 10 performs buffering to determine whether buffering is completed in units of GOPs ( S503 ).

When the buffering is completed in units of GOPs, the decoding device 10 determines whether an idle software decoder exists in the decoder pool ( S505 ). Allocating step (S507) is performed.

However, when all software decoders in the decoder pool are in operation, the decoding device 10 generates a new software decoder in the decoder pool ( S509 ) to allocate a buffering signal to the new software decoder.

The decoding apparatus 10 repeats the above operations S501 to S509 to allocate the input digital video compressed signals to the software decoder.

The decoding apparatus 10 performs a control step (S511) of the idle software decoder and/or the new software decoder to perform decoding.

The decoding apparatus 10 receives the decoded digital video signal (S513), and sequentially arranges the decoded digital video signal (S515). Here, the decoding apparatus 10 performs a step (S517) of dropping an arbitrary frame according to the rendering performance.

Thereafter, the decoding device 10 performs a step (S519) of determining whether there is an undecoded GOP unit digital video compressed signal, and if there is an undecoded GOP unit digital video compressed signal, returns to S511 to perform decoding and, if there is no GOP-unit digital video compression signal that has not been decoded, a step (S521) of delivering the frame-dropped digital video signal to the renderer is performed.

In the conventional case, high-speed reproduction of moving image information has been performed without reference to the GOP configuration characteristics inside the image. Therefore, there has been a limitation in improving the high speed, and in order to reproduce at a high speed of 4X or higher, it has shown an unreasonable characteristic of only reproducing an intra frame. However, in the present embodiment, since the user sees a seamless screen even at high-speed reproduction of 4x speed or 8x speed or higher, more efficient post-analysis can be performed.

The various embodiments of the present invention do not limit the scope of the present invention in any way. For brevity of the specification, descriptions of conventional electronic components, control systems, software, and other functional aspects of the systems may be omitted. In addition, the connection or connection members of lines between the components shown in the drawings are illustrative of functional connections and/or physical or circuit connections, and in an actual device, various functional connections and physical connections that are replaceable or additional , or circuit connections. In addition, unless there is a specific reference such as "essential", "importantly", etc., it may not be a necessary component for the practice of the present invention.

In the specification of the present invention (especially in the claims), the use of the term "above" and similar referential terms may be used in both the singular and the plural. In addition, when a range is described in the present invention, each individual value constituting the range is described in the detailed description of the invention as including the invention to which individual values belonging to the range are applied (unless there is a description to the contrary). same as

The steps constituting the method according to the present invention may be performed in an appropriate order, unless there is an explicit order or description to the contrary. The present invention is not necessarily limited to the order in which the steps are described. The use of all examples or exemplary terms (eg, etc.) in the present invention is merely for the purpose of describing the present invention in detail, and unless defined by the claims, the scope of the present invention is limited by the examples or exemplary terminology. it's not going to be In addition, those skilled in the art will recognize that various modifications, combinations, and changes may be made in accordance with design conditions and factors within the scope of the appended claims or their equivalents.

Therefore, the spirit of the present invention should not be limited to the above-described embodiments, and the scope of the spirit of the present invention is not limited to the scope of the scope of the present invention. will be said to belong to

100: host module
110: buffering unit
120: decoder allocator
200: decoder pool
210: idle software decoder
220-225: New software decoder
300: sort module

Claims (6)

delete delete delete A method of decoding a video signal at high speed including a decoder pool comprising at least one software decoder, the method comprising:
sequentially buffering n groups of pictures (GOPs) of the digital video signal for reproduction at n times per second;
allocating the buffered n GOPs to n software decoders in the decoder pool in order, respectively;
arranging n GOPs that have been decoded in order in the decoder pool; and
After arranging the n GOPs on which the decoding is completed, dropping frames according to rendering performance and delivering them to the renderer;
The n software decoders include an idle software decoder and a new software decoder generated when all of the idle software decoders are running,
Allocating the n GOPs to decoders comprises:
If the number of idle software decoders for decoding the n first GOPs is less than n, create a new software decoder and allocate the n first GOPs,
Decoding method, characterized in that when the number of decoded software decoders is less than n among the n software decoders to which the n first GOPs are allocated, a new software decoder is created and n second GOPs are allocated. delete delete

Images