SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Luengo Hendriks Cris L. 1974 ) srt2:(2015-2019)"

Sökning: WFRF:(Luengo Hendriks Cris L. 1974 ) > (2015-2019)

  • Resultat 1-5 av 5
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • 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.
  •  
2.
  • Asplund, Teo (författare)
  • Precise Image-Based Measurements through Irregular Sampling
  • 2019
  • Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
    • Mathematical morphology is a theory that is applicable broadly in signal processing, but in this thesis we focus mainly on image data. Fundamental concepts of morphology include the structuring element and the four operators: dilation, erosion, closing, and opening. One way of thinking about the role of the structuring element is as a probe, which traverses the signal (e.g. the image) systematically and inspects how well it "fits" in a certain sense that depends on the operator.Although morphology is defined in the discrete as well as in the continuous domain, often only the discrete case is considered in practice. However, commonly digital images are a representation of continuous reality and thus it is of interest to maintain a correspondence between mathematical morphology operating in the discrete and in the continuous domain. Therefore, much of this thesis investigates how to better approximate continuous morphology in the discrete domain. We present a number of issues relating to this goal when applying morphology in the regular, discrete case, and show that allowing for irregularly sampled signals can improve this approximation, since moving to irregularly sampled signals frees us from constraints (namely those imposed by the sampling lattice) that harm the correspondence in the regular case. The thesis develops a framework for applying morphology in the irregular case, using a wide range of structuring elements, including non-flat structuring elements (or structuring functions) and adaptive morphology. This proposed framework is then shown to better approximate continuous morphology than its regular, discrete counterpart.Additionally, the thesis contains work dealing with regularly sampled images using regular, discrete morphology and weighting to improve results. However, these cases can be interpreted as specific instances of irregularly sampled signals, thus naturally connecting them to the overarching theme of irregular sampling, precise measurements, and mathematical morphology.
  •  
3.
  • 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.
  •  
4.
  • Joffre, Thomas, 1987-, et al. (författare)
  • Characterization of interfacial stress transfer ability in acetylation-treated wood fibre composites using X-ray microtomography
  • 2017
  • Ingår i: Industrial crops and products (Print). - : Elsevier BV. - 0926-6690 .- 1872-633X. ; 95, s. 43-49
  • Tidskriftsartikel (refereegranskat)abstract
    • The properties of the fibre/matrix interface contribute to stiffness, strength and fracture behaviour of fibre-reinforced composites. In cellulosic composites, the limited affinity between the hydrophilic fibres and the hydrophobic thermoplastic matrix remains a challenge, and the reinforcing capability of the fibres is hence not fully utilized. A direct characterisation of the stress transfer ability through pull-out tests on single fibres is extremely cumbersome due to the small dimension of the wood fibres. Here a novel approach is proposed: the length distribution of the fibres sticking out of the matrix at the fracture surface is approximated using X-ray microtomography and is used as an estimate of the adhesion between the fibres and the matrix. When a crack grows in the material, the fibres will either break or be pulled-out of the matrix depending on their adhesion to the matrix: good adhesion between the fibres and the matrix should result in more fibre breakage and less pull-out of the fibres than poor adhesion. The effect of acetylation on the adhesion between the wood fibres and the PLA matrix was evaluated at different moisture contents using the proposed method. By using an acetylation treatment of the fibres it was possible to improve the strength of the composite samples soaked in the water by more than 30%.
  •  
5.
  • Malmberg, Filip, 1980-, et al. (författare)
  • Exact Evaluation of Targeted Stochastic Watershed Cuts
  • 2017
  • Ingår i: Discrete Applied Mathematics. - : Elsevier. - 0166-218X .- 1872-6771. ; 216:2, s. 449-460
  • Tidskriftsartikel (refereegranskat)abstract
    • Seeded segmentation with minimum spanning forests, also known as segmentation by watershed cuts, is a powerful method for supervised image segmentation. Given that correct segmentation labels are provided for a small set of image elements, called seeds, the watershed cut method completes the labeling for all image elements so that the boundaries between different labels are optimally aligned with salient edges in the image. Here, a randomized version of watershed segmentation, the targeted stochastic watershed, is proposed for performing multi-label targeted image segmentation with stochastic seed input. The input to the algorithm is a set of probability density functions (PDFs), one for each segmentation label, defined over the pixels of the image. For each pixel, we calculate the probability that the pixel is assigned a given segmentation label in seeded watershed segmentation with seeds drawn from the input PDFs. We propose an efficient algorithm (quasi-linear with respect to the number of image elements) for calculating the desired probabilities exactly.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-5 av 5

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