From Pixels to Voxels: Tracking Volume Elements in Sequences of 3-d Digital Images

نویسندگان

  • Hans-Gerd Maas
  • Anthony Stefanidis
  • Armin Gruen
چکیده

This paper presents the extension of certain, fundamental digital photogrammetric concepts, theories and strategies to three dimensions, and their performance in an interdisciplinary application for 3-D image sequence analysis in a technical chemistry experiment. Specifically, we present an image analysis technique for examining the fine scale (Kolmogorov scale) variations of the mixing process in a turbulent flow. The objective is to trace the interaction of two flows by identifying their motions in a sequence of 3-D images obtained with a system based on a high-speed solid state camera. After briefly describing the imaging process and the particularities related to the capture of quasi-continuous 3-D image sequences, we focus on theoretical and implementational issues associated with feature tracking in 3-D image sequences. We present the extension of least squares matching from pixels, associated with 2-D images, to voxels, associated with 3-D images. The use of additional constraints of radiometric and/or geometric nature strengthens the matching solution. In addition, the large amount of data associated with 3-D image sequences in general, and the high and multidirectional velocities involved in this application in particular, make the devision of an efficient matching strategy quite important.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Connectivity preserving transformations for higher dimensional binary images

An N -dimensional digital binary image (I) is a function I : Z → {0, 1}. I is B3N−1,W3N−1 connected if and only if its black pixels and white pixels are each (3 − 1)-connected. I is only B3N−1 connected if and only if its black pixels are (3 − 1)-connected. For a 3-D binary image, the respective connectivity models are B26,W26 and B26. A pair of (3 N − 1)-neighboring opposite-valued pixels is c...

متن کامل

An Enhanced Median Filter for Removing Noise from MR Images

In this paper, a novel decision based median (DBM) filter for enhancing MR images has been proposed. The method is based on eliminating impulse noise from MR images. A median-based method to remove impulse noise from digital MR images has been developed. Each pixel is leveled from black to white like gray-level. The method is adjusted in order to decide whether the median operation can be appli...

متن کامل

Temperature Mapping Using Ultrasound Digital Images

Introduction:  The  success  of  hyperthermia  depends  on  the  accuracy  of  the  temperature  monitoring in the tumor and the surrounding normal tissue. In this study, the temperature changes  were determined by computing the speckle displacement in the ultrasound digital images. Speckle  tracking algorithm was used to compute the displacement.  Materials and Methods: The experiment was perf...

متن کامل

Using a Novel Concept of Potential Pixel Energy for Object Tracking

Abstract   In this paper, we propose a new method for kernel based object tracking which tracks the complete non rigid object. Definition the union image blob and mapping it to a new representation which we named as potential pixels matrix are the main part of tracking algorithm. The union image blob is constructed by expanding the previous object region based on the histogram feature. The pote...

متن کامل

A Bintree Representation of Generalized Binary Digital Images

A d-dimensional binary digital image can most easily be modelled by a d-dimensional binary array. Each element of the array represents a (d-dimensional) pixel which is normally called "black" ("white") if the element's value is 1 (0). For most purposes it is necessary to introduce topological notions (adjacency, connectedness, etc.) for digital images and to study their properties. This is the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001