A survey of point pattern matching techniques and a new approach to point pattern recognition

Cox, Greg S.; Jager, G. de

doi:10.1109/comsig.1992.274276

Cited by 33 publications

(22 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[4] first introduced a simple watermarking algorithm for vector maps. [5] implemented a watermarking algorithm according to vertices coordinates and the relationships between vertices, but the algorithm is weak in anti-attacks capability.…”

Section: Introductionmentioning

confidence: 99%

A New Attributes-Priority Matching Watermarking Algorithm Satisfying Topological Conformance for Vector Map

Zhang

Qian

Han³

2007

Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)

View full text Add to dashboard Cite

Vector map is the most important spatial map widely used in GIS, navigation, and network services. Watermarking technology must be developed for vector map to address the copyright issue. In this paper, Vector map Watermarking under Topological Conformance (VWTC for short) for vector maps is proposed. After subdividing vector map into blocks, watermark information is embedded into the coordinates of vertices when ensuring comformance of all topological relationships. Unlike other current algorithms, VWTC compares the watermarked map being examined with the original watermarked map instead of the primitive map. Another specific feature of VWTC is that it uses mean-value comparison in vertices matching and the comparison is guided by the attributes-priority rule to reduce possible matching errors and to increase efficiency at the same time. A series of anti-attacks experiments such as random noise, vertices insertion, layers deletion, and linea transformation are conducted. The experiments results show that VWTC is more robust and achieves higher usability.

show abstract

Section: Introductionmentioning

confidence: 99%

A New Attributes-Priority Matching Watermarking Algorithm Satisfying Topological Conformance for Vector Map

Zhang

Qian

Han³

2007

Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007)

View full text Add to dashboard Cite

show abstract

“…Many scholars have also done a great deal of research and test about it. Cox et al [1] proposed the first vector data watermarking algorithm, which embedded watermark information directly into the vertex coordinates and was a fragile watermarking algorithm not robust to simple attacks. However, it may play a good role in verification of data integrity.…”

mentioning

confidence: 99%

New robust watermarking algorithm for vector data

Zhang

Duan

Jiang

et al. 2010

Wuhan Univ. J. Nat. Sci.

View full text Add to dashboard Cite

Because the existing vector data watermarking algorithm is insufficiently robust for compression and cropping, and has no sufficient control on map deformation, a new watermarking algorithm was proposed in this paper. Its main features are: ① it selected feature points and non-feature points from the sequence of Douglas, and then embedded watermarking points by wavelet transform, which is based on layer segmentation; ② it enhanced the map deformation control design. Furthermore, it increased the map graphic deformation control design. The algorithm was applied to experimental data, and the test results showed that the algorithm had good robustness on graphics geometric transformation, the addition, deletion and cropping of points in graph layers. Also, the graph distortion had been well controlled.In the WebGIS, the vector graphics is the most basic expression form, of which the protection property has become very urgent. Vector digital watermarking is embedded in vector graphics data in the form of perceived or unperceived; it is for the protection of property rights, content inspection or other information extracted signal. It plays an important role in protecting intellectual property rights. Many scholars have also done a great deal of research and test about it. Cox et al [1] proposed the first vector data watermarking algorithm, which embedded watermark information directly into the vertex coordinates and was a fragile watermarking algorithm not robust to simple attacks. However, it may play a good role in verification of data integrity. Jia et al [2] adopted the method based on the relations between the least significant bit (LSB) and the topology of the vector digital map, so that it can take full advantage of the least significant bit, avoiding the vulnerability against attacks. Some researchers [3][4][5][6] proposed a watermarking scheme based on a modified vertex, which was not enough to meet the requirements of the vector map watermarking. It is possible to make an experiment [6] to illustrate the problem. Figure 1(a) is an enlarged part of the original map. Figure 1(b) is its corresponding watermarked part. Here, the raw coordinates were selected as the cover data, and the embedding procedure was not taken into account of the map shape. Although the induced distortion of every vertex in Fig. 1(b) is below the precision tolerance, the local shape of the objects in the map has been modified. The distorted shape degrades the quality of the watermarked map and the invisibility of the hidden watermark.

show abstract

“…This is a rather simple case of so-called affine matching problem (e.g., [6,26]). In our algorithm, a set of corresponding pairs of landmarks are selected in the maps M and M .…”

Section: Pose Normalizationmentioning

confidence: 99%

“…Digital watermarking is a possible approach to counter abuses of digital media data, such as texts, audio data, images, movies, as well as 2D digital maps [16,6,12]. Digital watermarking adds a structure called watermark to the target data object (mostly) imperceptibly to the users and inseparably from the object.…”

Section: Introductionmentioning

confidence: 99%

“…Many web-based map services uses raster digital maps exactly for this reason; raster digital maps having limited resolution have a limited value for reuse or redistribution. As an image data, most of the watermarking algorithm developed for digital images [16,6,12] can be applied to the raster digital map. A vector digital map, on the other hand, employs geometrical primitives such as points, lines, polylines, and polygons to represent objects in the maps, such as building outlines, roads, rivers, reference points for strings, and contour lines.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation