Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Du, Daniel K."'
Finding the eye and parsing out the parts (e.g. pupil and iris) is a key prerequisite for image-based eye tracking, which has become an indispensable module in today's head-mounted VR/AR devices. However, a typical route for training a segmenter requ
Externí odkaz:
http://arxiv.org/abs/2410.06131
Parsing of eye components (i.e. pupil, iris and sclera) is fundamental for eye tracking and gaze estimation for AR/VR products. Mainstream approaches tackle this problem as a multi-class segmentation task, providing only visible part of pupil/iris, o
Externí odkaz:
http://arxiv.org/abs/2408.17231
Autor:
Dong, Xin, Zhao, Fuwei, Xie, Zhenyu, Zhang, Xijin, Du, Daniel K., Zheng, Min, Long, Xiang, Liang, Xiaodan, Yang, Jianchao
While significant progress has been made in garment transfer, one of the most applicable directions of human-centric image generation, existing works overlook the in-the-wild imagery, presenting severe garment-person misalignment as well as noticeabl
Externí odkaz:
http://arxiv.org/abs/2203.15320
Publikováno v:
ECCV2018
Face detection has been well studied for many years and one of remaining challenges is to detect small, blurred and partially occluded faces in uncontrolled environment. This paper proposes a novel context-assisted single shot face detector, named \e
Externí odkaz:
http://arxiv.org/abs/1803.07737
Recently, Bostan and his coauthors investigated lattice walks restricted to the non-negative octant $\mathbb{N}^3$. For the $35548$ non-trivial models with at most six steps, they found that many models associated to a group of order at least $200$ a
Externí odkaz:
http://arxiv.org/abs/1507.03705
Autor:
Jin, Hai-Tao, Du, Daniel K.
Recently, Chen, Hou and Jin used both Abel's lemma on summation by parts and Zeilberger's algorithm to generate recurrence relations for definite summations. Meanwhile, they proposed the Abel-Gosper method to evaluate some indefinite sums involving h
Externí odkaz:
http://arxiv.org/abs/1411.6916
We generalize the method of combinatorial telescoping to the case of multiple summations. We shall demonstrate this idea by giving combinatorial proofs for two identities of Andrews on parity indices of partitions.
Comment: 10 pages, 5 figures
Comment: 10 pages, 5 figures
Externí odkaz:
http://arxiv.org/abs/1411.6917
Let $p_r(n)$ denote the number of $r$-component multipartitions of $n$, and let $S_{\gamma,\lambda}$ be the space spanned by $\eta(24z)^\gamma \phi(24z)$, where $\eta(z)$ is the Dedekind's eta function and $\phi(z)$ is a holomorphic modular form in $
Externí odkaz:
http://arxiv.org/abs/1206.6642
Autor:
Du, Daniel K., Hou, Qing-Hu
Publikováno v:
The Electronic Journal of Combinatorics 19(4) (2012) #P29
We present a method of computing the generating function $f_P(\x)$ of $P$-partitions of a poset $P$. The idea is to introduce two kinds of transformations on posets and compute $f_P(\x)$ by recursively applying these transformations. As an applicatio
Externí odkaz:
http://arxiv.org/abs/1111.0245
Following the method of combinatorial telescoping for alternating sums given by Chen, Hou and Mu, we present a combinatorial telescoping approach to partition identities on sums of positive terms. By giving a classification of the combinatorial objec
Externí odkaz:
http://arxiv.org/abs/1106.3013