Literature DB >> 28009359

Uncertainty Analysis for Angle Calibrations Using Circle Closure.

W Tyler Estler1.   

Abstract

We analyze two types of full-circle angle calibrations: a simple closure in which a single set of unknown angular segments is sequentially compared with an unknown reference angle, and a dual closure in which two divided circles are simultaneously calibrated by intercomparison. In each case, the constraint of circle closure provides auxiliary information that (1) enables a complete calibration process without reference to separately calibrated reference artifacts, and (2) serves to reduce measurement uncertainty. We derive closed-form expressions for the combined standard uncertainties of angle calibrations, following guidelines published by the International Organization for Standardization (ISO) and NIST. The analysis includes methods for the quantitative evaluation of the standard uncertainty of small angle measurement using electronic autocollimators, including the effects of calibration uncertainty and air turbulence.

Entities:  

Keywords:  angle metrology; autocollimators; calibration; closure; dimensional metrology; indexing tables; measurement uncertainty; optical polygons; self-calibration

Year:  1998        PMID: 28009359      PMCID: PMC4890943          DOI: 10.6028/jres.103.008

Source DB:  PubMed          Journal:  J Res Natl Inst Stand Technol        ISSN: 1044-677X


1. Introduction

Full-circle calibrations of the angular divisions of polygon mirrors, indexing and rotary tables, and angle encoders can be accomplished without reference to separately calibrated reference artifacts using comparator techniques together with the principle of circle closure. The latter is a natural conservation law for plane angle, known since the time of Euclid, expressing the fact that the sum of the angles around any point in a plane equals 2π rad (360°). Should a circle be divided into n angular segments A1, A2, …, A, and the difference between each segment and an unknown reference angle X be measured, closure provides a constraint on the data that enables a complete solution for all n + 1 unknowns. Circle closure is one of a number of self-proving comparator techniques employing multiple measurements together with suitable rearrangements of the components of a measurement system. A review of such techniques and their applications in dimensional metrology is given in Ref. [1]. In this paper we analyze two types of circle closure: a simple closure, just described, and a dual closure wherein two artifacts, such as a pair of indexing tables or an indexing table and an optical polygon, are inter-compared in such a way that each is calibrated in the process. The conceptual ideas here are well known and widely applied [2-9]; our major goal is to derive explicit expressions for the resulting measurement uncertainties in a manner consistent with guidelines published by the International Organization for Standardization (ISO) and NIST [10-11]. In the process, we show how closure constraints serve to reduce uncertainty in an interesting way as a result of a basic observation: the result of a measurement provides information not only about the measured quantity (i.e., the defined quantity subject to measurement, or the measurand), but also about any other quantities with which the measurand shares a functional relationship.

2. Simple Closure

In a simple closure calibration, the n angles of interest are independently compared to an unknown reference angle X using a difference measurement procedure. We consider the common case where the angles of interest A1, A2,…, A and the comparison angle X are nominally equal to 2π/n radians. Denoting the deviations from the nominal value by a1, a2,…, a and x, respectively, we have: where the deviations are assumed to be small angles that can be conveniently measured using an accurate autocollimator. With these definitions we have A − X = a − x, i = 1, 2,…, n and the constraint of circle closure becomes: or, finally: The physical realization of the reference angle X will depend on the chosen measurement procedure. Two particular procedures that lead to identical sets of measurement equations are (a) the calibration of an n-sided optical polygon using two autocollimators, and (b) the calibration of an indexing table, at a subset n of its discrete positions, using a dihedral mirror or a segment of an optical polygon. In the first case, X is the angle between the optical axes of the autocollimators; for the indexing table calibration, X is the angle between the two mirror normals. Figure 1 shows the setup for a simple closure calibration of an n-position indexing table using a dihedral comparator mirror (Fig. 1a) and an electronic autocollimator. The mirror is aligned so as to bring one of its faces near the null of the autocollimator, and a reading is taken (Fig. 1b). The table is then indexed through angle A1, rotating the second mirror face into near-normal incidence, and a second autocollimator reading taken (Fig. 1c). Denoting the measured angles by θ1 and θ2, we then have, for a suitable sign convention: where m1 ≡ θ2 − θ1. We then re-position the dihedral mirror to bring the first face back to a position near the autocollimator null and repeat the measurement sequence. Continuing in this fashion, we sequentially compare the angle X with each of the indexing table intervals, yielding the complete set of measurement equations:
Fig. 1

