With the explosive growth of web multimedia data, how to manage and retrieval the web-scale data more efficiently has become a urgent problem, which expects more efficient low-level feature with low computation. This pressing need brings a huge challenge to the conventional feature. It is urgent to make descriptor more compact and faster and meanwhile remain robust to many different kinds of im...

In this paper we present a Content-Based Image Retrieval (CBIR) system which extracts color features using Dominant Color Correlogram Descriptor (DCCD) and shape features using Pyramid Histogram of Oriented Gradients (PHOG). The DCCD is a descriptor which extracts global and local color features, whereas the PHOG descriptor extracts spatial information of shape in the image. In order to evaluat...

Online action recognition aims to recognize actions from unsegmented streams of data in a continuous manner. One of the challenges in online recognition is the accumulation of evidence for decision making. This paper presents a fast and efficient online method to recognize actions from a stream of noisy skeleton data. The method adopts a covariance descriptor calculated from skeleton data and i...

We propose a new method for clustering 3D protein structures. In our method, the 3D structure of a protein is represented by a linear subspace, which is generated using PCA from the set of synthesized multi-view images of the protein. The similarity of two protein structures is then defined by the canonical angles between the corresponding subspaces. The merit of this approach is that we can av...

In the paper a new 3D shape representation algorithm is proposed — the Polar-Fourier 3D Shape Descriptor. Similarly to the Light Field Descriptor, the proposed method is based on rendering several two-dimensional projections of a 3D model, taken from various points of view. However, the proposed descriptor uses the 2D Polar-Fourier transform for obtained projections This enables the new descrip...

In this talk, matrix inequality characterizations for the positive realness of descriptor systems are introduced. Hence, the celebrated positive real lemma for standard state space systems is established for descriptor systems. In addition, the lossless positive realness of both standard state space systems and descriptor systems are characterized explicitly based on the controllable staircase ...

Linear descriptor systems are governed by dynamical equations subject to algebraic constraints. In the one-dimensional case, where only depend on a single index, usually time, Weierstrass canonical form splits up state vector in two parts, causal part, running forward and non-causal backward. this paper linear time-invariant autonomous two-dimensions discussed condition existence of non-trivial...