KR101930389B1 - Video File Compression Method, Device and Computer Program Thereof - Google Patents

Abstract

The present invention relates to a moving image compression method, apparatus, and computer program for the same, and more particularly to a moving image compression method, apparatus, and computer program for the same which minimizes deterioration of image quality with respect to an original moving picture regardless of a codec of the moving image, And a computer program for the same.

Description

[0001] The present invention relates to a video compression method, a device and a computer program for the same,

The present invention relates to a moving image compression method, apparatus, and computer program for the same, and more particularly to a moving image compression method, apparatus, and computer program for the same which minimizes deterioration of image quality with respect to an original moving picture regardless of a codec of the moving image, And a computer program for the same.

In modern times, computer and computer networks are bringing massive amounts of information between computers and computers, and between computers and storage devices. When a computer is accessed by a local storage device such as a local hard drive or a local floppy drive, a huge amount of data is accessed quickly. However, when accessing data from a remote storage location over a wide area network (WAN), the Internet, or a wireless communication channel (such as a cellular phone network), the data transfer rate is significantly reduced. Therefore, it takes a lot of time to deliver large files. In addition, storing large files requires expensive and limited storage space. Generally, a moving image is regarded as large-capacity files because it requires information about each pixel in an image of a frame constituting a moving image.

Therefore, a typical moving picture file requires storage space of several tens of MBytes or more, and a considerable transmission time is required through a communication network having a low data rate. Thus, in recent years, a number of protocols and standards have been developed that compress images to reduce the amount of storage space required to store the video and to give the transmission time.

Generally, an image compression technique is divided into a lossy compression method and a lossless compression method. This compression technique compresses an image by eliminating spatial, temporal, and stochastic redundancies. Particularly, although the lossy compression method causes deterioration due to loss of original data to some extent, the lossless compression method can accurately reproduce the original image after decoding.

Korean Patent No. 10-1517019 'Adaptive image compression method using block characteristics and its system' (published Dec. 18, 2014)

It is an object of the present invention to provide a moving image compression method and apparatus capable of maintaining a codec as it is and providing a compressed moving image with a high compression ratio while minimizing image quality deterioration with respect to an original moving image regardless of a codec of the moving image, .

According to an aspect of the present invention,

1. A moving image compression method performed in a computing device including at least one processor and a main memory that stores instructions executable by the processor, the method comprising: a frame type determination step of determining whether a compression target frame of the moving image is an independently encoded frame; And a frame compression step of generating a compressed frame by distinguishing a case where the compression object frame is an independently encoded frame and a case where the compression object frame is not an independently encoded one.

In the present invention, the frame compressing step includes a process target image area setting step of setting a process target image area of the compression target frame; And a compressed frame generation step of generating a compressed frame in which a part or the whole of the image area to be processed is transformed, wherein, in the case where the compression object frame is an independently encoded frame, The entirety of the target frame is set as the process target image area, and if the compression target frame is not an independently encoded frame, a part of the compression target frame may be set as the process target image area.

In the present invention, the processing target image region setting step may include dividing the compression target frame into a plurality of image blocks according to a predetermined criterion, and when the compression target frame is not an independently encoded frame, And may set an image block of a part of the plurality of image blocks as the image area to be processed.

In the present invention, in the case where the compression target frame is not an independently encoded frame, the process of setting the image area to be processed may include setting at least one of a previous frame, a subsequent frame, A portion having a change in the portion of the compression target frame can be set as the processing target image region.

In the present invention, the compressed frame generation step includes a first compressed frame generation step, wherein the first compressed frame generation step includes a step of generating an image for calculating an image complexity with respect to a plurality of sub- Calculating a complexity; An image complexity determination step of determining whether the complexity of the detail area is less than a preset reference value; And a complexity-based image processing step of performing a first image processing on the detailed area when the complexity of the detailed area is less than a predetermined reference, wherein the step of processing the complexity- The compressed frame can be generated from the frame containing the compressed frame.

In the present invention, the first compressed frame generation step may generate the compressed frame from a frame in which lossy compression is performed on a frame including the processing target image area in which the complexity-based image processing step has been performed.

In the present invention, the first image processing may be Blur processing.

In the present invention, the compressed frame generation step includes a second compressed frame generation step, and the second compressed frame generation step generates a first spare frame by performing a second image processing on the image area to be processed A whole image processing step; And an Edge combining step of generating a second preliminary frame by combining an edge part of an image of the original image data of the compression target frame with respect to the first preliminary frame, Can be generated.

In the present invention, the compressed frame can be generated from a frame in which lossy compression is performed on the second spare frame.

In the present invention, the second image processing may be Blur processing.

In the present invention, the compressed frame generation step may include: a first compressed frame generation step of generating a first compressed frame; A second compressed frame generation step of generating a second compressed frame in a manner different from the first compressed frame generation step; And a compressed frame selecting step of selecting one of the first and second compressed frame groups as the compressed frame.

In the present invention, the first compressed frame generation step may include: an image complexity calculation step of calculating an image complexity with respect to a plurality of sub-areas constituting the image area to be processed; An image complexity determination step of determining whether the complexity of the detail area is less than a preset reference value; And a complexity-based image processing step of performing a first image processing on the detailed area when the complexity of the detailed area is less than a predetermined reference, wherein the step of processing the complexity- The first compressed frame may be generated from the frame containing the first compressed frame.

In the present invention, the second compressed frame generation step may include: a whole image processing step of performing a second image processing on the image area to be processed to generate a first spare frame; And an Edge combining step of generating a second preliminary frame by combining an edge part of an image of the original image data of the compression target frame with respect to the first preliminary frame, Frame can be generated.

In the present invention, the first compressed frame generation step may include: an image complexity calculation step of calculating an image complexity with respect to a plurality of sub-areas constituting the image area to be processed; An image complexity determination step of determining whether the complexity of the detail area is less than a preset reference value; And a complexity-based image processing step of performing a first image processing on the detailed area when the complexity of the detailed area is less than a predetermined reference, wherein the step of processing the complexity- Generating the first compressed frame from the frame including the first image frame, and the second compressed frame generating step includes: a whole image processing step of performing a second image processing on the image area to be processed to generate a first spare frame; And an Edge combining step of generating a second preliminary frame by combining an edge part of an image of the original image data of the compression target frame with respect to the first preliminary frame, Frame can be generated.

According to an aspect of the present invention, there is provided a computer program stored in a computer-readable medium including a plurality of instructions executed by one or more processors, the computer program comprising: A frame type determination command for determining whether the frame is an encoded frame; And a frame compression instruction to generate a compressed frame by distinguishing a case where the compression object frame is an independently encoded frame and a case where the compression object frame is not an independently encoded one.

In the present invention, the frame compression command may include: a processing target image area setting command for setting a processing target image area of the compression target frame; And a compressed frame generation command for generating a compressed frame in which a part or the whole of the image area to be processed is transformed, wherein the processing target image area setting command includes: The entirety of the target frame is set as the process target image area, and if the compression target frame is not an independently encoded frame, a part of the compression target frame may be set as the process target image area.

In the present invention, the processing target image area setting command divides the compression target frame into a plurality of image blocks according to a preset reference, and when the compression target frame is not a frame that is independently encoded, And may set an image block of a part of the plurality of image blocks as the image area to be processed.

In the present invention, when the compression target frame is not a frame in which the compression target frame is not an independently encoded frame, the processing target image area setting command may include at least one of a previous frame, a subsequent frame, A portion having a change in the portion of the compression target frame can be set as the processing target image region.

In the present invention, the compressed frame generation command includes a first compressed frame generation command, and the first compressed frame generation step includes a step of generating an image for calculating an image complexity with respect to a plurality of sub- Complexity calculation command; An image complexity determining command for determining whether the complexity of the detail area is less than a preset reference; And a complexity reference image processing instruction for performing a first image processing on the detail area when the complexity of the detail area is less than or equal to a preset reference, The compressed frame can be generated from the frame containing the compressed frame.

In the present invention, the compressed frame generation command includes a second compressed frame generation command, and the second compressed frame generation command generates a first spare frame by performing a second image processing on the processing target image area Full image processing instruction; And an edge combination processing instruction for generating a second preliminary frame by combining an edge portion of an image of the original image data of the compression target frame with respect to the first preliminary frame, Can be generated.

