Measuring the complexity of two-dimensional binary patterns - Sub-symmetries versus Papentin complexity

Godfried T. Toussaint, Noris S. Onea, Quan H. Vuong. Measuring the complexity of two-dimensional binary patterns - Sub-symmetries versus Papentin complexity. In 14th IAPR International Conference on Machine Vision Applications, MVA 2015, Miraikan, Tokyo, Japan, 18-22 May, 2015. pages 480-483, IEEE, 2015. [doi]

@inproceedings{ToussaintOV15,
  title = {Measuring the complexity of two-dimensional binary patterns - Sub-symmetries versus Papentin complexity},
  author = {Godfried T. Toussaint and Noris S. Onea and Quan H. Vuong},
  year = {2015},
  doi = {10.1109/MVA.2015.7153235},
  url = {http://dx.doi.org/10.1109/MVA.2015.7153235},
  researchr = {https://researchr.org/publication/ToussaintOV15},
  cites = {0},
  citedby = {0},
  pages = {480-483},
  booktitle = {14th IAPR International Conference on Machine Vision Applications, MVA 2015, Miraikan, Tokyo, Japan, 18-22 May, 2015},
  publisher = {IEEE},
  isbn = {978-4-901122-15-3},
}