Idiap Finding Lines under Bounded Error

نویسنده

  • Thomas M Breuel
چکیده

A new algorithm for nding lines in images under a bounded er ror noise model is described The algorithm is based on a hier archical and adaptive subdivision of the space of line parameters but unlike previous adaptive or hierarchical line nders based on the Hough transform measures errors in image space and thereby guarantees that no solution satisfying the given error bounds will be lost In addition the algorithm can nd interpretations of all the lines in the image that satisfy the constraint that each image feature supports at most one line hypothesis a constraint that is often useful to impose in practice The algorithm can be extended to compute the probabilistic Hough transform and the generalized Hough transform a variety of statistical error models e ciently

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

IDIAP Finding Lines under Bounded

A new algorithm for nding lines in images under a bounded error noise model is described. The algorithm is based on a hierarchical and adaptive subdivision of the space of line parameters, but, unlike previous adaptive or hierarchical line nders based on the Hough transform, measures errors in image space and thereby guarantees that no solution satisfying the given error bounds will be lost. In...

متن کامل

Idiap Geometric Matching in Computer Vision Algorithms and Open Problems

In this paper I review and discuss recent advances in the devel opment of algorithms for solving the kinds of geometric match ing problems that occur in computer vision in particular under bounded error models I examine both the one model case recog nition and the many model case indexing and I discuss some open problems and directions for research

متن کامل

IDIAP Geometric Matching in Computer

In this paper, I review and discuss recent advances in the development of algorithms for solving the kinds of geometric matching problems that occur in computer vision, in particular under bounded error models. I examine both the one-model case (recognition) and the many-model case (indexing), and I discuss some open problems and directions for research.

متن کامل

Minimax Estimator of a Lower Bounded Parameter of a Discrete Distribution under a Squared Log Error Loss Function

The problem of estimating the parameter ?, when it is restricted to an interval of the form , in a class of discrete distributions, including Binomial Negative Binomial discrete Weibull and etc., is considered. We give necessary and sufficient conditions for which the Bayes estimator of with respect to a two points boundary supported prior is minimax under squared log error loss function....

متن کامل

Idiap Recognition of Handprinted Digits 1 Using Optimal Bounded Error Matching

This paper describes a system that recognizes hand-printed digits. The system is based on optimal bounded error matching, a technique already in common use in general-purpose 2D and 3D visual object recognition systems in cluttered, noisy scenes. In this paper, we demonstrate that the same techniques achieve high recognition rates (up to 99.2%) on real-world data (the NIST database of hand-prin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993