An Efficient Mode Decision Algorithm Based on Dynamic Grouping and Adaptive Adjustment for H.264/AVC

“This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder." “Copyright IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.”The rate distortion optimization (RDO) enabled mode decision (MD) is one of the most important techniques introduced by H.264/AVC. By adopting the exhaustive calculation of rate distortion, the optimal MD enhances the video encoding quality. However, the computational complexity is significantly increased, which is a key challenge for real-time and low power consumption applications. This paper presents a new fast MD algorithm for highly efficient H.264/AVC encoder. The proposed algorithm employs a dynamic group of candidate inter/intra modes to reduce the computational cost. In order to minimize the performance loss incurred by improper mode selection for the previously encoded frames, an adaptive adjustment scheme based on the undulation of bitrate and PSNR is suggested. Experimental results show that the proposed algorithm reduces the encoding time by 35% on average, and the loss of PSNR is usually limited in 0.1 dB with less than 1% increase of bitrate

An efficient fast mode decision algorithm for H.264/AVC intra/inter predictions

H.264/AVC is the newest video coding standard, which outperforms the former standards in video coding efficiency in terms of improved video quality and decreased bitrate. Variable block size based mode decision (MD) with rate distortion optimization (RDO) is one of the most impressive new techniques employed in H.264/AVC. However, the improvement on performance is achieved at the expense of significantly increased computational complexity, which is a key challenge for real-time applications. An efficient fast mode decision algorithm is then proposed in this paper. By exploiting the correlation between macroblocks and the statistical characteristics of sub-macroblock in MD, the video encoding time can be reduced 52.19% on average. Furthermore, the motion speed based adjustment scheme was introduced to minimize the degradation of performanc

Probing Dark Energy with the Kunlun Dark Universe Survey Telescope

Dark energy is an important science driver of many upcoming large-scale surveys. With small, stable seeing and low thermal infrared background, Dome A, Antarctica, offers a unique opportunity for shedding light on fundamental questions about the universe. We show that a deep, high-resolution imaging survey of 10,000 square degrees in \emph{ugrizyJH} bands can provide competitive constraints on dark energy equation of state parameters using type Ia supernovae, baryon acoustic oscillations, and weak lensing techniques. Such a survey may be partially achieved with a coordinated effort of the Kunlun Dark Universe Survey Telescope (KDUST) in \emph{yJH} bands over 5000--10,000 deg$^2$ and the Large Synoptic Survey Telescope in \emph{ugrizy} bands over the same area. Moreover, the joint survey can take advantage of the high-resolution imaging at Dome A to further tighten the constraints on dark energy and to measure dark matter properties with strong lensing as well as galaxy--galaxy weak lensing.Comment: 9 pages, 6 figure

Formalization of the fundamental group in untyped set theory using auto2

We present a new framework for formalizing mathematics in untyped set theory using auto2. Using this framework, we formalize in Isabelle/FOL the entire chain of development from the axioms of set theory to the definition of the fundamental group for an arbitrary topological space. The auto2 prover is used as the sole automation tool, and enables succinct proof scripts throughout the project.Comment: 17 pages, accepted for ITP 201

Multiparty Quantum Secret Sharing

Based on a quantum secure direct communication (QSDC) protocol [Phys. Rev. A69(04)052319], we propose a $(n,n)$-threshold scheme of multiparty quantum secret sharing of classical messages (QSSCM) using only single photons. We take advantage of this multiparty QSSCM scheme to establish a scheme of multiparty secret sharing of quantum information (SSQI), in which only all quantum information receivers collaborate can the original qubit be reconstructed. A general idea is also proposed for constructing multiparty SSQI schemes from any QSSCM scheme

Perfect State Transfer in Laplacian Quantum Walk

For a graph $G$ and a related symmetric matrix $M$, the continuous-time quantum walk on $G$ relative to $M$ is defined as the unitary matrix $U(t) = \exp(-itM)$, where $t$ varies over the reals. Perfect state transfer occurs between vertices $u$ and $v$ at time $\tau$ if the $(u,v)$-entry of $U(\tau)$ has unit magnitude. This paper studies quantum walks relative to graph Laplacians. Some main observations include the following closure properties for perfect state transfer: (1) If a $n$-vertex graph has perfect state transfer at time $\tau$ relative to the Laplacian, then so does its complement if $n\tau$ is an integer multiple of $2\pi$. As a corollary, the double cone over any $m$-vertex graph has perfect state transfer relative to the Laplacian if and only if $m \equiv 2 \pmod{4}$. This was previously known for a double cone over a clique (S. Bose, A. Casaccino, S. Mancini, S. Severini, Int. J. Quant. Inf., 7:11, 2009). (2) If a graph $G$ has perfect state transfer at time $\tau$ relative to the normalized Laplacian, then so does the weak product $G \times H$ if for any normalized Laplacian eigenvalues $\lambda$ of $G$ and $\mu$ of $H$, we have $\mu(\lambda-1)\tau$ is an integer multiple of $2\pi$. As a corollary, a weak product of $P_{3}$ with an even clique or an odd cube has perfect state transfer relative to the normalized Laplacian. It was known earlier that a weak product of a circulant with odd integer eigenvalues and an even cube or a Cartesian power of $P_{3}$ has perfect state transfer relative to the adjacency matrix. As for negative results, no path with four vertices or more has antipodal perfect state transfer relative to the normalized Laplacian. This almost matches the state of affairs under the adjacency matrix (C. Godsil, Discrete Math., 312:1, 2011).Comment: 26 pages, 5 figures, 1 tabl

Multiparty Quantum Secret Sharing Based on Entanglement Swapping

A multiparty quantum secret sharing (QSS) protocol is proposed by using swapping quantum entanglement of Bell states. The secret messages are imposed on Bell states by local unitary operations. The secret messages are split into several parts and each part is distributed to a party so that no action of a subset of all the parties but their entire cooperation is able to read out the secret messages. In addition, the dense coding is used in this protocol to achieve a high efficiency. The security of the present multiparty QSS against eavesdropping has been analyzed and confirmed even in a noisy quantum channel.Comment: 5 page

Optical generation of hybrid entangled state via entangling single-photon-added coherent state

We propose a feasible scheme to realize the optical entanglement of single-photon-added coherent state (SPACS) and show that, besides the Sanders entangled coherent state, the entangled SPACS also leads to new forms of hybrid entanglement of quantum Fock state and classical coherent state. We probe the essential difference of two types of hybrid entangled state (HES). This HES provides a novel link between the discrete- and the continuous-variable entanglement in a natural way.Comment: 6 pages, 2 figure

Molecular wires acting as quantum heat ratchets

We explore heat transfer in molecular junctions between two leads in the absence of a finite net thermal bias. The application of an unbiased, time-periodic temperature modulation of the leads entails a dynamical breaking of reflection symmetry, such that a directed heat current may emerge (ratchet effect). In particular, we consider two cases of adiabatically slow driving, namely (i) periodic temperature modulation of only one lead and (ii) temperature modulation of both leads with an ac driving that contains a second harmonic, thus generating harmonic mixing. Both scenarios yield sizeable directed heat currents which should be detectable with present techniques. Adding a static thermal bias, allows one to compute the heat current-thermal load characteristics which includes the ratchet effect of negative thermal bias with positive-valued heat flow against the thermal bias, up to the thermal stop-load. The ratchet heat flow in turn generates also an electric current. An applied electric stop-voltage, yielding effective zero electric current flow, then mimics a solely heat-ratchet-induced thermopower (``ratchet Seebeck effect''), although no net thermal bias is acting. Moreover, we find that the relative phase between the two harmonics in scenario (ii) enables steering the net heat current into a direction of choice.Comment: 9 pages, 8 figure