In the present invention, the compressed frame generation command may include: a first compressed frame generation command for generating a first compressed frame; A second compressed frame generation command for generating a second compressed frame in a manner different from the first compressed frame generation command; And a compressed frame selection instruction for causing the compressed frame to be one of the first frame group and the second frame group including the first compressed frame and the second compressed frame.

According to an embodiment of the present invention, an effect of compressing a moving image with minimized deterioration of image quality while maintaining the resolution of the original moving image can be exhibited.

According to an embodiment of the present invention, it is possible to maintain the codec as it is while minimizing deterioration of picture quality with respect to the original moving picture, regardless of the codec of the moving picture, and to provide a compressed moving picture with a high compression rate.

According to an embodiment of the present invention, a preprocessing process is performed on a moving image, so that it is possible to perform a moving image compression while using an existing encoder as it is.

According to an embodiment of the present invention, the Wavelet transform and the Lossy Video Codec used in H.265, which is a discrete cosine transform (H.264) transform and a next generation video codec, The effect can be achieved.

1 is a schematic view illustrating an internal structure of a moving picture compression apparatus according to an embodiment of the present invention.
Fig. 2 is a view schematically showing examples of frames of moving pictures.
3 is a diagram schematically illustrating examples of image blocks according to an embodiment of the present invention.
4 is a diagram schematically showing an example of a plurality of frames for explaining the operation of the change block determination unit according to an embodiment of the present invention.
FIG. 5 is a diagram schematically illustrating an internal structure of a first frame converter according to an embodiment of the present invention. Referring to FIG.
6 is a diagram schematically illustrating an internal structure of a complexity determination unit according to an embodiment of the present invention.
7 is a diagram schematically showing an example of a transform frame to be transformed according to the first frame transform unit according to an embodiment of the present invention.
8 is a diagram schematically illustrating an internal structure of a second frame conversion unit according to an embodiment of the present invention.
9 is a diagram schematically showing an example of a transform frame to be transformed according to a second frame transform unit according to an embodiment of the present invention.
FIG. 10 is a view schematically showing detailed steps of a moving image compression method according to an embodiment of the present invention.
11 is a view schematically showing detailed steps of a frame compression step according to an embodiment of the present invention.
12 is a diagram schematically illustrating embodiments of a compressed frame generation step according to an embodiment of the present invention.
13 is a diagram schematically illustrating a detailed step of a first compressed frame generation step according to an embodiment of the present invention.
FIG. 14 is a view schematically showing sub-steps of a second compressed frame generation step according to an embodiment of the present invention.
FIG. 15 is a view schematically showing detailed steps of a moving image compression method according to an embodiment of the present invention.
FIG. 16 is a view schematically showing a step of setting an image block to be processed according to an embodiment of the present invention.
17 is a diagram schematically showing detailed steps of a first frame conversion method according to an embodiment of the present invention.
18 is a view schematically showing the detailed steps of a second frame conversion method according to an embodiment of the present invention.
Figure 19 illustrates a brief, general schematic diagram of an exemplary computing environment in which embodiments of the invention may be implemented.

Various embodiments are now described with reference to the drawings, wherein like reference numerals are used throughout the drawings to refer to like elements. In this specification, various explanations are given in order to provide an understanding of the present invention. It will be apparent, however, that such embodiments may be practiced without these specific details. In other instances, well-known structures and devices are provided in block diagram form in order to facilitate describing the embodiments.

The terms "component," " module, "" system, " " and the like, used herein, refer to a computer-related entity, hardware, firmware, software, combination of software and hardware, For example, a component may be, but is not limited to, a process executing on a processor, a processor, an object, an executing thread, a program, and / or a computer. For example, both an application running on a computing device and a computing device may be a component. One or more components may reside within a processor and / or thread of execution,

Or may be distributed among two or more computers.

As used herein, the terms "an embodiment," "an embodiment," " an embodiment, "" an embodiment ", etc. are intended to indicate that any aspect or design described is better or worse than other aspects or designs. .

In addition, the term "or" is intended to mean " exclusive or " That is, it is intended to mean one of the natural inclusive substitutions "X uses A or B ", unless otherwise specified or unclear in context. That is, X uses A; X uses B; Or when X uses both A and B, "X uses A or B" can be applied to either of these cases. It should also be understood that the term "and / or" as used herein refers to and includes all possible combinations of one or more of the listed related items.

It is also to be understood that the term " comprises "and / or" comprising " means that the feature and / or component is present, but does not exclude the presence or addition of one or more other features, components and / It should be understood that it does not.

It is also to be understood that the singular forms "a" and "an" above, which do not expressly state otherwise in this specification, include plural representations. Thus, in one example, a " component surface " includes one or more component surfaces.

Also, terms including ordinal numbers such as first, second, etc. may be used to describe various elements, but the elements are not limited to these terms. The terms are used only for the purpose of distinguishing one component from another. For example, without departing from the scope of the present invention, the first component may be referred to as a second component, and similarly, the second component may also be referred to as a first component. And / or < / RTI > includes any combination of a plurality of related listed items or any of a plurality of related listed items.

In the present specification, the " previous " frame means not only the previous frame but also one of a plurality of frames existing before the corresponding frame. The " after " frame means not only the next frame, ≪ / RTI >

Also, the terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. The singular expressions include plural expressions unless the context clearly dictates otherwise. In this specification, the terms "comprises" or "having" and the like refer to the presence of stated features, integers, steps, operations, elements, components, or combinations thereof, But do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, or combinations thereof.

The description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features presented herein.

1 is a schematic view illustrating an internal structure of a moving picture compression apparatus 1000 according to an embodiment of the present invention.

The moving picture compression apparatus 1000 shown in FIG. 1 includes a frame type determination unit 100 for determining whether a compression target frame of a moving picture is an independently encoded frame; A block division unit (200) for dividing the compression target frame into a plurality of image blocks according to a preset reference; A change block determination unit (300) that determines a portion or an image block in which a portion of the compression target frame has a change compared with at least one of a previous frame, a subsequent frame, and a plurality of previous frames of the compression target frame, ; A control unit 400 for controlling functions of internal components of the moving picture compression apparatus 1000; A first frame conversion unit (500) for generating a first conversion frame in which a part or all of the image area to be processed of the compression target frame is converted according to the first method; A second frame conversion unit 600 for generating a second conversion frame in which a part or the whole of the image area to be processed of the compression object frame is converted according to a second method different from the first method; A frame compression unit (700) for performing compression on at least one of the first conversion frame and the second conversion frame; And a frame comparing unit 800 for comparing two or more compressed frames or the converted frames compressed by the frame compressing unit 700 to set a frame having a small capacity as a final compressed frame.

The frame type determination unit 100 determines whether the compression target frame of the moving image is an independently encoded frame. In one embodiment of the present invention, a compressed frame is generated by dividing a case where the compression object frame is an independently encoded frame and a case where the compression object frame is not an independently encoded one.

Specifically, the processing target image region of the compression target frame is set differently according to the type of the frame determined by the frame type determination unit 100, and the first frame conversion unit 500 converts the image to be processed, And the second frame conversion unit 600 may process the image data to compress the entire capacity of the compression target frame.

Fig. 2 is a view schematically showing examples of frames of moving pictures.

The video portion of a typical video is divided into an I frame (a frame shown as "I" in FIG. 2), a P frame (a frame shown as "P" in FIG. 2), and a B frame ).

An I frame is a key frame that includes all of the entire image, can function as an access point in a moving picture file, corresponds to an independently encoded frame, and has a low compression ratio.

On the other hand, in the case of a P frame, a frame generated by forward prediction referring to a previous I frame or a P frame does not correspond to an independently encoded frame. Such a P frame has a higher compression ratio than an I frame.

In the present specification, the " previous " frame means not only the previous frame but also one of a plurality of frames existing before the corresponding frame. The " after " frame means not only the next frame, ≪ / RTI >

