Chia-Hoang Lee

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 Thomas S. Huang

> Home > Persons > Chia-Hoang Lee

Publications

1990
[j13]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - journals/cvgip/LeeH90a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cvgip/LeeH90a
Chia-Hoang Lee, Thomas S. Huang:
Finding point correspondences and determining motion of a rigid object from two weak perspective views. Comput. Vis. Graph. Image Process. 51(3): 371 (1990)
[j12]
- view
  authority control:
- export record
  dblp key:
  - journals/cvgip/LeeH90
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cvgip/LeeH90
Chia-Hoang Lee, Thomas S. Huang:
Finding point correspondence and determining motion of a rigid object from two weak perspective views. Comput. Vis. Graph. Image Process. 52(3): 309-327 (1990)
1989
[j10]
- view
  authority control:
- export record
  dblp key:
  - journals/pami/HuangL89
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/pami/HuangL89
Thomas S. Huang, Chia-Hoang Lee:
Motion and Structure from Orthographic Projections. IEEE Trans. Pattern Anal. Mach. Intell. 11(5): 536-540 (1989)
1988
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/cvpr/LeeH88
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cvpr/LeeH88
Chia-Hoang Lee, Thomas S. Huang:
Finding point correspondences and determining motion of a rigid object from two weak perspective views. CVPR 1988: 398-403

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.