47,532 research outputs found
An efficient rate control algorithm for a wavelet video codec
Rate control plays an essential role in video coding and transmission to provide the best video quality at the receiver's end given the constraint of certain network conditions. In this paper, a rate control algorithm using the Quality Factor (QF) optimization method is proposed for the wavelet-based video codec and implemented on an open source Dirac video encoder. A mathematical model which we call Rate-QF (R - QF) model is derived to generate the optimum QF for the current coding frame according to the target bitrate. The proposed algorithm is a complete one pass process and does not require complex mathematical calculation. The process of calculating the QF is quite simple and further calculation is not required for each coded frame. The experimental results show that the proposed algorithm can control the bitrate precisely (within 1% of target bitrate in average). Moreover, the variation of bitrate over each Group of Pictures (GOPs) is lower than that of H.264. This is an advantage in preventing the buffer overflow and underflow for real-time multimedia data streaming
Recommended from our members
On defining partition entropy by inequalities
Partition entropy is the numerical metric of uncertainty within
a partition of a finite set, while conditional entropy measures the degree of
difficulty in predicting a decision partition when a condition partition is
provided. Since two direct methods exist for defining conditional entropy
based on its partition entropy, the inequality postulates of monotonicity,
which conditional entropy satisfies, are actually additional constraints on
its entropy. Thus, in this paper partition entropy is defined as a function
of probability distribution, satisfying all the inequalities of not only partition
entropy itself but also its conditional counterpart. These inequality
postulates formalize the intuitive understandings of uncertainty contained
in partitions of finite sets.We study the relationships between these inequalities,
and reduce the redundancies among them. According to two different
definitions of conditional entropy from its partition entropy, the convenient
and unified checking conditions for any partition entropy are presented, respectively.
These properties generalize and illuminate the common nature
of all partition entropies
The Evolution of Neural Network-Based Chart Patterns: A Preliminary Study
A neural network-based chart pattern represents adaptive parametric features,
including non-linear transformations, and a template that can be applied in the
feature space. The search of neural network-based chart patterns has been
unexplored despite its potential expressiveness. In this paper, we formulate a
general chart pattern search problem to enable cross-representational
quantitative comparison of various search schemes. We suggest a HyperNEAT
framework applying state-of-the-art deep neural network techniques to find
attractive neural network-based chart patterns; These techniques enable a fast
evaluation and search of robust patterns, as well as bringing a performance
gain. The proposed framework successfully found attractive patterns on the
Korean stock market. We compared newly found patterns with those found by
different search schemes, showing the proposed approach has potential.Comment: 8 pages, In proceedings of Genetic and Evolutionary Computation
Conference (GECCO 2017), Berlin, German
Zero-shot keyword spotting for visual speech recognition in-the-wild
Visual keyword spotting (KWS) is the problem of estimating whether a text
query occurs in a given recording using only video information. This paper
focuses on visual KWS for words unseen during training, a real-world, practical
setting which so far has received no attention by the community. To this end,
we devise an end-to-end architecture comprising (a) a state-of-the-art visual
feature extractor based on spatiotemporal Residual Networks, (b) a
grapheme-to-phoneme model based on sequence-to-sequence neural networks, and
(c) a stack of recurrent neural networks which learn how to correlate visual
features with the keyword representation. Different to prior works on KWS,
which try to learn word representations merely from sequences of graphemes
(i.e. letters), we propose the use of a grapheme-to-phoneme encoder-decoder
model which learns how to map words to their pronunciation. We demonstrate that
our system obtains very promising visual-only KWS results on the challenging
LRS2 database, for keywords unseen during training. We also show that our
system outperforms a baseline which addresses KWS via automatic speech
recognition (ASR), while it drastically improves over other recently proposed
ASR-free KWS methods.Comment: Accepted at ECCV-201
A frequency domain equalizer for amplify-and-forward underwater acoustic relay communication systems
In this paper, we apply the amplify-and-forward relay technique to simultaneously increase the range and data rate of underwater acoustic communication by dividing the channel between transmitter and receiver into two hops. Due to the application of the relay node, the delay spread of the effective transmitter-relay-receiver multipath channel is longer than that of the direct transmitter-receiver channel, which increases the complexity of channel equalization at the receiver. To reduce the computational complexity of channel equalization, a fractionally-spaced frequency domain equalizer (FS-FDE) isdesigned in this paper. Simulation results illustrate that compared with the direct path communication, significant bit-error-rate performance improvement can be achieved through using relay technique in underwater acoustic communication
Approximation of conformal mappings by circle patterns
A circle pattern is a configuration of circles in the plane whose
combinatorics is given by a planar graph G such that to each vertex of G
corresponds a circle. If two vertices are connected by an edge in G, the
corresponding circles intersect with an intersection angle in .
Two sequences of circle patterns are employed to approximate a given
conformal map and its first derivative. For the domain of we use
embedded circle patterns where all circles have the same radius decreasing to 0
and which have uniformly bounded intersection angles. The image circle patterns
have the same combinatorics and intersection angles and are determined from
boundary conditions (radii or angles) according to the values of (
or ). For quasicrystallic circle patterns the convergence result is
strengthened to -convergence on compact subsets.Comment: 36 pages, 7 figure
- …