On the other hand, in the case of the B frame, a frame generated by forward and backward prediction referring to a previous frame and a subsequent frame does not correspond to an independently encoded frame. Such a B frame has a higher compression ratio than I and P frames. Therefore, the independently encoded frame corresponds to an I frame, and a frame that is independently encoded may correspond to the remaining B frame or P frame.

The moving picture compressing apparatus 1000 and the moving picture compressing method according to the present invention can be applied to a discrete cosine transform (DCT) conversion of H.264, a wavelet transform and a lossy video codec (H.264) ).

Fig. 1 (A) shows moving picture frames composed of I frame and P frame only. FIG. 1B shows frames of moving pictures composed of an I frame, a P frame, and a B frame. 1 (C) shows frames of moving pictures in which I, P, and B frames are regularly shown. The moving picture compressing apparatus 1000 and the moving picture compressing method of the present invention can be applied to all moving pictures including such frames.

Referring again to FIG. 1, the block division unit 200 divides the compression target frame into a plurality of image blocks according to a preset reference.

In an embodiment of the present invention, when the frame to be compressed is a frame that is encoded independently, the frame is compressed by performing image processing only on a part of the frame rather than compressing the frame by performing image processing on the entire frame . Here, an image block divided by the block dividing unit 200 may be used to specify a part of a frame.

More specifically, the compression target frame is divided into a plurality of image blocks by the block division unit 200. When the compression target frame is a frame that is encoded independently, only a part of the image blocks are processed, .

The block division unit 200 may generate a block frame in which the compression target frame is divided into a plurality of image blocks.

3 is a diagram schematically illustrating examples of image blocks according to an embodiment of the present invention.

FIG. 3A shows an example of dividing a compression object frame into 2x2 image blocks, FIG. 3B shows an example of dividing a compression object frame into 4x4 image blocks, FIG. FIG. 3C shows an example in which a compression target frame is divided into 8 × 8 image blocks.

The method of dividing the image block according to the present invention is not limited to the above-described FIG. 3, but may be variously configured. In addition, the image block of the compression object frame divided by the block division unit 200 may be set as a different reference for each region without forming an image.

Referring back to FIG. 1, the change block discriminator 300 compares a previous frame, a following frame, and a plurality of previous frames of the compression target frame with one or more of accumulated frames, Or image block.

Preferably, the change block determination unit 300 determines that a change occurs among a plurality of image blocks constituting the compression target frame when the compression target frame is a frame in which the compression target frame is a non-independently encoded frame, for example, a P frame or a B frame And determines an image block to be processed.

Preferably, when the compression target frame is a P frame, an image obtained by accumulating the previous closest I frame and the frames following the nearest I frame (P frame or B frame) is compared with the compression target frame , An image block including a changed part or a changed part is set as a processing target image area. Alternatively, the processing target image area may be set in comparison with the previous nearest I frame.

For example, when the frame is composed of " IPPPPP " and the compression target frame is the last P frame, the image obtained by accumulating the " IPPPP " frame is compared with the last P frame, Or an image block including a part having a change is set as a processing object image area.

Preferably, when the compression target frame is a B frame, an image obtained by accumulating the previous closest I frame and the frames following the nearest I frame (P frame or B frame), and the next most adjacent I frame And the compression target frame, and sets an image block including the changed portion or the changed portion as the processing target image region.

Alternatively, when the compression target frame is a B frame, the previous nearest I frame and the next nearest I frame are compared with the compression target frame, and the image block including the changed portion or the changed portion And sets it as a processing target image area.

For example, if the frame is composed of " I1 P1 P2 P3 P4 P5 P6 P7 B P8 I2 ", and the frame to be compressed is the last B frame, an image obtained by accumulating " I2 P1 P2 P3 P4 P5 P6 P7 " I2 frame and the B frame as the compression target frame to set the image block including the changed portion or the changed portion as the processing target image region.

Alternatively, the I1 frame and the I2 frame are compared with the B frame as the compression target frame to set the image block including the changed portion or the changed portion as the processing target image region.

In the above description, the image block is used to set the image area to be processed. However, the present invention is not limited to this, and includes various aspects of various methods for specifying a certain area of a frame.

4 is a diagram schematically showing an example of a plurality of frames for explaining the operation of the change block discriminator 300 according to an embodiment of the present invention.

4 shows an example of dividing a compression target frame of a moving picture into 3x3 image blocks and discriminating changed blocks among 9 blocks.

FIG. 4A corresponds to an I frame, FIG. 4B corresponds to a P frame, and FIG. 4C corresponds to a P frame.

According to one embodiment of the present invention, in the case of (A) of Fig. 4, all of the nine image blocks are set as the image area to be processed.

On the other hand, in the case of FIG. 4B, the image area to be processed includes (2, 2) image blocks and (2, 3) image blocks.

On the other hand, in the case of FIG. 4C, the image area to be processed is set to (2, 2) image blocks and (2, 3) image blocks.

As described above, in the present invention, when the method of setting the image area to be processed differs according to the frame type of the compression target frame and the compression target frame is a frame that is encoded independently of each other, Setting. On the other hand, the image area to be processed may be set by the above-described image block, or only a certain area of the frame may be set.

5 is a diagram schematically showing the internal structure of a first frame transform unit 500 according to an embodiment of the present invention.

The first frame conversion unit 500 generates a first conversion frame in which a part or the whole of the image area to be processed of the compression object frame is converted according to the first method.

In the preferred embodiment of the present invention, the frame transformed by the first frame transform unit 500 and the frame transformed by the second frame transform unit, which will be described later, are compressed, However, the present invention is not limited to this, and a frame obtained by compressing the first transform frame or the first transform frame may be a final compressed frame. Where compression is preferably lossy compression.

5, the first frame converter 500 calculates the complexity of the image blocks or sub-areas constituting the image area to be processed, and determines whether the complexity of the image blocks or the sub- A complexity determining unit (510) for determining whether the amount of the input signal is less than a predetermined value; And a first image processor 520 for performing a first image process on the image block or the corresponding detail area when the complexity of the image block or detail area is less than a preset reference.

Here, it is preferable that the first image processing is Blur processing corresponding to blurring processing. Blurring refers to image processing using a method of eliminating high frequency components to make the image look smooth. The low frequency refers to a frequency at which the rate of change of the pixel value is small, and the high frequency refers to a frequency at which the rate of change of the pixel value is large. Removing the high-frequency component from the image reduces the rate of change of the pixel value, so that the extreme values for the neighboring pixels are reduced and the image is smoothly processed. Therefore, it is possible to correct the image by weakening the noticeable noise such as fine noise or dullness appearing in the image through the blurring process.

The first image processing unit 520 may extract the luminance values of the pixels for each of the image blocks or sub-areas having low complexity, and perform blurring processing by assigning weights according to the luminance values. In the present invention, gaussian blurring, which is generally used, can be applied to the blurring process.

6 is a diagram schematically illustrating an internal structure of a complexity determination unit 510 according to an embodiment of the present invention.

The complexity determining unit 510 calculates the image complexity of the image block included in the image area to be processed or the detail area included in the image area to be processed, respectively. The degree of complexity (image complexity) of an image herein refers to the degree to which an image changes, and the manner in which it is determined will be described later.

The complexity determination unit 510 may include at least one of a pixel value determination unit 511, a color number determination unit 512, and a quantization determination unit 513. Meanwhile, the complexity determining unit 510 may determine the complexity using one of the pixel value determining unit 511, the color number determining unit 512, and the quantization determining unit 513, The complexity can also be determined.

The pixel value determination unit 511 converts the gray level of each of the image blocks constituting the processing target image area or the detailed area constituting the processing target image area into a gray image, And the image complexity is calculated. Here, the gray image means an image expressed by brightness information, that is, information about brightness and darkness. Normally, the gray level representing the gray image has 2 ⁸ (= 256) levels. The closer the gray level is to 0, the darker it becomes, and the closer to 255 the brighter the image becomes.

The pixel value determination unit 511 determines a difference (differential value) between the pixel value of the image block constituting the processing target image area converted into the gray image or the pixel value of each pixel of the detailed area constituting the processing target image area Thereafter, it is possible to calculate the amount of change calculated by the average of the differences of the pixel values, and determine whether or not the amount of change is equal to or greater than a predetermined value.

