@article {14914,
	title = {Uncertainty Propagation in Model-Based Recognition.},
	year = {1994},
	month = {1994/12//},
	institution = {MASSACHUSETTS INSTITUTE OF TECHNOLOGY ARTIFICIAL INTELLIGENCE LAB},
	abstract = {Building robust recognition systems requires a careful understanding of the effects of error in sensed features. Error in these image features results in a region of uncertainty in the possible image location of each additional model feature. We present an accurate, analytic approximation for this uncertainty region when model poses are based on matching three image and model points, for both Gaussian and bounded error in the detection of image points, and for both scaled-orthographic and perspective projection models. This result applies to objects that are fully three-dimensional, where past results considered only two-dimensional objects. Further, we introduce a linear programming algorithm to compute the uncertainty region when poses are based on any number of initial matches. Finally, we use these results to extend, from two-dimensional to three-dimensional objects, robust implementations of alignment interpretation-tree search, and transformation clustering. (AN)},
	keywords = {*IMAGE PROCESSING, *PATTERN RECOGNITION, algorithms, APPROXIMATION(MATHEMATICS), CYBERNETICS, ERROR CORRECTION CODES, image registration, Linear programming, MATCHING, MATHEMATICAL MODELS, PIXELS, PROJECTIVE TECHNIQUES., regions, THREE DIMENSIONAL, TWO DIMENSIONAL, Uncertainty},
	url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA295642},
	author = {Jacobs, David W. and Alter,T. D.}
}
@article {15004,
	title = {Optimal Systolic Designs for the Computation of the Discrete Hartley and the Discrete Cosine Transforms},
	year = {1988},
	month = {1988///},
	institution = {Institute for Systems Research, University of Maryland, College Park},
	abstract = {In this paper, we propose new algorithms for computing the Discrete Hartley and the Discrete Cosine Transform. The algorithms are based on iterative applications of the modified small n algorithms of DFT. The one dimensional transforms are mapped into two dimensions first and then implemented on two dimensional systolic arrays. Pipelined bit serial architectures operating on left to right LSB to MSB binary arithmetic is the basis of the hardware design. Different hardware schemes for implementing these transforms are studied. We show that our schemes achieve a substantial speed-up over existing schemes.},
	keywords = {*ALGORITHMS, *BINARY ARITHMETIC, Computer architecture, DCT(DISCRETE COSINE TRANSFORM), DISCRETE FOURIER TRANSFORMS, ITERATIONS, NUMERICAL MATHEMATICS, TWO DIMENSIONAL},
	url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA452389},
	author = {Chakrabarti,Chaitali and JaJa, Joseph F.}
}