Calibration of an n-position indexing table using a dihedral comparator mirror and an autocollimator. The measurement sequence shown yields the first of n difference equations.

Here we have n linear equations in the n + 1 unknown quantities {a1, a2,…, a; x}, constrained by the closure relation, Eq. (2). Adding Eqs. (4) yields: and since the first sum vanishes we have the comparator angle deviation x, as an explicit function of the measurement data: Now using Eq. (6) for x and the set of measurement relations Eq. (4), we have for the deviation of the kth segment of the indexing table: We note from the results, Eqs. (6) and (7), that the angular units for closure-based angle metrology are fixed by the scale of the small-angle measuring system, assumed here to be a calibrated autocollimator. The set of Eqs. (4) is invariant under the change of scale {a, x, m} → {αa, αx, αm}, i = 1, 2,…, n where α is an arbitrary scale factor. Thus, while closure obviates the need for separately calibrated comparator artifacts, the achievable uncertainty is limited by the degree to which the SI derived unit of plane angle (the radian) is realized by the small-angle measuring system.

3. Measurement Uncertainty

In order to evaluate the measurement uncertainty, we need the following result from the analysis of the propagation of uncertainty [10-11]. Suppose that a measur-and of interest Y is related to n independent and uncorrelated “influence quantities” z, k = 1, 2,…, n, via the functional relation In a procedure to determine Y, the quantities z may be directly measured or simply estimated; in either case our state of knowledge of these quantities is described by a set of probability distributions with associated variances u2(z). The positive square roots of these variances, u(z), k = 1, 2,…, n, are called the standard uncertainties of the quantities z. A first-order Taylor series approximation of Y = f (z1, z2,…, z) then yields the estimated variance of Y: with the combined standard uncertainty of Y given by uc(Y). The quantities ∂f/∂z are known as sensitivity coefficients whose squares are essentially weighting factors for the individual variances u2(z). We emphasize here that the use of probability distributions to characterize our state of knowledge should not be taken to imply that the quantities z are intrinsically random in nature. A dimensional measurement in engineering metrology is a deterministic exercise in which time and cost constraints determine the quantity and quality of the input measurement data. The quantities z are generally a set of unknown constants whose values at the time the data were taken are not known exactly. Certain influences, such as the effect of air turbulence on the reading of an autocollimator, may appear at first sight to fluctuate randomly and unpredictably. When this happens we often choose to average over many readings in order to approximate a mean, or equilibrium, value for the measured angle. On the other hand, the time-dependent spatial distribution of the air density between an autocollimator and a target mirror could, in principle, be measured very accurately using interferometric techniques, and the result used to calculate, and correct for, the subsequent refraction error in the optical signal. That we normally choose not to do so is a matter of economics and not a decision forced on us because of any randomness inherent in the measurement process. In using a probability distribution to describe an experimental parameter, what is “distributed” is not the parameter itself but rather our knowledge with respect to the value it had when we performed the measurement. For the comparator angle x, we then use Eq. (9) to compute the variance: In Appendix A we show that for an accurately calibrated autocollimator measuring angular artifacts of high quality (in the sense that measured angles are reasonably small), the variance u2(m) may be assumed to be constant for all measurements m1, m2,…, m. We suggest two ways in which this constant value can be assigned in practice; for typical laboratory environments, it is reasonable to assume that: where β is a calibration parameter on the order of unity and is the experimentally measured (Type A) variance of the mean of a set {R1, R2,…, R} of N autocollimator readings for a fixed target mirror position. With this result, Eq. (10) becomes: so that the combined standard uncertainty of x is: Equation (13) expresses what we might intuitively expect on the basis of repeated measurements in the presence of uncorrelated measurement “noise.” Since the unknown angle x has been the subject of n independent and uncorrelated difference measurements, the uncertainty of the measured value of x has been reduced by from the uncertainty of a single measurement. Then, using Eq. (10) and the assumed variances , i = 1, 2,…, n, we have: Thus, for the combined standard uncertainty of a we have: with the same result for the remaining angular deviations. Equation (15) illustrates an interesting feature of calibrations that are constrained by subsidiary conditions such as circle closure. Given a single measurement of a, we would expect an uncertainty equal to u0, whereas the actual result is less than u0 by a factor of . Each measurement of one of the deviations a ≠ a adds a little to our knowledge of a because of the closure constraint. As the number of unknown deviations n increases, the factor approaches unity and the reduction in uncertainty decreases, as we might expect. The closure constraint only provides a single piece of information whose effect is diluted as the number of unknowns becomes large.

