On the taxicab distance sum function and its applications in discrete tomography | Periodica Mathematica Hungarica Skip to main content
Log in

On the taxicab distance sum function and its applications in discrete tomography

  • Published:
Periodica Mathematica Hungarica Aims and scope Submit manuscript

Abstract

Let a finite set \(F\subset \mathbb {R}^n\) be given. The taxicab distance sum function is defined as the sum of the taxicab distances from the elements (focuses) of the so-called focal set F. The sublevel sets of the taxicab distance sum function are called generalized conics because the boundary points have the same average taxicab distance from the focuses. In case of a classical conic (ellipse) the focal set contains exactly two different points and the distance taken to be averaged is the Euclidean one. The sublevel sets of the taxicab distance sum function can be considered as its generalizations. We prove some geometric (convexity), algebraic (semidefinite representation) and extremal (the problem of the minimizer) properties of the generalized conics and the taxicab distance sum function. We characterize its minimizer and we give an upper and lower bound for the extremal value. A continuity property of the mapping sending a finite subset F to the taxicab distance sum function is also formulated. Finally we present some applications in discrete tomography. If the rectangular grid determined by the coordinates of the elements in \(F\subset \mathbb {R}^2\) is given then the number of points in F along the directions parallel to the sides of the grid is a kind of tomographic information. We prove that it is uniquely determined by the function measuring the average taxicab distance from the focal set F and vice versa. Using the method of the least average values we present an algorithm to reconstruct F with a given number of points along the directions parallel to the sides of the grid.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

Notes

  1. A necessary and sufficient condition for the unicity is due to H. J. Ryser. It is a consequence of a more general theorem [19, Theorem 3.1] concluding that two matrices of zeros and ones with equal row and column sum vectors can be transformed into each other by changing the alternating zeros and ones in 2 by 2 submatrices; see also [20]. For the problem of unicity we can refer to [7,8,9, 11, 15].

