three-dimensional geometric data offer an excellent domain for studying representation learning and generative modeling. In this paper, we look at geometric data represented as point clouds. We introduce a deep autoen...
详细信息
Gait has emerged as a distinguishable human biological trait. It refers to the walking style of an individual and is considered an important biometric feature for person identification. Codebook based gait recognition...
详细信息
ISBN:
(纸本)9781538613665
Gait has emerged as a distinguishable human biological trait. It refers to the walking style of an individual and is considered an important biometric feature for person identification. Codebook based gait recognition algorithms have demonstrated excellent performance by achieving high recognition rates. However, such methods construct a codebook for each database or scenario. In this paper, we investigate the idea of using a generic codebook for gait recognition. the proposed codebook is built by using spatiotemporal characteristics of gait sequences from a large diverse synthetic gait database. We also propose a gait recognition algorithm based on this generic codebook. the advantages of the proposed algorithm over the existing methods include its independency from generating a codebook for each database, rather the proposed generic codebook can be used to encode any gait scenario. Moreover, the proposed algorithm is model free and does not require human body segmentation or modeling. the performance of the proposed generic codebook-based gait recognition algorithm is evaluated on two large gait databases TUM GAID and CMU MoBo, and recognition rate reveals the effectiveness of the proposed algorithm.
Representation learning is one of the foundations of Deep Learning and allowed important improvements on several Machine Learning tasks, such as Neural Machine Translation, Question Answering and Speech recognition. R...
详细信息
Gender recognition in videos is a challenging task that has received limited attention in recent years. To tackle this problem, we propose to explore the use of intermediate features of a Convolutional Neural Network ...
详细信息
ISBN:
(纸本)9783030011321;9783030011314
Gender recognition in videos is a challenging task that has received limited attention in recent years. To tackle this problem, we propose to explore the use of intermediate features of a Convolutional Neural Network (CNN) with a component-based face representation methodology. Withthis approach we intend to exploit the gender information provided by different face parts. the features extracted from video key frames are combined with two different strategies to preserve the temporal information, and Random Forest classifiers are employed to obtain a final gender prediction for a video sequence. Our results on the McGill and COX datasets show that our proposal outperforms the end-to-end CNN approach and, in the McGill dataset, 100% of accuracy was obtained.
the proceedings contain 36 papers. the special focus in this conference is on graph-based Representation, graph Matching, graph Clustering and graph-based Applications. the topics include: Approximation of graph edit ...
ISBN:
(纸本)9783319182230
the proceedings contain 36 papers. the special focus in this conference is on graph-based Representation, graph Matching, graph Clustering and graph-based Applications. the topics include: Approximation of graph edit distance in quadratic time;data graph formulation as the minimum-weight maximum-entropy problem;an entropic edge assortativity measure;a subpath kernel for learning hierarchical image representations;coupled-feature hypergraph representation for feature selection;reeb graphs through local binary patterns;incremental embedding within a dissimilarity-based framework;a first step towards exact graph edit distance using bipartite graph matching;consensus of two graph correspondences through a generalisation of the bipartite graph matching;revisiting Volgenant-Jonker for approximating graph edit distance;a hypergraph matching framework for refining multi-source feature correspondences;a tool for solving substitution-tolerant subgraph isomorphism;a graph database repository and performance evaluation metrics for graph edit distance;learning graph model for different dimensions image matching;report on the first contest on graph matching algorithms for pattern search in biological databases;large-scale graph indexing using binary embeddings of node contexts;on the influence of node centralities on graph edit distance for graph classification;a quantum Jensen-Shannon graph kernel using discrete-time quantum walks;density based cluster extension and dominant sets clustering;salient object segmentation from stereoscopic images;causal video segmentation using superseeds and graph matching;fast minimum spanning tree based clustering algorithms on local neighborhood graph and graphbased lymphatic vessel wall localisation and tracking.
the proceedings contain 11 papers. the topics discussed include: inductive reasoning with conceptual space representations;an answer set programming environment for high-level specification and visualization of FCA;th...
the proceedings contain 11 papers. the topics discussed include: inductive reasoning with conceptual space representations;an answer set programming environment for high-level specification and visualization of FCA;three approaches for mining definitions from relational data in the web of data;relational proportions between objects and attributes;the theory and practice of coupling formal concept analysis to relational databases;generalized metrics with applications to ratings and formal concept analysis;binary lattices;biclustering based on FCA and partition pattern structures for recommendation systems;and combining concept annotation and pattern structures for guiding ontology mapping.
In this paper, we draw on Spielman and Srivastava's method for graph sparsification in order to simplify shape representations. the underlying principle of graph sparsification is to retain only the edges which ar...
详细信息
ISBN:
(纸本)9783319589619;9783319589602
In this paper, we draw on Spielman and Srivastava's method for graph sparsification in order to simplify shape representations. the underlying principle of graph sparsification is to retain only the edges which are key to the preservation of desired properties. In this regard, sparsification by edge resistance allows us to preserve (to some extent) links between protrusions and the remainder of the shape (e.g. parts of a shape) while removing in-part edges. Applying this idea to alpha shapes (abstract representations which have a huge number of edges) opens up a way of introducing a hierarchy of the edge strength, thus being relevant for shape analysis and interpretation.
graph-basedpatternrecognition techniques have been in the spotlight for many years, since there is a constant need for faster and more effective approaches. Among them, the Optimum-Path Forest (OPF) framework has ga...
详细信息
graph-basedpatternrecognition techniques have been in the spotlight for many years, since there is a constant need for faster and more effective approaches. Among them, the Optimum-Path Forest (OPF) framework has gained considerable attention in the last years, mainly due to the promising results obtained by OPF-based classifiers, which range from unsupervised, semi-supervised and supervised learning. In this paper, we consider a deeper theoretical explanation concerning the supervised OPF classifier with k-neighborhood (OPFk), as well as we proposed two different training and classification algorithms that allow OPFk to work faster. the experimental validation against standard OPF and Support Vector Machines also validates the robustness of OPFk in real and synthetic datasets. (C) 2016 Elsevier B.V. All rights reserved.
About ten years ago, a novel graph edit distance framework based on bipartite graph matching has been introduced. this particular framework allows the approximation of graph edit distance in cubic time. this, in turn,...
详细信息
ISBN:
(纸本)9783319589619;9783319589602
About ten years ago, a novel graph edit distance framework based on bipartite graph matching has been introduced. this particular framework allows the approximation of graph edit distance in cubic time. this, in turn, makes the concept of graph edit distance also applicable to larger graphs. In the last decade the corresponding paper has been cited more than 360 times. Besides various extensions from the methodological point of view, we also observe a great variety of applications that make use of the bipartite graph matching framework. the present paper aims at giving a first survey on these applications stemming from six different categories (which range from document analysis, over biometrics to malware detection).
the graph Edit Distance (GED) is a flexible measure of dissimilarity between graphs which arises in error-correcting graph matching. It is defined from an optimal sequence of edit operations (edit path) transforming o...
详细信息
the graph Edit Distance (GED) is a flexible measure of dissimilarity between graphs which arises in error-correcting graph matching. It is defined from an optimal sequence of edit operations (edit path) transforming one graph into another. Unfortunately, the exact computation of this measure is NP-hard. In the last decade, several approaches were proposed to approximate the GED in polynomial time, mainly by solving linear programming problems. Among them, the bipartite GED received much attention. It is deduced from a linear sum assignment of the nodes of the two graphs, which can be efficiently computed by Hungarian-type algorithms. However, edit operations on nodes and edges are not handled simultaneously, which limits the accuracy of the approximation. To overcome this limitation, we propose to extend the linear assignment model to a quadratic one. this is achieved through the definition of a family of edit paths induced by assignments between nodes. We formally show that the GED, restricted to the paths in this family, is equivalent to a quadratic assignment problem. Since this problem is NP-hard, we propose to compute an approximate solution by adapting two algorithms: Integer Projected Fixed Point method and Graduated Non Convexity and Concavity Procedure. Experiments show that the proposed approach is generally able to reach a more accurate approximation of the exact GED than the bipartite GED, with a computational cost that is still affordable for graphs of non trivial sizes. (C) 2016 Elsevier B.V. All rights reserved.
暂无评论