We derive a sensitivity analysis for moment invariants of multidimensional distributions, These invariants have many uses in computational systems and have recently been used for illumination-invariant recognition in ...
详细信息
ISBN:
(纸本)0780342364
We derive a sensitivity analysis for moment invariants of multidimensional distributions, These invariants have many uses in computational systems and have recently been used for illumination-invariant recognition in color images. In this context, the sensitivity analysis predicts the response of moment invariants to partial occlusion. Using the results of the sensitivity analysis, we develop a novel surface representation called the invariant profile which captures color distribution and spatial information while remaining invariant to the spectral content of the scene illumination. Unlike previous representations, the recognition of invariant profiles does not require illumination correction. We demonstrate the sensitivity analysis and the use of invariant profiles for recognition with a set of experiments on color images.
Few-shot learning has attracted intensive research attention in recent years. Many methods have been proposed to generalize a model learned from provided base classes to novel classes, but no previous work studies how...
详细信息
ISBN:
(纸本)9781728171685
Few-shot learning has attracted intensive research attention in recent years. Many methods have been proposed to generalize a model learned from provided base classes to novel classes, but no previous work studies how to select base classes, or even whether different base classes will result in different generalization performance of the learned model. In this paper, we utilize a simple yet effective measure, the Similarity Ratio, as an indicator for the generalization performance of a few-shot model. We then formulate the base class selection problem as a submodular optimization problem over Similarity Ratio. We further provide theoretical analysis on the optimization lower bound of different optimization methods, which could be used to identify the most appropriate algorithm for different experimental settings. The extensive experiments on ImageNet [4], Caltech256 [8] and CUB-200-2011 [27] demonstrate that our proposed method is effective in selecting a better base dataset.
Current methods for registering image regions perform well for simple transformations or large image regions. In this paper, we present a new method that is better able to handle small image regions as they deform wit...
详细信息
ISBN:
(纸本)0780342364
Current methods for registering image regions perform well for simple transformations or large image regions. In this paper, we present a new method that is better able to handle small image regions as they deform with non-linear transformations. We introduce difference decompositon, a novel approach to solving the registration problem. The method is a generalization of previous methods and can better handle non-linear transforms. Although the methods are general, we focus on projective transformations and introduce piecewise-projective transformations for modeling the motions of non-planar objects. We conclude with examples from our prototype implementation.
We develop a simple and very fast method for object tracking based exclusively on color information in digitized video images. Running on a Silicon Graphics R4600 Indy system with an IndyCam, our algorithm is capable ...
详细信息
ISBN:
(纸本)0780342364
We develop a simple and very fast method for object tracking based exclusively on color information in digitized video images. Running on a Silicon Graphics R4600 Indy system with an IndyCam, our algorithm is capable of simultaneously tracking objects at full frame size (640 x 480 pixels) and video frame rate (30 fps). Robustness with respect to occlusion is achieved via an explicit hypothesis-tree model of the occlusion process. We demonstrate the efficacy of our technique in the challenging task of tracking people, especially tracking human heads and hands.
We present a new method for synthesizing novel views of a 3D scene from few model images in full correspondence. The core of this work is the derivation of a tensorial operator that describes the transformation from) ...
详细信息
ISBN:
(纸本)0780342364
We present a new method for synthesizing novel views of a 3D scene from few model images in full correspondence. The core of this work is the derivation of a tensorial operator that describes the transformation from) a given tensor of three views to a novel tensor of a new configuration of three views. BL repeated application of the operator an a seed tensor with a sequence of desired virtual camera positions we obtain a chain of warping functions (tensors) from the set of model images to create the desired virtual views.
Where does the sparsity in image signals come from? Local and nonlocal image models have supplied complementary views toward the regularity in natural images the former attempts to construct or learn a dictionary of b...
详细信息
ISBN:
(纸本)9781457703935
Where does the sparsity in image signals come from? Local and nonlocal image models have supplied complementary views toward the regularity in natural images the former attempts to construct or learn a dictionary of basis functions that promotes the sparsity;while the latter connects the sparsity with the self-similarity of the image source by clustering. In this paper, we present a variational framework for unifying the above two views and propose a new denoising algorithm built upon clustering-based sparse representation (CSR). Inspired by the success of l(1)-optimization, we have formulated a double-header l(1)-optimization problem where the regularization involves both dictionary learning and structural structuring. A surrogate-function based iterative shrinkage solution has been developed to solve the double-header l(1)-optimization problem and a probabilistic interpretation of CSR model is also included. Our experimental results have shown convincing improvements over state-of-the-art denoising technique BM3D on the class of regular texture images. The PSNR performance of CSR denoising is at least comparable and often superior to other competing schemes including BM3D on a collection of 12 generic natural images.
We propose a new method for view synthesis from real images using stereo vision. The method does not explicitly model scene geometry, and enables fast and exact generation of synthetic views. We also reevaluate the re...
详细信息
ISBN:
(纸本)0818672587
We propose a new method for view synthesis from real images using stereo vision. The method does not explicitly model scene geometry, and enables fast and exact generation of synthetic views. We also reevaluate the requirements on stereo algorithms for the application of view synthesis and discuss ways of dealing with partially occluded regions of unknown depth and with completely occluded regions of unknown texture. Our experiments demonstrate that it is possible to efficiently synthesize realistic new views even from inaccurate and incomplete depth information.
It is widely accepted that textureless surfaces cannot be recovered using passive sensing techniques. The problem is approached by viewing image formation as a Sully three-dimensional mapping. It is shown that the len...
详细信息
ISBN:
(纸本)0780342364
It is widely accepted that textureless surfaces cannot be recovered using passive sensing techniques. The problem is approached by viewing image formation as a Sully three-dimensional mapping. It is shown that the lens encodes structural information of the scene within a compact three-dimensional space behind it. After analyzing the information content of this space and by using its properties we derive necessary and sufficient conditions for the recovery of textureless scenes. Based on these conditions, a simple procedure for recovering textureless scenes is described. We experimentally demonstrate the recovery of three textureless surfaces, namely, a line, a plane, and a paraboloid. Since textureless surfaces represent the worst case recovery scenario, all the results and the recovery procedure are naturally applicable to scenes with texture.
Weakly supervised image segmentation is a challenging problem in computervision field. In this paper, we present a new weakly supervised image segmentation algorithm by learning the distribution of spatially structur...
详细信息
ISBN:
(纸本)9780769549897
Weakly supervised image segmentation is a challenging problem in computervision field. In this paper, we present a new weakly supervised image segmentation algorithm by learning the distribution of spatially structured superpixel sets from image-level labels. Specifically, we first extract graphlets from each image where a graphlet is a small-sized graph consisting of superpixels as its nodes and it encapsulates the spatial structure of those superpixels. Then, a manifold embedding algorithm is proposed to transform graphlets of different sizes into equal-length feature vectors. Thereafter, we use GMM to learn the distribution of the post-embedding graphlets. Finally, we propose a novel image segmentation algorithm, called graphlet cut, that leverages the learned graphlet distribution in measuring the homogeneity of a set of spatially structured superpixels. Experimental results show that the proposed approach outperforms state-of-the-art weakly supervised image segmentation methods, and its performance is comparable to those of the fully supervised segmentation models.
暂无评论