| 1. |
- Alvén, Jennifer, 1989, et al.
(författare)
-
A Deep Learning Approach to MR-less Spatial Normalization for Tau PET Images
- 2019
-
Ingår i: Medical Image Computing and Computer Assisted Intervention : MICCAI 2019 - 22nd International Conference, Proceedings - MICCAI 2019 - 22nd International Conference, Proceedings. - Cham : Springer International Publishing. - 0302-9743 .- 1611-3349. - 9783030322458 - 9783030322441 ; 11765 LNCS, s. 355-363
-
Konferensbidrag (refereegranskat)abstract
- The procedure of aligning a positron emission tomography (PET) image with a common coordinate system, spatial normalization, typically demands a corresponding structural magnetic resonance (MR) image. However, MR imaging is not always available or feasible for the subject, which calls for enabling spatial normalization without MR, MR-less spatial normalization. In this work, we propose a template-free approach to MR-less spatial normalization for [18F]flortaucipir tau PET images. We use a deep neural network that estimates an aligning transformation from the PET input image, and outputs the spatially normalized image as well as the parameterized transformation. In order to do so, the proposed network iteratively estimates a set of rigid and affine transformations by means of convolutional neural network regressors as well as spatial transformer layers. The network is trained and validated on 199 tau PET volumes with corresponding ground truth transformations, and tested on two different datasets. The proposed method shows competitive performance in terms of registration accuracy as well as speed, and compares favourably to previously published results.
|
|
| 2. |
- Alvén, Jennifer, 1989, et al.
(författare)
-
Shape-aware multi-atlas segmentation
- 2016
-
Ingår i: Proceedings - International Conference on Pattern Recognition. - 1051-4651. ; 0, s. 1101-1106
-
Konferensbidrag (refereegranskat)abstract
- Despite of having no explicit shape model, multi-atlas approaches to image segmentation have proved to be a top-performer for several diverse datasets and imaging modalities. In this paper, we show how one can directly incorporate shape regularization into the multi-atlas framework. Unlike traditional methods, our proposed approach does not rely on label fusion on the voxel level. Instead, each registered atlas is viewed as an estimate of the position of a shape model. We evaluate and compare our method on two public benchmarks: (i) the VISCERAL Grand Challenge on multi-organ segmentation of whole-body CT images and (ii) the Hammers brain atlas of MR images for segmenting the hippocampus and the amygdala. For this wide spectrum of both easy and hard segmentation tasks, our experimental quantitative results are on par or better than state-of-the-art. More importantly, we obtain qualitatively better segmentation boundaries, for instance, preserving fine structures.
|
|
| 3. |
- Ask, Erik, et al.
(författare)
-
Tractable and Reliable Registration of 2D Point Sets
- 2014
-
Ingår i: Lecture Notes in Computer Science (Computer Vision - ECCV 2014, 13th European Conference, Zurich, Switzerland, September 6-12, 2014, Proceedings, Part I). - Cham : Springer International Publishing. - 0302-9743 .- 1611-3349. - 9783319105895 - 9783319105901 ; 8689, s. 393-406
-
Konferensbidrag (refereegranskat)abstract
- This paper introduces two new methods of registering 2D point sets over rigid transformations when the registration error is based on a robust loss function. In contrast to previous work, our methods are guaranteed to compute the optimal transformation, and at the same time, the worst-case running times are bounded by a low-degree polynomial in the number of correspondences. In practical terms, this means that there is no need to resort to ad-hoc procedures such as random sampling or local descent methods that cannot guarantee the quality of their solutions. We have tested the methods in several different settings, in particular, a thorough evaluation on two benchmarks of microscopic images used for histologic analysis of prostate cancer has been performed. Compared to the state-of-the-art, our results show that the methods are both tractable and reliable despite the presence of a significant amount of outliers.
|
|
| 4. |
- Bylow, Erik, et al.
(författare)
-
Combining Depth Fusion and Photometric Stereo for Fine-Detailed 3D Models
- 2019
-
Ingår i: Image Analysis - 21st Scandinavian Conference, SCIA 2019, Proceedings. - Cham : Springer International Publishing. - 0302-9743 .- 1611-3349. - 9783030202040 ; 11482 LNCS, s. 261-274
-
Konferensbidrag (refereegranskat)abstract
- In recent years, great progress has been made on the problem of 3D scene reconstruction using depth sensors. On a large scale, these reconstructions look impressive, but often many fine details are lacking due to limitations in the sensor resolution. In this paper we combine two well-known principles for recovery of 3D models, namely fusion of depth images with photometric stereo to enhance the details of the reconstructions. We derive a simple and transparent objective functional that takes both the observed intensity images and depth information into account. The experimental results show that many details are captured that are not present in the input depth images. Moreover, we provide a quantitative evaluation that confirms the improvement of the resulting 3D reconstruction using a 3D printed model.
|
|
| 5. |
- Bylow, Erik, et al.
(författare)
-
Minimizing the maximal rank
- 2016
-
Ingår i: Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition. - 1063-6919. - 9781467388511 ; 2016-January, s. 5887-5895
-
Konferensbidrag (refereegranskat)abstract
- In computer vision, many problems can be formulated as finding a low rank approximation of a given matrix. Ideally, if all elements of the measurement matrix are available, this is easily solved in the L2-norm using factorization. However, in practice this is rarely the case. Lately, this problem has been addressed using different approaches, one is to replace the rank term by the convex nuclear norm, another is to derive the convex envelope of the rank term plus a data term. In the latter case, matrices are divided into sub-matrices and the envelope is computed for each subblock individually. In this paper a new convex envelope is derived which takes all sub-matrices into account simultaneously. This leads to a simpler formulation, using only one parameter to control the trade-of between rank and data fit, for applications where one seeks low rank approximations of multiple matrices with the same rank. We show in this paper how our general framework can be used for manifold denoising of several images at once, as well as just denoising one image. Experimental comparisons show that our method achieves results similar to state-of-the-art approaches while being applicable for other problems such as linear shape model estimation.
|
|
| 6. |
- Bylow, Erik, et al.
(författare)
-
Robust Camera Tracking by Combining Color and Depth Measurements
- 2014
-
Ingår i: International Conference on Pattern Recognition. - 1051-4651.
-
Konferensbidrag (refereegranskat)abstract
- One of the major research areas in computer vision is scene reconstruction from image streams. The advent of RGB-D cameras, such as the Microsoft Kinect, has lead to new possibilities for performing accurate and dense 3D reconstruction. There are already well-working algorithms to acquire 3D models from depth sensors, both for large and small scale scenes. However, these methods often break down when the scene geometry is not so informative, for example, in the case of planar surfaces. Similarly, standard image-based methods fail for texture-less scenes. We combine both color and depth measurements from an RGB-D sensor to simultaneously reconstruct both the camera motion and the scene geometry in a robust manner. Experiments on real data show that we can accurately reconstruct large-scale 3D scenes despite many planar surfaces.
|
|
| 7. |
- Bylow, Erik, et al.
(författare)
-
Robust online 3D reconstruction combining a depth sensor and sparse feature points
- 2016
-
Ingår i: Proceedings - International Conference on Pattern Recognition. - 1051-4651. ; 0, s. 3709-3714, s. 3709-3714
-
Konferensbidrag (refereegranskat)abstract
- Online 3D reconstruction has been an active research area for a long time. Since the release of the Microsoft Kinect Camera and publication of KinectFusion [11] attention has been drawn how to acquire dense models in real-time. In this paper we present a method to make online 3D reconstruction which increases robustness for scenes with little structure information and little texture information. It is shown empirically that our proposed method also increases robustness when the distance between the camera positions becomes larger than what is commonly assumed. Quantitative and qualitative results suggest that this approach can handle situations where other well-known methods fail. This is important in, for example, robotics applications like when the camera position and the 3D model must be created online in real-time.
|
|
| 8. |
- Eriksson, Anders, 1972, et al.
(författare)
-
Rotation Averaging and Strong Duality
- 2018
-
Ingår i: Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition. - 1063-6919. - 9781538664209 ; , s. 127-135
-
Konferensbidrag (refereegranskat)abstract
- In this paper we explore the role of duality principles within the problem of rotation averaging, a fundamental task in a wide range of computer vision applications. In its conventional form, rotation averaging is stated as a minimization over multiple rotation constraints. As these constraints are non-convex, this problem is generally considered challenging to solve globally. We show how to circumvent this difficulty through the use of Lagrangian duality. While such an approach is well-known it is normally not guaranteed to provide a tight relaxation. Based on spectral graph theory, we analytically prove that in many cases there is no duality gap unless the noise levels are severe. This allows us to obtain certifiably global solutions to a class of important non-convex problems in polynomial time. We also propose an efficient, scalable algorithm that out-performs general purpose numerical solvers and is able to handle the large problem instances commonly occurring in structure from motion settings. The potential of this proposed method is demonstrated on a number of different problems, consisting of both synthetic and real-world data.
|
|
| 9. |
- Fredriksson, Johan, et al.
(författare)
-
Fast and Reliable Two-View Translation Estimation
- 2014
-
Ingår i: Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition. - 1063-6919. - 9781479951178 ; , s. 1606-1612
-
Konferensbidrag (refereegranskat)abstract
- It has long been recognized that one of the fundamental difficulties in the estimation of two-view epipolar geometry is the capability of handling outliers. In this paper, we develop a fast and tractable algorithm that maximizes the number of inliers under the assumption of a purely translating camera. Compared to classical random sampling methods, our approach is guaranteed to compute the optimal solution of a cost function based on reprojection errors and it has better time complexity. The performance is in fact independent of the inlier/outlier ratio of the data. This opens up for a more reliable approach to robust ego-motion estimation. Our basic translation estimator can be embedded into a system that computes the full camera rotation. We demonstrate the applicability in several difficult settings with large amounts of outliers. It turns out to be particularly well-suited for small rotations and rotations around a known axis (which is the case for cellular phones where the gravitation axis can be measured). Experimental results show that compared to standard RANSAC methods based on minimal solvers, our algorithm produces more accurate estimates in the presence of large outlier ratios.
|
|
| 10. |
- Fredriksson, Johan, et al.
(författare)
-
Optimal relative pose with unknown correspondences
- 2016
-
Ingår i: Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition. - 1063-6919. - 9781467388511 ; 2016-January, s. 1728-1736
-
Konferensbidrag (refereegranskat)abstract
- Previous work on estimating the epipolar geometry of two views relies on being able to reliably match feature points based on appearance. In this paper, we go one step further and show that it is feasible to compute both the epipolar geometry and the correspondences at the same time based on geometry only. We do this in a globally optimal manner. Our approach is based on an efficient branch and bound technique in combination with bipartite matching to solve the correspondence problem. We rely on several recent works to obtain good bounding functions to battle the combinatorial explosion of possible matchings. It is experimentally demonstrated that more difficult cases can be handled and that more inlier correspondences can be obtained by being less restrictive in the matching phase.
|
|
