scholarly journals Fragile Watermarking of 3D Models in a Transformed Domain

2020 ◽  
Vol 10 (9) ◽  
pp. 3244
Author(s):  
Marco Botta ◽  
Davide Cavagnino ◽  
Marco Gribaudo ◽  
Pietro Piazzolla
Keyword(s):  
Vector Space ◽  
3D Models ◽  
Small Error ◽  
Fragile Watermarking ◽  
Experimental Results ◽  
Integrity Protection ◽  
Karhunen Loeve Transform

This paper presents an algorithm aimed at the integrity protection of 3D models represented as a set of vertices and polygons. The proposed method defines a procedure to perform a fragile watermarking of the vertices’ data, namely 3D coordinates and polygons, introducing a very small error in the vertices’ coordinates. The watermark bit string is embedded into a secret vector space defined by the Karhunen–Loève transform derived from a key image. Experimental results show the good performance of the method and its security.

scholarly journals The Performance of Boolean Retrieval and Vector Space Model in Textual Information Retrieval

2017 ◽  
Vol 11 (1) ◽  
pp. 33 ◽  
Author(s):  
Budi Yulianto ◽  
Widodo Budiharto ◽  
Iman Herwidiana Kartowisastro
Keyword(s):  
Information Retrieval ◽  
Vector Space ◽  
Vector Space Model ◽  
Experimental Results ◽  
Inverted Index ◽  
Exact Results ◽  
Textual Information ◽  
Space Model ◽  
Corpus Data

Boolean Retrieval (BR) and Vector Space Model (VSM) are very popular methods in information retrieval for creating an inverted index and querying terms. BR method searches the exact results of the textual information retrieval without ranking the results. VSM method searches and ranks the results. This study empirically compares the two methods. The research utilizes a sample of the corpus data obtained from Reuters. The experimental results show that the required times to produce an inverted index by the two methods are nearly the same. However, a difference exists on the querying index. The results also show that the numberof generated indexes, the sizes of the generated files, and the duration of reading and searching an index are proportional with the file number in the corpus and thefile size.

Design and Implementation of Chinese Information Filtering System

2013 ◽  
Vol 756-759 ◽  
pp. 1164-1167
Author(s):  
Xiu Mei Zhang
Keyword(s):  
Information Processing ◽  
Vector Space ◽  
Information Filtering ◽  
Experimental Results ◽  
Important Research ◽  
Index Method ◽  
Network Information ◽  
Design And Implementation ◽  
Tree Index ◽  
Space Method

With the development of the network information, information processing is vital in all aspects. Information filtering is more important research aspect. Especially Chinese information filtering is urgent affairs. According to research of the domestic and abroad, in the article vector space method and hyB+ tree index method is combined to filter text. Experimental results show that, this method is feasible.

A blind fragile watermarking method for 3D models based on geometric properties of triangles

3D Research ◽  
2013 ◽  
Vol 4 (4) ◽  
Author(s):  
Amir Masoud Molaei ◽  
Hossein Ebrahimnezhad ◽  
Mohammad Hossein Sedaaghi
Keyword(s):  
3D Models ◽  
Fragile Watermarking ◽  
Geometric Properties

Semi-Fragile Image Watermarking, Authentication and Localization Techniques for Law Enforcement Applications

2010 ◽  
pp. 176-203 ◽  
Author(s):  
Xi Zhao ◽  
Anthony T.S. Ho
Keyword(s):  
Law Enforcement ◽  
Gaussian Noise ◽  
Image Watermarking ◽  
Standard Test ◽  
Fragile Watermarking ◽  
Experimental Results ◽  
Traffic Violations ◽  
Block Based ◽  
Copy And Paste ◽  
Contrast Stretching

With the tremendous growth and use of digital cameras and video devices, the need to verify the collected digital content for law enforcement applications such as crime scene investigations and traffic violations, becomes paramount if they are to be used as evidence in courts. Semi-fragile watermarking has become increasingly important within the past few years as it can be used to verify the content of images by accurately localising the tampered area and tolerating some non-malicious manipulations. There have been a number of different transforms used for semi-fragile image watermarking. In this chapter, we present two novel transforms for semi-fragile watermarking, using the Slant transform (SLT) as a block-based algorithm and the wavelet-based contourlet transform (WBCT) as a non-block based algorithm. The proposed SLT is compared with existing DCT and PST semi-fragile watermarking schemes. Experimental results using standard test images and simulated law enforcement images indicate that the SLT is more accurate for copy and paste attacks with non-malicious manipulations, such as additive Gaussian noise. For the proposed WBCT method, watermarking embedding is performed by modulating the parent-children relationship in the contourlet domain. Again, experimental results using the same test images have demonstrated that our proposed WBCT method achieves good performances in localising the tampered regions, even when the image has been subjected to non-malicious manipulations such as JPEG/JPEG2000 compressions, Gaussian noise, Gaussian filtering, and contrast stretching. The average miss detection rate is found to be approximately 1% while maintaining an average false alarm rate below 6.5%.

