Plane parameter estimation by edge set matching
نویسندگان
چکیده
A new method for plane hypothesis generation based on a sweeping process is presented. The method is feature based in contradiction to earlier methods which rely on image correlation. The features used are edgel elements (’edgels’) which are extracted in a preprocessing step. The experiments show an improvement in speed as well as in accuracy.
منابع مشابه
A Multi-temporal Image Registration Method Based on Edge Matching and Maximum Likelihood Estimation Sample Consensus
In the paper, we propose a newly registration method for multi-temporal image registration. Multi-temporal image registration has two difficulties: one is how to design matching strategy to gain enough initial correspondence points. Because the wrong matching correspondence points are unavoidable, we are unable to know how many outliers, so the second difficult of registration is how to calcula...
متن کاملارائه روشی برای حذف خطای نوارشدگی در تصاویر سنجنده های آرایه خطی
In this paper a destriping technique is proposed for pushbroom-type satellite imaging systems. This technique is based on Moment Matching algorithm and assumes a linear response for each detector of imaging system. In the most of the works in this field, the offset parameter in detectors’ response is neglected and images are corrected using only an estimation of gain parameter. Proposed m...
متن کاملEvaluation of the Parameters Involved in the Iris Recognition System
Biometric recognition is an automatic identification method which is based on unique features or characteristics possessed by human beings and Iris recognition has proved itself as one of the most reliable biometric methods available owing to the accuracy provided by its unique epigenetic patterns. The main steps in any iris recognition system are image acquisition, iris segmentation, iris norm...
متن کاملOn the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model
Given a set of n points P in the plane, each colored with one of the t given colors, a color-spanning set S ⊂ P is a subset of t points with distinct colors. The minimum diameter color-spanning set (MDCS) is a color-spanning set whose diameter is minimum (among all color-spanning sets of P ). Somehow symmetrically, the largest closest pair color-spanning set (LCPCS) is a color-spanning set whos...
متن کاملApproximating the bottleneck plane perfect matching of a point set
A bottleneck plane perfect matching of a set of n points in R is defined to be a perfect non-crossing matching that minimizes the length of the longest edge; the length of this longest edge is known as bottleneck. The problem of computing a bottleneck plane perfect matching has been proved to be NP-hard. We present an algorithm that computes a bottleneck plane matching of size at least n5 in O(...
متن کامل