Refereed Conference Papers

[85] L. Ye, E.-H. Yang, A.H. Salamah, “Modeling and energy analysis of adversarial pertur- bations in deep image classification security,” Proc.of the 2022 Canadian Workshop on Information Theory, Ottawa, Canada, June 5 - 8, 2022 (6 pages).

[86] C. Sun and E-H. Yang, “A watermarking-based framework for protecting deep image classifiers against adversarial attacks,” Proc.of the 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) Workshops, Virtual, June 19 - 25, pp. 3329-3338, 2021.

[87] J. Bai, B. Chen, Y. Li, D. Wu, W. Guo, S.-T. Xia, and E.-H. Yang, “Targeted attack for deep hashing based retrieval,” In: Vedaldi A., Bischof H., Brox T., Frahm JM. (eds) Computer Vision—ECCV 2020. ECCV 2020. Lecture Notes in Computer Science, Vol 12346, pp. 618-634. (17 pages, top notch conference in machine learning, accepted as oral (2% acceptance out of 5025 submissions)).

[88] B. Shan, Y. Fang,  V. Stankovic,  S. Cheng,  and E.-H. Yang,  “ Depth-first decoding of distributed arithmetic codes for uniform binary sources,” Proc.of the 2020 Data Compression Conference, Snowbird, UT, USA, Mar. 24 - 27, pp. 393-393, 2020.

[89] E.-H. Yang and X.-W. Wu, “On optimal information-theoretically secure key man- agement,” Proc. of the 2019 Canadian Workshop on Information Theory, Hamilton, Ontario, June 2 - 6, 2019 (6 pages).

[90] H. Amer and E.-H. Yang, “Low-delay HEVC adaptive quantization parameter selection through temporal propagation length estimation,” Proc.of the 2018 IEEE Int. Conf. Image Process., Athens, Greece, October 7-10, pp. 211 – 215, 2018.

[91]  H. Amer, A. Rashwan, and E-H. Yang, “Fully connected network for HEVC CU split decision equipped with Laplacian transparent composite model,”  Proc.  of the 2018 Picture Coding Symposium, San Francisco, CA, USA, June 24-27, pp. 189 – 193, 2018.

[92] E.-H. Yang and X.-W. Wu, “Information-theoretically secure key generation and man- agement,” Proc.of the 2017 IEEE International Symposium on Information Theory(ISIT 2017), Aachen, Germany, June 25 - 30, pp. 1529-1533, 2017.

[93] X.-W. Wu, E.-H. Yang, and J. Wang, “Lightweight security protocols for Internet of Things,” Proc.of the 2017 IEEE Int. Symp. Personal, Indoor and Mobile Radio Communications, Montreal, Canada, Oct.  8-13, 2017 (7 double column pages).

[94] Y. Shan and E.-H. Yang, “Fast HEVC intra coding algorithm based on machine learn- ing and Laplacian transparent composite model,” Proc.of the 2017 Int. Conf. Acous-tics, Speech, and Signal Process., New Orleans, USA, March 5-9, pp. 2642 – 2646, 2017 (5 double column pages).

[95] J. Bian and E.-H. Yang, “’Bipartite grammar-based representations of  large  sparse binary matrices: Framework and transforms,” Proc.of the 2016 Int. Symp. Inf. Theory and Its Applications, Monterey, California, USA, Oct. 30 - Nov. 2, pp. 241 – 245, 2016.

[96] H. Amer and E.-H. Yang, ”Scene-based low delay HEVC encoding framework based on transparent composite modeling,” Proc.of the 2016 IEEE Int. Conf. Image Process., Phoenix, Arizona, USA, Sept. 25 - 28, pp. 809 – 813, 2016.

[97] E.-H. Yang, “On coding for data analytics: New information distances,” Proc.of the 2016 Information Theory and Applications Workshop, San Diego, California, U.S.A., Jan. 31– Feb. 5, 2016 (invitedpaper) (6 double-column pages).

[98] E.-H. Yang, X. Yu, and J. Meng, “Set mapping induced image perceptual similarity distance,” Proc.of the 2015 Information Theory and Applications Workshop, San Diego, California, U.S.A., Feb. 1–Feb. 6, 2015 (invitedpaper) (10 double-column pages).

[99] N. Hu and E.-H. Yang, “Fast inter mode decision for HEVC based on transparent com- posite model,” Proc.of the 2015 IEEE International Conference on Image Processing, Quebec City, Canada, Sept. 27 - 30, pp. 1533 – 1537, 2015.

[100] Y. Gao, E.-H. Yang, and D. He, “Low-complexity rate control in video coding based on bi-geometric transparent composite models,” Proc.of the 2015 IEEE International Conference on Image Processing, Quebec City, Canada, Sept. 27 - 30, pp. 1419 – 1423, 2015.

[101] C. Sun and E.-H. Yang, “An efficient DCT-based image compression system based on transparent composite model,” Proc.of the 2014 IEEE International Conference on Image Processing, Paris, France, Oct. 27 - 30, pp. 5611 - 5615, 2014.

[102] N. Hu and E.-H. Yang, “Fast intra mode decision for HEVC based on transparent com- posite model,” Proc.of the 2014 IEEE International Conference on Image Processing, Paris, France, Oct. 27 - 30, pp. 3710 – 3714, 2014.

