Take for instance my search for the "Grey-weighted distance transform" which I used in my paper: Lehane and Ekdale, 2014, Analytical tools for quantifying the morphology of invertebrate trace fossils. The grey-weighted distance transform is a technique that I used in order to help determine Network Tortuosity of a trace fossil by calculating the tortuosity for each path through the trace.

Figure 6 from Lehane and Ekdale (2014) showing the calculation of the Network Tortuosity. |

When I was looking for a technique to do this, I stumbled upon Wu et al.'s (2006) paper on doing this type of network tortuosity measurements on fracture patterns. In the paper they state:

So clearly this appears to be a computer program set to calculate the length of the shortest paths across a surface. So I went to the article they cited, Verbeek and Verwer (1990). In that paper they state:"The path length was determined using the ‘gray-weighted distance transform’ (Verbeek and Verwer, 1990). This algorithm calculates the path that results in the shortest traveling time when going from a set of predefined starting points to any other point in the image."

A couple of things are noticeable here. 1. Wu et al. (2006), changed the spelling of the "grey" to "gray" to match the language designations of where they were publishing, even though it was an already established title to an algorithm . 2. Even though the original idea for the process came from Rutovitz (1968), there is no citing of his paper anywhere in the Wu et al. (2006) paper."Already in 1968 Rutovitz (1968) introduced the grey-weighted distance transform in which the distance of a point to a set of reference points (the sources) is calculated as the lowest path sum of grey values (i.e. the lowest of the sums over all possible paths from that point to the sources)."

And that is where part of my issue lies. This is not a slight against Wu et al. (they were a tremendous help to me on my dissertation) mainly because this is not an isolated incident. Should researchers be expected to find the primary source of information or is the information cited far along in the game of telephone more relevant than the original source? Or should all of the links in the chain be cited?

To continue in our search backwards we go to Rutovitz (1968) who states under his section "Grey-weighted distance transform":

So, how much relevance does this have, from a time before computers to the modern application, where the computers used would have been even beyond comprehension at the time the original algorithm was conceived. The basic theory is generally similar, but the use and changes that it has undergone through the decades has changed it. Is the original even relevant anymore?"Let S be a subset of the integer coordinate plane. The result ofthe pure distance transform of the characteristic function of S is afunction d defined on S such that at each point (i,j)ϵS, d(i,j) isthe minimal path distance from (i,j) to S. Suppose though that wehave a function g defined on S, and that we think of the values of gas heights of a surface above the (i,j)-plane.We want to set up a modified distance function on S, such that points accessible from outside of S via low-lying paths have lower values than points accessible only by higher paths of the same length. Of course, optimal relative weightings for the values of the function g in relation to the lengths of paths in the raster must be found."

Personally, I feel all such applications should be cited. From the original source, up through the modern example, because they all had a hand in crafting what it had became so that I was able to use it in my research.

----------------------------------------------------------------------------------------------

Lehane, J.R.

**and Ekdale, A.A. 2014. Analytical tools for quantifying the morphology of invertebrate trace fossils: Journal of Paleontology, v. 88, p. 747-759**

Rutovitz, D. 1968. Data structures for operations on digital images, p. 105–133. In G. C. Cheng, R. S. Ledley, D. K. Pollock, and A. Rosenfeld (eds.), Pictorial Pattern Recognition. Thompson, Washington DC.

Verbeek, P. W. and B. J. H. Verwer. 1990. Shading from shape, the eikonal equation solved by grey-weighted distance transform. Pattern Recognition Letters, 11:681–690.

Wu, Y. S., L. J. Van Vliet, H. W. Frijlink, and K. Van der Voort Maarschalk. 2006. The determination of relative path length as a measure for tortuosity in compacts using image analysis. European Journal of Pharmaceutical Sciences, 28:433–440.