100 research outputs found
Steganalysis of 3D objects using statistics of local feature sets
3D steganalysis aims to identify subtle invisible changes produced in graphical objects through digital watermarking or steganography. Sets of statistical representations of 3D features, extracted from both cover and stego 3D mesh objects, are used as inputs into machine learning classifiers in order to decide whether any information was hidden in the given graphical object. The features proposed in this paper include those representing the local object curvature, vertex normals, the local geometry representation in the spherical coordinate system. The effectiveness of these features is tested in various combinations with other features used for 3D steganalysis. The relevance of each feature for 3D steganalysis is assessed using the Pearson correlation coefficient. Six different 3D watermarking and steganographic methods are used for creating the stego-objects used in the evaluation study
Euclidean Distance Distortion Based Robust and Blind Mesh Watermarking
The three-dimensional (3D) polygonal meshes are recently widely used in several domains, which necessitate the realistic visualization of the objects. Moreover, there is an urgent need to protect the 3D data properties for preventing unauthorized reproduction. The 3D digital watermarking technology is one of the best solutions to protect data from piracy during transmission through the internet. The current work proposed a novel robust watermarking scheme of polygonal meshes for copyright protection purposes. The proposed algorithm is based on the characteristics of the mesh geometry to embed a sequence of data bits into the object by slightly adjusting the vertex positions. Furthermore, the proposed method used a blind detection scheme. The watermarked model is perceptually indistinguishable from the original one and the embedded watermark is invariant to affine transformation. Through simulations, the quality of the watermarked object as well as the inserted watermark robustness against various types of attacks were tested and evaluated to prove the validity and the efficiency of our algorithm
An interactive analysis of harmonic and diffusion equations on discrete 3D shapes
AbstractRecent results in geometry processing have shown that shape segmentation, comparison, and analysis can be successfully addressed through the spectral properties of the Laplace–Beltrami operator, which is involved in the harmonic equation, the Laplacian eigenproblem, the heat diffusion equation, and the definition of spectral distances, such as the bi-harmonic, commute time, and diffusion distances. In this paper, we study the discretization and the main properties of the solutions to these equations on 3D surfaces and their applications to shape analysis. Among the main factors that influence their computation, as well as the corresponding distances, we focus our attention on the choice of different Laplacian matrices, initial boundary conditions, and input shapes. These degrees of freedom motivate our choice to address this study through the executable paper, which allows the user to perform a large set of experiments and select his/her own parameters. Finally, we represent these distances in a unified way and provide a simple procedure to generate new distances on 3D shapes
Steganalysis of meshes based on 3D wavelet multiresolution analysis
3D steganalysis aims to find the information hidden in 3D models and graphical objects. It is assumed that the information was hidden by 3D steganography or watermarking algorithms. A new set of 3D steganalysis features, derived by using multiresolution 3D wavelet analysis, is proposed in this research study. 3D wavelets relate a given mesh representation with its lower and higher graph resolutions by means of a set of Wavelet Coefficient Vectors (WCVs). The 3D steganalysis features are derived from transformations between a given mesh and its corresponding higher and lower resolutions. They correspond to geometric measures such as ratios and angles between various geometric measures. These features are shown to significantly increase the steganalysis accuracy when detecting watermarks which have been embedded by 3D wavelet-based watermarking algorithms. The proposed features, when used in combination with a previously proposed feature set, is shown to provide the best results in detecting the hidden information embedded by other information hiding algorithms
Robust feature-based 3D mesh segmentation and visual mask with application to QIM 3D watermarking
The last decade has seen the emergence of 3D meshes in industrial, medical and entertainment applications. Many researches, from both the academic and the industrial sectors, have become aware of their intellectual property protection arising with their increasing use. The context of this master thesis is related to the digital rights management (DRM) issues and more particularly to 3D digital watermarking which is a technical tool that by means of hiding secret information can offer copyright protection, content authentication, content tracking (fingerprinting), steganography (secret communication inside another media), content enrichment etc. Up to now, 3D watermarking non-blind schemes have reached good levels in terms of robustness against a large set of attacks which 3D models can undergo (such as noise addition, decimation, reordering, remeshing, etc.). Unfortunately, so far blind 3D watermarking schemes do not present a good resistance to de-synchronization attacks (such as cropping or resampling). This work focuses on improving the Spread Transform Dither Modulation (STDM) application on 3D watermarking, which is an extension of the Quantization Index Modulation (QIM), through both the use of the perceptual model presented, which presents good robustness against noising and smoothing attacks, and the the application of an algorithm which provides robustness noising and smoothing attacks, and the the application of an algorithm which provides robustness against reordering and cropping attacks based on robust feature detection. Similar to other watermarking techniques, imperceptibility constraint is very important for 3D objects watermarking. For this reason, this thesis also explores the perception of the distortions related to the watermark embed process as well as to the alterations produced by the attacks that a mesh can undergo
Data Management Challenges for Internet-scale 3D Search Engines
This paper describes the most significant data-related challenges involved in
building internet-scale 3D search engines. The discussion centers on the most
pressing data management issues in this domain, including model acquisition,
support for multiple file formats, asset versioning, data integrity errors, the
data lifecycle, intellectual property, and the legality of web crawling. The
paper also discusses numerous issues that fall under the rubric of trustworthy
computing, including privacy, security, inappropriate content, and
copying/remixing of assets. The goal of the paper is to provide an overview of
these general issues, illustrated by empirical data drawn from the internet's
largest operational search engine. While numerous works have been published on
3D information retrieval, this paper is the first to discuss the real-world
challenges that arise in building practical search engines at scale.Comment: Second version, distributed by SIGIR Foru
Spectral methods for multimodal data analysis
Spectral methods have proven themselves as an important and versatile tool in a wide range of problems in the fields of computer graphics, machine learning, pattern recognition, and computer vision, where many important problems boil down to constructing a Laplacian operator and finding a few of its eigenvalues and eigenfunctions. Classical examples include the computation of diffusion distances on manifolds in computer graphics, Laplacian eigenmaps, and spectral clustering in machine learning. In many cases, one has to deal with multiple data spaces simultaneously. For example, clustering multimedia data in machine learning applications involves various modalities or ``views'' (e.g., text and images), and finding correspondence between shapes in computer graphics problems is an operation performed between two or more modalities. In this thesis, we develop a generalization of spectral methods to deal with multiple data spaces and apply them to problems from the domains of computer graphics, machine learning, and image processing. Our main construction is based on simultaneous diagonalization of Laplacian operators. We present an efficient numerical technique for computing joint approximate eigenvectors of two or more Laplacians in challenging noisy scenarios, which also appears to be the first general non-smooth manifold optimization method. Finally, we use the relation between joint approximate diagonalizability and approximate commutativity of operators to define a structural similarity measure for images. We use this measure to perform structure-preserving color manipulations of a given image
Exploiting Spatio-Temporal Coherence for Video Object Detection in Robotics
This paper proposes a method to enhance video object detection for indoor environments in robotics. Concretely, it exploits knowledge about the camera motion between frames to propagate previously detected objects to successive frames. The proposal is rooted in the concepts of planar homography to propose regions of interest where to find objects, and recursive Bayesian filtering to integrate observations over time. The proposal is evaluated on six virtual, indoor environments, accounting for the detection of nine object classes over a total of ∼ 7k frames. Results show that our proposal improves the recall and the F1-score by a factor of 1.41 and 1.27, respectively, as well as it achieves a significant reduction of the object categorization entropy (58.8%) when compared to a two-stage video object detection method used as baseline, at the cost of small time overheads (120 ms) and precision loss (0.92).</p
Visual attention models and applications to 3D computer graphics
Ankara : The Department of Computer Engineering and the Graduate School of Engineering and Science of Bilkent University, 2012.Thesis (Ph. D.) -- Bilkent University, 2012.Includes bibliographical refences.3D computer graphics, with the increasing technological and computational
opportunities, have advanced to very high levels that it is possible to generate very
realistic computer-generated scenes in real-time for games and other interactive
environments. However, we cannot claim that computer graphics research has
reached to its limits. Rendering photo-realistic scenes still cannot be achieved in
real-time; and improving visual quality and decreasing computational costs are
still research areas of great interest.
Recent e orts in computer graphics have been directed towards exploiting
principles of human visual perception to increase visual quality of rendering.
This is natural since in computer graphics, the main source of evaluation is the
judgment of people, which is based on their perception. In this thesis, our aim is
to extend the use of perceptual principles in computer graphics. Our contribution
is two-fold: First, we present several models to determine the visually important,
salient, regions in a 3D scene. Secondly, we contribute to use of de nition of
saliency metrics in computer graphics.
Human visual attention is composed of two components, the rst component
is the stimuli-oriented, bottom-up, visual attention; and the second component
is task-oriented, top-down visual attention. The main di erence between these
components is the role of the user. In the top-down component, viewer's intention
and task a ect perception of the visual scene as opposed to the bottom-up component.
We mostly investigate the bottom-up component where saliency resides.
We de ne saliency computation metrics for two types of graphical contents.
Our rst metric is applicable to 3D mesh models that are possibly animating, and
it extracts saliency values for each vertex of the mesh models. The second metric we propose is applicable to animating objects and nds visually important objects
due to their motion behaviours. In a third model, we present how to adapt the
second metric for the animated 3D meshes.
Along with the metrics of saliency, we also present possible application areas
and a perceptual method to accelerate stereoscopic rendering, which is based on
binocular vision principles and makes use of saliency information in a stereoscopic
rendering scene.
Each of the proposed models are evaluated with formal experiments. The
proposed saliency metrics are evaluated via eye-tracker based experiments and
the computationally salient regions are found to attract more attention in practice
too. For the stereoscopic optimization part, we have performed a detailed
experiment and veri ed our model of optimization.
In conclusion, this thesis extends the use of human visual system principles
in 3D computer graphics, especially in terms of saliency.Bülbül, Muhammed AbdullahPh.D
Visually Adversarial Attacks and Defenses in the Physical World: A Survey
Although Deep Neural Networks (DNNs) have been widely applied in various
real-world scenarios, they are vulnerable to adversarial examples. The current
adversarial attacks in computer vision can be divided into digital attacks and
physical attacks according to their different attack forms. Compared with
digital attacks, which generate perturbations in the digital pixels, physical
attacks are more practical in the real world. Owing to the serious security
problem caused by physically adversarial examples, many works have been
proposed to evaluate the physically adversarial robustness of DNNs in the past
years. In this paper, we summarize a survey versus the current physically
adversarial attacks and physically adversarial defenses in computer vision. To
establish a taxonomy, we organize the current physical attacks from attack
tasks, attack forms, and attack methods, respectively. Thus, readers can have a
systematic knowledge of this topic from different aspects. For the physical
defenses, we establish the taxonomy from pre-processing, in-processing, and
post-processing for the DNN models to achieve full coverage of the adversarial
defenses. Based on the above survey, we finally discuss the challenges of this
research field and further outlook on the future direction
- …