Robust Non-Parametric Template Matching with Local Rigidity Constraints
نویسندگان
چکیده
منابع مشابه
Non-Parametric Kernel Learning with robust pairwise constraints
For existing kernel learning based semi-supervised clustering algorithms, it is generally difficult to scale well with large scale datasets and robust pairwise constraints. In this paper, we proposed a new Non-Parametric Kernel Learning framework (NPKL) to deal with these problems. We generalized the graph embedding framework into kernel learning, by reforming it as a semi-definitive programmin...
متن کاملImage Registration with Local Rigidity Constraints
Registration is a technique nowadays commonly used in medical imaging. A drawback of most of the current registration schemes is that all tissue is being considered as non-rigid. Therefore, rigid objects in an image, such as bony structures or surgical instruments, may be transformed non-rigidly. In this paper, we integrate the concept of local rigidity to the FLexible Image Registration Toolbo...
متن کاملReal Time Robust Template Matching
One of the most popular methods to extract useful informations from an image sequence is the template matching approach. In this well known method the tracking of a certain feature or target over time is based on the comparison of the content of each image with a sample template. In this article, we propose an efficient robust template matching algorithm that is able to track targets in real ti...
متن کاملRobust Dense Matching Using Local and Global Geometric Constraints
A new robust dense matching algorithm is introduced in this paper: The algorithm starts from matching the most textured points, then a match propagation algorithm is developed with the best first strategy to densib the matches. Next, the matching map is regularised by using the local geometric constraints encoded by planar affine applications and by using the global geometric constraint encoded...
متن کاملMatching Point Features with Ordered Geometric, Rigidity, and Disparity Constraints
1041 and then the line invariant (6) was computed for each pair of line sets and compared using the metric (7). The sets of lines chosen are given in the following table (refer to Fig. I). The table in (9) shows the results. The only bad entry in this matnx is in the position (4, 4). This is because of the fact that the four lines chosen,contained three coplanar lines (lines B. D and E). This c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2016
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.2015edp7492