default search action
Per-Erik Danielsson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2006
- [j18]Maria Magnusson Seger, Per-Erik Danielsson, J. Sunnegardh:
Handling of Long Objects in Iterative Improvement of Nonexact Reconstruction in Helical Cone-Beam CT. IEEE Trans. Medical Imaging 25(7): 935-940 (2006) - 2003
- [c17]Katarina Flood, Per-Erik Danielsson, Maria Magnusson Seger:
On 3D Scanning, Reconstruction, Enhancement, and Segmentation of Logs. SCIA 2003: 733-740 - [c16]Per-Erik Danielsson, Qingfen Lin:
A Modified Fast Marching Method. SCIA 2003: 1154-1161 - 2001
- [j17]Per-Erik Danielsson, Qingfen Lin, Qin-Zhong Ye:
Efficient Detection of Second-Degree Variations in 2D and 3D Images. J. Vis. Commun. Image Represent. 12(3): 255-305 (2001) - [c15]Qingfen Lin, Per-Erik Danielsson:
Stenosis Detection Using a New Shape Space for Second Order 3D-Variations. IPMI 2001: 388-394 - [c14]Per-Erik Danielsson, Qingfen Lin:
A New Shape Space for Second Order 3D-Variations. IWVF 2001: 145-154 - 2000
- [j16]Henrik Turbell, Per-Erik Danielsson:
Helical cone-beam tomography. Int. J. Imaging Syst. Technol. 11(1): 91-100 (2000)
1990 – 1999
- 1998
- [j15]Anders Åström, Robert Forchheimer, Per-Erik Danielsson:
Intensity mappings within the context of near-sensor image processing. IEEE Trans. Image Process. 7(12): 1736-1741 (1998) - [c13]Per-Erik Danielsson, Qingfen Lin, Qin-Zhong Ye:
Segmentation of 3D volumes using second derivatives. ICPR 1998: 248-251 - 1997
- [j14]Frederik Nilsson, Per-Erik Danielsson:
Finding the Minimal Set of Maximum Disks for Binary Objects. CVGIP Graph. Model. Image Process. 59(1): 55-60 (1997) - 1994
- [c12]Mats Gökstorp, Per-Erik Danielsson:
Velocity Tuned Generalized Sobel Operators for Multiresolution Computation of Optical Flow. ICIP (2) 1994: 765-769 - [c11]Per-Erik Danielsson:
3D Cone-beam Tomography for Non-destructive Testing. MVA 1994: 1-8 - 1992
- [j13]Per-Erik Danielsson, Magnus Hammerin:
High-accuracy rotation of images. CVGIP Graph. Model. Image Process. 54(4): 340-344 (1992) - [c10]Mattias Johannesson, Anders Åström, Per-Erik Danielsson:
An Image Sensor for Sheet-of-Light Range Imaging. MVA 1992: 43-46 - [c9]Sanbao Xu, Per-Erik Danielsson:
Robust Estimation of Focus of Expansion and Depth from High Confidence Optical Flow. MVA 1992: 105-108 - 1990
- [j12]Per-Erik Danielsson, Olle Seger:
Rotation Invariance in Gradient and Higher Order Derivative Detectors. Comput. Vis. Graph. Image Process. 49(2): 198-221 (1990) - [c8]Keping Chen, Per-Erik Danielsson, Anders Åström:
PASIC. A sensor/processor array for computer vision. ASAP 1990: 352-366 - [c7]Keping Chen, Anders Åström, Per-Erik Danielsson:
PASIC: a smart sensor for computer vision. ICPR (2) 1990: 286-291 - [c6]Per-Erik Danielsson, Pär Emanuelsson, Keping Chen, Per Ingelhag, Christer Svensson:
Single-Chip High-Speed Computation of Optical Flow. MVA 1990: 331-336
1980 – 1989
- 1988
- [j11]Qin-Zhong Ye, Per-Erik Danielsson:
Inspection of Printed Circuit Boards by Connectivity Preserving Shrinking. IEEE Trans. Pattern Anal. Mach. Intell. 10(5): 737-742 (1988) - [j10]Qin-Zhong Ye, Per-Erik Danielsson:
On minimum error thresholding and its implementations. Pattern Recognit. Lett. 7(4): 201-206 (1988) - [c5]Per-Erik Danielsson, Qin-Zhong Ye:
Rotation-invariant operators applied to enhancement of fingerprints. ICPR 1988: 329-333 - [c4]Maria Magnusson, Reiner Lenz, Per-Erik Danielsson:
Evaluation of methods for shaded surface display of CT-volumes. ICPR 1988: 1287-1294 - [c3]Per-Erik Danielsson, Björn Lindskog, Jan Segerström:
PICAP 3 - A Coarse-Grain Linear SIMD-Array. MVA 1988: 14-17 - 1987
- [c2]Per-Erik Danielsson:
Natural Basis Functions for Image Analysis. ASST 1987: 239-254 - 1986
- [j9]Reiner Lenz, Björn Gudmundsson, Björn Lindskog, Per-Erik Danielsson:
Display of Density Volumes. IEEE Computer Graphics and Applications 6(7): 20-29 (1986) - 1984
- [j8]Karin Wall, Per-Erik Danielsson:
A fast sequential method for polygonal approximation of digitized curves. Comput. Vis. Graph. Image Process. 28(2): 220-227 (1984) - [j7]Per-Erik Danielsson:
Serial/Parallel Convolvers. IEEE Trans. Computers 33(7): 652-667 (1984) - 1983
- [j6]Per-Erik Danielsson:
On the efficiency of two-bit link chain-code. Pattern Recognit. Lett. 1(4): 227-228 (1983) - [j5]Per-Erik Danielsson:
A Variable-Lengt Shift-Register. IEEE Trans. Computers 32(11): 1067-1069 (1983) - [c1]T. Ericsson, Per-Erik Danielsson:
LIPP-A SIMD Multiprocessor Architecture for Image Processing. ISCA 1983: 395-400 - 1982
- [j4]Per-Erik Danielsson:
An Improved Segmentation and Coding Algorithm for Binary and Nonbinary Images. IBM J. Res. Dev. 26(6): 698-707 (1982) - 1981
- [j3]Per-Erik Danielsson, Stefano Levialdi:
Computer Architectures for Pictorial Information Systems. Computer 14(11): 53-67 (1981)
1970 – 1979
- 1979
- [j2]Vojin M. Plavsic, Per-Erik Danielsson:
Sequential Evaluation of Boolean Functions. IEEE Trans. Computers 28(12): 879-887 (1979)
1960 – 1969
- 1966
- [j1]Per-Erik Danielsson:
Boolean Memories. IEEE Trans. Electron. Comput. 15(1): 29-35 (1966)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: