Abstract: A new blind gray-level watermarking scheme is described. In the proposed method, the host image is first divided into 4*4 non-overlapping blocks. For each block, two first AC coefficients of its Hadamard transform are then estimated using DC coefficients of its neighbor blocks. A gray-level watermark is then added into estimated values. Since embedding watermark does not change the DC coefficients, watermark extracting could be done by estimating AC coefficients and comparing them with their actual values. Several experiments are made and results suggest the robustness of the proposed algorithm.
Abstract: A new code for spectral-amplitude coding optical
code-division multiple-access system is proposed called Random
diagonal (RD) code. This code is constructed using code segment and
data segment. One of the important properties of this code is that the
cross correlation at data segment is always zero, which means that
Phase Intensity Induced Noise (PIIN) is reduced. For the performance
analysis, the effects of phase-induced intensity noise, shot noise, and
thermal noise are considered simultaneously. Bit-error rate (BER)
performance is compared with Hadamard and Modified Frequency
Hopping (MFH) codes. It is shown that the system using this new
code matrices not only suppress PIIN, but also allows larger number
of active users compare with other codes. Simulation results shown
that using point to point transmission with three encoded channels,
RD code has better BER performance than other codes, also its found
that at 0 dbm PIIN noise are 10-10 and 10-11 for RD and MFH
respectively.
Abstract: We propose the use of magneto-optic Kerr effect (MOKE) to realize single-qubit quantum gates. We consider longitudinal and polar MOKE in reflection geometry in which the magnetic field is parallel to both the plane of incidence and surface of the film. MOKE couples incident TE and TM polarized photons and the Hamiltonian that represents this interaction is isomorphic to that of a canonical two-level quantum system. By varying the phase and amplitude of the magnetic field, we can realize Hadamard, NOT, and arbitrary phase-shift single-qubit quantum gates. The principal advantage is operation with magnetically non-transparent materials.
Abstract: In 1990 [1] the subband-DFT (SB-DFT) technique was proposed. This technique used the Hadamard filters in the decomposition step to split the input sequence into low- and highpass sequences. In the next step, either two DFTs are needed on both bands to compute the full-band DFT or one DFT on one of the two bands to compute an approximate DFT. A combination network with correction factors was to be applied after the DFTs. Another approach was proposed in 1997 [2] for using a special discrete wavelet transform (DWT) to compute the discrete Fourier transform (DFT). In the first step of the algorithm, the input sequence is decomposed in a similar manner to the SB-DFT into two sequences using wavelet decomposition with Haar filters. The second step is to perform DFTs on both bands to obtain the full-band DFT or to obtain a fast approximate DFT by implementing pruning at both input and output sides. In this paper, the wavelet-based DFT (W-DFT) with Haar filters is interpreted as SB-DFT with Hadamard filters. The only difference is in a constant factor in the combination network. This result is very important to complete the analysis of the W-DFT, since all the results concerning the accuracy and approximation errors in the SB-DFT are applicable. An application example in spectral analysis is given for both SB-DFT and W-DFT (with different filters). The adaptive capability of the SB-DFT is included in the W-DFT algorithm to select the band of most energy as the band to be computed. Finally, the W-DFT is extended to the two-dimensional case. An application in image transformation is given using two different types of wavelet filters.
Abstract: We analyze the effectivity of different pseudo noise (PN) and orthogonal sequences for encrypting speech signals in terms of perceptual intelligence. Speech signal can be viewed as sequence of correlated samples and each sample as sequence of bits. The residual intelligibility of the speech signal can be reduced by removing the correlation among the speech samples. PN sequences have random like properties that help in reducing the correlation among speech samples. The mean square aperiodic auto-correlation (MSAAC) and the mean square aperiodic cross-correlation (MSACC) measures are used to test the randomness of the PN sequences. Results of the investigation show the effectivity of large Kasami sequences for this purpose among many PN sequences.
Abstract: A subcarrier - spectral amplitude coding optical code
division multiple access system using the Khazani-Syed code with
Complementary subtraction detection technique is proposed. The
proposed system has been analyzed by taking into account the effects
of phase-induced intensity noise, shot noise, thermal noise and intermodulation
distortion noise. The performance of the system has been
compared with the spectral amplitude coding optical code division
multiple access system using the Hadamard code and the Modified
Quadratic Congruence code. The analysis shows that the proposed
system can eliminate the multiple access interference using the
Complementary subtraction detection technique, and hence improve
the overall system performance.
Abstract: This Paper proposes a new facial feature extraction approach, Wash-Hadamard Transform (WHT). This approach is based on correlation between local pixels of the face image. Its primary advantage is the simplicity of its computation. The paper compares the proposed approach, WHT, which was traditionally used in data compression with two other known approaches: the Principal Component Analysis (PCA) and the Discrete Cosine Transform (DCT) using the face database of Olivetti Research Laboratory (ORL). In spite of its simple computation, the proposed algorithm (WHT) gave very close results to those obtained by the PCA and DCT. This paper initiates the research into WHT and the family of frequency transforms and examines their suitability for feature extraction in face recognition applications.
Abstract: In this paper, a two factor scheme is proposed to
generate cryptographic keys directly from biometric data, which
unlike passwords, are strongly bound to the user. Hash value of the
reference iris code is used as a cryptographic key and its length
depends only on the hash function, being independent of any other
parameter. The entropy of such keys is 94 bits, which is much higher
than any other comparable system. The most important and distinct
feature of this scheme is that it regenerates the reference iris code by
providing a genuine iris sample and the correct user password. Since
iris codes obtained from two images of the same eye are not exactly
the same, error correcting codes (Hadamard code and Reed-Solomon
code) are used to deal with the variability. The scheme proposed here
can be used to provide keys for a cryptographic system and/or for
user authentication. The performance of this system is evaluated on
two publicly available databases for iris biometrics namely CBS and
ICE databases. The operating point of the system (values of False
Acceptance Rate (FAR) and False Rejection Rate (FRR)) can be set
by properly selecting the error correction capacity (ts) of the Reed-
Solomon codes, e.g., on the ICE database, at ts = 15, FAR is 0.096%
and FRR is 0.76%.
Abstract: Results in one field necessarily give insight into the
others, and all have much potential for scientific and technological
application. The Hadamard-transform technique once been applied to
the spectrometry also has its use in the SNR Enhancement of OTDR.
In this report, a new set of code (Simplex-codes) is discussed and
where the addition gain of SNR come from is implied.
Abstract: In this paper we study the use of a new code called
Random Diagonal (RD) code for Spectral Amplitude Coding (SAC)
optical Code Division Multiple Access (CDMA) networks, using
Fiber Bragg-Grating (FBG), FBG consists of a fiber segment whose
index of reflection varies periodically along its length. RD code is
constructed using code level and data level, one of the important
properties of this code is that the cross correlation at data level is
always zero, which means that Phase intensity Induced Phase (PIIN)
is reduced. We find that the performance of the RD code will be
better than Modified Frequency Hopping (MFH) and Hadamard code
It has been observed through experimental and theoretical simulation
that BER for RD code perform significantly better than other codes.
Proof –of-principle simulations of encoding with 3 channels, and 10
Gbps data transmission have been successfully demonstrated together
with FBG decoding scheme for canceling the code level from SAC-signal.