default search action
Duck Hoon Kim
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [c12]Seungwoo Yoo, Heeseok Lee, Heesoo Myeong, Sungrack Yun, Hyoungwoo Park, Janghoon Cho, Duck Hoon Kim:
End-to-End Lane Marker Detection via Row-wise Classification. CVPR Workshops 2020: 4335-4343 - [i2]Seungwoo Yoo, Heeseok Lee, Heesoo Myeong, Sungrack Yun, Hyoungwoo Park, Janghoon Cho, Duck Hoon Kim:
End-to-End Lane Marker Detection via Row-wise Classification. CoRR abs/2005.08630 (2020) - [i1]Jeong-Kyun Lee, Young Ki Baik, Hankyu Cho, Kang Kim, Duck Hoon Kim:
1-Point RANSAC-Based Method for Ground Object Pose Estimation. CoRR abs/2008.03718 (2020)
2010 – 2019
- 2013
- [j3]Hyung Il Koo, Duck Hoon Kim:
Scene Text Detection via Connected Component Clustering and Nontext Filtering. IEEE Trans. Image Process. 22(6): 2296-2305 (2013) - 2010
- [j2]Duck Hoon Kim, Il Dong Yun, Sang Uk Lee:
Attributed relational graph matching based on the nested assignment structure. Pattern Recognit. 43(3): 914-928 (2010)
2000 – 2009
- 2006
- [c11]Soochahn Lee, Sehyuk Yoon, Il Dong Yun, Duck Hoon Kim, Kyoung Mu Lee, Sang Uk Lee:
A New 3-D Model Retrieval System Based on Aspect-Transition Descriptor. ECCV (4) 2006: 543-554 - [c10]Dongjin Kwon, Il Dong Yun, Duck Hoon Kim, Sang Uk Lee:
Fingerprint Matching Method Using Minutiae Clustering and Warping. ICPR (4) 2006: 525-528 - 2005
- [j1]Duck Hoon Kim, Il Dong Yun, Sang Uk Lee:
A new shape decomposition scheme for graph-based representation. Pattern Recognit. 38(5): 673-689 (2005) - [c9]Soochahn Lee, Duck Hoon Kim, Sang Uk Lee, Il Dong Yun:
How CanWe Evaluate Object Recognition Algorithms Using a Public Object Image Database? CVPR Workshops 2005: 37 - 2004
- [c8]Duck Hoon Kim, Il Dong Yun, Sang Uk Lee:
Interactive 3-D Shape Retrieval System Using the Attributed Realtional Graph. MDDE 2004 - [c7]Duck Hoon Kim, Il Dong Yun, Sang Uk Lee:
Interactive 3-D Shape Retrieval System Using the Attributed Relational Graph. CVPR Workshops 2004: 147 - [c6]Duck Hoon Kim, Il Dong Yun, Sang Uk Lee:
Graph-based representation for 2-d shape using decomposition scheme. ICIP 2004: 3081-3084 - [c5]Duck Hoon Kim, Il Dong Yun, Sang Uk Lee:
A New Attributed Relational Graph Matching Algorithm Using the Nested Structure of Earth Mover's Distance. ICPR (1) 2004: 48-51 - [c4]Duck Hoon Kim, Il Dong Yun, Sang Uk Lee:
A comparative study on attributed relational gra matching algorithms for perceptual 3-D shape descriptor in MPEG-7. ACM Multimedia 2004: 700-707 - [c3]Duck Hoon Kim, In Kyu Park, Il Dong Yun, Sang Uk Lee:
A New MPEG-7 Standard: Perceptual 3-D Shape Descriptor. PCM (2) 2004: 238-245 - 2003
- [c2]Duck Hoon Kim, Il Dong Yun, Sang Uk Lee:
Regular polyhedral descriptor for 3-D object retrieval system. ICIP (3) 2003: 592-532 - 2001
- [c1]Duck Hoon Kim, Il Dong Yun, Sang Uk Lee:
Graph representation by medial axis transform for 3D image retrieval. Three-Dimensional Image Capture and Applications 2001: 223-
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 23:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint