Sciweavers

188 search results - page 20 / 38
» Random Forests and Kernel Methods
Sort
View
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
15 years 14 days ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan
ISBI
2008
IEEE
15 years 4 months ago
Support vector driven Markov random fields towards DTI segmentation of the human skeletal muscle
In this paper we propose a classification-based method towards the segmentation of diffusion tensor images. We use Support Vector Machines to classify diffusion tensors and we ex...
Radhouène Neji, Gilles Fleury, Jean Francoi...
TMM
2010
231views Management» more  TMM 2010»
14 years 5 months ago
Real-Time Visual Concept Classification
As datasets grow increasingly large in content-based image and video retrieval, computational efficiency of concept classification is important. This paper reviews techniques to ac...
Jasper R. R. Uijlings, Arnold W. M. Smeulders, Rem...
ICCV
2003
IEEE
16 years 11 days ago
Machine Learning and Multiscale Methods in the Identification of Bivalve Larvae
This paper describes a novel application of support vector machines and multiscale texture and color invariants to a problem in biological oceanography: the identification of 6 sp...
Sanjay Tiwari, Scott Gallager

Publication
335views
13 years 23 days ago
Person Re-Identification: What Features are Important?
State-of-the-art person re-identi cation methods seek robust person matching through combining various feature types. Often, these features are implicitly assigned with a single ve...
Chunxiao Liu, Shaogang Gong, Chen Change Loy, Xing...