this paper presents a new human motion recognition method based on motion history image (MHI) and local binary pattern (LBP). MHI describes human motion sequence in one gray level image and LBP extracts its texture fe...
详细信息
ISBN:
(纸本)9781424426683
this paper presents a new human motion recognition method based on motion history image (MHI) and local binary pattern (LBP). MHI describes human motion sequence in one gray level image and LBP extracts its texture features. LBP feature image is built and chi square distance is applied to compute matching cost. Experiments are conducted with encouraging results which show a success of applying LBP in motion recognition.
In patternrecognition and related fields, graphbasedrepresentations offer a versatile alternative to the widely used feature vectors. therefore, an emerging trend of representing objects by graphs can be observed. ...
详细信息
ISBN:
(纸本)9783540855620
In patternrecognition and related fields, graphbasedrepresentations offer a versatile alternative to the widely used feature vectors. therefore, an emerging trend of representing objects by graphs can be observed. this trend is intensified by the development of novel approaches in graphbased machine learning, such as graph kernels or graph embedding techniques. these procedures overcome a major drawback of graphs, which consists in a serious lack of algorithms for classification and clustering. the present;paper is inspired by the idea of representing graphs by means of dissimilarities and extends previous work to the more general setting of Lipschitz embeddings. In all experimental evaluation we empirically confirm that classifiers relying oil the original graph distances call be outperformed by a classification system using the Lipschitz embedded graphs.
the proceedings contain 87 papers. the topics discussed include: BitMat: a main-memory bit matrix of RDF triples for conjunctive triple pattern queries;progress report from the RDB2RDF XG;optimizing SPARQL queries ove...
the proceedings contain 87 papers. the topics discussed include: BitMat: a main-memory bit matrix of RDF triples for conjunctive triple pattern queries;progress report from the RDB2RDF XG;optimizing SPARQL queries over disparate RDF data sources through distributed semi-joins;visualization of the search results of the semantic web search engines;a bootstrapping architecture for integration of relational databases to the semantic web;semantic framework for complex knowledge domains;Edhibou: a customizable interface for decision support in a semantic portal;MDS++: supporting ontology-based dynamic classification in websphere metadata server;graph-theoretic analysis of collaborative knowledge bases in natural language processing;CMAPS supporting the development of OWL ontologies;OmniCat: automatic text classification with dynamically defined categories;and BioPortal: a web repository for biomedical ontologies and data resources.
In this paper we propose an original solution to combine the scales of multi-resolution shape descriptors. More precisely, a classifier fusion scheme is applied to a set of shape descriptors obtained from the ridgelet...
详细信息
this book constitutes the refereed proceedings of the 12thinternationalworkshop on Structural and Syntactic patternrecognition, SSPR 2008 and the 7thinternationalworkshop on Statistical Techniques in pattern Reco...
详细信息
ISBN:
(数字)9783540896890
ISBN:
(纸本)9783540896883
this book constitutes the refereed proceedings of the 12thinternationalworkshop on Structural and Syntactic patternrecognition, SSPR 2008 and the 7thinternationalworkshop on Statistical Techniques in patternrecognition, SPR 2008, held jointly in Orlando, FL, USA, in December 2008 as a satellite event of the 19thinternational Conference of patternrecognition, ICPR 2008. the 56 revised full papers and 42 revised poster papers presented together withthe abstracts of 4 invited papers were carefully reviewed and selected from 175 submissions. the papers are organized in topical sections on graph-based methods, probabilistic and stochastic structural models for PR, image and video analysis, shape analysis, kernel methods, recognition and classification, applications, ensemble methods, feature selection, density estimation and clustering, computer vision and biometrics, patternrecognition and applications, patternrecognition, as well as feature selection and clustering.
In this paper we analyze some shape-based image retrieval methods which use different types of geometric and algebraic moments and Fourier descriptors. Moments have been widely used in patternrecognition applications...
详细信息
In this paper we analyze some shape-based image retrieval methods which use different types of geometric and algebraic moments and Fourier descriptors. Moments have been widely used in patternrecognition applications to describe the geometrical characteristics of different objects. they provide fundamental geometric properties (e.g. area, centroid, moment of inertia, etc.). We consider various description techniques: Hu, Flusser and Taubin invariants, Legendre and Zernike moments, Generic Fourier Descriptors (GFD). the set of absolute orthogonal (i.e. rotation) moment invariants defined by Hu can be used for scale, position, and rotation invariant pattern identification. Flusser' s complete set of invariants appears as a particular case, with invariance only to rotation. the Taubin's affine moment invariants introduce the concept of covariant matrix. Legendre moments are based on orthogonal Legendre polynomials and are not invariant under image rotation. Zernike moments consist of a set of complex polynomials that form a complete orthogonal set over the interior of the unit circle. GFDs are derived by applying a modified polar Fourier transform on shape image. We have applied the retrieval methods on a collection of images chosen from MPEG7 database. the image retrieval performance of each method is described by the precision-recall graph. In the paper we propose a novel approach that combines the described techniques after a coarse partitioning of the image dataset by their morphological features. the proposed approach provides much better performance than each method described above.
the field of statistical patternrecognition is characterized by the use of feature vectors for pattern representation, while strings or, more generally, graphs are prevailing in structural patternrecognition. In thi...
详细信息
ISBN:
(纸本)9783540729020
the field of statistical patternrecognition is characterized by the use of feature vectors for pattern representation, while strings or, more generally, graphs are prevailing in structural patternrecognition. In this paper we aim at bridging the gap between the domain of feature based and graphbased object representation. We propose a general approach for transforming graphs into n-dimensional real vector spaces by means of prototype selection and graph edit distance computation. this method establishes the access to the wide range of procedures based on feature vectors without loosing the representational power of graphs. through various experimental results we show that the proposed method, using graph embedding and classification in a vector space, outperforms the tradional approach based on k-nearest neighbor classification in the graph domain.
We introduce a method for computing homology groups and their generators of a 2D image, using a hierarchical structure i.e. irregular graph pyramid. Starting from an image, a hierarchy of the image is built, by two op...
详细信息
ISBN:
(纸本)9783540729020
We introduce a method for computing homology groups and their generators of a 2D image, using a hierarchical structure i.e. irregular graph pyramid. Starting from an image, a hierarchy of the image is built, by two operations that preserve homology of each region. Instead of computing homology generators in the base where the number of entities (cells) is large, we first reduce the number of cells by a graph pyramid. then homology generators are computed efficiently on the top level of the pyramid, since the number of cells is small, and a top down process is then used to deduce homology generators in any level of the pyramid, including the base level i.e. the initial image. We show that the new method produces valid homology generators and present some experimental results.
We compare different statistical characterizations of a set of strings, for three different histogram-based distances. Given a distance, a set of strings may be characterized by its generalized median, i.e., the strin...
详细信息
ISBN:
(纸本)9783540729020
We compare different statistical characterizations of a set of strings, for three different histogram-based distances. Given a distance, a set of strings may be characterized by its generalized median, i.e., the string -over the set of all possible strings- that minimizes the sum of distances to every string of the set, or by its set median, i.e., the string of the set that minimizes the sum of distances to every other string of the set. For the first two histogram-based distances, we show that the generalized median string can be computed efficiently;for the third one, which biased histograms with individual substitution costs, we conjecture that this is a NP-hard problem, and we introduce two different heuristic algorithms for approximating it. We experimentally compare the relevance of the three histogram-based distances, and the different statistical characterizations of sets of strings, for classifying images that are represented by strings.
the traveling salesperson problem (TSP) is difficult to solve for input instances with large number of cities. Instead of finding the solution of an input with a large number of cities, the problem is approximated int...
详细信息
ISBN:
(纸本)9783540729020
the traveling salesperson problem (TSP) is difficult to solve for input instances with large number of cities. Instead of finding the solution of an input with a large number of cities, the problem is approximated into a simpler form containing smaller number of cities, which is then solved optimally. graph pyramid solution strategies, in a bottom-up manner using Boruvka's minimum spanning tree, convert a 2D Euclidean TSP problem with a large number of cities into successively smaller problems (graphs) with similar layout and solution, until the number of cities is small enough to seek the optimal solution. Expanding this tour solution in a top-down manner to the lower levels of the pyramid approximates the solution. the new model has an adaptive spatial structure and it simulates visual acuity and visual attention. the model solves the TSP problem sequentially, by moving attention from city to city withthe same quality as humans. graph pyramid data structures and processing strategies are a plausible model for finding near-optimal solutions for computationally hard patternrecognition problems.
暂无评论