[103] E.-H. Yang and X. Yu, “Transparent composite model for large scale image/video processing,” Proc.of the 2013 IEEE International Conference on Big Data, Silicon Valley, CA, USA, October 6 - 9, pp. 38–44, 2013.

[104] N. Hu and  E.-H.  Yang,  “Confidence  interval  based  motion  estimation,”  Proc.  of the 2013 IEEE International Conference on Image Processing, Melbourne, Australia, September 15 - 18, pp. 1588–1592, 2013.

[105] E.-H. Yang, C. Sun, and J. Meng, “Quantization table design revisited for image/video coding,” Proc.of the 2013 IEEE International Conference on Image Processing, Mel- bourne, Australia, September 15 - 18, pp.  1855–1859, 2013.

[106] J. Ho and E.-H. Yang, “Optimal multiresolution  quantization  with  error  detecting codes for broadcast channels,” Proc.of the 2013 IEEE Intern. Symp. Information Theory, Istanbul, Turkey, July 7 - 12, pp.  554–558, 2013.

[107] J. Zhang, E.-H. Yang, and J. C. Kieffer, “Redundancy analysis in lossless compression of a binary tree via its minimal DAG representation,” Proc.of the 2013 IEEE Intern.Symp. Information Theory, Istanbul, Turkey, July 7 - 12, pp. 1914–1918, 2013.

[108] J. Ho, E.-H. Yang, and J. Meng, “On separation of source and channel coding in the fi block length regime,” Proc.of the 2013 Canadian Workshop on Information Theory, Toronto, Ontario, June 18 - 21, pp. 97 – 100, 2013.

[109] K. Rapaka and  E.-H.  Yang,  “A  high  throughput  multi-symbol  CABAC  frame-work for hybrid video codecs,” Proc.of the 2013 Data Compression Conference, Snowbird, Utah, Mar.  20–22, 2013.

[110] J. Meng and E.-H. Yang, “Constellation and rate selection in adaptive modulation and coding based on fi blocklength analysis,” Proc.of 2013 IEEE Wireless Commu- nications and Networking Conference, Shanghai, China, April 7–10, pp. 4065–4070, 2013.

[111] E.-H. Yang and J. Meng, “New non-asymptotic  random  channel  coding  theorems,” Proc.of the 2013 Information Theory and Applications Workshop, San Diego, Cali- fornia, U.S.A., Feb. 10–Feb. 15, 2013 (invitedpaper) (8 double-column pages).

[112] M. Torbatian and E.-H. Yang, “Causal Coding of Multiple Jointly Gaussian Sources,” Proc.of the 50th Allerton Conference on Communications, Control, and Computing, Urbana-Champaign, Illinois, Oct. 1–5, pp. 2060 - 2067, 2012 (8 double-column pages).   [113] D. Xu, J. Meng, and E.-H. Yang, “Non-asymptotic fi                                                                             Slepian-Wolf coding theorem,” Proc.  of the 50th Allerton Conference on Communications, Control, and Computing, Urbana-Champaign, Illinois, Oct.  1–5, 2012 (8 double-column pages).

[114] E.-H.  Yang  and J.  Meng, “Channel  capacity  in  the  non-asymptotic regime: Taylor- type expansion and computable benchmarks,” Proc.of the 50th Allerton Conference on Communications, Control, and Computing, Urbana-Champaign, Illinois, Oct. 1–5, pp. 278 - 285, 2012 (invitedpaper; 8 double-column pages).

[115] E.-H. Yang and J. Meng, “Jar decoding: LDPC coding theorems for binary input memoryless channels,” Proc.of the 2012 IEEE Intern. Symp. Information Theory, Cambridge, MA, U.S.A., 1-6 July, pp. 2861 - 2865, 2012.

[116] E.-H. Yang and J.  Meng,  “Non-asymptotic  equipartition  properties  for  independent and identically distributed sources,” Proc.of the 2012 Information Theory and Appli- cations Workshop, San Diego, California, U.S.A., Feb. 5–Feb. 10, pp. 39 – 46 , 2012 (invitedpaper).

[117] E.-H. Yang and C. Sun, “Dithered soft decision quantization for baseline JPEG encod- ing and its joint optimization with Huffman coding and quantization table selection,”Proceedingsof Forty-Fifth Asilomar Conference on Signals, Systems and Computers, Monterey, California, USA, November 6 – 9, pp. 249 - 253, 2011.

[118] J. She, E.-H. Yang, and P.-H. Ho, “Coded wireless video broadcast/multicast: A cross-layer framework and end-to-end distortion analysis,” Proceedingsof the 6th ACM Workshop on Wireless Multimedia Networking and Computing, Miami, FL, USA, Oc- tober 31 – November 04, pp. 7–24, 2011.

[119] J. Meng, E.-H. Yang, and Z. Zhang, “Tree interactive encoding and decoding: Con- ditionally Φ-mixing sources,” Proc.of the 2011 IEEE Intern. Symp. Information Theory, Saint-Petersburg, Russia, July 31–August 5, pp.  1871 – 1875, 2011

