Petri Hirvonen

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Heikki Kälviäinen

> Home > Persons > Petri Hirvonen

Publications

1997
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/prl/KalviainenH97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/prl/KalviainenH97
Heikki Kälviäinen, Petri Hirvonen:
An extension to the randomized hough transform exploiting connectivity. Pattern Recognit. Lett. 18(1): 77-85 (1997)
1996
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/prl/KalviainenHO96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/prl/KalviainenHO96
Heikki Kälviäinen, Petri Hirvonen, Erkki Oja:
Houghtool -- A software package for the use of the Hough transform. Pattern Recognit. Lett. 17(8): 889-897 (1996)
1995
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/ivc/KalviainenHXO95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ivc/KalviainenHXO95
Heikki Kälviäinen, Petri Hirvonen, Lei Xu, Erkki Oja:
Probabilistic and non-probabilistic Hough transforms: overview and comparisons. Image Vis. Comput. 13(4): 239-252 (1995)
1994
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/eccv/KalviainenHXO94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/eccv/KalviainenHXO94
Heikki Kälviäinen, Petri Hirvonen, Lei Xu, Erkki Oja:
Comparisons of Probabilistic and Non-probabilistic Hough Transforms. ECCV (2) 1994: 351-360

a service of

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.