liu.seSök publikationer i DiVA
Ändra sökning
Avgränsa sökresultatet
2345678 201 - 250 av 401
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Träffar per sida
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
Markera
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
  • 201.
    Knutsson, Hans
    et al.
    Linköpings universitet, Institutionen för systemteknik, Bildbehandling. Linköpings universitet, Tekniska högskolan.
    Borga, Magnus
    Linköpings universitet, Institutionen för systemteknik, Bildbehandling. Linköpings universitet, Tekniska högskolan.
    Landelius, Tomas
    n/a.
    Learning Canonical Correlations1995Rapport (Övrigt vetenskapligt)
    Abstract [en]

    This paper presents a novel learning algorithm that finds the linear combination of one set of multi-dimensional variates that is the best predictor, and at the same time finds the linear combination of another set which is the most predictable. This relation is known as the canonical correlation and has the property of being invariant with respect to affine transformations of the two sets of variates. The algorithm successively finds all the canonical correlations beginning with the largest one. It is shown that canonical correlations can be used in computer vision to find feature detectors by giving examples of the desired features. When used on the pixel level, the method finds quadrature filters and when used on a higher level, the method finds combinations of filter output that are less sensitive to noise compared to vector averaging.

  • 202.
    Knutsson, Hans
    et al.
    Linköpings universitet, Institutionen för systemteknik, Bildbehandling. Linköpings universitet, Tekniska högskolan.
    Borga, Magnus
    Linköpings universitet, Institutionen för systemteknik, Bildbehandling. Linköpings universitet, Tekniska högskolan.
    Landelius, Tomas
    n/a.
    Learning Multidimensional Signal Processing1998Rapport (Övrigt vetenskapligt)
    Abstract [en]

    This paper presents our general strategy for designing learning machines as well as a number of particular designs. The search for methods allowing a sufficient level of adaptivity are based on two main principles: 1. Simple adaptive local models and 2. Adaptive model distribution. Particularly important concepts in our work is mutual information and canonical correlation. Examples are given on learning feature descriptors, modeling disparity, synthesis of a global 3-mode model and a setup for reinforcement learning of online video coder parameter control.

  • 203.
    Knutsson, Hans
    et al.
    Linköpings universitet, Institutionen för systemteknik, Bildbehandling. Linköpings universitet, Tekniska högskolan.
    Borga, Magnus
    Linköpings universitet, Institutionen för systemteknik, Bildbehandling. Linköpings universitet, Tekniska högskolan.
    Landelius, Tomas
    n/a.
    Learning Multidimensional Signal Processing1998Ingår i: Proceedings of the 14th International Conference on Pattern Recognition, vol 2: Brisbane, Australia, 1998, Vol. II, s. 1416-1420Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper presents our general strategy for designing learning machines as well as a number of particular designs. The search for methods allowing a sufficient level of adaptivity are based on two main principles: 1. Simple adaptive local models and 2. Adaptive model distribution. Particularly important concepts in our work is mutual information and canonical correlation. Examples are given on learning feature descriptors, modeling disparity, synthesis of a global 3-mode model and a setup for reinforcement learning of online video coder parameter control.

  • 204.
    Knutsson, Hans
    et al.
    Linköpings universitet, Institutionen för systemteknik, Bildbehandling. Linköpings universitet, Tekniska högskolan.
    Bårman, Håkan
    n/a.
    Haglund, Leif
    n/a.
    Robust Orientation Estimation in 2D, 3D and 4D Using Tensors1992Ingår i: Proceedings of Second International Conference on Automation, Robotics and Computer Vision, ICARCV'92: Singapore, 1992Konferensbidrag (Refereegranskat)
  • 205.
    Knutsson, Hans E.
    et al.
    Linköpings universitet, Institutionen för medicinsk teknik, Medicinsk informatik. Linköpings universitet, Tekniska högskolan.
    Edholm, Paul
    n/a.
    Granlund, Gösta H.
    Linköpings universitet, Institutionen för systemteknik, Bildbehandling. Linköpings universitet, Tekniska högskolan.
    Petersson, Christer U.
    n/a.
    Ectomography. A New Radiographic Reconstruction Method: I. Theory and Error Estimates1980Ingår i: IEEE Transactions on Biomedical Engineering, ISSN 0018-9294, E-ISSN 1558-2531, Vol. BME--27, nr 11, s. 640-645Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Radiographic technology has advanced considerably during the last years with the advent of reconstruction techniques allowing visualization of slices through the body. In spite of the advantage of computed tomography compared to conventional radiographic methods, there are still some shortcomings with the method If a different section of the body is desired, another recording has to be made, the width of the dice reconstructed is fixed, and a full 1800 view angle is required.

  • 206.
    Knutsson, Hans
    et al.
    Linköpings universitet, Institutionen för systemteknik, Bildbehandling. Linköpings universitet, Tekniska högskolan.
    Edholm, Paul
    n/a.
    Granlund, Gösta H.
    Linköpings universitet, Institutionen för systemteknik, Bildbehandling. Linköpings universitet, Tekniska högskolan.
    Aspects of 3-D Reconstruction by Fourier Techniques1980Ingår i: Digital Signal Processing: eds T. G. Constantinides and V. Cappellini / [ed] V. Cappellini and A.G. Constantinides, London: Academic Press , 1980Kapitel i bok, del av antologi (Refereegranskat)
  • 207.
    Knutsson, Hans
    et al.
    Linköpings universitet, Institutionen för medicinsk teknik, Medicinsk informatik. Linköpings universitet, Tekniska högskolan.
    Granlund, Gösta H.
    Linköpings universitet, Institutionen för systemteknik, Bildbehandling. Linköpings universitet, Tekniska högskolan.
    Fourier Domain Design of Line and Edge Detectors1980Ingår i: Proceedings of the 5th International Conference on Pattern Recognition: Miami, Florida, 1980Konferensbidrag (Refereegranskat)
  • 208.
    Knutsson, Hans
    et al.
    Linköpings universitet, Institutionen för systemteknik, Bildbehandling. Linköpings universitet, Tekniska högskolan.
    Granlund, Gösta H.
    Linköpings universitet, Institutionen för systemteknik, Bildbehandling. Linköpings universitet, Tekniska högskolan.
    Spatio-Temporal Analysis Using Tensors1989Ingår i: Sixth Multidimensional Signal Processing Workshop: Pacific Grove, California, 1989Konferensbidrag (Refereegranskat)
  • 209.
    Knutsson, Hans
    et al.
    Linköpings universitet, Institutionen för systemteknik, Bildbehandling. Linköpings universitet, Tekniska högskolan.
    Granlund, Gösta H.
    Linköpings universitet, Institutionen för systemteknik, Bildbehandling. Linköpings universitet, Tekniska högskolan.
    Texture Analysis Using Two-Dimensional Quadrature Filters1983Ingår i: IEEE Computer Society Workshop on Computer Architecture for Pattern Analysis and Image Database Management - CAPAIDM: Pasadena, 1983Konferensbidrag (Refereegranskat)
  • 210.
    Knutsson, Hans
    et al.
    Linköpings universitet, Institutionen för medicinsk teknik, Medicinsk informatik. Linköpings universitet, Tekniska högskolan.
    Granlund, Gösta H.
    Linköpings universitet, Institutionen för systemteknik, Bildbehandling. Linköpings universitet, Tekniska högskolan.
    Bårman, Håkan
    n/a.
    A Note on Estimation of 4D Orientation1990Ingår i: Proceedings of the SSAB Symposium on Image Analysis: Linköping, 1990, s. 192-195Konferensbidrag (Refereegranskat)
  • 211.
    Knutsson, Hans
    et al.
    Linköpings universitet, Institutionen för medicinsk teknik. Linköpings universitet, Tekniska högskolan.
    Haglund, Leif
    Linköpings universitet, Institutionen för systemteknik, Bildbehandling. Linköpings universitet, Tekniska högskolan.
    Adaptive Filtering1995Ingår i: Signal Processing for Computer Vision / [ed] Gösta H. Grandlund and Hans Knutsson, Dordrecht: Kluwer , 1995, Vol. 2749, s. 309-342Kapitel i bok, del av antologi (Refereegranskat)
    Abstract [en]

    This chapter presents a computationally efficient technique for adaptive filtering of n-dimensional  signals.

    The approach is based on the local signal description given by the orientation tensor discussed in Chapter 6. The adaptive filter output is synthesized as a tensor-controlled weighted summation of shift-invariant filter outputs. Several examples of adaptive filtering in two and three dimensions are given. The chapter contains original results on the extension of the techniques to n dimensions

  • 212.
    Knutsson, Hans
    et al.
    Linköpings universitet, Institutionen för systemteknik, Bildbehandling. Linköpings universitet, Tekniska högskolan.
    Haglund, Leif
    n/a.
    Bårman, Håkan
    n/a.
    A Tensor Based Approach to Structure Analysis and Enhancement in 2D, 3D and 4D1991Ingår i: Workshop Program, Seventh Workshop on Multidimentional Signal Processing: Lake Placid, New York, USA, IEEE Signal Processing Society , 1991Konferensbidrag (Refereegranskat)
  • 213.
    Knutsson, Hans
    et al.
    Linköpings universitet, Institutionen för systemteknik, Bildbehandling. Linköpings universitet, Tekniska högskolan.
    Haglund, Leif
    n/a.
    Bårman, Håkan
    Linköpings universitet, Institutionen för systemteknik, Bildbehandling. Linköpings universitet, Tekniska högskolan.
    Granlund, Gösta H.
    Linköpings universitet, Institutionen för systemteknik, Bildbehandling. Linköpings universitet, Tekniska högskolan.
    A Framework for Anisotropic Adaptive Filtering and Analysis of Image Sequences and Volumes1992Ingår i: Proceedings ICASSP-92: San Fransisco, CA, USA, IEEE , 1992Konferensbidrag (Refereegranskat)
  • 214.
    Knutsson, Hans
    et al.
    Linköpings universitet, Institutionen för medicinsk teknik, Medicinsk informatik. Linköpings universitet, Tekniska högskolan.
    Haglund, Leif
    n/a.
    Granlund, Gösta
    Linköpings universitet, Institutionen för systemteknik, Bildbehandling. Linköpings universitet, Tekniska högskolan.
    Adaptive Filtering of Image Sequences and Volumes1992Ingår i: Proceedings of International Conference on Automation, Robotics and Computer Vision: Singapore, 1992Konferensbidrag (Refereegranskat)
  • 215.
    Knutsson, Hans
    et al.
    Linköpings universitet, Institutionen för medicinsk teknik, Medicinsk informatik. Linköpings universitet, Tekniska högskolan.
    Haglund, Leif
    n/a.
    Granlund, Gösta H.
    Linköpings universitet, Institutionen för systemteknik, Bildbehandling. Linköpings universitet, Tekniska högskolan.
    A New Approach to Image Enhancement Using Tensor Fields1990Ingår i: Proceedings of the PROART Workshop on Vision: Sophia Antipolis, France, 1990, s. 111-115Konferensbidrag (Refereegranskat)
  • 216.
    Knutsson, Hans
    et al.
    Linköpings universitet, Institutionen för medicinsk teknik, Medicinsk informatik. Linköpings universitet, Tekniska högskolan.
    Haglund, Leif
    n/a.
    Granlund, Gösta H.
    Linköpings universitet, Institutionen för systemteknik, Bildbehandling. Linköpings universitet, Tekniska högskolan.
    Tensor Field Controlled Image Sequence Enhancement1990Ingår i: Proceedings of the SSAB Symposium on Image Analysis: Linköping, Sweden, 1990, s. 163-167Konferensbidrag (Refereegranskat)
  • 217.
    Knutsson, Hans
    et al.
    Linköpings universitet, Institutionen för medicinsk teknik, Medicinsk informatik. Linköpings universitet, Tekniska fakulteten. Linköpings universitet, Centrum för medicinsk bildvetenskap och visualisering, CMIV.
    Herberthson, Magnus
    Linköpings universitet, Matematiska institutionen, Matematik och tillämpad matematik. Linköpings universitet, Tekniska fakulteten.
    Westin, Carl-Fredrik
    Linköpings universitet, Institutionen för medicinsk teknik, Medicinsk informatik. Linköpings universitet, Tekniska fakulteten.
    An Iterated Complex Matrix Approach for Simulation and Analysis of Diffusion MRI Processes2015Ingår i: MEDICAL IMAGE COMPUTING AND COMPUTER-ASSISTED INTERVENTION - MICCAI 2015, PT I, SPRINGER INT PUBLISHING AG , 2015, Vol. 9349, s. 61-68Konferensbidrag (Refereegranskat)
    Abstract [en]

    We present a novel approach to investigate the properties of diffusion weighted magnetic resonance imaging (dMRI). The process of restricted diffusion of spin particles in the presence of a magnetic field is simulated by an iterated complex matrix multiplication approach. The approach is based on first principles and provides a flexible, transparent and fast simulation tool. The experiments carried out reveals fundamental features of the dMRI process. A particularly interesting observation is that the induced speed of the local spatial spin angle rate of change is highly shift variant. Hence, the encoding basis functions are not the complex exponentials associated with the Fourier transform as commonly assumed. Thus, reconstructing the signal using the inverse Fourier transform leads to large compartment estimation errors, which is demonstrated in a number of 1D and 2D examples. In accordance with previous investigations the compartment size is under-estimated. More interestingly, however, we show that the estimated shape is likely to be far from the true shape using state of the art clinical MRI scanners.

  • 218.
    Knutsson, Hans
    et al.
    Linköpings universitet, Institutionen för systemteknik, Bildbehandling. Linköpings universitet, Tekniska högskolan.
    Post, B. von
    n/a.
    Granlund, Gösta H.
    Linköpings universitet, Institutionen för systemteknik, Bildbehandling. Linköpings universitet, Tekniska högskolan.
    Optimization of Arithmetic Neighborhood Operations for Image Processing1980Ingår i: Proceedings of the First Scandinavian Conference on Image Analysis: Linköping, Sweden, 1980Konferensbidrag (Refereegranskat)
  • 219.
    Knutsson, Hans
    et al.
    Linköpings universitet, Institutionen för medicinsk teknik, Medicinsk informatik. Linköpings universitet, Tekniska högskolan. Linköpings universitet, Centrum för medicinsk bildvetenskap och visualisering, CMIV.
    Westin, Carl-Fredrik
    Linköpings universitet, Institutionen för medicinsk teknik, Medicinsk informatik. Linköpings universitet, Tekniska högskolan. Harvard Medical School, Laboratory of Mathematics in Imaging (LMI).
    An Information Theoretic Approach to Optimal Q-space Sampling2014Ingår i: ISMRM-ESMRMB 2014, 2014Konferensbidrag (Övrigt vetenskapligt)
  • 220.
    Knutsson, Hans
    et al.
    Linköpings universitet, Centrum för medicinsk bildvetenskap och visualisering, CMIV. Linköpings universitet, Institutionen för medicinsk teknik, Medicinsk informatik. Linköpings universitet, Tekniska högskolan.
    Westin, Carl-Fredrik
    Harvard School of Medicin.
    Charged Containers for Optimal 3D Q-space Sampling2013Ingår i: Proceedings of the International Society for Magnetic Resonance in Medicine annual meeting (ISMRM'13), International Society for Magnetic Resonance in Medicine ( ISMRM ) , 2013Konferensbidrag (Övrigt vetenskapligt)
    Abstract [en]

    Conclusions: We have presented a novel method for generating evenly distributed samples in a part of q-space that can be pre- specified in a general way. We have demonstrated the feasibility for two shapes, a sphere and a cube. The results are interesting from several points of view. There is a market tendency for the samples to group in shells indicating that the present work may provide a preferable alternative to recently proposed shell-interaction schemes [9]. The distributions attained for the cube case are far from Cartesian, this may be an advantage in a sparse reconstruction, e.g. compressed sensing, setting.

  • 221.
    Knutsson, Hans
    et al.
    Linköpings universitet, Institutionen för medicinsk teknik, Medicinsk informatik. Linköpings universitet, Tekniska högskolan. Linköpings universitet, Centrum för medicinsk bildvetenskap och visualisering, CMIV.
    Westin, Carl-Fredrik
    Harvard Medical School, USA .
    From Expected Propagator Distribution to Optimal Q-space Sample Metric2014Ingår i: Medical Image Computing and Computer-Assisted Intervention – MICCAI 2014: 17th International Conference, Boston, MA, USA, September 14-18, 2014, Proceedings, Part III / [ed] Polina Golland, Nobuhiko Hata, Christian Barillot, Joachim Hornegger, Robert Howe, Springer, 2014, s. 217-224Konferensbidrag (Refereegranskat)
    Abstract [en]

    We present a novel approach to determine a local q-space metric that is optimal from an information theoretic perspective with respect to the expected signal statistics. It should be noted that the approach does not attempt to optimize the quality of a pre-defined mathematical representation, the estimator. In contrast, our suggestion aims at obtaining the maximum amount of information without enforcing a particular feature representation.

    Results for three significantly different average propagator distributions are presented. The results show that the optimal q-space metric has a strong dependence on the assumed distribution in the targeted tissue. In many practical cases educated guesses can be made regarding the average propagator distribution present. In such cases the presented analysis can produce a metric that is optimal with respect to this distribution. The metric will be different at different q-space locations and is defined by the amount of additional information that is obtained when adding a second sample at a given offset from a first sample. The intention is to use the obtained metric as a guide for the generation of specific efficient q-space sample distributions for the targeted tissue.

  • 222.
    Knutsson, Hans
    et al.
    Linköpings universitet, Institutionen för systemteknik, Bildbehandling. Linköpings universitet, Tekniska högskolan.
    Westin, Carl-Fredrik
    Linköpings universitet, Institutionen för systemteknik, Bildbehandling. Linköpings universitet, Tekniska högskolan.
    Local Frequency1995Ingår i: Signal Processing for Computer Vision / [ed] Gösta H. Grandlund and Hans Knutsson, Dordrecht: Kluwer , 1995, Vol. 2749, s. 279-295Kapitel i bok, del av antologi (Refereegranskat)
    Abstract [en]

    This chapter deals with the estimation of local frequency and bandwidth. Local frequency is an important concept which provides an indication of the appropriate range of scales for subsequent analysis. A number of one-dimensional and two-dimensional examples of local frequency and bandwidth estimation are given.

  • 223.
    Knutsson, Hans
    et al.
    Linköpings universitet, Institutionen för medicinsk teknik, Medicinsk informatik. Linköpings universitet, Tekniska högskolan. Linköpings universitet, Centrum för medicinsk bildvetenskap och visualisering, CMIV.
    Westin, Carl-Fredrik
    Linköpings universitet, Institutionen för medicinsk teknik, Medicinsk informatik. Linköpings universitet, Tekniska högskolan. Laboratory of Mathematics in Imaging, Brigham and Women’s Hospital, Harvard Medical School, Boston, MA, USA.
    Monomial Phase: A Matrix Representation of Local Phase2014Ingår i: Visualization and Processing of Tensors and Higher Order Descriptors for Multi-Valued Data / [ed] Carl-Fredrik Westin, Anna Vilanova, Bernhard Burgeth, Springer, 2014, s. 37-73Kapitel i bok, del av antologi (Övrigt vetenskapligt)
    Abstract [en]

    Local phase is a powerful concept which has been successfully used in many image processing applications. For multidimensional signals the concept of phase is complex and there is no consensus on the precise meaning of phase. It is, however, accepted by all that a measure of phase implicitly carries a directional reference. We present a novel matrix representation of multidimensional phase that has a number of advantages. In contrast to previously suggested phase representations it is shown to be globally isometric for the simple signal class. The proposed phase estimation approach uses spherically separable monomial filter of orders 0, 1 and 2 which extends naturally to N dimensions. For 2-dimensional simple signals the representation has the topology of a Klein bottle. For 1-dimensional signals the new phase representation reduces to the original definition of amplitude and phase for analytic signals. Traditional phase estimation using quadrature filter pairs is based on the analytic signal concept and requires a pre-defined filter direction. The new monomial local phase representation removes this requirement by implicitly incorporating local orientation. We continue to define a phase matrix product which retains the structure of the phase matrix representation. The conjugate product gives a phase difference matrix in a manner similar to the complex conjugate product of complex numbers. Two motion estimation examples are given to demonstrate the advantages of this approach.

  • 224.
    Knutsson, Hans
    et al.
    Linköpings universitet, Institutionen för systemteknik, Bildbehandling. Linköpings universitet, Tekniska högskolan.
    Westin, Carl-Fredrik
    n/a.
    Normalized and Differential Convolution: Methods for Interpolation and Filtering of Incomplete and Uncertain Data1993Ingår i: CVPR: New York City, USA, IEEE , 1993, s. 515-523Konferensbidrag (Refereegranskat)
  • 225.
    Knutsson, Hans
    et al.
    Linköpings universitet, Institutionen för medicinsk teknik, Medicinsk informatik. Linköpings universitet, Tekniska högskolan.
    Westin, Carl-Fredrik
    n/a.
    Normalized Convolution: Technique for Filtering Incomplete and Uncertain Data1993Konferensbidrag (Refereegranskat)
  • 226.
    Knutsson, Hans
    et al.
    Linköpings universitet, Institutionen för systemteknik, Bildbehandling. Linköpings universitet, Tekniska högskolan.
    Westin, Carl-Fredrik
    n/a.
    Robust Estimation from Sparse Feature Fields1993Ingår i: Proceedings of EC--US Workshop: Amherst, USA, 1993Konferensbidrag (Refereegranskat)
  • 227.
    Knutsson, Hans
    et al.
    Linköpings universitet, Institutionen för medicinsk teknik, Medicinsk informatik. Linköpings universitet, Centrum för medicinsk bildvetenskap och visualisering, CMIV. Linköpings universitet, Tekniska högskolan.
    Westin, Carl-Fredrik
    Harvard School of Medicin.
    Tensor Metrics and Charged Containers for 3D Q-space Sample Distribution2013Ingår i: Medical Image Computing and Computer-Assisted Intervention – MICCAI / [ed] Mori, K., Sakuma, I., Sato, Y., Barillot, C., Navab, N., Springer, 2013, s. 679-686Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper extends Jones’ popular electrostatic repulsion based algorithm for distribution of single-shell Q-space samples in two fundamental ways. The first alleviates the single-shell requirement en- abling full Q-space sampling. Such an extension is not immediately ob- vious since it requires distributing samples evenly in 3 dimensions. The extension is as elegant as it is simple: Add a container volume of the de- sired shape having a constant charge density and a total charge equal to the negative of the sum of the moving point charges. Results for spherical and cubic charge containers are given. The second extension concerns the way distances between sample point are measured. The Q-space samples represent orientation, rather than direction and it would seem appropri- ate to use a metric that reflects this fact, e.g. a tensor metric. To this end we present a means to employ a generalized metric in the optimization. Minimizing the energy will result in a 3-dimensional distribution of point charges that is uniform in the terms of the specified metric. The radi- cally different distributions generated using different metrics pinpoints a fundamental question: Is there an inherent optimal metric for Q-space sampling? Our work provides a versatile tool to explore the role of differ- ent metrics and we believe it will be an important contribution to further the continuing debate and research on the matter.

  • 228.
    Knutsson, Hans
    et al.
    Linköpings universitet, Institutionen för medicinsk teknik, Medicinsk informatik. Linköpings universitet, Tekniska högskolan. Linköpings universitet, Centrum för medicinsk bildvetenskap och visualisering, CMIV.
    Westin, Carl-Fredrik
    Linköpings universitet, Tekniska högskolan. Linköpings universitet, Institutionen för medicinsk teknik, Medicinsk informatik.
    Andersson, Mats
    Linköpings universitet, Institutionen för medicinsk teknik, Medicinsk informatik. Linköpings universitet, Tekniska högskolan. Linköpings universitet, Centrum för medicinsk bildvetenskap och visualisering, CMIV.
    Representing local structure using tensors II2011Ingår i: Proceedings of the 17th Scandinavian conference on Image analysis / [ed] Anders Heyden, Fredrik Kahl, Springer, 2011, s. 545-556Konferensbidrag (Refereegranskat)
    Abstract [en]

    Estimation of local spatial structure has a long history and numerous analysis tools have been developed. A concept that is widely recognized as fundamental in the analysis is the structure tensor. However, precisely what it is taken to mean varies within the research community. We present a new method for structure tensor estimation which is a generalization of many of it's predecessors. The method uses filter sets having Fourier directional responses being monomials of the normalized frequency vector, one odd order sub-set and one even order sub-set. It is shown that such filter sets allow for a particularly simple way of attaining phase invariant, positive semi-definite, local structure tensor estimates. We continue to compare a number of known structure tensor algorithms by formulating them in monomial filter set terms. In conclusion we show how higher order tensors can be estimated using a generalization of the same simple formulation.

  • 229.
    Knutsson, Hans
    et al.
    Linköpings universitet, Institutionen för medicinsk teknik, Medicinsk informatik. Linköpings universitet, Tekniska högskolan.
    Westin, Carl-Fredrik
    Linköpings universitet, Tekniska högskolan. Linköpings universitet, Institutionen för medicinsk teknik, Medicinsk informatik.
    Andersson, Mats
    Linköpings universitet, Institutionen för medicinsk teknik, Medicinsk informatik. Linköpings universitet, Tekniska högskolan.
    Structure Tensor Estimation: Introducing Monomial Quadrature Filter Sets2012Ingår i: New Developments in the Visualization and Processing of Tensor Fields / [ed] David H. Laidlaw, Anna Vilanova, Springer, 2012, s. 3-28Kapitel i bok, del av antologi (Övrigt vetenskapligt)
    Abstract [en]

       "Bringing together key researchers in disciplines ranging from visualization and image processing to applications in structural mechanics, fluid dynamics, elastography, and numerical mathematics, the workshop that generated this edited volume was the third in the successful Dagstuhl series. Its aim, reflected in the quality and relevance of the papers presented, was to foster collaboration and fresh lines of inquiry in the analysis and visualization of tensor fields, which offer a concise model for numerous physical phenomena. Despite their utility, there remains a dearth of methods for studying all but the simplest ones, a shortage the workshops aim to address. Documenting the latest progress and open research questions in tensor field analysis, the chapters reflect the excitement and inspiration generated  by this latest Dagstuhl workshop, held in July 2009. The topics they address range from applications of the analysis of tensor fields to purer research into their mathematical and analytical properties. They show how cooperation and the sharing of ideas and data between those engaged in pure and applied research can open new vistas in the study of tensor fields."--Publisher's website.

  • 230.
    Knutsson, Hans
    et al.
    Linköpings universitet, Institutionen för systemteknik, Bildbehandling. Linköpings universitet, Tekniska högskolan.
    Westin, Carl-Fredrik
    n/a.
    Granlund, Gösta H.
    Linköpings universitet, Tekniska högskolan. Linköpings universitet, Institutionen för systemteknik, Bildbehandling.
    Local Multiscale Frequency and Bandwidth Estimation1994Ingår i: ICIP: Austin, Texas, 1994, s. 36-40Konferensbidrag (Refereegranskat)
  • 231.
    Knutsson, Hans
    et al.
    Linköpings universitet, Institutionen för systemteknik, Bildbehandling. Linköpings universitet, Tekniska högskolan.
    Westin, Carl-Fredrik
    n/a.
    Westelius, Carl-Johan
    n/a.
    Filtering of Uncertain Irregularly Sampled Multidimensional Data1993Ingår i: Twenty-seventh Asilomar Conf. on Signals, Systems & Computers: Pacific Grove, California, USA, 1993, s. 1301-1309Konferensbidrag (Refereegranskat)
  • 232.
    Knutsson, Hans
    et al.
    Linköpings universitet, Institutionen för systemteknik, Bildbehandling. Linköpings universitet, Tekniska högskolan.
    Wilson, Roland
    Linköpings universitet, Institutionen för systemteknik. Linköpings universitet, Tekniska fakulteten. University of Aston, Birmingham B4 7PB, U.K..
    Granlund, Gösta H.
    Linköpings universitet, Institutionen för systemteknik, Bildbehandling. Linköpings universitet, Tekniska högskolan.
    Anisotropic Filtering Controlled by Image Content1981Ingår i: Proceedings of the 2nd Scandinavian Conference on Image Analysis: Finland, 1981, s. 146-151Konferensbidrag (Refereegranskat)
    Abstract [en]

    The related problems of enhancing and restoring noisy images have received a considerable amount of attention in recent years. Restoration methods have generally been based on minimum mean-squared error operations, such as Wiener filtering or recursive filtering. The rather vague title of enhancement has been given to a wide variety of more or less ad-hoc methods, such as median filtering, which have nonetheless been found useful. In mast cases, however, the aim is the same: an improvement of the subjective quality of the image.

  • 233.
    Knutsson, Hans
    et al.
    Linköpings universitet, Institutionen för medicinsk teknik, Medicinsk informatik. Linköpings universitet, Tekniska högskolan.
    Wilson, Roland
    n/a.
    Granlund, Gösta H.
    Linköpings universitet, Institutionen för systemteknik, Bildbehandling. Linköpings universitet, Tekniska högskolan.
    Anisotropic Filtering Operations for Image Enhancement and their Relation to the Visual System1981Ingår i: Proceedings of IEEE Computer Society Conference on Pattern Recognition and Image Processing: Dallas, Texas, 1981Konferensbidrag (Refereegranskat)
  • 234.
    Knutsson, Hans
    et al.
    Linköpings universitet, Institutionen för medicinsk teknik, Medicinsk informatik. Linköpings universitet, Tekniska högskolan.
    Wilson, Roland
    University of Aston.
    Granlund, Gösta H.
    Linköpings universitet, Institutionen för systemteknik, Bildbehandling. Linköpings universitet, Tekniska högskolan.
    Anisotropic Non-Stationary Image Estimation and its Applications: Part I. Restoration of Noisy Images1983Ingår i: IEEE Transactions on Communications, ISSN 0090-6778, E-ISSN 1558-0857, Vol. COM--31, nr 3, s. 388-397Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    A new form of image estimator, which takes account of linear features, is derived using a signal equivalent formulation. The estimator is shown to be a nonstationary linear combination of three stationary estimators. The relation of the estimator to human visual physiology is discussed. A method for estimating the nonstationary control information is described and shown to be effective when the estimation is made from noisy data. A suboptimal approach which is computationally less demanding is presented and used in the restoration of a variety of images corrupted by additive white noise. The results show that the method can improve the quality of noisy images even when the signal-to-noise ratio is very low.

  • 235.
    Knutsson, Hans
    et al.
    Linköpings universitet, Institutionen för medicinsk teknik, Medicinsk informatik. Linköpings universitet, Tekniska högskolan.
    Wilson, Roland
    n/a.
    Granlund, Gösta H.
    Linköpings universitet, Institutionen för systemteknik, Bildbehandling. Linköpings universitet, Tekniska högskolan.
    Content-Dependent Anisotropic Filtering of Images1981Ingår i: Proceedings of International Conference on Digital Signal Processing: Florence, Italy, 1981Konferensbidrag (Refereegranskat)
  • 236.
    Landelius, Tomas
    et al.
    n/a.
    Borga, Magnus
    Linköpings universitet, Institutionen för systemteknik, Bildbehandling. Linköpings universitet, Tekniska högskolan.
    Knutsson, Hans
    Linköpings universitet, Institutionen för systemteknik, Bildbehandling. Linköpings universitet, Tekniska högskolan.
    Reinforcement Learning Trees1996Rapport (Övrigt vetenskapligt)
    Abstract [en]

    Two new reinforcement learning algorithms are presented. Both use a binary tree to store simple local models in the leaf nodes and coarser global models towards the root. It is demonstrated that a meaningful partitioning into local models can only be accomplished in a fused space consisting of both input and output. The first algorithm uses a batch like statistic procedure to estimate the reward functions in the fused space. The second one uses channel coding to represent the output- and input vectors allowing a simple iterative algorithm based on competing subsystems. The behaviors of both algorithms are illustrated in a preliminary experiment.

  • 237.
    Landelius, Tomas
    et al.
    n/a.
    Haglund, Leif
    n/a.
    Knutsson, Hans
    Linköpings universitet, Institutionen för medicinsk teknik, Medicinsk informatik. Linköpings universitet, Tekniska högskolan.
    Depth and Velocity from Orientation Tensor Fields1993Ingår i: SCIA8: Tromso, Norway, 1993Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper presents an algorithm for retrieving depth and velocity by estimating the 3D-orientation in an image sequence under the assumption of pure translation of the camera in a static scene. Quantitative error measurements are presented comparing the proposed algorithm to a gradient based optical flow algorithm.

  • 238.
    Landelius, Tomas
    et al.
    n/a.
    Haglund, Leif
    n/a.
    Knutsson, Hans
    Linköpings universitet, Institutionen för systemteknik, Bildbehandling. Linköpings universitet, Tekniska högskolan.
    Depth and Velocity from Orientation Tensor Fields1993Ingår i: Proceedings of the SSAB Symposium on Image Analysis: Gothenburg, 1993Konferensbidrag (Refereegranskat)
  • 239.
    Landelius, Tomas
    et al.
    n/a.
    Knutsson, Hans
    Linköpings universitet, Institutionen för systemteknik, Bildbehandling. Linköpings universitet, Tekniska högskolan.
    A Dynamic Tree Structure for Incremental Reinforcement Learning of Good Behavior1994Rapport (Övrigt vetenskapligt)
    Abstract [en]

    This paper addresses the idea of learning by reinforcement, within the theory of behaviorism. The reason for this choice is its generality and especially that the reinforcement learning paradigm allows systems to be designed, which can improve their behavior beyond that of their teacher. The role of the teacher is to define the reinforcement function, which acts as a description of the problem the machine is to solve. Gained knowledge is represented by a behavior probability density function which is approximated with a number of normal distributions, stored in the nodes of a binary tree. It is argued that a meaningful partitioning into local models can only be accomplished in a fused space consisting of both stimuli and responses. Given a stimulus, the system searches for responses likely to result in highly reinforced decisions by treating the sum of the two normal distributions on each level in the tree as a distribution describing the system's behavior at that resolution. The resolution of the response, as well as the tree growing and pruning processes, are controlled by a random variable based on the difference in performance between two consecutive levels in the tree. This results in a system that will never be content but will indefinitely continue to search for better solutions.

  • 240.
    Landelius, Tomas
    et al.
    n/a.
    Knutsson, Hans
    Linköpings universitet, Institutionen för systemteknik, Bildbehandling. Linköpings universitet, Tekniska högskolan.
    Behaviorism and Reinforcement Learning1995Ingår i: Proceedings, 2nd Swedish Conference on Connectionism: Skövde, 1995, s. 259-270Konferensbidrag (Refereegranskat)
  • 241.
    Landelius, Tomas
    et al.
    n/a.
    Knutsson, Hans
    Linköpings universitet, Institutionen för systemteknik, Bildbehandling. Linköpings universitet, Tekniska högskolan.
    Greedy adaptive critics for LPQ [dvs LQR] problems: Convergence Proofs1996Rapport (Övrigt vetenskapligt)
    Abstract [en]

    A number of success stories have been told where reinforcement learning has been applied to problems in continuous state spaces using neural nets or other sorts of function approximators in the adaptive critics. However, the theoretical understanding of why and when these algorithms work is inadequate. This is clearly exemplified by the lack of convergence results for a number of important situations. To our knowledge only two such results been presented for systems in the continuous state space domain. The first is due to Werbos and is concerned with linear function approximation and heuristic dynamic programming. Here no optimal strategy can be found why the result is of limited importance. The second result is due to Bradtke and deals with linear quadratic systems and quadratic function approximators. Bradtke's proof is limited to ADHDP and policy iteration techniques where the optimal solution is found by a number of successive approximations. This paper deals with greedy techniques, where the optimal solution is directly aimed for. Convergence proofs for a number of adaptive critics, HDP, DHP, ADHDP and ADDHP, are presented. Optimal controllers for linear quadratic regulation (LQR) systems can be found by standard techniques from control theory but the assumptions made in control theory can be weakened if adaptive critic techniques are employed. The main point of this paper is, however, not to emphasize the differences but to highlight the similarities and by so doing contribute to a theoretical understanding of adaptive critics.

  • 242.
    Landelius, Tomas
    et al.
    Linköpings universitet, Institutionen för systemteknik, Bildbehandling. Linköpings universitet, Tekniska högskolan.
    Knutsson, Hans
    Linköpings universitet, Institutionen för systemteknik, Bildbehandling. Linköpings universitet, Tekniska högskolan.
    Reinforcement Learning Adaptive Control and Explicit Criterion Maximization1996Rapport (Övrigt vetenskapligt)
    Abstract [en]

    This paper reviews an existing algorithm for adaptive control based on explicit criterion maximization (ECM) and presents an extended version suited for reinforcement learning tasks. Furthermore, assumptions under which the algorithm convergences to a local maxima of a long term utility function are given. Such convergence theorems are very rare for reinforcement learning algorithms working with continuous state and action spaces. A number of similar algorithms, previously suggested to the reinforcement learning community, are briefly surveyed in order to give the presented algorithm a place in the field. The relations between the different algorithms is exemplified by checking their consistency on a simple problem of linear quadratic regulation (LQR).

  • 243.
    Landelius, Tomas
    et al.
    n/a.
    Knutsson, Hans
    Linköpings universitet, Institutionen för systemteknik, Bildbehandling. Linköpings universitet, Tekniska högskolan.
    The Learning Tree, A New Concept in Learning1993Ingår i: Proceedings of the 2nd International Conference on Adaptive and Learning Systems, 1993Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this paper learning is considered to be the bootstrapping procedure where fragmented past experience of what to do when performing well is used for generation of new responses adding more information to the system about the environment. The gained knowledge is represented by a behavior probability density function which is decomposed into a number of normal distributions using a binary tree. This tree structure is built by storing highly reinforced stimuli-response combinations, decisions, and calculating their mean decision vector and covariance matrix. Thereafter the decision space is divided, through the mean vector, into two halves along the direction of maximal data variation. The mean vector and the covariance matrix are stored in the tree node and the procedure is repeated recursively for each of the two halves of the decision space forming a binary tree with mean vectors and covariance matrices in its nodes. The tree is the systems guide to response generation. Given a stimuli the system searches for decisions likely to give a high reinforcement. This is accomplished by treating the sum of the normal distributions in the leaves, using their mean vectors and covariance matrices as the distribution parameters, as a distribution describing the systems behavior. A response is generated by fixating the stimuli in this sum of normal distribution and use the resulting distribution, which turns out to be a new sum of normal distributions, for random generation of the response. This procedure will also make it possible for the system to have several equally plausible response to one stimuli when this is appropriate. Not applying maximum likelihood principles will lead to a more explorative system behavior avoiding local minima traps.

  • 244.
    Landelius, Tomas
    et al.
    n/a.
    Knutsson, Hans
    Linköpings universitet, Institutionen för systemteknik, Bildbehandling. Linköpings universitet, Tekniska högskolan.
    Borga, Magnus
    Linköpings universitet, Institutionen för systemteknik, Bildbehandling. Linköpings universitet, Tekniska högskolan.
    On-Line Singular Value Decomposition of Stochastic Process Covariances1995Rapport (Övrigt vetenskapligt)
    Abstract [en]

    This paper presents novel algorithms for finding the singular value decomposition (SVD) of a general covariance matrix by stochastic approximation. General in the sense that also non-square, between sets, covariance matrices are dealt with. For one of the algorithms, convergence is shown using results from stochastic approximation theory. Proofs of this sort, establishing both the point of equilibrium and its domain of attraction, have been reported very rarely for stochastic, iterative feature extraction algorithms.

  • 245.
    Langer, Max
    et al.
    Linköpings universitet, Institutionen för medicinsk teknik. Linköpings universitet, Tekniska högskolan.
    Svensson, Björn
    Linköpings universitet, Institutionen för medicinsk teknik, Medicinsk informatik. Linköpings universitet, Tekniska högskolan. Linköpings universitet, Centrum för medicinsk bildvetenskap och visualisering, CMIV.
    Brun, Anders
    Linköpings universitet, Institutionen för medicinsk teknik, Medicinsk informatik. Linköpings universitet, Tekniska högskolan. Linköpings universitet, Centrum för medicinsk bildvetenskap och visualisering, CMIV.
    Andersson, Mats
    Linköpings universitet, Institutionen för medicinsk teknik, Medicinsk informatik. Linköpings universitet, Tekniska högskolan. Linköpings universitet, Centrum för medicinsk bildvetenskap och visualisering, CMIV.
    Knutsson, Hans
    Linköpings universitet, Institutionen för medicinsk teknik, Medicinsk informatik. Linköpings universitet, Tekniska högskolan. Linköpings universitet, Centrum för medicinsk bildvetenskap och visualisering, CMIV.
    Design of fast multidimensional filters using genetic algorithms2005Ingår i: Applications of Evolutionary Computing: EvoWorkkshops 2005: EvoBIO, EvoCOMNET, EvoHOT, EvoIASP, EvoMUSART, and EvoSTOC Lausanne, Switzerland, March 30 - April 1, 2005 Proceedings, Springer Berlin/Heidelberg, 2005, s. 366-375Konferensbidrag (Refereegranskat)
    Abstract [en]

    A method for designing fast multidimensional filters using genetic algorithms is described. The filter is decomposed into component filters where coefficients can be sparsely scattered using filter networks. Placement of coefficients in the filters is done by genetic algorithms and the resulting filters are optimized using an alternating least squares approach. The method is tested on a 2-D quadrature filter and the method yields a higher quality filter in terms of weighted distortion compared to other efficient implementations that require the same ammount of computations to apply. The resulting filter also yields lower weighted distortion than the full implementation.

  • 246.
    Lindholm, Stefan
    et al.
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Medie- och Informationsteknik. Linköpings universitet, Tekniska högskolan.
    Forsberg, Daniel
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Medie- och Informationsteknik. Linköpings universitet, Centrum för medicinsk bildvetenskap och visualisering, CMIV. Linköpings universitet, Tekniska högskolan.
    Ynnerman, Anders
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Medie- och Informationsteknik. Linköpings universitet, Centrum för medicinsk bildvetenskap och visualisering, CMIV. Linköpings universitet, Tekniska högskolan.
    Knutsson, Hans
    Linköpings universitet, Institutionen för medicinsk teknik. Linköpings universitet, Centrum för medicinsk bildvetenskap och visualisering, CMIV. Linköpings universitet, Tekniska högskolan.
    Andersson, Mats
    Linköpings universitet, Institutionen för medicinsk teknik. Linköpings universitet, Centrum för medicinsk bildvetenskap och visualisering, CMIV. Linköpings universitet, Tekniska högskolan.
    Lundström, Claes
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Medie- och Informationsteknik. Linköpings universitet, Centrum för medicinsk bildvetenskap och visualisering, CMIV. Linköpings universitet, Tekniska högskolan.
    Towards Clinical Deployment of Automated Anatomical Regions-Of-Interest2014Ingår i: Eurographics Workshop on Visual Computing for Biology and Medicine / [ed] Ivan Viola and Katja Buehler and Timo Ropinski, Eurographics - European Association for Computer Graphics, 2014, s. 137-143Konferensbidrag (Refereegranskat)
    Abstract [en]

    The purpose of this work is to investigate, and improve, the feasibility of advanced Region Of Interest (ROI) selection schemes in clinical volume rendering. In particular, this work implements and evaluates an Automated Anatomical ROI (AA-ROI) approach based on the combination of automatic image registration (AIR) and Distance-Based Transfer Functions (DBTFs), designed for automatic selection of complex anatomical shapes without relying on prohibitive amounts of interaction. Domain knowledge and clinical experience has been included in the project through participation of practicing radiologists in all phases of the project. This has resulted in a set of requirements that are critical for Direct Volume Rendering applications to be utilized in clinical practice and a prototype AA-ROI implementation that was developed to addresses critical points in existing solutions. The feasibility of the developed approach was assessed through a study where five radiologists investigated three medical data sets with complex ROIs, using both traditional tools and the developed prototype software. Our analysis indicate that advanced, registration based ROI schemes could increase clinical efficiency in time-critical settings for cases with complex ROIs, but also that their clinical feasibility is conditional with respect to the radiologists trust in the registration process and its application to the data.

  • 247.
    Lindholm, Stefan
    et al.
    Linköpings universitet, Centrum för medicinsk bildvetenskap och visualisering, CMIV. Linköpings universitet, Institutionen för teknik och naturvetenskap, Medie- och Informationsteknik. Linköpings universitet, Tekniska högskolan.
    Jönsson, Daniel
    Linköpings universitet, Centrum för medicinsk bildvetenskap och visualisering, CMIV. Linköpings universitet, Institutionen för teknik och naturvetenskap, Medie- och Informationsteknik. Linköpings universitet, Tekniska högskolan.
    Knutsson, Hans
    Linköpings universitet, Centrum för medicinsk bildvetenskap och visualisering, CMIV. Linköpings universitet, Institutionen för medicinsk teknik, Medicinsk informatik. Linköpings universitet, Tekniska högskolan.
    Ynnerman, Anders
    Linköpings universitet, Centrum för medicinsk bildvetenskap och visualisering, CMIV. Linköpings universitet, Institutionen för teknik och naturvetenskap, Medie- och Informationsteknik. Linköpings universitet, Tekniska högskolan.
    Towards Data Centric Sampling for Volume Rendering2013Ingår i: SIGRAD 2013 / [ed] T. Ropinski and J. Unger, Linköping University Electronic Press , 2013, s. 55-60Konferensbidrag (Refereegranskat)
    Abstract [en]

    We present a new method for sampling the volume rendering integral in volume raycasting where samples are correlated based on transfer function content and data set values. This has two major advantages. First, visual artifacts stemming from structured noise, such as wood grain, can be reduced. Second, we will show that the volume data does not longer need to be available during the rendering phase; a surface representation is used instead, which opens up ample oppurtinities for rendering of large data. We will show that the proposed sampling method gives higher quality renderings with fewer samples when compared to regular sampling in the spatial domain.

  • 248.
    Lundström, C.
    et al.
    Linköpings universitet, Centrum för medicinsk bildvetenskap och visualisering, CMIV.
    Knutsson, H.
    Linköpings universitet, Institutionen för medicinsk teknik, Medicinsk informatik. Linköpings universitet, Tekniska högskolan.
    Automated Histogram Characterization of Data Sets for Image Visualization Using Alpha-Histograms2009Patent (Övrig (populärvetenskap, debatt, mm))
  • 249.
    Lundström, Claes
    et al.
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Visuell informationsteknologi och applikationer. Linköpings universitet, Tekniska högskolan. Linköpings universitet, Centrum för medicinsk bildvetenskap och visualisering, CMIV.
    Ynnerman, Anders
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Visuell informationsteknologi och applikationer. Linköpings universitet, Tekniska högskolan. Linköpings universitet, Centrum för medicinsk bildvetenskap och visualisering, CMIV.
    Ljung, Patric
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Visuell informationsteknologi och applikationer. Linköpings universitet, Tekniska högskolan.
    Persson, Anders
    Linköpings universitet, Institutionen för medicin och hälsa, Medicinsk radiologi. Linköpings universitet, Hälsouniversitetet. Linköpings universitet, Centrum för medicinsk bildvetenskap och visualisering, CMIV.
    Knutsson, Hans
    Linköpings universitet, Institutionen för medicinsk teknik, Medicinsk informatik. Linköpings universitet, Tekniska högskolan. Linköpings universitet, Centrum för medicinsk bildvetenskap och visualisering, CMIV.
    The alpha-histogram: Using Spatial Coherence to Enhance Histograms and Transfer Function Design2006Ingår i: Proceedings Eurographics/IEEE Symposium on Visualization 2006, Lisbon, Portugal, 2006, s. 227-234Konferensbidrag (Övrigt vetenskapligt)
    Abstract [en]

    The high complexity of Transfer Function (TF) design is a major obstacle to widespread routine use of Direct Volume Rendering, particularly in the case of medical imaging. Both manual and automatic TF design schemes would benefit greatly from a fast and simple method for detection of tissue value ranges. To this end, we introduce the a-histogram, an enhancement that amplifies ranges corresponding to spatially coherent materials. The properties of the a-histogram have been explored for synthetic data sets and then successfully used to detect vessels in 20 Magnetic Resonance angiographies, proving the potential of this approach as a fast and simple technique for histogram enhancement in general and for TF construction in particular.

  • 250.
    Läthén, Gunnar
    et al.
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Medie- och Informationsteknik. Linköpings universitet, Tekniska högskolan. Linköpings universitet, Centrum för medicinsk bildvetenskap och visualisering, CMIV.
    Cros, Olivier
    Linköpings universitet, Institutionen för medicinsk teknik, Medicinsk informatik. Linköpings universitet, Tekniska högskolan. Linköpings universitet, Centrum för medicinsk bildvetenskap och visualisering, CMIV.
    Knutsson, Hans
    Linköpings universitet, Institutionen för medicinsk teknik, Medicinsk informatik. Linköpings universitet, Tekniska högskolan. Linköpings universitet, Centrum för medicinsk bildvetenskap och visualisering, CMIV.
    Borga, Magnus
    Linköpings universitet, Institutionen för medicinsk teknik, Medicinsk informatik. Linköpings universitet, Tekniska högskolan. Linköpings universitet, Centrum för medicinsk bildvetenskap och visualisering, CMIV.
    Non-ring Filters for Robust Detection of Linear Structures2010Ingår i: Proceedings of the 20th International Conference on Pattern Recognition, Los Alamitos, CA, USA: IEEE Computer Society, 2010, s. 233-236Konferensbidrag (Refereegranskat)
    Abstract [en]

    Many applications in image analysis include the problem of linear structure detection, e.g. segmentation of blood vessels in medical images, roads in satellite images, etc. A simple and efficient solution is to apply linear filters tuned to the structures of interest and extract line and edge positions from the filter output. However, if the filter is not carefully designed, artifacts such as ringing can distort the results and hinder a robust detection. In this paper, we study the ringing effects using a common Gabor filter for linear structure detection, and suggest a method for generating non-ring filters in 2D and 3D. The benefits of the non-ring design are motivated by results on both synthetic and natural images.

2345678 201 - 250 av 401
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf