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.
We present a novel motion descriptor for gesture recognition based on depth camera. Since each object motion leads to a specific depth change characterized by depth difference, we can recognize object motion via Depth Difference Distribution (DDD) in object region. The DDD is approximated by DDD descriptor in three steps. First, each pixel's depth difference value is quantified into Depth Difference...
In this paper, we propose a novel binary-based cost computation and aggregation approach for stereo matching problem. The cost volume is constructed through bitwise operations on a series of binary strings. Then this approach is combined with traditional winner-take-all strategy, resulting in a new local stereo matching algorithm called binary stereo matching (BSM). Since core algorithm of BSM is...
In this paper, we present a new method for a locally adaptive region detector called Bilateral kernel-based Region Detector (BIRD). This work is to detect stable regions from images by consecutively computing a multiscale decomposition based on the bilateral kernel. The BIRD regards a region as covariant if it exhibits predictability in its photometric distance over spatial distance. Distinctiveness...
Intuitive and easily interpretable performance measures, repeatability and matching performance, for local feature detectors and descriptors were introduced by Mikolajczyk et al. [10, 9]. They, however, measured performance in a wide baseline setting that does not correspond to the visual object categorisation problem which is a popular application of the detectors and descriptors. The limitation...
Local Binary Descriptors (LBDs) are good at matching image parts, but how much information is actually carried? Surprisingly, this question is usually ignored and replaced by a comparison of matching performances. In this paper, we directly address it by trying to reconstruct plausible images from different LBDs such as BRIEF [4] and FREAK [1]. Using an inverse problem framework, we show that this...
Most of conventional object matching methods are based on comparing the local features, which are too computational demanding to achieve realtime performance on object detection in videos. Recently, Dominant Orientation Templates (DOT) method was proposed to make online feature detection and comparison feasible. However, it still suffers the problem of fragility due to the noise and partial occlusions...
In this paper, a new refined sparse subspace clustering (RSSC) method is proposed for robust motion segmentation. Given a set of trajectories of tracked feature points from multiple moving object, RSSC aims at seeking a sparse representation (SR) for each trajectory with respect to a recovered low-rank dictionary. The segmentation of motion is obtained by applying spectral clustering to the affinity...
Finding correspondences between two 3D shapes is common both in computer vision and computer graphics. In this paper, we propose a general framework that shows how to build correspondences by utilizing the isometric property. We show that the problem of finding such correspondences can be reduced to the problem of spectral assignment, which can be solved by finding the principal eigenvector of the...
Calibrating hand-eye geometry is often based on explicit feature correspondences. This article presents an alternative method that uses the apparent flow induced by the motion of the camera to achieve self-calibration. To make the method more robust against noise, the strategy is to use the orientation of the normal flow field which is more noise-immune, to recover first the direction component of...
In this paper, we propose a new descriptor which is computed by comparing invariant cross color channels of pairs of points in the local patch. To efficiently obtain the sampled pairs of points, a galaxy sampling pattern is proposed. As shown in the experiments, our descriptor using invariant cross color channels and the galaxy sampling can achieve the best performance in most cases with slight computation...
Many problems in computer vision and robotics rely on automatically determining point correspondences from two images. Due to issues such as illumination variations, uncontrolled acquisition conditions and noise, this is a challenging problem. This work presents a method that combines visual and shape information to perform point correspondences which is invariant to rotation and scaling transformations...
We proposed in this paper a novel weighted longest increasing subsequence to improve the performance of the appearance-based object recognition. The LIS is employed to find the true keypoint matches that have consistent geometric order in both query and gallery images. Then, the similarity between query and gallery images is measured by the sum of the weights of the true keypoints. The experimental...
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.