The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Contour completion plays an important role in visual perception, where the goal is to group fragmented low-level edge elements into perceptually coherent and salient contours. Most existing methods for contour completion have focused on pixelwise detection accuracy. In contrast, fewer methods have addressed the global contour closure effect, despite psychological evidences for its importance. This...
Boosting algorithms attract much attention in computer vision and image processing because of their strong performance in a variety of applications. Recent progress on the theory of boosting algorithms suggests a close link between good generalization and the margin distrubtion of the classifier \wrt a dataset. In this paper, we propose a novel data-dependent margin distribution learning criterion...
MRF inference on the 4-connected grid is popularly utilized for early vision tasks. But due to the loopy structure of the 4-connected grid, inference becomes complicated and less efficient. This paper present a theoretical analysis on what is an optimal spanning tree structure (loop-free) to approximate the 4-connected grid, to facilitate an efficient inference. We formulate our problem in statistical...
Traditionally, image processing based on Markov Random Field (MRF) is often addressed on a 4-connected grid graph defined on the image. This structure is not computationally efficient. In our work, we develop a multiple-trees structure to approximate the 4-connected grid. A set of spanning trees are generated by a new algorithm: re -- weighted random walk (RWRW). This structure effectively covers...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.