DCC 2008 - PDF Preprint Papers

DCC 2008 Data Compression Conference

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed DCC-2008 Paper

click to vote

DCC
2008
IEEE

230views Computer Graphics» more DCC 2008»

Object-Based Regions of Interest for Image Compression

14 years 3 months ago

Download www.svcl.ucsd.edu

A fully automated architecture for object-based region of interest (ROI) detection is proposed. ROI's are defined as regions containing user defined objects of interest, and ...

Sunhyoung Han, Nuno Vasconcelos

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	230	Object-Based Regions of Interest for Image Compression	claim
2	211	A New Object-Based System for Fractal Video Sequences Compression	claim
3	198	An Approach to Graph and Netlist Compression	claim
4	191	A Novel Partial Prediction Algorithm for Fast 4x4 Intra Prediction Mode Decision in H.264/AVC	claim
5	181	Dimension Reduction and Expansion: Distributed Source Coding in a Noisy Environment	claim
6	179	Design and Implementation of a High-Performance Microprocessor Cache Compression Algorithm	claim
7	175	Compressive-Projection Principal Component Analysis for the Compression of Hyperspectral Signatures	claim
8	171	Adaptive Compression of Graph Structured Text	claim
9	159	On Boolean functions with the sum of every two of them being bent	claim
10	151	Shared Descriptions Fusion Coding for Storage and Selective Retrieval of Correlated Sources	claim
11	150	Idempotents in the neighbourhood of Patterson-Wiedemann functions having Walsh spectra zeros	claim
12	150	Word-Based Statistical Compressors as Natural Language Compression Boosters	claim
13	149	Directional Lapped Transforms for Image Coding	claim
14	146	An improved list decoding algorithm for the second order Reed-Muller codes and its applications	claim
15	143	Compression of Hyperspectral Images with LVQ-SPECK	claim
16	143	A characterization of quadrics by intersection numbers	claim
17	142	Drift Characterization of Intra Prediction and Quantization in H.264	claim
18	137	Optimal Audio Transmission over Wireless Tandem Channels	claim
19	135	Sequences in abelian groups G of odd order without zero-sum subsequences of length exp ( G )	claim
20	135	A synthetic indifferentiability analysis of some block-cipher-based hash functions	claim
21	135	Rate Bounds on SSIM Index of Quantized Image DCT Coefficients	claim
22	133	Server Placement in Multiple-Description-Based Media Streaming	claim
23	130	A family of ternary quasi-perfect BCH codes	claim
24	130	Intra Prediction via Edge-Based Inpainting	claim
25	128	Coprimitive sets and inextendable codes	claim
26	127	On solving sparse algebraic equations over finite fields	claim
27	126	On the second weight of generalized Reed-Muller codes	claim
28	125	From graph states to two-graph states	claim
29	125	High-Resolution Functional Quantization	claim
30	124	On Self-Indexing Images - Image Compression with Added Value	claim
31	123	A Simple Algorithm for Computing the Lempel Ziv Factorization	claim
32	122	Distorting symmetric designs	claim
33	122	Filter Banks for Prediction-Compensated Multiple Description Coding	claim
34	122	Cryptographic properties of nonlinear pseudorandom number generators	claim
35	121	A Lower Bound on the Redundancy of Arithmetic-Type Delay Constrained Coding	claim
36	120	The trace of an optimal normal element and low complexity normal bases	claim
37	120	An Estimation-Theoretic Interpretation of Video Rate Distortion Optimization with Lagrangian Formulation	claim
38	119	Simultaneous Encryption/Compression of Images Using Alpha Rooting	claim
39	119	On the Symmetric Gaussian Multiple Description Rate-Distortion Function	claim
40	119	Improving HTML Compression	claim
41	118	Probabilistic algorithm for finding roots of linearized polynomials	claim
42	118	Practical Entropy-Bounded Schemes for O(1)-Range Minimum Queries	claim
43	118	Geometric Burrows-Wheeler Transform: Linking Range Searching and Text Indexing	claim
44	117	Distributed Multi-stage Coding of Correlated Sources	claim
45	114	Attacks on the RC4 stream cipher	claim
46	114	Re-pair Achieves High-Order Entropy	claim
47	114	Image Compression by Visual Pattern Vector Quantization (VPVQ)	claim
48	114	Huffman Coding with Non-sorted Frequencies	claim
49	113	Noise-Shaped Predictive Coding for Multiple Descriptions of a Colored Gaussian Source	claim
50	112	Edge local complementation and equivalence of binary linear codes	claim
51	112	Semantic security for the McEliece cryptosystem without random oracles	claim
52	112	Sublinear Recovery of Sparse Wavelet Signals	claim
53	111	New negative Latin square type partial difference sets in nonelementary abelian 2-groups and 3-groups	claim
54	111	Asymmetric Multi-level Diversity Coding	claim
55	110	Partial ovoids and partial spreads in hermitian polar spaces	claim
56	110	Compressed Index for Dictionary Matching	claim
57	110	Effective Visual Masking Techniques in JPEG2000	claim
58	108	On the graph of a function in many variables over a finite field	claim
59	106	Skew Hadamard designs and their codes	claim
60	106	Coding Overcomplete Representations of Audio Using the MCLT	claim
61	105	Obtaining a secure and efficient key agreement protocol from (H)MQV and NAXOS	claim
62	105	The Rate-Distortion Function of a Poisson Process with a Queueing Distortion Measure	claim
63	104	Homogeneous factorisations of Johnson graphs	claim
64	104	Extractors for binary elliptic curves	claim
65	103	Explicit constructions for perfect hash families	claim
66	103	Rate-Distortion Functions for Nonstationary Gaussian Autoregressive Processes	claim
67	101	The Quadratic Gaussian Rate-Distortion Function for Source Uncorrelated Distortions	claim
68	100	Guaranteed Synchronization of Huffman Codes	claim
69	100	A Reliable Chunkless Peer-to-Peer Architecture for Multimedia Streaming	claim
70	97	Finite geometries	claim
71	95	Divisible designs from twisted dual numbers	claim
72	94	Williamson matrices up to order 59	claim
73	94	VQ Based Image Retrieval Using Color and Position Features	claim
74	93	Random constructions and density results	claim
75	92	On vector space partitions and uniformly resolvable designs	claim
76	92	Improved versions of Tardos' fingerprinting scheme	claim
77	92	List Update Algorithms for Data Compression	claim
78	91	Text Pre-processing for Lossless Compression	claim
79	89	Twisted tensor product codes	claim
80	86	Small weight codewords in the codes arising from Desarguesian projective planes	claim
81	78	On orthogonal resolutions of the classical Steiner quadruple system SQS(16)	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers