A complete scheme for totally unconstrained handwritten word recognition based on a single contextual hidden Markov model (HMM) is proposed. The scheme includes a morphology- and heuristics-based segmentation algorith...
详细信息
A complete scheme for totally unconstrained handwritten word recognition based on a single contextual hidden Markov model (HMM) is proposed. The scheme includes a morphology- and heuristics-based segmentation algorithm and a modified Viterbi algorithm that searches the (l+1)st globally best path based on the previous l best paths. The results of detailed experiments for which the overall recognition rate is up to 89.4% are reported.< >
Given a time sequence of digital images of a high-noise environment, the authors address the problem of detecting pixel-sized, barely discernible moving objects whose positions and trajectories are unknown. The sequen...
详细信息
ISBN:
(纸本)0818608625
Given a time sequence of digital images of a high-noise environment, the authors address the problem of detecting pixel-sized, barely discernible moving objects whose positions and trajectories are unknown. The sequences may be temporally sparse and contain significant frame-to-frame drifting background clutter, as caused by relative motion between the sensor array and natural terrain, ocean, or clouds. A general, two-step approach is presented. First, time correlation and space-varying background structure are removed. The resulting innovations sequence is modeled by an independent and identically distributed (i.i.d.) Gaussian random field. Second, a large, dense set of pixel-sized space-time trajectories are hypothesized and tested in the innovations sequence. The search space, typically containing thousands of trajectories per pixel per image, is organized into a tree structure. A sequential statistical technique, multistage hypothesis testing, optimized for the innovations model, is used to test the multiple hypotheses and prune the tree-structured list of candidate trajectories. This results in an efficient algorithm with analyzable performance and processing.requirements.
A unified approach to boundary perception is presented. The model consists of a hierarchical system which extracts and groups salient features in the image at different spatial scales. In the first stage a Gabor wavel...
详细信息
A unified approach to boundary perception is presented. The model consists of a hierarchical system which extracts and groups salient features in the image at different spatial scales. In the first stage a Gabor wavelet decomposition provides a representation of the image which is orientation selective, has optimal localization properties, and provides a good model for early feature detection. Following this, local competitive interactions are introduced which help in reducing the effects of noise and illumination variations. Scale interactions help in localizing line ends and corners, and play an important role in boundary perception. The final stage groups similar features aiding in boundary completion. Experimental results on detecting edges, texture boundaries, and illusory contours are provided.< >
The restoration of images is an important and widely studied problem in computer vision and imageprocessing. Various image filtering strategies have been effective, but invariably make strong assumptions about the pr...
详细信息
The restoration of images is an important and widely studied problem in computer vision and imageprocessing. Various image filtering strategies have been effective, but invariably make strong assumptions about the properties of the signal and/or degradation. Therefore, these methods typically lack the generality to be easily applied to new applications or diverse image collections. This paper describes a novel unsupervised, information-theoretic, adaptive filter (UINTA) that improves the predictability of pixel intensities from their neighborhoods by decreasing the joint entropy between them. Thus UINTA automatically discovers the statistical properties of the signal and can thereby restore a wide spectrum of images and applications. This paper describes the formulation required to minimize the joint entropy measure, presents several important practical considerations in estimating image-region statistics, and then presents results on both real and synthetic data.
Point symbols on a map represent interesting and significant positional data, such as airports, ski areas and natural parks. Identification of point symbols and finding their positions are important for automatic map ...
详细信息
Aspect-ratio is a fundamental parameter of an imaging system. It determines the extent of nonuniformity in sampling. Video signals guarantee a one-to-one match between the camera lines and the lines in the image buffe...
详细信息
Aspect-ratio is a fundamental parameter of an imaging system. It determines the extent of nonuniformity in sampling. Video signals guarantee a one-to-one match between the camera lines and the lines in the image buffer. The horizontal arrangement of pixels, however. undergoes a resampling due to the digitization process. The vertical spacing between lines is given by the vertical distance of the photo elements on the sensor array. The relationship between the vertical and horizontal spacing is determined by the aspect-ratio. The author proposes a technique that uses power spectrum of the image of two sets of parallel lines to determine the aspect-ratio of the system.< >
A parallel algorithm for detecting dominant points on a digital closed curve is presented. The procedure requires no input parameter and remains reliable even when features of multiple sizes are present on the digital...
详细信息
ISBN:
(纸本)0818608625
A parallel algorithm for detecting dominant points on a digital closed curve is presented. The procedure requires no input parameter and remains reliable even when features of multiple sizes are present on the digital curve. The procedure first determines the region of support for each point based on its local properties, then computes measures of relative significance (e.g., curvature) of each point, and finally detects dominant points by a process of nonmaxima suppression. This procedure leads to an important observation that the performance of dominant points detection depends not only on the accuracy of the measure of significance, but mainly precise determination of the region of support. This solves the fundamental problem of scale factor selection encountered in various dominant point detection algorithms. The inherent nature of scale-space filtering in the procedure is addressed and the performance of the procedure is compared to those of several other dominant point-detection algorithms, using a number of examples.
Shadows provide information that allows inferences to be made about the three-dimensional nature of objects. Essential to those inferences is the ability to identify segments of the shadow boundary that correspond to ...
详细信息
ISBN:
(纸本)0818608625
Shadows provide information that allows inferences to be made about the three-dimensional nature of objects. Essential to those inferences is the ability to identify segments of the shadow boundary that correspond to various portions of the object that has cast the shadow. Entry-exit vertices, that are extremes of the boundary, and tangent to the projection of the light beams, can be identified as junctions of specific segments of the shadow boundary. The authors restrict the analysis to smooth convex bodies, and prove that points of discontinuity of the derivative on the shadow boundary form another set of vertices. These two types of junctions are discussed extensively, and combined into a labeling scheme that can segment the boundary into logically consistent pieces. They include a series of experimental results that depicts the process of labeling as well as the final labeling itself. The authors discuss the possible ambiguities that may arise during the labeling process due to occlusion of one object by another, and show that there is no ambiguity in the cases of occlusion of shadows and of shadows that fall on other objects.
We study the problem of how to detect "interesting objects" appeared in a given image, I. Our approach is to treat it as a function approximation problem based on an over-redundant basis, and also account fo...
详细信息
We study the problem of how to detect "interesting objects" appeared in a given image, I. Our approach is to treat it as a function approximation problem based on an over-redundant basis, and also account for occlusions, where the basis superposition principle is no longer valid. Since the basis (a library of image templates) is over-redundant, there are infinitely many ways to decompose I. We are motivated to select a sparse/compact representation of I, and to account for occlusions and noise. We then study a greedy and iterative "weighted L/sup p/ Matching Pursuit" strategy, with O
A multiple instruction multiple data (MIMD) parallel computing platform built upon a network of TMS320C40/44s (C40/C44) for real-time imageprocessing.of a hierarchical foveal machine vision (HFMV) system is described...
详细信息
A multiple instruction multiple data (MIMD) parallel computing platform built upon a network of TMS320C40/44s (C40/C44) for real-time imageprocessing.of a hierarchical foveal machine vision (HFMV) system is described in this paper. The architecture of the system, the parallel algorithm development environment, and strategies to map tasks into the computing platform are described. The platform supports both static and dynamic computing resource allocation. The performance of the computing platform is illustrated by examples.
暂无评论