@conference {14951,
	title = {Component-based Data Layout for Efficient Slicing of Very Large Multidimensional Volumetric Data},
	booktitle = {Scientific and Statistical Database Management, 2007. SSBDM {\textquoteright}07. 19th International Conference on},
	year = {2007},
	month = {2007/07//},
	pages = {8 - 8},
	abstract = {In this paper, we introduce a new efficient data layout scheme to efficiently handle out-of-core axis-aligned slicing queries of very large multidimensional volumetric data. Slicing is a very useful dimension reduction tool that removes or reduces occlusion problems in visualizing 3D/4D volumetric data sets and that enables fast visual exploration of such data sets. We show that the data layouts based on typical space-filling curves are not optimal for the out-of-core slicing queries and present a novel component-based data layout scheme for a specialized problem domain, in which it is only required to provide fast slicing at every k-th value, for any k gt; 1. Our component-based data layout scheme provides much faster processing time for any axis-aligned slicing direction at every k-th value, k gt; 1, requiring less cache memory size and without any replication of data. In addition, the data layout can be generalized to any high dimension.},
	keywords = {axis-aligned, cache, curves;very, data, data;data, databases;, handling;query, large, layout;data, memory, multidimensional, processing;very, queries;space-filling, size;component-based, slicing, slicing;out-of-core, volumetric},
	doi = {10.1109/SSDBM.2007.7},
	author = {Kim,Jusub and JaJa, Joseph F.}
}
@conference {12701,
	title = {Illuminating light field: image-based face recognition across illuminations and poses},
	booktitle = {Automatic Face and Gesture Recognition, 2004. Proceedings. Sixth IEEE International Conference on},
	year = {2004},
	month = {2004/05//},
	pages = {229 - 234},
	abstract = {We present an image-based method for face recognition across different illuminations and different poses, where the term {\textquoteright}image-based{\textquoteright} means that only 2D images are used and no explicit 3D models are needed. As face recognition across illuminations and poses involves three factors, namely identity, illumination, and pose, generalizations from known identities to novel identities, from known illuminations to novel illuminations, and from known poses to unknown poses are desired. Our approach, called the illuminating light field, derives an identity signature that is invariant to illuminations and poses, where a subspace encoding is assumed for the identity, a Lambertain reflectance model for the illumination, and a light field model for the poses. Experimental results using the PIE database demonstrate the effectiveness of the proposed approach.},
	keywords = {Face, field;, illuminating, image-based, Lambertain, light, lighting;, model;, multidimensional, poses;, processing;, recognition;, reflectance, reflectivity;, signal},
	doi = {10.1109/AFGR.2004.1301536},
	author = {Zhou,Shaohua and Chellapa, Rama}
}
@conference {15029,
	title = {Strategies for exploring large scale data},
	booktitle = {Parallel Architectures, Algorithms and Networks, 2004. Proceedings. 7th International Symposium on},
	year = {2004},
	month = {2004/05//},
	pages = {2 - 2},
	abstract = {We consider the problem of querying large scale multidimensional time series data to discover events of interest, test and validate hypotheses, or to associate temporal patterns with specific events. This type of data currently dominates most other types of available data, and will very likely become even more prevalent in the future given the current trends in collecting time series of business, scientific, demographic, and simulation data. The ability to explore such collections interactively, even at a coarse level, will be critical in discovering the information and knowledge embedded in such collections. We develop indexing techniques and search algorithms to efficiently handle temporal range value querying of multidimensional time series data. Our indexing uses linear space data structures that enable the handling of queries in I/O time that is essentially the same as that of handling a single time slice, assuming the availability of a logarithmic number of processors as a function of the temporal window. A data structure with provably almost optimal asymptotic bounds is also presented for the case when the number of multidimensional objects is relatively small. These techniques improve significantly over standard techniques for either serial or parallel processing, and are evaluated by extensive experimental results that confirm their superior performance.},
	keywords = {algorithms;, association;, asymptotic, bounds;, business, data, data;, database, databases;, demographic, discovery;, Indexing, indexing;, information, knowledge, large, linear, mining;, multidimensional, objects;, optimal, Parallel, pattern, processing;, query, querying;, range, scale, scientific, search, serial, series, series;, simulation, space, structure;, structures;, techniques;, temporal, TIME, value, very, window;},
	doi = {10.1109/ISPAN.2004.1300447},
	author = {JaJa, Joseph F.}
}
@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.}
}
@article {15047,
	title = {VLSI architectures for multidimensional transforms},
	journal = {Computers, IEEE Transactions on},
	volume = {40},
	year = {1991},
	month = {1991/09//},
	pages = {1053 - 1057},
	abstract = {The authors propose a family of VLSI architectures with area-time tradeoffs for computing (<e1>N</e1> times;<e1>N</e1> times; . . . times;<e1>N</e1>) <e1>d</e1>-dimensional linear separable transforms. For fixed-precision arithmetic with <e1>b</e1> bits, the architectures have an area <e1>A</e1>=<e1>O</e1>(<e1>N</e1><sup>d+2a</sup>) and computation time <e1>T</e1>=<e1>O</e1>(<e1>dN</e1><sup>d/2-a</sup><e1>b </e1>), and achieve the <e1>AT</e1><sup>2</sup> bound of <e1>AT</e1><sup>2</sup>=<e1>O</e1>(<e1>n</e1><sup>2</sup><e1>b</e1> <sup>2</sup>) for constant <e1>d</e1>, where <e1>n</e1>=<e1>N</e1><sup>d </sup> and <e1>O</e1> lt;<e1>a</e1> les;<e1>d</e1>/2},
	keywords = {architecture;, architectures;, arithmetic;, complexity;, computational, Computer, digital, fixed-precision, linear, multidimensional, separable, transforms;, VLSI},
	isbn = {0018-9340},
	doi = {10.1109/12.83648},
	author = {Chakrabarti,C. and JaJa, Joseph F.}
}
