The problem of reinforcing local evidence of edges while suppressing unwanted information in noisy images is considered using a form of relaxation labeling. The methodology is based on parameterizing a continuous set ...
详细信息
ISBN:
(纸本)081861952x
The problem of reinforcing local evidence of edges while suppressing unwanted information in noisy images is considered using a form of relaxation labeling. The methodology is based on parameterizing a continuous set of edge orientation labels using a single vector. A sigmoidal thresholding function similar to that used in artificial neural networks to bias neighborhood-influence and insure convergence to meaningful stable states is also utilized. A global optimization function is defined, and a decentralized parallel algorithm is derived that uses a steepest-gradient-descent approach to arrive at the optimal point on the functional surface, corresponding to desirable edge-reinforced and noise-suppressed labelings. In addition, a modification to the functional is presented which incorporates a thinning operation to insure that each edge is marked by only a single-pixel-wide response. Results from several image data sets indicate that the algorithm performs as well as or better than other relaxation labeling methods, and with improved computational efficiency.
Square and hexagonal spatial samplings, because of their processing ease, are used most widely in image and signal processing. The authors developed mathematical tools for estimating quantization error in hexagonal se...
详细信息
ISBN:
(纸本)081861952x
Square and hexagonal spatial samplings, because of their processing ease, are used most widely in image and signal processing. The authors developed mathematical tools for estimating quantization error in hexagonal sensory configurations. These include analytic expressions for the average error and the error distribution of a function of an arbitrarily large number of hexagonally quantized variables. The two quantities (the average error and the error distribution) are essential in assessing the reliability of a given algorithm. The corresponding expressions for square spatial sampling are presented for comparison;they can be used to determine which sampling technique would result in less quantization error for a particular algorithm. Such a comparison is important due to the paramount role that quantization error plays in computational approaches to computer vision. Some general observations in regard to the relative accuracy of hexagonal vs. square quantization are also presented.
Consideration is given to the problem of two-dimensional industrial part recognition. A novel data-driven technique for part recognition is proposed. This technique models an object or a scene as a composition of seve...
详细信息
Consideration is given to the problem of two-dimensional industrial part recognition. A novel data-driven technique for part recognition is proposed. This technique models an object or a scene as a composition of several meaningful components. A component of the unanalyzed portion of the scene is identified using a component-index. The objects that contain the identified component are hypothesized to be present in the scene. A given hypothesis is verified by matching the transformed boundary of the hypothesized object against the scene. The performance of the proposed technique is demonstrated by several examples.
Various zero-crossing techniques are used to distinguish between sinus rhythm and atrial fibrillation of different patients. The methods are threshold crossings, sine-wave crossings, threshold crossings of the derivat...
详细信息
Various zero-crossing techniques are used to distinguish between sinus rhythm and atrial fibrillation of different patients. The methods are threshold crossings, sine-wave crossings, threshold crossings of the derivative of the signal, and fast Fourier transform (FFT) analysis. The comparison shows that the sine-wave crossing method is best, because there is no need to normalize or to differentiate the signal (differentiation as a means to remove the DC component is a noisy process).Also, the algorithm is in real time (unlike the FFT procedure) and simple to implement.
A correspondence method is developed for determining optical flow where the primitive motion tokens to be matched between consecutive time frames are regions. The computation of optical flow consists of three stages: ...
详细信息
ISBN:
(纸本)081861952x
A correspondence method is developed for determining optical flow where the primitive motion tokens to be matched between consecutive time frames are regions. The computation of optical flow consists of three stages: region extraction, region matching, and optical flow smoothing. For region extraction, in each image frame the regions are extracted either from the sign of the bandpass operator or by thresholding the output of morphological image transformations for peak/valley detection. For region matching, a general correspondence approach is applied to region tokens by using an affinity measure based on region features. Optical flow is then identified as the spatial vector displacements among centroids of corresponding regions. The computation is completed by smoothing the initial optical flow, where the sparse velocity data are either a smoothed with a vector median filter or interpolated to obtain dense velocity estimates by using a motion-coherence regularization. The proposed region-based method for optical flow is simple, computationally efficient, and (as experiments on real images indicate) more robust than iterative gradient methods, especially for medium-range motion.
A scheme is developed to match range images in an environment where distinctive features are scarce. When each image overlaps with several other images, the match must also be performed at the global level. This is pa...
详细信息
ISBN:
(纸本)081861952x
A scheme is developed to match range images in an environment where distinctive features are scarce. When each image overlaps with several other images, the match must also be performed at the global level. This is particularly challenging, because of the possibility of bending and compression in range images (i.e., the relative position of data points on the image reference surface may be inaccurate). The primitives used for local matching contours of constant range which are extracted from data are represented by means of a modified chain-code method. All best matches of pairs of contours are considered tentative until their geometrical implications are evaluated and a consistent majority has emerged. To do global matching a cost function is constructed and minimized. Terms contributing to the cost include violation of local matches as well as compression and bending in range images. The present global scheme is valid for any set of multiple overlapping range images, they contain distinctive features or not. This scheme has been used to map the floor of the ocean, where the range data are obtained by a multibeam echo-sounder system.
Interpolation of X-ray motion pictures of the heart (cineventiculograms of the left ventricle) is complicated by the low contrast of the images and the elastic motion of the heart. Here, the problem of placing the hea...
详细信息
ISBN:
(纸本)081861952x
Interpolation of X-ray motion pictures of the heart (cineventiculograms of the left ventricle) is complicated by the low contrast of the images and the elastic motion of the heart. Here, the problem of placing the heart boundary in each frame of the motion sequence is described by a framework for the application of knowledge in the form of diagnostically relevant models of the heart in motion. A blackboard architecture is utilized as a basis for the image interpretation. In this architecture, local features such as edges are grouped to build a complete description of the moving heart;the knowledge is organized in a hierarchy with knowledge sources (KSs) operating on different levels of the hierarchy and opportunistic problem-solving techniques are used to control the order of activation of both data-directed and goal-driven sources. A series of experiments show how the extracted edge points are linked to form boundary fragments, how these overlapping fragments are collected and combined to form a larger fragment with higher confidence, how the models of the left ventricle boundaries are derived, how these fragments are matched against the models, and how the boundary movements are tracked in the image sequence.
The problem of estimating motion and structure of a rigid scene from two perspective monocular views is studied. The optimization approach presented is motivated by the following observations of linear algorithms: (1)...
详细信息
ISBN:
(纸本)081861952x
The problem of estimating motion and structure of a rigid scene from two perspective monocular views is studied. The optimization approach presented is motivated by the following observations of linear algorithms: (1) for certain types of motion, even pixel-level perturbations (such as digitization noise) may override the information characterized by epipolar constraint;(2) existing linear algorithms do not use the constraints in the essential parameter matrix E in solving for this matrix. The authors present approaches to estimating errors in the optimal solutions, investigate the theoretical lower bounds on the errors in the solutions and compare them with actual errors, and analyze two types of algorithms of optimization: batch and sequential. The analysis and experiments show that, in general, a batch technique performs better than a sequential technique for any nonlinear problems. A recursive batch processing technique is proposed for nonlinear problems that require recursive estimation.
A unified approach for modeling objects which are imaged by thermal (infrared) and visual cameras is presented. The model supports the generation of both infrared (8-μm-12-μm wavelength) images and monochrome visual...
详细信息
ISBN:
(纸本)081861952x
A unified approach for modeling objects which are imaged by thermal (infrared) and visual cameras is presented. The model supports the generation of both infrared (8-μm-12-μm wavelength) images and monochrome visual images under different viewing and ambient-scene conditions. A modified octree data structure is used for object modeling. The octree serves two different purposes: (1) surface information encoded in boundary nodes and efficient tree-traversal algorithms facilitate the generation of monochrome visual images;and (2) the compact volumetric representation facilitates simulation of heat flow in the object which gives rise to surface temperature variation, which in turn is used to synthesize the thermal image. The detailed object model allows for more accurate prediction of thermal and visual images of objects. It also predicts the values of discriminatory features used in classification. The model developed is designed to be used in a model-based vision system which uses a hypothesize-and-verify strategy to interpret thermal and visual images of scenes. Several blocks-world examples are presented to show typical images generated by the approach.
A generalized neighborhood concept is presented which extends the usual techniques for feature extraction using parameter transforms. Generalized neighborhoods allow operators to use the joint information contained in...
详细信息
ISBN:
(纸本)081861952x
A generalized neighborhood concept is presented which extends the usual techniques for feature extraction using parameter transforms. Generalized neighborhoods allow operators to use the joint information contained in distant portions of the same feature;i.e., to utilize the long-distance correlation present in the image. The generalized neighborhood techniques, by correlating local information over different portions of the image, produce up to two orders of magnitude improvement in accuracy over conventional techniques. Unfortunately, the response also becomes more complicated;false features may be detected due to a peculiar form of correlated noise. A general framework, motivated by connectionist networks, is presented which eliminates this behavior by introducing competitive processes in the parameter spaces. A novel approach to the generation of lateral inhibition links in the networks is proposed which is consistent with generalized neighborhoods. Experiments are provided that show results on range data. Complex surfaces and 3-D surface-intersection curves are reconstructed from the data.
暂无评论