The high average value of the differential values means that the image complexity of a portion corresponding to the image block constituting the processing target image region converted to the gray image or the detail region constituting the processing target image region is high. If the change amount is greater than or equal to a predetermined value, the pixel value determination unit 511 determines whether the image block included in the image block, which is converted into the gray image, The complexity is high. On the contrary, when the value is less than the predetermined value, it is determined that the image complexity is low.

The color number determination unit 512 calculates the image complexity by measuring the number of colors for each of the image blocks constituting the image region to be processed or the detail region constituting the image region to be processed. In particular, the color number determination unit 512 determines whether the number of colors for each of the image blocks constituting the image region to be processed or the detail region constituting the image region to be processed is greater than or equal to a predetermined number of colors, Can be calculated. At this time, if the color number is greater than or equal to the predetermined reference color number Nc_standard for the image block constituting the image area to be processed or the detail area constituting the image area to be processed The image complexity is high. On the contrary, when the number of colors is less than or equal to the predetermined reference color number Nc_standard, it is determined that the image complexity is low.

The quantization determination unit 513 quantizes each of the image blocks constituting the processing target image region or the detail region constituting the processing target image region on the basis of a predetermined quantization level, and quantizes the quantized values based on the corresponding histogram The overall distribution of the quantization level is measured and the image complexity is calculated. To this end, the quantization determination unit 513 quantizes each of the image blocks included in the image region to be processed or each of the sub-regions constituting the image region to be processed to generate a quantized image. When quantizing, the integer values 0, 1, 2, ... , 2n-1, and 2n-1, respectively, constituting each of the pixel values constituting the image block constituting the processing target image area or each of the detailed areas constituting the processing target image area.

The quantization classification value is based on the median on the histogram. For example, in the case of quaternary quantization, it is assumed that the histogram values are based on 25%, 50%, and 75%. On the other hand, the histogram is a graph showing the frequency distribution, and is a columnar shape in which the distribution characteristics of the observed data are seen at a glance. The histogram may also be referred to as a column graph or a picture shape picture. At this time, each quantization level is displayed on the horizontal axis of the histogram so as to appear at a predetermined interval, and the vertical axis shows the frequency of pixels (hereinafter referred to as the number of pixels) at each quantization level with a predetermined interval. That is, the histogram is represented by columns having a height proportional to the number of pixels in the corresponding interval in each interval between the quantization levels.

The quantization determination unit 513 analyzes the histogram indicating the result of performing quantization on each of the image blocks constituting the image area to be processed or the sub-area constituting the image area to be processed to obtain an average value of the quantization levels, The image complexity can be calculated by determining whether or not the number of pixels out of the predetermined range to which the average value of the quantization levels belongs (out of the average value of the quantization levels) is equal to or greater than a predetermined number.

Illustratively, the quantization determination unit 513 determines a quantization level of a pixel that deviates from an average value in the histogram indicating the result of quantization of each of the image blocks constituting the image region to be processed or the detail region constituting the image region to be processed It can be determined that the image complexity is high.

Whether or not the image complexity is low can be determined according to the image complexity determined by the pixel value determining unit 511, the color number determining unit 512, and the quantization determining unit 513 described above , And in some cases may be determined by combining image complexity judged by two or more.

7 is a diagram schematically illustrating an example of a transform frame to be transformed according to the first frame transform unit 500 according to an embodiment of the present invention.

The image blocks 1 to 9 shown in FIG. 7 (A) constitute an image area to be processed. The complexity determination unit 510 determines the complexity of each image block by at least one of the pixel value determination unit 511, the color number determination unit 512, and the quantization determination unit 513 .

Then, the first image processing unit 520 performs the first image processing on the image blocks determined to be low in complexity according to the complexity determination unit 510 and the predetermined criteria. Preferably, the first image processing corresponds to Blur processing.

FIG. 7B shows a processing target image area processed by the complexity determining unit 510 and the first image processing unit 520. FIG. A frame including the image area to be processed or the image area to be processed that has undergone the above processing becomes the first conversion frame.

As shown in FIG. 7B, it is determined that the complexity of the image blocks 2, 4, and 9 is low, and Blur processing has been performed on the image blocks.

8 is a diagram schematically illustrating an internal structure of a second frame transformer 600 according to an embodiment of the present invention.

The second frame converter 600 generates a first conversion frame in which a part or the whole of the image area to be processed of the compression target frame is converted according to the second method.

In the preferred embodiment of the present invention, the frame transformed by the first frame transform unit 500 and the frame transformed by the second frame transform unit are compressed, However, the present invention is not limited to this, and a frame obtained by compressing the second transform frame or the second transform frame may be a final compressed frame. Where compression is preferably lossy compression.

8, the second frame converter 600 includes a second image processor 610, an edge image generator 620, a binarized image generator 630, and an image synthesizer 640, .

The second image processing unit 610 performs the second image processing on the image area to be processed. Preferably, the second image processing is Blur processing.

The edge image generation unit 620 generates an edge image by calculating an edge, which is an edge area corresponding to a high frequency area, with respect to the image area to be processed. Thereafter, the binarized image generating unit 630 binarizes the generated edge image to generate a binarized image. At this time, the binarization image generation unit 630 performs binarization by changing the pixel value of each pixel of the edge image generated by the edge image generation unit 620 to 0 (black) or 1 (white) to generate a binarized image .

Thereafter, the image synthesizing unit 640 synthesizes an original image of a target image area corresponding to a pixel having a value of 0 in the edge image generated by the binarized image generating unit 630 by the second image processor 610 To the processed image area having the second image processed, and finally generates the second converted image.

9 is a diagram schematically illustrating an example of a transform frame to be transformed according to the second frame transform unit 600 according to an embodiment of the present invention.

The image blocks 1 to 9 shown in FIG. 9 (A) constitute an image area to be processed.

FIG. 9B shows a processing target image area in which a second image processing, preferably a blur processing, is performed by the second image processing unit 610. FIG.

FIG. 9C shows an edge image of the image area to be processed shown in FIG. 9A, which is generated by the edge image generator 620.

9 (D) shows the original image of the edge portion extracted based on the edge image information in Fig. 9 (C), and the image in Fig. 9 (A) And a second transform frame generated by combining with the image area to be processed in which the second image processing is performed.

Referring again to FIG. 1, the frame compressing unit 700 compresses the first transform frame and the second transform frame generated as described above. Preferably said compression corresponds to one of loss compression in a known manner. However, in another embodiment of the present invention, such a frame compression unit 700 may be omitted.

Thereafter, the frame comparing unit 800 compares the two or more compressed frames compressed by the frame compressing unit 700 or the converted frames, and sets a frame having a small capacity as a final compressed frame.

Meanwhile, the moving picture compression apparatus 1000 according to another embodiment of the present invention may include only the first frame conversion unit 500 and the frame compression unit 700 selectively. In this case, the frame transformed by the first frame transforming unit 500 may be either a final compressed frame or a lossy compression in a known manner for the frame transformed by the first frame transforming unit 500 And may be a final frame. In this case, the second frame conversion unit 600 and the frame comparison unit 800 may not be provided in the moving picture compression apparatus 1000.

Meanwhile, the moving picture compression apparatus 1000 according to another embodiment of the present invention may include only the second frame conversion unit 600 and the frame compression unit 700 selectively. In this case, the frame transformed by the second frame transformer 600 may be either a final compressed frame or a lossy compression in a known manner for the frame transformed by the second frame transformer 600 And may be a final frame. In this case, the first frame conversion unit 500 and the frame comparison unit 800 may not be provided in the moving picture compression apparatus 1000.

Hereinafter, a moving image compression method according to the present invention will be described. The moving picture compressing method of the present invention can be performed by some or all of the structures included in the moving picture compressing apparatus described with reference to Figs. 1 to 9 and the above description. The moving picture compressing method of the present invention to be described later refers to the contents of the moving picture compressing apparatus described above.

FIG. 10 is a view schematically showing detailed steps of a moving image compression method according to an embodiment of the present invention.

The moving picture compression method is a moving picture compression method performed in a computing device including at least one processor and a main memory storing instructions executable by the processor.