[120] J. Meng and E.-H. Yang, “Credit-based variable-to-variable length coding: key con- cepts and preliminary redundancy analysis,” Proc.of the 2011 Canadian Workshop on Information Theory, Kelowna, British Columbia, Canada, May 17–20, pp.74 – 77, 2011.

[121]  L. Zheng and E.-H. Yang, “On optimum fi               causal scalar quantization design for causal video coding,” Proc.of the 2011 Canadian Workshop on Information Theory, Kelowna, British Columbia, Canada, May 17–20, pp.  58–61, 2011.

[122] L. Zheng, D.-K. He, and E.-H. Yang “On the information theoretic performance com- parison of causal video coding and predictive video coding,” Proc.of the 2011 Infor- mation Theory and Applications Workshop, San Diego, California, U.S.A., Feb. 6–Feb. 11, pp. 1–7, 2011 (invitedpaper).

[123] E.-H. Yang, C. Sun, and L. Zheng, “An improved iterative algorithm for calculating the rate distortion performance of causal video coding for continuous sources and its application to real video data,” Proc.of the 28th Picture Coding Symposium, Nagoya, Japan, December 7-10, pp. 98–101, 2010.

[124] G. Wu and E.-H. Yang, “A new efficient method of computing MDCT in MP3 audio coding,” Proc.of the 2010 Inter. Conf. Multimedia Info. Networking and Security, Nanjing, Jiangsu, China, November 4-6, pp.  63–67, 2010.

[125] J. Meng and E.-H. Yang, “On the error exponent to redundancy ratio of interactive encoding and decoding,” Proc.of the 2010 IEEE Intern. Symp. Information Theory, Austin, Texas, U.S.A., June 13–18, pp.  121–125, 2010.

[126] F. Teng, E.-H. Yang, and X. Yu, “Optimal multiresolution quantization for broadcast channels with random index assignment,” Proc.of the 2010 IEEE Intern. Symp.Information Theory, Austin, Texas, U.S.A., June 13–18, pp. 181–185, 2010.

[127] S. Yang, J. Meng, and E.-H. Yang, “Coding for linear operator channels over fi

fi           Proc.  of the 2010 IEEE Intern.  Symp.  Information Theory, Austin, Texas, U.S.A., June 13–18, pp. 2413–2417, 2010.

[128] E.-H. Yang and J. Meng, “On interactive encoding and decoding for distributed lossless coding of individual sequences,” Proc.of the 2010 Information Theory and Applica- tions Workshop, San Diego, California, U.S.A., Jan. 31–Feb. 5, pp. 1–7, 2010 (invitedpaper).

[129] S. Yang, S.-W. Ho, J. Meng, and E.-H.  Yang,  “Optimality  of  subspace  coding  for linear operator channels over fi        fi                              Proc.of 2010 IEEE Information Theory Workshop, Cairo, Egypt, Jan. 6-8, pp. 1–5, 2010.

[130] J. Meng and E.-H. Yang, “Interactive encoding and decoding based on syndrome ac- cumulation over binary LDPC ensembles: Universality and rate-adaptivity,” Proc.of the 47th Allerton Conference on Communications, Control, and Computing, Urbana- Champaign, Illinois, September 30–Oct. 2, pp. 1502–1509, 2009 (invitedpaper).

[131] X. Yu, D.-K. He,and E.-H. Yang, “Adaptive quantization with balanced distortion distribution and its application to H.264 intra coding,” Proc.of the 2009 IEEE Intern. Conf. Image Processing, Cairo, Egypt, November 7–11, pp. 1049–1052, 2009.

[132] E.-H. Yang and L. Wang, “Full rate distortion optimization of MPEG 2 video coding,” Proc.of the 2009 IEEE Intern. Conf. Image Processing, Cairo, Egypt, November 7–11, pp. 605–608, 2009.

[133] E.-H. Yang, L. Zheng, Z. Zhang, and D.-K. He, “A computation approach to the minimum total rate problem of causal video coding,” Proc.of the 2009 IEEE Intern. Symp. Information Theory, Seoul, Korea, June 28 to July 3, pp. 2141–2145, 2009.

[134] J. C. Kieffer, E.-H. Yang, and W. Szpankowski,  “Structural  complexity  of  random binary tree,” Proc.of the 2009 IEEE Intern. Symp. Information Theory, Seoul, Korea, June 28 to July 3, pp.  635–639, 2009.

[135] E.-H. Yang, L. Zheng, D.-K. He, and Z. Zhang, “On the rate distortion theory for causal video coding,” Proc.of the 2009 Information Theory and Applications Workshop, San Diego, California, U.S.A., Feb. 8–13, pp. 385 – 391, 2009 (invitedpaper).

[136] G. Wu, E.-H. Yang, and D.-K. He, “Joint watermarking and compression for Gaussian and Laplacian sources using uniform vector quantization,” Proc.of the 2009 IEEE International Conference on Acoustics, Speech, and Signal Processing, Taipei, Taiwan, April 19-24, pp. 1493–1496, 2009.

[137] Y. Zhou and E.-H. Yang, “Joint robust watermarking and compression using variable- rate scalar quantization,” Proc.of the 2009 Canadian Workshop on Information The- ory, Ottawa, Ontario, Canada, May 13–15, pp.  183–186, 2009.

