| Literature DB >> 35814580 |
Abstract
With the development of computer technology, animation is more and more used because of its simple, effective, and higher performance. Machine learning has become the core of artificial intelligence at present. Intelligent learning algorithms are widely used in practical problems such as evaluation. Knowledge-based automatic animation production system faces two challenges: (1) lack of learning ability and waste of data on the website; (2) the quality of animation produced that depends on the level of system designer and the inability of system users to participate in animation production.In order to solve these two problems, an active animation learning system enables the animation system to constantly learn experience and produce the most popular animation, for the first time, for animation production system design and implementation of applied research. Image retrieval technology is a research center in the field of image application. It is widely used in many fields, such as electronic commerce. Animation design will use dynamic image and machine learning to innovate.Entities:
Mesh:
Year: 2022 PMID: 35814580 PMCID: PMC9262498 DOI: 10.1155/2022/2690415
Source DB: PubMed Journal: Comput Intell Neurosci
Figure 1Frame difference method.
Figure 2Background difference method.
Figure 3Schematic illustration of the pyramid optical flow method.
Comparison of three dynamic target detection methods.
| Interframe difference method | Background difference method | Optical flow method | |
|---|---|---|---|
| Operation complexity | Small | Middle East | Large |
| Operation speed | Hurry | Slow | Slow |
| Scope of use | Background relatively fixed | Background relatively fixed | Background removable |
| Results of operations | The entire region of the dynamic target cannot be extracted, and the contour is incoherent | The whole area of the dynamic target can be obtained, and time-consuming modeling is sensitive to light | The dynamic effect can be obtained in the whole area, but it is easy to be affected by noise and difficult to apply |
Comparison of four algorithms.
| 2-frame difference method (fps) | 3-frame difference method (fps) | SGM (fps) | GMM (fps) | |
|---|---|---|---|---|
| Highway | 1 | 1 | 12 | 8 |
| People | 2 | 3 | 36 | 32 |
Cluster results.
| Algorithm | Average distance between classes | Average variance within class | Number of iterations | Duration (ms) |
|---|---|---|---|---|
| K-Means algorithm | 277.252 | 36.672 | 23 | 1643 |
| An improved K-Means algorithm | 344.887 | 22.954 | 11 | 560 |
Improved K-Means algorithm.
| Input | User input data set | |||
| Output | Clustering of | |||
|
| ||||
| 1 | Scan the original data set to find the two data points with the largest distance as the initial clustering center C, and the | |||
| 2 | Referring to the maximum and minimum clustering method, the distance from each point to each cluster center in the data set is viewed, and the shortest distance is taken and recorded. | |||
| 3 | The shortest distance from each point to each type of center is compared, and the data point with the maximum distance is taken as the candidate of the new cluster center. At this time, the previous cluster center should be saved to find that the cluster center candidate is not suitable and goes back to the previous result. The result of the new cluster center should be reclustered, the cluster center should be updated, and the value DBI the objective function should be updated for the K+ cluster. | |||
| 4 | According to the previous analysis, it is judged whether the new | |||
| 5 | The result of the optimal | |||
Figure 4Schematic diagram of interactive content.
Figure 5Flowchart of active learning.
Figure 6Establishment and search of image index.