24 research outputs found
Multimedia Forensics
This book is open access. Media forensics has never been more relevant to societal life. Not only media content represents an ever-increasing share of the data traveling on the net and the preferred communications means for most users, it has also become integral part of most innovative applications in the digital information ecosystem that serves various sectors of society, from the entertainment, to journalism, to politics. Undoubtedly, the advances in deep learning and computational imaging contributed significantly to this outcome. The underlying technologies that drive this trend, however, also pose a profound challenge in establishing trust in what we see, hear, and read, and make media content the preferred target of malicious attacks. In this new threat landscape powered by innovative imaging technologies and sophisticated tools, based on autoencoders and generative adversarial networks, this book fills an important gap. It presents a comprehensive review of state-of-the-art forensics capabilities that relate to media attribution, integrity and authenticity verification, and counter forensics. Its content is developed to provide practitioners, researchers, photo and video enthusiasts, and students a holistic view of the field
Data Hiding and Its Applications
Data hiding techniques have been widely used to provide copyright protection, data integrity, covert communication, non-repudiation, and authentication, among other applications. In the context of the increased dissemination and distribution of multimedia content over the internet, data hiding methods, such as digital watermarking and steganography, are becoming increasingly relevant in providing multimedia security. The goal of this book is to focus on the improvement of data hiding algorithms and their different applications (both traditional and emerging), bringing together researchers and practitioners from different research fields, including data hiding, signal processing, cryptography, and information theory, among others
Applications of finite reflection groups in Fourier analysis and symmetry breaking of polytopes
Cette thèse présente une étude des applications des groupes de réflexion finis aux problems liés aux réseaux bidimensionnels et aux polytopes tridimensionnels. Plusieurs familles de fonctions orbitales, appelées fonctions orbitales de Weyl, sont associées aux groupes de réflexion cristallographique. Les propriétés exceptionnelles de ces fonctions, telles que l’orthogonalité continue et discrète, permettent une analyse de type Fourier sur le domaine fondamental d’un groupe de Weyl affine correspondant. Dans cette considération, les fonctions d’orbite de Weyl constituent des outils efficaces pour les transformées discrètes de type Fourier correspondantes connues sous le nom de transformées de Fourier–Weyl. Cette recherche limite notre attention aux fonctions d’orbite de Weyl symétriques et antisymétriques à deux variables du groupe de réflexion cristallographique A2. L’objectif principal est de décomposer deux types de transformations de Fourier–Weyl du réseau de poids correspondant en transformées plus petites en utilisant la technique de division centrale. Pour les cas non cristallographiques, nous définissons les indices de degré pair et impair pour les orbites des groupes de réflexion non cristallographique avec une symétrie quintuple en utilisant un remplacement de représentation-orbite. De plus, nous formulons l’algorithme qui permet de déterminer les structures de polytopes imbriquées. Par ailleurs, compte tenu de la pertinence de la symétrie icosaédrique pour la description de diverses molécules sphériques et virus, nous étudions la brisure de symétrie des polytopes doubles de type non cristallographique et des structures tubulaires associées. De plus, nous appliquons une procédure de stellation à la famille des polytopes considérés. Puisque cette recherche se concentre en partie sur les fullerènes icosaédriques, nous présentons la construction des nanotubes de carbone correspondants. De plus, l’approche considérée pour les cas non cristallographiques est appliquée aux structures cristallographiques. Nous considérons un mécanisme de brisure de symétrie appliqué aux polytopes obtenus en utilisant les groupes Weyl tridimensionnels pour déterminer leurs extensions structurelles possibles en nanotubes.This thesis presents a study of applications of finite reflection groups to the problems related to two-dimensional lattices and three-dimensional polytopes. Several families of orbit functions, known as Weyl orbit functions, are associated with the crystallographic reflection groups. The exceptional properties of these functions, such as continuous and discrete orthogonality, permit Fourier-like analysis on the fundamental domain of a corresponding affine Weyl group. In this consideration, Weyl orbit functions constitute efficient tools for corresponding Fourier-like discrete transforms known as Fourier–Weyl transforms. This research restricts our attention to the two-variable symmetric and antisymmetric Weyl orbit functions of the crystallographic reflection group A2. The main goal is to decompose two types of the corresponding weight lattice Fourier–Weyl transforms into smaller transforms using the central splitting technique. For the non-crystallographic cases, we define the even- and odd-degree indices for orbits of the non-crystallographic reflection groups with 5-fold symmetry by using a representation-orbit replacement. Besides, we formulate the algorithm that allows determining the structures of nested polytopes. Moreover, in light of the relevance of the icosahedral symmetry to the description of various spherical molecules and viruses, we study symmetry breaking of the dual polytopes of non-crystallographic type and related tube-like structures. As well, we apply a stellation procedure to the family of considered polytopes. Since this research partly focuses on the icosahedral fullerenes, we present the construction of the corresponding carbon nanotubes. Furthermore, the approach considered for the non-crystallographic cases is applied to crystallographic structures. We consider a symmetry-breaking mechanism applied to the polytopes obtained using the three-dimensional Weyl groups to determine their possible structural extensions into nanotubes
Recent Advances in Signal Processing
The signal processing task is a very critical issue in the majority of new technological inventions and challenges in a variety of applications in both science and engineering fields. Classical signal processing techniques have largely worked with mathematical models that are linear, local, stationary, and Gaussian. They have always favored closed-form tractability over real-world accuracy. These constraints were imposed by the lack of powerful computing tools. During the last few decades, signal processing theories, developments, and applications have matured rapidly and now include tools from many areas of mathematics, computer science, physics, and engineering. This book is targeted primarily toward both students and researchers who want to be exposed to a wide variety of signal processing techniques and algorithms. It includes 27 chapters that can be categorized into five different areas depending on the application at hand. These five categories are ordered to address image processing, speech processing, communication systems, time-series analysis, and educational packages respectively. The book has the advantage of providing a collection of applications that are completely independent and self-contained; thus, the interested reader can choose any chapter and skip to another without losing continuity
Feature Encoding of Spectral Descriptors for 3D Shape Recognition
Feature descriptors have become a ubiquitous tool in shape analysis. Features can be extracted and subsequently used to design discriminative signatures for solving a variety of 3D shape analysis problems. In particular, shape classification and retrieval are intriguing and challenging problems that lie at the crossroads of computer vision, geometry processing, machine learning and medical imaging.
In this thesis, we propose spectral graph wavelet approaches for the classification and retrieval of deformable 3D shapes. First, we review the recent shape descriptors based on the spectral decomposition of the Laplace-Beltrami operator, which provides a rich set of eigenbases that are invariant to intrinsic isometries. We then provide a detailed overview of spectral graph wavelets. In an effort to capture both local and global characteristics of a 3D shape, we propose a three-step feature description framework. Local descriptors are first extracted via the spectral graph wavelet transform having the Mexican hat wavelet as a generating kernel. Then, mid-level features are obtained by embedding local descriptors into the visual vocabulary space using the soft-assignment coding step of the bag-of-features model. A global descriptor is subsequently constructed by aggregating mid-level features weighted by a geodesic exponential kernel, resulting in a matrix representation that describes the frequency of appearance of nearby codewords in the vocabulary. In order to analyze the performance of the proposed algorithms on 3D shape classification, support vector machines and deep belief networks are applied to mid-level features. To assess the performance of the proposed approach for nonrigid 3D shape retrieval, we compare the global descriptor of a query to the global descriptors of the rest of shapes in the dataset using a dissimilarity measure and find the closest shape. Experimental results on three standard 3D shape benchmarks demonstrate the effectiveness of the proposed classification and retrieval approaches in comparison with state-of-the-art methods
Recommended from our members
Camera positioning for 3D panoramic image rendering
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University London.Virtual camera realisation and the proposition of trapezoidal camera architecture are the two broad contributions of this thesis. Firstly, multiple camera and their arrangement constitute a critical component which affect the integrity of visual content acquisition for multi-view video. Currently, linear, convergence, and divergence arrays are the prominent camera topologies adopted. However, the large number of cameras required and their synchronisation are two of prominent challenges usually encountered. The use of virtual cameras can significantly reduce the number of physical cameras used with respect to any of the known
camera structures, hence adequately reducing some of the other implementation issues. This thesis explores to use image-based rendering with and without geometry in the implementations leading to the realisation of virtual cameras. The virtual camera implementation was carried out from the perspective of depth map (geometry) and use of multiple image samples (no geometry). Prior to the virtual camera realisation, the generation of depth map was investigated using region match measures widely known for solving image point correspondence problem. The constructed depth maps have been compare with the ones generated
using the dynamic programming approach. In both the geometry and no geometry approaches, the virtual cameras lead to the rendering of views from a textured depth map, construction of 3D panoramic image of a scene by stitching multiple image samples and performing superposition on them, and computation
of virtual scene from a stereo pair of panoramic images. The quality of these rendered images were assessed through the use of either objective or subjective analysis in Imatest software. Further more, metric reconstruction of a scene was performed by re-projection of the pixel points from multiple image samples with
a single centre of projection. This was done using sparse bundle adjustment algorithm. The statistical summary obtained after the application of this algorithm provides a gauge for the efficiency of the optimisation step. The optimised data was then visualised in Meshlab software environment, hence providing the reconstructed scene. Secondly, with any of the well-established camera arrangements, all cameras are usually constrained to the same horizontal plane. Therefore, occlusion becomes an extremely challenging problem, and a robust camera set-up is required in order to resolve strongly the hidden part of any scene objects.
To adequately meet the visibility condition for scene objects and given that occlusion of the same scene objects can occur, a multi-plane camera structure is highly desirable. Therefore, this thesis also explore trapezoidal camera structure for image acquisition. The approach here is to assess the feasibility and potential
of several physical cameras of the same model being sparsely arranged on the edge of an efficient trapezoid graph. This is implemented both Matlab and Maya. The quality of the depth maps rendered in Matlab are better in Quality