4. Dual Closure

Indexing tables are commonly calibrated at a set of n positions using an intercomparison technique wherein the table of interest (the test table) is mounted concentrically atop a comparison table capable of indexing to the same n positions. Typically one table is rotated clockwise (CW) through a chosen angle, followed by a counter-clockwise (CCW) rotation of the second table through the same angle, so that a plane mirror target mounted on the top table is returned to a nominal zero position. Small differences in mirror position before and after indexing are measures of differences between pairs of nominally equal angular segments of the two indexing tables. These small difference angles are normally measured using an accurate autocollimator. By the nature of the procedure, the angular positioning errors of both indexing tables are simultaneously determined by a complete set of measurement data. Therefore, in what follows, we no longer distinguish the “test table” from the “comparison table” but simply refer to them as the top table (T) and the bottom table (B), respectively. We denote the n angular segments of interest for the top and bottom tables, respectively, by T = 2π/n + t and B = 2π/n + b, i = 1, 2,…, n, where (b, t) are small angular errors. Then for all i we have B – T = b – t, and the circle closure constraints on the two tables can be written, by the steps leading to Eq. (2):

5. Explicit Example: n = 3

In order to demonstrate the calculation of measurement uncertainty for indexing table calibrations using dual closure, we will work out the results for two three-position tables in enough detail so that all steps in the procedure may be appreciated. We will then be in a position to generalize to the n × n case. We thus consider the setup shown in Fig. 2, with a pair of three-position tables.
Fig. 2

Dual closure calibration of a pair of 3-position indexing tables. The two-move measurement sequence shown yields the first of difference equations.

We label the three segments of the top table {T1, T2, T3} and those of the bottom table {B1, B2, B3}, with segments T1 and B1 initially positioned as shown in the top diagram of Fig. 2. The small dots locate the zero index marks on each table. In acquiring measurement data, the bottom table always rotates CCW while the top table rotates CW, viewed from above. Now consider the measurement sequence consisting of the following moves: (1) rotate the bottom table CCW through angle B1 and then (2) rotate the top table CW through angle T1. This sequence is illustrated in the middle and bottom diagrams of Fig. 2. The net result of the two moves is a CCW rotation of the bottom table through a nominal angle of B1 ≈ 2π/3 rad (120°) and a rotation of the target mirror through angle B1 – T1 = b1 – t1, for a suitable set of sign conventions. Denoting by m1 the difference between the initial and final autocollimator readings, we have We now repeat the measurement sequence two more times, yielding two more difference equations m2 = b2 – t2 and m3 = b3 – t3. At the end of the three measurements, the entire system is returned to its initial configuration. We then rotate the top table through angle T1 ≈ 120° CW, re-position the target mirror near the autocollimator null, and repeat the set of three two-move sequences. Proceeding in this manner yields a complete set of 3 × 3 = 9 difference measurements in which the three angles of the top table are each compared with the three angles of the bottom table. (We note here that this is only one of many different complete move sequences that yield 3 × 3 = 9 independent differences between pairs of table segments. For any given sequence, the nature and numbering of the coefficient matrix and data vector defined below will differ in detail from that derived here but the resulting uncertainty evaluations for the table angle deviations will be identical.) The 3 × 3 indexing table difference equations resulting from a complete set of segment comparisons are given by where m1,…, m9 are differences between pairs of autocollimator readings. This over-determined set of nine linear relations among six unknown quantities has no unique solution. This can be seen by noting that set of equations is invariant under the additive transformations b → b + K, t → t + K, i = 1, 2,…, n, where K is an arbitrary constant. The equations are also not independent; we see, for example, that m9 = m4 + m6 − m1. In order to proceed, we combine the measurement relations, Eqs. (18), with the two constraint Eqs. (16) and express the resultant set of linear equations in matrix form: or where is an 11 × 6 coefficient matrix, is a 6 × 1 column vector of indexing table angular deviations: = (b1b2b3t1t2t3) and is an 11 × 1 vector of measurement data plus constraints. This is an over-determined set of 11 equations in 6 unknowns. Such data sets are in general inconsistent because of measurement errors, which means that there is no solution vector which satisfies all eleven equations simultaneously. This is a standard problem in linear algebra and can be solved (in the sense of closest approximation) by the method of least squares. For a detailed development see, for example, Ref. [12]; in this paper we simply state the result. The rank of a matrix is equal to the number of linearly independent rows (or columns) of the matrix. Given the set of linear equations = , where the m × n matrix has rank n, then the least-squares solution is given by: where T is the transpose of the coefficient matrix . In our 3 × 3 problem, it can be shown that the rank of is equal to 6, as required, and so we proceed to work out the product matrix: Then, using and above, with Eqs. (21) and (22), and carrying out the matrix multiplication, yields the least-squares estimates for the angle deviations of the indexing tables: Equations (23)–(28) display the explicit functional relationships between the indexing table angle deviations and the measurement data. The combined standard uncertainties can then be calculated by taking the appropriate derivatives according to Eq. (9). For the variance in the least-squares estimate of b1 we have, using Eq. (23) As before, the quantities are the sensitivity coefficients and here we see that measurements m1, m4, and m7 have greater weight, by a factor of 7/2, than that of the remaining measurements. This follows naturally since these three measurements depend directly on the value of b1 [see Eqs. (18)], while the remaining measurements depend on b1 only indirectly, by way of the constraint relations. As in the case of simple closure, the measurement data here consists of a set of independent autocollimator difference readings and we again make the reasonable assumption (see Appendix) that each measurement has the same uncertainty: , i = 1, 2,…, 9. Then Eq. (29) becomes with the combined standard uncertainty given by The uncertainties of the remaining least-squares estimates are also given by Eq. (31).

