Polarization transformation as an algorithm for automatic generalization and quality assessment

Haizhong Qian, Liqiu MengProceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE 2007 · DOI

Abstract

Since decades it has been a dream of cartographers to computationally mimic the generalization processes in human brains for the derivation of various small-scale target maps or databases from a large-scale source map or database. This paper addresses in a systematic way the polarization transformation (PT) - a new algorithm that serves both the purpose of automatic generalization of discrete features and the quality assurance. By means of PT, two dimensional point clusters or line networks in the Cartesian system can be transformed into a polar coordinate system, which then can be unfolded as a single spectrum line <i>r</i> = <i>f</i>(&alpha;), where <i>r</i> and <i>a</i> stand for the polar radius and the polar angle respectively. After the transformation, the original features will correspond to nodes on the spectrum line delimited between 0&deg; and 360&deg; along the horizontal axis, and between the minimum and maximum polar radius along the vertical axis. Since PT is a lossless transformation, it allows a straighforward analysis and comparison of the original and generalized distributions, thus automatic generalization and quality assurance can be down in this way. Examples illustrate that PT algorithm meets with the requirement of generalization of discrete spatial features and is more scientific.
BibTeX
@inproceedings{qian2007polarization,
  author = {Haizhong Qian and Liqiu Meng},
  title = {{Polarization transformation as an algorithm for automatic generalization and quality assessment}},
  booktitle = {Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE},
  year = {2007},
  doi = {10.1117/12.759698},
}

Loading related content...

Figure