𝔖 Bobbio Scriptorium
✦   LIBER   ✦

1-D and 2-D algorithms for orthogonal transformations

✍ Scribed by Michael J. Corinthios; Youssef Geadah

Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
842 KB
Volume
27
Category
Article
ISSN
0378-4754

No coin nor oath required. For personal study only.

✦ Synopsis

two-dlnensional signals are presented. These JlqOrithmS are well suited for the lnplementation of parallel high speed VLSI signal proce55ors. In particular they are characterized by their constant geometrv accessin a5 we!1 a5 storlnq of data. Such oropertv leads to a unlformltv of slqnal paths with a potentlal toward Improved VLSI Implementation and lead to highly parallel and multlprocesslnq architectures. A Universal Processing Element is subsequently introduced. serving as a basic cell of computation tnat would constitute a bullding block for parallel and cascaded cellular arrays.

πŸ“œ SIMILAR VOLUMES

Algorithm for automatic alignment in 2D
Algorithm for automatic alignment in 2D space by object transformation
✍ Hyong Tae Kim; Chang Seop Song; Hae Jeong Yang πŸ“‚ Article πŸ“… 2006 πŸ› Elsevier Science 🌐 English βš– 504 KB

Automatic alignment problem was coupled with the numerical coordinates on a machine, a vision system and wafer device. This paper proposes a method for constructing a general model for automatic alignment and formulating equations from three coordinates. The algorithm was derived under the assumptio

Deterministic Algorithms for 2-d Convex
Deterministic Algorithms for 2-d Convex Programming and 3-d Online Linear Programming
✍ Timothy M Chan πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 228 KB

We present a deterministic algorithm for solving two-dimensional convex pro-Ε½ . grams with a linear objective function. The algorithm requires O k log k primitive operations for k constraints; if a feasible point is given, the bound reduces to Ε½ . O k log krlog log k . As a consequence, we can decid

New algorithms for 2D and 3D point match
New algorithms for 2D and 3D point matching: pose estimation and correspondence
✍ Steven Gold; Anand Rangarajan; Chien-Ping Lu; Suguna Pappu; Eric Mjolsness πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 340 KB

A fundamental open problem in computer vision-determining pose and correspondence between two sets of points in space-is solved with a novel, fast, robust and easily implementable algorithm. The technique works on noisy 2D or 3D point sets that may be of unequal sizes and may differ by non-rigid tra