Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

John Z. Sun

dblp:09/7666 · DBLP profile ↗
← Back
5ranked-venue papers
5as first author
0since 2021 · last 2013
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 2 first-authorComputer networks · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Coding theory · 100%
Computer networks
1 paper
Internet of things and sensor networks · 100%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › source coding › multiterminal source coding
distributed source coding
0.212013
Intersensor Collaboration in Distributed Quantization Networks · IEEE Trans. Commun. 2013
Coding theory › source coding
rate allocation
0.212013
Intersensor Collaboration in Distributed Quantization Networks · IEEE Trans. Commun. 2013

Methods — techniques the papers use, named apart from their topics

high-resolution quantization theory · 0.3asymptotic analysis · 0.3
YearPublicationVenuePosition
2013 Rate loss in distributed functional source coding
abstract
For point-to-point and distributed communication of continuous sources, high-resolution quantization theory provides an achievable rate-distortion trade-off that is simple to compute and motivates practical compression architectures. Moreover, high-resolution analysis gives good inner bounds for the Shannon rate-distortion region when a more general characterization is difficult. In this paper, we analyze the sum-rate gap between coded nonuniform scalar quantization and the Shannon rate- distortion region for a system that requires fidelity in a computation applied to the source variables. We find that the loss can be as low as 0.255 bits/sample, which has previously been observed in the point-to-point setting, and it is achieved using a simple architecture of nonuniform quantization followed by Slepian-Wolf coding.
John Z. Sun, Vivek K. Goyal
ISIT1
2013 Intersensor Collaboration in Distributed Quantization Networks
abstract
Several key results in distributed source coding offer the intuition that little improvement in compression can be gained from intersensor communication when the information is coded in long blocks. However, when sensors are restricted to code their observations in small blocks (e.g., one) or desire fidelity of a computation applied to source realizations, intelligent collaboration between sensors can greatly reduce distortion. For networks where sensors are allowed to "chat" using a side channel that is unobservable at the fusion center, we provide asymptotically-exact characterization of distortion performance and optimal quantizer design in the high-resolution (low-distortion) regime using a framework called distributed functional scalar quantization (DFSQ). The key result is that chatting can dramatically improve performance even when intersensor communication is at very low rate. We also solve the rate allocation problem when communication links have heterogeneous costs and provide a detailed example to demonstrate the theoretical and practical gains from chatting. This example for maximum computation gives insight on the gap between chatting and distributed networks, and how to optimize the intersensor communication.
John Z. Sun, Vivek K. Goyal
IEEE Trans. Commun.1
2012 Dynamic matrix factorization: A state space approach
abstract
Matrix factorization from a small number of observed entries has recently garnered much attention as the key ingredient of successful recommendation systems. One unresolved problem in this area is how to adapt current methods to handle changing user preferences over time. Recent proposals to address this issue are heuristic in nature and do not fully exploit the time-dependent structure of the problem. As a principled and general temporal formulation, we propose a dynamical state space model of matrix factorization. Our proposal builds upon probabilistic matrix factorization, a Bayesian model with Gaussian priors. We utilize results in state tracking, i.e. the Kalman filter, to provide accurate recommendations in the presence of both process and measurement noise. We show how system parameters can be learned via expectation-maximization and provide comparisons to current published techniques.
John Z. Sun, Kush R. Varshney, Karthik Subbian
ICASSP1
2011 Scalar Quantization for Relative Error
abstract
Quantizers for probabilistic sources are usually optimized for mean-squared error. In many applications, maintaining low relative error is a more suitable objective. This measure has previously been heuristically connected with the use of logarithmic companding in perceptual coding. We derive optimal companding quantizers for fixed rate and variable rate under high-resolution assumptions. The analysis shows logarithmic companding is optimal for variable-rate quantization but generally not for fixed-rate quantization. Naturally, the improvement in relative error from using a correctly optimized quantizer can be arbitrarily large. We extend this framework for a large class of nondifference distortions.
John Z. Sun, Vivek K. Goyal
DCC1
2009 Optimal quantization of random measurements in compressed sensing
abstract
Quantization is an important but often ignored consideration in discussions about compressed sensing. This paper studies the design of quantizers for random measurements of sparse signals that are optimal with respect to mean-squared error of the lasso reconstruction. We utilize recent results in high-resolution functional scalar quantization and homotopy continuation to approximate the optimal quantizer. Experimental results compare this quantizer to other practical designs and show a noticeable improvement in the operational distortion-rate performance.
John Z. Sun, Vivek K. Goyal
ISIT1