31 results
Search Results
2. Evaluating Shape Correspondence for Statistical Shape Analysis: A Benchmark Study.
- Author
-
Munsell, Brent C., Dalal, Pahal, and Song Wang
- Subjects
IMAGE analysis ,ALGORITHMS ,FORM perception ,STATISTICAL matching ,IMAGE storage & retrieval systems ,STANDARDS ,IMAGE converters ,IMAGE files ,PATTERN recognition systems - Abstract
This paper introduces a new benchmark study to evaluate the performance of landmark-based shape correspondence used for statistical shape analysis. Different from previous shape-correspondence evaluation methods, the proposed benchmark first generates a large set of synthetic shape instances by randomly sampling a given statistical shape model that defines a ground-truth shape space. We then run a test shape-correspondence algorithm on these synthetic shape instances to identify a set of corresponded landmarks. According to the identified corresponded landmarks, we construct a new statistical shape model which defines a new shape space. We finally compare this new shape space against the ground-truth shape space to determine the performance of the test shape- correspondence algorithm. In this paper, we introduce three new performance measures that are landmark independent to quantify the difference between the ground-truth and the newly derived shape spaces. By introducing a ground-truth shape space that is defined by a statistical shape model and three new landmark-independent performance measures, we believe the proposed benchmark allows for a more objective evaluation of shape correspondence than previous methods. In this paper, we focus on developing the proposed benchmark for 2D shape correspondence. However, it can easily be extended to 3D cases. [ABSTRACT FROM AUTHOR]
- Published
- 2008
- Full Text
- View/download PDF
3. Cover2.
- Subjects
MACHINE learning ,PATTERN perception ,ARTIFICIAL intelligence ,EDITORS ,MACHINE theory ,FORM perception - Published
- 2011
- Full Text
- View/download PDF
4. Feedback Convolutional Neural Network for Visual Localization and Segmentation.
- Author
-
Cao, Chunshui, Wang, Zilei, Huang, Yongzhen, Wang, Liang, Tan, Tieniu, and Yang, Yi
- Subjects
ARTIFICIAL neural networks ,PSYCHOLOGICAL feedback ,FORM perception ,COMPUTER vision ,NEURAL pathways - Abstract
Feedback is a fundamental mechanism existing in the human visual system, but has not been explored deeply in designing computer vision algorithms. In this paper, we claim that feedback plays a critical role in understanding convolutional neural networks (CNNs), e.g., how a neuron in CNNs describes an object's pattern, and how a collection of neurons form comprehensive perception to an object. To model the feedback in CNNs, we propose a novel model named Feedback CNN and develop two new processing algorithms, i.e., neural pathway pruning and pattern recovering. We mathematically prove that the proposed method can reach local optimum. Note that Feedback CNN belongs to weakly supervised methods and can be trained only using category-level labels. But it possesses a powerful capability to accurately localize and segment category-specific objects. We conduct extensive visualization analysis, and the results reveal the close relationship between neurons and object parts in Feedback CNN. Finally, we evaluate the proposed Feedback CNN over the tasks of weakly supervised object localization and segmentation, and the experimental results on ImageNet and Pascal VOC show that our method remarkably outperforms the state-of-the-art ones. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
5. Image Transformations and Blurring.
- Author
-
Domke, Justin and Aloimonos, Yiannis
- Subjects
IMAGE processing ,IMAGING systems ,COMPUTER vision ,IMAGE reconstruction ,IMAGE stabilization ,OPTICAL pattern recognition ,FORM perception - Abstract
Since cameras blur the incoming light during measurement, different images of the same surface do not contain the same information about that surface. Thus, in general, corresponding points in multiple views of a scene have different image intensities. While multiple-view geometry constrains the locations of corresponding points, it does not give relationships between the signals at corresponding locations. This paper offers an elementary treatment of these relationships. We first develop the notion of "ideal" and "real" images, corresponding to, respectively, the raw incoming light and the measured signal. This framework separates the filtering and geometric aspects of imaging. We then consider how to synthesize one view of a surface from another; if the transformation between the two views is affine, it emerges that this is possible if and only if the singular values of the affine matrix are positive. Next, we consider how to combine the information in several views of a surface into a single output image. By developing a new tool called "frequency segmentation," we show how this can be done despite not knowing the blurring kernel. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
6. Pattern Vectors from Algebraic Graph Theory.
- Author
-
Wilson, Richard C., Hancock, Edwin R., and Bin Luo
- Subjects
GRAPH theory ,PARTIAL differential equations ,PATTERN perception ,FORM perception ,LAPLACIAN operator ,ALGEBRA - Abstract
Graph structures have proven computationally cumbersome for pattern analysis. The reason for this is that, before graphs can be converted to pattern vectors, correspondences must be established between the nodes of structures which are potentially of different size. To overcome this problem, in this paper, we turn to the spectral decomposition of the Laplacian matrix. We show how the elements of the spectral matrix for the Laplacian can be used to construct symmetric polynomials that are permutation invariants. The coefficients of these polynomials can be used as graph features which can be encoded in a vectorial manner. We extend this representation to graphs in which there are unary attributes on the nodes and binary attributes on the edges by using the spectral decomposition of a Hermitian property matrix that can be viewed as a complex analogue of the Laplacian. To embed the graphs in a pattern space, we explore whether the vectors of invariants can be embedded in a low-dimensional space using a number of alternative strategies, including principal components analysis (PCA), multidimensional scaling (MDS), and locality preserving projection (LPP). Experimentally, we demonstrate that the embeddings result in well-defined graph clusters. Our experiments with the spectral representation involve both synthetic and real-world data. The experiments with synthetic data demonstrate that the distances between spectral feature vectors can be used to discriminate between graphs on the basis of their structure. The real-world experiments show that the method can be used to locate clusters of graphs. [ABSTRACT FROM AUTHOR]
- Published
- 2005
- Full Text
- View/download PDF
7. Probabilistic Finite-State Machines--Part I.
- Author
-
Vidal, Enrique, Thollard, Franck, de la Higuera, Cohn, Casacuberta, Francisco, and Carrasco, Rafael C.
- Subjects
PATTERN perception ,MACHINERY ,FORM perception ,SENSORY perception ,COMPUTATIONAL linguistics ,APPLIED linguistics - Abstract
Probabilistic finite-state machines are used today in a variety of areas in pattern recognition, or in fields to which pattern recognition is linked: computational linguistics, machine learning, time series analysis, circuit testing, computational biology, speech recognition, and machine translation are some of them. In Part I of this paper, we survey these generative objects and study their definitions and properties. In Part II, we will study the relation of probabilistic finite-state automata with other well-known devices that generate strings as hidden Markov models and n-grams and provide theorems, algorithms, and properties that represent a current state of the art of these objects. [ABSTRACT FROM AUTHOR]
- Published
- 2005
- Full Text
- View/download PDF
8. Image Distortion Analysis Using Polynomial Series Expansion.
- Author
-
Baggenstoss, Paul M.
- Subjects
POLYNOMIALS ,MATRICES (Mathematics) ,LINEAR statistical models ,PATTERN perception ,ALGEBRA ,FORM perception - Abstract
In this paper, we derive a technique for analysis of local distortions which affect data in real-world applications. In the paper, we focus on image data, specifically handwritten characters. Given a reference image and a distorted copy of it, the method is able to efficiently determine the rotations, translations, scaling, and any other distortions that have been applied. Because the method is robust, it is also able to estimate distortions for two unrelated images, thus determining the distortions that would be required to cause the two images to resemble each other. The approach is based on a polynomial series expansion using matrix powers of linear transformation matrices. The technique has applications in pattern recognition in the presence of distortions. [ABSTRACT FROM AUTHOR]
- Published
- 2004
- Full Text
- View/download PDF
9. Learning Graph Matching.
- Author
-
Caetano, Tibério S., McAuley, Julian J., Li Cheng, Le, Quoc V., and Smola, Alex J.
- Subjects
PATTERN perception ,PATTERN recognition systems ,COMPUTER vision ,FORM perception ,SUPPORT vector machines ,KERNEL functions - Abstract
As a fundamental problem in pattern recognition, graph matching has applications in a variety of fields, from computer vision to computational biology. In graph matching, patterns are modeled as graphs and pattern recognition amounts to finding a correspondence between the nodes of different graphs. Many formulations of this problem can be cast in general as a quadratic assignment problem, where a linear term in the objective function encodes node compatibility and a quadratic term encodes edge compatibility. The main research focus in this theme is about designing efficient algorithms for approximately solving the quadratic assignment problem since it is NP-hard. In this paper, we turn our attention to a different question: how to estimate compatibility functions such that the solution of the resulting graph matching problem best matches the expected solution that a human would manually provide. We present a method for learning graph matching The training examples are pairs of graphs and the "labels" are matches between them. Our experimental results reveal that learning can substantially improve the performance of standard graph matching algorithms. In particular, we find that simple linear assignment with such a learning scheme outperforms Graduated Assignment with bistochastic normalization, a state-of-the-art quadratic assignment relaxation algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
10. Skeletal Shape Abstraction from Examples.
- Author
-
Demirci, M. Fatih, Shokoufandeh, Ali, and Dickinson, Sven J.
- Subjects
PATTERN perception ,FORM perception ,PATTERN recognition systems ,OPTICAL pattern recognition ,COMPUTER vision ,ARTIFICIAL intelligence - Abstract
Learning a class prototype from a set of exemplars is an important challenge facing researchers in object categorization. Although the problem is receiving growing interest, most approaches assume a one-to-one correspondence among local features, restricting their ability to learn true abstractions of a shape. In this paper, we present a new technique for learning an abstract shape prototype from a set of exemplars whose features are in many-to-many correspondence. Focusing on the domain of 2D shape, we represent a silhouette as a medial axis graph whose nodes correspond to "parts" defined by medial branches and whose edges connect adjacent parts. Given a pair of medial axis graphs, we establish a many-to-many correspondence between their nodes to find correspondences among articulating parts. Based on these correspondences, we recover the abstracted medial axis graph along with the positional and radial attributes associated with its nodes. We evaluate the abstracted prototypes in the context of a recognition task. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
11. Transitions of the 3D Medial Axis under a One-Parameter Family of Deformations.
- Author
-
Giblin, Peter J., Kimia, Benjamin B., and Pollitt, Anthony J.
- Subjects
COMPUTER vision ,IMAGE processing ,PATTERN recognition systems ,ARTIFICIAL intelligence ,FORM perception ,HAMILTON-Jacobi equations - Abstract
The instabilities of the medial axis of a shape under deformations have long been recognized as a major obstacle to its use in recognition and other applications. These instabilities, or transitions, occur when the structure of the medial axis graph changes abruptly under deformations of shape. The recent classification of these transitions in 2D for the medial axis and for the shock graph was a key factor in the development of an object recognition system where the classified instabilities were utilized to represent deformation paths. The classification of generic transitions of the 3D medial axis could likewise potentially lead to a similar representation in 3D. In this paper, these transitions are classified by examining the order of contact of spheres with the surface, leading to an enumeration of possible transitions which are then examined on a case-by-case basis. Some cases are ruled out as never occurring in any family of deformations, while others are shown to be nongeneric in a one-parameter family of deformations. Finally, the remaining cases are shown to be viable by developing a specific example for each. Our work is inspired by that of Bogaevsky, who obtained the transitions as part of an investigation of viscosity solutions of Hamilton-Jacobi equations. Our contribution is to give a more down-to-earth approach, bringing this work to the attention of the computer vision community, and to provide explicit constructions for the various transitions using simple surfaces. We believe that the classification of these transitions is vital to the successful regularization of the medial axis in its use in real applications. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
12. A Novel Connectionist System for Unconstrained Handwriting Recognition.
- Author
-
Graves, Alex, Liwicki, Marcus, Fernández, Santiago, Bertolami, Roman, Bunke, Horst, and Schmidhuber, Jürgen
- Subjects
ARTIFICIAL neural networks ,MARKOV processes ,HIDDEN Markov models ,ONLINE databases ,PATTERN perception ,FORM perception ,PATTERN recognition systems - Abstract
Recognizing lines of unconstrained handwritten text is a challenging task. The difficulty of segmenting cursive or overlapping characters, combined with the need to exploit surrounding context, has led to low recognition rates for even the best current recognizers. Most recent progress in the field has been made either through improved preprocessing or through advances in language modeling. Relatively little work has been done on the basic recognition algorithms. Indeed, most systems rely on the same hidden Markov models that have been used for decades in speech and handwriting recognition, despite their well-known shortcomings. This paper proposes an alternative approach based on a novel type of recurrent neural network, specifically designed for sequence labeling tasks where the data is hard to segment and contains long-range bidirectional interdependencies. In experiments on two large unconstrained handwriting databases, our approach achieves word recognition accuracies of 79.7 percent on online data and 74.1 percent on offline data, significantly outperforming a state-of-the-art HMM-based system. In addition, we demonstrate the network's robustness to lexicon size, measure the individual influence of its hidden layers, and analyze its use of context. Last, we provide an in-depth discussion of the differences between the network and HMMs, suggesting reasons for the network's superior performance. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
13. Branch-and-Bound Methods for Euclidean Registration Problems.
- Author
-
Olsson, Carl, Kahl, Fredrik, and Oskarsson, Magnus
- Subjects
IMAGE registration ,PATTERN perception ,FORM perception ,PATTERN recognition systems ,BRANCH & bound algorithms ,NETWORK analysis (Planning) ,MAXIMA & minima ,MATHEMATICAL optimization - Abstract
In this paper, we propose a practical and efficient method for finding the globally optimal solution to the problem of determining the pose of an object. We present a framework that allows us to use point-to-point, point-to-line, and point-to-plane correspondences for solving various types of pose and registration problems involving euclidean (or similarity) transformations. Traditional methods such as the iterative closest point algorithm or bundle adjustment methods for camera pose may get trapped in local minima due to the nonconvexity of the corresponding optimization problem. Our approach of solving the mathematical optimization problems guarantees global optimality. The optimization scheme is based on ideas from global optimization theory, in particular convex underestimators in combination with branch-and-bound methods. We provide a provably optimal algorithm and demonstrate good performance on both synthetic and real data. We also give examples of where traditional methods fail due to the local minima problem. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
14. Nonparametric Discriminant Analysis for Face Recognition.
- Author
-
Zhifeng Li, Dahua Lin, and Xiaoou Tang
- Subjects
DISCRIMINANT analysis ,MULTIVARIATE analysis ,STATISTICAL correlation ,HUMAN facial recognition software ,OPTICAL pattern recognition ,PATTERN perception ,FORM perception ,COMPUTER vision - Abstract
In this paper, we develop a new framework for face recognition based on nonparametric discriminant analysis (NDA) and multiclassifier integration. Traditional LDA-based methods suffer a fundamental limitation originating from the parametric nature of scatter matrices, which are based on the Gaussian distribution assumption. The performance of these methods notably degrades when the actual distribution is non-Gaussian. To address this problem, we propose a new formulation of scatter matrices to extend the two-class NDA to multiclass cases. Then, in order to exploit the discriminant information in both the principal space and the null space of the intraclass scatter matrix, we develop two improved multiclass NDA-based algorithms (NSA and NFA) with each one having two complementary methods that are based on the principal space and the null space of the intraclass scatter matrix, respectively. Comparing to the NSA, the NFA is more effective in the utilization of the classification boundary information. In order to exploit the complementary nature of the two kinds of NFA (PNFA and NNFA), we finally develop a dual NFA-based multiclassifier fusion framework by employing the overcomplete Gabor representation for face images to boost the recognition performance. We show the improvements of the developed new algorithms over the traditional subspace methods through comparative experiments on two challenging face databases, the Purdue AR database and the XM2VTS database. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
15. 2D Shape Matching by Contour Flexibility.
- Author
-
Chunjing Xu, Jianzhuang Liu, and Xiaoou Tang
- Subjects
COMPUTER vision ,ARTIFICIAL intelligence ,IMAGE processing ,PATTERN recognition systems ,PATTERN perception ,FORM perception - Abstract
In computer vision, shape matching is a challenging problem, especially when articulation and deformation of parts occur. These variations may be insignificant for human recognition but often cause a matching algorithm to give results that are inconsistent with our perception. In this paper, we propose a novel shape descriptor of planar contours, called contour flexibility, which represents the deformable potential at each point along a contour. With this descriptor, the local and global features can be obtained from the contour. We then present a shape matching scheme based on the features obtained. Experiments with comparisons to recently published algorithms show that our algorithm performs best. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
16. Registration with Uncertainties and Statistical Modeling of Shapes with Variable Metric Kernels.
- Author
-
Taron, Maxime, Paragios, Nikos, and Jolly, Marie-Pierre
- Subjects
FORM perception ,INFORMATION measurement ,UNCERTAINTY (Information theory) ,NONPARAMETRIC statistics ,ORDER statistics ,COMPLEX variables ,KERNEL functions - Abstract
Registration and modeling of shapes are two important problems in computer vision and pattern recognition. Despite enormous progress made over the past decade, these problems are still open. In this paper, we advance the state of the art in both directions. First, we consider an efficient registration method that aims to recover a one-to-one correspondence between shapes and introduce measures of uncertainties driven from the data which explain the local support of the recovered transformations. To this end, a free-form deformation is used to describe the deformation model. The transformation is combined with an objective function defined in the space of implicit functions used to represent shapes. Once the registration parameters have been recovered, we introduce a novel technique for model building and statistical interpretation of the training examples based on a variable bandwidth kernel approach. The support on the kernels varies spatially and is determined according to the uncertainties of the registration process. Such a technique introduces the ability to account for potential registration errors in the model. Handwritten character recognition and knowledge-based object extraction in medical images are examples of applications that demonstrate the potentials of the proposed framework. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
17. Path Similarity Skeleton Graph Matching.
- Author
-
Xiang Bai and Longin Jan Latecki
- Subjects
FORM perception ,COMPUTER vision ,ARTIFICIAL intelligence ,IMAGE processing ,PATTERN recognition systems ,CONTOURS (Cartography) - Abstract
This paper proposes a nevel graph matching algorithm and applies it to shape recognition based on object silhouettes. The main idea is to match skeleton graphs by comparing the geodesic paths between skeleton endpoints. In contrast to typical tree or graph matching methods, we do not consider the topological graph structure. The proposed comparison of geodesic path between endpoints of skeleton graph yields correct matching results in such cases. The skeletons are pruned by contour partitioning with Discrete Curve Evolution, which implies that the endpoints of skeleton branches correspond to visual parts of the objects. The experimental results demonstrate that our method is able to produce results in the presence of articulations, stretching, and contour deformations. [ABSTRACT FROM AUTHOR]
- Published
- 2008
- Full Text
- View/download PDF
18. High-Precision Boundary Length Estimation by Utilizing Gray-Level Information.
- Author
-
Sladoje, Nataša and Lindblad, Joakim
- Subjects
FORM perception ,FEATURE extraction ,ELECTRONIC data processing ,PATTERN recognition systems ,IMAGE processing ,PIXELS ,DIGITAL images - Abstract
We present a novel method that provides an accurate and precise estimate of the length of the boundary (perimeter) of an object by taking into account gray levels on the boundary of the digitization of the same object. Assuming a model where pixel intensity is proportional to the coverage of a pixel, we show that the presented method provides error-free measurements of the length of straight boundary segments in the case of nonquantized pixel values. For a more realistic situation, where pixel values are quantized, we derive optimal estimates that minimize the maximal estimation error. We show that the estimate converges toward a correct value as the number of gray levels tends toward infinity. The method is easy to implement; we provide the complete pseudocode. Since the method utilizes Only a small neighborhood, it is very easy to parallelize. We evaluate the estimator on a set of concave and convex shapes with known perimeters, digitized at increasing resolution. In addition, we provide an example of applicability of the method on real images, by suggesting appropriate preprocessing steps and presenting results of a comparison of the suggested method with other local approaches. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
19. Comments on the CASIA Version 1.0 Iris Data Set.
- Author
-
Phillips, P. Jonathon, Bowyer, Kevin W., and Flynn, Patrick J.
- Subjects
PATTERN perception ,PATTERN recognition systems ,BIOMETRY ,BIOMATHEMATICS ,IMAGE processing ,FORM perception ,IRIS (Eye) ,COMPUTER vision ,GENETIC algebras - Abstract
We note that the images in the CASIA version 1.0 iris data set have been edited so that the pupil area is replaced by a circular region of uniform intensity. We recommend that this data set no longer be used in iris biometrics research unless there is a compelling reason that takes into account the nature of the images. In addition, based on our experience with the Iris Challenge Evaluation (ICE) 2005 technology development project, we make recommendations for reporting results of iris recognition experiments. [ABSTRACT FROM AUTHOR]
- Published
- 2007
- Full Text
- View/download PDF
20. Make3D: Learning 3D Scene Structure from a Single Still Image.
- Author
-
Saxena, Ashutosh, Min Sun, and Ng, Andrew Y.
- Subjects
MACHINE learning ,ARTIFICIAL intelligence ,MONOCULAR vision ,THREE-dimensional display systems ,PATTERN perception ,PATTERN recognition systems ,FORM perception - Abstract
We consider the problem of estimating detailed 3D structure from a single still image of an unstructured environment. Our goal is to create 3D models that are both quantitatively accurate as well as visually pleasing. For each small homogeneous patch in the image, we use a Markov Random Field (MRF) to infer a set of 'plane parameters" that capture both the 3D location and 3D orientation of the patch. The MRF, trained via supervised learning, models both image depth cues as well as the relationships between different parts of the image. Other than assuming that the environment is made up of a number of small planes, our model makes no explicit assumptions about the structure of the scene; this enables the algorithm to capture much more detailed 3D structure than does prior art and also give a much richer experience in the 3D flythroughs created using image-based rendering, even for scenes with significant nonvertical structure. Using this approach, we have created qualitatively correct 3D models for 64.9 percent of 588 images downloaded from the Internet. We have also extended our model to produce large-scale 3D models from a few images. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
21. Visual Tracking by Continuous Density Propagation in Sequential Bayesian Filtering Framework.
- Author
-
Bohyung Han, Ying Zhu, Comaniciu, Dorin, and Davis, Larry S.
- Subjects
BAYESIAN analysis ,PATTERN perception ,FORM perception ,PATTERN recognition systems ,COMPUTER vision ,IMAGE processing - Abstract
Particle filtering is frequently used for visual tracking problems since it provides a general framework for estimating and propagating probability density functions for nonlinear and non-Gaussian dynamic systems. However, this algorithm is based on a Monte Carlo approach and the cost of sampling and measurement is a problematic issue, especially for high-dimensional problems. We describe an alternative to the classical particle filter in which the underlying density function has an analytic representation for better approximation and effective propagation. The techniques of density interpolation and density approximation are introduced to represent the likelihood and the posterior densities with Gaussian mixtures, where all relevant parameters are automatically determined. The proposed analytic approach is shown to perform more efficiently in sampling in high-dimensional space. We apply the algorithm to real-time tracking problems and demonstrate its performance on real video sequences as well as synthetic examples. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
22. Robust Estimation of Albedo for Illumination-Invariant Matching and Shape Recovery.
- Author
-
Biswas, Soma, Aggarwal, Gaurav, and Chellappa, Rama
- Subjects
PATTERN perception ,FORM perception ,PATTERN recognition systems ,FIGURE-ground perception ,COMPUTER vision ,LIGHT sources ,IMAGE reconstruction - Abstract
We present a nonstationary stochastic filtering framework for the task of albedo estimation from a single image. There are several approaches in the literature for albedo estimation, but few include the errors in estimates of surface normals and light source direction to improve the albedo estimate. The proposed approach effectively utilizes the error statistics of surface normals and illumination direction for robust estimation of albedo, for images illuminated by single and multiple light sources. The albedo estimate obtained is subsequently used to generate albedo-free normalized images for recovering the shape of an object. Traditional Shape- from-Shading (SFS) approaches often assume constant/piecewise constant albedo and known light source direction to recover the underlying shape. Using the estimated albedo, the general problem of estimating the shape of an object with varying albedo map and unknown illumination source is reduced to one that can be handled by traditional SFS approaches. Experimental results are provided to show the effectiveness of the approach and its application to illumination-invariant matching and shape recovery. The estimated albedo maps are compared with the ground truth. The maps are used as illumination-invariant signatures for the task of face recognition across illumination variations. The recognition results obtained compare well with the current state-of-the-art approaches. Impressive shape recovery results are obtained using images downloaded from the Web with little control over imaging conditions. The recovered shapes are also used to synthesize novel views under novel illumination conditions. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
23. Bayesian Nonlinear Principal Component Analysis Using Random Fields.
- Author
-
Heng Lian
- Subjects
MARKOV random fields ,RANDOM fields ,STOCHASTIC processes ,PATTERN perception ,FORM perception ,PATTERN recognition systems - Abstract
We propose a novel model for nonlinear dimension reduction motivated by the probabilistic formulation of principal component analysis. Nonlinearity is achieved by specifying different transformation matrices at different locations of the latent space and smoothing the transformation using a Markov random field type prior. The computation is made feasible by the recent advances in sampling from von Mises-Fisher distributions. The computational properties of the algorithm are illustrated through simulations as well as an application to handwritten digits data. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
24. Information Geometry for Landmark Shape Analysis: Unifying Shape Representation and Deformation.
- Author
-
Peter, Adrian M. and Rangarajan, Anand
- Subjects
FORM perception ,INFORMATION theory ,ENTROPY (Information theory) ,GAUSSIAN processes ,DISTRIBUTION (Probability theory) ,PATTERN perception - Abstract
Shape matching plays a prominent role in the comparison of similar structures. We present a unifying framework for shape matching that uses mixture models to couple both the shape representation and deformation. The theoretical foundation is drawn from information geometry wherein information matrices are used to establish intrinsic distances between parametric densities. When a parameterized probability density function is used to represent a landmark-based shape, the modes of deformation are automatically established through the information matrix of the density. We first show that given two shapes parameterized by Gaussian mixture models (GMMs), the well-known Fisher information matrix of the mixture model is also a Riemannian metric (actually, the Fisher-Rao Riemannian metric) and can therefore be used for computing shape geodesics. The Fisher-Rao metric has the advantage of being an intrinsic metric and invariant to reparameterization. The geodesic-computed using this metric-establishes an intrinsic deformation between the shapes, thus unifying both shape representation and deformation. A fundamental drawback of the Fisher-Rao metric is that it is not available in closed form for the GMM. Consequently, shape comparisons are computationally very expensive. To address this, we develop a new Riemannian metric based on generalized ~-entropy measures. In sharp contrast to the Fisher-Rao metric, the new metric is available in closed form. Geodesic computations using the new metric are considerably more efficient. We validate the performance and discriminative capabilities of these new information geometry-based metrics by pairwise matching of corpus callosum shapes. We also study the deformations of fish shapes that have various topological properties. A comprehensive comparative analysis is also provided using other landmark-based distances, including the Hausdorff distance, the Procrustes metric, landmark- based diffeomorphisms, and the bending energies of the thin-plate (TPS) and Wendland splines. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
25. Hidden Conditional Random Fields.
- Author
-
Quattoni, Ariadna, Wang, Sybor, Morency, Louis-Philippe, Collins, Michael, and Darrell, Trevor
- Subjects
CONDITIONAL random fields ,STOCHASTIC processes ,MATHEMATICAL variables ,MULTIVARIATE analysis ,PATTERN perception ,PATTERN recognition systems ,FORM perception ,SUPERVISED learning ,MACHINE learning - Abstract
We present a discriminative latent variable model for classification problems in structured domains where inputs can be represented by a graph of local observations. A hidden-state Conditional Random Field framework learns a set of latent variables conditioned on local features. Observations need not be independent and may overlap in space and time. [ABSTRACT FROM AUTHOR]
- Published
- 2007
- Full Text
- View/download PDF
26. Feature Extraction Using Information-Theoretic Learning.
- Author
-
Hild II, Kenneth E., Erdogmus, Deniz, Torkkola, Kari, and Principe, Jose C.
- Subjects
PATTERN recognition systems ,IMAGE processing ,INFORMATION theory ,CLASSIFICATION ,NONPARAMETRIC statistics ,FORM perception - Abstract
A classification system typically consists of both a feature extractor (preprocessor) and a classifier. These two components can be trained either independently or simultaneously. The former option has an implementation advantage since the extractor need only be trained once for use with any classifier, whereas the latter has an advantage since it can be used to minimize classification error directly. Certain criteria, such as Minimum Classification Error, are better suited for simultaneous training, whereas other criteria, such as Mutual Information, are amenable for training the feature extractor either independently or simultaneously. Herein, an information-theoretic criterion is introduced and is evaluated for training the extractor independently of the classifier. The proposed method uses nonparametric estimation of Renyi's entropy to train the extractor by maximizing an approximation of the mutual information between the class labels and the output of the feature extractor. The evaluations show that the proposed method, even though it uses independent training, performs at least as well as three feature extraction methods that train the extractor and classifier simultaneously. [ABSTRACT FROM AUTHOR]
- Published
- 2006
- Full Text
- View/download PDF
27. Object Recognition Using Shape-from-Shading.
- Author
-
Worthington, Philip L. and Hancock, Edwin R.
- Subjects
IMAGE processing ,FORM perception ,ALGORITHMS - Abstract
Investigates whether surface topography information extracted from intensity images using a shape-from-shading algorithm can be used for three-dimensional object recognition. Evaluation of recognition performance using histograms of various attributes; Use of the structural arrangement of the regions of uniform topographic class in recognition and matching; Performance of each of the recognition schemes developed.
- Published
- 2001
- Full Text
- View/download PDF
28. A framework for performance characterization of intermediate-level grouping modules.
- Author
-
Borra, Sudhir and Sarkar, Sudeep
- Subjects
FORM perception - Abstract
Presents five performance measures for the evaluation of grouping modules in the context of constrained search and indexing based object recognition. Use of these measures to demonstrate an experimental framework to compare and contrast three edge based organization modules; What the framework is based on; Identification of the modules; Overall performance ranking of the modules.
- Published
- 1997
- Full Text
- View/download PDF
29. Scene understanding by rule evaluation.
- Author
-
Bischof, Walter F. and Caelli, Terry
- Subjects
MACHINE learning ,VISUAL learning ,FORM perception - Abstract
Considers how machine learning can be used to help solve the problem of identifying objects or structures composed of parts in complex scenes. Discussion of a conditional rule generation technique; What this technique is designed to describe; Illustration of how the resultant rules can be utilized.
- Published
- 1997
30. Visual image retrieval by elastic matching of user sketches.
- Author
-
Del Bimbo, Alberto and Pala, Pietro
- Subjects
OPTICAL images ,FORM perception - Abstract
Discusses a technique for image retrieval by shape similarity based on elastic deformation of sketched templates to match image data. Introduction of the elastic approach to shape matching; Representation of spatial relationships between objects; Presentation of experimental results and performance analysis.
- Published
- 1997
- Full Text
- View/download PDF
31. A generic system for form dropout.
- Author
-
Yu, Bin and Jain, Anil K.
- Subjects
FORM perception ,IMAGE reconstruction - Abstract
Describes a generic system for form dropout when the filled-in characters or symbols are either touching or crossing the form frames. Block adjacency graph; Stroke reconstruction; Locating and separating horizontal form frames; Filled-in data extraction.
- Published
- 1996
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.