نتایج جستجو برای: convex hull hough transform

تعداد نتایج: 174469  

Image recognition is one of the most important field in image processing that in recent decades had much attention .Due to expansion of related fields with image processing and various application of this science in machine vision, military science, geography, aerospace and artificial intelligence and lots of other aspects, out stand the importance of this subject.One of the most important aspe...

Journal: :Computational Geometry: Theory and Applications 2021

Given a set P of n data points and an integer k, fundamental computational task is to find smaller subset Q⊆P only k which approximately preserves the geometry P. Here we consider problem finding Q best captures convex hull P, where our error measure sum distances in Q. We generalize allow R that must select from differ as well more general functions uncovered such other norms or weighted dista...

Journal: :J. Algorithms 1991
James R. Bergen Haim Schweitzer

The Hough transform is a common technique in computer vision and pattern recognition for recognizing patterns of points. We describe an efficient probabilistic algorithm for a Monte-Carlo approximation to the Hough transform. Our algorithm requires substantially less computation and storage than the standard Hough transform when applied to patterns that are easily recognized by humans. The prob...

2008
Jérémy Barbay Eric Y. Chen

We prove a tight asymptotic bound of Θ(δ log(n/δ)) on the worst case computational complexity of the convex hull of the union of two convex objects of sizes summing to n requiring δ orientation tests to certify the answer. Our algorithm is deterministic, it uses portions of the convex hull of input objects to describe the final convex hull, and it takes advantage of easy instances, such as thos...

2015
Mingcen Gao Thanh-Tung Cao Ashwin Nanjappa Zhiyong Huang

A novel algorithm is presented to compute the convex hull of a point set in R3 using the graphics processing unit (GPU). By exploiting the relationship between the Voronoi diagram and the convex hull, the algorithm derives the approximation of the convex hull from the former. The other extreme vertices of the convex hull are then found by using a two-round checking in the digital and the contin...

Journal: :Oper. Res. Lett. 2013
Hande Yaman

We study the convex hull of the splittable flow arc set with capacity and minimum load constraints. This set arises as a relaxation of problems where clients have demand for a resource that can be installed in integer amounts and that has capacity limitations and lower bounds on utilization. We prove that the convex hull of this set is the intersection of the convex hull of the set with a capac...

Journal: :The Journal of the Institute of Television Engineers of Japan 1996

Journal: :International Journal of Computer Applications 2012

2004
M. van Ginkel C. L. Luengo Hendriks

Extraction of primitives, such as lines, edges and curves, is often a key step in an image analysis procedure. The most popular technique for curve detection is based on the Hough transform. The original formulation of the Hough transform is inherently discrete. It is therefore difficult to assess which properties are inherent to the transform-based technique and which are due to its discrete n...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید