Human gait recognition with matrix representation

Human gait is an important biometric feature. It can be perceived from a great distance and has recently attracted greater attention in video-surveillance-related applications, such as closed-circuit television. We explore gait recognition based on a matrix representation in this paper. First, binary silhouettes over one gait cycle are averaged. As a result, each gait video sequence, containing a number of gait cycles, is represented by a series of gray-level averaged images. Then, a matrix-based unsupervised algorithm, namely coupled subspace analysis (CSA), is employed as a preprocessing step to remove noise and retain the most representative information. Finally, a supervised algorithm, namely discriminant analysis with tensor representation, is applied to further improve classification ability. This matrix-based scheme demonstrates a much better gait recognition performance than state-of-the-art algorithms on the standard USF HumanID Gait database

Periodic subvarieties of a projective variety under the action of a maximal rank abelian group of positive entropy

We determine positive-dimensional G-periodic proper subvarieties of an n-dimensional normal projective variety X under the action of an abelian group G of maximal rank n-1 and of positive entropy. The motivation of the paper is to understand the obstruction for X to be G-equivariant birational to the quotient variety of an abelian variety modulo the action of a finite group.Comment: Asian Journal of Mathematics (to appear), Special issue on the occasion of Prof N. Mok's 60th birthda

Scaling in the time-dependent failure of a fiber bundle with local load sharing

We study the scaling behaviors of a time-dependent fiber-bundle model with local load sharing. Upon approaching the complete failure of the bundle, the breaking rate of fibers diverges according to $r(t)\propto (T_f-t)^{-\xi}$, where $T_f$ is the lifetime of the bundle, and $\xi \approx 1.0$ is a quite universal scaling exponent. The average lifetime of the bundle $$ scales with the system size as $N^{-\delta}$, where $\delta$ depends on the distribution of individual fiber as well as the breakdown rule.Comment: 5 pages, 4 eps figures; to appear in Phys. Rev.

Graphical description of local Gaussian operations for continuous-variable weighted graph states

The form of a local Clifford (LC, also called local Gaussian (LG)) operation for the continuous-variable (CV) weighted graph states is presented in this paper, which is the counterpart of the LC operation of local complementation for qubit graph states. The novel property of the CV weighted graph states is shown, which can be expressed by the stabilizer formalism. It is distinctively different from the qubit weighted graph states, which can not be expressed by the stabilizer formalism. The corresponding graph rule, stated in purely graph theoretical terms, is described, which completely characterizes the evolution of CV weighted graph states under this LC operation. This LC operation may be applied repeatedly on a CV weighted graph state, which can generate the infinite LC equivalent graph states of this graph state. This work is an important step to characterize the LC equivalence class of CV weighted graph states.Comment: 5 pages, 6 figure

Stereoisomer libraries: Total synthesis of all 16 stereoisomers of the pine sawfly sex pheromone by a fluorous mixture-synthesis approach

All 16 stereoisomers of the sex pheromone of pine sawfly (3,7,11-trimethylundecanol propanoate ester) have been synthesized on a 10- to 20-mg scale by a split-parallel fluorous mixture-synthesis approach. Spectral data obtained for all 32 compounds (16 alcohols and the corresponding propionates) matched well with published data, thereby validating the fluorous-tag encoding of diastereoisomers. This fluorous-tag encoding method is recommended for the efficient synthesis of multiple stereoisomers for spectroscopic studies, biological tests, or other structure-function relationships