Interactive method for generating strokes with Chinese ink painting style and device thereof

Abstract

An interactive method for generating strokes with Chinese ink painting style, includes steps: obtaining an image including a pattern as an image object; obtaining a delimiting operation delimiting at least one stroke sample on a pre-stored ink painting sample, obtaining a basic outline forming a preliminary basic path of a stroke to be generated and drawn by a user on the image object; correcting stroke outlines in the stroke sample to obtain accurate stroke samples as candidate stroke samples; using the candidate stroke samples as references to generate morphological sample groups; correcting the preliminary basic path to obtain an accurate basic path; selecting morphological samples best matching the accurate basic path in the morphological sample groups as final stroke samples; and mapping style features of the final stroke samples onto the accurate basic path to generate an output image with Chinese ink painting style.

Claims

1. An interactive method for generating strokes with Chinese ink painting style, comprising: obtaining an image comprising a pattern as an image object; obtaining a delimiting operation delimiting at least one stroke sample on a pre-stored ink painting sample, obtaining a basic outline drawn by a user on the image object, the basic outline forming a preliminary basic path of a stroke to be generated; correcting stroke outlines in the at least one stroke sample to obtain accurate stroke samples as candidate stroke samples; using the candidate stroke samples as references to generate morphological sample groups; correcting the preliminary basic path to obtain an accurate basic path; selecting morphological samples best matching the accurate basic path in the morphological sample groups as final stroke samples; and mapping style features of the final stroke samples onto the accurate basic path to generate an output image with Chinese ink painting style.

2. The interactive method according to claim 1, wherein the step of correcting the stroke outlines in the at least one stroke sample to obtain the accurate stroke samples as the candidate stroke samples further comprises: determining an outline closest to an edge of the stroke sample in the at least one stroke sample to obtain the candidate stroke samples by opposite search algorithm; and using the candidate stroke samples as the references to generate the morphological sample groups by means of mirror paths and reverse paths; wherein each of the morphological sample groups comprises at least four morphological samples, and the four morphological samples are, respectively, a corresponding candidate stroke sample as one of the references, a mirror stroke sample of the corresponding candidate stroke sample, a reverse path stroke sample of the corresponding candidate stroke sample, and a reverse path stroke sample of the mirror stroke sample of the corresponding candidate stroke sample.

3. The interactive method according to claim 1, wherein the step of correcting the preliminary basic path to obtain the accurate basic path comprises: smoothing the preliminary basic path to obtain the accurate basic path by non-uniform rational B-spline curve algorithm.

4. The interactive method according to claim 1, wherein the step of selecting the morphological samples best matching the accurate basic path in the morphological sample groups as the final stroke samples comprises: dividing the accurate basic path into several path portions, and selecting, using energy formulas, a respective morphological sample in each of the morphological sample groups best matching each path portions as the final stroke samples of the path portions.

5. The interactive method according to claim 4, wherein the step of dividing the accurate basic path into several path portions, and selecting, using energy formulas, the respective morphological sample in each of the morphological sample groups best matching each path portions as the final stroke samples of the path portions, comprises: defining an energy term in l.sup.2 space by the energy formulas, wherein the energy term is configured to describe an overall difference between a displacement term of a stroke outlines in the final stroke samples and a displacement term of a corresponding accurate basic path (a corresponding path portion), and make the overall difference minimize, so as to automatically select the final stroke samples; wherein the displacement term is configured to describe a displacement between relative position vector and stroke direction vector at any point on the stroke outlines of the final stroke samples and relative position vector and stroke direction vector at any point of the accurate basic path.

6. The interactive method according to claim 5, wherein the step of mapping style features of the final stroke samples onto the accurate basic path comprises: adjusting an aspect ratio of each of the final stroke samples to make aspect ratios of the final stroke samples consistent with an aspect ratio of corresponding path portions.

