FEATURE POINT CORRESPONDENCE IN THE PRESENCE OF OCCLUSION

被引：83

作者：

SALARI, V

SETHI, IK

机构：

[1] Department of Computer Science, Wayne State University, Detroit

来源：

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE | 1990年 / 12卷 / 01期

关键词：

Correspondence; Dynamic scenes; Motion; Occlusion; Smoothness of motion; Tracking;

D O I：

10.1109/34.41387

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Occlusion and poor feature point detection are two main difficulties in the use of multiple frames for establishing correspondence of feature points. A new formulation of the correspondence problem as an optimisation problem is discussed to handle these difficulties. Modifications to an existing iterative optimization procedure are discussed to solve the new formulation of the correspondence problem. Experimental results are presented to show the merits of the new formulation. © 1990 IEEE.

引用

页码：87 / 91

页数：5