The problem inherent to any digital image (or digital video) system is the large amount of bandwidth required for transmission or storage. This has driven the research area of image compression to develop more complex...
详细信息
The problem inherent to any digital image (or digital video) system is the large amount of bandwidth required for transmission or storage. This has driven the research area of image compression to develop more complex algorithms that compress images to lower data rates with better fidelity. One approach that can be used to increase the execution speed of these complex algorithms is to implement the algorithms on a parallel supercomputer. The authors address the parallel implementation of the JPEG still image compression standard on the MasPar MP-1, a massively parallel SIMD computer. They demonstrate that the greatest difficulty lies not with the compression algorithm per se, but with the speed bottleneck that arises in the output of the compressed image. They develop a parallel output algorithm which addresses this problem and present results which show real-time performance on 1024/spl times/1024 images.< >
An empirical measure for the selection of the edge-enhancement Gaussian filter is developed. The Gaussian filter is specified by its standard deviation sigma ; the filter's spatial support is a function of sigma ....
详细信息
An empirical measure for the selection of the edge-enhancement Gaussian filter is developed. The Gaussian filter is specified by its standard deviation sigma ; the filter's spatial support is a function of sigma . An estimation procedure for sigma using Fourier analysis is described. The measure is easy to implement and is based totally on the image at hand. Experimental results suggest that this measure can be used as an aid in deciding the Gaussian filter's spatial support, which is needed to enhance the edges. Other equivalent bandwidth definitions can be used to obtain a measure of the frequency spread in the smoothed image (e.g., the mean-square bandwidth).< >
A new class of morphological filters is proposed for image enhancement. The filter, known as the generalized morphological filter (GMF), uses multiple structuring elements and combines linear and morphological operati...
详细信息
A new class of morphological filters is proposed for image enhancement. The filter, known as the generalized morphological filter (GMF), uses multiple structuring elements and combines linear and morphological operations. The GMF can be designed to suppress various types of noise yet preserve geometrical structure in an image. A study of several aspects of the performance of the filter is presented. The study includes geometrical feature preservation, noise suppression, structuring element selection, and the root signal structure. For the sake of comparison, averaging and median filters are also used in the experiments and corresponding figures of merit of the performance of the filter. The empirical study shows that the generalized morphological filter possesses effective noise suppression with reduced geometrical feature blurring.
Edge-based image segmentation is a two-stage process;edge enhancement followed by edge linking. Modern approaches for edge enhancement use either the gradient of the Gaussian operator (VG) or the Laplacian of the Gaus...
详细信息
Two commonly used optical correlation techniques, matched spatial filtering and joint-Fourier transform correlation, are briefly reviewed. A recently proposed real-time joint-Fourier transform correlation is then disc...
详细信息
The authors develop an empirical measure for the selection of the Gaussian filter that is commonly used for edge enhancement. The measure is based totally on the image at hand. Edge enhancement by a Gaussian filter ha...
详细信息
The authors develop an empirical measure for the selection of the Gaussian filter that is commonly used for edge enhancement. The measure is based totally on the image at hand. Edge enhancement by a Gaussian filter has two distinct advantages: (1) the filter is fully described by a single parameter, the standard deviation sigma ; (2) the two-dimensional filter is separable and can be easily implemented. The filter's spatial support is a function of sigma . This support is normally in the range of +or-3.5 sigma . An empirical measure is described for the selection of the Gaussian filter's spatial support using the power spectrum density of the input image. Classic Fourier analysis is used to obtain a measure for the spatial support of the Gaussian filter given a particular image. Experimental results suggest that this measure can be used as an aid in deciding the Gaussian filter's spatial support needed to enhance the edges.< >
An algorithm for detecting neural processes in serial optical sections for use in an automated three-dimensional neural reconstruction system is presented. This parsimonious, nonlinear, psychophysically motivated algo...
详细信息
An algorithm for detecting neural processes in serial optical sections for use in an automated three-dimensional neural reconstruction system is presented. This parsimonious, nonlinear, psychophysically motivated algorithm addresses the problems specific to neural element detection and localization, viz., images with minimal resolution, operators with small spatial supports, highly curved, filamentous features, large variation in feature intensity profile, poor signal-to-noise ratio, and determination of depth without stereo. One first finds the magnitude and orientation of the maximum intensity second directional derivative. A family of curves is locally fitted to these data, and the projections of the data on the curve family are found. If a pixel lies on a curve with sufficient total projection, it is labeled with the magnitude, orientation, curvature, spatial extent, and element displacement. Depth is interpolated from the spatial extent data for corresponding neighborhoods in three adjacent (in depth) images by using an approximation to the depth-dependent optical point spread function. Experimental results using photomicrographs of cat visual cortex are presented.< >
The authors develop a path metric for sequential search based on the linear model. The metric forms the heart of an edge-linking algorithm that combines edge elements enhanced by an optimal filter. From a starting nod...
详细信息
The authors develop a path metric for sequential search based on the linear model. The metric forms the heart of an edge-linking algorithm that combines edge elements enhanced by an optimal filter. From a starting node, transitions are made to the goal nodes by a maximum likelihood metric. This metric requires only local calculations on the search space and its use in edge linking provides more accurate results than other linking techniques.< >
We address the problem of reconstructing a smooth curve from sparse and noisy information that is invariant to the choice of the coordinate system. Tikhonov regularization is used to form a well-posed mathematical pro...
详细信息
We address the problem of reconstructing a smooth curve from sparse and noisy information that is invariant to the choice of the coordinate system. Tikhonov regularization is used to form a well-posed mathematical problem statement, and conditions for an invariant reconstruction are given. The resulting functional minimization problem is shown to be nonconvex. Approximations to the invariant functional are often used to form a convex problem that can be solved efficiently. Two common approximations, those of cubic and weighted cubic splines, are detailed, and examples are given to show that the approximations are often invalid. To form a valid approximation to the invariant functional we propose a two-step algorithm. The first step forms a piecewise-linear curve, which is invariant to the coordinate system. This piecewise-linear curve is then used to construct a parameterization of the curve for which we can make a valid approximation to the invariant functional. Examples are given to demonstrate the effectiveness of the algorithm, and two example applications for which the invariant property is important are given.
A technique is presented that can be used in the visualization and analysis of cardiac wall motion abnormalities by digital two-dimensional echocardiography. This technique is based on the use of a curvature function ...
详细信息
A technique is presented that can be used in the visualization and analysis of cardiac wall motion abnormalities by digital two-dimensional echocardiography. This technique is based on the use of a curvature function extracted from the endocardial boundary locations and can be used for shape or shape change analysis of the heart. The authors call the locations of high absolute curvature landmarks. Identification of landmarks on the endocardial boundary provides a simplified but powerful description of the boundary that allows visualization and analysis of wall motion. The simplification of the heart beating process is an excellent tool for the identification of infarcted areas of the heart.
暂无评论