TWI691938B - System and method of generating moving images, computer device, and readable storage medium - Google Patents

Abstract

The present invention provides a method of generating moving images. The method includes obtaining a still image and a depth image of the still image; converting a preset area of the depth image into a histogram; calculating an average depth value D according to the histogram; determining a first depth value d1 and a second depth value d2 according to the average depth value D; determining M number of third depth values d3 according to the first depth value d1 and the second depth value d2; fuzzy processing the still image according to each of the M number of third depth value d3 and obtaining M number of bokeh images; establishing a relationship between each of the M number of bokeh images and each of the M number of third depth value d3; and playing the M number of bokeh images according to the corresponding third depth value d3. The present invention further provides a system of generating moving images, a computer device, and a readable storage medium. The present invention can generate moving images based on depth images.

Description

Dynamic image generation method and system, computer device, and readable storage medium

The invention relates to the technical field of image processing, and in particular to a method and system for generating dynamic images, a computer device, and a readable storage medium.

This section is intended to provide background or context for the implementation of the embodiments of the present invention set forth in the scope of patent application and specific implementation. The description here is not admitted to be prior art because it is included in this section.

There are currently many ways to obtain depth images. For example, you can use a depth camera to shoot, a dual camera that simulates human binocular vision to obtain a depth image, or a spatial model of a static image, edge detection, and calculation of the vanishing point to obtain the depth of the static image. image. However, at present, there are few solutions that use depth images for further processing to amplify the effect of depth images.

In view of the above, it is necessary to propose a method and system for generating dynamic images, a computer device, and a computer-readable storage medium, which can generate dynamic images based on depth images.

A first aspect of the present invention provides a method for generating a dynamic image, the method includes: acquiring a static image, and acquiring a depth image of the static image; and converting the depth according to depth information of the depth image The preset area of the image is converted into a long bar graph; an average depth value D is calculated according to the bar graph, and the average depth value D is an average value of depth values of all primitive points in the preset area; Determining a first depth value d1 and a second depth value d2 from the bar graph according to the average depth value D; determining M third depth values according to the first depth value d1 and the second depth value d2 d3, where M is an integer greater than 1, and the M third depth values d3 are depth values of different sizes; according to each third depth value d3 in the M third depth values d3 Performing blur processing on the static image to generate M blurred images, and respectively associating the M blurred images with the corresponding third depth value d3; and according to the M blurred images The size of the third depth value d3 corresponding to each blurred image is used to play the M blurred images in sequence.

Preferably, the horizontal axis of the bar graph represents a depth value, and the vertical axis represents the number of primitive points.

Preferably, the preset area refers to an area having a preset size and a shape with the center of the depth image as the center.

Preferably, the calculating an average depth value D according to the bar graph includes: multiplying each depth value displayed by the bar graph by the number of corresponding primitive points to obtain a product; and calculating the calculated Add all the products obtained to obtain a total value; and divide the total value by the total number of primitive points in the preset area to calculate the average depth value D.

Preferably, the determining a first depth value d1 and a second depth value d2 from the bar graph according to the average depth value D includes: (a1) determining whether there is a The first depth value d1 of the condition, where the first condition includes: the size of d1 is between d _min ~D, and the number of primitive points corresponding to d1 is greater than or equal to each depth between d _min ~D The number of primitive points corresponding to the value, and the number of primitive points corresponding to d1 is greater than the preset value, where d _min is the minimum value of the horizontal axis coordinates of the bar graph; (b1) if it is in the bar There is a first depth value d1 that satisfies the first condition in the figure, and it is determined that the second depth value d2 is d _max , where d _max is the maximum value of the horizontal axis coordinate of the bar graph; (c1) If there is no first depth value d1 satisfying the first condition in the bar graph, the first depth value d1 is searched for in the bar graph according to the second condition, and the second condition includes: d1 Is between D~d _max , and the number of primitive points corresponding to d1 is greater than or equal to the number of primitive points corresponding to each depth value between D~d _max ; if the first depth value d1 If the second condition is satisfied, it is determined that the second depth value d2 is d _min .

