2017
DOI: 10.1049/iet-cvi.2017.0176
|View full text |Cite
|
Sign up to set email alerts
|

Target tracking approach via quantum genetic algorithm

Abstract: Aiming at an efficient feature match and similarity search in visual tracking, this study proposes a tracking algorithm based on quantum genetic algorithm. Therein, the global optimisation ability of quantum genetic algorithm is utilised. In the framework of quantum genetic algorithm, the positions of pixels are taken as individuals in population, while scale-invariant feature transform and colour features are taken as target model. Via defining the objective function, individual's fitness values can be measur… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 15 publications
(9 citation statements)
references
References 51 publications
0
9
0
Order By: Relevance
“…, m is the quantum number, and n is the population size. In addition, the normalization condition (as shown in equation 3) needs to be satisfied [13].…”
Section: ) Quantum Bit Codingmentioning
confidence: 99%
See 1 more Smart Citation
“…, m is the quantum number, and n is the population size. In addition, the normalization condition (as shown in equation 3) needs to be satisfied [13].…”
Section: ) Quantum Bit Codingmentioning
confidence: 99%
“…Then, the fitness of the individual is calculated as equation (12). Step3: The termination condition of the iterative calculation is shown in equation (13).…”
Section: A Qga-lvq Neural Networkmentioning
confidence: 99%
“…The genetic algorithm (GA) [43] is a kind of method to deal with complex optimization problems by simulating the rules of survival of the fittest and the mechanism of chromosome information exchange within the population. The quantum genetic algorithm (QGA) [44][45][46][47] is based on the state vector representation of quantum. It refers the probability amplitude representation of quantum bits to the coding of chromosomes, so that a chromosome can express the superposition of multiple states, and uses quantum revolving gate and quantum non-gate to realize the finer operation of chromosomes, thus achieving the optimal solution of the goal.…”
Section: Quantum Evolutionary Algorithmmentioning
confidence: 99%
“…The terminal resistance is the optimization parameter. There are series of optimization algorithms that have been put forward to solve this type of optimization problem, such as Genetic algorithm [9,10], Ant Colony Algorithm [11,12], Simulated Annealing Algorithm [13,14], Particle Swarm Optimization [15,16], etc. Particle Swarm Optimization is a spatial search algorithm that solves the optimization problem and is very suitable for solving multidimensional problems.…”
Section: Introductionmentioning
confidence: 99%