[138] X. Yu, H. Wang, E.-H. Yang, and M. Uysal, “Distortion SNR exponent for vector quan- tization on MIMO channels,” Proc.of the 2009 Canadian Workshop on Information Theory, Ottawa, Ontario, Canada, May 13–15, pp.  79–82, 2009.

[139] J. Meng, E.-H. Yang, and D.-K. He, “Interactive encoding and decoding based on syndrome accumulation over a binary regular LDPC ensemble,” Proc.  of the 2009 Canadian Workshop on Information Theory, Ottawa, Ontario, Canada, May 13–15, pp. 42–45, 2009.

[140] E.-H. Yang and L. Wang, “Joint optimization of run-length coding, context-based arithmetic coding, and quantization step sizes,” Proc.of the 2009 IEEE CanadianConferenceon Electrical and Computer Engineering, St. John’s, Newfoundland and Labrador, Canada, May 3-6, pp.678–681, 2009.

[141] E.-H. Yang and L. Wang, “Entropy constrained color splitting for palette image,” Proc.of the 2009 IEEE Intern. Conf. Multimedia & Expo, Cancun, Mexico, June 28 - July 3, pp. 109–112, 2009.

[142] J. Meng, E.-H. Yang, and D.-K. He,“Low-density linear IED schemes for lossless source coding with decoder only side information,” Proc.of the 46th Allerton Confer-enceon Communications, Control, and Computing, Urbana-Champaign, Illinois, USA, September 23–26, pp. 661–668, 2008.

[143] E.-H. Yang and D.-K. He, “On interactive encoding and decoding for lossless source coding with decoder only side information,” Proc.of the 2008 IEEE Intern. Symp.Inform. Theory, Toronto, Canada, July 6–11, pp. 419–423, 2008.

[144] W. Sun and E.-H. Yang, “On achievable distortion regions of analog Gaussian water- marking,” Proc.of the 2008 IEEE Intern. Symp. Inform. Theory, Toronto, Canada, July 6–11, pp. 1987–1991, 2008.

[145] X. Yu, H. Wang, and E.-H. Yang, “Optimal quantization for noisy  channels  with random index assignment,” Proc.of the 2008 IEEE Intern. Symp. Inform. Theory, Toronto, Canada, July 6–11, pp.  2727–2731, 2008.

[146] A. Kaltchenko, E-H. Yang, and N. Timofeeva, “Bias reduction of the nearest neighbor entropy estimator”, Procedeengsof the 2008 IEEE International Conference on Com- putational Technologies in Electrical and Electronics Engineering, Novosibirsk, Russia, pp. 261–265, 2008.

[147] E.-H. Yang and D.-K. He, “Two results on interactive lossless source encoding and decoding with side information at the decoder,” Proc.of the Third (2008) Intern. Conf. on Communications and Networking in China, Hangzhou, China, August 25-27, pp. 90–94, 2008 (invitedpaper).

[148] E.-H. Yang and D.-K. He, “Near lossless source coding with side information at the decoder: Beyond conditional entropy,” Proc.of the 2008 Information Theory and Applications Workshop, San Diego, California, U.S.A., Jan. 27–Feb. 1, pp. 454–460, 2008 (invitedpaper).

[149] J. She, X. Yu, F. Hou, P. H. Ho, and E.-H. Yang, “A framework of cross-layer super- position coded multicast for robust IPTV services over WiMAX,” Proc.of the 2008 IEEE Wireless Communications and Networking Conference, Las Vegas, Nevada, USA, March 31–April 4, pp. 3139–3144, 2008.

[150] X. Yu, E.-H. Yang, and H. Wang, ‘’Down-sampling in DCT domain using linear trans- form with double-sided multiplication for image/video transcoding,” Proc.of the 2008 IEEE International Conference on Acoustics, Speech, and Signal Processing, Las Vegas, Nevada, USA, March 30 - April 4, pp. 1377–1380, 2008.

[151] A. Kaltchenko, N. Timofeeva, and E.-H. Yang, “Exact analysis of the bias of the nearest neighbor entropy estimator for I.I.D. information sources,” Proc.of the 45th AllertonConferenceon Communications, Control, and Computing, Urbana-Champaign, Illi- nois, USA, September 26–28, pp. 165–168, 2007.

[152] E.-H. Yang and L. Wang, “Joint optimization of run-length coding, Huffman coding and quantization table with complete baseline JPEG decoder compatibility,” Proc.of the 2007 IEEE Intern. Conf. Image Processing, San Antonio, Texas, USA., Sept. 16–19, pp. III-181–III-184, 2007.

[153] A. Kaltchenko, E.-H. Yang, and N. Timofeeva, “Entropy estimators with almost sure convergence and an O(1/n) variance,” Proc.of the 2007 IEEE Information Theory Workshop, Lake Tahoe, California, USA, Sept. 2–6, pp. 644-649, 2007.

[154] A. Kaltchenko, I. Kotsireas, N.  Timofeeva,  En-hui  Yang,  “Entropy  rate  estimators with a near-optimal upper bound on variance,” Proc.of XI Intern.  Symp.  Problems of Redundancy in Information and Control Systems, Saint Petersburg, Russian, July 2–6, pp. 18–21, 2007.

