Sciweavers

283 search results - page 17 / 57
» On the Use of Context Tree for Binary Image Compression
Sort
View
ICASSP
2010
IEEE
13 years 3 months ago
Using reed-muller sequences as deterministic compressed sensing matrices for image reconstruction
An image reconstruction algorithm using compressed sensing (CS) with deterministic matrices of second-order ReedMuller (RM) sequences is introduced. The 1D algorithm of Howard et ...
Kangyu Ni, Somantika Datta, Prasun Mahanti, Svetla...
MM
1994
ACM
143views Multimedia» more  MM 1994»
14 years 15 days ago
Quad-Tree Segmentation for Texture-Based Image Query
In this paper we propose a technique for segmenting images by texture content with application to indexing images in a large image database. Using a quad-tree decomposition, textu...
Jonathan M. Smith, Shih-Fu Chang
ICIP
2000
IEEE
14 years 25 days ago
Multiscale Texture Segmentation Using Hybrid Contextual Labeling Tree
Wavelet-domain hidden Markov tree (HMT) model has been recently proposed and applied to image processing, e.g., image segmentation. A new multiscale image segmentation method, cal...
Guoliang Fan, Xiang-Gen Xia
ICIP
1997
IEEE
14 years 10 months ago
Binary Shape Coding Using 1-D Distance Values from Baseline
Here we describe a baseline-based binary shape coding method in which arbitrarily shaped object is represented by the traced 1-D data from baseline and turning point (TP). The sha...
Shi Hwa Lee, Dae-Sung Cho, Yu-Shin Cho, Sehoon Son...
ISCAS
2006
IEEE
135views Hardware» more  ISCAS 2006»
14 years 2 months ago
Image compression with structure-aware inpainting
— This paper carves out a way to image compression that is motivated by the recent advancement in image inpainting. An image coding approach is proposed in which a number of regi...
Chen Wang, Xiaoyan Sun, Feng Wu, Hongkai Xiong