Sciweavers

90 search results - page 9 / 18
» Perfect Sorting by Reversals
Sort
View
INFORMATICALT
2007
112views more  INFORMATICALT 2007»
13 years 7 months ago
Look-up Table Based Reversible Data Hiding for Error Diffused Halftone Images
This paper proposes a reversible data hiding method for error diffused halftone images. It employs statistics feature of pixel block patterns to embed data, and utilizes the HVS ch...
Jeng-Shyang Pan, Hao Luo, Zhe-Ming Lu
ICIP
2007
IEEE
14 years 2 months ago
H2O: Reversible Hexagonal-Orthogonal Grid Conversion by 1-D Filtering
In this work, we propose a new grid conversion algorithm between the hexagonal lattice and the orthogonal (a.k.a. Cartesian) lattice. The conversion process, named H2O, is easy to...
Laurent Condat, Brigitte Forster-Heinlein, Dimitri...
ICIP
2007
IEEE
14 years 2 months ago
Infinity-Norm Rotation for Reversible Data Hiding
In this paper, we propose a novel transform that preserves the dynamic range—infinity-norm rotation. This transform is perfectly reversible and piecewise linear, and keeps the m...
Lei Yang, Pengwei Hao
CPM
2001
Springer
108views Combinatorics» more  CPM 2001»
14 years 10 days ago
A Very Elementary Presentation of the Hannenhalli-Pevzner Theory
In 1995, Hannenhalli and Pevzner gave a first polynomial solution to the problem of finding the minimum number of reversals needed to sort a signed permutation.Their solution, a...
Anne Bergeron
COMBINATORICS
2007
112views more  COMBINATORICS 2007»
13 years 7 months ago
Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set
In the last decade there has been an ongoing interest in string comparison problems; to a large extend the interest was stimulated by genome rearrangement problems in computationa...
Petr Kolman, Tomasz Walen