title: Combining Haar Wavelet and Karhunen Loeve Transforms for medical images watermarking.
abstract: This paper presents a novel watermarking method, applied to the medical imaging domain, used to embed the patient's data into the corresponding image or set of images used for the diagnosis. The main objective behind the proposed technique is to perform the watermarking of the medical images in such a way that the three main attributes of the hidden information (i.e., imperceptibility, robustness, and integration rate) can be jointly ameliorated as much as possible. These attributes determine the effectiveness of the watermark, resistance to external attacks, and increase the integration rate. In order to improve the robustness, a combination of the characteristics of Discrete Wavelet and Karhunen Loeve Transforms is proposed. The Karhunen Loeve Transform is applied on the subblocks (sized 8 × 8) of the different wavelet coefficients (in the HL2, LH2, and HH2 subbands). In this manner, the watermark will be adapted according to the energy values of each of the Karhunen Loeve components, with the aim of ensuring a better watermark extraction under various types of attacks. For the correct identification of inserted data, the use of an Errors Correcting Code (ECC) mechanism is required for the check and, if possible, the correction of errors introduced into the inserted data. Concerning the enhancement of the imperceptibility factor, the main goal is to determine the optimal value of the visibility factor, which depends on several parameters of the DWT and the KLT transforms. As a first step, a Fuzzy Inference System (FIS) has been set up and then applied to determine an initial visibility factor value. Several features extracted from the Cooccurrence matrix are used as an input to the FIS and used to determine an initial visibility factor for each block; these values are subsequently reweighted in function of the eigenvalues extracted from each subblock. Regarding the integration rate, the previous works insert one bit per coefficient. In our proposal, the integration of the data to be hidden is 3 bits per coefficient so that we increase the integration rate by a factor of magnitude 3.
authors.affiliation: LE2I Laboratory, Burgundy University, Dijon, France ; Electronics and Microelectronics Laboratory, University of Monastir, Tunisia.
authors.forename: Mohamed Ali
authors.initials: MA
authors.lastname: Hajjaji
authors.affiliation: LE2I Laboratory, Burgundy University, Dijon, France.
authors.forename: El-Bay
authors.initials: el-B
authors.lastname: Bourennane
authors.affiliation: Electronics and Microelectronics Laboratory, University of Monastir, Tunisia.
authors.forename: Abdessalem
authors.initials: A
authors.lastname: Ben Abdelali
authors.affiliation: Electronics and Microelectronics Laboratory, University of Monastir, Tunisia.
authors.forename: Abdellatif
authors.initials: A
authors.lastname: Mtibaa
mesh_terms: D000465:Algorithms; D016494:Computer Security; D003952:Diagnostic Imaging; D015203:Reproducibility of Results; D058067:Wavelet Analysis