[155] J. Wang, E.-H. Yang, and X. Yu, “An efficient motion estimation method for H.264- based video transcoding with spatial resolution conversion,” Proc.of the 2007 IEEE Intern. Conf. Multimedia & Expo, Beijing, China, July 2–5, pp. 444–447, 2007.

[156] E.-H. Yang, and D.-K. He, “Universal data compression with side information at the decoder by using traditional universal lossless compression algorithms,” Proc.of the2007 IEEE Intern. Symp. Inform. Theory, Nice, France, June 24–29, pp. 431–435, 2007.

[157] X. Ma and E.-H. Yang, “Constructing LDPC codes by 2-lifts,” Proc.of the 2007 IEEE Intern. Symp. Inform. Theory, Nice, France, June 24–29, pp. 1231–1235, 2007.

[158] D.-K. He, L. A. Lastras-Montano, and E.-H. Yang, “Redundancy of variable rate Slepian-Wolf codes from the decoder’s perspective,” Proc.of the 2007 IEEE Intern.Symp. Inform. Theory, Nice, France, June 24–29, pp. 1321–1325, 2007.

[159] W. Sun and E.-H. Yang, “On reversible embedding when watermarks and covertexts are correlated,” Proc.of the 2007 IEEE Intern. Symp. Inform. Theory, Nice, France, June 24–29, pp. 2451–2455, 2007.

[160] L. Zheng, D.-K. He, and E.-H. Yang, “On optimum conventional quantization for source coding with side information at the decoder,” Proc.of the 2007 CanadianWorkshop on Information Theory, Edmonton, Alberta, Canada, June 5–8, pp. 97– 100, 2007.

[161] H. Wang and E.-H. Yang, “On space-time coding with fi  e bit feedback,” Proc.  of the 2007 Canadian Workshop on Information Theory, Edmonton, Alberta, Canada, June 5-8, pp. 124–127, 2007.

[162] A. Kaltchenko and E.-H. Yang, “Cooling of  spins  via  quantum  data  compression,” Proc.of the 2007 Canadian Workshop on Information Theory, Edmonton, Alberta, Canada, June 5-8, pp.  184–187, 2007.

[163] J. Chen, D.-K. He, and E.-H. Yang, “Slepian-Wolf coding for general sources and its duality with channel coding,” Proc.of the 2007 Canadian Workshop on Information Theory, Edmonton, Alberta, Canada, June 5-8, pp.  57–60, 2007.

[164] J. Chen, D.-K. He, and E.-H. Yang,“On the codebook-level duality between Slepian- Woif coding and channel coding,” Proc.of the 2007 Information Theory and Applica- tions Workshop, San Diego, California, U.S.A., Jan. 29–Feb. 2, pp. 84–93, 2007.

[165] E.-H. Yang and W. Sun, “Combined source coding and watermarking,” Proc.of the 2006 IEEE Information Theory Workshop, Chengdu, China, Oct.22–26, pp. 322–326, 2006 (invitedpaper).

[166] D.-k. He, L. Lastras-Montano, and E.-H. Yang, “On the relationship between re- dundancy and decoding error probability in Slepian-Wolf coding,” Proc.of the 2006IEEE Information Theory Workshop, Chengdu, China, Oct.22–26, pp. 332–336, 2006 (invitedpaper).

[167] D.-k. He, L. Lastras-Montano, and E.-H. Yang, “Improving the redundancy of Slepian- Wolf coding by feedback,” Proc.of the 44th Allerton Conference on Communications, Control, and Computing, Urbana-Champaign, Illinois, September 27–29, pp. 861–867, 2006 (invitedpaper).

[168] W. Sun and E.-H. Yang, “On joint compression and information embedding when watermarks and covertexts are correlated,” Proc.of the 2006 IEEE Information Theory Workshop, Chengdu, China, October 22-26, pp. 298–302, 2006.

[169] H. Wang and E.-H. Yang, “Space-time coding with feedback,” Proc.of the 2006 IEEE Information Theory Workshop, Chengdu, China, October 22-26, pp. 438–442, 2006.

[170] E.-H. Yang and X. Yu, “Rate distortion optimization of H.264 with main profi com- patibility,” Proc.of the 2006 IEEE Intern. Symp. Inform. Theory, Seattle, Washing- ton, USA, July 9–14, pp. 282–286, 2006.

[171] D.-k. He, L. Lastras-Montano, and E.-H. Yang, “A lower bound for variable rate Slepian-Wolf coding,” Proc.of the 2006 IEEE Intern. Symp. Inform. Theory, Seattle, Washington, USA, July 9–14, pp. 341–345, 2006.

[172] D.-k. He and E.-H. Yang, “On the duality between Slepian-Wolf coding and channel coding,” Proc.of the 2006 IEEE Intern. Symp. Inform. Theory, Seattle, Washington, USA, July 9–14, pp. 2546–2550, 2006.

[173] W. Sun and E.-H. Yang, “Algorithms for computing joint compression and private watermarking rate regions,” Proc.of the 2006 IEEE Intern. Symp. Inform. Theory, Seattle, Washington, USA, July 9–14, pp. 178–182, 2006.

