@article {796,
	title = {A Second Order Multi-Stencil Fast Marching Method With a Non-Constant Local Cost Model},
	journal = {IEEE Transactions on Image Processing},
	volume = {28},
	year = {2019},
	month = {04/2019},
	pages = {1967{\textendash}1979},
	abstract = {<p>The fast marching method is widely employed in several fields of image processing. Some years ago a multi-stencil version (MSFM) was introduced to improve its accuracy by solving the equation for a set of stencils and choosing the best solution at each considered node. The following work proposes a modified numerical scheme for MSFM to take into account the variation of the local cost, which has proven to be second order. The influence of the stencil set choice on the algorithm outcome with respect to stencil orthogonality and axis swapping is also explored, where stencils are taken from neighborhoods of varying radius. The experimental results show that the proposed schemes improve the accuracy of their original counterparts, and that the use of permutation-invariant stencil sets provides robustness against shifted vector coordinates in the stencil set.</p>
},
	keywords = {Approximation algorithms, Differential equations, Eikonal equation, Frequency modulation, MSFM, Mathematical model, Silicon, Three-dimensional displays, Unmanned aerial vehicles, Vectors, axis swapping, difference equations, fast marching methods, finite difference methods, finite differences, image processing, iterative methods, least squares approximations, multi-stencil schemes, multistencil version, nonconstant local cost model, permutation-invariant stencil sets, second order multistencil fast marching method, stencil orthogonality, stencil set},
	issn = {1057-7149},
	doi = {10.1109/TIP.2018.2880507},
	url = {https://ieeexplore.ieee.org/document/8531783/},
	author = {S. Merino-Caviedes and Lucilio Cordero-Grande and M. T. P{\'e}rez and Pablo Casaseca-de-la-Higuera and M. Mart{\'\i}n-Fern{\'a}ndez and R. Deriche and C. Alberola-L{\'o}pez}
}
@article {419,
	title = {A fast B-spline pseudo-inversion algorithm for consistent image registration},
	journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	volume = {4673 LNCS},
	year = {2007},
	pages = {768-775},
	abstract = {<p>Recently, the concept of consistent image registration has been introduced to refer to a set of algorithms that estimate both the direct and inverse deformation together, that is, they exchange the roles of the target and the scene images alternatively; it has been demonstrated that this technique improves the registration accuracy, and that the biological significance of the obtained deformations is also improved. When dealing with free form deformations, the inversion of the transformations obtained becomes computationally intensive. In this paper, we suggest the parametrization of such deformations by means of a cubic B-spline, and its approximated inversion using a highly efficient algorithm. The results show that the consistency constraint notably improves the registration accuracy, especially in cases of a heavy initial misregistration, with very little computational overload. {\^A}{\textcopyright} Springer-Verlag Berlin Heidelberg 2007.</p>
},
	keywords = {Approximation algorithms, Computational overload, Consistent registration, Constraint theory, Image registration, Inverse problems, Inverse transformation, Parameterization},
	isbn = {9783540742715},
	issn = {03029743},
	url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-38149022572\&partnerID=40\&md5=627751cd7654872cbd9ee74a249752eb},
	author = {Antonio Trist{\'a}n-Vega and J I Arribas}
}
