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.
This study proposes a novel fast stereo matching algorithm via semi-global energy optimisation, which achieves a considerable improvement in efficiency for just a small price in accuracy. Based on some assumptions, the authors discover that at most two disparity candidates for each scanline segment of reference image can be extracted. With this observation, the authors present a disparity candidate...
This paper presents a graphical model for de-formable face matching and landmark localization under an unknown non-rigid warp. The proposed model learns and combines statistics of both appearance and shape variations of facial images (learnt purely from a set of frontal training images) in a complex objective function in an unsupervised manner. Local and global shape variations are included in the...
In this paper we provide a framework of detection and localization of multiple similar shapes or object instances from an image based on shape matching. There are three challenges about the problem. The first is the basic shape matching problem about how to find the correspondence and transformation between two shapes; second how to match shapes under occlusion; and last how to recognize and locate...
This paper addresses the problem of establishing correspondences between two sets of visual features using higher-order constraints instead of the unary or pairwise ones used in classical methods. Concretely, the corresponding hypergraph matching problem is formulated as the maximization of a multilinear objective function over all permutations of the features. This function is defined by a tensor...
Multiview image matching methods typically require feature point correspondences. We propose a novel spatial topology method that represents the space with a set of connected projective invariant features. Typically, isolated features, such as corners, cannot be matched reliably. Hence, limitations are imposed on viewpoint changes, or projective invariant descriptions are needed. The fundamental matrix...
A prerequisite to calibrated camera pose estimation is the construction of a camera neighborhood adjacency graph, a connected graph defining the pose neighbors of the camera set. Pose neighbors to a camera C are images containing sufficient overlap in image content with the image from C that they can be used to correctly estimate the pose of C using structure-from-motion techniques. In a video stream,...
In this paper we propose a novel technique to image completion that addresses image renaissance through a graph-based matching process. To this end, a number of candidate seeds with content similar to the one of the area to be inpainted are considered. They are selected through a particle filter method and then positioned over the missing area. Markov random fields are used to formalize inpainting...
We introduce a shape descriptor that is based on the symmetry set. This set represents pairwise symmetric points and consists of several branches. The begin and end points of the branches relate to extrema of the curvature along the shape. Consequently, extrema of the curvature are pairwise connected via a symmetry set branch with a certain finite length. The novel shape descriptor is given by a string...
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.