6. Generalization for Two n-Position Indexing Tables

The procedure described for the 3 × 3 indexing table intercomparison may be generalized to the case of an n × n calibration. The set of all difference measurements b, i, j = 1, 2,…, n between the angular segments of the two tables will yield a set of n2 equations analogous to Eqs. (18). Using the same angular segment labeling conventions, the general problem will have an angle deviation vector with 2n components (b1 b2 …b1 t2…t), a coefficient matrix of size (n2 + 2) × 2n, and a data vector of length n2 + 2. Using a matrix manipulation code such as MATLAB or Mathematica1, it is not difficult to show by induction that has rank 2n and that Eq. (23), for general n, becomes: with analogous expressions for and . The numbering scheme makes it unwieldy to write these expressions explicitly, but the general rule is simply and where k = 1, 2,…, n. The calculation of the combined standard uncertainty proceeds in exactly the same way as that leading to Eq. (31), under the reasonable assumption (see Appendix A) that the combined standard uncertainty of each measurement m is just Examining Eq. (32), we see that the quantity multiplied by (3n – 2) contains n terms, while the quantity multiplied by 2 contains n(n – 1) terms. (The total number of m-terms is just n2, the number of measurements.) We can then write, using Eq. (29) so that the combined standard uncertainty is The same result follows for the combined standard uncertainty of the remaining angle deviation estimates. Equation (36) is quite interesting. If we neglect the term in n2, then , which is what we might expect intuitively, since the unknown angle B1 has been independently compared with the n angles T1,…, T. The factor 8/(9n2) reduces the uncertainty slightly as a result of the constraints due to circle closure. Since there are only two closure relationships for any n, while the number of measurements grows like n2, the reduction in combined standard uncertainty becomes insignificant for large n; for n = 12 for example, a common value, the correction is less than 5 %.

7. Conclusions

Angle calibrations using closure constraints are self-proving and can be accomplished without the need for separately calibrated reference artifacts or the services of a standards laboratory. The SI unit of angle is transferred by a small angle measuring system, typically a calibrated electronic autocollimator. The constraints lead to (usually modest) reductions in the combined standard uncertainties of the measured angles. These uncertainties can be readily calculated using the results derived in this paper. In common laboratory environments, the primary source of measurement uncertainty for a well-characterized autocollimator is turbulence noise on the optical signal. The minimum achievable uncertainty is limited by the degree to which such noise can be reduced.
  1 in total

Review 1.  Traceability of On-Machine Tool Measurement: A Review.

Authors:  Unai Mutilba; Eneko Gomez-Acedo; Gorka Kortaberria; Aitor Olarra; Jose A Yagüe-Fabra
Journal:  Sensors (Basel)       Date:  2017-07-11       Impact factor: 3.576

  1 in total

北京卡尤迪生物科技股份有限公司 © 2022-2023.