Efficient Cues for Discriminating Skewed Curved-Line Segments

Perception ◽  
1996 ◽  
Vol 25 (1_suppl) ◽  
pp. 49-49
Author(s):  
D H Foster ◽  
H T Kukkonen

Visual discrimination of circular arcs differing in curvature reaches hyperacute levels of performance. What spatial attributes of curved contours provide the necessary visual cue? Statistical-efficiency theory has previously been applied to data on the discrimination of symmetric curved-line segments undergoing expansions and contractions perpendicular to their chords. The results have suggested that relative invariants with respect to these transformations are the best cues, since they accounted for the most variance in the data (a relative invariant is an attribute such that the ratio of its values is constant under transformation). Expansions and contractions are examples of affine transformations, which in general provide a good approximation to the effects of viewpoint change. If some attribute of a curved line is a relative invariant with respect to affine transformations, is it then a good cue? An experiment was performed in which observers discriminated curved-line segments that had been affine transformed by progressive amounts of shear along their chords as well as expansions and contractions along and perpendicular to their chords. Shear can be interpreted as a relative affine invariant, and, since shear destroys symmetry by skewing the curve, it should provide a good cue. In fact, although expansions and contractions proved to be good cues, shear did not. Candidate cues that were not relative affine invariants (eg Euclidean curvature, turning angle) were also poor cues. It appears that being a relative affine invariant is a necessary but not sufficient condition for a cue to be efficient in the discrimination of curved-line segments.

2016 ◽  
Vol 12 (12) ◽  
pp. 155014771668082
Author(s):  
Fanhuai Shi ◽  
Jian Gao ◽  
Xixia Huang

Visual sensor networks have emerged as an important class of sensor-based distributed intelligent systems, where image matching is one of the key technologies. This article presents an affine invariant method to produce dense correspondences between uncalibrated wide baseline images. Under affine transformations, both point location and its neighborhood texture are changed between views, so dense matching becomes a tough task. The proposed approach tends to solve this problem within a sparse-to-dense framework. The contribution of this article is in threefolds. First, a strategy of reliable sparse matching is proposed, which starts from affine invariant features extraction and matching and then these initial matches are utilized as spatial prior to produce more sparse matches. Second, match propagation from sparse feature points to its neighboring pixels is conducted in the way of region growing in an affine invariant framework. Third, the unmatched points are handled by low-rank matrix recovery technique. Comparison experiments of the proposed method versus existing ones show a significant improvement in the presence of large affine deformations.


Author(s):  
Jean-Luc Arseneault ◽  
Robert Bergevin ◽  
Denis Laurendeau

2014 ◽  
Vol 24 (01) ◽  
pp. 61-86 ◽  
Author(s):  
STEFAN HUBER ◽  
MARTIN HELD ◽  
PETER MEERWALD ◽  
ROLAND KWITT

Watermarking techniques for vector graphics dislocate vertices in order to embed imperceptible, yet detectable, statistical features into the input data. The embedding process may result in a change of the topology of the input data, e.g., by introducing self-intersections, which is undesirable or even disastrous for many applications. In this paper we present a watermarking framework for two-dimensional vector graphics that employs conventional watermarking techniques but still provides the guarantee that the topology of the input data is preserved. The geometric part of this framework computes so-called maximum perturbation regions (MPR) of vertices. We propose two efficient algorithms to compute MPRs based on Voronoi diagrams and constrained triangulations. Furthermore, we present two algorithms to conditionally correct the watermarked data in order to increase the watermark embedding capacity and still guarantee topological correctness. While we focus on the watermarking of input formed by straight-line segments, one of our approaches can also be extended to circular arcs. We conclude the paper by demonstrating and analyzing the applicability of our framework in conjunction with two well-known watermarking techniques.


2017 ◽  
Vol 5 (3) ◽  
pp. 348-357 ◽  
Author(s):  
Martin Held ◽  
Stefan de Lorenzo

Abstract We simplify and extend prior work by Held and Spielberger [CAD 2009, CAD&A 2014] to obtain spiral-like paths inside of planar shapes bounded by straight-line segments and circular arcs: We use a linearization to derive a simple algorithm that computes a continuous spiral-like path which (1) consists of straight-line segments, (2) has no self-intersections, (3) respects a user-specified maximum step-over distance, and (4) starts in the interior and ends at the boundary of the shape. Then we extend this basic algorithm to double-spiral paths that start and end at the boundary, and show how these double spirals can be used to cover complicated planar shapes by composite spiral paths. We also discuss how to improve the smoothness and reduce the curvature variation of our paths, and how to boost them to higher levels of continuity. Highlights The algorithm computes a spiral path within planar shapes with and without islands. It respects a user-specified maximum step-over distance. Double spirals and composite spiral paths can be computed. Heuristics for smoothing the spirals are discussed. The algorithm is simple and easy to implement, and suitable for various applications.


Robotica ◽  
2002 ◽  
Vol 20 (1) ◽  
pp. 49-58 ◽  
Author(s):  
Wilson D. Esquivel ◽  
Luciano E. Chiang

This paper addresses the problem of finding a nonholonomic path subject to a curvature restriction, to be tracked by a wheeled autonomous navigation vehicle. This robot is able to navigate in a structured environment, with obstacles modeled as polygons, thus constituting a model based system. The path planning methodology begins with the conditioning of the polygonal environment by offsetting each polygon in order to avoid the possibility of collision with the mobile. Next, the modified polygonal environment is used to compute a preliminary shortest path (PA) between the two extreme positions of the trajectory in the plane (x, y). This preliminary path (PA) does not yet consider the restrictions on the curvature and is formed only by straight line segments. A smoothing process follows in order to obtain a path (PS) that satisfies curvature restrictions which consist basically of joining the straight line segments by circular arcs of minimum radius R (filleting). Finally, the initial and final orientation of the vehicle are accounted for. This is done using a technique we have called the Star Algorithm, because of the geometric shape of the resulting maneuvers. A final complete path (PC) is thus obtained.


Sign in / Sign up

Export Citation Format

Share Document