Browsing by Author "Hamami, Latifa"
Now showing 1 - 20 of 23
Results Per Page
Sort Options
- ItemA comparative study between compressed video watermarking methods based on DCT coefficients and intra prediction(2011-04-20) Bouchama, Samira; Hamami, Latifa; Aliane, HassinaSeveral watermarking methods have been applied to the newest video codec H.264/AVC to satisfy different applications such as authentication, tamper proof and copyright protection. Our objective through this paper is to present a comparative study between watermarking methods based on the quantized (Q) DCT coefficients and those based on the intra prediction of the 4x4 luma blocks, in terms of embedding capacity, video quality and bitrate. The use of intra prediction modes is motivating because it is possible to embed a relatively high embedding capacity while preserving the video quality; however it seems difficult to maintain the bitrate. In this paper we show that the Intra prediction based method outperforms the QDCT based method using the same codec configuration.
- ItemA comparative study between compressed video watermarking methods based on DCT coefficients and intra prediction(CERIST, 2011-09) Bouchama, Samira; Hamami, Latifa; Aliane, HassinaSeveral watermarking methods have been applied to the newest video codec H.264/AVC to satisfy different applications such as authentication, tamper proof and copyright protection. Our objective through this paper is to present a comparative study between watermarking methods based on the quantized (Q) DCT coefficients and those based on the intra prediction of the 4x4 luma blocks, in terms of embedding capacity, video quality and bitrate. The use of intra prediction modes is motivating because it is possible to embed a relatively high embedding capacity while preserving the video quality; however it seems difficult to maintain the bitrate. In this paper we show that the Intra prediction based method outperforms the QDCT based method using the same codec configuration.
- ItemLes Algorithmes génétiques Application à la segmentation des images(CERIST, Alger, 2004) Lassouaoui, Nadia; Hamami, Latifa; Nouali-Taboudjemat, NadiaLes algorithmes génétiques ont des propriétés qui en font des candidats de choix pour résoudre des problèmes d’optimisation dans lesquels la taille de l’espace de recherche est importante, où les paramètres interagissent de manière complexe et où très peu d’informations sur la fonction à optimiser sont disponibles. Ces propriétés ont motivé leur application à divers domaines. Dans ce papier, nous présentons les fondements des AGs ; les travaux récents effectués en analyse d’images et plus particulièrement en segmentation ; nous étudions en détails et appliquons un algorithme non supervisé de segmentation, nous l’améliorons en proposant un nouvel opérateur de mutation. Et avec le multiseuillage par Fisher, nous l’avons adapté à la détection des corps cellulaires dans des images de cellules biologiques du col.
- ItemDetection and Description the Lesions in Brain Images(University Cadi Ayyad (Marroc), 2005-11) Lassouaoui, Nadia; Hamami, Latifa; Nouali-Taboudjemat, Nadia; Hadjar, Samir; Saadi, HocineIn this paper, we present the various stages for lesion recognition in brain images. We firstly apply a filtering based on geodesic reconstruction operator for increasing the quality of image. After, we use an unsupervised segmentation genetic algorithm for detecting the abnormal zones with respect of theirs morphological characteristics because they define the nature of illness (cyst, tumour, malignant, benign, …). The obtained segmented images are analyzed for computing the characteristics of illness which are necessary for the recognition stage for deducing a decision about the type of illness. So, we give also the various algorithms used for computing the morphological characteristics of lesions (size, shape, position, texture, …). Since we obtain a decision about the malignity or benignity of the lesion and a quantitative information for helping the doctors to locate the sick part.
- ItemError Drift Compensation for Data Hiding of the H.264/AVC(Romanian Society of Control Engineering and Technical Informatics, 2013) Bouchama, Samira; Hamami, Latifa; Aliane, HassinaThe error propagation problem is one of the most attractive issues in the field of data hiding of compressed video because the achievement of several data hiding characteristics remains dependant on it. In this paper, a solution to compensate the error propagation is proposed for data hiding of the H.264/AVC. The error compensation is performed by a prior measurement of the introduced error in the watermarked block or in the neighbouring blocks. Two schemes are proposed: The first algorithm exploits the method of watermarking paired-coefficients in each block in order to bring the error to the middle of the block matrix. The distortion caused by each paired-coefficient is calculated in order to give a watermarking priority to the pairs which introduce the minimum error. In the second scheme, the error estimated in the neighbouring blocks is reduced from the residuals during the encoding process. In both schemes, results show that an important improvement of the video quality can be achieved and a good compromise is provided between the video distortion, the bitrate and the embedding.
- ItemError Drift Compensation for Data Hiding of the H.264/AVC(CERIST, 2013) Bouchama, Samira; Hamami, Latifa; Aliane, HassinaThe error propagation problem is one of the most attractive issues in the field of data hiding of compressed video because the achievement of several data hiding characteristics remains dependant on it. In this paper, a solution to compensate the error propagation is proposed for data hiding of the H.264/AVC. The error compensation is performed by a prior measurement of the introduced error in the watermarked block or in the neighbouring blocks. Two schemes are proposed: The first algorithm exploits the method of watermarking paired-coefficients in each block in order to bring the error to the middle of the block matrix. The distortion caused by each paired-coefficient is calculated in order to give a watermarking priority to the pairs which introduce the minimum error. In the second scheme, the error estimated in the neighbouring blocks is reduced from the residuals during the encoding process. In both schemes, results show that an important improvement of the video quality can be achieved and a good compromise is provided between the video distortion, the bitrate and the embedding.
- ItemExtraction des lésions dans des images de scanner cérébral pour système de télédiagnostic(Springer-Verlag, 2004) Lassouaoui, Nadia; Hamami, Latifa; Nouali-Taboudjemat, Nadia; Aït Abdelkader, BelaïdLe cancer est l’une des maladies les plus répandues dans le monde. Des chercheurs ont pensé à réaliser des systèmes qui seront des outils d’aide au diagnostic et à la décision pour les médecins. La mise sur réseau de tels systèmes permet d’avoir une application de télédiagnostic, le but est d’apporter «une seconde opinion» par un spécialiste distant pour confirmer ou infirmer le diagnostic établi par le praticien local, ou bien aider ce dernier à arriver à un diagnostic correct. Afin de concevoir un tel système, plusieurs aspects sont à prendre en charge. L’un des aspects les plus importants sont les problèmes liés à la taille des images médicales par rapport au débit de transmission. Pour cela, dans le cas du cancer du cerveau, nous proposons de concevoir un module pour l’extraction des lésions, son rôle est d’extraire la lésion tout en respectant sa taille, sa forme et sa position. Ainsi, les images à transmettre sont à deux niveaux de gris, noir et blanc, donc la taille diminue. Un second objectif de ce module est de simplifier l’image pour le médecin tout en conservant toutes les caractéristiques morphologiques de la lésion. Pour cela, nous pouvons procéder de deux manières, soit extraire les limites des lésions, soit extraire toute la zone correspondant à la surface des lésions. Nous utilisons des opérateurs basés sur la théorie de le morphologie mathématique, des résultats prometteurs ont été obtenus, ce qui permettra au médecin d’entamer sûrement l’étape de diagnostic en local ou à distance. Dans ce papier nous présentons principalement notre système de télédiagnostic ainsi les différents algorithmes pour la conception de ce module de segmentation.
- ItemGenetic algorithms and multifractal segmentation of cervical cell images(IEEE, 2003-07) Lassouaoui, Nadia; Hamami, LatifaThis paper deals with the segmentation problem of cervical cell images. Knowing that the malignity criteria appear on the morphology of the core and the cytoplasm of each cell, then, the goal of this segmentation is to separate each cell on its component, that permits to analyze separately their morphology (size and shape) in the recognition step, for deducing decision about the malignity of each cell. For that, we use a multifractal algorithm based on the computation of the singularity exponent on each point of the image. For increasing the quality of the segmentation, we propose to add an optimization step based on genetic algorithms. The proposed processing has been tested on several images. Herein, we present some results obtained by two cervical cell images.
- ItemH.264/AVC Data Hiding Algorithm with a Limitation of the Drift Distortion(2012-10-21) Bouchama, Samira; Hamami, Latifa; Aliane, HassinaMany data hiding algorithms have been proposed for the latest video codec H.264/AVC, most of them are based on the 4x4 luma DCT coefficients. However, the drift distortion is the main reason which limits the embedding capacity in data hiding algorithms based on DCT coefficients. Few methods have been proposed to compensate or eliminate the error propagation. Though, they are either non-blind, only detectable or need prior knowledge of the encoded blocks and thus cannot be used for real time broadcasting. In this paper we show that it is possible to reduce considerably the error propagation for real time applications. The proposed algorithm exploits the method of watermarking paired-coefficients in each block in order to bring the error to the middle of the block matrix. We evaluate the distortion caused by each paired-coefficients in order to give a watermarking priority to the pairs which introduce the minimum error. The proposed scheme offers a very good compromise between the video distortion, the increase in bitrate and the embedding capacity
- ItemH.264/AVC Data Hiding Algorithm with a Limitation of the Drift Distortion(CERIST, 2012) Bouchama, Samira; Hamami, Latifa; Aliane, HassinaMany data hiding algorithms have been proposed for the latest video codec H.264/AVC, most of them are based on the 4x4 luma DCT coefficients. However, the drift distortion is the main reason which limits the embedding capacity in data hiding algorithms based on DCT coefficients. Few methods have been proposed to compensate or eliminate the error propagation. Though, they are either non-blind, only detectable or need prior knowledge of the encoded blocks and thus cannot be used for real time broadcasting. In this paper we show that it is possible to reduce considerably the error propagation for real time applications. The proposed algorithm exploits the method of watermarking paired-coefficients in each block in order to bring the error to the middle of the block matrix. We evaluate the distortion caused by each paired-coefficients in order to give a watermarking priority to the pairs which introduce the minimum error. The proposed scheme offers a very good compromise between the video distortion, the increase in bitrate and the embedding capacity.
- ItemH.264/AVC data hiding based on Intra prediction modes for real time applications(CERIST, 2012) Bouchama, Samira; Hamami, Latifa; Aliane, HassinaA compromise is usually made between the different constraints of video data hiding methods, which seems more difficult to achieve for real time applications. In this paper, a new data hiding approach is presented for the video codec H.264/AVC. This method uses the intra prediction modes for the 4x4 luminance blocks. The objective is to ensure a high data embedding capacity and to preserve the encoding and the decoding times in order to satisfy real-time applications. The data embedding is based on changing a mode to the one of the closest direction. Good results have been obtained in terms of increasing the embedding capacity, maintaining the visual quality and limiting the additional processing time.
- ItemH.264/AVC Data Hiding Based on Intra Prediction Modes for Real-time Applications(2012-10-24) Bouchama, Samira; Hamami, Latifa; Aliane, HassinaThe existing data hiding methods for the newest video codec H.264/AVC exploit its several modules such as the discrete cosine transform coefficients or the prediction modes. In this paper, a new data hiding approach is presented by exploiting the intra prediction modes for the 4x4 luminance blocks. The objective is to ensure a relatively high embedding capacity and to preserve the encoding and the decoding times in order to satisfy real-time applications. The intra prediction modes are divided into four groups composed of modes of close prediction directions. The data embedding is based on modifying modes of the same group in order to maintain visual quality and limit the number of additional calculation procedures. The increase of embedding capacity relies on the group composed on four modes since it allows the embedding of two bits per mode.
- ItemIncrease of embedding capacity of the H.264/AVC data hiding based on the intra-prediction modes(CERIST, 2011-09) Bouchama, Samira; Hamami, Latifa; Aliane, HassinaData hiding methods applied to the newest video codec H.264/AVC are exploiting several modules of this codec such as the discrete cosine transform (DCT) coefficients and the intra prediction modes. The objective is to realize a good compromise between the embedding capacity, the increase in bitrate and the video quality, to satisfy several applications such as authentication or covert communication. In this paper we present a new approach to exploit the intra prediction modes for data hiding of the 4x4 luminance blocks. The objective is to ensure a good data embedding capacity and to preserve the encoding and the decoding times to satisfy reel time applications. The proposed method is based on dividing the intra prediction modes into four groups. Each group in composed of modes that have close prediction directions. Embedding the secret data is based on applying modification between modes of the same group in order to maintain visual quality and limit the number of additional calculation procedures. The increase of embedding capacity relies on the group composed on four modes since it allows the embedding of two bits per mode instead of one.
- ItemMorphological geodesic reconstruction in the extraction of the lesions in brain images(Université Aboubekr Belkaïd –Tlemcen, 2003-09) Lassouaoui, Nadia; Hamami, LatifaIn this paper, we present algorithms that permit to extract the lesions in brain images. The goal is to extract the abnormal zones with respect of theirs morphological haracteristics as: size, shape and position. Then, we present to the doctor a simple image of abnormal zone that is easy to analysis and correct to diagnosis. For it, we used an algorithm of edge detection based on morphological gradient for delimit this areas; moreover, we have used algorithm based on complex operator knowing by morphological geodesic reconstruction, it permits to extract the areas where the lesions exist. These algorithms are based on mathematical morphology operators. The results obtained are satisfactory; the edge detection respects the characteristics and the morphology of the sick part of the brain, whereas with the algorithm of segmentation in homogeneous areas, we could make the extraction of the sick part of the brain, with the respect of all characteristics in a reasonable time allowing to think of real-time operation.
- ItemReversible data hiding scheme for the H.264/AVC codec(2013-06-24) Bouchama, Samira; Hamami, Latifa; Aliane, HassinaVery few reversible data hiding methods are proposed for compressed video and particularly for the H.264/AVC video codec, despite the importance of both of the watermarking reversibility criterion and the codec. The reversible watermarking techniques of images, when applied to the compressed video, can affect particularly the video quality and bitrate. Thus, to make these techniques applicable, the embedding capacity is usually reduced. Therefore an adaptation is necessary to improve the tradeoff between the embedding capacity, the visual quality and the bitrate of the watermarked video. In this paper, we investigate the possibility to introduce the DCT based reversible data hiding method, proposed initially for compressed images, to H.264/AVC codec. The embedding is applied during the encoding process, in the quantized DCT coefficients of I and P frames. To enhance the embedding capacity a mapping rule is used to embed three bits in one coefficient. Results show that exploiting the P frames improves considerably the video quality and the embedding capacity.
- ItemReversible data hiding scheme for the H.264/AVC codec(CERIST, 2013) Bouchama, Samira; Hamami, Latifa; Aliane, HassinaVery few reversible data hiding methods are proposed for compressed video and particularly for the H.264 video codec despite the importance of both of the watermarking reversibility criterion and the codec. The reversible watermarking techniques of images, when applied to the compressed video, can affect particularly the video quality and bitrate. Thus, to make these techniques applicable, the embedding capacity is usually reduced. Therefore an adaptation is necessary to improve the tradeoff between the embedding capacity, the visual quality and the bitrate of the watermarked video. In this paper, we investigate the possibility to introduce the DCT based reversible data hiding method, proposed initially for compressed images, to H.264/AVC codec. The embedding is applied during the encoding process, in the quantized DCT coefficients in I and P frames. To enhance the embedding capacity a mapping rule is used to embed three bits in one coefficient. Results show that exploiting the P frames improves considerably the video quality and the embedding capacity.
- ItemLe tatouage des images pour l'intégrité et la confidentialité des données médicales(2008-04-21) Bouchama, Samira; Hamami, LatifaDans cet article, nous présentons une méthode de tatouage appliquée au domaine de l’imagerie médicale que nous essayons d’adapter à la télémédecine. Cette méthode vise à insérer dans l’image médicale des informations de manière imperceptible dans le but de vérifier son intégrité et préserver la confidentialité des données du patient lors d’un partage en réseau. Cette méthode est basée sur l’utilisation des LSBs (les bits les moins significatifs) de l’image ainsi que des outils empruntés de la cryptographie.
- ItemLes techniques de tatouage appliquées à l’imagerie médicale(2008) Bouchama, Samira; Hamami, LatifaLes techniques de tatouage offrent une solution pour renforcer la sécurité des images médicales dans le cadre des applications de gestion des données médicales (HIS : Hospital Information System) et des applications de télémédecine. Dans ce travail nous présentons l’intérêt du tatouage pour l’imagerie médicale. Nous étudions et implémentons deux méthodes : La première a pour objectif de contrôler l’authenticité de l’image, quant à la deuxième, elle permet de vérifier son intégrité et préserver les données du patient. Ces méthodes sont testées sur trois types d’images médicales.
- ItemWatermarking of compressed video based on DCT coefficients and watermark preprocessing(CERIST, 2010-12) Bouchama, Samira; Hamami, Latifa; Aliane, HassinaConsidering the importance of watermarking of compressed video, several watermarking methods have been proposed for authentication, copyrights protection or simply for a secure data carrying through the Internet. Applied to the H.264/AVC video standard, in most of cases, these methods are based on the use of the quantized DCT coefficients often experimentally or randomly selected. In this paper, we introduce a watermarking method based on the DCT coefficients using two steps: the first one consists in a watermark pre-processing based on similarity measurement which can allow to adapt the best the watermark to the carrying coefficients of low frequencies. A second step takes advantage from the coefficients of high frequencies in order to maintain the video quality and reduce the bitrate. Results show that it is possible to achieve a very good compromise between video quality, embedding capacity and bitrate.
- ItemWatermarking of Compressed Video based on DCT Coefficients and Watermark Preprocessing(2011-03-05) Bouchama, Samira; Hamami, Latifa; Aliane, HassinaConsidering the importance of watermarking of compressed video, several watermarking methods have been proposed for authentication, copyrights protection or simply for a secure data carrying through the Internet. Applied to the H.264/AVC video standard, in most of cases, these methods are based on the use of the quantized DCT coefficients often experimentally or randomly selected. In this paper, we introduce a watermarking method based on the DCT coefficients using two steps: the first one consists in a watermark pre-processing based on similarity measurement which can allow to adapt the best the watermark to the carrying coefficients of low frequencies. A second step takes advantage from the coefficients of high frequencies in order to maintain the video quality and reduce the bitrate. Results show that it is possible to achieve a very good compromise between video quality, embedding capacity and bitrate.