Affine Matching with Bounded Sensor Error: A Study of Geometric Hashing and Alignment

Affine transformations are often used in recognition systems, to approximate the effects of perspective projection. The underlying mathematics is for exact feature data, with no positional uncertainty. In practice, heuristics are added to handle uncertainty. We provide a precise analysis of affine point matching, obtaining an expression for the range of affine-invariant values consistent with bounded uncertainty. This analysis reveals that the range of affine-invariant values depends on the actual $x$-$y$-positions of the features, i.e. with uncertainty, affine representations are not invariant with respect to the Cartesian coordinate system. We analyze the effect of this on geometric hashing and alignment recognition methods.

Relative Affine Structure: Canonical Model for 3D from 2D Geometry and Applications

We propose an affine framework for perspective views, captured by a single extremely simple equation based on a viewer-centered invariant we call "relative affine structure". Via a number of corollaries of our main results we show that our framework unifies previous work --- including Euclidean, projective and affine --- in a natural and simple way, and introduces new, extremely simple, algorithms for the tasks of reconstruction from multiple views, recognition by alignment, and certain image coding applications.

Projective injections of geometries and their affine extensions

We present a general method allowing the construction geometries whose diagram is an extension of the diagram of a given geometry. Some applications of this construction process are described. © 1995 Birkhäuser Verlag.

Sequentially continuous non-linear fundamental systems of solutions of affine equations in locally convex spaces

According to the Mickael's selection theorem any surjective continuous linear operator from one Fr\'echet space onto another has a continuous (not necessarily linear) right inverse. Using this theorem Herzog and Lemmert proved that if $E$ is a Fr\'echet space and $T:E\to E$ is a continuous linear operator such that the Cauchy problem $\dot x=Tx$, $x(0)=x_0$ is solvable in $[0,1]$ for any $x_0\in E$, then for any $f\in C([0,1],E)$, there exists a continuos map $S:[0,1]\times E\to E$, $(t,x)\mapsto S_tx$ such that for any $x_0\in E$, the function $x(t)=S_tx_0$ is a solution of the Cauchy problem $\dot x(t)=Tx(t)+f(t)$, $x(0)=x_0$ (they call $S$ a fundamental system of solutions of the equation $\dot x=Tx+f$). We prove the same theorem, replacing "continuous" by "sequentially continuous" for locally convex spaces from a class which contains strict inductive limits of Fr\'echet spaces and strong duals of Fr\'echet--Schwarz spaces and is closed with respect to finite products and sequentially closed subspaces. The key-point of the proof is an extension of the theorem on existence of a sequentially continuous right inverse of any surjective sequentially continuous linear operator to some class of non-metrizable locally convex spaces.

Self-affine crossover length in a layered silicate deposit

Self-affine dehydrated colloidal deposits on fresh mica surfaces of the synthetic layered silicate 2:1 smectite clay laponite have been studied by means of atomic force microscopy (AFM). AFM images of these prepared assemblies of sol and gel aggregates have been analyzed both by means of standard AFM Fourier software and a wavelet method. The deposited surfaces show a persistence to antipersistent crossover with a clay concentration dependent crossover length. It is concluded that the crossover length is associated with aggregate size, and further that the persistent roughness at small length scales signals near compact clusters of fractal dimension three, whereas the antipersistent roughness at large length scales signals a sedimentation process.

Argonauta Video Database: Projection and Homography matrices. Projection Left Camera

Description of the Annotation files: Annotation files are supplied for each video, for benchmarking. Annotations correspond to ground truths of peoples' positions in the image plane, and also for their feet positions, when they were visible. Annotations were performed manually, with the aid of a code developed by (Silva et al., 2014; see the Thesis for details). Targets (people or feet) are marked at variable frame intervals and then linearly interpolated.

Argonauta Video Database: Projection and Homography matrices. Projection Right Camera

Description of the Annotation files: Annotation files are supplied for each video, for benchmarking. Annotations correspond to ground truths of peoples' positions in the image plane, and also for their feet positions, when they were visible. Annotations were performed manually, with the aid of a code developed by (Silva et al., 2014; see the Thesis for details). Targets (people or feet) are marked at variable frame intervals and then linearly interpolated.

