Sciweavers

540 search results - page 35 / 108
» A New Compression Method for Compressed Matching
Sort
View
IWANN
2005
Springer
15 years 3 months ago
Robust Blind Image Watermarking with Independent Component Analysis: A Embedding Algorithm
Abstract. The authors propose a new solution to the blind robust watermarking of digital images. In this approach we embed the watermark into the independent components of the imag...
Juan José Murillo-Fuentes, Rafael Boloix-To...
SPIESR
1993
125views Database» more  SPIESR 1993»
14 years 11 months ago
Self-Aligning and Compressed Autosophy Video Databases
Autosophy, an emerging new science, explains "Self-assembling Structures", such crystals or living trees, in mathematical terms. This research provides a new mathematica...
Klaus Holtz
ECCV
2008
Springer
14 years 11 months ago
SMD: A Locally Stable Monotonic Change Invariant Feature Descriptor
Extraction and matching of discriminative feature points in images is an important problem in computer vision with applications in image classification, object recognition, mosaici...
Raj Gupta, Anurag Mittal
DCC
2005
IEEE
15 years 9 months ago
Progressive Low Bit Rate Coding of Simple 3D Objects with Matching Pursuit
This paper presents a low rate progressive 3D mesh compression scheme for simple genuszero 3D objects. The proposed scheme is based on signal representation using redundant expans...
Ivana Tosic, Pascal Frossard, Pierre Vandergheynst
CPM
2001
Springer
211views Combinatorics» more  CPM 2001»
15 years 2 months ago
Fuzzy Hamming Distance: A New Dissimilarity Measure
Lempel Ziv Coding (Extended Abstract). . . . . . . . . . . . . . . . . . . . . . . 18 Shmuel Tomi Klein, Yair Wiseman Approximate Matching of Run-Length Compressed Strings . . . . ...
Abraham Bookstein, Shmuel T. Klein, Timo Raita