Every graphon defines a random graph on any given number n of vertices. It was known that the graphon is random-free if and only if the entropy of this random graph is subquadratic. We prove that for random-free graphons, this entropy can grow as fast as any subquadratic function. However, if the graphon belongs to the closure of a random-free graph property, then the entropy is O(n logn). We a...

We propose a new low-complexity entropy-coding method to be used for coding waveform signals. It is based on the combination of two schemes: (1) an alphabet partitioning method to reduce the complexity of the entropy-coding process; (2) a new recursive set partitioning entropy-coding process that achieves rates smaller than rst order entropy even with fast Hu man adaptive codecs. Numerical resu...

We investigate nonequilibrium underdamped Langevin dynamics of Brownian particles that interact through a harmonic potential with coupling constant K and are in thermal contact with two heat baths at different temperatures. The system is characterized by a net heat flow and an entropy production in the steady state. We compare the entropy production of the harmonic system with that of Brownian ...

In this paper, a fast motion compensation algorithm is proposed that improves coding efficiency for video sequences with brightness variations. We also propose a cross entropy measure between histograms of two frames to detect brightness variations. The framewise brightness variation parameters, a multiplier and an offset field for image intensity, are estimated and compensated. Simulation resu...

This paper describes a fast, low-complexity, entropy efficient video coder for wavelet pyramids. This coder approaches the entropy-limited coding rate of video wavelet pyramids, is fast in both hardware and software implementations, and has low complexity (no multiplies) for use in ASICs. It consists of a modified Z-coder used to code the zero/non-zero significance function and Huffman coding f...

We propose a new collaborative filtering method that can predict the next purchase item by efficiently using the sequential information in purchase histories for recommendations. Markov models and maximum entropy models are both widely used techniques for such recommendations. In Markov models, parameters can be estimated and updated fast and efficiently, but predictions may not be accurate. On...

With the fast development of wearable medical device in recent years, it becomes critical to conduct research on continuously measured physiological signals. Entropy is a key metric for quantifying the irregularity and/or complexity contained in human physiological signals. In this review, we focus on exploring how entropy changes in various physiological signals in cardiovascular diseases. Our...

automatic facial recognition has many potential applications in different areas of humancomputer interaction. however, they are not yet fully realized due to the lack of an effectivefacial feature descriptor. in this paper, we present a new appearance based feature descriptor,the local directional pattern (ldp), to represent facial geometry and analyze its performance inrecognition. an ldp feat...

Sample entropy is a widely used method for assessing the irregularity of physiological signals, but it has high computational complexity, which prevents its application time-sensitive scenes. To improve performance sample analysis continuous monitoring clinical data, fast algorithm based on OpenCL was proposed in this paper. an open standard supported by majority graphics processing unit (GPU) ...