In this paper we redefine and generalize the classic k-nearest neighbors (k-NN) voting rule in a Bayesian maximum-a-posteriori (MAP) framework. Therefore, annotated examples are u...
Paolo Piro, Richard Nock, Frank Nielsen, Michel Ba...
Most methods for object class segmentation are formulated as a labelling problem over a single choice of quantisation of an image space - pixels, segments or group of segments. It...
Lubor Ladicky, Christopher Russell, Pushmeet Kohli...
A variational formulation of an image analysis problem has the nice feature that it is often easier to predict the eect of minimizing a certain energy functional than to interpret...
Many binary code encoding schemes based on hashing have been actively studied recently, since they can provide efficient similarity search, especially nearest neighbor search, an...
Image matching is an essential task in many computer vision applications. It is obvious that thorough utilization of all available information is critical for the success of match...