1,001 research outputs found

    Data analysis using scale-space filtering and Bayesian probabilistic reasoning

    Get PDF
    This paper describes a program for analysis of output curves from Differential Thermal Analyzer (DTA). The program first extracts probabilistic qualitative features from a DTA curve of a soil sample, and then uses Bayesian probabilistic reasoning to infer the mineral in the soil. The qualifier module employs a simple and efficient extension of scale-space filtering suitable for handling DTA data. We have observed that points can vanish from contours in the scale-space image when filtering operations are not highly accurate. To handle the problem of vanishing points, perceptual organizations heuristics are used to group the points into lines. Next, these lines are grouped into contours by using additional heuristics. Probabilities are associated with these contours using domain-specific correlations. A Bayes tree classifier processes probabilistic features to infer the presence of different minerals in the soil. Experiments show that the algorithm that uses domain-specific correlation to infer qualitative features outperforms a domain-independent algorithm that does not

    Switched-capacitor networks for scale-space generation

    Get PDF
    In scale-space filtering signals are represented at several scales, each conveying different details of the original signal. Every new scale is the result of a smoothing operator on a former scale. In image processing, scale-space filtering is widely used in feature extractors as the Scale-Invariant Feature Transform (SIFT) algorithm. RC networks are posed as valid scale-space generators in focal-plane processing. Switched-capacitor networks are another alternative, as different topologies and switching rate offer a great flexibility. This work examines the parallel and the bilinear implementations as two different switched-capacitor network topologies for scale-space filtering. The paper assesses the validity of both topologies as scale-space generators in focal-plane processing through object detection with the SIFT algorithm.Xunta de Galicia 10PXI206037PRMinisterio de Ciencia e Innovación TEC2009- 12686, TEC2009-11812Office of Naval Research (USA) N00014111031

    Mesoscale monitoring of the soil freeze/thaw boundary from orbital microwave radiometry

    Get PDF
    A technique was developed for mapping the spatial extent of frozen soils from the spectral characteristics of the 10.7 to 37 GHz radiobrightness. Through computational models for the spectral radiobrightness of diurnally heated freesing soils, a distinctive radiobrightness signature was identified for frozen soils, and the signature was cast as a discriminant for unsupervised classification. In addition to large area images, local area spatial averages of radiobrightness were calculated for each radiobrightness channel at 7 meteorologic sites within the test region. Local area averages at the meteorologic sites were used to define the preliminary boundaries in the Freeze Indicator discriminate. Freeze Indicator images based upon Nimbus 7, Scanning Multichannel Microwave Radiometer (SMMR) data effectively map temporal variations in the freeze/thaw pattern for the northern Great Plains at the time scale of days. Diurnal thermal gradients have a small but measurable effect upon the SMMR spectral gradient. Scale-space filtering can be used to improve the spatial resolution of a freeze/thaw classified image

    A spatio-frequency trade-off scale for scale-space filtering

    Full text link

    A network for multiscale image segmentation

    Get PDF
    Detecting edges of objects in their images is a basic problem in computational vision. The scale-space technique introduced by Witkin [11] provides means of using local and global reasoning in locating edges. This approach has a major drawback: it is difficult to obtain accurately the locations of the 'semantically meaningful' edges. We have refined the definition of scale-space, and introduced a class of algorithms for implementing it based on using anisotropic diffusion [9]. The algorithms involves simple, local operations replicated over the image making parallel hardware implementation feasible. In this paper we present the major ideas behind the use of scale space, and anisotropic diffusion for edge detection, we show that anisotropic diffusion can enhance edges, we suggest a network implementation of anisotropic diffusion, and provide design criteria for obtaining networks performing scale space, and edge detection. The results of a software implementation are shown

    Scale-space and edge detection using anisotropic diffusion

    Get PDF
    The scale-space technique introduced by Witkin involves generating coarser resolution images by convolving the original image with a Gaussian kernel. This approach has a major drawback: it is difficult to obtain accurately the locations of the “semantically meaningful” edges at coarse scales. In this paper we suggest a new definition of scale-space, and introduce a class of algorithms that realize it using a diffusion process. The diffusion coefficient is chosen to vary spatially in such a way as to encourage intraregion smoothing in preference to interregion smoothing. It is shown that the “no new maxima should be generated at coarse scales” property of conventional scale space is preserved. As the region boundaries in our approach remain sharp, we obtain a high quality edge detector which successfully exploits global information. Experimental results are shown on a number of images. The algorithm involves elementary, local operations replicated over the image making parallel hardware implementations feasible

    Quantitative analysis of cryo-EM density map segmentation by watershed and scale-space filtering, and fitting of structures by alignment to regions

    Get PDF
    Cryo-electron microscopy produces 3D density maps of molecular machines, which consist of various molecular components such as proteins and RNA. Segmentation of individual components in such maps is a challenging task, and is mostly accomplished interactively. We present an approach based on the immersive watershed method and grouping of the resulting regions using progressively smoothed maps. The method requires only three parameters: the segmentation threshold, a smoothing step size, and the number of smoothing steps. We first apply the method to maps generated from molecular structures and use a quantitative metric to measure the segmentation accuracy. The method does not attain perfect accuracy, however it produces single or small groups of regions that roughly match individual proteins or subunits. We also present two methods for fitting of structures into density maps, based on aligning the structures with single regions or small groups of regions. The first method aligns centers and principal axes, whereas the second aligns centers and then rotates the structure to find the best fit. We describe both interactive and automated ways of using these two methods. Finally, we show segmentation and fitting results for several experimentally-obtained density maps.National Institutes of Health (U.S.) (Grant PN2EY016525)National Institutes of Health (U.S.) (Grant R01GM079429)National Institutes of Health (U.S.) (Grant P41RR02250)National Science Foundation (U.S.) (IIS-0705644
    corecore