205,297 research outputs found

    Recognition of 2-D occluded objects and their manipulation by PUMA 560 robot

    Get PDF
    Journal ArticleA new method based on a cluster-structure paradigm is presented for the recognition of 2-D partially occluded objects. This method uses the line segments which comprise the boundary of an object in the recognition process. The length of each of these segments as well as the angle between successive segments comprise the only information needed by the program to find an object's position. The technique is applied in several steps which include segment clustering, finding all sequences in one pass over the data, and final clustering of sequences so as to obtain the desired rotational and translational information. The amount of computational effort decreases as the recognition algorithm progresses. As compared to earlier methods, which identify an object based on only one sequence of matched segments, the new technique allows the identification of all parts of the model which match with the apparent image. These parts need not be adjacent to each other. Also the method is able to tolerate a moderate change in scale and a significant amount of shape distortion arising as a result of segmentation or the polygonal approximation of the boundary of the object. The method has been evaluated with respect to a large number of examples where several objects partially occlude one another. A summary of the results is presented

    Moving-edge detection via heat flow analogy

    No full text
    In this paper, a new and automatic moving-edge detection algorithm is proposed, based on using the heat flow analogy. This algorithm starts with anisotropic heat diffusion in the spatial domain, to remove noise and sharpen region boundaries for the purpose of obtaining high quality edge data. Then, isotropic and linear heat diffusion is applied in the temporal domain to calculate the total amount of heat flow. The moving-edges are represented as the total amount of heat flow out from the reference frame. The overall process is completed by non-maxima suppression and hysteresis thresholding to obtain binary moving edges. Evaluation, on a variety of data, indicates that this approach can handle noise in the temporal domain because of the averaging inherent of isotropic heat flow. Results also show that this technique can detect moving-edges in image sequences, without background image subtraction

    Perceptually Motivated Shape Context Which Uses Shape Interiors

    Full text link
    In this paper, we identify some of the limitations of current-day shape matching techniques. We provide examples of how contour-based shape matching techniques cannot provide a good match for certain visually similar shapes. To overcome this limitation, we propose a perceptually motivated variant of the well-known shape context descriptor. We identify that the interior properties of the shape play an important role in object recognition and develop a descriptor that captures these interior properties. We show that our method can easily be augmented with any other shape matching algorithm. We also show from our experiments that the use of our descriptor can significantly improve the retrieval rates

    Region-based Skin Color Detection.

    Get PDF
    Skin color provides a powerful cue for complex computer vision applications. Although skin color detection has been an active research area for decades, the mainstream technology is based on the individual pixels. This paper presents a new region-based technique for skin color detection which outperforms the current state-of-the-art pixel-based skin color detection method on the popular Compaq dataset (Jones and Rehg, 2002). Color and spatial distance based clustering technique is used to extract the regions from the images, also known as superpixels. In the first step, our technique uses the state-of-the-art non-parametric pixel-based skin color classifier (Jones and Rehg, 2002) which we call the basic skin color classifier. The pixel-based skin color evidence is then aggregated to classify the superpixels. Finally, the Conditional Random Field (CRF) is applied to further improve the results. As CRF operates over superpixels, the computational overhead is minimal. Our technique achieves 91.17% true positive rate with 13.12% false negative rate on the Compaq dataset tested over approximately 14,000 web images

    Robust similarity registration technique for volumetric shapes represented by characteristic functions

    No full text
    This paper proposes a novel similarity registration technique for volumetric shapes implicitly represented by their characteristic functions (CFs). Here, the calculation of rotation parameters is considered as a spherical crosscorrelation problem and the solution is therefore found using the standard phase correlation technique facilitated by principal components analysis (PCA).Thus, fast Fourier transform (FFT) is employed to vastly improve efficiency and robustness. Geometric moments are then used for shape scale estimation which is independent from rotation and translation parameters. It is numericallydemonstrated that our registration method is able to handle shapes with various topologies and robust to noise and initial poses. Further validation of our method is performed by registering a lung database

    Multi-scale 3-D Surface Description: Open and Closed Surfaces

    Get PDF
    A novel technique for multi-scale smoothing of a free-form 3-D surface is presented. Complete triangulated models of 3-D objects are constructed automatically and using a local parametrization technique, are then smoothed using a 2-D Gaussian filter. Our method for local parametrization makes use of semigeodesic coordinates as a natural and efficient way of sampling the local surface shape. The smoothing eliminates the surface noise together with high curvature regions such as sharp edges, therefore, sharp corners become rounded as the object is smoothed iteratively. Our technique for free-form 3-D multi-scale surface smoothing is independent of the underlying triangulation. It is also argued that the proposed technique is preferrable to volumetric smoothing or level set methods since it is applicable to incomplete surface data which occurs during occlusion. Our technique was applied to closed as well as open 3-D surfaces and the results are presented here
    corecore