SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "AMNE:(NATURVETENSKAP Matematik Diskret matematik) ;lar1:(slu)"

Sökning: AMNE:(NATURVETENSKAP Matematik Diskret matematik) > Sveriges Lantbruksuniversitet

  • Resultat 1-10 av 10
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • 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.
  •  
2.
  • Galindo-Prieto, Beatriz, et al. (författare)
  • A new approach for variable influence on projection (VIP) in O2PLS models
  • 2017
  • Ingår i: Chemometrics and Intelligent Laboratory Systems. - : Elsevier. - 0169-7439 .- 1873-3239. ; 160, s. 110-124
  • Tidskriftsartikel (refereegranskat)abstract
    • A novel variable influence on projection approach for O2PLS® models, named VIPO2PLS, is presented in this paper. VIPO2PLS is a model-based method for judging the importance of variables. Its cornerstone is the 2-way formalism of the O2PLS models; i.e. the use of both predictive and orthogonal normalized loadings of the two modelled data matrices, and also a new weighting system based on the sum of squares of both data blocks (X, Y). The VIPO2PLS algorithm has been tested in one synthetic data set and two real cases, and the outcomes have been compared to the PLS-VIP, VIPOPLS, and i-PLS methods. The purpose is to achieve a sharper and enhanced model interpretation of O2PLS models by using the new VIPO2PLS method for assessing the importance of both X- and Y- variables.
  •  
3.
  • Malmberg, Filip, et al. (författare)
  • An efficient algorithm for exact evaluation of stochastic watersheds
  • 2014
  • Ingår i: Pattern Recognition Letters. - : Elsevier BV. - 0167-8655 .- 1872-7344. ; 47, s. 80-84
  • Tidskriftsartikel (refereegranskat)abstract
    • The stochastic watershed is a method for unsupervised image segmentation proposed by Angulo and Jeulin (2007). The method first computes a probability density function (PDF), assigning to each piece of contour in the image the probability to appear as a segmentation boundary in seeded watershed segmentation with randomly selected seeds. Contours that appear with high probability are assumed to be more important. This PDF is then post-processed to obtain a final segmentation. The main computational hurdle with the stochastic watershed method is the calculation of the PDF. In the original publication by Angulo and Jeulin, the PDF was estimated by Monte Carlo simulation, i.e., repeatedly selecting random markers and performing seeded watershed segmentation. Meyer and Stawiaski (2010) showed that the PDF can be calculated exactly, without performing any Monte Carlo simulations, but do not provide any implementation details. In a naive implementation, the computational cost of their method is too high to make it useful in practice. Here, we extend the work of Meyer and Stawiaski by presenting an efficient (quasi-linear) algorithm for exact computation of the PDF. We demonstrate that in practice, the proposed method is faster than any previously reported method by more than two orders of magnitude. The algorithm is formulated for general undirected graphs, and thus trivially generalizes to images with any number of dimensions.
  •  
4.
  • Curic, Vladimir, et al. (författare)
  • Salience adaptive structuring elements
  • 2012
  • Ingår i: IEEE Journal on Selected Topics in Signal Processing. - 1932-4553 .- 1941-0484. ; 6:7, s. 809-819
  • Tidskriftsartikel (refereegranskat)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. Morphological operators with salience adaptive structuring elements shift edges with high salience to a less extent than those with low salience. Salience adaptive structuring elements are less flexible than morphological amoebas and their shape is less affected by noise in the image. Consequently, morphological operators using salience adaptive structuring elements have better properties.
  •  
5.
  • Luengo, Cris, et al. (författare)
  • Adaptive structuring elements based on salience information
  • 2012
  • Ingår i: Lecture Notes in Computer Science. - Berlin, Heidelberg : Springer Berlin Heidelberg. - 0302-9743 .- 1611-3349. ; 7594, s. 321-328, s. 321-328
  • Konferensbidrag (refereegranskat)abstract
    • Adaptive structuring elements modify their shape and size according to the image content and may outperform fixed structuring elements. Without any restrictions, they suffer from a high computational complexity, which is often higher than linear with respect to the number of pixels in the image. This paper introduces adaptive structuring elements that have predefined shape, but where the size is adjusted to the local image structures. The size of adaptive structuring elements is determined by the salience map that corresponds to the salience of the edges in the image, which can be computed in linear time. We illustrate the difference between the new adaptive structuring elements and morphological amoebas. As an example of its usefulness, we show how the new adaptive morphological operations can isolate the text in historical documents.
  •  
