74 citations · 99 across the 8 of their papers we have counts for
8 papers
SG-FCN: A Motion and Memory-Based Deep Learning Model for Video Saliency Detection
Meijun Sun, Ziqi Zhou, QinGhua Hu +2
Data-driven saliency detection has attracted strong interest as a result of applying convolutional neural networks to the detection of eye fixations. Although a number of imagebase…
LAMOST CCD camera-control system based on RTS2
Yuan Tian, Zheng Wang, Jian Li +4
The Large Sky Area Multi-Object Fiber Spectroscopic Telescope (LAMOST) is the largest existing spectroscopic survey telescope, having 32 scientific charge-coupled-device (CCD) came…
Optimal Multiple Trading Times Under the Exponential OU Model with Transaction Costs
Tim Leung, Xin Li, Zheng Wang
This paper studies the timing of trades under mean-reverting price dynamics subject to fixed transaction costs. We solve an optimal double stopping problem to determine the optimal…
On the Geometric Ergodicity of Metropolis-Hastings Algorithms for Lattice Gaussian Sampling
Zheng Wang, Cong Ling
Sampling from the lattice Gaussian distribution is emerging as an important problem in coding and cryptography. In this paper, the classic Metropolis-Hastings (MH) algorithm from M…
Channel Coding in Random Access Communication over Compound Channels
Zheng Wang, Jie Luo
Due to the short and bursty incoming messages, channel access activities in a wireless random access system are often fractional. The lack of frequent data support consequently mak…
Error Performance of Channel Coding in Random Access Communication
Zheng Wang, Jie Luo
A new channel coding approach was proposed in [1] for random multiple access communication over the discrete-time memoryless channel. The coding approach allows users to choose the…
Fountain Communication using Concatenated Codes
Zheng Wang, Jie Luo
This paper extends linear-complexity concatenated coding schemes to fountain communication over the discrete-time memoryless channel. Achievable fountain error exponents for one-le…
Approaching Blokh-Zyablov Error Exponent with Linear-Time Encodable/Decodable Codes
Zheng Wang, Jie Luo
Guruswami and Indyk showed in [1] that Forney's error exponent can be achieved with linear coding complexity over binary symmetric channels. This paper extends this conclusion to g…