Showing 3 results for Talebi
S. R. Talebiyan, S. Hosseini-Khayat,
Volume 5, Issue 3 (September 2009)
Abstract
A fast low-power 1-bit full adder circuit suitable for nano-scale CMOS implementation is presented. Out of the three modules in a common full-adder circuit, we have replaced one with a new design, and optimized another one, all with the goal to reduce the static power consumption. The design has been simulated and evaluated using the 65 nm PTM models.
S. Mohammadi, S. Talebi, A. Hakimi,
Volume 8, Issue 2 (June 2012)
Abstract
In this paper we introduce two innovative image and video watermarking
algorithms. The paper’s main emphasis is on the use of chaotic maps to boost the
algorithms’ security and resistance against attacks. By encrypting the watermark
information in a one dimensional chaotic map, we make the extraction of watermark for
potential attackers very hard. In another approach, we select embedding positions by a two
dimensional chaotic map which enables us to satisfactorily distribute watermark
information throughout the host signal. This prevents concentration of watermark data in a
corner of the host signal which effectively saves it from being a target for attacks that
include cropping of the signal. The simulation results demonstrate that the proposed
schemes are quite resistant to many kinds of attacks which commonly threaten
watermarking algorithms.
M. Soleimanpour-Moghadam, S. Talebi,
Volume 9, Issue 2 (June 2013)
Abstract
This paper devotes itself to the study of secret message delivery using cover image and introduces a novel steganographic technique based on genetic algorithm to find a near-optimum structure for the pair-wise least-significant-bit (LSB) matching scheme. A survey of the related literatures shows that the LSB matching method developed by Mielikainen, employs a binary function to reduce the number of changes of LSB values. This method verifiably reduces the probability of detection and also improves the visual quality of stego images. So, our proposal draws on the Mielikainen's technique to present an enhanced dual-state scoring model, structured upon genetic algorithm which assesses the performance of different orders for LSB matching and searches for a near-optimum solution among all the permutation orders. Experimental results confirm superiority of the new approach compared to the Mielikainen’s pair-wise LSB matching scheme.
