SPATIAL RANK AND APPROXIMATE SYMMETRIES IN SEQUENTIAL RECONSTRUCTION OF DENSE PACKINGS

Alexander Vinogradov

Abstract

General rotation group manifold is used as a base structure for representation of k-point configuration clusters in Hough-type parametric space. This yields to introduce efficiently spatial ranks inside k-point trial set and arrange in multiple dimensions Parzen-like windows with properties analogous to the linear ones’. As a result, asymptotically optimal dense packings of clusters are automatically produced for arbitrary spatial shapes via independent sequential trials.

References

  1. Chen L.1 et al, 2004. A Fast Efficient Parallel Hough Transform Algorithm on LARPBS: Parallel and Distributed Processing with Applications. In The Journal of Supercomputing, Vol. 29/2, p. 185-195.
  2. Daries C.J., Nixon M.S., 1998. A Hough transform for detecting the location and orientation of three dimension surfaces via color encoded spots. In IEEE Transactions on System, Man and Cybernetics, Vol. 28/1, p. 90-95.
  3. Hough P.V.C., 1962. Method and Means for Recognizing Complex Patterns. US Patent 3069354.
  4. Leavers V.F., 1992. The book, Shape detection in computer vision via Hough transform. Springer.
  5. Monari J. et al, 2006. Generalized Hough transform: A useful algorithm for signal path detection. In Acta Astronautica, Vol. 58/4, p. 230-235.
  6. Parzen E., 1962. On estimation of a probability density and mode. In Annals of Mathematical Statistics. Vol.39, pp. 1065-1076.
  7. Torii A. et al, 2005. The randomized Hough transform for spherical images and the segmentation of points on the dual sphere using the metric defined on a sphere. In CAIP 2005: Computer Analysis Of Images And Patterns, Versailles.
  8. Vinogradov A.P., 2001. An algorithm generating a complete set of Parzen-type meshes on samples of multiple dimension. In Proc. 9-th Int. Conf. “Knowledge-Dialog-Solution” (KDS-2001), SanktPeterburg, p. 97-101.
  9. Vinogradov A.P., Voracek J., Zhuravlev Yu.I., 2006. Stochastic Filtering of Approximate Symmetries in Dense Packings of Clusters. In Pattern Recognition and Image Analysis. Vol. 16/2, pp. 189-200.
  10. Zhang S.-C., Liu Z.-Q. 2005. A robust, real-time ellipse detector. In Pattern Recognition, Vol. 38/2, p. 273- 287.
Download


Paper Citation


in Harvard Style

Vinogradov A. (2007). SPATIAL RANK AND APPROXIMATE SYMMETRIES IN SEQUENTIAL RECONSTRUCTION OF DENSE PACKINGS . In Proceedings of the Second International Conference on Computer Vision Theory and Applications - Volume 3: Mathematical and Linguistic Techniques for Image Mining, (VISAPP 2007) ISBN 978-972-8865-75-7, pages 211-214. DOI: 10.5220/0002071102110214


in Bibtex Style

@conference{mathematical and linguistic techniques for image mining07,
author={Alexander Vinogradov},
title={SPATIAL RANK AND APPROXIMATE SYMMETRIES IN SEQUENTIAL RECONSTRUCTION OF DENSE PACKINGS},
booktitle={Proceedings of the Second International Conference on Computer Vision Theory and Applications - Volume 3: Mathematical and Linguistic Techniques for Image Mining, (VISAPP 2007)},
year={2007},
pages={211-214},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002071102110214},
isbn={978-972-8865-75-7},
}


in EndNote Style

TY - CONF
JO - Proceedings of the Second International Conference on Computer Vision Theory and Applications - Volume 3: Mathematical and Linguistic Techniques for Image Mining, (VISAPP 2007)
TI - SPATIAL RANK AND APPROXIMATE SYMMETRIES IN SEQUENTIAL RECONSTRUCTION OF DENSE PACKINGS
SN - 978-972-8865-75-7
AU - Vinogradov A.
PY - 2007
SP - 211
EP - 214
DO - 10.5220/0002071102110214