As shown in FIG. 10, the moving picture compression method includes a frame type determination step (S10) of determining whether a compression target frame of a moving picture is an independently encoded frame; And

And a frame compression step (S20) of generating a compressed frame by separating the case where the compression object frame is an independently encoded frame and the case where the compression object frame is not an independently encoded one.

Here, the frame type determination step S10 determines whether the compression target frame of the moving image is an independently encoded frame. In one embodiment of the present invention, a compressed frame is generated by dividing a case where the compression object frame is an independently encoded frame and a case where the compression object frame is not an independently encoded case.

Specifically, the image area to be processed of the compression target frame is set differently according to the type of the frame determined in the frame type determination step (S10), and processing is performed on the data for the image area to be processed, The entire capacity of the frame can be compressed.

Specifically, the type of the frame includes an I frame, a P frame, and a B frame.

An I frame is a key frame that includes all of the entire image, can function as an access point in a moving picture file, corresponds to an independently encoded frame, and has a low compression ratio.

On the other hand, in the case of a P frame, a frame generated by forward prediction referring to a previous I frame or a P frame does not correspond to an independently encoded frame. Such a P frame has a higher compression ratio than an I frame.

In the present specification, the " previous " frame means not only the previous frame but also one of a plurality of frames existing before the corresponding frame. The " after " frame means not only the next frame, ≪ / RTI >

On the other hand, in the case of the B frame, a frame generated by forward and backward prediction referring to a previous frame and a subsequent frame does not correspond to an independently encoded frame. Such a B frame has a higher compression ratio than I and P frames. Therefore, the independently encoded frame corresponds to an I frame, and a frame that is independently encoded may correspond to the remaining B frame or P frame

11 is a view schematically showing detailed steps of a frame compression step according to an embodiment of the present invention.

The frame compression step (S20) includes: a processing target image area setting step (S21) of setting a processing target image area of the compression target frame; And

A compressed frame generation step (S22) of generating a compressed frame in which a part or the whole of the image area to be processed is transformed,

Wherein the processing target image area setting step sets the entire compression target frame as the processing target image area when the compression target frame is an independently encoded frame,

If the compression target frame is not an independently encoded frame, a part of the compression target frame is set as the processing target image area.

Meanwhile, the image area to be processed may be divided into image blocks and processed. Specifically, the processing target image region setting step divides the compression target frame into a plurality of image blocks according to a predetermined criterion, and when the compression target frame is not an independently encoded frame, It is possible to set the image block of some of the plurality of image blocks as the image area to be processed.

Hereinafter, a method of setting an image area to be processed when the compression target frame is not an independently encoded frame, that is, an I frame, or a B frame or a P frame will be described.

The image processing method according to claim 1, wherein, in the case where the compression target frame is not an independently encoded frame, the process of setting the processing target image area is performed by comparing at least one of a previous frame, a following frame, And sets a portion of the portion of the compression target frame that has changed as the processing target image region.

Specifically, in the process of setting the image area to be processed (S21), a change occurs among a plurality of image blocks constituting the compression target frame when the compression subject frame is a frame in which the compression subject frame is an independently encoded frame, for example, a P frame or a B frame And determines an image block to be processed.

Preferably, when the compression target frame is a P frame, a process of setting an image area to be processed (step S21) includes accumulating the previous nearest I frame and the frames (P frame or B frame) next to the nearest I frame Compares one image with the compression target frame, and sets an image block including a changed portion or a changed portion as a processing target image region. Alternatively, the processing target image area may be set in comparison with the previous nearest I frame.

For example, when the frame is composed of " IPPPPP " and the compression target frame is the last P frame, the image obtained by accumulating the " IPPPP " frame is compared with the last P frame, Or an image block including a part having a change is set as a processing object image area.

Preferably, when the compression target frame is a B frame, the process of setting an image area to be processed (step S21) may include accumulating the previous closest I frame and the frames (P frame or B frame) An image, and the next nearest I frame with the compression target frame, and sets an image block including a changed portion or a changed portion as a processing target image region.

Alternatively, when the compression target frame is a B frame, the previous nearest I frame and the next nearest I frame are compared with the compression target frame, and the image block including the changed portion or the changed portion And sets it as a processing target image area.

For example, if the frame is composed of " I1 P1 P2 P3 P4 P5 P6 P7 B P8 I2 ", and the frame to be compressed is the last B frame, an image obtained by accumulating " I2 P1 P2 P3 P4 P5 P6 P7 " I2 frame and the B frame as the compression target frame to set the image block including the changed portion or the changed portion as the processing target image region.

Alternatively, the I1 frame and the I2 frame are compared with the B frame as the compression target frame to set the image block including the changed portion or the changed portion as the processing target image region.

In the above description, the image block is used to set the image area to be processed. However, the present invention is not limited to this, and includes various aspects of various methods for specifying a certain area of a frame.

12 is a diagram schematically illustrating embodiments of a compressed frame generation step according to an embodiment of the present invention. However, it should be understood that the present invention is not limited thereto.

According to an embodiment of the moving picture compression method of the present invention, the compressed frame generated by the first compressed frame generation step described later is set as a final compressed frame (shown in Embodiment 1 in FIG. 12).

According to an embodiment of the moving picture compression method of the present invention, the compressed frame generated by the second compressed frame generation step described later is set as a final compressed frame (shown in Embodiment 2 in FIG. 12).

According to one embodiment of the moving picture compression method of the present invention, one of the candidate frame groups including the first compressed frame and the second compressed frame generated by the first compressed frame generation step and the second compressed frame generation step And this is used as a final compressed frame (as shown in Embodiment 3 in FIG. 12).

Hereinafter, the first embodiment will be described.

The compression frame generation step S22 includes a first compression frame generation step S22A, and the first compression frame generation step S22A is a step of generating a first compressed frame S22A of a plurality of sub- An image complexity calculating step (S22A.1) for calculating a complexity; An image complexity determination step (S22A.2) of determining whether the complexity of the detail area is less than a preset reference; And a complexity reference image processing step (S22A.3) of performing a first image processing on the detail area when the complexity of the detail area is less than or equal to a predetermined reference, wherein the complexity reference image processing step (S22A.3 ) Is performed on the compressed image frame. 13 is a diagram schematically illustrating a detailed step of a first compressed frame generation step according to an embodiment of the present invention.

Here, the generation of the compressed frame from the frame including the processing target image area in which the complexity reference image processing step S22A.3 is performed may be performed in the same manner as the processing in step S22A2, A frame including the image area is immediately compressed frame, and a post-process such as lossy compression is performed on the frame including the processing target image area in which the complexity reference image processing step S22A.3 has been performed, The present invention is not limited thereto. That is, the first compressed frame generation step S22 may include a step of generating the first compressed frame from the frame in which the lossy compression is performed on the frame including the processing target image area in which the complexity reference image processing step S22A.3 has been performed And the like.

Meanwhile, the first compression frame generation step S22A and its detailed procedure correspond to the contents described in the above-described detailed description of Figs. 5 to 7 and the related description, and a description thereof will be omitted.

Preferably, the first image processing is Blur processing.

Hereinafter, the second embodiment will be described.

Wherein the compressed frame generation step S22 includes a second compressed frame generation step S22B and the second compressed frame generation step S22B includes performing a second image processing on the image area to be processed, A whole image processing step (S22B.1) for generating a spare frame; And an edge combining processing step (S22B.2) of combining the edge portion of the image of the original image data of the compression target frame with the first spare frame to generate a second spare frame, wherein the second spare And generates the compressed frame from the frame. FIG. 14 is a view schematically showing sub-steps of a second compressed frame generation step according to an embodiment of the present invention.

Here, the generation of the compressed frame from the second preliminary frame means that the second preliminary frame is directly used as a compressed frame and the compressed frame is generated by performing post-processing such as lossy compression on the second preliminary frame The second compressed frame generation step S22B includes a case where the compressed frame is generated from a frame in which lossy compression is performed on the second spare frame.

Meanwhile, the second compressed frame generation step (S22B) and its detailed process correspond to the contents described in the above-described detailed description of FIGS. 8 to 9 and the related invention, and a description thereof will be omitted.