[174] E.-H. Yang and W. Sun, “On information embedding when watermarks and covertexts are correlated,” Proc.of the 2006 IEEE Intern. Symp. Inform. Theory, Seattle, Washington, USA, July 9–14, pp.  346–350, 2006.

[175] E.-H. Yang and X. Yu, “Rate distortion optimization in H.264,” Proc.of the Inaugural Workshop on Information Theory and Applications, San Diego, U.S.A., Feb. 6 to 10, 2006 (invitedpaper).

[176] N. Nguyen and E.-H. Yang, “End-to-end loss discrimination for improved throughput performance in heterogeneous networks,” Proc.of the 2006 IEEE Consumer Commu- nications and Networking Conference, Las Vegas, NV, U.S.A., January 8–10, Volume 1, pp. 538–542, 2006.

[177] J. Xu and E.-H. Yang, “Rate-distortion optimization for MP3 audio coding with com- plete decoder compatibility,” Proc.of the 2005 IEEE International Workshop on Mul- timedia Signal Processing, Shanghai, China, Oct. 30 to Nov. 2, pp. 1–4, 2005.

[178] E.-H. Yang and G. Wu, “Joint compression and blind watermarking: A case study in the JPEG-compatible scenario,” Proc.of the 43th Allerton Conference on Communi-cations,Control,and Computing, Urbana-Champaign, Illinois, September 28–30, pp. 1859–1868, 2005 (invitedpaper).

[179] E.-H. Yang, D.-K. He, T. Uyematsu, and R. W. Yeung, “String matching-based uni- versal source codes for source networks with asymptotically zero feedback,” Proc.ofthe 2005 IEEE Intern. Symp. Inform. Theory, Adelaide, Australia, Sept. 4–9, pp. 2349–2353, 2005.

[180] E.-H. Yang, L. Song, J. C. Kieffer, and G. I. Shamir, “On the pointwise redundancy of the LZ78 algorithm,” Proc.of the 2005 IEEE Intern. Symp. Inform. Theory, Adelaide, Australia, Sept.  4–9, pp.  495–499, 2005.

[181] E.-H. Yang and X. Yu, “Optimal soft decision quantization design for H.264,” Proc.of the 2005 Canadian Workshop on Information Theory, Montreal, Quebec, Canada, June 5–8, pp.223-226, 2005.

[182] G. Wu and E.-H. Yang, “A joint image compression and blind watermarking system with JPEG decoder compatibility,” Proc.of the 2005 Canadian Workshop on Infor- mation Theory, Montreal, Quebec, Canada, June 5–8, pp.119-122, 2005.

[183] E.-H. Yang and W. Sun, “On watermarking and compression rates of joint compres- sion and private watermarking systems with abstract alphabets,” Proc.of the 2005 Canadian Workshop on Information Theory, Montreal, Quebec, Canada, June 5–8, pp. 296-299, 2005.

[184] E.-H. Yang and X. Yu, “On joint optimization of motion compensation, quantization and baseline entropy coding in H.264 with complete decoder compatibility” the Proc. of the 2005 IEEE International Conference on Acoustics, Speech, and Signal Processing

, Philadelphia, PA, USA, March 18–23, pp. II325-328, 2005.

[185] E.-H. Yang, D.-K. He, and J. C. Kieffer, “Grammar-based coding: New perspectives,” Proc.of the 2004 IEEE Information Theory Workshop, San Antonio, Texas, U.S.A., October 24-29, pp. 105–110, 2004. (Invitedpaper)

[186] X. Ma and E.-H. Yang, “Low density parity check codes with fast decoding convergence speed,” Proc.of the 2004 IEEE Intern. Symp. Inform. Theory, Chicago, U.S.A., June 27 – July 2, 2004.

[187] E.-H. Yang and D.-K. He, “Context-dependent vs context-free: performance compari- son of grammar-based codes,” Proc.of the 2003 IEEE Intern. Symp. Inform. Theory, Yokohama, Japan, June 29 – July 4, pp.  51-51, 2003.

[188] D.-K. He and E.-H. Yang, “On the universality of grammar-based codes for sources with countably infi alphabets,” Proc.of the 2003 IEEE Intern. Symp. Inform. Theory, Yokohama, Japan, June 29 – July 4, pp.  50-50, 2003.

[189] Y. Jia and E.-H. Yang, “Lossless image compression using context-dependent multilevel 2D pattern matching,” Proc.of the 2003 IEEE Intern. Symp. Inform. Theory, Yokohama, Japan, June 29 – July 4, pp. 475-475, 2003.

[190] A. Kaltchenko and E.-H. Yang, “Invariance of stationary and ergodic properties of a quantum source under memoryless transformations,” Proc.of the 2003 IEEE Intern.Symp. Inform. Theory, Yokohama, Japan, June 29 – July 4, pp. 458-458, 2003.

 [191] G. Wu, E.-H. Yang, and W. Sun, “Optimization strategies for quantization watermark- ing with applications to image authentication,” the Proc. of the 2003 IEEE Interna- tional Conference on Acoustics, Speech, and Signal Processing, Hong Kong, China, April 6–10, Vol. 5, pp. V 672-V 675, 2003.

[192] A. Kaltchenko and E.-H. Yang, “Universal compression of classically correlated sta- tionary quantum sources,” Proc.of SPIE Vol. 5105 Quantum Information and Com- putation, pp.  104–115, SPIE, Bellingham, WA, 2003.

