1. A method for image retrieval, comprising: capturing images from a camera sensor or from a computer generated display memory; constructing a plurality of graphs including a first graph for candidate images retrieved based upon holistic features of a query image and a second graph for candidate images retrieved based upon local features of the query image, wherein constructing includes weighting connected images based upon a Jaccard similarity coefficient determined as: w ⁡ ( q , d ) = α ⁢  N k ⁡ ( q ) ⋂ N k ⁡ ( d )   N k ⁡ ( q ) ⋃ N k ⁡ ( d )  where w is weight of an edge for images q and d that are reciprocal neighbors, N represents a neighborhood, and α is a decay coefficient related to number of hops to the query; fusing the plurality of graphs to provide a fused graph; and ranking, using a processor, candidate images of the fused graph to provide retrieval results of the query image.
3. The method as recited in claim 1 , wherein ranking includes determining a maximum weighted subgraph.