7. The interactive method according to claim 5, wherein the step of the step of mapping style features of the final stroke sample onto the accurate basic path further comprises: rasterizing filling an area of the accurate basic path with scanning lines and filling pixels selected from the final stroke samples into the path portions corresponding to the final stroke samples by pixel-based texture mapping algorithm.

8. The interactive method according to claim 7, wherein the pixels are limited by following constraints: a. neighborhood pixels of p.sup.S have a color value closest to neighborhood pixels of p.sup.F; b. p.sup.S and p.sup.F are closest to their respective bone path; c. a color value of p.sup.S is closest to an average color value of pixels surrounding p.sup.P; wherein p.sup.S is a best pixel selected in a ink stroke area; p.sup.F is any one pixel in the area of the accurate basic path; p.sup.P is a pixel in the input image comprising the pattern; and the above constraints are measured by 3 energy terms E.sub.b(p.sup.S), E.sub.p(p.sup.S), and E.sub.a(p.sup.S); where E.sub.b(p.sup.S) corresponds to the constraint a and depicts a sum of the differences between color values of neighborhood pixels of p.sup.S and color values of neighborhood pixels of p.sup.F; E.sub.p(p.sup.S) corresponds to the constraint b and depicts how close and p.sup.F to their respective bone path; E.sub.a(p.sup.S) corresponds to the constraint c and depicts differences between an average color value of pixels in a circle centered on p.sup.S with a radius R and an average color value of pixels in a circle centered on p.sup.P with the radius R; wherein the three 3 energy terms satisfy following formulas: $\{\begin{array}{c}{E}_b\left(p^S\right)={.Math.}_{i,D\in \left\{S,F\right\}}^{.Math.p_i^D-p^D.Math.\le 1}.Math.\lambda \left(p_i^S\right)-\lambda \left(p_i^F\right).Math.\\ E_p\left(p^S\right)=.Math.\frac{p^S-C^S\left(\tilde{t}\right)}{r^S\left(\tilde{t}\right)}-\frac{p^F-C^P\left(\tilde{t}\right)}{r^P\left(\tilde{t}\right)}.Math.\\ E_a\left(p^S\right)=\frac{1}{N}.Math.{.Math.}_j^{.Math.p_j^S-p^S.Math.\le R}\lambda \left(p_j^S\right)-{.Math.}_j^{.Math.p_j^P-p^P.Math.\le R}\lambda \left(p_j^P\right).Math.\end{array}\hspace{1em}$ λ(p) represents a color value p; p.sub.i.sup.S of is a neighborhood pixel of p.sup.S; and p.sub.i.sup.F is a neighborhood pixel of p.sup.F; C.sup.P({tilde over (t)}) is a point closest to p.sup.F on the bone path; at a same value of {tilde over (t)}, C.sup.S({tilde over (t)}) is a corresponding point on the bone path in the final stroke samples; r.sup.S and r.sup.P are, respectively, half of a width of a corresponding final stroke sample; N represents number of pixels in the circle with the radius R; p.sub.j.sup.S represents a pixel near p.sup.S in the circle; p.sub.j.sup.P represents a pixel near p.sup.P within the specified circle of the image.

9. The interactive method according to claim 7, wherein the step of defining an energy equation composed of the three 3 energy terms in the l.sup.1 space and minimizing the three energy terms to get the best pixel, by pixel-based texture mapping algorithm comprises following formula: $\underset{p^S\in F^S}{\min }\left[{\alpha }_1{E}_b\left(p^S\right)+{\alpha }_2{E}_p\left(p^S\right)+{\alpha }_3{E}_a\left(p^S\right)\right];$ wherein α.sub.1, α.sub.2, and α.sub.3 represent balance weight parameters.

Description

BRIEF DESCRIPTION OF DRAWINGS

(1) In order to explain technical solutions of the present disclosure more clearly, the drawings needed in the embodiments will be briefly described below. Apparently, the drawings in the following description are merely some of the embodiments of the present disclosure, and those skilled in the art are able to obtain other drawings according to the drawings without contributing any inventive labor. In the drawing:

(2) FIG. 1 is a comparison diagram of an ink image generated by the present disclosure and an ink image generated by a conventional painting tool, where (b) is an ink image generated by the conventional painting tool, and (c) is the ink image generated by the present disclosure.

(3) FIG. 2 is an overall flow chart of the method of the present disclosure.

(4) FIG. 3 is an overall schematic diagram of a device of the present disclosure.

DETAILED DESCRIPTION

(5) Technical solutions in the embodiments of the present disclosure will be described clearly and completely in conjunction with the drawings in the embodiments of the present disclosure. Obviously, the described embodiments are only a part of the embodiments of the present disclosure, but not all of the embodiments. Based on the embodiments of the present disclosure, all other embodiments obtained by those ordinary skilled in the art without making creative efforts fall within the protection scope of the present disclosure.

(6) The present disclosure provides a plurality of embodiments. Specifically, as shown in FIG. 1, the present disclosure provides an interactive method for generating strokes with Chinese ink painting style, comprises steps

(7) S10: Obtaining an image including a pattern as an image object.

(8) A delimiting operation delimiting at least one stroke sample is obtained on a pre-stored ink painting sample.

(9) The image object comprises a pattern. The pattern is selected from animals, plants, etc. Specifically, the pattern is cattle, horses, flowers, plants, etc. A subject of the pre-stored ink painting sample is selected from animals, plants, etc. The subject of the pre-stored ink painting sample is consistent with the pattern in the image object. For example, if the subject of the pre-stored ink painting sample is flowers, and the subject of the pattern must be flowers for consistency. In other words, the image object selected is a template of a basic path that a user wants to outline, and the stroke sample is the stroke style feature of the basic path that the user wants

(10) S20: Obtaining a basic outline drawn by a user on the image object, the basic outline forming a preliminary basic path of a stroke to be generated.

(11) The basic outline drawn by the user is no need to be completely consistent with an actual outline of the pattern, and the basic outline drawn by the user may be a rough outline, and may also include user's creativity in it, such as adding lines that do not exist in the pattern as the template to the preliminary basic path.

(12) S30: Correcting stroke outlines in the at least one stroke sample to obtain accurate stroke samples as candidate stroke samples, using the candidate stroke samples as references to generate morphological sample groups.

(13) In a process of delimiting the at least one stroke sample, since only areas of desired strokes in the stroke sample are delimited, there are some non-stroke areas (the non-stroke areas hereto are portions that does not include lines of the stroke). Therefore, information in the areas of the stroke sample is not information of the accurate stroke outlines but also includes interference factors, which is not conducive to extract the specific stroke outlines in the stroke sample. At the same time, in order to ensure the user's efficiency and experience in selecting stroke samples, in the extraction of outlines of stroke sample, such interference factors are inevitable. In the embodiment, a stroke outline closest to an edge of the stroke sample in the at least one stroke sample is determined to obtain the candidate stroke samples by opposite search algorithm.

(14) In the opposite search algorithm, the stroke outlines in the stroke sample represents by a three curve structure (C.sup.S, L.sup.S, R.sup.S), where C.sup.S(t)∈I.sup.S, and is obtained by C.sup.S(t)=(L.sup.S(t)+R.sup.S(t))/2, and its domain F.sup.S as a rough outline of the candidate stroke sample is between L.sup.S and R.sup.S. L.sup.S and R.sup.S are two sides of the rough outline. Then the two sides L.sup.S and R.sup.S are fitted as curves L.sup.S(t) and R.sup.S(t), and curves L.sup.S(t) and R.sup.S(t) are divide into same number of curve segments. Assuming that end points on each curve segment are served as feature points on L.sup.S(t) and R.sup.S(t) a direction of the line from L.sup.S(t) to R.sup.S(t) is defined as a positive direction ω(t) of search. Then, direction derivatives D.sub.+ω and D.sub.−ω of gray value of each pixel is calculated along, respectively, the directions ω(t) and −ω(t). Finally, each pair of feature points is reset to a position of a global minimum of the direction derivative, so that the side L.sup.S and the side R.sup.S are adjusted to be the outline closest to the stroke in the stroke sample.

(15) The candidate stroke samples are used as the references to generate the morphological sample groups by means of mirror paths and reverse path to simulate different morphology of the candidate stroke samples. Each of the morphological sample groups comprises at least four morphological samples, and the four morphological samples are a corresponding candidate stroke sample as one of the references, a mirror stroke sample of the corresponding candidate stroke sample, a reverse path stroke sample of the corresponding candidate stroke sample, and a reverse path stroke sample of the mirror stroke sample of the corresponding candidate stroke sample.

(16) The three curve structure satisfies the formula (1), which is defined as follow:

(17) $\{\begin{array}{c}{S}_{4j}^S=\left(C_j^S\left(t\right),L_j^S\left(t\right),R_j^S\left(t\right)\right),\\ S_{4j+1}^S=\left(C_j^S\left(t\right),R_j^S\left(t\right),L_j^S\left(t\right)\right),\\ S_{4j+2}^S=\left(C_j^S\left(1-t\right),L_j^S\left(1-t\right),R_j^S\left(1-t\right)\right),\\ S_{4j+3}^S=\left(C_j^S\left(1-t\right),R_j^S\left(1-t\right),L_j^S\left(1-t\right)\right).\end{array}\hspace{1em}$

(18) Where the n is the number of the at least one stroke sample. A sum of the four situations (four morphological samples) of each stroke sample compose a candidate set including 4n elements (4n morphological samples), C={S.sub.i.sup.S|i=0, 1, . . . , 4n−1}, then the four situations of each stroke sample are. S.sub.4j.sup.S, S.sub.4j+1.sup.S, S.sub.4j+2.sup.S, S.sub.4j+3.sup.S (j=0, 1, . . . , n−1).

(19) S40: Correcting the preliminary basic path to obtain an accurate basic path.

(20) The preliminary basic path is drawn by the user, such that the preliminary basic path is rough and makes portions of the path uneven and rough. However, in ink painting style paintings, edges of their strokes are displayed in a relatively smooth manner. In order to accurately restore the lines of paintings in ink painting style, the preliminary basic path is smoothed to obtain the accurate basic path by non-uniform rational B-spline curve algorithm in the present disclosure.

(21) The preliminary basic path in the image object is represented by another the Curve structure (C.sup.P, L.sup.P, R.sup.P), and the three curve structure (C.sup.P, L.sup.P, R.sup.P) is smoothed by the non-uniform rational B-spline curve algorithm

(22) S50: Selecting morphological samples best matching the accurate basic path in the morphological sample groups as final stroke samples.

(23) The accurate basic path is divided into several path portions, and a respective morphological sample in each of the morphological sample groups best matching each path portions are selected using energy formulas as the final stroke samples of the path portions. The shape of the candidate stroke sample is relatively simple, which makes it difficult to match the accurate basic path. The multiple candidate stroke forms generated by the morphological sample groups increase a matching probability of the path portions and the candidate stroke.

(24) The embodiment is explained with the energy formula. an energy term E(S.sub.i.sup.S) is defined in space by the energy formulas to describe an overall difference between a displacement term δ of C.sub.i.sup.S and C.sup.P. The displacement term is configured to describe a displacement between relative position vector and stroke direction vector at any point on the stroke outlines and relative position vector and stroke direction vector at any point on the accurate basic path. Then the overall difference is minimized, so as to automatically select the final stroke samples, which satisfy the formula (2) defined as follow:

(25) $\underset{S_i^S\in C}{\min }E\left(S_i^S\right)={\int }_0^1{.Math.{\delta }_i^S\left(t\right)-{\delta }^P\left(t\right).Math.}^2\mathrm{dt}$

(26) Where the displacement term δ is obtained by formula (3), which is defined as follow:

(27) $\{\begin{array}{c}{\delta }_i^S\left(t\right)=C_i^S\left(t\right)-C_i^S\left(0\right)-C_i^{\mathrm{proj}},\\ C_i^{\mathrm{proj}}=\left(C_i^S\left(t\right)-C_i^S\left(0\right)\right).Math.{\hat{T}}_i,\\ {\hat{T}}_i=\frac{\left(C_i^S\left(1\right)-C_i^S\left(0\right)\right)}{.Math.C_i^S\left(1\right)-C_i^S\left(0\right).Math.}.\end{array}\hspace{1em}$

(28) C.sub.i.sup.S is any one of the basic paths. {circumflex over (T)}.sub.i is the line direction from C.sub.i.sup.S(0) to C.sub.i.sup.S(1). C.sub.i.sup.proj is a mapping of a relative position vector C.sub.i.sup.S(t)−C.sub.i.sup.S(0) of any point C.sub.i.sup.S(t) on C.sub.i.sup.S to {circumflex over (T)}.sub.i. δ.sub.i.sup.S(t) is the displacement from the closest point.

(29) S60: Mapping style features of the final stroke sample onto the accurate basic path to generate an output image with Chinese ink painting style.

(30) As described above, the morphological samples respectively corresponding to the path portions are obtained through the energy formulas, and then original path portions are replaced with the morphological samples corresponding the path portions to generate an outline that matches the characteristics of the stroke sample selected by the user. Then an aspect ratio of each of the final stroke samples is adjusted to make the aspect ratio of each of the final stroke samples consistent with an aspect ratio of their corresponding path portions. Then the area is rasterizing filled with scanning lines and pixels selected from the final stroke samples are filled into the path portions corresponding to the final stroke samples by pixel-based texture mapping algorithm.

(31) In a process of adjusting the aspect ratio of each of the final stroke samples to make the aspect ratio of each of the final stroke samples consistent with an aspect ratio of their corresponding path portions, a final stroke width w.sup.P(t) is related to length and curvature of the accurate basic path C.sup.P on the image object. w.sup.P (t) is obtained by the formula (4), which is defined as follow:

(32) $w^P\left(t\right)=\frac{k_w\left(t\right){\kappa }^P\left(t\right)}{\sqrt{L^P}}$

(33) k.sub.w(t) is a factor that scales the width of the final stroke samples, and L.sup.P and κ.sup.P(t) respectively, represent the length of the accurate basic path and the curvature of the accurate basic path. k.sub.w(t) is obtained by the formula (5), which is defined as follow:

(34) $k_w\left(t\right)=\frac{w^S\left(t\right)\sqrt{L^S}}{{\kappa }^S\left(t\right)}$

(35) κ.sup.S(t) represents the curvature of the accurate basic path C.sup.S(t). L.sup.S represents the length of C.sup.S(t).

(36) In a process of rasterizing filling an area of the accurate basic path with scanning lines and filling pixels selected from the final stroke samples into the path portions corresponding to the final stroke samples by pixel-based texture mapping algorithm, the pixels are limited by following constraints:

(37) a. neighborhood pixels of p.sup.S have a color value closest to neighborhood pixels of p.sup.F;

(38) b. p.sup.S and p.sup.F are closest to their respective bone path;

(39) c. a color value of p.sup.S is closest to an average color value of pixels surrounding p.sup.P.

(40) Where is p.sup.S a best pixel selected in a ink stroke area p.sup.F is any one of pixels in the area of the accurate basic path. p.sup.P is a pixel in the input image including the pattern. And the above constraints are measured by 3 energy terms E.sub.b(p.sup.S), E.sub.p(p.sup.S) and E.sub.a(p.sup.S). E.sub.b(p.sup.S) corresponds to the constraint a and depicts a sum of the differences between color values of neighborhood pixels of p.sup.S and color values of neighborhood pixels of p.sup.F.

(41) E.sub.p(p.sup.S) corresponds to the constraint b and depicts how close p.sup.S and p.sup.F are to their respective bone path.

(42) E.sub.a(p.sup.S) corresponds to the constraint c and depicts differences between an average color value of pixels in a circle centered on p.sup.S with a radius R and an average color value of pixels in a circle centered on p.sup.P with the radius R.

(43) Where the three 3 energy terms satisfy following formulas:

(44) $\{\begin{array}{c}{E}_b\left(p^S\right)={.Math.}_{i,D\in \left\{S,F\right\}}^{.Math.p_i^D-p^D.Math.\le 1}.Math.\lambda \left(p_i^S\right)-\lambda \left(p_i^F\right).Math.\\ E_p\left(p^S\right)=.Math.\frac{p^S-C^S\left(\tilde{t}\right)}{r^S\left(\tilde{t}\right)}-\frac{p^F-C^P\left(\tilde{t}\right)}{r^P\left(\tilde{t}\right)}.Math.\\ E_a\left(p^S\right)=\frac{1}{N}.Math.{.Math.}_j^{.Math.p_j^S-p^S.Math.\le R}\lambda \left(p_j^S\right)-{.Math.}_j^{.Math.p_j^P-p^P.Math.\le R}\lambda \left(p_j^P\right).Math.\end{array}\hspace{1em}$

(45) λ(p) represents a color value of p. p.sub.i.sup.S is a neighborhood pixel of p.sup.S. p.sub.i.sup.F is a neighborhood pixel of p.sup.F. C.sup.P({tilde over (t)}) is a point closest to p.sup.F on the bone path. At a same value of {tilde over (t)}. C.sup.S({tilde over (t)}) is a corresponding point on the bone path in the final stroke sample, and r.sup.S and r.sup.P are, respectively, half of the width of the final stroke sample. N represents number of pixels in the circle with the radius R. p.sub.j.sup.S represents a pixel near p.sup.S in the circle. p.sub.j.sup.P represents a pixel near p.sup.P within the specified circle of the image.

(46) The step of defining the energy equation composed of the three 3 energy terms in the space and minimizing the three energy terms to get the best pixel by pixel-based texture mapping algorithm satisfies following formula:

(47) $\underset{p^S\in F^S}{\min }\left[{\alpha }_1{E}_b\left(p^S\right)+{\alpha }_2{E}_p\left(p^S\right)+{\alpha }_3{E}_a\left(p^S\right)\right].$

(48) Where α.sub.1, α.sub.2, and α.sub.3 represent balance weight parameters.

(49) S70: Selecting and implanting a decorative element into the Chinese ink painting style output image according to the user's intention after the Chinese ink painting style output image is generated to generate a final painting result.

(50) In the embodiment, the decorative element is, for example, a literati inscription, however, the present disclosure is not limited thereto.

(51) As shown in FIGS. 2 and 3, the present disclosure provides a device for generating strokes with Chinese ink painting style. The device comprises: an image selecting unit selecting an image including a pattern as an image object;

(52) a stroke sample selecting unit delimiting at least one stroke sample on a pre-stored ink painting sample;

(53) a preliminary basic path selecting unit drawing a basic outline of the pattern on the image object to form a preliminary basic path of a stroke to be generated;

(54) a stroke sample correcting unit correcting the outline of the delimited stroke sample to obtain an accurate stroke sample as a candidate stroke sample;

(55) a morphological sample group generating unit generating morphological sample groups with reference to the candidate stroke samples;

(56) a preliminary basic path correcting unit correcting the preliminary basic path to obtain an accurate basic path;

(57) a final stroke sample selecting unit selecting morphological samples best matching the accurate basic path in the morphological sample groups as final stroke samples; and

(58) a style feature mapping unit mapping style features of the final stroke samples onto the accurate basic path to generate an output image with Chinese ink painting style.

(59) The present disclosure further provides a terminal device for generating strokes with Chinese ink painting style. The terminal device comprises a processor, a memory, and a computer program stored in the memory and configured to be executed by the processor. The processor executes the computer program, which is the computer program for generating strokes with Chinese ink painting style.

(60) In one embodiment, the computer program is divided into one or more modules, and the one or more modules are stored in the memory and executed by the processor to complete the present disclosure. The one or more modules is a series of computer program instruction segments capable of performing specific functions. The instruction segments are configured to describe the execution process of the computer program in the terminal device for generating strokes with Chinese ink painting style.

(61) The terminal device for generating strokes with Chinese ink painting style is a computing device such as a desktop computer, a notebook, a palmtop computer, a cloud server, etc.

(62) The terminal device for generating strokes with Chinese ink painting style may include, but is not limited to, the processor, the memory, and a display. Those skilled in the art understand that the schematic diagram is only an example of the terminal device for generating strokes with Chinese ink painting style, and does not intend to limit the terminal device for generating strokes with Chinese ink painting style, and the terminal device for generating strokes with Chinese ink painting style may include more or fewer components, or a combination of certain components or different components. For example, the terminal device for generating strokes with Chinese ink painting style may also include input and output devices, network access devices, buses, etc.

(63) The processor may be a central processing unit (CPU), a general-purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The general-purpose processor may be a microprocessor or any conventional processor, etc. The processor is a control center of the terminal device generating strokes with Chinese ink painting style, which is connected with all parts of the terminal device for generating strokes with Chinese ink painting style by various interfaces and lines.

(64) The memory is configured to store the computer programs and/or computer modules. The processor realizes various functions of the terminal device for generating strokes with Chinese ink painting style by executing computer programs and/or computer modules stored in the memory and invoking data stored in the memory. The memory mainly includes a storage program area and a storage data area. The storage program area stores an operating system, an application program that at least one function (such as sound playback function, text conversion function) required and etc. The storage data area stores data created according to the use of the terminal device (e.g. a mobile phones), such as audio data, text messages data, etc. In addition, the memory is selected from a high-speed random access memory, or a non-volatile memory (such as a hard disk, memory, plug-in hard disk, smart media card (SMC), secure digital (SD) card, flash card, at least one disk storage device, a flash memory device, or other non-volatile storage devices).

(65) In one embodiment, if an integrated module of the terminal device for generating strokes with Chinese ink painting style is implemented in a form of a software functional unit and is sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this, all or part of the processes in the above embodiments of the method are realized by the present disclosure or by a computer program instructing relevant hardware.

(66) The computer program may be stored in the computer-readable storage medium. When the computer program is executed by the processor, the steps of the foregoing embodiments of the method are realized. In one embodiment, the computer program includes computer program code. The computer program code is selected from a form such as source code form, object code form, executable file form, or some intermediate form. The computer-readable storage medium is: an entity or a device capable of carrying the computer program code, a recording medium, a USB flash disk, a mobile hard disk, a magnetic disk, an optical disk, a computer memory, a read-only memory (ROM), random access memory (RAM), electrical carrier signals, telecommunications signals, or software distribution media, etc. It should be noted that content contained in the computer-readable storage medium can be appropriately increased or decreased according to requirements of legislation and patent practice in jurisdictions. For example, in some jurisdictions, the computer-readable storage medium does not include electrical carrier signals and telecommunications signals.

(67) It should be noted that the embodiments described above of the device are only schematic embodiments, where the units described as separate components may or may not be physically separated, the component displayed as a unit may or may not be a physical unit. That is, the units could be located in one place, or could be distributed to multiple network elements. Moreover, some or all of the modules may be selected according to actual needs to realize the purpose of the embodiment. In addition, in the drawings of the embodiments of the device provided by the present disclosure, there is a connection relationship between the modules and the connection is a communication connection, which is specifically realized by one or more communication buses or signal lines. Those ordinary skilled in the art are able to understand and implement without paying creative labor.

(68) The above is some optional embodiments of the present disclosure. It should be pointed out that for those ordinary skilled in the art, without departing from the principles of the present disclosure several improvements and retouches are able to be made. These improvements and retouches are also regarded as within the protection scope of the present disclosure.