Range Image Segmentation for 3-D Object Recognition

Three dimensional scene analysis in an unconstrained and uncontrolled environment is the ultimate goal of computer vision. Explicit depth information about the scene is of tremendous help in segmentation and recognition of objects. Range image interpretation with a view of obtaining low-level features to guide mid-level and high-level segmentation and recognition processes is described. No assumptions about the scene are made and algorithms are applicable to any general single viewpoint range image. Low-level features like step edges and surface characteristics are extracted from the images and segmentation is performed based on individual features as well as combination of features. A high level recognition process based on superquadric fitting is described to demonstrate the usefulness of initial segmentation based on edges. A classification algorithm based on surface curvatures is used to obtain initial segmentation of the scene. Objects segmented using edge information are then classified using surface curvatures. Various applications of surface curvatures in mid and high level recognition processes are discussed. These include surface reconstruction, segmentation into convex patches and detection of smooth edges. Algorithms are run on real range images and results are discussed in detail

Feature Extraction Methods for Character Recognition

Not Include

BEMDEC: An Adaptive and Robust Methodology for Digital Image Feature Extraction

The intriguing study of feature extraction, and edge detection in particular, has, as a result of the increased use of imagery, drawn even more attention not just from the field of computer science but also from a variety of scientific fields. However, various challenges surrounding the formulation of feature extraction operator, particularly of edges, which is capable of satisfying the necessary properties of low probability of error (i.e., failure of marking true edges), accuracy, and consistent response to a single edge, continue to persist. Moreover, it should be pointed out that most of the work in the area of feature extraction has been focused on improving many of the existing approaches rather than devising or adopting new ones. In the image processing subfield, where the needs constantly change, we must equally change the way we think. In this digital world where the use of images, for variety of purposes, continues to increase, researchers, if they are serious about addressing the aforementioned limitations, must be able to think outside the box and step away from the usual in order to overcome these challenges. In this dissertation, we propose an adaptive and robust, yet simple, digital image features detection methodology using bidimensional empirical mode decomposition (BEMD), a sifting process that decomposes a signal into its two-dimensional (2D) bidimensional intrinsic mode functions (BIMFs). The method is further extended to detect corners and curves, and as such, dubbed as BEMDEC, indicating its ability to detect edges, corners and curves. In addition to the application of BEMD, a unique combination of a flexible envelope estimation algorithm, stopping criteria and boundary adjustment made the realization of this multi-feature detector possible. Further application of two morphological operators of binarization and thinning adds to the quality of the operator

Direct occlusion handling for high level image processing algorithms

Many high-level computer vision algorithms suffer in the presence of occlusions caused by multiple objects overlapping in a view. Occlusions remove the direct correspondence between visible areas of objects and the objects themselves by introducing ambiguity in the interpretation of the shape of the occluded object. Ignoring this ambiguity allows the perceived geometry of overlapping objects to be deformed or even fractured. Supplementing the raw image data with a vectorized structural representation which predicts object completions could stabilize high-level algorithms which currently disregard occlusions. Studies in the neuroscience community indicate that the feature points located at the intersection of junctions may be used by the human visual system to produce these completions. Geiger, Pao, and Rubin have successfully used these features in a purely rasterized setting to complete objects in a fashion similar to what is demonstrated by human perception. This work proposes using these features in a vectorized approach to solving the mid-level computer vision problem of object stitching. A system has been implemented which is able extract L and T-junctions directly from the edges of an image using scale-space and robust statistical techniques. The system is sensitive enough to be able to isolate the corners on polygons with 24 sides or more, provided sufficient image resolution is available. Areas of promising development have been identified and several directions for further research are proposed

Analysis of Image Sequence Data with Applications to Two-Dimensional Echocardiography

Digital two-dimensional echocardiography is an ultrasonic imaging technique that is used as an increasingly important noninvasive technique in the comprehensive characterization of the left ventricular structure and function. Quantitative analysis often uses heart wall motion and other shape attributes such as the heart wall thickness, heart chamber area, and the variation of these attributes throughout the cardiac cycle. These analyses require the complete determination of the heart wall boundaries. Poor image quality and large amount of noise makes computer detection of the boundaries difficult. An algorithm to detect both the inner and outer heart wall boundaries is presented. The algorithm was applied to images acquired from animal studies and from a tissue equivalent phantom to verify the performance. Different approaches to exploiting the temporal redundancy of the image data without making use of results from image segmentation and scene interpretation are explored. A new approach to perform image flow analysis is developed based on the Total Least Squares method. The result of this processing is an estimate of the velocities in the image plane. In an image understanding system, information acquired from related domains by other sensors are often useful to the analysis of images. Electrocardiogram signals measure the change of electrical potential changes in the heart muscle an d provide important information such as the timing data for image sequence analysis. These signals are frequently plagued by impulsive muscle noise and background drift due to patient movement. A new approach to solving these problems is presented using mathematical morphology. Experiments addressing various aspects of the problem, such as algorithm performance, choice of operator parameters, and response to sinusoidal inputs, are reported

