default search action
Yu-Kumg Chen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [c18]Yu-Kumg Chen, Yu-Han Chen:
Flying Bird Detection under Shaking Background. ICIA 2018: 439-443 - 2015
- [c17]Yu-Kumg Chen, Kuan-Jung Chen:
Pavement detection in YCbCr color space and its application. ICIA 2015: 663-667 - 2014
- [c16]Yu-Kumg Chen, Yi-Qing Lin:
Intersection image recognition for driving-view images with edge information. ICIA 2014: 1180-1184 - 2013
- [c15]Yu-Kumg Chen, Tsung-Hsien Tsai:
A new sky recognition with using location of sky subimage. ICIA 2013: 1103-1108 - [c14]Yu-Kumg Chen, Tsung-Hsien Tsai:
Sky recognitions for driving-view images. ICVES 2013: 119-124 - 2012
- [c13]Yu-Kumg Chen, Tsun-Ghsien Tsai:
GPS correction with the sky-subimage recognition. ICDIM 2012: 365-370 - 2011
- [j4]Yu-Kumg Chen, Fan-Chieh Cheng, Pohsiang Tsai:
A gray-level clustering reduction algorithm with the least PSNR. Expert Syst. Appl. 38(8): 10183-10187 (2011) - [j3]Yu-Kumg Chen, Chen-An Fang, Fan-Chieh Cheng:
An Optimal Algorithm for Solving the Towers of Hanoi Problem with the Least Storage Used. IEICE Trans. Inf. Syst. 94-D(2): 240-242 (2011)
2000 – 2009
- 2009
- [c12]Fan-Chei Cheng, Yu-Kumg Chen, Kuan-Ting Liu:
An Efficient Gray-level Clustering Algorithm for Image Segmentation. CAR 2009: 259-262 - [c11]Yu-Kumg Chen, Tung-Yi Cheng, Shuo-Tsung Chiu:
Motion Detection with Entropy in Dynamic Background. CAR 2009: 263-266 - 2008
- [j2]Shuo-Yan Chou, Chang-Chien Chou, Yu-Kumg Chen:
A base function for generating contour traversal paths in stereolithography apparatus applications. Expert Syst. Appl. 35(1-2): 235-244 (2008) - [j1]Chang-Chien Chou, Yu-Kumg Chen, Shuo-Yan Chou:
A fundamental tool path planning problem for circles in layered manufacturing. Integr. Comput. Aided Eng. 15(1): 37-52 (2008) - [c10]Fan-Chei Cheng, Yu-Kumg Chen:
Effective Sigma-Delta Background Estimation for Video Background Generation. APSCC 2008: 1315-1321 - 2007
- [c9]Chang-Chien Chou, Yu-Kumg Chen, Shuo-Yan Chou:
Shortest Traversal Path of n Circles in Layered Manufacturing Applications. CGIV 2007: 205-210 - 2006
- [c8]Yu-Kumg Chen, Yi-Fan Chang:
Two Thresholding for Deriving the Bi-level Document Image. PSIVT 2006: 228-237 - [c7]Yu-Kumg Chen, Shuo-Yan Chou:
Deriving the Accumulation Density Function with Parabolic Trajectories of Particles for Curve. SMC 2006: 2802-2807 - [c6]Chang-Chien Chou, Yu-Kumg Chen, Shuo-Yan Chou:
Deriving the Minimum Traversal Function of Three Circles. SMC 2006: 2825-2830 - 2004
- [c5]Yu-Ting Pai, Yu-Kumg Chen:
The Fastest Carry Lookahead Adder. DELTA 2004: 434-436 - 2003
- [c4]Yu-Kumg Chen, Shuo-Yan Chou:
Simulating surface finishing for process design. CE 2003: 899-907 - [c3]Yu-Kumg Chen:
Optimal regular polygon inclusion in two-dimensional space for evaluating material nesting. CE 2003: 909-917 - [c2]Yu-Kumg Chen, K. Y. Hwang, C. W. Sun:
Optimal replenishment schedule considering time value for logistic demand. CE 2003: 937-946 - 2001
- [c1]Yu-Kumg Chen, Shuo-Yan Chou, Tzong-Chen Wu:
An Efficient Method for Computing the Feasible Region with Translational Containment between Two Convex Polygons. ICDCS Workshops 2001: 390-395
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:09 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: