The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
?It is well-known that the problem of matching two relational structures can be posed as an equivalent problem of finding a maximal clique in a (derived) ?association graph.? Howev...
Marcello Pelillo, Kaleem Siddiqi, Steven W. Zucker
— Non-negative Matrix factorization (NMF) has increasingly been used as a tool in signal processing in the last couple of years. NMF, like independent component analysis (ICA) is...
Objective image/video quality measures play important roles in various image/video processing applications, such as compression, communication, printing, analysis, registration, r...
Abstract. We present a novel approach to nonrigid registration of volumetric multimodal medical data. We propose a new regularized template matching scheme, where arbitrary similar...