A Constrained Alternating Optimization Framework for Feature Matching

This paper proposes a constrained alternating optimization framework to tackle the feature matching problem with partial matching and multiple matching. We model the difference between pairing features as the result of a transformation followed an uncertainty distribution. Based on this modeling, transformation estimation and feature matching are performed alternately from initial matching: the transformation is updated according to the matching, and the matching is updated according to the transformation and the uncertainty distribution. A pruning operation is further presented to reduce the search space of initial matching. In the proposed framework, we develop a B-spline curve feature matching algorithm for hand-gesture based text input, and a line feature matching algorithm which is tested for three applications: model-based recognition, image registration, and stereo matching. The experimental results for two algorithms are reported

A Constrained Alternating Optimization Framework for Feature Matching

This paper proposes a constrained alternating optimization framework to tackle the feature matching problem with partial matching and multiple matching. We model the difference between pairing features as the result of a transformation followed an uncertainty distribution. Based on this modeling, transformation estimation and feature matching are performed alternately from initial matching: the transformation is updated according to the matching, and the matching is updated according to the transformation and the uncertainty distribution. A pruning operation is further presented to reduce the search space of initial matching. In the proposed framework, we develop a B-spline curve feature matching algorithm for hand-gesture based text input, and a line feature matching algorithm which is tested for three applications: model-based recognition, image registration, and stereo matching. The experimental results for two algorithms are reported