Preferably, the determining a first depth value d1 and a second depth value d2 from the bar graph according to the average depth value D includes: (a2) determining whether there is a third The first depth value d1 of the condition, wherein the third condition includes: the size of d1 is between D~d _max , and the number of primitive points corresponding to d1 is greater than or equal to each depth between D~d _max The number of primitive points corresponding to the value, and the number of primitive points corresponding to d1 is greater than the preset value, where d _max is the maximum value of the horizontal axis coordinate of the bar graph; (b2) if it is in the bar There is a first depth value d1 satisfying the third condition in the figure, and it is determined that the second depth value d2 is d _min , where d _min is the minimum value of the horizontal axis coordinate of the bar graph; (c2) If there is no first depth value d1 satisfying the third condition in the bar graph, the first depth value d1 is searched for in the bar graph according to the fourth condition, where the fourth condition includes : The size of d1 is between d _min ~D, and the number of primitive points corresponding to d1 is greater than or equal to the number of primitive points corresponding to each depth value between d _min ~D; if the first depth If the value d1 satisfies the fourth condition, it is determined that the second depth value d2 is d _max .

Preferably, the M third depth values d3 form an arithmetic sequence, and the tolerance of the arithmetic sequence is equal to the absolute value of the difference between the first depth value d1 and the second depth value d2 divided by ( M-1) The obtained value, the minimum depth value of the M third depth values d3 is the smaller of d1 and d2, and the maximum depth value of the M third depth values d3 is d1 And d2 whichever is greater.

Preferably, when the still image is blurred according to a third depth value d3 of the M third depth values d3, the blur degree corresponding to the blurred primitive point is proportional to the blur processing The difference between the depth value corresponding to the pixel point of and the third depth value d3.

A second aspect of the present invention provides a computer device. The computer device includes a processor, and the processor is used to implement the dynamic image generation method when executing a computer program stored in a storage. The third party of the present invention provides a computer-readable storage medium on which a computer program is stored, and when the computer program is executed by a processor, the dynamic image generation method is realized. A fourth aspect of the present invention provides a dynamic image generation system. The system includes: an acquisition module for acquiring a static image and a depth image of the static image; and a processing module for The depth information of the depth image converts the preset area of the depth image into a bar graph; the processing module is further used to calculate an average depth value D according to the bar graph, the average The depth value D is the average value of the depth values of all the primitive points in the preset area; the processing module is further used to determine a first depth value from the bar graph according to the average depth value D d1 and a second depth value d2; the processing module is further configured to determine M third depth values d3 according to the first depth value d1 and the second depth value d2, where M is greater than 1. Integer, the M third depth values d3 are depth values of different sizes; the processing module is further used to compare the static value according to each third depth value d3 of the M third depth values d3 Blur the image to generate M blurred images, and associate the M blurred images with the corresponding third depth value d3; and the processing module is also used to The size of the third depth value d3 corresponding to each of the M blurred images is used to play the M blurred images in sequence.

The dynamic image generation method and system, computer device, and computer-readable storage medium described in the embodiments of the present invention can generate dynamic images based on depth images.

In order to be able to understand the above objects, features and advantages of the present invention more clearly, the present invention will be described in detail below with reference to the drawings and specific embodiments. It should be noted that the embodiments of the present invention and the features in the embodiments can be combined with each other without conflict.

In the following description, many specific details are set forth in order to fully understand the present invention. The described embodiments are only a part of the embodiments of the present invention, but not all the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by a person of ordinary skill in the art without making creative efforts fall within the protection scope of the present invention.

Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by those skilled in the technical field of the present invention. The terminology used in the description of the present invention herein is for the purpose of describing specific embodiments, and is not intended to limit the present invention.

FIG. 1 is a schematic diagram of a computer device provided by an embodiment of the present invention.

In a preferred embodiment of the present invention, the computer device 3 includes, but is not limited to, a storage 31, at least one processor 32, a display 34, and a camera 35.

Those skilled in the art should understand that the structure of the computer device shown in FIG. 1 does not constitute a limitation of the embodiment of the present invention, and the computer device 3 may further include more or less other hardware or software than illustrated, or Different parts arrangement. Although not shown, the computer device 3 may further include a power supply (such as a battery) for powering various components. Preferably, the power supply may be logically connected to the at least one processor 32 through a power management device, thereby being realized through the power management device Manage charging, discharging, and power consumption management functions. The power supply may also include one or more DC or AC power supplies, recharging devices, power failure detection circuits, power converters or inverters, power status indicators, and other arbitrary components. The computer device 3 may further include other elements, such as sensors, Wi-Fi modules, etc., which will not be repeated here.

It should be understood that the described embodiments are for illustrative purposes only and are not limited by this structure in the scope of patent applications.

