2019
DOI: 10.1016/j.amc.2018.12.051
|View full text |Cite
|
Sign up to set email alerts
|

A lattice Boltzmann method applied to the fluid image registration

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
5
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 7 publications
(5 citation statements)
references
References 46 publications
0
5
0
Order By: Relevance
“…In our work, we propose a new method to control these weight parameters based on Boltzmann function. Boltzmann function has shown efficiency with the Simulate Annealing algorithm [24][25][26][27][28][29][30] as an acceptance probability function which allows to avoid getting stuck at a local minimum. The temperature T gradually reduces so that the probability of accepting an up-hill move also gradually reduces.…”
Section: The Modified Choice Function With Boltzmann Functionmentioning
confidence: 99%
“…In our work, we propose a new method to control these weight parameters based on Boltzmann function. Boltzmann function has shown efficiency with the Simulate Annealing algorithm [24][25][26][27][28][29][30] as an acceptance probability function which allows to avoid getting stuck at a local minimum. The temperature T gradually reduces so that the probability of accepting an up-hill move also gradually reduces.…”
Section: The Modified Choice Function With Boltzmann Functionmentioning
confidence: 99%
“…Generally, image registration problems can be classified into two types: intensity-based methods and feature-based methods. The first type methods are based on the image's gray spaces [2,3,20], while the second ones exploit the difference features existing between the given images, such as regions and edges, to find the correspondences in the image's feature spaces [23]. In most cases, the image registration task is formulated as an optimization problem involving a distance measure to evaluate the similarity.…”
Section: Introductionmentioning
confidence: 99%
“…Using the Chapman Enskog transformation, a partial differential equation can be obtained, including the level set function. This method's advantage is that implementing a computer program is relatively simple, and the execution time is shorter [17]. Balla-Arabé and Gao (2012) proposed image multi-thresholding by combining the LBM and a localized level set algorithm [18].…”
Section: Introductionmentioning
confidence: 99%