Search

This paper presents a theoretical study into the use of optical systems for quantum computation. The study results pertain to quantum sampling and quantum communication and provide a basis for further research and the development of a physical implementation. We propose an optical superstructure that can implement specific computation processes and algorithms. The superstructure is composed of nonlinear optical units, such as beta barium borate crystals. The units are positioned in series, powered by a pulse laser pump, and culminate in a beam splitter that generates the output state of a number of entangled photon pairs. Computation is achieved by entanglement propagation via beam splitters and adjustable phase shifters, which set related parameters. Demonstrating a two-component case, we show how a series of cosine-based components can be implemented. The obtained results open a broad front for future research. Future work should investigate the construction of a quantum optimizer using quantum sampling methods and also investigate high-precision temporal voltage measurement, which is a key procedure for the construction of high-fidelity devices. [ABSTRACT FROM AUTHOR]

We introduce synchronized and calibrated multi-view video and motion capture dataset for motion analysis and gait identification. The 3D gait dataset consists of 166 data sequences with 32 people. In 128 data sequences, each of 32 individuals was dressed in his/her clothes, in 24 data sequences, 6 of 32 performers changed clothes, and in 14 data sequences, 7 of the performers had a backpack on his/her back. In a single recording session, every performer walked from right to left, then from left to right, and afterwards on the diagonal from upper-right to bottom-left and from bottom-left to upper-right corner of a rectangular scene. We demonstrate that a baseline algorithm achieves promising results in a challenging scenario, in which gallery/training data were collected in walks perpendicular/facing to the cameras, whereas the probe/testing data were collected in diagonal walks. We compare performances of biometric gait recognition that were achieved on marker-less and marker-based 3D data. We present recognition performances, which were achieved by a convolutional neural network and classic classifiers operating on gait signatures obtained by multilinear principal component analysis. The availability of synchronized multi-view image sequences with 3D locations of body markers creates a number of possibilities for extraction of discriminative gait signatures. The gait data are available at http://bytom.pja.edu.pl/projekty/hm-gpjatk/. [ABSTRACT FROM AUTHOR]

This paper introduces an expanded version of the Invasive Weed Optimization algorithm (exIWO) distinguished by the hybrid strategy of the search space exploration proposed by the authors. The algorithm is evaluated by solving three well-known optimization problems: minimization of numerical functions, feature selection, and the Mona Lisa TSP Challenge as one of the instances of the traveling salesman problem. The achieved results are compared with analogous outcomes produced by other optimization methods reported in the literature. [ABSTRACT FROM AUTHOR]

Tracking and action-recognition algorithms are currently widely used in video surveillance, monitoring urban activities and in many other areas. Their development highly relies on benchmarking scenarios, which enable reliable evaluations/improvements of their efficiencies. Presently, benchmarking methods for tracking and action-recognition algorithms rely on manual annotation of video databases, prone to human errors, limited in size and time-consuming. Here, using gained experiences, an alternative benchmarking solution is presented, which employs methods and tools obtained from the computer-game domain to create simulated video data with automatic annotations. Presented approach highly outperforms existing solutions in the size of the data and variety of annotations possible to create. With proposed system, a potential user can generate a sequence of random images involving different times of day, weather conditions, and scenes for use in tracking evaluation. In the design of the proposed tool, the concept of crowd simulation is used and developed. The system is validated by comparisons to existing methods. [ABSTRACT FROM AUTHOR]

The ability of the locomotor system to maintain continuous walking despite very small external or internal disturbances is called local dynamic stability (LDS). The importance of the LDS requires constantly working on different aspects of its assessment method which is based on the short-term largest Lyapunov exponent (LLE). A state space structure is a vital aspect of the LDS assessment because the algorithm of the LLE computation for experimental data requires a reconstruction of a state space trajectory. The gait kinematic data are usually one- or three-dimensional, which enables to construct a state space based on a uni- or multivariate time series. Furthermore, two variants of the short-term LLE are present in the literature which differ in length of a time span, over which the short-term LLE is computed. Both a state space structure and the consistency of the observations based on values of both short-term LLE variants were analyzed using time series representing the joint angles at ankle, knee, and hip joints. The short-term LLE was computed for individual joints in three state spaces constructed on the basis of either univariate or multivariate time series. Each state space revealed walkers' locally unstable behavior as well as its attenuation in the current stride. The corresponding conclusions made on the basis of both short-term LLE variants were consistent in ca. 59% of cases determined by a joint and a state space. Moreover, the authors present an algorithm for estimation of the embedding dimension in the case of a multivariate gait time series. [ABSTRACT FROM AUTHOR]

This paper introduces an expanded version of the Invasive Weed Optimization algorithm (exIWO) distinguished by the hybrid strategy of the search space exploration proposed by the authors. The algorithm is evaluated by solving three well-known optimization problems: minimization of numerical functions, feature selection, and the Mona Lisa TSP Challenge as one of the instances of the traveling salesman problem. The achieved results are compared with analogous outcomes produced by other optimization methods reported in the literature.