Search arXivSearch

arXiv · 2104.10323

On assuring the accurate alignment of laser sheets for planar and stereoscopic PIV

Abstract

Several calibration techniques have been proposed in the literature for the calibration of two-component two-dimensional (2C-2D) particle image velocimetry (PIV) and three-component two-dimensional (3C-2D) stereoscopic PIV (SPIV) systems. These techniques generally involve the use of a calibration target that is assumed to be at the exact centre of the laser sheet within the field of view (FOV), which in practice is very difficult to achieve. In 3C-2D SPIV, several methods offer different correction schemes based on the computation of a disparity map, which are aimed at correcting errors produced due to this misalignment. These techniques adjust the calibration of individual cameras to reduce the disparity error, but in doing so can create unintended errors in the measurement position and/or the velocity measurements, such as introducing a bias in the measured three-component (3-C) displacements. This paper introduces a novel method to ensure accurate alignment of the laser sheet with the calibration target so that the uncertainty in displacement measurements is less than or equal to the uncertainty inherent to the PIV and hence, no correction scheme is required. The proposed method has been validated with a simple experiment in which true displacements are given to a particle container (illuminated by an aligned laser sheet) and the measured 3C displacements are compared with the given true displacements. An uncertainty of less than 7.6 micrometres (equivalent to 0.114 pixels) in the measured 3C displacements demonstrates the effectiveness of the new alignment method and eliminates the need for any ad hoc post-correction scheme.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Muhammad Shehzad, Sean Lawrence, Callum Atkinson, Julio Soria. 2021-04-21. On assuring the accurate alignment of laser sheets for planar and stereoscopic PIV. https://arxiv.org/abs/2104.10323

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Comparison of Image Processing Models in Quark Gluon Jet Classification

Quark-gluon discrimination provides a useful test case for studying how different machine-learning architectures learn the spatial structure of QCD radiation. In this work, we compare convolutional neural network (CNN), Vision Transformers (ViT), and hierarchical Swin Transformers using the same three-channel jet-image representation, consisting of charged-particle momentum, neutral-particle momentum, and charged-particle multiplicity from PYTHIA 8 jets. We study their performance for different training-set sizes and fine-tuning configurations, with particular attention to the role of local and global information in the jet images. CNN and Swin models consistently perform better than ViT in the cases studied. Since both CNN and Swin retain a strong local component in their architectures, this suggests that local jet substructure plays an important role in quark-gluon discrimination. The performance of the hierarchical Swin model also suggests that combining local features over larger spatial scales is useful. Block-wise fine-tuning improves the performance of the Transformer models, although the improvement becomes smaller and the training less stable as more blocks are unfrozen. We also find that self-supervised Momentum Contrast (MoCo) pretraining improves the model initialization, particularly when the amount of labeled training data is limited. Based on these observations, we developed a smaller Swin model adopted to the jet-image representation used in this study. It achieves comparable performance with substantially fewer parameters. The results show that it is important to adapt the model architecture and training procedure to the specific input characteristics of High Energy Physics (HEP) data when applying vision models in HEP.

physics.data-an

Online local learning for generative thermodynamic computing

Generative thermodynamic computers turn thermal noise into structured data through Langevin dynamics. We train these systems with a local update at each integration step. The reverse-path Onsager-Machlup objective yields a coupling gradient that is a symmetric sum of local residual-state correlations. We apply this gradient immediately rather than accumulating it over a full trajectory. In digital simulations using MNIST prototypes, online and trajectory-batch training reach similar validation losses on fixed noising paths. Models trained online release less heat on average in all five independently seeded pairs, with both models' parameters held fixed during sampling. Auxiliary classifier and nearest-prototype measures change modestly, while pairwise diversity decreases. The response to noise depends strongly on where the errors enter: independent zero-mean errors in the formed updates produce little heat change over a finite range of noise amplitudes, whereas residual offset and temporal correlation have much larger effects. Storing trained couplings requires substantially less precision than resolving deterministic updates during training. Together, these results establish a local online training method and show how update timing, noise structure, and precision affect generative thermodynamic computing.

physics.data-an

Information-Loss Location Estimation and Curvature-Scale Analysis of Physical Measurements: A Gaussian, Cauchy, and Logistic Neutron-Lifetime Benchmark

We develop and implement a two-step location-scale analysis for repeated physical measurements when the underlying distribution is not known. For a chosen substitute distribution, stationarity of population Kullback-Leibler information loss at fixed scale motivates the location score, which we apply to the observed measurements through empirical cross-entropy. Steiner's curvature rule then defines a companion scale separately. We place Gaussian, Cauchy, and logistic substitutes in one common construction and implement them reproducibly on a physics benchmark. For the logistic substitute, we pair the established bounded location score with a scale defined by the curvature rule rather than by a fitted tuning constant or a scale-likelihood equation. For Gaussian measurements with different quoted uncertainties, an experiment-level curvature convention and a stated variance mapping give an exact algebraic connection to a standard residual-based variance estimate for a weighted fit. Applied to a published 21-measurement neutron-lifetime compilation, the inverse-variance weighted, most frequent value, and logistic locations are 878.689, 881.164, and 882.835 s, respectively. These values are benchmark results of the compared constructions and are not proposed as a new recommended neutron lifetime.

physics.data-an