2014
DOI: 10.1007/978-3-319-09955-2_9
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Neighbourhood Computing for Discrete Rigid Transformation Graph Search

Abstract: International audienceRigid transformations are involved in a wide variety of image processing applications, including image registration. In this context, we recently proposed to deal with the associated optimization problem from a purely discrete point of view, using the notion of discrete rigid transformation (DRT) graph. In particular, a local search scheme within the DRT graph to compute a locally optimal solution without any numerical approximation was formerly proposed. In this article, we extend this s… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2017
2017
2017
2017

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 22 publications
0
1
0
Order By: Relevance
“…The remainder of this article -that is an extended and improved version of the conference papers [5,6] -is organized as follows. Section 2 introduces and formalizes the optimization problem of image registration, and our specific purpose, namely discrete 40 image registration.…”
Section: Introductionmentioning
confidence: 99%
“…The remainder of this article -that is an extended and improved version of the conference papers [5,6] -is organized as follows. Section 2 introduces and formalizes the optimization problem of image registration, and our specific purpose, namely discrete 40 image registration.…”
Section: Introductionmentioning
confidence: 99%