|Topic:||Fast image registration using linear programming and sparse sampling|
|Description:||We shall start from a very fast registration technique , which is based on choosing keypoints on class boundaries, sampling their neighborhood in a normal direction, approximating the criterion using piecewise linear functions, and linear programming. Possible tasks include: coupling with a very fast segmentation method, extension to 3D, automatic choice of reliable keypoints, tailor-made innerpoint method optimization, optimized multiresolution and termination criterion, etc.
|Bibliography:||Kybic, Borovec: Fast registration by boundary sampling and linear programming. MICCAI 2018