Weighted distances based on neighborhood sequences for point-lattices

@article{Strand2009WeightedDB,
  title={Weighted distances based on neighborhood sequences for point-lattices},
  author={Robin Strand},
  journal={Discrete Applied Mathematics},
  year={2009},
  volume={157},
  pages={641-652}
}
A path-based distance is defined as the minimal cost-path between two points. One such distance function is the weighted distance based on a neighborhood sequence. It can be defined using any number of neighborhood relations and weights in conjunction with a neighborhood sequence. The neighborhood sequence restricts some steps in the path to a smaller neighborhood. We give formulas for computing the point-to-point distance and conditions for metricity for weighted distances based on… CONTINUE READING

Figures and Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 28 REFERENCES

Weighted distances based on neighbourhood sequences

  • Pattern Recognition Letters
  • 2007
VIEW 5 EXCERPTS

B

R. Strand
  • Nagy,Weighted neighbourhood sequences in non-standard three-dimensional grids — parameter optimization, in: Proceedings of IWCIA 2008, in: LNCS, 4958, Springer, Buffalo, NY
  • 2008
VIEW 1 EXCERPT

General neighborhood sequences in Zn

  • Discrete Applied Mathematics
  • 2007
VIEW 1 EXCERPT

Metric and non-metric distances on Z/sup n/ by generalized neighbourhood sequences

  • ISPA 2005. Proceedings of the 4th International Symposium on Image and Signal Processing and Analysis, 2005.
  • 2005
VIEW 1 EXCERPT