Vectorial strategy for designing line segment detectors with high orientation accuracy

1997 ◽  
Vol 33 (21) ◽  
pp. 1775 ◽  
Author(s):  
E.R. Davies
Keyword(s):  
Line Segment ◽  
High Orientation

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.

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.

Facet Segmentation-Based Line Segment Extraction for Large-Scale Point Clouds

2017 ◽  
Vol 55 (9) ◽  
pp. 4839-4854 ◽  
Author(s):  
Yangbin Lin ◽  
Cheng Wang ◽  
Bili Chen ◽  
Dawei Zai ◽  
Jonathan Li
Keyword(s):  
Line Segment ◽  
Large Scale ◽  
Point Clouds ◽  
Scale Point

On the convex kernel of a compact set

1967 ◽  
Vol 63 (2) ◽  
pp. 311-313 ◽  
Author(s):  
D. G. Larman
Keyword(s):  
Linear Space ◽  
Compact Subset ◽  
Line Segment ◽  
Linear Dimension ◽  
Single Point ◽  
Compact Set ◽  
Topological Linear Space ◽  
Topological Linear

Suppose that E is a compact subset of a topological linear space ℒ. Then the convex kernel K, of E, is such that a point k belongs to K if every point of E can be seen, via E, from k. Valentine (l) has asked for conditions on E which ensure that the convex kernel K, of E, consists of exactly one point, and in this note we give such a condition. If A, B, C are three subsets of E, we use (A, B, C) to denote the set of those points of E, which can be seen, via E, from a triad of points a, b, c, with a ∈ A, b ∈ B, c ∈ C. We shall say that E has the property if, whenever A is a line segment and B, C are points of E which are not collinear with any point of A, the set (A, B, C) has linear dimension of at most one, and degenerates to a single point whenever A is a point.

Sign in / Sign up

Export Citation Format

Share Document