63 research outputs found
A Localized Geometric-Distortion Resilient Digital Watermarking Scheme Using Two Kinds of Complementary Feature Points
With the rapid development of digital multimedia and internet techniques in the last few years, more and more digital images are being distributed to an ever-growing number of people for sharing, studying, or other purposes. Sharing images digitally is fast and cost-efficient thus highly desirable. However, most of those digital products are exposed without any protection. Thus, without authorization, such information can be easily transferred, copied, and tampered with by using digital multimedia editing software. Watermarking is a popular resolution to the strong need of copyright protection of digital multimedia. In the image forensics scenario, a digital watermark can be used as a tool to discriminate whether original content is tampered with or not. It is embedded on digital images as an invisible message and is used to demonstrate the proof by the owner. In this thesis, we propose a novel localized geometric-distortion resilient digital watermarking scheme to embed two invisible messages to images. Our proposed scheme utilizes two complementary watermarking techniques, namely, local circular region (LCR)-based techniques and block discrete cosine transform (DCT)-based techniques, to hide two pseudo-random binary sequences in two kinds of regions and extract these two sequences from their individual embedding regions. To this end, we use the histogram and mean statistically independent of the pixel position to embed one watermark in the LCRs, whose centers are the scale invariant feature transform (SIFT) feature points themselves that are robust against various affine transformations and common image processing attacks. This watermarking technique combines the advantages of SIFT feature point extraction, local histogram computing, and blind watermark embedding and extraction in the spatial domain to resist geometric distortions. We also use Watson’s DCT-based visual model to embed the other watermark in several rich textured 80×80 regions not covered by any embedding LCR. This watermarking technique combines the advantages of Harris feature point extraction, triangle tessellation and matching, the human visual system (HVS), the spread spectrum-based blind watermark embedding and extraction. The proposed technique then uses these combined features in a DCT domain to resist common image processing attacks and to reduce the watermark synchronization problem at the same time. These two techniques complement each other and therefore can resist geometric and common image processing attacks robustly. Our proposed watermarking approach is a robust watermarking technique that is capable of resisting geometric attacks, i.e., affine transformation (rotation, scaling, and translation) attacks and other common image processing (e.g., JPEG compression and filtering operations) attacks. It demonstrates more robustness and better performance as compared with some peer systems in the literature
Adaptive colour image watermarking based on uniform perceptual spaces
This paper presents a watermarking scheme that uses uniform color spaces to provide a local and adaptive embedding
space. The CIE-Lab and CIE-XYZ uniform color space and the CIE-94 metric have been used to extract a masking
domain that is adapted to each color pixel value. Calculus of the masking vector ÎĽ1 is given performing a differential
calculus that relies on relations between uniform color spaces and RGB space. The embedding of the watermark is after
achieved by quantization of DCT coefficients and the whole system is evaluated for different constraints such as
invisibility and robustness to JPEG compression, low-pass filtering and valumetric transforms. Finally the presented
scheme is compared with other schemes that uses other color components (Luminance or Blue).Ce papier présente un schéma de tatouage d’images qui utilise des espaces perceptifs uniformes afin de
fournir un espace d’insertion couleur qui soit local et adapté. La démarche adoptée a été d’utiliser les espaces
uniformes CIE-Lab, CIE-XYZ et la métrique d’acceptabilité CIE-94 pour pouvoir extraire un repère de masquage
adapté à la valeur du pixel considéré et des pixels de son voisinage. Le calcul du vecteur de masquage μ1 est
obtenu par calcul différentiel à partir des équations de transformations des espaces uniformes vers l’espace
RVB. L’insertion du tatouage est ensuite effectuée par quantification des coefficients DCT. Le schéma présenté
est finalement évalué en terme d’invisibilité de marquage mais aussi de robustesse par rapport à des
traitements classiques d’image que sont la compression JPEG, le filtrage passe-bas et les transformations
valumétriques. Une comparaison est également effectuée par rapport aux schémas utilisant d’autres
composantes de tatouage (Luminance, composante bleue)
Segmental analysis of the transmission in CSK systems based on the Euclidean distance
Abstract: This article presents a segmental analysis of the transmission in colour shift keying (CSK). The Euclidean distance is fractionally studied to find the distance limits between the observed and the expected points. Practical segmental characterisation of the CSK receiver is presented to verify the Voronoi segmentation over the CSK channel and confirm crosstalk and correlation between the red, green and blue channels based on the threshold selection
On Improving Generalization of CNN-Based Image Classification with Delineation Maps Using the CORF Push-Pull Inhibition Operator
Deployed image classification pipelines are typically dependent on the images captured in real-world environments. This means that images might be affected by different sources of perturbations (e.g. sensor noise in low-light environments). The main challenge arises by the fact that image quality directly impacts the reliability and consistency of classification tasks. This challenge has, hence, attracted wide interest within the computer vision communities. We propose a transformation step that attempts to enhance the generalization ability of CNN models in the presence of unseen noise in the test set. Concretely, the delineation maps of given images are determined using the CORF push-pull inhibition operator. Such an operation transforms an input image into a space that is more robust to noise before being processed by a CNN. We evaluated our approach on the Fashion MNIST data set with an AlexNet model. It turned out that the proposed CORF-augmented pipeline achieved comparable results on noise-free images to those of a conventional AlexNet classification model without CORF delineation maps, but it consistently achieved significantly superior performance on test images perturbed with different levels of Gaussian and uniform noise
Research on digital image watermark encryption based on hyperchaos
The digital watermarking technique embeds meaningful information into one or more watermark images hidden in one image, in which it is known as a secret carrier. It is difficult for a hacker to extract or remove any hidden watermark from an image, and especially to crack so called digital watermark. The combination of digital watermarking technique and traditional image encryption technique is able to greatly improve anti-hacking capability, which suggests it is a good method for keeping the integrity of the original image. The research works contained in this thesis include: (1)A literature review the hyperchaotic watermarking technique is relatively more advantageous, and becomes the main subject in this programme. (2)The theoretical foundation of watermarking technologies, including the human visual system (HVS), the colour space transform, discrete wavelet transform (DWT), the main watermark embedding algorithms, and the mainstream methods for improving watermark robustness and for evaluating watermark embedding performance. (3) The devised hyperchaotic scrambling technique it has been applied to colour image watermark that helps to improve the image encryption and anti-cracking capabilities. The experiments in this research prove the robustness and some other advantages of the invented technique. This thesis focuses on combining the chaotic scrambling and wavelet watermark embedding to achieve a hyperchaotic digital watermark to encrypt digital products, with the human visual system (HVS) and other factors taken into account. This research is of significant importance and has industrial application value
Introduction to Facial Micro Expressions Analysis Using Color and Depth Images: A Matlab Coding Approach (Second Edition, 2023)
The book attempts to introduce a gentle introduction to the field of Facial
Micro Expressions Recognition (FMER) using Color and Depth images, with the aid
of MATLAB programming environment. FMER is a subset of image processing and it
is a multidisciplinary topic to analysis. So, it requires familiarity with
other topics of Artifactual Intelligence (AI) such as machine learning, digital
image processing, psychology and more. So, it is a great opportunity to write a
book which covers all of these topics for beginner to professional readers in
the field of AI and even without having background of AI. Our goal is to
provide a standalone introduction in the field of MFER analysis in the form of
theorical descriptions for readers with no background in image processing with
reproducible Matlab practical examples. Also, we describe any basic definitions
for FMER analysis and MATLAB library which is used in the text, that helps
final reader to apply the experiments in the real-world applications. We
believe that this book is suitable for students, researchers, and professionals
alike, who need to develop practical skills, along with a basic understanding
of the field. We expect that, after reading this book, the reader feels
comfortable with different key stages such as color and depth image processing,
color and depth image representation, classification, machine learning, facial
micro-expressions recognition, feature extraction and dimensionality reduction.
The book attempts to introduce a gentle introduction to the field of Facial
Micro Expressions Recognition (FMER) using Color and Depth images, with the aid
of MATLAB programming environment.Comment: This is the second edition of the boo
High Dynamic Range Visual Content Compression
This thesis addresses the research questions of High Dynamic Range (HDR) visual contents compression. The HDR representations are intended to represent the actual physical value of the light rather than exposed value. The current HDR compression schemes are the extension of legacy Low Dynamic Range (LDR) compressions, by using Tone-Mapping Operators (TMO) to reduce the dynamic range of the HDR contents. However, introducing TMO increases the overall computational complexity, and it causes the temporal artifacts. Furthermore, these compression schemes fail to compress non-salient region differently than the salient region, when Human Visual System (HVS)
perceives them differently. The main contribution of this thesis is to propose a novel Mapping-free visual saliency-guided HDR content compression scheme. Firstly, the relationship of Discrete Wavelet Transform (DWT) lifting steps and TMO are explored. A novel approach to compress HDR image by Joint Photographic Experts Group (JPEG) 2000 codec while backward compatible to LDR is proposed. This approach exploits the reversibility of tone mapping and scalability of DWT. Secondly, the importance of the TMO in the HDR compression is evaluated in this thesis. A mapping-free post HDR image compression based on JPEG and JPEG2000 standard codecs for current HDR image formats is proposed. This approach exploits the structure of HDR formats. It has an equivalent compression performance and the lowest computational complexity compared to the existing HDR lossy compressions (50% lower than the state-of-the-art). Finally, the shortcomings of the current HDR visual saliency models, and HDR visual saliency-guided compression are explored in this thesis. A spatial saliency model for HDR visual content outperform others
by 10% for spatial visual prediction task with 70% lower computational complexity is proposed. Furthermore, the experiment suggested more than 90% temporal saliency is predicted by the proposed spatial model. Moreover, the proposed saliency model can be used to guide the HDR compression by applying different quantization factor according to the intensity of predicted saliency map
- …