PART IV - Communications - Sampling Error in the of Grain-Edge Length Estimation

The American Institute of Mining, Metallurgical, and Petroleum Engineers
J. E. Hilliard
Organization:
The American Institute of Mining, Metallurgical, and Petroleum Engineers
Pages:
2
File Size:
648 KB
Publication Date:
Jan 1, 1967

Abstract

AS is well-known, the length per unit volume, Lv, of any lineal feature (such as grain edges in a polycrys-talline specimen) can be estimated from a count of the number of point intersections with a random plane of polish. Specifically:' Lv = 2NA in which NA is the expected number of intersections per unit area of the plane. As with all other measurements in quantitative metallography, the estimation of Lv is subject to a sampling error, the magnitude of which will depend on the number of observations. The analysis is usually performed by counting the number of intersections falling within a closed test figure of known area applied to a succession of different areas on the plane of polish. The test figure can be drawn directly on the screen of a projection microscope or else superimposed on the image of the structure by means of a reticule in a focusing eyepiece of an ordinary microscope. The use of micrographs is very inefficient unless, as in the present study, these are also needed for some other purpose. Consider an analysis in which n applications are made of a test figure within which the expected number of intersections is N. The expected total number of intersections counted is then given by NT = nN If (N) is the standard deviation in N for one application of the figure and if the latter is applied to non-overlapping regions so that the N's are independent in the statistical sense, then the standard deviation in Nt is given by: a(NT) = a(N)vn Eliminating n from Eqs. [2] and [3] we obtain: Thus, k will be a constant for a given specimen and test figure. From Eqs. [ I] and [4] we find As is to be expected, therefore, the fractional error in the estimation of Lv is inversely proportional to the square root of the total number of intersections counted. It is very desirable to have at least a rough estimate of k before starting an analysis, since it will then be possible to decide in advance by use of Eq. [5J how many counts should be made in order to achieve the desired accuracy in Lv. Without such information the investigator, unless lucky, will either do needless (and tedious) work or else obtain a result with too large an error. It is very easy to calculate k for the limiting case of N — 0, i.e., when the test figure is vanishingly small. In this case there is a negligible probability of two or more intersections falling within the figure. There are therefore only two possible outcomes: a count of one with a probability of, say, p and a zero count with a probability of (I-p). Thus and Therefore: We might expect k to depend on N and therefore on the size of the test figure. Such a dependence was observed2 in the analogous case involving the estimation of grain-boundary area per unit volume by a count of the number of intersections of a test circle with traces of the boundaries on the plane of polish. In this case the theoretical value of k at the limit N — 0 was 1.41. It was also predicted that k would display an initial sharp decrease with increasing N. Experimentally, k was observed to decrease to a value of 0.62 at N - 6 and thereafter remain approximately constant. Furthermore, the value of k for N > 6 was found to be insensitive to the form of the structure provided no pronounced anisotropy or grain-size variation was present. In order to determinewhether k would exhibit a similar dependence on N in the estimation of grain-
Citation

APA: J. E. Hilliard  (1967)  PART IV - Communications - Sampling Error in the of Grain-Edge Length Estimation

MLA: J. E. Hilliard PART IV - Communications - Sampling Error in the of Grain-Edge Length Estimation. The American Institute of Mining, Metallurgical, and Petroleum Engineers, 1967.

Export
Purchase this Article for $25.00

Create a Guest account to purchase this file
- or -
Log in to your existing Guest account