References

  1. A. Alpers, H.F. Poulsen, E. Knudsen, G.T. Herman, A discrete tomography algorithm for improving the quality of 3DXRD grain maps. J. Appl. Crystallogr. 39, 582–588 (2006)

    Article  Google Scholar 

  2. P. Balázs, A benchmark set for the reconstruction of hv-convex discrete sets. Discrete Appl. Math. 157, 3447–3456 (2009)

    Article  MathSciNet  Google Scholar 

  3. E. Balogh, A. Kuba, C. Dévényi, A. Del Lungo, R. Pinzani, Comparison of algorithms for reconstructing hv-convex discrete sets. Linear Algebra Appl. 339, 23–35 (2001)

    Article  MathSciNet  Google Scholar 

  4. E. Barcucci, A. Del Lungo, M. Nivat, R. Pinzani, Reconstructing convex polyominoes from horizontal and vertical projections. Theor. Comput. Sci. 155, 321–347 (1996)

    Article  MathSciNet  Google Scholar 

  5. K.J. Batenburg, J. Sijbers, DART: a practical reconstruction algorithm for discrete tomography. IEEE Trans. Image Process. 20(9), 2542–2553 (2011)

    Article  MathSciNet  Google Scholar 

  6. K.J. Batenburg, J. Sijbers, Generic iterative subset algorithms for discrete tomography. Discrete Appl. Math. 157(3), 438–451 (2009)

    Article  MathSciNet  Google Scholar 

  7. S. Brunetti, P. Dulio, C. Peri, Discrete tomography determination of bounded lattice sets from four X-rays. Discrete Appl. Math. 161(15), 2281–2292 (2013)

    Article  MathSciNet  Google Scholar 

  8. P.C. Fishburn, L.A. Shepp, Sets of uniqueness and additivity in integer lattices, in Discrete Tomography: Foundations, Algorithms and Applications, ed. by G.T. Herman, A. Kuba (Birkhuser, Boston, 1999), pp. 35–58

    Chapter  Google Scholar 

  9. R.J. Gardner, P. Gritzmann, Uniqueness and complexity in discrete tomography, in Discrete Tomography: Foundations, Algorithms and Applications, ed. by G.T. Herman, A. Kuba (Birkhuser, Boston, 1999), pp. 85–113

    Chapter  Google Scholar 

  10. R.J. Gardner, Geometric Tomography, 2nd edn. (Cambridge University Press, New York, 2006)

    Book  Google Scholar 

  11. P. Gritzmann, B. Langfeld, M. Wiegelmann, Uniqueness in discrete tomography: three remarks and a corollary. SIAM J. Discrete Math. 25, 1589–1599 (2011)

    Article  MathSciNet  Google Scholar 

  12. P. Gritzmann, S. de Vries, M. Wiegelmann, Approximating binary images from discrete X-rays. SIAM J. Optim. 11(2), 522–546 (2000)

    Article  MathSciNet  Google Scholar 

  13. L. Hajdu, R. Tijdeman, Algebraic aspects of discrete tomography. J. Reine Angew. Math. 534, 119–128 (2001)

    MathSciNet  MATH  Google Scholar 

  14. L. Hajdu, R. Tijdeman, An algorithm for discrete tomography. J. Linear Algebra 339, 147–169 (2001)

    Article  MathSciNet  Google Scholar 

  15. L. Hajdu, Unique reconstruction of bounded sets in discrete tomography. Electron. Notes Discrete Math. 20, 15–25 (2005)

    Article  MathSciNet  Google Scholar 

  16. G.T. Herman, Reconstruction of binary patterns from a few projections, in International Computing Symposium 1973, 371–378, ed. by A. Günther, B. Levrat, H. Lipps (North-Holland, Amsterdam, 1974)

  17. J. Nie, P.A. Parillo, B. Sturmfels, Semidefinite representation of $k$-ellipse, algorithms in algebraic geometry. IMA Vol. Math. Appl. 146, 117–132 (2008)

    Google Scholar 

  18. L. Rodek, H.F. Poulsen, E. Knudsen, G.T. Herman, A stochastic algorithm for reconstruction of grain maps of moderately deformed specimens based on X-ray diffraction. J. Appl. Crystallogr. 40, 313–321 (2007)

    Article  Google Scholar 

  19. H.J. Ryser, Combinatorial properties of matrices of zeros and ones. Canad. J. Math. 9, 371–377 (1957)

    Article  MathSciNet  Google Scholar 

  20. H.J. Ryser, Matrices of zeros and ones Bull. Am. Math. Soc. 66(6), 442–464 (1960)

    Article  Google Scholar 

  21. W. van Aarle, K.J. Batenburg, J. Sijbers, Automatic parameter estimation for the Discrete Algebraic Reconstruction Technique (DART). IEEE Trans. Image Process. 21(11), 4608–4621 (2012)

    Article  MathSciNet  Google Scholar 

  22. C. Vincze, Á. Nagy, An introduction to the theory of generalized conics and their applications. J. Geom. Phys. 61(4), 815–828 (2011)

    Article  MathSciNet  Google Scholar 

  23. C. Vincze, Á. Nagy, On the theory of generalized conics with applications in geometric tomography. J. Approx. Theory 164, 371–390 (2012)

    Article  MathSciNet  Google Scholar 

  24. C. Vincze, Á. Nagy, Generalized conic functions of hv-convex planar sets: continuity properties and X-rays. Aequationes mathematicae 89(4), 1015–1030 (2015)

    Article  MathSciNet  Google Scholar 

  25. C. Vincze, Á. Nagy, Reconstruction of hv-convex sets by their coordinate X-ray functions. J. Math. Imaging Vis. 49(3), 569–582 (2014)

    Article  MathSciNet  Google Scholar 

  26. C. Vincze, Á. Nagy, An algorithm for the reconstruction of hv-convex planar bodies by finitely many and noisy measurements of their coordinate X-rays. Fundamenta Informaticae 141(2–3), 169–189 (2015)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Csaba Vincze.

Additional information

C. Vincze is supported by the EFOP-3.6.2-16-2017-00015 project. The project is co-financed by the European Union and the European Social Fund.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Vincze, C. On the taxicab distance sum function and its applications in discrete tomography. Period Math Hung 79, 177–190 (2019). https://doi.org/10.1007/s10998-018-00278-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10998-018-00278-7

Keywords

Mathematics Subject Classification