@conference {13281,
	title = {Constant-time navigation in four-dimensional nested simplicial meshes},
	booktitle = {Shape Modeling Applications, 2004. Proceedings},
	year = {2004},
	month = {2004/06//},
	pages = {221 - 230},
	abstract = {We consider a recursive decomposition of a four-dimensional hypercube into a hierarchy of nested 4-dimensional simplexes, that we call pentatopes. The paper presents an algorithm for finding the neighbors of a pentatope along its five tetrahedral faces in constant time. To this aim, we develop a labeling technique for nested pentatopes that enables their identification by using location codes. The constant-time behavior is achieved through bit manipulation operations, thus avoiding traversing the simplicial hierarchy via pointer following. We discuss an application of this representation to multi-resolution representations of four-dimensional scalar fields. Extracting adaptive continuous approximations of the scalar field from such a model requires generating conforming meshes, i.e., meshes in which the pentatopes match along their tetrahedral faces. Our neighbor finding algorithm enables computing face-adjacent pentatopes efficiently.},
	keywords = {4-dimensional, adaptive, algorithm;, approximations;, bit, codes;, computational, constant-time, continuous, decomposition;, face-adjacent, faces;, fields;, finding, following;, four-dimensional, generation;, geometry;, hierarchy;, hypercube;, location, manipulation, mesh, meshes;, multiresolution, navigation;, neighbor, nested, operations;, pentatopes;, pointer, recursive, representation;, scalar, simplexes;, simplicial, tetrahedral},
	doi = {10.1109/SMI.2004.1314509},
	author = {Lee,M. and De Floriani, Leila and Samet, Hanan}
}
@article {15380,
	title = {Critical fields and pulse durations for precessional switching of thin magnetic films},
	journal = {Magnetics, IEEE Transactions on},
	volume = {39},
	year = {2003},
	month = {2003/09//},
	pages = {2504 - 2506},
	abstract = {The precessional switching process of a uniformly magnetized thin film with in-plane anisotropy subject to pulsed magnetic fields applied in the film plane is analyzed. Critical fields required to achieve switching are studied for the case when the applied field is constant during the pulse duration and forms arbitrary angles with the hard axis. By using two integrals of magnetization motion, the explicit expressions for the critical field are derived. The formulas for durations of rectangular magnetic field pulses that guarantee the precessional switching of magnetization are presented as well.},
	keywords = {anisotropy;, axis;, critical, durations;, field;, fields;, film;, films;, hard, in-plane, integrals;, magnetic, magnetisation, magnetization, magnetization;, magnetized, motion;, precessional, pulse, pulsed, rectangular, reversal;, switching;, thin, uniformly},
	isbn = {0018-9464},
	doi = {10.1109/TMAG.2003.816454},
	author = {Bertotti,G. and Mayergoyz, Issak D and Serpico,C.}
}
@conference {13272,
	title = {A Smale-like decomposition for discrete scalar fields},
	booktitle = {Pattern Recognition, 2002. Proceedings. 16th International Conference on},
	volume = {1},
	year = {2002},
	month = {2002///},
	pages = {184 - 187 vol.1 - 184 - 187 vol.1},
	abstract = {In this paper we address the problem of representing the structure of the topology of a d-dimensional scalar field as a basis for constructing a multiresolution representation of the structure of such afield. To this aim, we define a discrete decomposition of a triangulated d-dimensional domain, on whose vertices the values of the field are given. We extend a Smale decomposition, defined by Thom (1949) and Smale (1960) for differentiable functions, to the discrete case, to what we call a Smale-like decomposition. We introduce the notion of discrete gradient vector field, which indicates the growth of the scalar field and matches with our decomposition. We sketch an algorithm for building a Smale-like decomposition and a graph-based representation of this decomposition. We present results for the case of two-dimensional fields.},
	keywords = {data, decomposition;, differentiable, discrete, domain;, field;, fields;, functions;, gradient, graph-based, methods;, multidimensional, multiresolution, representation;, scalar, Smale-like, structure, Topology, triangulated, vector, visualisation;},
	doi = {10.1109/ICPR.2002.1044644},
	author = {De Floriani, Leila and Mesmoudi,M. M. and Danovaro,E.}
}
@conference {14855,
	title = {Stochastic completion fields: a neural model of illusory contour shape and salience},
	booktitle = {Computer Vision, 1995. Proceedings., Fifth International Conference on},
	year = {1995},
	month = {1995/06//},
	pages = {408 - 415},
	abstract = {We describe an algorithm and representation level theory of illusory contour shape and salience. Unlike previous theories, our model is derived from a single assumption-namely, that the prior probability distribution of boundary completion shape can be modeled by a random walk in a lattice whose points are positions and orientations in the image plane (i.e. the space which one can reasonably assume is represented by neurons of the mammalian visual cortex). Our model does not employ numerical relaxation or other explicit minimization, but instead relies on the fact that the probability that a particle following a random walk will pass through a given position and orientation on a path joining two boundary fragments can be computed directly as the product of two vector-field convolutions. We show that for the random walk we define, the maximum likelihood paths are curves of least energy, that is, on average, random walks follow paths commonly assumed to model the shape of illusory contours. A computer model is demonstrated on numerous illusory contour stimuli from the literature},
	keywords = {boundary, completion, computational, Computer, contour, contours;, convolutions;, cortex;, curves, detection;, distribution;, edge, energy;, estimation;, fields;, fragments;, geometry;, illusory, image, lattice;, least, likelihood, mammalian, maximum, model;, nets;, neural, of, paths;, plane;, probability, probability;, random, recognition;, shape;, stimuli;, Stochastic, vector-field, visual, walk;},
	doi = {10.1109/ICCV.1995.466910},
	author = {Williams,L. R and Jacobs, David W.}
}