6.
  • Ekström, Magnus, 1966-, et al. (författare)
  • A general measure of skewness
  • 2012
  • Ingår i: Statistics and Probability Letters. - : Elsevier. - 0167-7152 .- 1879-2103. ; 82:8, s. 1559-1568
  • Tidskriftsartikel (refereegranskat)abstract
    • A very general measure of skewness based on the quantiles is introduced, which includes several well-known measures as special cases. Sample versions of our measure may be used as test statistics for testing the hypothesis of symmetry about an unknown value. We provide large sample theory for such a statistic and discuss the asymptotic relative efficiencies of this against some competing test statistics for symmetry.
  •  
7.
  •  
8.
  • Curic, Vladimir, 1981-, et al. (författare)
  • Distance measures between digital fuzzy objects and their applicability in image processing
  • 2011
  • Ingår i: Combinatorial Image Analysis. - Berlin, Heidelberg : Springer Berlin/Heidelberg. - 9783642210723 ; 6636, s. 385-397
  • Konferensbidrag (refereegranskat)abstract
    • We present two different extensions of the Sum of minimal distances and the Complement weighted sum of minimal distances to distances between fuzzy sets. We evaluate to what extent the proposed distances show monotonic behavior with respect to increasing translation and rotation of digital objects, in noise free, as well as in noisy conditions. Tests show that one of the extension approaches leads to distances exhibiting very good performance. Furthermore, we evaluate distance based classification of crisp and fuzzy representations of objects at a range of resolutions. We conclude that the proposed distances are able to utilize the additional information available in a fuzzy representation, thereby leading to improved performance of related image processing tasks.
  •  
9.
  • Dražić, Slobodan, et al. (författare)
  • Precise Estimation of the Projection of a Shape from a Pixel Coverage Representation
  • 2011
  • Ingår i: Proceedings of the 7th IEEE International Symposium on Image and Signal Processing and Analysis (ISPA). - : IEEE Computer Society. - 9781457708411 ; , s. 569-574, s. 569-574
  • Konferensbidrag (refereegranskat)abstract
    • Measuring width and diameter of a shape areproblems well studied in the literature. A pixel coverage repre-sentation is one specific type of digital fuzzy representation of acontinuous image object, where the (membership) value of eachpixel is (approximately) equal to the relative area of the pixelwhich is covered by the continuous object. Lately a number ofmethods for shape analysis use pixel coverage for reducing errorof estimation. We introduce a novel method for estimating theprojection of a shape in a given direction. The method is based onutilizing pixel coverage representation of a shape. Performance ofthe method is evaluated by a number of tests on synthetic objects,confirming high precision and applicability for calculation ofdiameter and elongation of a shape.
  •  
10.
  • Imori, Shinpei, et al. (författare)
  • ON THE MEAN AND DISPERSION OF THE MOORE-PENROSE GENERALIZED INVERSE OF A WISHART MATRIX
  • 2020
  • Ingår i: The Electronic Journal of Linear Algebra. - : INT LINEAR ALGEBRA SOC. - 1537-9582 .- 1081-3810. ; 36, s. 124-133
  • Tidskriftsartikel (refereegranskat)abstract
    • The Moore-Penrose inverse of a singular Wishart matrix is studied. When the scale matrix equals the identity matrix the mean and dispersion matrices of the Moore-Penrose inverse are known. When the scale matrix has an arbitrary structure no exact results are available. The article complements the existing literature by deriving upper and lower bounds for the expectation and an upper bound for the dispersion of the Moore-Penrose inverse. The results show that the bounds become large when the number of rows (columns) of the Wishart matrix are close to the degrees of freedom of the distribution.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-10 av 10

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