Preferably, the second image processing is Blur processing.

Hereinafter, the third embodiment will be described.

The compressed frame generation step (S22C) includes: a first compressed frame generation step of generating a first compressed frame; A second compressed frame generation step of generating a second compressed frame in a manner different from the first compressed frame generation step; And a compressed frame selecting step of selecting one of the candidate frame groups including the first compressed frame and the second compressed frame as the compressed frame.

Here, the first compressed frame generation step is similar to the first compressed frame generation step (S22A) described above. However, instead of using the frame generated from the first compressed frame generation step as a final compressed frame, .

Specifically, the first compressed frame generation step may include: an image complexity calculation step of calculating an image complexity for a plurality of sub-areas constituting the image area to be processed; An image complexity determination step of determining whether the complexity of the detail area is less than a preset reference value; And a complexity-based image processing step of performing a first image processing on the detailed area when the complexity of the detailed area is less than a predetermined reference, wherein the step of processing the complexity- And generates the first compressed frame from the frame containing the first compressed frame.

Here, the generation of the first compressed frame from the frame including the processing target image area in which the complexity-based image processing step has been performed may include a step of generating a frame including the processing target image area in which the complexity- And a case where a first compressed frame is generated by performing post-processing such as lossy compression on a frame including the processing target image area in which the complexity reference image processing step has been performed It should be interpreted as righteousness. That is, the first compressed frame generation step includes a case where the compressed frame is generated from a frame in which lossy compression has been performed on a frame including the processing target image area in which the complexity-based image processing step has been performed.

Meanwhile, the first compressed frame generation step and its detailed process correspond to the contents described in the above-described detailed description of FIGS. 5 to 7 and the related description, and a description thereof will be omitted.

Preferably, the first image processing is Blur processing.

Meanwhile, the second compressed frame generation step is similar to the second compressed frame generation step (S22B) described above. However, instead of using the frame generated from the second compressed frame generation step as a final compressed frame, .

Specifically, the second compressed frame generation step may include: a whole image processing step of performing a second image processing on the image area to be processed to generate a first spare frame; And an Edge combining step of generating a second preliminary frame by combining an edge part of an image of the original image data of the compression target frame with respect to the first preliminary frame, Frame.

Here, the generation of the second compressed frame from the second preliminary frame means that the second preliminarily-encoded frame is directly used as the second compressed frame, and the second preliminary frame is subjected to post-processing such as lossy compression to generate the second compressed frame, The second compressed frame generation step generates the second compressed frame from the frame in which the lossy compression has been performed for the second spare frame, .

Meanwhile, the second compressed frame generation step and the detailed process thereof correspond to the contents described in the above-described FIGS. 8 to 9 and the related detailed description of the present invention, and a description thereof will be omitted.

Preferably, the second image processing is Blur processing.

According to a third embodiment of the present invention, the compressed frame generation step includes: a first compressed frame generation step of generating a first compressed frame; A second compressed frame generation step of generating a second compressed frame in a manner different from the first compressed frame generation step; And a compressed frame selecting step of selecting one of the candidate frame groups including the first compressed frame and the second compressed frame as the compressed frame.

Here, in selecting one of the candidate frame groups, it is preferable that a frame having the smallest capacity among the candidate frame groups is selected as a compressed frame.

FIG. 15 is a view schematically showing detailed steps of a moving image compression method according to an embodiment of the present invention.

The moving picture compression method shown in FIG. 15 includes a frame determination step (S100) for determining whether a compression target frame of a moving picture corresponds to an I type, a P type, or a B type; An image block dividing step (S200) of dividing the frame into a plurality of image blocks according to a preset reference; A processing target image area setting step (S300) of setting a processing target image area in the compression target frame according to the frame type determined in the frame determination step (S100); A transform frame generation step (S400) of generating a first transform frame and a second transform frame by performing image processing on the image area to be processed; A compressed frame generation step (S500) of generating a first compressed frame and a second compressed frame by performing compression on the first converted frame and the second converted frame; A data size comparing step (S600) of comparing data sizes of the first compressed frame and the second compressed frame; And a compressed frame selecting step (S700) of selecting a frame having a small data size among the first compressed frame and the second compressed frame as a final compressed frame.

FIG. 16 is a view schematically showing a step of setting an image block to be processed according to an embodiment of the present invention.

In step S300, the process determines whether the current frame to be compressed is an independently encoded frame, that is, whether it is an I frame (S310). If the current frame is an I frame, And sets it as a metabolic image block (S320). Or in the case of a non-independently encoded frame, that is, in the case of a P frame or a B frame, an image block having a change in comparison with at least one of the previous frame, the accumulated frame of one or more previous frames, As an image block to be processed (S330). The description of such a process is the same as that of the moving picture compressing apparatus and the moving picture compressing method in FIGS. 1 to 14 described above.

17 is a diagram schematically showing detailed steps of a first frame conversion method according to an embodiment of the present invention.

The transform frame generation step (S400) performs image processing on the image area to be processed to generate a first transform frame and a second transform frame. FIG. 17 shows the detailed steps of the first frame conversion method for generating the first converted frame.

As shown in FIG. 17, the first transform frame generation step S410A includes an image complexity calculation step S410A for calculating the complexity of each image block; A complexity determination step (S420A) of determining whether the complexity of each of the calculated image blocks exceeds a predetermined criterion; And a Blur processing step (S430A) for performing blur processing on an image block whose complexity is equal to or less than a preset reference value.

18 is a view schematically showing the detailed steps of a second frame conversion method according to an embodiment of the present invention.

The transform frame generation step (S400) performs image processing on the image area to be processed to generate a first transform frame and a second transform frame. 18 shows the detailed steps of the second frame conversion method for generating the second converted frame.

As shown in FIG. 17, the second transform frame generation step includes an edge image block generation step (S410B) of generating an edge image block by performing edge processing on each image block; A Blur image block generation step (S420B) for generating a Blur image block by performing blur processing on the original image block; A step of generating a binarized image block by performing a binarization process on the edge image block (S430B); And an image combining step (S440) of combining the image of the original image block corresponding to the Edge with reference to the binarized image block in the Blur image block.

Hereinafter, a moving image compression method according to an exemplary embodiment of the present invention may include a compressed frame generation step (S500) of generating a first compressed frame and a second compressed frame by performing compression on the first converted frame and the second converted frame; A data size comparing step (S600) of comparing data sizes of the first compressed frame and the second compressed frame; And a compressed frame selecting step (S700) of selecting a frame having a small data size among the first compressed frame and the second compressed frame as a final compressed frame.

According to an embodiment of the present invention, an effect of compressing a moving image with minimized deterioration of image quality while maintaining the resolution of the original moving image can be exhibited.

According to an embodiment of the present invention, it is possible to maintain the codec as it is while minimizing deterioration of picture quality with respect to the original moving picture, regardless of the codec of the moving picture, and to provide a compressed moving picture with a high compression rate.

According to an embodiment of the present invention, a preprocessing process is performed on a moving image, so that it is possible to perform a moving image compression while using an existing encoder as it is.

According to an embodiment of the present invention, the Wavelet transform and the Lossy Video Codec used in H.265, which is a discrete cosine transform (H.264) transform and a next generation video codec, The effect can be achieved.

Figure 19 illustrates a brief, general schematic diagram of an exemplary computing environment in which embodiments of the invention may be implemented.

Although the present invention has been described above generally in terms of computer-executable instructions that can be executed on one or more computers, those skilled in the art will appreciate that the present invention may be implemented in combination with other program modules and / will be.

Generally, program modules include routines, programs, components, data structures, etc. that perform particular tasks or implement particular abstract data types. It will also be appreciated by those skilled in the art that the methods of the present invention may be practiced with other computer systems, such as single-processor or multiprocessor computer systems, minicomputers, mainframe computers, as well as personal computers, handheld computing devices, microprocessor-based or programmable consumer electronics, And may operate in conjunction with one or more associated devices).

The described embodiments of the invention may also be practiced in distributed computing environments where certain tasks are performed by remote processing devices connected through a communications network. In a distributed computing environment, program modules may be located in both local and remote memory storage devices.

