![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Wen-Ming Yan
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
- [j26]Kuo-Liang Chung, Yong-Huai Huang, Wen-Ming Yan, Wei-Chung Teng:
Distortion reduction for histogram modification-based reversible data hiding. Appl. Math. Comput. 218(9): 5819-5826 (2012) - 2010
- [j25]Kuo-Liang Chung, Wei-Jen Yang, Jun-Hong Yu, Wen-Ming Yan, Chiou-Shann Fuh
:
Novel quality-effective zooming algorithm for color filter array. J. Electronic Imaging 19(1): 013005 (2010) - [j24]Kuo-Liang Chung, Wei-Jen Yang, Wen-Ming Yan, Chiou-Shann Fuh
:
New joint demosaicing and arbitrary-ratio resizing algorithm for color filter array based on DCT approach. IEEE Trans. Consumer Electron. 56(2): 783-791 (2010)
2000 – 2009
- 2009
- [j23]Kuo-Liang Chung, Wei-Jen Yang, Pang-Yen Chen, Wen-Ming Yan, Chiou-Shann Fuh
:
New joint demosaicing and zooming algorithm for color filter array. IEEE Trans. Consumer Electron. 55(3): 1477-1486 (2009) - 2008
- [j22]Kuo-Liang Chung, Wei-Jen Yang, Wen-Ming Yan:
Efficient edge-preserving algorithm for color contrast enhancement with application to color image segmentation. J. Vis. Commun. Image Represent. 19(5): 299-310 (2008) - [j21]Kuo-Liang Chung, Wei-Jen Yang, Wen-Ming Yan, Chung-Chou Wang:
Demosaicing of Color Filter Array Captured Images Using Gradient Edge Detection Masks and Adaptive Heterogeneity-Projection. IEEE Trans. Image Process. 17(12): 2356-2367 (2008) - 2006
- [j20]Kuo-Liang Chung, Yau-Wen Liu, Wen-Ming Yan:
A hybrid gray image representation using spatial- and DCT-based approach with application to moment computation. J. Vis. Commun. Image Represent. 17(6): 1209-1226 (2006) - 2004
- [j19]Kuo-Liang Chung, Teh-Chuan Chen, Wen-Ming Yan:
New memory- and computation-efficient hough transform for detecting lines. Pattern Recognit. 37(5): 953-963 (2004) - [j18]Chun-Kuang Hu, Wen-Ming Yan, Kuo-Liang Chung:
Efficient cache-based spatial combinative lifting algorithm for wavelet transform. Signal Process. 84(9): 1689-1699 (2004) - 2002
- [j17]Kuo-Liang Chung, Wen-Ming Yan:
Fast 2D discrete cosine transform on compressed image in restricted quadtree and shading format. Inf. Process. Lett. 81(1): 13-21 (2002) - [j16]Kuo-Liang Chung, Wen-Ming Yan, Jung-Gen Wu:
Optimal Hierarchies for Quadrilateral Surfaces. J. Math. Model. Algorithms 1(4): 283-300 (2002) - [j15]Kuo-Liang Chung, Wen-Ming Yan, Wan-Yue Chen:
Efficient algorithms for 3-D polygonal approximation based on LISE criterion. Pattern Recognit. 35(11): 2539-2548 (2002) - [j14]Kuo-Liang Chung, Wen-Ming Yan, Zhi-Hor Liao:
Fast Computation of Moments on Compressed Grey Images using Block Representation. Real Time Imaging 8(2): 137-144 (2002) - [j13]Kuo-Liang Chung, Wen-Ming Yan, Jung-Gen Wu:
Load-balanced parallel banded-system solvers. Theor. Comput. Sci. 289(1): 313-334 (2002) - 2001
- [j12]Kuo-Liang Chung, Wen-Ming Yan:
An efficient algorithm for the Fourier transform on a compressed image in restricted quadtree and shading format. Inf. Process. Lett. 79(1): 1-5 (2001) - 2000
- [j11]Kuo-Liang Chung, Wen-Ming Yan:
On the number of spanning trees of a multi-complete/star related graph. Inf. Process. Lett. 76(3): 113-119 (2000) - [j10]Kuo-Liang Chung, Wen-Ming Yan, Jung-Gen Wu:
A simple improved full search for vector quantization based on Winograd's identity. IEEE Signal Process. Lett. 7(12): 342-344 (2000)
1990 – 1999
- 1998
- [j9]Wen-Ming Yan, Wendy J. Myrvold
, Kuo-Liang Chung:
A Formula for the Number of Spanning Trees of a Multi-Star Related Graph. Inf. Process. Lett. 68(6): 295-298 (1998) - [j8]Kuo-Liang Chung, Wen-Ming Yan:
On matrix factorizations for recursive pruned discrete cosine transforms. Signal Process. 68(2): 175-182 (1998) - 1997
- [j7]Kuo-Liang Chung, Wen-Ming Yan:
Vectorizations of randomized matching for run-length coded strings. Pattern Recognit. Lett. 18(1): 63-72 (1997) - [j6]Kuo-Liang Chung, Wen-Ming Yan:
The complex Householder transform. IEEE Trans. Signal Process. 45(9): 2374-2376 (1997) - 1996
- [j5]Kuo-Liang Chung, Wen-Ming Yan, Jung-Gen Wu:
A Parallel Algorithm for Solving Special Tridiagonal Systems on Ring Networks. Computing 56(4): 385-396 (1996) - [j4]Wen-Ming Yan, Kuo-Liang Chung:
An Extended Algorithm for Solving Special Tridiagonal Systems. J. Inf. Sci. Eng. 12(3): 467-480 (1996) - [j3]Kuo-Liang Chung, Wen-Ming Yan:
Parallel B-Spline Surface Fitting on Mesh-Connected Computers. J. Parallel Distributed Comput. 35(2): 205-210 (1996) - 1995
- [j2]Kuo-Liang Chung, Wen-Ming Yan:
Fast Vectorization for Calculating a Moving Sum. IEEE Trans. Computers 44(11): 1335-1337 (1995) - 1994
- [j1]Kuo-Liang Chung, Wen-Ming Yan:
A fast algorithm for cubic B-spline curve fitting. Comput. Graph. 18(3): 327-334 (1994)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint