Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "quantum particle swarm optimization" wg kryterium: Temat


Wyświetlanie 1-2 z 2
Tytuł:
Quantum-inspired particle swarm optimization algorithm with performance evaluation of fused images
Autorzy:
Le, Z
Xinman, Z.
Xuebin, X
Dong, W.
Jie, L.
Yang, L.
Powiązania:
https://bibliotekanauki.pl/articles/174501.pdf
Data publikacji:
2013
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
multifocus image fusion
quantum particle swarm optimization
perfect reconstruction
superior speed
Opis:
In order to improve and accelerate the speed of image integration, an optimal and intelligent method for multi-focus image fusion is presented in this paper. Based on particle swarm optimization and quantum theory, quantum particle swarm optimization (QPSO) intelligent search strategy is introduced in salience analysis of a contrast visual masking system, combined with the segmentation technique. The superiority of QPSO is quantum parallelism. It has stronger search ability and quicker convergence speed. When compared with other classical or novel fusion methods, several metrics for image definition are exploited to evaluate the performance of all the adopted methods objectively. Experiments are performed on both artificial multi-focus images and digital camera multi-focus images. The results show that QPSO algorithm is more efficient than non-subsampled contourlet transform, genetic algorithm, binary particle swarm optimization, etc. The simulation results demonstrate that QPSO is a satisfying image fusion method with high accuracy and high speed.
Źródło:
Optica Applicata; 2013, 43, 4; 679-691
0078-5466
1899-7015
Pojawia się w:
Optica Applicata
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Multi-swarm that learns
Autorzy:
Trojanowski, K.
Powiązania:
https://bibliotekanauki.pl/articles/969816.pdf
Data publikacji:
2010
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
particle swarm optimization (PSO)
multi-swarm
dynamic optimization
memory
clusters
clustering evolving data streams
quantum particles
Opis:
This paper studies particle swarm optimization approach enriched by two versions of an extension aimed at gathering information during the optimization process. Application of these extensions, called memory mechanisms, increases computational cost, but it is spent to a benefit by incorporating the knowledge about the problem into the algorithm and this way improving its search abilities. The first mechanism is based on the idea of storing explicit solutions while the second one applies one-pass clustering algorithm to build clusters containing search experiences. The main disadvantage of the former mechanism is lack of good rules for identification of outdated solutions among the remembered ones and as a consequence unlimited growth of the memory structures as the optimization process goes. The latter mechanism uses other form of knowledge representation and thus allows us to control the amount of allocated resources more efficiently than the former one. Both mechanisms have been experimentally verified and their advantages and disadvantages in application for different types of optimized environments are discussed.
Źródło:
Control and Cybernetics; 2010, 39, 2; 359-375
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-2 z 2

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies