Searcharxiv⌕ Search

arXiv subjects

Xinyu Sun

Publications and source records attributed to Xinyu Sun.

46 records · Page 3Linked to original sources
arXiv2023

Masked Motion Encoding for Self-Supervised Video Representation Learning

How to learn discriminative video representation from unlabeled videos is challenging but crucial for video analysis. The latest attempts seek to learn a representation model by predicting the appearance contents in the masked regions. However, simply masking and recovering appearance contents may not be sufficient to model temporal clues as the appearance contents can be easily reconstructed from a single frame. To overcome this limitation, we present Masked Motion Encoding (MME), a new pre-training paradigm that reconstructs both appearance and motion information to explore temporal clues. In MME, we focus on addressing two critical challenges to improve the representation performance: 1) how to well represent the possible long-term motion across multiple frames; and 2) how to obtain fine-grained temporal clues from sparsely sampled videos. Motivated by the fact that human is able to recognize an action by tracking objects' position changes and shape changes, we propose to reconstruct a motion trajectory that represents these two kinds of change in the masked regions. Besides, given the sparse video input, we enforce the model to reconstruct dense motion trajectories in both spatial and temporal dimensions. Pre-trained with our MME paradigm, the model is able to anticipate long-term and fine-grained motion details. Code is available at https://github.com/XinyuSun/MME.

cs.CV↗
arXiv2022

Plug-Play Plasmonic Metafibers for Ultrafast Fiber Lasers

Metafibers expand the functionalities of conventional optical fibers to unprecedented nanoscale light manipulations by integrating metasurfaces on the fiber tips, becoming an emerging light-coupling platform for both nanoscience and fiber optics communities. Mostly exploring the isolated bare fibers, current metafibers remain as proof-of-concept demonstrations due to a lack of standard interfaces with the universal fiber networks. Here, we develop new methodologies to fabricate well-defined plasmonic metasurfaces directly on the end facets of commercial single mode fiber jumpers using standard planar technologies and provide a first demonstration of their practical applications in the nonlinear optics regime. Featuring plug-play connections with fiber circuitry and arbitrary metasurfaces landscapes, the metafibers with tunable plasmonic resonances are implemented into fiber laser cavities, yielding all-fiber sub-picosecond (minimum 513 fs) soliton mode locked lasers at optical wavelengths of 1.5 micrometer and 2 micrometer, demonstrating their unusual polarimetric nonlinear transfer functions and superior saturation absorption responses. Novel insights into the physical mechanisms behind the saturable absorption of plasmonic metasurfaces are provided. The nanofabrication process flow is compatible with existing cleanroom technologies, offering metafibers an avenue to be a regular member of functionalized fiber components. The work paves the way towards next generation of ultrafast fiber lasers, optical frequency combs, optical neural networks and ultracompact "all-in-fibers" optical systems for sensing, imaging, communications, and many others.

physics.optics↗
arXiv2022

Descriptellation: Deep Learned Constellation Descriptors

Current descriptors for global localization often struggle under vast viewpoint or appearance changes. One possible improvement is the addition of topological information on semantic objects. However, handcrafted topological descriptors are hard to tune and not robust to environmental noise, drastic perspective changes, object occlusion or misdetections. To solve this problem, we formulate a learning-based approach by modelling semantically meaningful object constellations as graphs and using Deep Graph Convolution Networks to map a constellation to a descriptor. We demonstrate the effectiveness of our Deep Learned Constellation Descriptor (Descriptellation) on two real-world datasets. Although Descriptellation is trained on randomly generated simulation datasets, it shows good generalization abilities on real-world datasets. Descriptellation also outperforms state-of-the-art and handcrafted constellation descriptors for global localization, and is robust to different types of noise. The code is publicly available at https://github.com/ethz-asl/Descriptellation.

cs.RO↗
arXiv2013

Super-A-polynomials for Twist Knots

We conjecture formulae of the colored superpolynomials for a class of twist knots $K_p$ where p denotes the number of full twists. The validity of the formulae is checked by applying differentials and taking special limits. Using the formulae, we compute both the classical and quantum super-A-polynomial for the twist knots with small values of p. The results support the categorified versions of the generalized volume conjecture and the quantum volume conjecture. Furthermore, we obtain the evidence that the Q-deformed A-polynomials can be identified with the augmentation polynomials of knot contact homology in the case of the twist knots.

hep-th↗
arXiv2009

The non-commutative $A$-polynomial of twist knots

The purpose of the paper is two-fold: to introduce a multivariable creative telescoping method, and to apply it in a problem of Quantum Topology: namely the computation of the non-commutative $A$-polynomial of twist knots. Our multivariable creative telescoping method allows us to compute linear recursions for sums of the form $J(n)=\sum_k c(n,k) \hatJ (k)$ given a recursion relation for $(\hatJ(n))$ a the hypergeometric kernel $c(n,k)$. As an application of our method, we explicitly compute the non-commutative $A$-polynomial for twist knots with -8 and 11 crossings. The non-commutative $A$-polynomial of a knot encodes the monic, linear, minimal order $q$-difference equation satisfied by the sequence of colored Jones polynomials of the knot. Its specialization to $q=1$ is conjectured to be the better-known $A$-polynomial of a knot, which encodes important information about the geometry and topology of the knot complement. Unlike the case of the Jones polynomial, which is easily computable for knots with 50 crossings, the $A$-polynomial is harder to compute and already unknown for some knots with 12 crossings.

math.GT↗
arXiv2009

A new algorithm for the recursion of multisums with improved universal denominator

The purpose of the paper is to introduce two new algorithms. The first one computes a linear recursion for proper hypergeometric multisums, by treating one summation variable at a time, and provides rational certificates along the way. A key part in the search of a linear recursion is an improved universal denominator algorithm that constructs all rational solutions $x(n)$ of the equation $$ \frac{a_m(n)}{b_m(n)}x(n+m)+...+\frac{a_0(n)}{b_0(n)}x(n)= c(n),$$ where $a_i(n), b_i(n), c(n)$ are polynomials. Our algorithm improves Abramov's universal denominator.

math.CO↗
arXiv2009

The C-polynomial of a knot

In an earlier paper the first author defined a non-commutative A-polynomial for knots in 3-space, using the colored Jones function. The idea is that the colored Jones function of a knot satisfies a non-trivial linear q-difference equation. Said differently, the colored Jones function of a knot is annihilated by a non-zero ideal of the Weyl algebra which is generalted (after localization) by the non-commutative A-polynomial of a knot. In that paper, it was conjectured that this polynomial (which has to do with representations of the quantum group U_q(SL_2)) specializes at q=1 to the better known A-polynomial of a knot, which has to do with genuine SL_2(C) representations of the knot complement. Computing the non-commutative A-polynomial of a knot is a difficult task which so far has been achieved for the two simplest knots. In the present paper, we introduce the C-polynomial of a knot, along with its non-commutative version, and give an explicit computation for all twist knots. In a forthcoming paper, we will use this information to compute the non-commutative A-polynomial of twist knots. Finally, we formulate a number of conjectures relating the A, the C-polynomial and the Alexander polynomial, all confirmed for the class of twist knots.

math.GT↗
arXiv2007

Lattice and Schroder paths with periodic boundaries

We consider paths in the plane with $(1,0),$ $(0,1),$ and $(a,b)$-steps that start at the origin, end at height $n,$ and stay to the left of a given non-decreasing right boundary. We show that if the boundary is periodic and has slope at most $b/a,$ then the ordinary generating function for the number of such paths ending at height $n$ is algebraic. Our argument is in two parts. We use a simple combinatorial decomposition to obtain an Appell relation or ``umbral'' generating function, in which the power $z^n$ is replaced by a power series of the form $z^n ϕ_n(z),$ where $ϕ_n(0) = 1.$ Then we convert (in an explicit way) the umbral generating function to an ordinary generating function by solving a system of linear equations and a polynomial equation. This conversion implies that the ordinary generating function is algebraic.

math.CO↗