Argonauta Video Database: Projection and Homography matrices. Homography Right Camera

Description of the Annotation files: Annotation files are supplied for each video, for benchmarking. Annotations correspond to ground truths of peoples' positions in the image plane, and also for their feet positions, when they were visible. Annotations were performed manually, with the aid of a code developed by (Silva et al., 2014; see the Thesis for details). Targets (people or feet) are marked at variable frame intervals and then linearly interpolated.

Argonauta Video Database: Projection and Homography matrices. Homography Left Camera

Description of the Annotation files: Annotation files are supplied for each video, for benchmarking. Annotations correspond to ground truths of peoples' positions in the image plane, and also for their feet positions, when they were visible. Annotations were performed manually, with the aid of a code developed by (Silva et al., 2014; see the Thesis for details). Targets (people or feet) are marked at variable frame intervals and then linearly interpolated.

Affine and generalized affine models : Theory and applications

Thèse numérisée par la Division de la gestion de documents et des archives de l'Université de Montréal

Geometric and Algebraic Aspects of 3D Affine and Projective Structures from Perspective 2D Views

We investigate the differences --- conceptually and algorithmically --- between affine and projective frameworks for the tasks of visual recognition and reconstruction from perspective views. It is shown that an affine invariant exists between any view and a fixed view chosen as a reference view. This implies that for tasks for which a reference view can be chosen, such as in alignment schemes for visual recognition, projective invariants are not really necessary. We then use the affine invariant to derive new algebraic connections between perspective views. It is shown that three perspective views of an object are connected by certain algebraic functions of image coordinates alone (no structure or camera geometry needs to be involved).

Planar homography: accuracy analysis and applications

Projective homography sits at the heart of many problems in image registration. In addition to many methods for estimating the homography parameters (R.I. Hartley and A. Zisserman, 2000), analytical expressions to assess the accuracy of the transformation parameters have been proposed (A. Criminisi et al., 1999). We show that these expressions provide less accurate bounds than those based on the earlier results of Weng et al. (1989). The discrepancy becomes more critical in applications involving the integration of frame-to-frame homographies and their uncertainties, as in the reconstruction of terrain mosaics and the camera trajectory from flyover imagery. We demonstrate these issues through selected examples

Uniformization of affine dependence programs for parallel embedded system design

This paper is concerned with the uniformization of a system of afine recurrence equations. This transformation is used in the design (or compilation) of highly parallel embedded systems (VLSI systolic arrays, signal processing filters, etc.). In this paper, we present and implement an automatic system to achieve uniformization of systems of afine recurrence equations. We unify the results from many earlier papers, develop some theoretical extensions, and then propose effective uniformization algorithms. Our results can be used in any high level synthesis tool based on polyhedral representation of nested loop computations.

The application of affine projection to the development of a siren noise cancellation system

Emergency vehicles use high-amplitude sirens to warn pedestrians and other road users of their presence. Unfortunately, the siren noise enters the vehicle and corrupts the intelligibility of two-way radio voice com-munications from the emergency vehicle to a control room. Often the siren has to be turned off to enable the control room to hear what is being said which subsequently endangers people's lives. A digital signal processing (DSP) based system for the cancellation of siren noise embedded within speech is presented. The system has been tested with the least mean square (LMS), normalised least mean square (NLMS) and affine projection algorithm (APA) using recordings from three common types of sirens (two-tone, wail and yelp) from actual test vehicles. It was found that the APA with a projection order of 2 gives comparably improved cancellation over the LMS and NLMS with only a moderate increase in algorithm complexity and code size. Therefore, this siren noise cancellation system using the APA offers an improvement in cancellation achieved by previous systems. The removal of the siren noise improves the response time for the emergency vehicle and thus the system can contribute to saving lives. The system also allows voice communication to take place even when the siren is on and as such the vehicle offers less risk of danger when moving at high speeds in heavy traffic.