Fragile Watermarking based on Linear Cellular Automata using Manhattan Distances for 2D Vector Map
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2019, Vol 10, Issue 6
Abstract
There has been a growing demand for publishing maps in secure digital format, since this ensures the integrity of data. This had lead us to put forward a method of detecting and locating modification data that is extremely accurate and simultaneously guarantees that the exact original content is recovered. More precisely, this method relies on a fragile watermarking algorithm that is developed in accordance with a frequency manner and, for every spatial feature, it can embed hidden data in 2D vector maps. The current paper proposes a frequency data-hiding scheme, which will be examined in accordance with Linear Cellular Automata Transform using Manhattan distances. Various invertible integer mappings are applied in order to find out the Manhattan distances from coordinates. To begin with, the original map is transformed into LCA, after which the watermark insertion process is carried out to transform the coefficient of the transformation result frequency into LSB. Lastly, a watermarked map is created by applying the inverse LCA transform, meaning that a LCA-transformed map is produced. Findings indicate that the suggested method is effective since in terms of invisibility and the capacity to allow for modifications. The methods also allow the detection of modification data, the addition and removal of some features, and enable the exact original content from the 2D vector map to be included.
Authors and Affiliations
Saleh AL-ardhi, Vijey Thayananthan, Abdullah Basuhail
Keywords
Related Articles
- EP ID EP596825
- DOI 10.14569/IJACSA.2019.0100651
- Views 90
- Downloads 0
Accuracy Performance Degradation in Image Classification Models due to Concept Drift
Big data is playing a significant role in the current computing revolution. Industries and organizations are utilizing their insights for Business Intelligence by using Deep Learning Networks (DLN). However, dynamic char...
Survey of Nearest Neighbor Condensing Techniques
The nearest neighbor rule identifies the category of an unknown element according to its known nearest neighbors’ categories. This technique is efficient in many fields as event recognition, text categorization and objec...
Dependency Test: Portraying Pearson's Correlation Coefficient Targeting Activities in Project Scheduling
In this paper, we discuss project scheduling with conflicting activity-resources. Several project activities require same resources but, may be scheduled with the certain lapse of time resulting in repeatedly using the s...
Data Center Governance Information Security Compliance Assessment Based on the Cobit Framewok
One of control domain of Cobit describes information security lies in Deliver and Support (DS) on DS5 Ensure Systems Security. This domain describes what things should be done by an organization to preserve and maintain...
Tracking Items Through Rfid and Solving Heterogeneity Problems During a Collaboration Between Port Companies
In this article, we are proposing an architecture that enables improvements in various steps of the collaboration process between different port companies, based on the use of ontologies, multi-agent systems and RFIDs. T...