1,318 research outputs found
Non-catastrophic Encoders and Encoder Inverses for Quantum Convolutional Codes
We present an algorithm to construct quantum circuits for encoding and
inverse encoding of quantum convolutional codes. We show that any quantum
convolutional code contains a subcode of finite index which has a
non-catastrophic encoding circuit. Our work generalizes the conditions for
non-catastrophic encoders derived in a paper by Ollivier and Tillich
(quant-ph/0401134) which are applicable only for a restricted class of quantum
convolutional codes. We also show that the encoders and their inverses
constructed by our method naturally can be applied online, i.e., qubits can be
sent and received with constant delay.Comment: 6 pages, 1 figure, submitted to 2006 IEEE International Symposium on
Information Theor
FRESH β FRI-based single-image super-resolution algorithm
In this paper, we consider the problem of single image super-resolution and propose a novel algorithm that outperforms state-of-the-art methods without the need of learning patches pairs from external data sets. We achieve this by modeling images and, more precisely, lines of images as piecewise smooth functions and propose a resolution enhancement method for this type of functions. The method makes use of the theory of sampling signals with finite rate of innovation (FRI) and combines it with traditional linear reconstruction methods. We combine the two reconstructions by leveraging from the multi-resolution analysis in wavelet theory and show how an FRI reconstruction and a linear reconstruction can be fused using filter banks. We then apply this method along vertical, horizontal, and diagonal directions in an image to obtain a single-image super-resolution algorithm. We also propose a further improvement of the method based on learning from the errors of our super-resolution result at lower resolution levels. Simulation results show that our method outperforms state-of-the-art algorithms under different blurring kernels
On list decoding of wavelet codes over finite fields of characteristic two
ΠΠΎΠΊΠ°Π·ΡΠ²Π°Π΅ΡΡΡ, ΡΡΠΎ Π²Π΅ΠΉΠ²Π»Π΅Ρ-ΠΊΠΎΠ΄ Π½Π°Π΄ ΠΏΠΎΠ»Π΅ΠΌ GF(2m) c Π΄Π»ΠΈΠ½ΠΎΠΉ ΠΊΠΎΠ΄ΠΎΠ²ΡΡ
ΠΈ ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠΎΠ½Π½ΡΡ
ΡΠ»ΠΎΠ² n = 2m β 1 ΠΈ (n β 1)/2 ΡΠΎΠΎΡΠ²Π΅ΡΡΡΠ²Π΅Π½Π½ΠΎ, Ρ ΠΊΠΎΡΠΎΡΠΎΠ³ΠΎ ΡΡΠ΅Π΄ΠΈ ΠΊΠΎΡΡΡΠΈΡΠΈΠ΅Π½ΡΠΎΠ² ΡΠΏΠ΅ΠΊΡΡΠ°Π»ΡΠ½ΠΎΠ³ΠΎ ΠΏΡΠ΅Π΄ΡΡΠ°Π²Π»Π΅Π½ΠΈΡ ΠΏΠΎΡΠΎΠΆΠ΄Π°ΡΡΠ΅Π³ΠΎ ΠΌΠ½ΠΎΠ³ΠΎΡΠ»Π΅Π½Π° ΠΈΠΌΠ΅Π΅ΡΡΡ d + 1 ΠΏΠΎΡΠ»Π΅Π΄ΠΎΠ²Π°ΡΠ΅Π»ΡΠ½ΡΡ
Π½ΡΠ»Π΅ΠΉ, 0 < d < (n β 3)/2, Π΄ΠΎΠΏΡΡΠΊΠ°Π΅Ρ ΡΠΏΠΈΡΠΎΡΠ½ΠΎΠ΅ Π΄Π΅ΠΊΠΎΠ΄ΠΈΡΠΎΠ²Π°Π½ΠΈΠ΅ Π·Π° ΠΏΠΎΠ»ΠΈΠ½ΠΎΠΌΠΈΠ°Π»ΡΠ½ΠΎΠ΅ Π²ΡΠ΅ΠΌΡ. Π¨Π°Π³ΠΈ Π°Π»Π³ΠΎΡΠΈΡΠΌΠ°, ΠΎΡΡΡΠ΅ΡΡΠ²Π»ΡΡΡΠ΅Π³ΠΎ ΡΠΏΠΈΡΠΎΡΠ½ΠΎΠ΅ Π΄Π΅ΠΊΠΎΠ΄ΠΈΡΠΎΠ²Π°Π½ΠΈΠ΅ Ρ ΠΈΡΠΏΡΠ°Π²Π»Π΅Π½ΠΈΠ΅ΠΌ Π΄ΠΎ e < n β Π΄/n(n β d β 2) ΠΎΡΠΈΠ±ΠΎΠΊ, ΡΠ΅Π°Π»ΠΈΠ·ΠΎΠ²Π°Π½Ρ Π² Π²ΠΈΠ΄Π΅ ΠΏΡΠΎΠ³ΡΠ°ΠΌΠΌΡ. ΠΡΠΈΠ²Π΅Π΄Π΅Π½Ρ ΠΏΡΠΈΠΌΠ΅ΡΡ Π΅Ρ ΠΏΡΠΈΠΌΠ΅Π½Π΅Π½ΠΈΡ Π΄Π»Ρ ΡΠΏΠΈΡΠΎΡΠ½ΠΎΠ³ΠΎ Π΄Π΅ΠΊΠΎΠ΄ΠΈΡΠΎΠ²Π°Π½ΠΈΡ Π·Π°ΡΡΠΌΠ»Π΅Π½Π½ΡΡ
ΠΊΠΎΠ΄ΠΎΠ²ΡΡ
ΡΠ»ΠΎΠ². ΠΡΠΌΠ΅ΡΠ΅Π½ΠΎ, ΡΡΠΎ Π½Π΅ΡΠ°Π²Π΅Π½ΡΡΠ²ΠΎ ΠΠ°ΡΡΠ°ΠΌΠΎΠ²Π° β ΠΠΈΠ»Π±Π΅ΡΡΠ° ΠΏΡΠΈ Π΄ΠΎΡΡΠ°ΡΠΎΡΠ½ΠΎ Π±ΠΎΠ»ΡΡΠΈΡ
n Π½Π΅ ΠΏΠΎΠ·Π²ΠΎΠ»ΡΠ΅Ρ ΡΡΠ΄ΠΈΡΡ ΠΎ ΡΡΡΠ΅ΡΡΠ²ΠΎΠ²Π°Π½ΠΈΠΈ Π²Π΅ΠΉΠ²Π»Π΅Ρ-ΠΊΠΎΠ΄ΠΎΠ² c ΠΌΠ°ΠΊΡΠΈΠΌΠ°Π»ΡΠ½ΡΠΌ ΠΊΠΎΠ΄ΠΎΠ²ΡΠΌ ΡΠ°ΡΡΡΠΎΡΠ½ΠΈΠ΅ΠΌ (n β 1) /2
Π‘ΠΏΠΈΡΠΎΡΠ½ΠΎΠ΅ Π΄Π΅ΠΊΠΎΠ΄ΠΈΡΠΎΠ²Π°Π½ΠΈΠ΅ Π²Π΅ΠΉΠ²Π»Π΅Ρ-ΠΊΠΎΠ΄ΠΎΠ²
Π ΡΠ°Π±ΠΎΡΠ΅ ΠΎΠ±ΡΡΠΆΠ΄Π°Π΅ΡΡΡ Π²ΠΎΠ·ΠΌΠΎΠΆΠ½ΠΎΡΡΡ ΡΠΏΠΈΡΠΎΡΠ½ΠΎΠ³ΠΎ Π΄Π΅ΠΊΠΎΠ΄ΠΈΡΠΎΠ²Π°Π½ΠΈΡ Π²Π΅ΠΉΠ²Π»Π΅Ρ-ΠΊΠΎΠ΄ΠΎΠ² ΠΈ ΠΏΡΠΈΠ²ΠΎΠ΄ΠΈΡΡΡ ΡΡΠ²Π΅ΡΠΆΠ΄Π΅Π½ΠΈΠ΅, ΡΠΎΠ³Π»Π°ΡΠ½ΠΎ ΠΊΠΎΡΠΎΡΠΎΠΌΡ Π²Π΅ΠΉΠ²Π»Π΅Ρ-ΠΊΠΎΠ΄Ρ Π½Π°Π΄ ΠΏΠΎΠ»Π΅ΠΌ Π½Π΅ΡΠ΅ΡΠ½ΠΎΠΉ Ρ
Π°ΡΠ°ΠΊΡΠ΅ΡΠΈΡΡΠΈΠΊΠΈ Ρ Π΄Π»ΠΈΠ½ΠΎΠΉ ΠΊΠΎΠ΄ΠΎΠ²ΡΡ
ΠΈ ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠΎΠ½Π½ΡΡ
ΡΠ»ΠΎΠ² ΠΈ ΡΠΎΠΎΡΠ²Π΅ΡΡΡΠ²Π΅Π½Π½ΠΎ, Π° ΡΠ°ΠΊΠΆΠ΅ Π½Π°Π΄ ΠΏΠΎΠ»Π΅ΠΌ ΡΠ΅ΡΠ½ΠΎΠΉ Ρ
Π°ΡΠ°ΠΊΡΠ΅ΡΠΈΡΡΠΈΠΊΠΈ Ρ Π΄Π»ΠΈΠ½ΠΎΠΉ ΠΊΠΎΠ΄ΠΎΠ²ΡΡ
ΠΈ ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠΎΠ½Π½ΡΡ
ΡΠ»ΠΎΠ² ΠΈ ΡΠΎΠΎΡΠ²Π΅ΡΡΡΠ²Π΅Π½Π½ΠΎ Π΄ΠΎΠΏΡΡΠΊΠ°ΡΡ ΡΠΏΠΈΡΠΎΡΠ½ΠΎΠ΅ Π΄Π΅ΠΊΠΎΠ΄ΠΈΡΠΎΠ²Π°Π½ΠΈΠ΅, Π΅ΡΠ»ΠΈ ΡΡΠ΅Π΄ΠΈ ΠΊΠΎΡΡΡΠΈΡΠΈΠ΅Π½ΡΠΎΠ² ΡΠΏΠ΅ΠΊΡΡΠ°Π»ΡΠ½ΠΎΠ³ΠΎ ΠΏΡΠ΅Π΄ΡΡΠ°Π²Π»Π΅Π½ΠΈΡ ΠΈΡ
ΠΏΠΎΡΠΎΠΆΠ΄Π°ΡΡΠΈΡ
ΠΌΠ½ΠΎΠ³ΠΎΡΠ»Π΅Π½ΠΎΠ² ΠΈΠΌΠ΅Π΅ΡΡΡ ΠΏΠΎΡΠ»Π΅Π΄ΠΎΠ²Π°ΡΠ΅Π»ΡΠ½ΡΡ
Π½ΡΠ»Π΅ΠΉ, < < Π΄Π»Ρ ΠΏΠΎΠ»Π΅ΠΉ Π½Π΅ΡΠ΅ΡΠ½ΠΎΠΉ Ρ
Π°ΡΠ°ΠΊΡΠ΅ΡΠΈΡΡΠΈΠΊΠΈ ΠΈ < < Π΄Π»Ρ ΠΏΠΎΠ»Π΅ΠΉ ΡΠ΅ΡΠ½ΠΎΠΉ Ρ
Π°ΡΠ°ΠΊΡΠ΅ΡΠΈΡΡΠΈΠΊΠΈ. Π’Π°ΠΊΠΆΠ΅ ΠΎΠΏΠΈΡΡΠ²Π°Π΅ΡΡΡ Π°Π»Π³ΠΎΡΠΈΡΠΌ, ΠΏΠΎΠ·Π²ΠΎΠ»ΡΡΡΠΈΠΉ Π²ΡΠΏΠΎΠ»Π½ΡΡΡ ΡΠΏΠΈΡΠΎΡΠ½ΠΎΠ΅ Π΄Π΅ΠΊΠΎΠ΄ΠΈΡΠΎΠ²Π°Π½ΠΈΠ΅ Π²Π΅ΠΉΠ²Π»Π΅Ρ-ΠΊΠΎΠ΄ΠΎΠ² ΠΏΡΠΈ ΡΠΎΠ±Π»ΡΠ΄Π΅Π½ΠΈΠΈ ΠΏΠ΅ΡΠ΅ΡΠΈΡΠ»Π΅Π½Π½ΡΡ
ΡΡΠ»ΠΎΠ²ΠΈΠΉ. Π ΠΊΠ°ΡΠ΅ΡΡΠ²Π΅ Π΄Π΅ΠΌΠΎΠ½ΡΡΡΠ°ΡΠΈΠΈ Π΅Π³ΠΎ ΡΠ°Π±ΠΎΡΡ ΠΏΡΠΈΠ²ΠΎΠ΄ΡΡΡΡ ΠΏΠΎΡΠ°Π³ΠΎΠ²ΡΠ΅ ΡΠ΅ΡΠ΅Π½ΠΈΡ ΠΌΠΎΠ΄Π΅Π»ΡΠ½ΡΡ
Π·Π°Π΄Π°Ρ ΡΠΏΠΈΡΠΎΡΠ½ΠΎΠ³ΠΎ Π΄Π΅ΠΊΠΎΠ΄ΠΈΡΠΎΠ²Π°Π½ΠΈΡ Π·Π°ΡΡΠΌΠ»Π΅Π½Π½ΡΡ
ΠΊΠΎΠ΄ΠΎΠ²ΡΡ
ΡΠ»ΠΎΠ² Π²Π΅ΠΉΠ²Π»Π΅Ρ-ΠΊΠΎΠ΄ΠΎΠ² Π½Π°Π΄ ΠΏΠΎΠ»ΡΠΌΠΈ ΡΠ΅ΡΠ½ΠΎΠΉ ΠΈ Π½Π΅ΡΠ΅ΡΠ½ΠΎΠΉ Ρ
Π°ΡΠ°ΠΊΡΠ΅ΡΠΈΡΡΠΈΠΊΠΈ. ΠΠΎΠΌΠΈΠΌΠΎ ΡΡΠΎΠ³ΠΎ, Π² ΡΠ°Π±ΠΎΡΠ΅ ΠΏΠΎΡΡΡΠΎΠ΅Π½Π° Π²Π΅ΠΉΠ²Π»Π΅Ρ-Π²Π΅ΡΡΠΈΡ ΠΊΠ²Π°Π·ΠΈΡΠΎΠ²Π΅ΡΡΠ΅Π½Π½ΠΎΠ³ΠΎ ΡΡΠΎΠΈΡΠ½ΠΎΠ³ΠΎ ΠΊΠΎΠ΄Π° ΠΠΎΠ»Π΅Ρ, Π΄Π»ΠΈΠ½Ρ Π΅Π³ΠΎ ΠΊΠΎΠ΄ΠΎΠ²ΡΡ
ΠΈ ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠΎΠ½Π½ΡΡ
ΡΠ»ΠΎΠ² ΡΠ°Π²Π½Ρ 8 ΠΈ 4 ΡΠΎΠΎΡΠ²Π΅ΡΡΡΠ²Π΅Π½Π½ΠΎ, ΠΊΠΎΠ΄ΠΎΠ²ΠΎΠ΅ ΡΠ°ΡΡΡΠΎΡΠ½ΠΈΠ΅ ΡΠ°Π²Π½ΠΎ 4, ΠΌΠΈΠ½ΠΈΠΌΠ°Π»ΡΠ½ΡΠΉ ΡΠ°Π΄ΠΈΡΡ ΡΠ°ΡΠΎΠ² Ρ ΡΠ΅Π½ΡΡΠ°ΠΌΠΈ Π² ΠΊΠΎΠ΄ΠΎΠ²ΡΡ
ΡΠ»ΠΎΠ²Π°Ρ
, ΠΏΠΎΠΊΡΡΠ²Π°ΡΡΠΈΡ
ΠΏΡΠΎΡΡΡΠ°Π½ΡΡΠ²ΠΎ ΡΠ»ΠΎΠ² Π΄Π»ΠΈΠ½Ρ 8, ΡΠ°Π²Π΅Π½ 3
Spread spectrum-based video watermarking algorithms for copyright protection
Merged with duplicate record 10026.1/2263 on 14.03.2017 by CS (TIS)Digital technologies know an unprecedented expansion in the last years. The consumer can
now benefit from hardware and software which was considered state-of-the-art several years
ago. The advantages offered by the digital technologies are major but the same digital
technology opens the door for unlimited piracy. Copying an analogue VCR tape was certainly
possible and relatively easy, in spite of various forms of protection, but due to the analogue
environment, the subsequent copies had an inherent loss in quality. This was a natural way of
limiting the multiple copying of a video material. With digital technology, this barrier
disappears, being possible to make as many copies as desired, without any loss in quality
whatsoever. Digital watermarking is one of the best available tools for fighting this threat.
The aim of the present work was to develop a digital watermarking system compliant with the
recommendations drawn by the EBU, for video broadcast monitoring. Since the watermark
can be inserted in either spatial domain or transform domain, this aspect was investigated and
led to the conclusion that wavelet transform is one of the best solutions available. Since
watermarking is not an easy task, especially considering the robustness under various attacks
several techniques were employed in order to increase the capacity/robustness of the system:
spread-spectrum and modulation techniques to cast the watermark, powerful error correction
to protect the mark, human visual models to insert a robust mark and to ensure its invisibility.
The combination of these methods led to a major improvement, but yet the system wasn't
robust to several important geometrical attacks. In order to achieve this last milestone, the
system uses two distinct watermarks: a spatial domain reference watermark and the main
watermark embedded in the wavelet domain. By using this reference watermark and techniques
specific to image registration, the system is able to determine the parameters of the attack and
revert it. Once the attack was reverted, the main watermark is recovered. The final result is a
high capacity, blind DWr-based video watermarking system, robust to a wide range of attacks.BBC Research & Developmen
- β¦