Although steady progress has been made in recent stereo algorithms, producing accurate results in the neighborhood of depth discontinuities remains a challenge. Moreover, among the techniques that best localize depth ...
详细信息
Although steady progress has been made in recent stereo algorithms, producing accurate results in the neighborhood of depth discontinuities remains a challenge. Moreover, among the techniques that best localize depth discontinuities, it is common to work only with a discrete set of disparity values, hindering the modeling of smooth, non-fronto-parallel surfaces. We propose to estimate scene structure as a set of smooth surface patches. The disparities within each patch are modeled by a spline, while the extent of each patch is represented by a pixelwise labeling of the source images. Disparities and extents are alternately estimated in an iterative, energy minimization framework. Segmentation is via graph cuts, aided by image gradients. Input images are treated symmetrically, and occlusions are addressed explicitly. Promising experimental results are presented.
The problem of segmenting individual humans in crowded situations from stationary video camera sequences is exacerbated by object inter-occlusion. We pose this problem as a "model-based segmentation" problem...
详细信息
The problem of segmenting individual humans in crowded situations from stationary video camera sequences is exacerbated by object inter-occlusion. We pose this problem as a "model-based segmentation" problem in which human shape models are used to interpret the foreground in a Bayesian framework. The solution is obtained by using an efficient Markov chain Monte Carlo (MCMC) method that uses domain knowledge as proposal probabilities. Knowledge of various aspects including human shape, human height, camera model, and image cues including human head candidates, foreground/background separation are integrated in one theoretically sound framework. We show promising results and evaluations on some challenging data.
Progress in stereo algorithm performance is quickly outpacing the ability of existing stereo data sets to discriminate among the best-performing algorithms, motivating the need for more challenging scenes with accurat...
详细信息
Progress in stereo algorithm performance is quickly outpacing the ability of existing stereo data sets to discriminate among the best-performing algorithms, motivating the need for more challenging scenes with accurate ground truth information. This paper describes a method for acquiring high-complexity stereo image pairs with pixel-accurate correspondence information using structured light. Unlike traditional range-sensing approaches, our method does not require the calibration of the light sources and yields registered disparity maps between all pairs of cameras and illumination projectors. We present new stereo data sets acquired with our method and demonstrate their suitability for stereo algorithm evaluation. Our results are available at http://***/stereo/.
We illustrate how to consider a network of cameras as a single generalized camera in a framework proposed by Nayar (2001). We derive the discrete structure from motion equations for generalized cameras, and illustrate...
详细信息
We illustrate how to consider a network of cameras as a single generalized camera in a framework proposed by Nayar (2001). We derive the discrete structure from motion equations for generalized cameras, and illustrate the corollaries to epipolar geometry. This formal mechanism allows one to use a network of cameras as if they were a single imaging device, even when they do not share a common center of projection. Furthermore, an analysis of structure from motion algorithms for this imaging model gives constraints on the optimal design of panoramic imaging systems constructed from multiple cameras.
We consider the problem of segmenting an image into foreground and background, with foreground containing solely objects of interest known a priori. We propose an integration model that incorporates both edge detectio...
详细信息
We consider the problem of segmenting an image into foreground and background, with foreground containing solely objects of interest known a priori. We propose an integration model that incorporates both edge detection and object part detection results. It consists of two parallel processes: low-level pixel grouping and high-level patch grouping. We seek a solution that optimizes a joint grouping criterion in a reduced space enforced by grouping correspondence between pixels and patches. Using spectral graph partitioning, we show that a near global optimum can be found by solving a constrained eigenvalue problem. We report promising experimental results on a dataset of 15 objects under clutter and occlusion.
We have developed various segmentation and analysis methods for the quantification of lung nodules in thoracic CT. Our methods include the enhancement of lung structures followed by a series of segmentation methods to...
详细信息
ISBN:
(纸本)0819448338
We have developed various segmentation and analysis methods for the quantification of lung nodules in thoracic CT. Our methods include the enhancement of lung structures followed by a series of segmentation methods to extract the nodule and to form 3D configuration at an area of interest. The vascular index, aspect ratio, circularity, irregularity, extent, compactness, and convexity were also computed as shape features for quantifying the nodule boundary. The density distribution of the nodule was modeled based on its internal homogeneity and/or heterogeneity. We also used several density related features including entropy, difference entropy as well as other first and second order moments. We have collected 48 cases of lung nodules scanned by thin-slice diagnostic CT. Of these cases, 24 are benign and 24 are malignant. A jackknife experiment was performed using a standard back-propagation neural network as the classifier. The LABROC result showed that the Az of this preliminary study is 0.89.
We present a robust image synthesis method to automatically infer missing information from a damaged 2D image by tensor voting. Our method translates image color and texture information into an adaptive ND tensor, fol...
详细信息
ISBN:
(纸本)0769519008
We present a robust image synthesis method to automatically infer missing information from a damaged 2D image by tensor voting. Our method translates image color and texture information into an adaptive ND tensor, followed by a voting process that infers non-iteratively the optimal color values in the ND texture space for each defective pixel. ND tensor voting can be applied to images consisting of roughly homogeneous and periodic textures (e.g. a brick wall), as well as difficult images of natural scenes, which contain complex color and texture information. To effectively tackle the latter type of difficult images, a two-step method is proposed. First, we perform texture-based segmentation in the input image, and extrapolate partitioning curves to generate a complete segmentation for the image. Then, missing colors are synthesized using ND tensor voting. Automatic tensor scale analysis is used to adapt to different feature scales inherent in the input. We demonstrate the effectiveness of our approach using a difficult set of real images.
S-AdaBoost is a new variant of AdaBoost and is more effective than the conventional AdaBoost in handling outliers in pattern detection and classification in real world complex environment. Utilizing the divide and con...
详细信息
S-AdaBoost is a new variant of AdaBoost and is more effective than the conventional AdaBoost in handling outliers in pattern detection and classification in real world complex environment. Utilizing the divide and conquer principle, S-AdaBoost divides the input space into a few sub-spaces and uses dedicated classifiers to classify patterns in the sub-spaces. The final classification result is the combination of the outputs of the dedicated classifiers. S-AdaBoost system is made up of an AdaBoost divider, an AdaBoost classifier, a dedicated classifier for outliers, and a non-linear combiner. In addition to presenting face detection test results in a complex airport environment, we have also conducted experiments on a number of benchmark databases to test the algorithm. The experiment results clearly show S-AdaBoost's effectiveness in pattern detection and classification.
This paper introduces a practical approach for superresolution, the process of reconstructing a high-resolution image from the low-resolution input ones. The emphasis of our work is to super-resolve frames from dynami...
详细信息
ISBN:
(纸本)0769519008
This paper introduces a practical approach for superresolution, the process of reconstructing a high-resolution image from the low-resolution input ones. The emphasis of our work is to super-resolve frames from dynamic video sequences, which may contain significant object occlusion or scene changes. As the quality of super-resolved images highly relies on the correctness of image alignment between consecutive frames, we employ the robust optical flow method to accurately estimate motion between the image pair. An efficient and reliable scheme is designed to detect and discard incorrect matchings, which may degrade the output quality. We also introduce the usage of elliptical weighted average (EWA) filter to model the spatially variant point spread function (PSF) of acquisition system in order to improve accuracy of the model. A number of complex and dynamic video sequences are tested to demonstrate the applicability and reliability of our algorithm.
The Hamilton-Jacobi approach has proved to be a powerful and elegant method for extracting the skeleton of a shape. The approach is based on the fact that the inward evolving boundary flux is conservative everywhere e...
详细信息
The Hamilton-Jacobi approach has proved to be a powerful and elegant method for extracting the skeleton of a shape. The approach is based on the fact that the inward evolving boundary flux is conservative everywhere except at skeletal points. Nonetheless this method appears to overlook the fact that the linear density of the evolving boundary front is not constant where the front is curved. In this paper we present an analysis, which takes into account variations of density due to boundary curvature. This yields a skeletonization algorithm that is both better localized and less susceptible to boundary noise than the Hamilton-Jacobi method.
暂无评论