[193] Y. Jia, E.-H. Yang, D.-K. He, and S. Chan, “Speeding up arithmetic coding using greedy re-normalization,“ Proc.DCC’2003(Snowbird,Utah), USA, March 25 - 27, pp. 432-432, 2003.

[194] D.-K. He and E.-H. Yang, “The compression performance of grammar-based codes re- visited,” Proc.of the 2002 IEEE Intern. Symp. Inform. Theory, Lausanne, Switzer- land , June 30 - July 5, pp. 290.

[195] E.-H. Yang, “On the joint optimization of model selection and coding,” Proc.of the2002 IEEE Intern. Symp. Inform. Theory, Lausanne, Switzerland , June 30 - July 5, pp. 206.

[196] E.-H. Yang and D.-K. He, “Yang-Kieffer algorithms and 1-D run-length encoding: Compression performance comparison,”Proc.of the 2001 Canadian Workshop on In- formation Theory, Vancouver, British Columbia, Canada, June 3-5, pp.  28–31.

[197] Y. Jia and E.-H. Yang, “Context-dependent multilevel pattern  matching  for  lossless image compression,” Proc.of the 2001 Canadian Workshop on Information Theory, Vancouver, British Columbia, Canada, June 3-5, pp.  48–51.

[198] E.-H. Yang and D.-K. He, “Efficient universal lossless data compression algorithms based on a greedy sequential context-dependent grammar transform,” Proc.of the2001 IEEE Intern. Symp. Inform. Theory, Washington D.C., USA, June 24–29, pp. 78.

[199] E.-H. Yang and Y. Jia, “YK data compression algorithms: Complexity, implemen- tation, and experimental results,” Proc.of the 2001 IEEE Intern. Symp. Inform.Theory, Washington D.C., USA, June 24–29, pp. 77.

[200] E.-H. Yang, “Grammar-based coding and its applications,” Proc.of the 22th Annual Meeting of the Canadian Applied & Industrial Mathematics Society, Victoria, British Columbia, Canada, June 7-9, 2001, pp. 39 (invitedpaper).

[201] J. Kieffer and E.-H. Yang, “Structurally equivalent grammars in lossless data com- pression,” Proc.of the 38th Allerton Conference on Communications, Control, and Computing, Oct.4–6, 2000 (invitedpaper).

[202] E.-H. Yang and J. Guo, “Lossless image coding via one-dimensional grammar based codes,” Proc.of the 16th IFIP World Computer Congress—2000 International Con- ference on Communication Technology(Beijing, China), August 21–25, pp. 966–972, 2000.

[203] E.-H.  Yang, A. Kaltchenko, and J. C. Kieffer, “Universal lossless data compression with side information by using a conditional MPM grammar transform,” Proc.of the 2000 IEEE Intern. Symp. Inform. Theory, Sorrento, Italy, June 25–30, pp. 298.

[204] E.-H. Yang and Y. Jia, “Universal lossless coding of sources with large and unbounded alphabets,” Proc.of the 2000 IEEE Intern. Symp. Inform. Theory, Sorrento, Italy, June 25–30, pp. 16.

[205] J. C. Kieffer, R. Stites, and E.-H. Yang, “A universal lossless resolution scalable pro- gressive image code,” Proc.of the 2000 IEEE Intern. Symp. Inform. Theory, Sorrento, Italy, June 25–30, pp.295.

[206] J. C. Kieffer, P. Flajolet, and E.-H. Yang, “Data compression via binary decision diagrams,” Proc.of the 2000 IEEE Intern. Symp. Inform. Theory, Sorrento, Italy, June 25–30, pp.296.

[207] A. Banerji and E.-H. Yang, “Applications of YK algorithms to the Internet transmis- sion of web-data: Implementation issues and modifi Proc.DCC’2000(Snowbird,Utah), USA, March 28–30, pp. 546, 2000.

[208] J. C. Kieffer and E.-H. Yang, “Lossless data compression via guided approximate bisections,” Proc.of the 34th Annual Conference on Information Sciences and Systems, Princeton, USA, March 15–17, pp. TP6-1–TP6-6, 2000(invitedpaper).

[209]  J. K. Lanctot, Ming Li, and E.-H. Yang, “Estimating DNA sequence entropy,” Proceed-ings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms(SODA’2000), San Francisco, California, USA, Jan.  9–11, 2000, pp.  409–418.

[210] E.-H. Yang and J. C. Kieffer, “Universal source coding theory based on grammar trans- forms,” Proc.of the 1999 IEEE Information Theory and Communications Workshop, Kruger National Park, South Africa, June 20-25, pp.  75–77(invitedpaper).

[211] E.-H. Yang and Y. Jia, “Efficient universal compression of integer sequences by using multilevel arithmetic coding,” Proc.of the 1999 Canadian Workshop on Information Theory, Kingston, Ontario, Canada, June 15-18, pp.  40–43.

[212] J. C. Kieffer and E.-H. Yang, “A simple technique for bounding the pointwise redun- dancy of the 1978 Lempel-Ziv algorithm,” Proc.DCC’99(Snowbird,Utah), pp. 434-441.   

