Kalle Åström

Kalle Åström

Auto-generated profile, based on publicly available information

Kalle Åström

Lund University

Research Focus & Metrics

Academic Career Length

34Years (1993-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 December 2013
Verified
Conference Paper
Closed access
YZYinqiang Zheng
Yinqiang Zheng
YKYubin Kuang
Yubin Kuang
SSShigeki Sugimoto
Shigeki Sugimoto
KAKalle Astrom
Kalle Astrom
MOMasatoshi Okutomi
Masatoshi Okutomi
In this paper, we revisit the classical perspective-n-point (PnP) problem, and propose the first non-iterative O(n) solution that is fast, generally applicable and globally optimal. Our basic idea is to formulate the PnP problem into a functional minimization problem and retrieve all its stationary points by using the Gr"obner basis technique. The novelty lies in a non-unit quaternion representation to parameterize the rotation and a simple but elegant formulation of the PnP problem into an unconstrained optimization problem. Interestingly, the polynomial system arising from its first-order optimality condition assumes two-fold symmetry, a nice property that can be utilized to improve speed and numerical stability of a Grobner basis solver. Experiment results have demonstrated that, in terms of accuracy, our proposed solution is definitely better than the state-of-the-art O(n) methods, and even comparable with the reprojection error minimization method.

1 July 2017
Verified
Conference Paper
Closed access
VLViktor Larsson
Viktor Larsson
KAKalle Astrom
Kalle Astrom
MOMagnus Oskarsson
Magnus Oskarsson
In this paper we study the problem of automatically generating polynomial solvers for minimal problems. The main contribution is a new method for finding small elimination templates by making use of the syzygies (i.e. the polynomial relations) that exist between the original equations. Using these syzygies we can essentially parameterize the set of possible elimination templates. We evaluate our method on a wide variety of problems from geometric computer vision and show improvement compared to both handcrafted and automatically generated solvers. Furthermore we apply our method on two previously unsolved relative orientation problems.

1 January 1996
Verified
Conference Paper
Closed access
AHA. Heyden
A. Heyden
KAK. Astrom
K. Astrom
A new method for Euclidean reconstruction from sequences of images taken by uncalibrated cameras, with constant intrinsic parameters, is described. Our approach leads to a variant of the so called Kruppa equations. It is shown that it is possible to calculate the intrinsic parameters as well as the Euclidean reconstruction from at least three images. The novelty of our approach is that we build our calculation on a projective reconstruction obtained without the assumption on constant intrinsic parameters. This assumption simplifies the analysis, because a projective reconstruction is already obtained and we need "only" to find the correct Euclidean reconstruction among all possible projective reconstructions.

19 June 2019 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
XLXuhong Li
Xuhong Li
ELErik Leitinger
Erik Leitinger
MOMagnus Oskarsson
Magnus Oskarsson
KAKalle Astrom
Kalle Astrom
FTFredrik Tufvesson
Fredrik Tufvesson

10 September 1997 in Mathematical Methods in the Applied Sciences
Verified
Journal Article
Closed access
PDF file
AHAnders Heyden
Anders Heyden
KÅKalle Åström
Kalle Åström

24 November 2017 in Nanoscale
Verified
Journal Article
Open access
PDF file
ZLZhen Li
Zhen Li
HPHenrik Persson
Henrik Persson
KAKarl Adolfsson
Karl Adolfsson
LALaura Abariute
Laura Abariute
MBMagnus T. Borgström
Magnus T. Borgström
CPChristelle Prinz
Christelle Prinz
The effects of an anticancer drug is reflected in the traction forces of cancer and normal cells, which are measured using vertical nanowires.