Xiamu Niu

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Cheng Yong Shao

> Home > Persons > Xiamu Niu

Publications

2007
[j5]
- view
  authority control:
- export record
  dblp key:
  - journals/tifs/WangSXN07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tifs/WangSXN07
Xiao Tong Wang, Cheng Yong Shao, X. G. Xu, Xiamu Niu:
Reversible Data-Hiding Scheme for 2-D Vector Maps Based on Difference Expansion. IEEE Trans. Inf. Forensics Secur. 2(3-1): 311-320 (2007)
[p1]
- view
  authority control:
- export record
  dblp key:
  - series/sci/NiuSW07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/series/sci/NiuSW07
Xiamu Niu, Cheng Yong Shao, Xiao Tong Wang:
GIS Watermarking: Hiding Data in 2D Vector Maps. Intelligent Multimedia Data Hiding: New Directions 2007: 123-155
2006
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/ieicet/ShaoWNW06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ieicet/ShaoWNW06
Cheng Yong Shao, Hai Long Wang, Xiamu Niu, Xiao Tong Wang:
A Shape-Preserving Method for Watermarking 2D Vector Maps Based on Statistic Detection. IEICE Trans. Inf. Syst. 89-D(3): 1290-1293 (2006)
2005
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/mmsp/ShaoWNW05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mmsp/ShaoWNW05
Cheng Yong Shao, Hai Long Wang, Xiamu Niu, Xiao Tong Wang:
Shape-Preserving Algorithm for Watermarking 2-D Vector Map Data. MMSP 2005: 1-4

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.