An improved particle swarm optimisation for video image segmentation (Q2221564)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An improved particle swarm optimisation for video image segmentation |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improved particle swarm optimisation for video image segmentation |
scientific article |
Statements
An improved particle swarm optimisation for video image segmentation (English)
0 references
2 February 2021
0 references
Summary: Video image segmentation is the key step of objects classification and recognition. Threshold-based image segmentation algorithms, especially those based on the two-dimensional maximum entropy, have been studied by many scholars now. Although there are many algorithms that can get the entropy, they have their own weaknesses. For instances, the exhaustive search algorithm is time-consuming to implement the real-time image segmentation, the convergence rate of the traditional genetic algorithm is relatively slow, the standard particle swarm algorithm is prone to premature and difficult to get the optimal solution in the high-dimensional data space. In this paper, we proposed an improved particle swarm optimisation algorithm based on the law of universal gravitation to obtain the optimal entropy. Experimental results show that the improved algorithm is robust and obtain fast convergence rate.
0 references
particle swarm algorithm
0 references
entropy
0 references
image segmentation
0 references
genetic algorithm
0 references