Video codecs that use motion compensation have shown PSNR gains from the use of multiple frame prediction, in which more than one past reference frame is available for motion estimation. In dual frame motion compensat...
详细信息
Video codecs that use motion compensation have shown PSNR gains from the use of multiple frame prediction, in which more than one past reference frame is available for motion estimation. In dual frame motion compensation, one short-term reference frame and one long-term reference frame are available for prediction. In this paper, we propose a dual frame motion compensation technique that allocates bits unevenly among frames to periodically create a high-quality frame that serves as the long-term reference frame for some time. By modifying an MPEG-4 encoder to use this technique on a set of video sequences, we show that it outperforms a normal dual frame motion compensation scheme in which the long-term reference frames are regular frames that are not allocated any extra rate.
The performance of the Eulerian gyrokinetic-Maxwell solver code GYRO is analyzed on five high performance computing systems. First, a manual approach is taken, using custom scripts to analyze the output of embedded wa...
The performance of the Eulerian gyrokinetic-Maxwell solver code GYRO is analyzed on five high performance computing systems. First, a manual approach is taken, using custom scripts to analyze the output of embedded wallclock timers, floating point operation counts collected using hardware performance counters, and traces of user and communication events collected using the profiling interface to Message Passing Interface (MPI) libraries. Parts of the analysis are then repeated or extended using a number of sophisticated performance analysis tools: IPM, KOJAK, SvPablo, TAU, and the PMaC modeling tool suite. The paper briefly discusses what has been discovered via this manual analysis process, what performance analyses are inconvenient or infeasible to attempt manually, and to what extent the tools show promise in accelerating or significantly extending the manual performance analyses.
Wireless sensor networks are continually being deployed in various application areas which are posing various new challenges. Yet, one problem that still remains central to the operability and applicability of sensor ...
详细信息
lattice mismatch between substrates and epitaxial layers of different mole-fractions can create a variety of distortions and defects in HgCdTe epilayers, thus degrading the performance of infrared detectors fabricated...
详细信息
lattice mismatch between substrates and epitaxial layers of different mole-fractions can create a variety of distortions and defects in HgCdTe epilayers, thus degrading the performance of infrared detectors fabricated from this material. X-ray diffractometry is a sensitive non-destructive technique, which allows in-depth characterisation of the crystal lattice prior to detector fabrication. We present results of triple-axis diffractometry (TAD) performed on single and double layer HgCdTe films grown on (211)B CdZnTe substrates by molecular beam epitaxy (MBE). The positions of both surface-symmetric and asymmetric diffraction peaks have been used to extract lattice spacings parallel and perpendicular to the (211) growth direction. The unstrained lattice parameter of each epilayer has been calculated assuming that the layers are elastically strained. The low-symmetry of the (211) plane, coupled with the anisotropic elasticity of zinc-blende semiconductors, results in monoclinic distortion of the lattice, as observed in these samples. In double layer samples, the mosaicity of both layers is greater than that observed in single epilayers. Annealed samples show greater lattice distortion than as-grown samples
Increasing application requirements have placed heavy emphasis on building overlay networks to efficiently deliver data to multiple receivers. A key performance challenge is simultaneously achieving adaptivity to chan...
详细信息
Increasing application requirements have placed heavy emphasis on building overlay networks to efficiently deliver data to multiple receivers. A key performance challenge is simultaneously achieving adaptivity to changing network conditions and scalability to large numbers of users. In addition, most current algorithms focus on a single performance metric, such as delay or bandwidth, particular to individual application requirements. We introduce a two-fold approach for creating robust, high-performance overlays called adaptive multimetric overlays (AMMO). First, AMMO uses an adaptive, highly-parallel, and metric-independent protocol, TreeMaint, to build and maintain overlay trees. Second, AMMO provides a mechanism for comparing overlay edges along specified application performance goals to guide TreeMaint transformations. We have used AMMO to implement and evaluate a single-metric (bandwidth-optimized) tree similar to Overcast and a two-metric (delay-constrained, cost-optimized) overlay.
The accurate modeling of the electronic structure of atoms and molecules involves computationally intensive tensor contractions over large multi-dimensional arrays. Efficient computation of these contractions usually ...
详细信息
We present an algorithm for binary image transformation using chaotic maps. Because of its random-like behavior, chaos is a good candidate for encryption. We show that a two-dimensional discrete time dynamical system ...
详细信息
We present an algorithm for binary image transformation using chaotic maps. Because of its random-like behavior, chaos is a good candidate for encryption. We show that a two-dimensional discrete time dynamical system with one positive Lyapunov exponent allows the transformation of the image in an unpredictable manner. The suggested algorithm acts on the pixel position, where the diffusion property resulting from the sensitivity to the initial states is used to accomplish the transformation in a random-like way. The suggested algorithm uses three types of keys: initial state, external parameters and the number of iterations. Using the so-called Henon map as an example, we show that the algorithm produces almost uncorrelated images even when the keys are slightly changed, making it an attractive and fast method for image encryption.
Support vector machines (SVMs) and regularized least squares (RLS) are two recent promising techniques for classification. SVMs implement the structure risk minimization principle and use the kernel trick to extend it...
详细信息
Support vector machines (SVMs) and regularized least squares (RLS) are two recent promising techniques for classification. SVMs implement the structure risk minimization principle and use the kernel trick to extend it to the nonlinear case. On the one hand, RLS minimizes a regularized functional directly in a reproducing kernel Hilbert space defined by a kernel. While both have a sound mathematical foundation, RLS is strikingly simple. On the other hand, SVMs in general have a sparse representation of solutions. In addition, the performance of SVMs has been well documented but little can be said of RLS. This paper applies these two techniques to a collection of data sets and presents results demonstrating virtual identical performance by the two methods.
The equivalent circuit of an aperture-coupled cavity is derived via field analysis. To determine the input impedance of a cavity resonator coupled with a waveguide, the equivalent circuit is derived by making use of i...
详细信息
ISBN:
(纸本)0780383028
The equivalent circuit of an aperture-coupled cavity is derived via field analysis. To determine the input impedance of a cavity resonator coupled with a waveguide, the equivalent circuit is derived by making use of integral equations and the eigenfunction expansion of dyadic Green's functions. It is shown that the input impedance of the aperture-coupled cavity is the sum of a capacitive reactance and a load impedance resulting from an infinite number of inductively coupled parallel RLC meshes connected in series.
暂无评论