In some embodiments, the storage 31 is used to store program codes and various data, such as the dynamic image generation system 5 installed in the computer device 3, and realizes high-speed and automatic operation during the operation of the computer device 3 Complete program or data access. The memory 31 includes a read-only memory (Read-Only Memory, ROM), a random access memory (Random Access Memory, RAM), a programmable read-only memory (Programmable Read-Only Memory, PROM), and erasable Erasable Programmable Read-Only Memory (EPROM), One-time Programmable Read-Only Memory (OTPROM), electronic erasable rewritable read-only memory ( Electrically-Erasable Programmable Read-Only Memory (EEPROM), Compact Disc Read-Only Memory (CD-ROM) or other optical disc storage, disk storage, tape storage, or can be used to carry or store data Any other storage media readable by the computer.

In some embodiments, the at least one processor 32 may be composed of an integrated circuit, for example, may be composed of a single packaged integrated circuit, or may be composed of multiple integrated circuits packaged with the same function or different functions , Including one or more central processing units (Central Processing Unit, CPU), microprocessors, digital processing chips, graphics processors, and various combinations of control chips. The at least one processor 32 is a control unit (Control Unit) of the computer device 3, and uses various interfaces and lines to connect the various components of the entire computer device 3, by running or executing the program stored in the memory 31 or The module and the data stored in the storage 31 are called to execute various functions of the computer device 3 and process the data, such as the function of generating dynamic images shown in FIG. 3.

In some embodiments, the display 34 can be used to display information input by or provided to the user and various graphical viewer interfaces of the electronic device 1. These graphical viewer interfaces can be composed of graphics, text, and icons. , Video and any combination of them. The display 34 may include a display panel, such as a liquid crystal display (Liquid Crystal Display, LCD) panel or an organic light-emitting diode (Organic Light-Emitting Diode, OLED) display panel.

In some embodiments, the camera 35 may be a depth camera or a dual camera with simulated human binocular vision. The computer device 3 can use the camera device 35 to capture a depth image. In this embodiment, the depth image is also referred to as a range image (range image), and refers to an image that takes the distance (depth) from the image collector (such as the shooting device 35) to each point in the scene as a primitive value. . The depth information of the depth image often uses a gray scale range (such as 0~255) to represent the depth value of each primitive point. For example, the gray scale value 0 indicates the closest to the image collector, and the gray scale value 255 indicates the farthest from the image Collector.

In some embodiments, the dynamic image generating system 5 is stored in the storage 31 of the computer device 3 and executed by the at least one processor 32 to realize the function of generating dynamic images.

The dynamic image generating system 5 may include one or more computer instructions in the form of programs, which are stored in the storage 31 and executed by the at least one processor 32. In one embodiment, the dynamic image generating system 5 may be integrated in the at least one processor 32. In other embodiments, the dynamic image generating system 5 can also be independent of the processor 32.

Referring to FIG. 2, the dynamic image generation system 5 may include one or more modules, such as the acquisition module 51 and the processing module 52 shown in FIG. 2. The functions of each module will be described in detail in conjunction with FIG. 3.

The "module" mentioned in this specification refers to the form of hardware or firmware, or refers to the set of computer instructions written in programming languages such as JAVA and C. One or more computer instructions in the module can be embedded in the firmware, such as in a readable and writable programming memory. The modules described in this embodiment may be implemented as software and/or hardware modules, and may be stored in any type of non-transitory computer-readable medium or other storage device such as storage 31.

FIG. 3 is a flowchart of a method for generating a dynamic image provided by an embodiment of the present invention.

The dynamic image generation method specifically includes the following steps. According to different requirements, the order of the steps in the flowchart may be changed, and some steps may be omitted.

Step S11: The acquisition module 51 acquires a static image and acquires a depth image of the static image.

In one embodiment, the acquisition module 51 may acquire a depth image of the static image by establishing a spatial model of the static image, edge detection, and calculating vanishing points. The acquisition module 51 can also acquire the depth image from a server or another computer device.

Step S12: The processing module 52 converts the preset area of the depth image into a histogram according to the depth information of the depth image. Wherein, the horizontal axis of the bar graph represents the depth value, and the vertical axis represents the number of primitive points. The minimum value of the horizontal axis coordinate of the bar graph is d _min , and the maximum value of the horizontal axis coordinate of the bar graph is d _max , for example, d _min is equal to 0 and d _max is equal to 255. In other embodiments, d _min and d _max can be changed to other values.

In one embodiment, the depth information of the depth image refers to the depth value of each primitive point.

In one embodiment, the preset area refers to an area with a preset size and a shape that is centered on the center of the depth image. In one embodiment, the preset shape may be a rectangle, a square, or a circle. For example, taking the preset shape as a rectangle as an example, the preset area may refer to an area with a preset length and a preset width centered on the center of the depth image.

For example, the processing module 52 converts the preset area of the depth image into the bar graph 6 shown in FIG. 4 according to the depth information of the depth image. The horizontal axis of the bar graph 6 represents the depth value, and the vertical axis represents the number of primitive points.

Step S13: The processing module 52 calculates an average depth value D according to the bar graph. The average depth value D is the average value of the depth values of all the primitive points in the bar graph (that is, in the preset area).

Specifically, the processing module 52 may multiply each depth value displayed in the bar graph by the number of corresponding primitive points to obtain a product, and add all the calculated products to obtain a total value , Dividing the total value by the total number of primitive points in the preset area to calculate the average depth value D.

Step S14: The processing module 52 determines a first depth value d1 and a second depth value d2 from the bar graph according to the average depth value D.

In the first embodiment:

The determining a first depth value d1 and a second depth value d2 from the bar graph according to the average depth value D includes:

(A1) Determine whether there is a first depth value d1 satisfying the first condition in the bar graph. If there is a first depth value d1 that satisfies the first condition in the bar graph, step (b1) is performed. If there is no first depth value d1 satisfying the first condition in the bar graph, step (c1) is executed. The first condition includes: the size of d1 is between d _min ~D, and the number of primitive points corresponding to d1 is greater than or equal to that of the primitive points corresponding to each depth value between d _min ~D Number, and the number of primitive points corresponding to d1 is greater than a preset value (for example, 180).

(B1) If there is a first depth value d1 satisfying the first condition in the bar graph, the processing module 52 determines that the second depth value d2 is d _max .

(C1) If there is no first depth value d1 satisfying the first condition in the bar graph, the processing module 52 searches for the first depth in the bar graph according to the second condition The value d1 (that is, the first depth value d1 needs to satisfy the second condition). The second condition includes that the size of d1 is between D~d _max , and the number of primitive points corresponding to d1 is greater than or equal to the number of primitive points corresponding to each depth value between D~d _max . In one embodiment, if the first depth value d1 is a depth value that satisfies the second condition, the processing module 52 determines that the second depth value d2 is d _min .

In the second embodiment:

The determining a first depth value d1 and a second depth value d2 from the bar graph according to the average depth value D includes:

(A2) Determine whether there is a first depth value d1 satisfying the third condition in the bar graph. If there is a first depth value d1 that satisfies the third condition in the bar graph, step (b2) is performed. If there is no first depth value d1 satisfying the third condition in the bar graph, step (c2) is performed. Wherein, the third condition includes: the size of d1 is between D~d _max , and the number of primitive points corresponding to d1 is greater than or equal to that of the primitive points corresponding to each depth value between D~d _max Number, and the number of primitive points corresponding to d1 is greater than the preset value (for example, 180).

(B2) If there is a first depth value d1 satisfying the third condition in the bar graph, the processing module 52 determines that the second depth value d2 is d _min .

(C2) If there is no first depth value d1 satisfying the third condition in the bar graph, the processing module 52 searches for the first depth in the bar graph according to the fourth condition The value d1 (that is, the first depth value d1 needs to satisfy the fourth condition).

In this embodiment, the fourth condition includes: the size of d1 is between d _min ~D, and the number of primitive points corresponding to d1 is greater than or equal to the map corresponding to each depth value between d _min ~D The number of meta points.

In one embodiment, if the first depth value d1 is a depth value that satisfies the fourth condition, the processing module 52 determines that the second depth value d2 is d _max .

Step S15. The processing module 52 determines M third depth values d3 according to the first depth value d1 and the second depth value d2, where the M third depth values d3 are depth values of different sizes.

In one embodiment, the value of M is a positive integer greater than 1. The value of M may be a preset value, or set by the processing module 52 according to user input.

In one embodiment, the M third depth values d3 form an arithmetic sequence, and the tolerance of the arithmetic sequence is equal to the absolute value of the difference between the first depth value d1 and the second depth value d2 The value divided by (M-1). In one embodiment, the minimum depth value of the M third depth values d3 is the smaller of d1 and d2, and the maximum depth value of the M third depth values d3 is d1 and d2 The larger of the two.

Step S16. The processing module 52 performs blur processing on the static image according to each of the M third depth values d3 to generate M bokeh images, and The M pieces of blurred images are respectively associated with corresponding third depth values d3.

Specifically, when the processing module 52 blurs the static image according to a third depth value d3 of the M third depth values d3, the depth value is not equal to the certain third depth value The pixel points of d3 are blurred, and the pixel points whose depth value is equal to the third depth value d3 are not blurred, thereby generating a blurred image, and then generating the blurred image with The third depth value d3 is associated. According to this method, the still image is blurred according to each third depth value d3 of the M third depth values d3, so that M blurred images are generated, and each generated The blurred image is associated with the corresponding third depth value d3.

In one embodiment, when the processing module 52 blurs the static image according to the third depth value d3, the blur degree corresponding to the blurred primitive point is proportional to the blur processing The difference between the depth value corresponding to the pixel point of and the third depth value d3. That is, the larger the difference between the depth value corresponding to the blur-processed primitive point and the certain third depth value d3, the higher the blur degree corresponding to the blur-processed primitive point.

Step S17: The processing module 52 plays the M blurred images in sequence according to the size of the third depth value d3 corresponding to each of the M blurred images, thereby implementing Motion picture playback.

It should be noted that, in this embodiment, the modules described as separate components may or may not be physically separated, and the components displayed as modules may or may not be physical units, that is, they may be located in one place , Or can be distributed to multiple network elements. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

It will be apparent to those skilled in the art that the present invention is not limited to the details of the above exemplary embodiments, and that the present invention can be implemented in other specific forms without departing from the spirit or basic characteristics of the present invention. Therefore, no matter from which point of view, the embodiments should be regarded as exemplary and non-limiting, the scope of the present invention is defined by the scope of the attached patent application rather than the above description, so it is intended to fall in the application All changes in the meaning and scope of equivalent requirements of the patent scope are included in the present invention. Any reference signs in the scope of patent application shall not be considered as limiting the scope of patent application involved. In addition, it is clear that the word "include" does not exclude other units or the singular does not exclude the plural. Multiple units or devices stated in the patent application scope of the device may also be implemented by one unit or device through software or hardware. The first and second words are used to indicate names, but do not indicate any particular order.

Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention and not to limit them. Although the present invention has been described in detail with reference to the preferred embodiments, those of ordinary skill in the art should understand that the technical solutions of the present invention can be Modifications or equivalent replacements are made without departing from the spirit and scope of the technical solutions of the present invention.

3: computer device 31: memory 32: processor 34: display 35: Camera 5: Dynamic image generation system 51: Get module 52: Processing module 6: Bar chart

FIG. 1 is a schematic diagram of a computer device provided by a preferred embodiment of the present invention. 2 is a functional module diagram of a dynamic image generation system provided by a preferred embodiment of the present invention. FIG. 3 is a flowchart of a dynamic image generation method provided by a preferred embodiment of the present invention. FIG. 4 illustrates an example of generating a histogram based on depth information of a depth image.

no

Claims (11)

A dynamic image generation method, wherein the method includes: acquiring a static image and acquiring a depth image of the static image; presetting the depth image according to depth information of the depth image The area is converted into a long bar graph; an average depth value D is calculated according to the bar graph, and the average depth value D is an average value of depth values of all primitive points in the preset area; according to the average depth The value D determines a first depth value d1 and a second depth value d2 from the histogram; M third depth values d3 are determined according to the first depth value d1 and the second depth value d2, where Said M is an integer greater than 1, and the M third depth values d3 are depth values of different sizes; the static image is performed according to each third depth value d3 of the M third depth values d3 Blur processing to generate M pieces of blurred images and associate the M pieces of blurred images with corresponding third depth values d3; and according to each of the M pieces of blurred images The M pieces of blurred images are played in sequence according to the size of the third depth value d3 corresponding to the image. The method for generating a dynamic image according to item 1 of the patent application scope, wherein the horizontal axis of the bar graph represents a depth value, and the vertical axis represents the number of primitive points. The method for generating a dynamic image as described in item 1 of the patent application range, wherein the preset area refers to an area having a preset size and a preset shape centered on the center of the depth image. The method for generating a dynamic image according to item 1 of the patent application scope, wherein the calculating an average depth value D according to the bar graph includes: multiplying each depth value displayed by the bar graph by the corresponding The number of primitive points is obtained as a product; all the calculated products are added to obtain a total value; and the total value is divided by the total number of primitive points in the preset area to calculate the average Depth value D. The method for generating a dynamic image according to item 1 of the patent application scope, wherein the determining a first depth value d1 and a second depth value d2 from the bar graph according to the average depth value D includes: (a1 ) Determine whether there is a first depth value d1 satisfying the first condition in the bar graph, wherein the first condition includes: the size of d1 is between d _min ~ D, and the number of primitive points corresponding to d1 Greater than or equal to the number of primitive points corresponding to each depth value between d _min ~D, and the number of primitive points corresponding to d1 is greater than a preset value, where d _min is the horizontal axis coordinate of the bar graph (B1) If there is a first depth value d1 that satisfies the first condition in the bar graph, determine that the second depth value d2 is d _max , where d _max is the bar graph The maximum value of the horizontal axis coordinate of (c1) If there is no first depth value d1 that satisfies the first condition in the bar graph, then search for the first A depth value d1, the second condition includes: the size of d1 is between D~d _max , and the number of primitive points corresponding to d1 is greater than or equal to the image corresponding to each depth value between D~d _max The number of meta-points; if the first depth value d1 satisfies the second condition, it is determined that the second depth value d2 is d _min . The method for generating a dynamic image according to item 1 of the patent application scope, wherein the determining a first depth value d1 and a second depth value d2 from the bar graph according to the average depth value D includes: (a2 ) Determine whether there is a first depth value d1 that satisfies the third condition in the bar graph, where the third condition includes: the size of d1 is between D~d _max , and the number of primitive points corresponding to d1 Greater than or equal to the number of primitive points corresponding to each depth value between D~d _max , and the number of primitive points corresponding to d1 is greater than a preset value, where d _max is the horizontal axis coordinate of the bar graph (B2) If there is a first depth value d1 that satisfies the third condition in the bar graph, determine that the second depth value d2 is d _min , where d _min is the bar graph (C2) If there is no first depth value d1 that satisfies the third condition in the bar graph, search for the first A depth value d1, wherein the fourth condition includes: the size of d1 is between d _min ~D, and the number of primitive points corresponding to d1 is greater than or equal to each depth value corresponding to d _min ~D The number of primitive points of; if the first depth value d1 satisfies the fourth condition, it is determined that the second depth value d2 is d _max . The method for generating a dynamic image as described in item 1 of the patent application range, wherein the M third depth values d3 form an arithmetic sequence, and the tolerance of the arithmetic sequence is equal to the first depth value d1 and the second depth The absolute value of the difference between the values d2 divided by (M-1), the minimum depth value of the M third depth values d3 is the smaller of d1 and d2, the M The maximum depth value of the third depth value d3 is the larger of d1 and d2. The method for generating a dynamic image as described in item 1 of the patent application range, wherein in this method, when the still image is blurred according to a third depth value d3 of the M third depth values d3, The blur degree corresponding to the blurred primitive point is proportional to the difference between the depth value corresponding to the blurred primitive point and the third depth value d3. A computer device, wherein the computer device includes a processor for generating a dynamic image described in any one of items 1 to 8 of the patent application range when executing a computer program stored in a memory method. A computer-readable storage medium on which a computer program is stored, wherein, when the computer program is executed by a processor, the dynamic image generation method described in any one of items 1 to 8 of the patent application scope is realized. A dynamic image generation system, wherein the system includes: an acquisition module for acquiring a static image and a depth image of the static image; and a processing module for generating a depth image according to the depth map The depth information of the image transforms the preset area of the depth image into a bar graph; the processing module is further used to calculate an average depth value D according to the bar graph, and the average depth value D is An average value of depth values of all primitive points in the preset area; the processing module is further configured to determine a first depth value d1 and a first depth value from the bar graph according to the average depth value D Two depth values d2; the processing module is further configured to determine M third depth values d3 according to the first depth value d1 and the second depth value d2, where M is an integer greater than 1, the M third depth values d3 are depth values of different sizes; the processing module is further configured to blur the static image according to each third depth value d3 of the M third depth values d3 Processing to generate M pieces of blurred images, and associate the M pieces of blurred images with corresponding third depth values d3; and the processing module is also used to The M pieces of blurred images are played in order according to the size of the third depth value d3 corresponding to each blurred image in the image.

Images