A multi-grained aspect vector learning model for unsupervised aspect identification

2021 ◽  
pp. 1-11
Author(s):  
Jinglei Shi ◽  
Junjun Guo ◽  
Zhengtao Yu ◽  
Yan Xiang
Keyword(s):  
Vector Space ◽  
Sentiment Analysis ◽  
Membership Function ◽  
Topic Models ◽  
Experimental Results ◽  
Coarse Grained ◽  
Product Reviews ◽  
Fine Grained ◽  
Proposed Model ◽  
Identification Model

Unsupervised aspect identification is a challenging task in aspect-based sentiment analysis. Traditional topic models are usually used for this task, but they are not appropriate for short texts such as product reviews. In this work, we propose an aspect identification model based on aspect vector reconstruction. A key of our model is that we make connections between sentence vectors and multi-grained aspect vectors using fuzzy k-means membership function. Furthermore, to make full use of different aspect representations in vector space, we reconstruct sentence vectors based on coarse-grained aspect vectors and fine-grained aspect vectors simultaneously. The resulting model can therefore learn better aspect representations. Experimental results on two datasets from different domains show that our proposed model can outperform a few baselines in terms of aspect identification and topic coherence of the extracted aspect terms.

scholarly journals The Automated VSMs to Categorize Arabic Text Data Sets

2014 ◽  
Vol 13 (1) ◽  
pp. 4074-4081
Author(s):  
Mamoun Suleiman Al Rababaa ◽  
Essam Said Hanandeh
Keyword(s):  
Data Mining ◽  
Information Retrieval ◽  
Vector Space ◽  
Text Categorization ◽  
Experimental Results ◽  
Data Sets ◽  
Arabic Text ◽  
Text Data ◽  
Evaluation Measures ◽  
Vector Space Models

Text Categorization is one of the most important tasks in information retrieval and data mining. This paper aims at investigating different variations of vector space models (VSMs) using KNN algorithm. we used 242 Arabic abstract documents that were used by (Hmeidi & Kanaan, 1997). The bases of our comparison are the most popular text evaluation measures; we use Recall measure, Precision measure, and F1 measure. The Experimental results against the Saudi data sets reveal that Cosine outperformed over of the Dice and Jaccard coefficients.

scholarly journals 3D Polygon Mesh Encryption Based on 3D Lorenz Chaotic Map

2021 ◽  
Vol 15 (15) ◽  
pp. 103
Author(s):  
Nashwan Alsalam Ali ◽  
Abdul Monem S. Rahma ◽  
Shaimaa H. Shaker
Keyword(s):  
Hausdorff Distance ◽  
3D Model ◽  
Chaotic Map ◽  
3D Models ◽  
Experimental Results ◽  
The Internet ◽  
Mesh Model ◽  
Polygon Mesh ◽  
Matching Degree ◽  
Excellent Property

<p class="0abstract">The multimedia application developments in recent years lead to the widespread of 3D model applications. It becomes more popular in various fields as well as exchanging it over the internet. The security of the 3D models is a very important issue now a day, so the scheme for encrypting the 3D model will be proposed in this work. In this proposed scheme, the 3D polygon mesh model will be protected through the encrypting process based on a 3D Lorenz Chaotic map where the vertices value of the 3D polygon mesh model will be modified using 3D keys generated by 3D Lorenz Chaotic Map, which has excellent property and provides a good diffusion. The proposed scheme was implemented on various 3D models, which have a different number of vertices and faces. The experimental results show that the proposed scheme has good encryption results, which were noted through completely deforming and changing the whole shape of the 3D models. The Hausdorff Distance (HD) and histogram metrics are adopted to calculate the matching degree between the original and extracted model. The results show that the original and extracted model are identical through the values of HD, where they are approximately zero, and the histogram visually is identical.    </p>

Block-based Reversible Fragile Watermarking for 2D Vector Map Authentication

2015 ◽  
Vol 7 (3) ◽  
pp. 60-80 ◽  
Author(s):  
Nana Wang ◽  
Xiangjun Zhao ◽  
Han Zhang
Keyword(s):  
Computational Complexity ◽  
Reversible Watermarking ◽  
Fragile Watermarking ◽  
Experimental Results ◽  
Malicious Attacks ◽  
Tamper Localization ◽  
Vector Map ◽  
Concentric Circles ◽  
Block Based ◽  
2D Vector Map

In this paper, the authors propose a block-based reversible watermarking method for 2D vector map authentication. In the scheme, they divide the features of a vector map into different categories of blocks, calculate an authentication watermark for each block, and embed the watermarks of different blocks using a reversible watermarking method based on virtual coordinates and a fragile watermarking algorithm based on concentric circles. While the block division ensures superior accuracy of tamper localization, the two watermarking methods provide recovery of the original content. Experimental results show that the proposed scheme has good invisibility, reversibility and computational complexity, and can accurately locate malicious attacks such as vertex modification/addition/deletion and feature modification/addition/deletion.

Sign in / Sign up

Export Citation Format

Share Document