Gait is a biometric feature and gait recognition has become a challenging problem in computer vision. New wavelet velocity moments have been developed to describe and recognize gait. Wavelet moments are translation, scale and rotation invariant. Wavelet analysis has the trait of multi-resolution analysis, which strengthens the analysis ability to image subtle feature. According with the psychol...

We present a comprehensive evaluation of performance of shot-based visual feature representations for MediaEval 2012 Violent Scenes Detection Affect Task. In spite of using keyframe-based as last year, we try to apply shot-based features using the global features (color moments, color histogram, edge orientation histogram, and local binary patterns) for violent scenes detection. Besides that, w...

Color moments are measures that can be used to differentiate images based on their color. Once computed, these moments provide a measure for color similarity between images. This color similarity can become a measure of finding difference between consecutive frames in a video. Finding the difference between temporally arranged frames in video is one of the issues in shot boundary detection whic...

This paper proposes an automated system for rotation and scale invariant color logo recognition. Colored logo images are recognized using one shape feature namely Moments Invariant and a color feature namely Color Moments. Shape of the logo is modeled using the first two central normalized Hu's invariant moments while color is modeled using the mean, standard deviation, skewness and kurtos...

We establish unconditional ? $\Omega$ -results for all weighted even moments of primes in arithmetic progressions. also study the these and lower bounds under Generalized Riemann Hypothesis (GRH). Finally, GRH Linear Independence (LI), we prove an asymptotic associated limiting distribution, which, turn, indicates that our results are essentially best possible. Using probabilistic results, form...

In this work we consider temporal networks, i.e. networks defined by a labeling λ assigning to each edge of an underlying graph G a set of discrete time-labels. The labels of an edge, which are natural numbers, indicate the discrete time moments at which the edge is available. We focus on path problems of temporal networks. In particular, we consider time-respecting paths, i.e. paths whose edge...