منابع مشابه
Grouping Line-segments using Eigenclustering
This paper presents an eigenclustering approach to line-segment grouping. We make three contributions. First, we show how the geometry of the lineendpoints can be used to compute a grouping field by interpolating a polar lemniscate between them. Second, we show how to adaptively threshold the grouping field to produce a line-adjacency matrix. Finally, we present a non-iterative method for locat...
متن کاملLow-level Grouping of Straight Line Segments
In this paper we present a formalism for the formation of self consistent, hierarchical, "Low-Level" groupings of pairs of straight line segments from which all higher level groupings may be derived. Additionally, each low-level grouping is associated with a "Quality" factor, based on evidential reasoning, which reflects how much the groupings differ from mathematically perfect ones. This forma...
متن کاملRunning head: PERCEPTUAL GROUPING OF LINE SEGMENTS Spatial relations inducing perceptual grouping of line segments: a microgenetic study
Perceptual grouping is the process by which elements in the visual image are aggregated into larger and more complex structures, i.e. “objects.” Grouping is thought to be promoted by certain types of spatial relations among image elements, but the relative binding strength of different relations is not well understood, nor is the chronology of the grouping process. This paper reports a comprehe...
متن کاملCamera Motion Determination from Dynamic Perceptual Grouping of Line Segments
We present here a discussion on the use of perceptual grouping to improve structure and egomotion recovery algorithms for monocular cameras. In particular we look at grouping lines to avoid the need for trinocular algorithms. We also present a number of methods for grouping lines, including a novel method that infers planar groups from those demonstrating a linear deformation. Computer vision i...
متن کاملOptimal Grouping of Line Segments into Convex Sets
In this paper, we present a technique for grouping line segments into convex sets, where the line segments are obtained by linking edges obtained from the Canny edge detector. The novelty of the approach is twofold: first we define an efficient approach for testing the global convexity criterion, and second, we develop an optimal search based on dynamic programming for grouping the line segment...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Image Processing On Line
سال: 2018
ISSN: 2105-1232
DOI: 10.5201/ipol.2018.194