Shueng-Han Gary Chan

Shueng-Han Gary Chan

Auto-generated profile, based on publicly available information

Shueng-Han Gary Chan

The Hong Kong University of Science and Technology, Hong Kong, Hong Kong

Research Focus & Metrics

Academic Career Length

35Years (1992-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 December 2007 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
WYW.-P. Ken Yiu
W.-P. Ken Yiu
XJXing Jin
Xing Jin
SCS.-H. Gary Chan
S.-H. Gary Chan
Provisioning random access functions in peer-to-peer on-demand video streaming is challenging, due to not only the asynchronous user interactivity but also the unpredictability of group dynamics. In this paper, we propose VMesh, a distributed peer-to-peer video-on-demand (VoD) streaming scheme which efficiently supports random seeking functionality. In VMesh, videos are divided into segments and stored at peers' local storage in a distributed manner. An overlay mesh is built upon peers to support random forward/backward seek, pause and restart during playback. Our scheme takes advantage of the large aggregate storage capacity of peers to improve the segment supply so as to support efficient interactive commands in a scalable manner. Unlike previous work based on "cache-and-relay" mechanism, in our scheme, user interactivity such as random seeking performed by a peer does not break the connections between it and its children, and hence our scheme achieves better playback continuity. Through simulation, we show that our system achieves low startup and seeking latency under random user interactivity and peer join/leave which is a crucial requirement in an interactive VoD system.

26 February 2007 in IEEE Transactions on Broadcasting
Verified
Journal Article
Closed access
MLMan-Fung Leung
Man-Fung Leung
SCS.-H. Gary Chan
S.-H. Gary Chan
In traditional mobile streaming networks such as 3G cellular networks, all users pull streams from a server. Such pull model leads to high streaming cost and problem in system scalability. In this paper, we propose and investigate a fully distributed, scalable, and cost-effective protocol to distribute multimedia content to mobiles in a peer-to-peer manner. Our protocol, termed Collaborative Streaming among Mobiles (COSMOS), makes use of broadcasting and data sharing to achieve high performance (in terms of delay, cost fairness, stream continuity, etc.). In COSMOS, only a few peers pull video descriptions from base stations. Using a free broadcast channel (such as Wi-Fi and Bluetooth), they share the streams to nearby neighbors. As a result, COSMOS greatly reduces the streaming cost and cellular bandwidth requirement. Furthermore, as video streams are supplied by multiple peers, COSMOS is robust to peer failure. Since broadcasting is used to distribute video data, COSMOS is highly scalable to large number of users. In COSMOS, peers autonomously determine whether to broadcast packets or not in order to efficiently use of the channel bandwidth. By taking turns to pull descriptions, peers can effectively share, and hence substantially reduce, streaming cost. As broadcast scope is small and peers can often obtain a number of streams from its neighbors, COSMOS achieves low delay and excellent stream continuity

23 April 2007 in IEEE MultiMedia
Verified
Journal Article
Closed access
WYW.-P. Ken Yiu
W.-P. Ken Yiu
XJXing Jin
Xing Jin
SCS.-H. Gary Chan
S.-H. Gary Chan
Large-scale multimedia streaming over the Internet requires an enormous amount of server and network resources. Traditional client-server approaches allocate a dedicated stream from the server for each client request, which is expensive and doesn't scale well. By using end hosts' huge bandwidth and computational capacity, peer-to-peer technologies shed new light on media streaming applications' development. Yet, locating supplying peers and content delivery path maintenance are two major challenges in this area

1 April 2008
Verified
Conference Paper
Closed access
DRD. Ren
D. Ren
YLY.-T. Li
Y.-T. Li
SCS.-H. Chan
S.-H. Chan
Peer-to-peer (P2P) technology has emerged as a promising scalable solution for live streaming to large group. In this paper, we address the design of overlay which achieves low source-to-peer delay, is robust to user churn, accommodates of asymmetric and diverse uplink bandwidth, and continuously improves based on existing user pool. A natural choice is the use of mesh, where each peer is served by multiple parents. Since the peer delay in a mesh depends on its longest path through its parents, we study how to optimize such delay while meeting a certain streaming rate requirement. We first formulate the minimum delay mesh problem and show that it is NP-hard. Then we propose a centralized heuristic based on complete knowledge which serves as our benchmark and optimal solution for all the other schemes under comparison. Our heuristic makes use of the concept of power in network given by the ratio of throughput and delay. By maximizing the network power, our heuristic achieves very low delay. We then propose a simple distributed algorithm where peers select their parents based on the power concept. The algorithm makes continuous improvement on delay until some minimum delay is reached. Simulation results show that our distributed protocol performs close to the centralized one, and substantially outperforms traditional and state-of-the-art approaches.

30 December 2022 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Open access
GLGuanyao Li
Guanyao Li
SZShuhan Zhong
Shuhan Zhong
XDXingdong Deng
Xingdong Deng
LXLetian Xiang
Letian Xiang
SCS.-H. Gary Chan
S.-H. Gary Chan
WPWen-Chih Peng
Wen-Chih Peng
We study the forecasting problem for traffic with dynamic, possibly periodical, and joint spatial-temporal dependency between regions. Given the aggregated inflow and outflow traffic of regions in a city from time slots 0 to $t - 1$ , we predict the traffic at time $t$ for any region. Prior arts in the area often considered the spatial and temporal dependencies in a decoupled manner, or were rather computationally intensive in training with a large number of hyper-parameters which needed tuning. We propose ST-TIS, a novel, lightweight and accurate Spatial-Temporal Transformer with information fusion and region sampling for traffic forecasting. ST-TIS extends the canonical Transformer with information fusion and region sampling. The information fusion module captures the complex spatial-temporal dependency between regions. The region sampling module is to improve the efficiency and prediction accuracy, cutting the computation complexity for dependency learning from $O(n^{2})$ to $O(n\sqrt{n})$ , where $n$ is the number of regions. With far fewer parameters than state-of-the-art deep learning models, ST-TIS's offline training is significantly faster in terms of tuning and computation (with a reduction of up to $90\%$ on training time and network parameters). Notwithstanding such training efficiency, extensive experiments show that ST-TIS is substantially more accurate in online prediction than state-of-the-art approaches (with an average improvement of $9.5\%$ on RMSE, and $12.4\%$ on MAPE compared to STDN and DSAN).

3 November 2009 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
MMMengyao Ma
Mengyao Ma
OAOscar C. Au
Oscar C. Au
SCS.-H. Gary Chan
S.-H. Gary Chan
MSMing-Ting Sun
Ming-Ting Sun
In this paper we propose an edge-directed error concealment (EDEC) algorithm, to recover lost slices in video sequences encoded by flexible macroblock ordering. First, the strong edges in a corrupted frame are estimated based on the edges in the neighboring frames and the received area of the current frame. Next, the lost regions along these estimated edges are recovered using both spatial and temporal neighboring pixels. Finally, the remaining parts of the lost regions are estimated. Simulation results show that compared to the existing boundary matching algorithm [1] and the exemplar-based inpainting approach [2] , the proposed EDEC algorithm can reconstruct the corrupted frame with both a better visual quality and a higher decoder peak signal-to-noise ratio.