SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Luengo Cris) ;mspu:(conferencepaper)"

Sökning: WFRF:(Luengo Cris) > Konferensbidrag

  • Resultat 1-10 av 26
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Asplund, Teo, et al. (författare)
  • A new approach to mathematical morphology on one dimensional sampled signals
  • 2016
  • Ingår i: Proceedings of the 23rd International Conference on Pattern Recognition ICPR 2016. - Piscataway, NJ : IEEE Communications Society. - 9781509048472 ; , s. 3904-3909
  • Konferensbidrag (refereegranskat)abstract
    • We present a new approach to approximate continuous-domain mathematical morphology operators. The approach is applicable to irregularly sampled signals. We define a dilation under this new approach, where samples are duplicated and shifted according to the flat, continuous structuring element. We define the erosion by adjunction, and the opening and closing by composition. These new operators will significantly increase precision in image measurements. Experiments show that these operators indeed approximate continuous-domain operators better than the standard operators on sampled one-dimensional signals, and that they may be applied to signals using structuring elements smaller than the distance between samples. We also show that we can apply the operators to scan lines of a two-dimensional image to filter horizontal and vertical linear structures.
  •  
2.
  • Asplund, Teo, et al. (författare)
  • Mathematical Morphology on Irregularly Sampled Data Applied to Segmentation of 3D Point Clouds of Urban Scenes
  • 2019
  • Ingår i: International Symposium on Mathematical Morphology and Its Applications to Signal and Image Processing. - Cham : Springer Nature. - 9783030208660 - 9783030208677
  • Konferensbidrag (refereegranskat)abstract
    • This paper proposes an extension of mathematical morphology on irregularly sampled signals to 3D point clouds. The proposed method is applied to the segmentation of urban scenes to show its applicability to the analysis of point cloud data. Applying the proposed operators has the desirable side-effect of homogenizing signals that are sampled heterogeneously. In experiments we show that the proposed segmentation algorithm yields good results on the Paris-rue-Madame database and is robust in terms of sampling density, i.e. yielding similar labelings for more sparse samplings of the same scene.
  •  
3.
  • Asplund, Teo, et al. (författare)
  • Mathematical Morphology on Irregularly Sampled Signals
  • 2017
  • Ingår i: Computer Vision – ACCV 2016 Workshops. - Cham : Springer. - 9783319544267 - 9783319544274 ; , s. 506-520
  • Konferensbidrag (refereegranskat)abstract
    • This paper introduces a new operator that can be used to ap-proximate continuous-domain mathematical morphology on irregularly sampled surfaces. We define a new way of approximating the continuous domain dilation by duplicating and shifting samples according to a flat continuous structuring element. We show that the proposed algorithm can better approximate continuous dilation, and that dilations may be sampled irregularly to achieve a smaller sampling without greatly com-promising the accuracy of the result.
  •  
4.
  • Curic, Vladimir, et al. (författare)
  • Adaptive hit or miss transform
  • 2015
  • Ingår i: Mathematical Morphology and Its Applications to Signal and Image Processing. - Cham : Springer. - 9783319187198 ; , s. 741-752
  • Konferensbidrag (refereegranskat)abstract
    • The Hit or Miss Transform is a fundamental morphological operator, and can be used for template matching. In this paper, we present a framework for adaptive Hit or Miss Transform, where structuring elements are adaptive with respect to the input image itself. We illustrate the difference between the new adaptive Hit or Miss Transform and the classical Hit or Miss Transform. As an example of its usefulness, we show how the new adaptive Hit or Miss Transform can detect particles in single molecule imaging.
  •  
5.
  • Curic, Vladimir, et al. (författare)
  • Adaptive structuring elements based on salience distance transform
  • 2012
  • Ingår i: In Proceedings of Swedish Society for Image Analysis, SSBA 2012. - KTH, Stockholm.
  • Konferensbidrag (övrigt vetenskapligt/konstnärligt)abstract
    • Spatially adaptive structuring elements adjust their shape to the local structures in the image, and are often defined by a ball in a geodesic distance or gray-weighted distance metric space. This paper introduces salience adaptive structuring elements as spatially variant structuring elements that modify not only their shape, but also their size according to the salience of the edges in the image. Consequently they have good properties for filtering.
  •  
6.
  • Curic, Vladimir, et al. (författare)
  • Salience-Based Parabolic Structuring Functions
  • 2013
  • Ingår i: Mathematical Morphology and Its Applications to Signal and Image Processing. - Berlin, Heidelberg : Springer Berlin/Heidelberg. - 9783642382932 ; 7883, s. 183-194
  • Konferensbidrag (refereegranskat)abstract
    • It has been shown that the use of the salience map based on the salience distance transform can be useful for the construction of spatially adaptive structuring elements. In this paper, we propose salience-based parabolic structuring functions that are defined for a fixed, predefined spatial support, and have low computational complexity. In addition, we discuss how to properly define adjunct morphological operators using the new spatially adaptive structuring functions. It is also possible to obtain flat adaptive structuring elements by thresholding the salience-based parabolic structuring functions.
  •  
7.
  • Fakhrzadeh, Azadeh, et al. (författare)
  • Analyzing Tubular Tissue in Histopathological Thin Sections
  • 2012
  • Ingår i: 2012 INTERNATIONAL CONFERENCE ON DIGITAL IMAGE COMPUTING TECHNIQUES AND APPLICATIONS (DICTA). - : IEEE conference proceedings. ; , s. 1-6
  • Konferensbidrag (refereegranskat)abstract
    • We propose a method for automatic segmentation of tubules in the stained thin sections of various tissue types. Tubules consist of one or more layers of cells surrounding a cavity. The segmented tubules can be used to study the morphology of the tissue. Some research has been done to automatically estimate the density of tubules. To the best of our knowledge, no one has been able to, fully automatically, segment the whole tubule. Usually the border between tubules is subtle and appears broken in a straight-forward segmentation. Here we suggest delineating these borders using the geodesic distance transform. We apply this method on images of Periodic Acid Shiffs (PAS) stained thin sections of testicular tissue, delineating 89% of the tubules correctly.
  •  
8.
  •  
9.
  •  
10.
  • Fakhrzadeh, Azadeh, et al. (författare)
  • Epithelial Cell Segmentation in Histological Images of Testicular Tissue Using Graph-Cut
  • 2013
  • Ingår i: Image Analysis and Processing – ICIAP 2013. - Berlin, Heidelberg : Springer Berlin Heidelberg. - 9783642411830 - 9783642411847 ; 8157, s. 201-208
  • Konferensbidrag (refereegranskat)abstract
    • Computerized image processing has provided us with valuable tools for analyzing histology images. However, histology images are complex, and the algorithm which is developed for a data set may not work for a new and unseen data set. The preparation procedure of the tissue before imaging can significantly affect the resulting image. Even for the same staining method, factors like delayed fixation may alter the image quality. In this paper we face the challenging problem of designing a method that works on data sets with strongly varying quality. In environmental research, due to the distance between the site where the wild animals are caught and the laboratory, there is always a delay in fixation. Here we suggest a segmentation method based on the structural information of epithelium cell layer in testicular tissue. The cell nuclei are detected using the fast radial symmetry filter. A graph is constructed on top of the epithelial cells. Graph-cut optimization method is used to cut the links between cells of different tubules. The algorithm is tested on five different groups of animals. Group one is fixed immediately, three groups were left at room temperature for 18, 30 and 42 hours respectively, before fixation. Group five was frozen after 6 hours in room temperature and thawed. The suggested algorithm gives promising results for the whole data set.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-10 av 26

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy