The map obtained of a tachycardia is greatly influenced by how meticulously individual activation points are annotated to indicate the timing of activation. The annotation window is typically set to display surface leads and intracardiac electrograms.1,2 These include the electrogram or ECG lead used as the timing reference as well as the bipolar and unipolar signals from the mapping catheter.3...

M uch has been written about Steve Jobs’ amazing leadership at Apple and how he transformed the company into one of the world’s most recognizable and profitable brands after his return from NeXT. But if you look closer, it’s easy to find examples of how Jobs-inspired Apple and NeXT products were platforms for many of the amazing innovations we take for granted today. Between 1987 and 1997, we e...

In this paper, we present an idea of using stereo matching to develop a travel aid for the blind. In this approach, images are segmented into several nonoverlapping homogeneous regions using a color segmentation algorithm. For each homogeneous region, a rectangular window, which is large enough to cover the region, is found. A local match with the found rectangular window size is then executed ...

Stereo matching is essential and fundamental in computer vision tasks. In this paper, a novel stereo matching algorithm based on disparity propagation using edge-aware filtering is proposed. By extracting disparity subsets for reliable points and customizing the cost volume, the initial disparity map is refined through filtering-based disparity propagation. Then, an edge-aware filter with low c...

Edges produced by existing edge detection algorithms often contain discontinuities. Edge linking as a post-processing step is an important step for computer vision and pattern recognition. We present a real-time algorithm and its VLSI implementation for linking broken edges. First, all broken edge points inside a 12 12 moving window are identiied. The 12 12 window scans the input gray level edg...

Suppose that f and g are Markov surjections, each defined on a wedge of circles, each fixing the branch point and having the branch point as the only critical value. We show that if the points in the inverse limit spaces associated with f and g corresponding to the branch point are distinguished then these inverse limit spaces are homeomorphic if and only if the substitutions associated with f ...

The paper presents a new path planning and replanning algorithm based on two-dimensional occupancy grid map of the environment, which integrates the focused D* (FD*) algorithm and Witkowski’s algorithm. The FD* algorithm is used for fast replanning and Witkowski’s algorithm is used for generating all optimal paths in the grid map. Our algorithm finds the shortest path in the geometrical space b...

We generalize the grid–projection method for the construction of quasiperiodic tilings. A rather general fundamental domain of the associated higher dimensional lattice is used for the construction of the acceptance region. The arbitrariness of the fundamental domain allows for a choice which obeys all the symmetries of the lattice, which is important for the construction of tilings with a give...

We consider self-affine tilings in R with expansion matrix φ and address the question which matrices φ can arise this way. In one dimension, λ is an expansion factor of a self-affine tiling if and only if |λ| is a Perron number, by a result of Lind. In two dimensions, when φ is a similarity, we can speak of a complex expansion factor, and there is an analogous necessary condition, due to Thurst...

An algorithm is presented that allows to perform skeletonization of large maps with much lower memory requirements than with the straightforward approach. The maps are divided into overlapping tiles, which are skeletonized separately, using a Euclidean distance transform. The amount of overlap is controlled by the maximum expected width of any map component and the maximum size of what will be ...