A simple linear-time algorithm for the computation of the Hutchinson metric in the case of finite one-dimensional sequences is presented. The algorithm is ...
The purpose of that algorithm is to avoid totally any discretization errors in those parts of the geometry which were not affected by the surface movements ...
An algorithm for the computation of the Hutchinson distance. Information Processing Letters , 40:113-117, October 25, 1991. Publication date: October 25, 1991.
A simple linear-time algorithm for the computation of the Hutchinson metric in the case of finite one-dimensional sequences is presented. The algorithm is ...
In this article, we have three contributions. First, we give a formal definition of similarity metric. Second, we show the relationship between similarity ...
An algorithm for the computation of the Hutchinson distance. Brandt, J.; Cabrelli, C.; Molter, U. Information Processing Letters 40(2): 113-117.
This example illustrates the estimation the Hessian trace of a neural network using Hutchinson's method [Hutchinson, 1990], which is an algorithm to obtain such ...
Missing: Distance. | Show results with:Distance.
No information is available for this page. · Learn why
Abstract—The Hutchinson metric is a natural measure of the discrepancy between two images for use in fractal image pro- cessing. An efficient solution to ...
Missing: Distance. | Show results with:Distance.
An Algorithm for the Computation of the Hutchinson Distance · J. BrandtC. CabrelliU. Molter. Computer Science, Mathematics. Inf. Process. Lett. 1991. 18 ...