Pedestrian head detection using automatic scale selection for feature detection and statistical edge curvature analysis

In this report we focus on pedestrian head detection and tracking in video sequences. The task is not trivial in real and complex scenarios where the deformation induced by the perspective field requires a multi-scale analy- sis. Multi-scale shape models for the human head are considered to identify the correct size of the region of interest. Anisotropic diffusion is used as a pre-processing step and edge detection is performed using an automatic scale selection process. A non parametric statistical description is given for the edge curvature and detection is performed by means of goodness-of-fit tests. The head detector is used as a validation tool in a correlation-based tracker. The local maxima of the correlation matrix are analyzed. Tracking is performed associating the displacement vector of the target with that local maximum which maximizes the goodness-of-fit with the distribution of the edge curvature of the head

Global Topology of 3D Symmetric Tensor Fields

There have been recent advances in the analysis and visualization of 3D symmetric tensor fields, with a focus on the robust extraction of tensor field topology. However, topological features such as degenerate curves and neutral surfaces do not live in isolation. Instead, they intriguingly interact with each other. In this paper, we introduce the notion of {\em topological graph} for 3D symmetric tensor fields to facilitate global topological analysis of such fields. The nodes of the graph include degenerate curves and regions bounded by neutral surfaces in the domain. The edges in the graph denote the adjacency information between the regions and degenerate curves. In addition, we observe that a degenerate curve can be a loop and even a knot and that two degenerate curves (whether in the same region or not) can form a link. We provide a definition and theoretical analysis of individual degenerate curves in order to help understand why knots and links may occur. Moreover, we differentiate between wedges and trisectors, thus making the analysis more detailed about degenerate curves. We incorporate this information into the topological graph. Such a graph can not only reveal the global structure in a 3D symmetric tensor field but also allow two symmetric tensor fields to be compared. We demonstrate our approach by applying it to solid mechanics and material science data sets.Comment: IEEE VIS 202

Hierarchical Estimation of Oceanic Surface Velocity Fields From Satellite Imagery.

Oceanic surface velocity fields are objectively estimated from time-sequential satellite images of sea-surface temperature from the Advanced Very High Resolution Radiometey on board the National Oceanic and Atmospheric Administration\u27s polar orbiters. The hierarchical technique uses the concept of image pyramids and multi-resolution grids for increased computational efficiency. Images are Gaussian filtered and sub-sampled from fine to coarse grid scales. The number of pyramid levels is selected such that the maximum expected velocity in the image results in a displacement of less than one pixel at the coarsest spatial scale. Maximum Cross-Correlation at the sub-pixel level with orthogonal polynomial approximation is used to compute a velocity field at each level of the pyramid which is then iterated assuming a locally linear velocity field. The first image at the next finer level of the pyramid is warped towards the second image by the calculated velocity field. At each succeeding finer grid scale, the velocity field is updated and the process repeated. The final result is an estimated velocity at each pixel at the finest resolution of the imagery. There are no free parameters as used in some gradient-based approaches and the only assumption is that the velocity field is locally linear. Test cases are shown using both simulated and real images with numerically simulated velocity fields which demonstrate the accuracy of the technique. Results are compared to gradient-based techniques using concepts of optical flow and projection onto convex sets and to the standard Maximum Cross-Correlation technique. The hierarchical computations for a real satellite image numerically advected by a rotational sheared flow recover the original field with a rms speed error of 12.6% and direction error of 4.9\sp\circ. Hierarchically-estimated velocity fields from real image pairs are compared to ground-truth estimates of the velocity from satellite-tracked drifters in the eastern Gulf of Mexico. Results indicate the technique underestimates daily mean buoy vector speeds, but with reasonably good direction. The problems of ground truth relations to hierarchically computed flows are discussed with regard to mismatches of time and space scales of measurement