资源分类
》 资源 》论文》Solving Image Registration Problems Using Interior Point Methods

Solving Image Registration Problems Using Interior Point Methods

2020-03-30 | |  69 |   57 |   0

Abstract

This paper describes a novel approach to recovering a para- metric deformation that optimally registers one image to another. The method proceeds by constructing a global convex approximation to the match function which can be optimized using interior point meth- ods. The paper also describes how one can exploit the structure of the resulting optimization problem to develop efficient and effective match- ing algorithms. Results obtained by applying the proposed scheme to a variety of images are presented.

上一篇：A Fast Algorithm for Creating a Compact and Discriminative Visual Codebook

下一篇：What Is a Good Nearest Neighbors Algorithm for Finding Similar Patches in Images?

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...