@article {11981,
	title = {Understanding visuo-motor primitives for motion synthesis and analysis},
	journal = {Computer Animation and Virtual Worlds},
	volume = {17},
	year = {2006},
	month = {2006/07/01/},
	pages = {207 - 217},
	abstract = {The problem addressed in this paper concerns the representation of human movement in terms of atomic visuo-motor primitives considering both generation and perception of movement. We introduce the concept of kinetology, the phonology of human movement, and five principles on which such a system should be based: compactness, view-invariance, reproducibility, selectivity, and reconstructivity. We propose visuo-motor primitives and demonstrate their kinetological properties. Further evaluation is accomplished with experiments on compression and decompression. Our long-term goal is to demonstrate that action has a space characterized by a visuo-motor language. Copyright {\textcopyright} 2006 John Wiley \& Sons, Ltd.},
	keywords = {compression, motion synthesis, visuo-motor primitives},
	isbn = {1546-427X},
	doi = {10.1002/cav.124},
	url = {http://onlinelibrary.wiley.com/doi/10.1002/cav.124/abstract},
	author = {Guerra-Filho,Gutemberg and Aloimonos, J.}
}
@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}
}
@article {15711,
	title = {Algorithm 805: computation and uses of the semidiscrete matrix decomposition},
	journal = {ACM Trans. Math. Softw.},
	volume = {26},
	year = {2000},
	month = {2000/09//},
	pages = {415 - 435},
	abstract = {We present algorithms for computing a semidiscrete approximation to a matrix in a weighted norm, with the Frobenius norm as a special case. The approximation is formed as a weighted sum of outer products of vectors whose elements are {\textpm}1 or 0, so the storage required by the approximation is quite small. We also present a related algorithm for approximation of a tensor. Applications of the algorithms are presented to data compression, filtering, and information retrieval; software is provided in C and in Matlab.},
	keywords = {compression, latent semantic indexing, Matrix decomposition, semidiscrete decompositin, singular value decomposition},
	isbn = {0098-3500},
	doi = {10.1145/358407.358424},
	url = {http://doi.acm.org/10.1145/358407.358424},
	author = {Kolda,Tamara G. and O{\textquoteright}Leary, Dianne P.}
}
@conference {13652,
	title = {Structural compression for document analysis},
	booktitle = {Pattern Recognition, 1996., Proceedings of the 13th International Conference on},
	volume = {3},
	year = {1996},
	month = {1996/08//},
	pages = {664 -668 vol.3 - 664 -668 vol.3},
	abstract = {In this paper we describe a structural compression technique to be used for document text image storage and retrieval. The primary objective is to provide an efficient representation, storage, transmission and display. A secondary objective is to provide an encoding which allows access to specified regions within the image and facilitates traditional document processing operations without requiring complete decoding. We describe an algorithm which symbolically decomposes a document image and structurally orders the error bitmap based on a probabilistic model. The resultant symbol and error representations lend themselves to reasonably high compression ratios and are structured so as to allow operations directly on the compressed image. The compression scheme is implemented and compared to traditional compression methods},
	keywords = {analysis;document, bitmap;error, coding;image, compression, compression;document, compression;symbol, decomposition;data, image, manipulation;, processing;image, ratios;document, recognition;probability;symbol, representations;structural, representations;symbolic, retrieval;document, storage;error, text},
	doi = {10.1109/ICPR.1996.547029},
	author = {Kia,O. E and David Doermann}
}
