Sciweavers

463 search results - page 59 / 93
» The lattice dimension of a graph
Sort
View
ICIP
2010
IEEE
14 years 7 months ago
Image partitioning with kernel mapping and graph cuts
A novel multiregion graph cut image partitioning method combined with kernel mapping is presented. A kernel function transforms implicitly the image data into data of a higher dim...
Mohamed Ben Salah, Amar Mitiche, Ismail Ben Ayed
CVPR
2008
IEEE
15 years 11 months ago
Graph commute times for image representation
We introduce a new image representation that encompasses both the general layout of groups of quantized local invariant descriptors as well as their relative frequency. A graph of...
Nikos Paragios, Regis Behmo, Véronique Prin...
CORR
2011
Springer
147views Education» more  CORR 2011»
14 years 4 months ago
Human-Assisted Graph Search: It's Okay to Ask Questions
We consider the problem of human-assisted graph search: given a directed acyclic graph with some (unknown) target node(s), we consider the problem of finding the target node(s) b...
Aditya G. Parameswaran, Anish Das Sarma, Hector Ga...
ASUNAM
2011
IEEE
13 years 9 months ago
Visualizing Bibliographic Databases as Graphs and Mining Potential Research Synergies
—Bibliographic databases are a prosperous field for data mining research and social network analysis. They contain rich information, which can be analyzed across different dimen...
Iraklis Varlamis, George Tsatsaronis
ICASSP
2010
IEEE
14 years 10 months ago
Fast signal analysis and decomposition on graphs using the Sparse Matrix Transform
Recently, the Sparse Matrix Transform (SMT) has been proposed as a tool for estimating the eigen-decomposition of high dimensional data vectors [1]. The SMT approach has two major...
Leonardo R. Bachega, Guangzhi Cao, Charles A. Boum...