| 1. |
- Eriksson, Anders P, et al.
(författare)
-
On the bijectivity of thin-plate splines
- 2012
-
Ingår i: Analysis for Science, Engineering and Beyond, The Tribute Workshop in Honour of Gunnar Sparr held in Lund, May 8-9, 2008. - Berlin, Heidelberg : Springer Berlin Heidelberg. - 9783642202360 - 9783642202353 ; 6, s. 93-141
-
Bokkapitel (övrigt vetenskapligt/konstnärligt)abstract
- The thin-plate spline (TPS) has been widely used in a number of areas such as image warping, shape analysis and scattered data interpolation. Introduced by Bookstein (IEEE Trans. Pattern Anal. Mach. Intell. 11(6):567–585 1989), it is a natural interpolating function in two dimensions, parameterized by a finite number of landmarks. However, even though the thin-plate spline has a very intuitive interpretation as well as an elegant mathematical formulation, it has no inherent restriction to prevent folding, i.e. a non-bijective interpolating function. In this chapter we discuss some of the properties of the set of parameterizations that form bijective thin-plate splines, such as convexity and boundness. Methods for finding sufficient as well as necessary conditions for bijectivity are also presented. The methods are used in two settings (a) to register two images using thin-plate spline deformations, while ensuring bijectivity and (b) group-wise registration of a set of images, while enforcing bijectivity constraints.
|
|
| 2. |
- Karlsson, Johan, et al.
(författare)
-
Shape Modeling by Optimising Description Length Using Gradients and Parameterisation Invariance
- 2012
-
Ingår i: Analysis for Science, Engineering and Beyond, The Tribute Workshop in Honour of Gunnar Sparr held in Lund, May 8-9, 2008. - Berlin, Heidelberg : Springer Berlin Heidelberg. - 9783642202353 - 9783642202360 ; 6, s. 51-91
-
Bokkapitel (övrigt vetenskapligt/konstnärligt)abstract
- In Statistical Shape Modeling, a dense correspondence between the shapes in the training set must be established. Traditionally this has been done by hand, a process that commonly requires a lot of work and is difficult, especially in 3D. In recent years there has been a lot of work on automatic construction of Shape Models. In recent papers (Davies et al., Medical Image Computing and Computer-Assisted Intervention MICCAI’2001, pp. 57–65, 2001; Davies et al., IEEE Trans. Med. Imaging. 21(5):525–537 2002; Kotcheff and Taylor, Med. Image Anal. 2:303–314 1998) Minimum Description Length, (MDL), is used to locate a dense correspondence between shapes. In this paper the gradient of the description length is derived. Using the gradient, MDL is optimised using steepest descent. The optimisation is therefore faster and experiments show that the resulting models are better. To characterise shape properties that are invariant to similarity transformations, it is first necessary to normalise with respect to the similarity transformations. This is normally done using Procrustes analysis. In this paper we propose to align shapes using the MDL criterion. The MDL based algorithm is compared to Procrustes on a number of data sets. It is concluded that there is improvement in generalisation when using MDL to align the shapes. In this paper novel theory to prevent the commonly occurring problem of clustering under correspondence optimisation is also presented. The problem is solved by calculating the covariance matrix of the shapes using a scalar product that is invariant to mutual reparameterisations. An algorithm for implementing the ideas is proposed and compared to Thodberg’s state of the art algorithm for automatic shape modeling. The suggested algorithm is more stable and the resulting models are of higher quality according to the generalisation measure and according to visual inspection of the specificity.
|
|
| 3. |
|
|
| 4. |
- Landgren, Matilda, et al.
(författare)
-
An Automated System for the Detection and Diagnosis of Kidney Lesions in Children from Scintigraphy Images
- 2011
-
Ingår i: Lecture Notes in Computer Science. - Berlin, Heidelberg : Springer Berlin Heidelberg. - 0302-9743 .- 1611-3349. - 9783642212277 - 9783642212260 ; 6688, s. 489-500
-
Konferensbidrag (refereegranskat)abstract
- Designing a system for computer aided diagnosis is a complex procedure requiring an understanding of the biology of the disease, insight into hospital workflow and awareness of available technical solutions. This paper aims to show that a valuable system can be designed for diagnosing kidney lesions in children and adolescents from 99m Tc-DMSA scintigraphy images. We present the chain of analysis and provide a discussion of its performance. On a per-lesion basis, the classification reached an ROC-curve area of 0.96 (sensitivity/specificity e.g. 97%/85%) measured using an independent test group consisting of 56 patients with 730 candidate lesions. We conclude that the presented system for diagnostic support has the potential of increasing the quality of care regarding this type of examination.
|
|
| 5. |
- Ståhl, Daniel, et al.
(författare)
-
Automatic Compartment Modelling and Segmentation for Dynamical Renal Scintigraphies
- 2011
-
Ingår i: Lecture Notes in Computer Science. - Berlin, Heidelberg : Springer Berlin Heidelberg. - 1611-3349 .- 0302-9743. - 9783642212260 - 9783642212277 ; 6688, s. 557-568
-
Konferensbidrag (refereegranskat)abstract
- Time-resolved medical data has important applications in a large variety of medical applications. In this paper we study automatic analysis of dynamical renal scintigraphies. The traditional analysis pipeline for dynamical renal scintigraphies is to use manual or semiautomatic methods for segmentation of pixels into physical compartments, extract their corresponding time-activity curves and then compute the parameters that are relevant for medical assessment. In this paper we present a fully automatic system that incorporates spatial smoothing constraints, compartment modelling and positivity constraints to produce an interpretation of the full time-resolved data. The method has been tested on renal dynamical scintigraphies with promising results. It is shown that the method indeed produces more compact representations, while keeping the residual of fit low. The parameters of the time activity curve, such as peak-time and time for half activity from peak, are compared between the previous semiautomatic method and the method presented in this paper. It is also shown how to obtain new and clinically relevant features using our novel system.
|
|
| 6. |
- Amani, Payam, et al.
(författare)
-
Application of Control Theory to a Commercial Mobile Service Support System
- 2012
-
Ingår i: International Journal on Advances in Telecommunications. - 1942-2601. ; 5:3&4
-
Tidskriftsartikel (refereegranskat)abstract
- The Mobile Service Support system (MSS), which Ericsson AB develops, handles the setup of new subscribers and services into a mobile network. Experience from deployed systems show that traffic monitoring and control of the system will be crucial for handling overload situations that may occur at sudden traffic surges. In this paper we identify and explore some important control challenges for this type of systems. Further, we present analysis and experiments showing some advantages of proposed solutions. First, we develop a load-dependent server model for the system, which is validated in testbed experiments. Further, we propose a control design based on the model, and a method for estimation of response times and arrival rates. The main contribution of this paper is that we show how control theory methods and analysis can be used for commercial telecom systems. Parts of our results have been implemented in commercial products, validating the strength of our work.
|
|
| 7. |
- Ardö, Håkan, et al.
(författare)
-
Bayesian Formulation of Image Patch Matching Using Cross-correlation
- 2012
-
Ingår i: Journal of Mathematical Imaging and Vision. - : Springer Science and Business Media LLC. - 0924-9907 .- 1573-7683. ; 43:1, s. 72-87
-
Tidskriftsartikel (refereegranskat)abstract
- A classical solution for matching two image patches is to use the cross-correlation coefficient. This works well if there is a lot of structure within the patches, but not so well if the patches are close to uniform. This means that some patches are matched with more confidence than others. By estimating this uncertainty, more weight can be put on the confident matches than those that are more uncertain. To enable this two distribution functions for two different cases are used: (i) the correlation between two patches showing the same object but with different lighting conditions and different noise realisations and (ii) the correlation between two unrelated patches.Using these two distributions the patch matching problem is, in this paper, formulated as a binary classification problem. The probability of two patches matching is derived. The model depends on the signal to noise ratio. The noise level is reasonably invariant over time, while the signal level, represented by the amount of structure in the patch or its spatial variance, has to be measured for every frame.A common application where this is useful is feature point matching between different images. Another application is background/foreground segmentation. This paper will concentrate on the latter application. It is shown how the theory can be used to implement a very fast background/foreground segmentation algorithm by transforming the calculations to the DCT-domain and processing a motion-JPEG stream without uncompressing it. This allows the algorithm to be embedded on a 150 MHz ARM based network camera. It is also suggested to use recursive quantile estimation to estimate the background model. This gives very accurate background models even if there is a lot of foreground present during the initialisation of the model.
|
|
| 8. |
- Ask, Erik, et al.
(författare)
-
Exploiting p-Fold Symmetries for Faster Polynomial Equation Solving
- 2012
-
Ingår i: 21st International Conference on Pattern Recognition (ICPR 2012), Proceedings of. - 9784990644116 ; , s. 3232-3235
-
Konferensbidrag (refereegranskat)abstract
- Numerous geometric problems in computer vision in- volve the solution of systems of polynomial equations. This is true for problems with minimal information, but also for finding stationary points for overdetermined problems. The state-of-the-art is based on the use of numerical linear algebra on the large but sparse co- efficient matrix that represents the expanded original equation set. In this paper we present two simplifica- tions that can be used (i) if the zero vector is one of the solutions or (ii) if the equations display certain p- fold symmetries. We evaluate the simplifications on a few example problems and demonstrate that significant speed increases are possible without loosing accuracy.
|
|
| 9. |
- Ask, Erik, et al.
(författare)
-
Minimal Structure and Motion Problems for TOA and TDOA Measurements with Collinearity Constraints
- 2013
-
Ingår i: 2nd International Conference on Pattern Recognition Applications and Methods, Proceedings of. - 9789898565419 ; , s. 425-429
-
Konferensbidrag (refereegranskat)abstract
- Structure from sound can be phrased as the problem of determining the position of a number of microphones and a number of sound sources given only the recorded sounds. In this paper we study minimal structure from sound problems in both TOA (time of arrival) and TDOA (time difference of arrival) settings with collinear constraints on e.g. the microphone positions. Three such minimal cases are analyzed and solved with efficient and numerically stable techniques. An experimental validation of the solvers are performed on both simulated and real data. In the paper we also show how such solvers can be utilized in a RANSAC framework to perform robust matching of sound features and then used as initial estimates in a robust non-linear leastsquares optimization.
|
|
| 10. |
- Burgess, Simon, et al.
(författare)
-
Node Localization in Unsynchronized Time of Arrival Sensor Networks
- 2012
-
Ingår i: 21st International Conference on Pattern Recognition (ICPR 2012), Proceedings of. - 9784990644116 ; , s. 2042-2046
-
Konferensbidrag (refereegranskat)abstract
- We present a method for solving the previously unstudied problem of localizing a set of receivers and directions from transmitters placed far from the receivers, measuring unsynchronized time of arrival data. The same problem is present in node localization of microphone and antenna arrays. The solution algorithm using 5 receivers and 9 transmitters is extended to the overdetermined case in a straightforward manner. Degenerate cases are shown to be when i) the measurement matrix has rank 4 or less or ii) the directions from the transmitters to the receivers lie on an intersection between the unit sphere and another quadric surface. In simulated experiments we explore how sensitive the solution is with respect to different degrees of far field approximations of the transmitters and with respect to noise in the data. Using real data we get a reconstruction of the receivers with a relative error of 14%.
|
|
