Sciweavers

51 search results - page 2 / 11
» Treelike Comparability Graphs: Characterization, Recognition...
Sort
View
ACIVS
2009
Springer
14 years 13 days ago
Attributed Graph Matching Using Local Descriptions
Abstract. In the pattern recognition context, objects can be represented as graphs with attributed nodes and edges involving their relations. Consequently, matching attributed grap...
Salim Jouili, Ines Mili, Salvatore Tabbone
ICIP
2008
IEEE
14 years 7 months ago
Comparing SIFT descriptors and gabor texture features for classification of remote sensed imagery
A richer set of land-cover classes are observable in satellite imagery than ever before due to the increased sub-meter resolution. Individual objects, such as cars and houses, are...
Yi Yang, Shawn Newsam
ICDM
2009
IEEE
197views Data Mining» more  ICDM 2009»
13 years 3 months ago
A Linear-Time Graph Kernel
The design of a good kernel is fundamental for knowledge discovery from graph-structured data. Existing graph kernels exploit only limited information about the graph structures bu...
Shohei Hido, Hisashi Kashima
ICETET
2009
IEEE
13 years 3 months ago
Face Description with Local Invariant Features: Application to Face Recognition
A completely automatic face recognition system is presented. The method works on color face images and localizes the face region from them initially. It then determines and select...
Sanjay A. Pardeshi, S. N. Talbar
PAMI
2006
164views more  PAMI 2006»
13 years 5 months ago
A Binary Linear Programming Formulation of the Graph Edit Distance
A binary linear programming formulation of the graph edit distance for unweighted, undirected graphs with vertex attributes is derived and applied to a graph recognition problem. ...
Derek Justice, Alfred O. Hero