With the development of Holographic PIV (HPIV) and PIV Cinematography (PIVC), the need for a computationally efficient algorithm capable of processing images at video rates has emerged. This paper presents one such algorithm, sparse array image correlation. This algorithm is based on the sparse format of image data—a format well suited to the storage of highly segmented images. It utilizes an image compression scheme that retains pixel values in high intensity gradient areas eliminating low information background regions. The remaining pixels are stored in sparse format along with their relative locations encoded into 32 bit words. The result is a highly reduced image data set that retains the original correlation information of the image. Compression ratios of 30:1 using this method are typical. As a result, far fewer memory calls and data entry comparisons are required to accurately determine tracer particle movement. In addition, by utilizing an error correlation function, pixel comparisons are made through single integer calculations eliminating time consuming multiplication and floating point arithmetic. Thus, this algorithm typically results in much higher correlation speeds and lower memory requirements than spectral and image shifting correlation algorithms. This paper describes the methodology of sparse array correlation as well as the speed, accuracy, and limitations of this unique algorithm. While the study presented here focuses on the process of correlating images stored in sparse format, the details of an image compression algorithm based on intensity gradient thresholding is presented and its effect on image correlation is discussed to elucidate the limitations and applicability of compression based PIV processing.

Issue Section:
Research Papers
Topics:
Algorithms, Compression, Errors, Image processing, Particulate matter, Storage
1.
Adrian, R. J., 1986, “Multi-point Optical Measurement of Simultaneous Vectors in Unsteady Flow—a Review,” Int. J. Heat and Fluid Flow, pp. 127–145.
2.
Adrian
R. J.
,
1991
, “
Particle Imaging Techniques For Experimental Fluid Mechanics
,”
Annual Review of Fluid Mechanics
, Vol.
23
, pp.
261
–
304
.
3.
Gonzalez, R. C., and Woods, R. E., 1993, Digital Image Processing, Addison-Wesley, Reading, MA, pp. 414–456.
4.
Hatem, A. B., and Aroussi, A., 1995, “Processing of PIV Images,” SAME/JSME and Laser Anemometry Conference and Exhibition, August 13–18, Hilton Head, SC, FED-Vol. 229, pp. 101–108.
5.
Hennessy, J. L., and Patterson, D. A., 1990, Computer Architecture—A Quantitative Approach, Morgan Kaufmann Pub., San Mateo, CA.
6.
Huang, H., Hart, D. P., and Kamm, R., 1997, “Quantified Flow Characteristics in a Model Cardiac Assist Device,” ASME Summer Annual Meeting, Vancouver, B.C., Experimental Fluids Forum, pp. 1–6.
7.
Landreth, C. C., and Adrian, R. J., 1987, “Image Compression Technique for evaluating Pulsed Laser Velocimetry Photographs having High particle Image Densities,” FED-Vol. 49.
8.
Okamoto, K., Hassan, Y. A., and Schmidl, W. D., 1995, “New Tracking Algorithm for Particle Image Velocimetry,” Experiments in Fluids, pp. 342–347.
9.
Rosenfeld
A.
, and
De La Torre
P.
,
1983
, “
Histogram Concavity Analysis as an Aid in Threshold Selection
,”
IEEE Transactions on Systems, Man, and Cybernetics
, Vol.
13
(
3
), pp.
231
–
235
.
10.
Roth, Hart, and Katz, 1995, “Feasibility of Using the L64720 Video Motion Estimation Processor (MEP) to increase Efficiency of Velocity Map Generation for Particle Image Velocimetry (PIV),” ASME/JSME Fluids Engineering and Laser Anemometry Conference, Hilton Head, SC, pp. 387–393.
This content is only available via PDF.
Copyright © 1998
 by The American Society of Mechanical Engineers
You do not currently have access to this content.