Most of Information Retrieval (IR) systems are still based on bag of word paradigm. This is a strong limitation if one needs high precision answers. For example, in restricted doma...
One of the bottlenecks of current recognition (and graph matching) systems is their assumption of one-to-one feature (node) correspondence. This assumption breaks down in the gener...
Ali Shokoufandeh, Yakov Keselman, M. Fatih Demirci...
Abstract. In this paper, we consider two particular problems of directed graph matching. The ļ¬rst problem concerns graphs with nodes that have been subdivided into classes of diļ...
This paper exploits the properties of the commute time for the purposes of graph matching. Our starting point is the random walk on the graph, which is determined by the heat-kern...
Automatic range image registration without any knowledge of the viewpoint requires identiļ¬cation of common regions across different range images and then establishing point corr...