This paper gives a widely applicable technique for solving many of the parameter estimation problems encountered in geometric computer vision. A commonly used approach in such parameter minimization is to minimize an algebraic error function instead of a possibly preferable geometric error function. It is claimed in this paper, however, that minimizing algebraic error will usually give excellen...

This paper gives a widely applicable technique for solving many of the parameter estimation problems encountered in geometric computer vision. A commonly used approach is to minimize an algebraic error function instead of a possibly preferable geometric error function. It is claimed in this paper that minimizing algebraic error will usually give excellent results, and in fact the main problem w...

Recently D. Buchholz and R. Verch have proposed a method for implementing in algebraic quantum eld theory ideas from renormaliza-tion group analysis of short-distance (high energy) behavior by passing to certain scaling limit theories. Buchholz and Verch distinguish between diierent types of theories where the limit is unique, degenerate, or classical, and the method allows in principle to extr...

following the categorical approach to universal algebra through algebraic theories, proposed by f.~w.~lawvere in his phd thesis, this paper aims at introducing a similar setting for general topology. the cornerstone of the new framework is the notion of emph{categorically-algebraic} (emph{catalg}) emph{topological theory}, whose models induce a category of topological structures. we introduce t...

Maximum-distance separable (MDS) convolutional codes are characterized through the property that the free distance attains the generalized singleton bound. The existence of MDS convolutional codes was established by two of the authors by using methods from algebraic geometry. This correspondence provides an elementary construction of MDS convolutional codes for each rate k/n and each degree δ. ...