Reliable RANSAC Using a Novel Preprocessing Model

Geometric assumption and verification with RANSAC has become a crucial step for corresponding to local features due to its wide applications in biomedical feature analysis and vision computing. However, conventional RANSAC is very time-consuming due to redundant sampling times, especially dealing wi...

Full description

Bibliographic Details
Main Authors: Xiaoyan Wang, Hui Zhang, Sheng Liu
Format: Article
Language:English
Published: Hindawi Limited 2013-01-01
Series:Computational and Mathematical Methods in Medicine
Online Access:http://dx.doi.org/10.1155/2013/672509
id doaj-e21152c9c61d40ef80f3e19695b0aff2
record_format Article
spelling doaj-e21152c9c61d40ef80f3e19695b0aff22020-11-24T22:06:44ZengHindawi LimitedComputational and Mathematical Methods in Medicine1748-670X1748-67182013-01-01201310.1155/2013/672509672509Reliable RANSAC Using a Novel Preprocessing ModelXiaoyan Wang0Hui Zhang1Sheng Liu2School of Computer Science and Technology, Zhejiang University of Technology, Hangzhou 310023, ChinaCollege of Information Engineering, Zhejiang University of Technology, Hangzhou 310023, ChinaSchool of Computer Science and Technology, Zhejiang University of Technology, Hangzhou 310023, ChinaGeometric assumption and verification with RANSAC has become a crucial step for corresponding to local features due to its wide applications in biomedical feature analysis and vision computing. However, conventional RANSAC is very time-consuming due to redundant sampling times, especially dealing with the case of numerous matching pairs. This paper presents a novel preprocessing model to explore a reduced set with reliable correspondences from initial matching dataset. Both geometric model generation and verification are carried out on this reduced set, which leads to considerable speedups. Afterwards, this paper proposes a reliable RANSAC framework using preprocessing model, which was implemented and verified using Harris and SIFT features, respectively. Compared with traditional RANSAC, experimental results show that our method is more efficient.http://dx.doi.org/10.1155/2013/672509
collection DOAJ
language English
format Article
sources DOAJ
author Xiaoyan Wang
Hui Zhang
Sheng Liu
spellingShingle Xiaoyan Wang
Hui Zhang
Sheng Liu
Reliable RANSAC Using a Novel Preprocessing Model
Computational and Mathematical Methods in Medicine
author_facet Xiaoyan Wang
Hui Zhang
Sheng Liu
author_sort Xiaoyan Wang
title Reliable RANSAC Using a Novel Preprocessing Model
title_short Reliable RANSAC Using a Novel Preprocessing Model
title_full Reliable RANSAC Using a Novel Preprocessing Model
title_fullStr Reliable RANSAC Using a Novel Preprocessing Model
title_full_unstemmed Reliable RANSAC Using a Novel Preprocessing Model
title_sort reliable ransac using a novel preprocessing model
publisher Hindawi Limited
series Computational and Mathematical Methods in Medicine
issn 1748-670X
1748-6718
publishDate 2013-01-01
description Geometric assumption and verification with RANSAC has become a crucial step for corresponding to local features due to its wide applications in biomedical feature analysis and vision computing. However, conventional RANSAC is very time-consuming due to redundant sampling times, especially dealing with the case of numerous matching pairs. This paper presents a novel preprocessing model to explore a reduced set with reliable correspondences from initial matching dataset. Both geometric model generation and verification are carried out on this reduced set, which leads to considerable speedups. Afterwards, this paper proposes a reliable RANSAC framework using preprocessing model, which was implemented and verified using Harris and SIFT features, respectively. Compared with traditional RANSAC, experimental results show that our method is more efficient.
url http://dx.doi.org/10.1155/2013/672509
work_keys_str_mv AT xiaoyanwang reliableransacusinganovelpreprocessingmodel
AT huizhang reliableransacusinganovelpreprocessingmodel
AT shengliu reliableransacusinganovelpreprocessingmodel
_version_ 1725822105292898304