Unfortunately, first-order implementations lead to inaccuracies in computed traveltimes, which may lead to poor image focusing for migration applications. In addition, first-order traveltimes are not accurate enough for reliable amplitude calculations. This has lead to the development of the fast marching method on non-Cartesian (Alkhalifah and Fomel, 1997; Sun and Fomel, 1998), and even unstru...

Unfortunately, first-order implementations lead to inaccuracies in computed traveltimes, which may lead to poor image focusing for migration applications. In addition, first-order traveltimes are not accurate enough for reliable amplitude calculations. This has lead to the development of the fast marching method on non-Cartesian (Alkhalifah and Fomel, 1997; Sun and Fomel, 1998), and even unstru...

A multi-dimensional algorithm for surface extraction from a structured domain is presented. Topological information is used to split the n-cubes into simplices which are used to extract the possible configurations of new surface elements. The algorithm is intended to complement to the existing surface extraction algorithms, which are specialized to deal with a set dimension, while this algorith...

Image processing in machine vision is a challenging task because often real-time requirements have to be met in these systems. To accelerate the processing tasks in machine vision and to reduce data transfer latencies, new architectures for embedded systems in intelligent cameras are required. Furthermore, innovative processing approaches are necessary to realize these architectures efficiently...

Three dimensional datasets representing scalar fields are frequently rendered using isosurfaces. For datasets arranged as a cubic lattice, the marching cubes algorithm is the most used isosurface extraction method. However, the marching cubes algorithm produces some ambiguities which have been solved using different approaches that normally imply a more complex process. One of them is to tessel...

Fast Marching and Fast Sweeping are the two most commonly used methods for solving the Eikonal equation. Each of these methods performs best on a different set of problems. Fast Sweeping, for example, will outperform Fast Marching on problems where the characteristics are largely straight lines. Fast Marching, on the other hand, is usually more efficient than Fast Sweeping on problems where cha...

An evaluation of two traditional segmentation algorithms of Morphological Reconstruction and the Fast Marching method along with a novel hybrid segmentation approach is presented. After introducing the Fast Marching and the Morphological Reconstruction segmentation, we propose a novel hybrid segmentation approach in multi-stage, which is derived from both an improved Fast Marching method and th...

The marching cubes [7,15] method demonstrated that isosurface extraction can be reduced, using a divide-and-conquer approach, to solving a local triangulation problem. In addition, the marching cubes method proposed a simple and efficient local triangulation using a lookup table. However, the marching cubes did not address the divide portion of the approach, i.e., how to efficiently search a la...

An adaptive method for polygonization of implicit surfaces is presented. The method insists on the shape of triangles and the accuracy of resulting approximation as well. The presented algorithm is based on the surface tracking scheme and it is compared with the other algorithms based on the similar principle, such as the Marching cubes and the Marching triangles methods. The main advantages of...