liu.seSearch for publications in DiVA
Change search
Refine search result
1 - 11 of 11
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 1.
    Andersson, Thord
    et al.
    Linköping University, Department of Biomedical Engineering. Linköping University, Faculty of Science & Engineering. Linköping University, Center for Medical Image Science and Visualization (CMIV). Dept. of C4ISR, Swedish Defence Research Agency, Linköping, Sweden, .
    Borga, Magnus
    Linköping University, Department of Biomedical Engineering, Division of Biomedical Engineering. Linköping University, Faculty of Science & Engineering. Linköping University, Center for Medical Image Science and Visualization (CMIV).
    Dahlqvist Leinhard, Olof
    Linköping University, Department of Medical and Health Sciences, Division of Radiological Sciences. Linköping University, Faculty of Medicine and Health Sciences. Linköping University, Center for Medical Image Science and Visualization (CMIV). Region Östergötland, Center for Surgery, Orthopaedics and Cancer Treatment, Department of Radiation Physics.
    Geodesic registration for interactive atlas-based segmentation using learned multi-scale anatomical manifolds2018In: Pattern Recognition Letters, ISSN 0167-8655, E-ISSN 1872-7344, Vol. 112, p. 340-345Article in journal (Refereed)
    Abstract [en]

    Atlas-based segmentation is often used to segment medical image regions. For intensity-normalized data, the quality of these segmentations is highly dependent on the similarity between the atlas and the target under the used registration method. We propose a geodesic registration method for interactive atlas-based segmentation using empirical multi-scale anatomical manifolds. The method utilizes unlabeled images together with the labeled atlases to learn empirical anatomical manifolds. These manifolds are defined on distinct scales and regions and are used to propagate the labeling information from the atlases to the target along anatomical geodesics. The resulting competing segmentations from the different manifolds are then ranked according to an image-based similarity measure. We used image volumes acquired using magnetic resonance imaging from 36 subjects. The performance of the method was evaluated using a liver segmentation task. The result was then compared to the corresponding performance of direct segmentation using Dice Index statistics. The method shows a significant improvement in liver segmentation performance between the proposed method and direct segmentation. Furthermore, the standard deviation in performance decreased significantly. Using competing complementary manifolds defined over a hierarchy of region of interests gives an additional improvement in segmentation performance compared to the single manifold segmentation.

  • 2.
    Berg, Amanda
    et al.
    Linköping University, Faculty of Science & Engineering. Linköping University, Department of Electrical Engineering, Computer Vision. Termisk Syst Tekn AB, Diskettgatan 11 B, SE-58335 Linkoping, Sweden.
    Ahlberg, Jörgen
    Linköping University, Department of Electrical Engineering, Computer Vision. Linköping University, Faculty of Science & Engineering. Termisk Syst Tekn AB, Diskettgatan 11 B, SE-58335 Linkoping, Sweden.
    Felsberg, Michael
    Linköping University, Department of Electrical Engineering, Computer Vision. Linköping University, Faculty of Science & Engineering.
    Enhanced analysis of thermographic images for monitoring of district heat pipe networks2016In: Pattern Recognition Letters, ISSN 0167-8655, E-ISSN 1872-7344, Vol. 83, no 2, p. 215-223Article in journal (Refereed)
    Abstract [en]

    We address two problems related to large-scale aerial monitoring of district heating networks. First, we propose a classification scheme to reduce the number of false alarms among automatically detected leakages in district heating networks. The leakages are detected in images captured by an airborne thermal camera, and each detection corresponds to an image region with abnormally high temperature. This approach yields a significant number of false positives, and we propose to reduce this number in two steps; by (a) using a building segmentation scheme in order to remove detections on buildings, and (b) to use a machine learning approach to classify the remaining detections as true or false leakages. We provide extensive experimental analysis on real-world data, showing that this post-processing step significantly improves the usefulness of the system. Second, we propose a method for characterization of leakages over time, i.e., repeating the image acquisition one or a few years later and indicate areas that suffer from an increased energy loss. We address the problem of finding trends in the degradation of pipe networks in order to plan for long-term maintenance, and propose a visualization scheme exploiting the consecutive data collections.

  • 3.
    Danelljan, Martin
    et al.
    Linköping University, Department of Electrical Engineering, Computer Vision. Linköping University, Faculty of Science & Engineering.
    Bhat, Goutam
    Linköping University, Department of Electrical Engineering, Computer Vision. Linköping University, Faculty of Science & Engineering.
    Gladh, Susanna
    Linköping University, Department of Electrical Engineering, Computer Vision. Linköping University, Faculty of Science & Engineering.
    Khan, Fahad Shahbaz
    Linköping University, Department of Electrical Engineering, Computer Vision. Linköping University, Faculty of Science & Engineering.
    Felsberg, Michael
    Linköping University, Department of Electrical Engineering, Computer Vision. Linköping University, Faculty of Science & Engineering.
    Deep motion and appearance cues for visual tracking2019In: Pattern Recognition Letters, ISSN 0167-8655, E-ISSN 1872-7344, Vol. 124, p. 74-81Article in journal (Refereed)
    Abstract [en]

    Generic visual tracking is a challenging computer vision problem, with numerous applications. Most existing approaches rely on appearance information by employing either hand-crafted features or deep RGB features extracted from convolutional neural networks. Despite their success, these approaches struggle in case of ambiguous appearance information, leading to tracking failure. In such cases, we argue that motion cue provides discriminative and complementary information that can improve tracking performance. Contrary to visual tracking, deep motion features have been successfully applied for action recognition and video classification tasks. Typically, the motion features are learned by training a CNN on optical flow images extracted from large amounts of labeled videos. In this paper, we investigate the impact of deep motion features in a tracking-by-detection framework. We also evaluate the fusion of hand-crafted, deep RGB, and deep motion features and show that they contain complementary information. To the best of our knowledge, we are the first to propose fusing appearance information with deep motion features for visual tracking. Comprehensive experiments clearly demonstrate that our fusion approach with deep motion features outperforms standard methods relying on appearance information alone.

  • 4.
    Gustavson, Stefan
    et al.
    Linköping University, Department of Science and Technology, Media and Information Technology. Linköping University, The Institute of Technology.
    Strand, Robin
    Uppsala University, Sweden.
    Anti-aliased Euclidean distance transform2011In: Pattern Recognition Letters, ISSN 0167-8655, E-ISSN 1872-7344, Vol. 32, no 2, p. 252-257Article in journal (Refereed)
    Abstract [en]

    We present a modified distance measure for use with distance transforms of anti-aliased, area sampled grayscale images of arbitrary binary contours. The modified measure can be used in any vector-propagation Euclidean distance transform. Our test implementation in the traditional SSED8 algorithm shows a considerable improvement in accuracy and homogeneity of the distance field compared to a traditional binary image transform. At the expense of a 10x slowdown for a particular image resolution, we achieve an accuracy comparable to a binary transform on a supersampled image with 16 × 16 higher resolution, which would require 256 times more computations and memory.

  • 5.
    Khan, Fahad Shahbaz
    et al.
    Linköping University, Department of Electrical Engineering, Computer Vision. Linköping University, The Institute of Technology.
    Muhammad Anwer, Rao
    Department of Information and Computer Science, Aalto University School of Science, Finland.
    van de Weijer, Joost
    Computer Vision Center, CS Dept. Universitat Autonoma de Barcelona, Spain.
    Felsberg, Michael
    Linköping University, Department of Electrical Engineering, Computer Vision. Linköping University, Center for Medical Image Science and Visualization (CMIV). Linköping University, The Institute of Technology.
    Laaksonen, Jorma
    Department of Information and Computer Science, Aalto University School of Science, Finland.
    Compact color–texture description for texture classification2015In: Pattern Recognition Letters, ISSN 0167-8655, E-ISSN 1872-7344, Vol. 51, p. 16-22Article in journal (Refereed)
    Abstract [en]

    Describing textures is a challenging problem in computer vision and pattern recognition. The classification problem involves assigning a category label to the texture class it belongs to. Several factors such as variations in scale, illumination and viewpoint make the problem of texture description extremely challenging. A variety of histogram based texture representations exists in literature. However, combining multiple texture descriptors and assessing their complementarity is still an open research problem. In this paper, we first show that combining multiple local texture descriptors significantly improves the recognition performance compared to using a single best method alone. This gain in performance is achieved at the cost of high-dimensional final image representation. To counter this problem, we propose to use an information-theoretic compression technique to obtain a compact texture description without any significant loss in accuracy. In addition, we perform a comprehensive evaluation of pure color descriptors, popular in object recognition, for the problem of texture classification. Experiments are performed on four challenging texture datasets namely, KTH-TIPS-2a, KTH-TIPS-2b, FMD and Texture-10. The experiments clearly demonstrate that our proposed compact multi-texture approach outperforms the single best texture method alone. In all cases, discriminative color names outperforms other color features for texture classification. Finally, we show that combining discriminative color names with compact texture representation outperforms state-of-the-art methods by 7.8%,4.3%7.8%,4.3% and 5.0%5.0% on KTH-TIPS-2a, KTH-TIPS-2b and Texture-10 datasets respectively.

  • 6.
    Kruger, N.
    et al.
    Krüger, N., Dept of Computer Science/Engineering, Aalborg University, Niels Bour Vej 8, Esbjerg 6700, Denmark.
    Felsberg, Michael
    Linköping University, The Institute of Technology. Linköping University, Department of Electrical Engineering, Computer Vision.
    An explicit and compact coding of geometric and structural image information applied to stereo processing2004In: Pattern Recognition Letters, ISSN 0167-8655, E-ISSN 1872-7344, Vol. 25, no 8, p. 849-863Article in journal (Refereed)
    Abstract [en]

    We introduce a compact coding of image information in terms of local multi-modal image descriptors. This coding allows for an explicit separation of the local image information into different visual sub-modalities: geometric information (orientation) and structural image information (contrast transition and colour). Based on this image representation, we derive a similarity function that compares visual information in each of these sub-modalities. This allows for an investigation of the importance of the different factors for stereo matching on a large data set. From this investigation we conclude that it is the combination of visual modalities that gives the best results. Concrete weights for their relative importance are measured. In addition to these quantitative results, we can demonstrate by our simulations that although our image representation reduces image information by 97% we achieve a matching performance which is comparable to block matching techniques. This shows that our very condensed representation preserves the relevant visual information. © 2004 Elsevier B.V. All rights reserved.

  • 7.
    Lidayova, Kristina
    et al.
    Uppsala University, Sweden.
    Frimmel, Hans
    Uppsala University, Sweden.
    Wang, Chunliang
    Linköping University, Department of Medical and Health Sciences, Division of Radiological Sciences. Linköping University, Faculty of Medicine and Health Sciences. Linköping University, Center for Medical Image Science and Visualization (CMIV). KTH Royal Institute Technology, Sweden.
    Bengtsson, Ewert
    Uppsala University, Sweden.
    Smedby, Örjan
    Linköping University, Department of Medical and Health Sciences, Division of Radiological Sciences. Linköping University, Faculty of Medicine and Health Sciences. Region Östergötland, Center for Diagnostics, Department of Radiology in Linköping. Linköping University, Center for Medical Image Science and Visualization (CMIV). KTH Royal Institute Technology, Sweden.
    Fast vascular skeleton extraction algorithm2016In: Pattern Recognition Letters, ISSN 0167-8655, E-ISSN 1872-7344, Vol. 76, p. 67-75Article in journal (Refereed)
    Abstract [en]

    Vascular diseases are a common cause of death, particularly in developed countries. Computerized image analysis tools play a potentially important role in diagnosing and quantifying vascular pathologies. Given the size and complexity of modern angiographic data acquisition, fast, automatic and accurate vascular segmentation is a challenging task. In this paper we introduce a fully automatic high-speed vascular skeleton extraction algorithm that is intended as a first step in a complete vascular tree segmentation program. The method takes a 3D unprocessed Computed Tomography Angiography (CTA) scan as input and produces a graph in which the nodes are centrally located artery voxels and the edges represent connections between them. The algorithm works in two passes where the first pass is designed to extract the skeleton of large arteries and the second pass focuses on smaller vascular structures. Each pass consists of three main steps. The first step sets proper parameters automatically using Gaussian curve fitting. In the second step different filters are applied to detect voxels nodes - that are part of arteries. In the last step the nodes are connected in order to obtain a continuous centerline tree for the entire vasculature. Structures found, that do not belong to the arteries, are removed in a final anatomy-based analysis. The proposed method is computationally efficient with an average execution time of 29 s and has been tested on a set of CTA scans of the lower limbs achieving an average overlap rate of 97% and an average detection rate of 71%. (C) 2015 Elsevier B.V. All rights reserved.

  • 8.
    Läthén, Gunnar
    et al.
    Linköping University, Center for Medical Image Science and Visualization, CMIV. Linköping University, Department of Science and Technology, Digital Media. Linköping University, The Institute of Technology.
    Jonasson, Jimmy
    Linköping University, Department of Biomedical Engineering. Linköping University, The Institute of Technology.
    Borga, Magnus
    Linköping University, Department of Biomedical Engineering, Medical Informatics. Linköping University, Center for Medical Image Science and Visualization, CMIV. Linköping University, The Institute of Technology.
    Blood vessel segmentation using multi-scale quadrature filtering2010In: Pattern Recognition Letters, ISSN 0167-8655, E-ISSN 1872-7344, Vol. 31, no 8, p. 762-767Article in journal (Refereed)
    Abstract [en]

    The segmentation of blood vessels is a common problem in medical imagingand various applications are found in diagnostics, surgical planning, trainingand more. Among many dierent techniques, the use of multiple scales andline detectors is a popular approach. However, the typical line lters usedare sensitive to intensity variations and do not target the detection of vesselwalls explicitly. In this article, we combine both line and edge detection usingquadrature lters across multiple scales. The lter result gives well denedvessels as linear structures, while distinct edges facilitate a robust segmentation.We apply the lter output to energy optimization techniques for segmentationand show promising results in 2D and 3D to illustrate the behavior of ourmethod. The conference version of this article received the best paper award inthe bioinformatics and biomedical applications track at ICPR 2008.

  • 9.
    Moreno, Rodrigo
    et al.
    Linköping University, Center for Medical Image Science and Visualization (CMIV). Linköping University, Department of Medical and Health Sciences, Division of Radiological Sciences. Linköping University, Faculty of Health Sciences.
    Koppal, Sandeep
    Linköping University, Department of Medical and Health Sciences, Division of Cardiovascular Medicine. Linköping University, Faculty of Health Sciences.
    de Muinck, Ebo
    Linköping University, Center for Medical Image Science and Visualization (CMIV). Linköping University, Department of Medical and Health Sciences, Division of Cardiovascular Medicine. Linköping University, Faculty of Health Sciences.
    Robust Estimation of Distance Between Sets of Points2013In: Pattern Recognition Letters, ISSN 0167-8655, E-ISSN 1872-7344, Vol. 34, no 16, p. 2192-2198Article in journal (Refereed)
    Abstract [en]

    This paper proposes a new methodology for computing Hausdorff distances between sets of points in a robust way. In a first step, robust nearest neighbor distance distributions between the two sets of points are obtained by considering reliability measures in the computations through a Monte Carlo scheme. In a second step, the computed distributions are operated using random variables algebra in order to obtain probability distributions of the average, minimum or maximum distances. In the last step, different statistics are computed from these distributions. A statistical test of significance, the nearest neighbor index, in addition to the newly proposed divergence and clustering indices are used to compare the computed measurements with respect to values obtained by chance. Results on synthetic and real data show that the proposed method is more robust than the standard Hausdorff distance. In addition, unlike previously proposed methods based on thresholding, it is appropriate for problems that can be modeled through point processes.

  • 10.
    Pernestål, Anna
    et al.
    Linköping University, Department of Electrical Engineering, Vehicular Systems. Linköping University, The Institute of Technology.
    Wettig, Hannes
    Complex Systems Computations Group, Department of Computer Science, Helsinki Institute for Information Technology, Finland.
    Silander, Tomi
    Complex Systems Computations Group, Department of Computer Science, Helsinki Institute for Information Technology, Finland.
    Nyberg, Mattias
    Linköping University, Department of Electrical Engineering, Vehicular Systems. Linköping University, The Institute of Technology.
    Myllymäki, Petri
    Complex Systems Computations Group, Department of Computer Science, Helsinki Institute for Information Technology, Finland.
    A Comparison of Baysian Approaches to Learning in Fault Isolation2009In: Pattern Recognition Letters, ISSN 0167-8655, E-ISSN 1872-7344Article in journal (Other academic)
    Abstract [en]

    Fault isolation is the task of localizing faults in a process, given observations from it. To do this, a model describing the relations between faults and observations is needed.

    In this paper we focus on learning such models both from training data and from prior knowledge. There are several challenges in learning for fault isolation.

    The number of data and the available computing resources are often limited. Furthermore, there may be previously unobserved fault patterns.

    To meet these challenges we take on a Bayesian approach.

    We compare five different approaches to learning for fault isolation, and evaluate their performance on a real application, namely the diagnosis of an automotive engine.

  • 11.
    Peña, Jose M.
    et al.
    Linköping University, Department of Computer and Information Science, Database and information techniques.
    Bjorkegren, J.
    Björkegren, J., Center for Genomics and Bioinformatics, Karolinska Institute, 17177 Stockholm, Sweden.
    Tegnér, Jesper
    Linköping University, The Institute of Technology. Linköping University, Department of Physics, Chemistry and Biology, Computational Biology.
    Learning dynamic Bayesian network models via cross-validation2005In: Pattern Recognition Letters, ISSN 0167-8655, E-ISSN 1872-7344, Vol. 26, no 14, p. 2295-2308Article in journal (Refereed)
    Abstract [en]

    We study cross-validation as a scoring criterion for learning dynamic Bayesian network models that generalize well. We argue that cross-validation is more suitable than the Bayesian scoring criterion for one of the most common interpretations of generalization. We confirm this by carrying out an experimental comparison of cross-validation and the Bayesian scoring criterion, as implemented by the Bayesian Dirichlet metric and the Bayesian information criterion. The results show that cross-validation leads to models that generalize better for a wide range of sample sizes. © 2005 Elsevier B.V. All rights reserved.

1 - 11 of 11
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf