@conference {16847,
	title = {Indexing Point Triples Via Triangle Geometry},
	booktitle = {Data Engineering, 2007. ICDE 2007. IEEE 23rd International Conference on},
	year = {2007},
	month = {2007/04//},
	pages = {936 - 945},
	abstract = {Database search for images containing icons with specific mutual spatial relationships can be facilitated by an appropriately structured index. For the case of images containing subsets each of which consist of three icons, the one-to-one correspondence between (distinct) point triples and triangles allows the use of such triangle attributes as position, size, orientation, and "shape" in constructing a point-based index, in which each triangle maps to a single point in a resulting hyperdimensional index space. Size (based on the triangle perimeter) can be represented by a single linear dimension. The abstract "shape" of a triangle induces a space that is inherently two-dimensional, and a number of alternative definitions of a basis for this space are examined. Within a plane, orientation reduces to rotation, and (after assignment of a reference direction for the triangle) can be represented by a single, spatially closed dimension. However, assignment of a reference direction for triangles possessing a k-fold rotational symmetry presents a significant challenge. Methods are described for characterizing shape and orientation of triangles, and for mapping these attributes onto a set of linear axes to form a combined index. The shape attribute is independent of size, orientation, and position, and the characterization of shape and orientation is stable with respect to small variations in the indexed triangles.},
	keywords = {database, databases;, dimension;spatial, geometry;database, hyperdimensional, index, index;single, index;triangle, indexing;query, linear, point;k-fold, processing;visual, relationships;structured, rotational, search;indexing, space;image, symmetry;point-based},
	doi = {10.1109/ICDE.2007.367939},
	author = {Cranston,C.B. and Samet, Hanan}
}
@conference {18182,
	title = {Communication-friendly encryption of multimedia},
	booktitle = {Multimedia Signal Processing, 2002 IEEE Workshop on},
	year = {2002},
	month = {2002/12//},
	pages = {292 - 295},
	abstract = {This paper discusses encryption operations that selectively encrypt content-carrying segments of multimedia data stream. We propose and analyze three techniques that work in different domains, namely, a syntax-aware selective bitstream encryption tool with bit stuffing, a generalized index mapping encryption tool with controlled overhead and an intra-bitplane encryption tool compatible with fine granularity scalable coding. The designs of these proposed encryption operations take into consideration the inherent structure and syntax of multimedia sources and have improved friendliness to communications, compression and computation.},
	keywords = {bit, bitstream, coding;, Communication, communication;, compression, compression;, COMPUTATION, controlled, cryptography;, data, encryption, encryption;, fine, friendliness;, granularity, image, index, intrabitplane, MAPPING, multimedia, operation;, overhead;, scalable, selective, sources, stream;, stuffing;, syntax-aware, syntax;, tool;},
	doi = {10.1109/MMSP.2002.1203303},
	author = {M. Wu and Mao,Yinian}
}
