Circle detection on images by line segment and circle completeness

2016 ◽  
Author(s):  
Truc Le ◽  
Ye Duan
Keyword(s):  
Line Segment ◽  
Circle Detection

Less is more: Simple stimuli provoke more variable search strategies.

2020 ◽  
Author(s):  
Anna Nowakowska ◽  
Alasdair D F Clarke ◽  
Jessica Christie ◽  
Josephine Reuther ◽  
Amelia R. Hunt
Keyword(s):  
Line Segment ◽  
Search Strategies ◽  
Complex Objects ◽  
Search Behaviour ◽  
Line Segments ◽  
Surface Level ◽  
Efficient Search ◽  
Less Is More ◽  
Dramatic Shift

We measured the efficiency of 30 participants as they searched through simple line segment stimuli and through a set of complex icons. We observed a dramatic shift from highly variable, and mostly inefficient, strategies with the line segments, to uniformly efficient search behaviour with the icons. These results demonstrate that changing what may initially appear to be irrelevant, surface-level details of the task can lead to large changes in measured behaviour, and that visual primitives are not always representative of more complex objects.

Spherical object recognition based on the number of contour edges extracted by fitting and convex hull processing

2020 ◽  
pp. 095440702096950
Author(s):  
Bochang Zou ◽  
Huadong Qiu ◽  
Yufeng Lu
Keyword(s):  
Convex Hull ◽  
Target Object ◽  
Identification Accuracy ◽  
Detection Accuracy ◽  
Morphological Operations ◽  
Circle Detection ◽  
Spherical Object ◽  
Single Feature ◽  
Contour Fitting ◽  
Rgb Images

The detection of spherical targets in workpiece shape clustering and fruit classification tasks is challenging. Spherical targets produce low detection accuracy in complex fields, and single-feature processing cannot accurately recognize spheres. Therefore, a novel spherical descriptor (SD) for contour fitting and convex hull processing is proposed. The SD achieves image de-noising by combining flooding processing and morphological operations. The number of polygon-fitted edges is obtained by convex hull processing based on contour extraction and fitting, and two RGB images of the same group of objects are obtained from different directions. The two fitted edges of the same target object obtained at two RGB images are extracted to form a two-dimensional array. The target object is defined as a sphere if the two values of the array are greater than a custom threshold. The first classification result is obtained by an improved K-NN algorithm. Circle detection is then performed on the results using improved Hough circle detection. We abbreviate it as a new Hough transform sphere descriptor (HSD). Experiments demonstrate that recognition of spherical objects is obtained with 98.8% accuracy. Therefore, experimental results show that our method is compared with other latest methods, HSD has higher identification accuracy than other methods.

AG3line: Active grouping and geometry-gradient combined validation for fast line segment extraction

2021 ◽  
Vol 113 ◽  
pp. 107834
Author(s):  
Yongjun Zhang ◽  
Dong Wei ◽  
Yansheng Li
Keyword(s):  
Line Segment

An Efficient Improved Algorithm of Convex Hull

2014 ◽  
Vol 602-605 ◽  
pp. 3104-3106
Author(s):  
Shao Hua Liu ◽  
Jia Hua Zhang
Keyword(s):  
Convex Hull ◽  
Line Segment ◽  
Main Idea ◽  
Discrete Point ◽  
Directed Line ◽  
Generation Algorithm ◽  
Simple Program ◽  
Point Set ◽  
High Computational Efficiency ◽  
Improved Algorithm

This paper introduced points and directed line segment relation judgment method, the characteristics of generation and Graham method using the original convex hull generation algorithm of convex hull discrete points of the convex hull, an improved algorithm for planar discrete point set is proposed. The main idea is to use quadrilateral to divide planar discrete point set into five blocks, and then by judgment in addition to the four district quadrilateral internally within the point is in a convex edge. The result shows that the method is relatively simple program, high computational efficiency.

INVESTIGATION ON MULTISETS MIXTURE LEARNING BASED OBJECT DETECTION

2007 ◽  
Vol 21 (08) ◽  
pp. 1339-1351 ◽  
Author(s):  
ZHI-YONG LIU ◽  
HONG QIAO ◽  
LEI XU
Keyword(s):  
Object Detection ◽  
Hough Transform ◽  
Line Segment ◽  
Reconstruction Error ◽  
Mean Square ◽  
Noise Resistance ◽  
Generalized Hough Transform ◽  
The Mean ◽  
Sample Reconstruction

By minimizing the mean square reconstruction error, multisets mixture learning (MML) provides a general approach for object detection in image. To calculate each sample reconstruction error, as the object template is represented by a set of contour points, the MML needs to inefficiently enumerate the distances between the sample and all the contour points. In this paper, we develop the line segment approximation (LSA) algorithm to calculate the reconstruction error, which is shown theoretically and experimentally to be more efficient than the enumeration method. It is also experimentally illustrated that the MML based algorithm has a better noise resistance ability than the generalized Hough transform (GHT) based counterpart.

Sign in / Sign up

Export Citation Format

Share Document