Computers typically include a variety of computer readable media. Any medium accessible by a computer may be a computer-readable medium, which may include volatile and non-volatile media, transitory and non-transitory media, removable and non-removable media, Media. By way of example, and not limitation, computer readable media may comprise computer storage media and communication media. Computer storage media includes volatile and nonvolatile media, both temporary and non-volatile media, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data, . Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital video disk (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, Or any other medium which can be accessed by a computer and used to store the desired information.

Communication media typically embodies computer readable instructions, data structures, program modules or other data in a modulated data signal, such as a carrier wave or other transport mechanism, Media. The term modulated data signal refers to a signal that has one or more of its characteristics set or changed to encode information in the signal. By way of example, and not limitation, communication media includes wired media such as a wired network or direct-wired connection, and wireless media such as acoustic, RF, infrared, or other wireless media. Combinations of any of the above described media are also intended to be included within the scope of computer readable media.

There is shown an exemplary environment 5100 that implements various aspects of the invention including a computer 5102 that includes a processing unit 5104, a system memory 5106, and a system bus 5108 do. The system bus 5108 couples system components, including but not limited to, system memory 5106 to the processing unit 5104. The processing unit 5104 may be any of a variety of commercially available processors. Dual processors and other multiprocessor architectures may also be used as the processing unit 5104.

The system bus 5108 may be any of several types of bus structures that may additionally be interconnected to a local bus using any of the memory bus, peripheral bus, and various commercial bus architectures. The system memory 5106 includes a read only memory (ROM) 5110 and a random access memory (RAM) 5112. The basic input / output system (BIOS) is stored in a non-volatile memory 5110, such as a ROM, EPROM, or EEPROM, which is a basic (nonvolatile) memory device that aids in transferring information between components within the computer 5102, Routine. RAM 5112 may also include a high speed RAM such as static RAM for caching data.

The computer 5102 may also be an internal hard disk drive (HDD) 5114 (e.g., EIDE, SATA) - this internal hard disk drive 5114 may also be configured for external use within a suitable chassis (E.g., for reading from or writing to a removable diskette 5118), and an optical disk drive 5120 (e.g., a CD-ROM) For reading disc 5122 or reading from or writing to other high capacity optical media such as DVD). The hard disk drive 5114, magnetic disk drive 5116 and optical disk drive 5120 are connected to the system bus 5108 by a hard disk drive interface 5124, a magnetic disk drive interface 5126 and an optical drive interface 5128, . The interface 5124 for implementing an external drive includes at least one or both of USB (Universal Serial Bus) and IEEE 1394 interface technologies.

These drives and their associated computer-readable media provide non-volatile storage of data, data structures, computer-executable instructions, and the like. In the case of the computer 5102, the drives and media correspond to storing any data in a suitable digital format. While the above description of computer readable media refers to HDDs, removable magnetic disks, and removable optical media such as CDs or DVDs, those skilled in the art will appreciate that other types of storage devices, such as a zip drive, magnetic cassette, flash memory card, Or the like may also be used in the exemplary operating environment and any such medium may include computer-executable instructions for carrying out the methods of the present invention.

A number of program modules, including an operating system 5130, one or more application programs 5132, other program modules 5134, and program data 5136, may be stored in the drive and RAM 5112. All or a portion of the operating system, applications, modules, and / or data may also be cached in RAM 5112. It will be appreciated that the present invention may be implemented in a variety of commercially available operating systems or combinations of operating systems.

A user may enter commands and information into the computer 5102 via one or more wired / wireless input devices, e.g., a pointing device such as a keyboard 5138 and a mouse 5140. Other input devices (not shown) may include a microphone, IR remote control, joystick, game pad, stylus pen, touch screen, and so on. These and other input devices are often connected to the processing unit 5104 via an input device interface 5142 that is coupled to the system bus 5108 but may include a parallel port, an IEEE 1394 serial port, a game port, a USB port, an IR interface, ≪ / RTI > and so forth.

A monitor 5144 or other type of display device is also connected to the system bus 5108 via an interface, such as a video adapter 5146, In addition to the monitor 5144, the computer typically includes other peripheral output devices (not shown) such as speakers, printers, and the like.

Computer 5102 may operate in a networked environment using logical connections to one or more remote computers, such as remote computer (s) 5148 via wired and / or wireless communication. The remote computer (s) 5148 can be a workstation, a server computer, a router, a personal computer, a portable computer, a microprocessor-based entertainment device, a peer device or other conventional network node, Although a number of or all of the described elements are included, for simplicity, only memory storage 5150 is shown. The logical connections depicted include a wired / wireless connection to a local area network (LAN) 5152 and / or a larger network, e.g., a wide area network (WAN) 5154.

These LAN and WAN networking environments are commonplace in offices and corporations and facilitate enterprise-wide computer networks such as intranets, all of which can be connected to computer networks worldwide, for example the Internet.

When used in a LAN networking environment, the computer 5102 is connected to the local network 5152 via a wired and / or wireless communication network interface or adapter 5156. [ The adapter 5156 may facilitate wired or wireless communication to the LAN 5152 and the LAN 5152 also includes a wireless access point installed therein to communicate with the wireless adapter 5156. When used in a WAN networking environment, the computer 5102 may include a modem 5158, or may be connected to a communication server on the WAN 5154, or to other devices that establish communications over the WAN 5154, such as via the Internet. . A modem 5158, which may be an internal or external and a wired or wireless device, is connected to the system bus 5108 via a serial port interface 5142. In a networked environment, program modules described for the computer 5102, or portions thereof, may be stored in the remote memory / storage device 5150. It will be appreciated that the network connections shown are exemplary and other means of establishing a communication link between the computers may be used.

The computer 5102 may be any wireless device or entity that is deployed and operable in wireless communication, such as a printer, scanner, desktop and / or portable computer, a portable data assistant (PDA) Any equipment or place, and communication with the telephone. This includes at least Wi-Fi and Bluetooth wireless technology. Thus, the communication may be a predefined structure, such as in a conventional network, or simply an ad hoc communication between at least two devices.

Wi-Fi (Wireless Fidelity) allows you to connect to the Internet without wires. Wi-Fi is a wireless technology such as a cell phone that allows such devices, e.g., computers, to transmit and receive data indoors and outdoors, i. E. Anywhere within the coverage area of a base station. Wi-Fi networks use a wireless technology called IEEE 802.11 (a, b, g, etc.) to provide a secure, reliable, and high-speed wireless connection. Wi-Fi can be used to connect computers to each other, the Internet, and a wired network (using IEEE 802.3 or Ethernet). The Wi-Fi network may operate in unlicensed 2.4 and 5 GHz wireless bands, for example, at 11 Mbps (802.11a) or 54 Mbps (802.11b) data rates, or in products containing both bands have.

Those of ordinary skill in the art will understand that information and signals may be represented using any of a variety of different technologies and techniques. For example, data, instructions, commands, information, signals, bits, symbols, and chips that may be referenced in the above description may include voltages, currents, electromagnetic waves, magnetic fields or particles, Particles or particles, or any combination thereof.

Those skilled in the art will appreciate that the various illustrative logical blocks, modules, processors, means, circuits, and algorithm steps described in connection with the embodiments disclosed herein may be embodied directly in electronic hardware, (Which may be referred to herein as "software") or a combination of both. To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware or software depends on the design constraints imposed on the particular application and the overall system. Those skilled in the art may implement the described functionality in various ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.

The various embodiments presented herein may be implemented as a method, apparatus, or article of manufacture using standard programming and / or engineering techniques. The term "article of manufacture" includes a computer program, carrier, or media accessible from any computer-readable device. For example, the computer-readable medium can be a magnetic storage device (e.g., a hard disk, a floppy disk, a magnetic strip, etc.), an optical disk (e.g., CD, DVD, etc.), a smart card, But are not limited to, devices (e. G., EEPROM, cards, sticks, key drives, etc.). The various storage media presented herein also include one or more devices and / or other machine-readable media for storing information. The term "machine-readable medium" includes, but is not limited to, a wireless channel and various other media capable of storing, holding, and / or transferring instruction (s) and / or data.

It will be appreciated that the particular order or hierarchy of steps in the presented processes is an example of exemplary approaches. It will be appreciated that, based on design priorities, certain orders or hierarchies of steps in processes may be rearranged within the scope of the present invention. The appended method claims provide elements of the various steps in a sample order, but are not meant to be limited to the specific order or hierarchy presented.

The description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features presented herein.

Claims (22)

delete 1. A moving image compression method performed in a computing device including at least one processor and a main memory storing instructions executable by the processor,
A frame type determination step of determining whether a compression target frame of the moving picture is an independently encoded frame; And
And a frame compression step of separating a case where the compression object frame is an independently encoded frame and a case where the compression object frame is not an independently encoded one,
Wherein the frame compression step comprises:
A processing target image area setting step of setting a processing target image area of the compression target frame; And
And a compressed frame generation step of generating a compressed frame in which a part or the whole of the image area to be processed is transformed,
Wherein the processing target image area setting step sets the entire compression target frame as the processing target image area when the compression target frame is an independently encoded frame,
And sets a part of the compression target frame as the processing target image area when the compression target frame is not an independently encoded frame.
The method of claim 2,
Wherein the processing target image area setting step comprises: dividing the compression target frame into a plurality of image blocks according to a preset reference;
And sets a part of the plurality of image blocks of the compression target frame as the processing target image area if the compression target frame is not an independently encoded frame.
The method according to claim 2 or 3,
The image processing method according to claim 1, wherein, in the case where the compression target frame is not an independently encoded frame, the process of setting the processing target image area is performed by comparing at least one of a previous frame, a following frame, And sets a portion of the portion of the frame to be compressed as the processing target image region.

The method of claim 2,
The compressed frame generation step includes a first compressed frame generation step,
Wherein the first compressed frame generation step comprises:
An image complexity calculating step of calculating an image complexity with respect to a plurality of detail areas constituting the image area to be processed;
An image complexity determination step of determining whether the complexity of the detail area is less than a preset reference value; And
And performing a first image processing on the detailed area when the complexity of the detailed area is less than or equal to a preset reference,
And the compressed frame is generated from a frame including the processed image area in which the complexity-based image processing step has been performed.
The method of claim 5,
Wherein the first compressed frame generation step comprises:
And the compressed frame is generated from a frame in which lossy compression is performed on a frame including the processed image area in which the complexity-based image processing step has been performed.
The method according to claim 5 or 6,
Wherein the first image processing is Blur processing.
The method of claim 2,
The compressed frame generation step includes a second compressed frame generation step,
Wherein the second compressed frame generation step comprises:
A whole image processing step of performing a second image processing on the image area to be processed to generate a first spare frame; And
And an edge combining step of generating a second preliminary frame by combining an edge part of the image of the original image data of the compression target frame with respect to the first preliminary frame,
And generates the compressed frame from the second spare frame.
The method of claim 8,
And generates the compressed frame from a frame in which lossy compression has been performed for the second spare frame.
The method according to claim 8 or 9,
And the second image processing is Blur processing.
The method of claim 2,
The compressed frame generation step includes:
A first compressed frame generation step of generating a first compressed frame;
A second compressed frame generation step of generating a second compressed frame in a manner different from the first compressed frame generation step; And
And selecting one of the candidate frame groups including the first compressed frame and the second compressed frame as the compressed frame.
The method of claim 11,
Wherein the first compressed frame generation step comprises:
An image complexity calculating step of calculating an image complexity with respect to a plurality of detail areas constituting the image area to be processed;
An image complexity determination step of determining whether the complexity of the detail area is less than a preset reference value; And
And performing a first image processing on the detailed area when the complexity of the detailed area is less than or equal to a preset reference,
And the first compressed frame is generated from a frame including the processed image area in which the complexity-based image processing step has been performed.
The method of claim 11,
Wherein the second compressed frame generation step comprises:
A whole image processing step of performing a second image processing on the image area to be processed to generate a first spare frame;
And an edge combining step of generating a second preliminary frame by combining an edge part of the image of the original image data of the compression target frame with respect to the first preliminary frame,
And generates the second compressed frame from the second spare frame.
The method of claim 11,
Wherein the first compressed frame generation step comprises:
An image complexity calculating step of calculating an image complexity with respect to a plurality of detail areas constituting the image area to be processed;
An image complexity determination step of determining whether the complexity of the detail area is less than a preset reference value; And
And performing a first image processing on the detailed area when the complexity of the detailed area is less than or equal to a preset reference,
Generating the first compressed frame from a frame including the processed image area in which the complexity-based image processing step has been performed,
Wherein the second compressed frame generation step comprises:
A whole image processing step of performing a second image processing on the image area to be processed to generate a first spare frame;
And an edge combining step of generating a second preliminary frame by combining an edge part of the image of the original image data of the compression target frame with respect to the first preliminary frame,
And generates the second compressed frame from the second spare frame.
delete 21. A computer program stored in a computer-readable medium comprising a plurality of instructions executed by one or more processors,
The computer program comprising:
A frame type determination command for determining whether a compression target frame of the moving picture is an independently encoded frame; And
And a frame compression instruction for generating a compressed frame by separating the case where the compression object frame is an independently encoded frame and the case where the compression object frame is not an independently encoded frame,
Wherein the frame compression instruction comprises:
A processing target image area setting command for setting a processing target image area of the compression target frame; And
And a compressed frame generation command for generating a compressed frame in which part or all of the image area to be processed is converted,
Wherein the processing target image area setting command sets the entire compression target frame as the processing target image area when the compression target frame is an independently encoded frame,
And sets a part of the compression target frame as the processing target image area when the compression target frame is not an independently encoded frame.
18. The method of claim 16,
Wherein the processing target image area setting command divides the compression target frame into a plurality of image blocks according to a preset reference,
And sets a part of the plurality of image blocks of the compression target frame as the processing target image area when the compression target frame is not an independently encoded frame.
The method according to claim 16 or 17,
Wherein the processing target image area setting command is configured to compare the previous frame, the subsequent frame, and the plurality of previous frames of the compression target frame with at least one of accumulated frames when the compression target frame is not an independently encoded frame, And sets a portion of the portion of the frame to be compressed as the processing target image region.
18. The method of claim 17,
Wherein the compressed frame generation command includes a first compressed frame generation command,
Wherein the first compressed frame generation command includes:
An image complexity calculating unit that calculates an image complexity with respect to a plurality of detail areas constituting the image area to be processed;
An image complexity determining command for determining whether the complexity of the detail area is less than a preset reference; And
And a complexity reference image processing instruction for performing a first image processing on the detailed area when the complexity of the detailed area is equal to or less than a predetermined reference,
And generates the compressed frame from a frame including the processed image area in which the complexity-based image processing command is performed.
18. The method of claim 17,
Wherein the compressed frame generation command includes a second compressed frame generation command,
Wherein the second compressed frame generation command includes:
A whole image processing instruction for performing a second image processing on the image area to be processed to generate a first spare frame; And
And an edge combining processing instruction for combining the edge portion of the image of the original image data of the compression target frame with the first spare frame to generate a second spare frame,
And generate the compressed frame from the second spare frame.
18. The method of claim 17,
The compressed frame generation command includes:
A first compressed frame generation command for generating a first compressed frame;
A second compressed frame generation command for generating a second compressed frame in a manner different from the first compressed frame generation command; And
And a compressed frame selection instruction that causes one of the candidate frame groups including the first compressed frame and the second compressed frame to be the compressed frame.
A method of compressing a moving picture,
A frame discrimination step of discriminating whether a compression target frame of the moving picture corresponds to an I type, a P type or a B type;
An image block dividing step of dividing the frame into a plurality of image blocks according to a preset reference;
A processing target image area setting step of setting a processing target image area in the compression target frame according to a frame type determined by the frame determination step;
A transform frame generation step of generating a first transform frame and a second transform frame by performing image processing on the image area to be processed;
A compressed frame generation step of generating a first compressed frame and a second compressed frame by performing compression on the first transform frame and the second transform frame;
A data size comparing step of comparing data sizes of the first compressed frame and the second compressed frame; And
And a compressed frame selecting step of selecting a frame having a small data size among the first compressed frame and the second compressed frame as a final compressed frame.

Images