[213] E.-H. Yang and Z. Zhang, “Abstract alphabet source coding theorem revisited: Re-dundancy analysis,” Proc.  of the 1998 IEEE Intern.  Symp.  Inform.  Theory, MIT,Boston, USA, August 16-21, pp. 69.

[214] E.-H. Yang and Z. Zhang, “The redundancy of universal fi d rate source coding,” Proc.of the 1998 IEEE Intern. Symp. Inform. Theory, MIT, Boston, USA, August 16-21, pp. 172.

[215] E.-H. Yang and Z. Zhang, “Variable rate trellis source encoding,” Proc.of the 1998 IEEE Intern. Symp. Inform. Theory, MIT, Boston, USA, August 16-21, pp. 369.

[216] J. Kieffer and E.-H. Yang, “Redundancy of MPM data compression system,” Proc.of the 1998 IEEE Intern. Symp. Inform. Theory, MIT, Boston, USA, August 16-21, pp. 136.

[217] J. Kieffer and E.-H. Yang, “Design of context-free grammars for lossless data compres- sion,” Proc.of the 1998 IEEE Information Theory Workshop, Killarney, Ireland, June 22–26, pp. 84–85.

[218] J. Kieffer and E.-H. Yang, “Lossless data compression  algorithms  based  on  substi- tution tables,” Proc.of the 1998 Canadian Conference on Electrical and Computer Engineering(Waterloo, Ontario), Vol. 2, pp. 629–632, May 24–28, 1998.

[219] E.-H. Yang and Z. Zhang, “On the analysis and design of variable rate trellis source codes,” Proc.of the 1998 Canadian Conference on Electrical and Computer Engineer- ing(Waterloo, Ontario), Vol.  2, pp.  541–544, May 24–28, 1998.

[220] J. Kieffer, E.-H. Yang, I. Park, and S. Yakowitz, “Complexity of preprocessor in MPM data compression systems,” Proc.DCC’98(Snowbird,Utah), pp. 554.

[221] E.-H. Yang and Z. Zhang, “Abstract alphabet source coding theorem revisited,” 1997 Symposium on Information Theory at the International Conference on Statistical In- ference, Combinatorics, and Related Areas, Dec. 18–21, 1997, Varanasi, India, pp. 75 (invitedpaper).

[222] Bin Zhu, En-hui Yang, and Ahmed. H. Tewfik , “Dual set arithmetic coding and its applications to image coding,” EUSIPCO-96, VIII European Signal Proc. Conf., Trieste, Italy, Vol. 1, pp. 324-327, Sept. 1996.

[223] E.-H. Yang and Z. Zhang, “The Gold-Washing data compression algorithm(III): Re- dundancy analysis,” Proc.of the 1996 IEEE Workshop on Inform. Theory, Haifa, Israel(invited  paper).

[224] B. Zhu, E.-H. Yang, A. H. Tewfik, and J. C. Kieffer, “Efficient coding of wavelet trees and its applications to image coding,” Proc.1996 SPIE Conf. on Visual Communica- tions and Image Processing(Orlando, FL, USA), Vol. 2727, pp. 512–523.

[225] R. Ahlswede, E.-H. Yang, and Z. Zhang, “Identification via compressed data(II),” Proc.of the 1995 IEEE Intern. Symp. Inform. Theory, Whistler, B.C., Canada, pp. 69(long talk).

[226] Z. Zhang, E.-H. Yang, and V. K. Wei, “On the redundancy of lossy source coding,” Proc. of the 1995 IEEE Workshop on Inform. Theory, Rydzyna, Poland, pp. 31-32 (invitedpaper).

[227] E.-H. Yang and J. C. Kieffer, “String matching data compression algorithms: Perfor- mance analysis,” Proc.of the 33th Allerton Conference on Communications, Control, and Computing, pp. 881–890, Oct., 1995 (invitedpaper).

[228] Q. Liu, E.-H. Yang, and Z. Zhang, “A fixed slope universal sequential algorithm for lossy source coding based on the Gold-washing mechanism,” Proc.of the 33th Allerton Conference on Communications, Control, and Computing, pp. 466–474, Oct., 1995.

[229] W.S. Chen, E.-H.  Yang,  and  Z.  Zhang,  “A  variant  of  address  vector  quantization for image compression using lossless conditional entropy coding,” Proc.ICASSP’95(Detroit, USA), May, pp.  2483–2486.

[230] W.S. Chen, Z. Zhang, and E.-H. Yang, “A hybrid adaptive vector quantizer for image compression via the Gold-washing mechanism,” Proc.1995 SPIE Visual Communica- tion and Image Processing(Taipei, Taiwan), Vol. 2501, pp. 635–646.

[231] W.S. Chen, Z. Zhang, E.-H. Yang, and S. S. Bor, “A modified stack search algorithm for VQ-based tree encoding,” Proceedingsof the 1995 IEEE Global Telecommunications conference(Singapore), Vol. 1, pp. 462–467.

[232] Z. Zhang, E.-H. Yang, and V. K. Wei, “On the redundancy of lossy source coding(II),” Proc.of the 1995 IEEE Intern. Symp. Inform. Theory, Whistler, B.C., Canada, pp. 190(long talk).