| Home | << 1 2 3 4 5 6 7 8 9 10 >> [11–14] |
|
| Records | |||||
|---|---|---|---|---|---|
| Author | Arjan Gijsenij; Theo Gevers; Joost Van de Weijer | ||||
| Title | Improving Color Constancy by Photometric Edge Weighting | Type | Journal Article | ||
| Year | 2012 | Publication | IEEE Transaction on Pattern Analysis and Machine Intelligence | Abbreviated Journal | TPAMI |
| Volume | 34 | Issue | 5 | Pages | 918-929 |
| Keywords | |||||
| Abstract | : Edge-based color constancy methods make use of image derivatives to estimate the illuminant. However, different edge types exist in real-world images such as material, shadow and highlight edges. These different edge types may have a distinctive influence on the performance of the illuminant estimation. Therefore, in this paper, an extensive analysis is provided of different edge types on the performance of edge-based color constancy methods. First, an edge-based taxonomy is presented classifying edge types based on their photometric properties (e.g. material, shadow-geometry and highlights). Then, a performance evaluation of edge-based color constancy is provided using these different edge types. From this performance evaluation it is derived that specular and shadow edge types are more valuable than material edges for the estimation of the illuminant. To this end, the (iterative) weighted Grey-Edge algorithm is proposed in which these edge types are more emphasized for the estimation of the illuminant. Images that are recorded under controlled circumstances demonstrate that the proposed iterative weighted Grey-Edge algorithm based on highlights reduces the median angular error with approximately $25\%$. In an uncontrolled environment, improvements in angular error up to $11\%$ are obtained with respect to regular edge-based color constancy. | ||||
| Address | Los Alamitos; CA; USA; | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
ISSN  |
0162-8828 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | CIC;ISE | Approved | no | ||
| Call Number | Admin @ si @ GGW2012 | Serial | 1850 | ||
| Permanent link to this record | |||||
| Author | Yunchao Gong; Svetlana Lazebnik; Albert Gordo; Florent Perronnin | ||||
| Title | Iterative quantization: A procrustean approach to learning binary codes for Large-Scale Image Retrieval | Type | Journal Article | ||
| Year | 2012 | Publication | IEEE Transactions on Pattern Analysis and Machine Intelligence | Abbreviated Journal | TPAMI |
| Volume | 35 | Issue | 12 | Pages | 2916-2929 |
| Keywords | |||||
| Abstract | This paper addresses the problem of learning similarity-preserving binary codes for efficient similarity search in large-scale image collections. We formulate this problem in terms of finding a rotation of zero-centered data so as to minimize the quantization error of mapping this data to the vertices of a zero-centered binary hypercube, and propose a simple and efficient alternating minimization algorithm to accomplish this task. This algorithm, dubbed iterative quantization (ITQ), has connections to multi-class spectral clustering and to the orthogonal Procrustes problem, and it can be used both with unsupervised data embeddings such as PCA and supervised embeddings such as canonical correlation analysis (CCA). The resulting binary codes significantly outperform several other state-of-the-art methods. We also show that further performance improvements can result from transforming the data with a nonlinear kernel mapping prior to PCA or CCA. Finally, we demonstrate an application of ITQ to learning binary attributes or “classemes” on the ImageNet dataset. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN |
0162-8828 | ISBN | 978-1-4577-0394-2 | Medium | |
| Area | Expedition | Conference | |||
| Notes | DAG | Approved | no | ||
| Call Number | Admin @ si @ GLG 2012b | Serial | 2008 | ||
| Permanent link to this record | |||||
| Author | Naila Murray; Sandra Skaff; Luca Marchesotti; Florent Perronnin | ||||
| Title | Towards automatic and flexible concept transfer | Type | Journal Article | ||
| Year | 2012 | Publication | Computers and Graphics | Abbreviated Journal | CG |
| Volume | 36 | Issue | 6 | Pages | 622–634 |
| Keywords | |||||
| Abstract | This paper introduces a novel approach to automatic, yet flexible, image concepttransfer; examples of concepts are “romantic”, “earthy”, and “luscious”. The presented method modifies the color content of an input image given only a concept specified by a user in natural language, thereby requiring minimal user input. This method is particularly useful for users who are aware of the message they wish to convey in the transferred image while being unsure of the color combination needed to achieve the corresponding transfer. Our framework is flexible for two reasons. First, the user may select one of two modalities to map input image chromaticities to target concept chromaticities depending on the level of photo-realism required. Second, the user may adjust the intensity level of the concepttransfer to his/her liking with a single parameter. The proposed method uses a convex clustering algorithm, with a novel pruning mechanism, to automatically set the complexity of models of chromatic content. Results show that our approach yields transferred images which effectively represent concepts as confirmed by a user study. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN |
0097-8493 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | CIC | Approved | no | ||
| Call Number | Admin @ si @ MSM2012 | Serial | 2002 | ||
| Permanent link to this record | |||||
| Author | Noha Elfiky; Fahad Shahbaz Khan; Joost Van de Weijer; Jordi Gonzalez | ||||
| Title | Discriminative Compact Pyramids for Object and Scene Recognition | Type | Journal Article | ||
| Year | 2012 | Publication | Pattern Recognition | Abbreviated Journal | PR |
| Volume | 45 | Issue | 4 | Pages | 1627-1636 |
| Keywords | |||||
| Abstract | Spatial pyramids have been successfully applied to incorporating spatial information into bag-of-words based image representation. However, a major drawback is that it leads to high dimensional image representations. In this paper, we present a novel framework for obtaining compact pyramid representation. First, we investigate the usage of the divisive information theoretic feature clustering (DITC) algorithm in creating a compact pyramid representation. In many cases this method allows us to reduce the size of a high dimensional pyramid representation up to an order of magnitude with little or no loss in accuracy. Furthermore, comparison to clustering based on agglomerative information bottleneck (AIB) shows that our method obtains superior results at significantly lower computational costs. Moreover, we investigate the optimal combination of multiple features in the context of our compact pyramid representation. Finally, experiments show that the method can obtain state-of-the-art results on several challenging data sets. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN |
0031-3203 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | ISE; CAT;CIC | Approved | no | ||
| Call Number | Admin @ si @ EKW2012 | Serial | 1807 | ||
| Permanent link to this record | |||||
| Author | Bogdan Raducanu; Fadi Dornaika | ||||
| Title | A Supervised Non-linear Dimensionality Reduction Approach for Manifold Learning | Type | Journal Article | ||
| Year | 2012 | Publication | Pattern Recognition | Abbreviated Journal | PR |
| Volume | 45 | Issue | 6 | Pages | 2432-2444 |
| Keywords | |||||
| Abstract | IF= 2.61
IF=2.61 (2010) In this paper we introduce a novel supervised manifold learning technique called Supervised Laplacian Eigenmaps (S-LE), which makes use of class label information to guide the procedure of non-linear dimensionality reduction by adopting the large margin concept. The graph Laplacian is split into two components: within-class graph and between-class graph to better characterize the discriminant property of the data. Our approach has two important characteristics: (i) it adaptively estimates the local neighborhood surrounding each sample based on data density and similarity and (ii) the objective function simultaneously maximizes the local margin between heterogeneous samples and pushes the homogeneous samples closer to each other. Our approach has been tested on several challenging face databases and it has been conveniently compared with other linear and non-linear techniques, demonstrating its superiority. Although we have concentrated in this paper on the face recognition problem, the proposed approach could also be applied to other category of objects characterized by large variations in their appearance (such as hand or body pose, for instance. |
||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Elsevier | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN |
0031-3203 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | OR; MV | Approved | no | ||
| Call Number | Admin @ si @ RaD2012a | Serial | 1884 | ||
| Permanent link to this record | |||||
| Author | Jon Almazan; Alicia Fornes; Ernest Valveny | ||||
| Title | A non-rigid appearance model for shape description and recognition | Type | Journal Article | ||
| Year | 2012 | Publication | Pattern Recognition | Abbreviated Journal | PR |
| Volume | 45 | Issue | 9 | Pages | 3105--3113 |
| Keywords | Shape recognition; Deformable models; Shape modeling; Hand-drawn recognition | ||||
| Abstract | In this paper we describe a framework to learn a model of shape variability in a set of patterns. The framework is based on the Active Appearance Model (AAM) and permits to combine shape deformations with appearance variability. We have used two modifications of the Blurred Shape Model (BSM) descriptor as basic shape and appearance features to learn the model. These modifications permit to overcome the rigidity of the original BSM, adapting it to the deformations of the shape to be represented. We have applied this framework to representation and classification of handwritten digits and symbols. We show that results of the proposed methodology outperform the original BSM approach. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN |
0031-3203 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | DAG | Approved | no | ||
| Call Number | DAG @ dag @ AFV2012 | Serial | 1982 | ||
| Permanent link to this record | |||||
| Author | Jaume Gibert; Ernest Valveny; Horst Bunke | ||||
| Title | Graph Embedding in Vector Spaces by Node Attribute Statistics | Type | Journal Article | ||
| Year | 2012 | Publication | Pattern Recognition | Abbreviated Journal | PR |
| Volume | 45 | Issue | 9 | Pages | 3072-3083 |
| Keywords | Structural pattern recognition; Graph embedding; Data clustering; Graph classification | ||||
| Abstract | Graph-based representations are of broad use and applicability in pattern recognition. They exhibit, however, a major drawback with regards to the processing tools that are available in their domain. Graphembedding into vectorspaces is a growing field among the structural pattern recognition community which aims at providing a feature vector representation for every graph, and thus enables classical statistical learning machinery to be used on graph-based input patterns. In this work, we propose a novel embedding methodology for graphs with continuous nodeattributes and unattributed edges. The approach presented in this paper is based on statistics of the node labels and the edges between them, based on their similarity to a set of representatives. We specifically deal with an important issue of this methodology, namely, the selection of a suitable set of representatives. In an experimental evaluation, we empirically show the advantages of this novel approach in the context of different classification problems using several databases of graphs. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN |
0031-3203 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | DAG | Approved | no | ||
| Call Number | Admin @ si @ GVB2012a | Serial | 1992 | ||
| Permanent link to this record | |||||
| Author | Jorge Bernal; F. Javier Sanchez; Fernando Vilariño | ||||
| Title | Towards Automatic Polyp Detection with a Polyp Appearance Model | Type | Journal Article | ||
| Year | 2012 | Publication | Pattern Recognition | Abbreviated Journal | PR |
| Volume | 45 | Issue | 9 | Pages | 3166-3182 |
| Keywords | Colonoscopy,PolypDetection,RegionSegmentation,SA-DOVA descriptot | ||||
| Abstract | This work aims at the automatic polyp detection by using a model of polyp appearance in the context of the analysis of colonoscopy videos. Our method consists of three stages: region segmentation, region description and region classification. The performance of our region segmentation method guarantees that if a polyp is present in the image, it will be exclusively and totally contained in a single region. The output of the algorithm also defines which regions can be considered as non-informative. We define as our region descriptor the novel Sector Accumulation-Depth of Valleys Accumulation (SA-DOVA), which provides a necessary but not sufficient condition for the polyp presence. Finally, we classify our segmented regions according to the maximal values of the SA-DOVA descriptor. Our preliminary classification results are promising, especially when classifying those parts of the image that do not contain a polyp inside. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Elsevier | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN |
0031-3203 | ISBN | Medium | ||
| Area | 800 | Expedition | Conference | IbPRIA | |
| Notes | MV;SIAI | Approved | no | ||
| Call Number | Admin @ si @ BSV2012; IAM @ iam | Serial | 1997 | ||
| Permanent link to this record | |||||
| Author | Mario Hernandez; Joao Sanchez; Jordi Vitria | ||||
| Title | Selected papers from Iberian Conference on Pattern Recognition and Image Analysis | Type | Book Whole | ||
| Year | 2012 | Publication | Pattern Recognition | Abbreviated Journal | |
| Volume | 45 | Issue | 9 | Pages | 3047-3582 |
| Keywords | |||||
| Abstract | |||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN |
0031-3203 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | OR;MV | Approved | no | ||
| Call Number | Admin @ si @ HSV2012 | Serial | 2069 | ||
| Permanent link to this record | |||||
| Author | Susana Alvarez; Maria Vanrell | ||||
| Title | Texton theory revisited: a bag-of-words approach to combine textons | Type | Journal Article | ||
| Year | 2012 | Publication | Pattern Recognition | Abbreviated Journal | PR |
| Volume | 45 | Issue | 12 | Pages | 4312-4325 |
| Keywords | |||||
| Abstract | The aim of this paper is to revisit an old theory of texture perception and
update its computational implementation by extending it to colour. With this in mind we try to capture the optimality of perceptual systems. This is achieved in the proposed approach by sharing well-known early stages of the visual processes and extracting low-dimensional features that perfectly encode adequate properties for a large variety of textures without needing further learning stages. We propose several descriptors in a bag-of-words framework that are derived from different quantisation models on to the feature spaces. Our perceptual features are directly given by the shape and colour attributes of image blobs, which are the textons. In this way we avoid learning visual words and directly build the vocabularies on these lowdimensionaltexton spaces. Main differences between proposed descriptors rely on how co-occurrence of blob attributes is represented in the vocabularies. Our approach overcomes current state-of-art in colour texture description which is proved in several experiments on large texture datasets. |
||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN |
0031-3203 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | CIC | Approved | no | ||
| Call Number | Admin @ si @ AlV2012a | Serial | 2130 | ||
| Permanent link to this record | |||||
| Author | Partha Pratim Roy; Umapada Pal; Josep Llados; Mathieu Nicolas Delalandre | ||||
| Title | Multi-oriented touching text character segmentation in graphical documents using dynamic programming | Type | Journal Article | ||
| Year | 2012 | Publication | Pattern Recognition | Abbreviated Journal | PR |
| Volume | 45 | Issue | 5 | Pages | 1972-1983 |
| Keywords | |||||
| Abstract | 2,292 JCR
The touching character segmentation problem becomes complex when touching strings are multi-oriented. Moreover in graphical documents sometimes characters in a single-touching string have different orientations. Segmentation of such complex touching is more challenging. In this paper, we present a scheme towards the segmentation of English multi-oriented touching strings into individual characters. When two or more characters touch, they generate a big cavity region in the background portion. Based on the convex hull information, at first, we use this background information to find some initial points for segmentation of a touching string into possible primitives (a primitive consists of a single character or part of a character). Next, the primitives are merged to get optimum segmentation. A dynamic programming algorithm is applied for this purpose using the total likelihood of characters as the objective function. A SVM classifier is used to find the likelihood of a character. To consider multi-oriented touching strings the features used in the SVM are invariant to character orientation. Experiments were performed in different databases of real and synthetic touching characters and the results show that the method is efficient in segmenting touching characters of arbitrary orientations and sizes. |
||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN |
0031-3203 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | DAG | Approved | no | ||
| Call Number | Admin @ si @ RPL2012a | Serial | 2133 | ||
| Permanent link to this record | |||||
| Author | Marina Alberti; Simone Balocco; Carlo Gatta; Francesco Ciompi; Oriol Pujol; Joana Silva; Xavier Carrillo; Petia Radeva | ||||
| Title | Automatic Bifurcation Detection in Coronary IVUS Sequences | Type | Journal Article | ||
| Year | 2012 | Publication | IEEE Transactions on Biomedical Engineering | Abbreviated Journal | TBME |
| Volume | 59 | Issue | 4 | Pages | 1022-2031 |
| Keywords | |||||
| Abstract | In this paper, we present a fully automatic method which identifies every bifurcation in an intravascular ultrasound (IVUS) sequence, the corresponding frames, the angular orientation with respect to the IVUS acquisition, and the extension. This goal is reached using a two-level classification scheme: first, a classifier is applied to a set of textural features extracted from each image of a sequence. A comparison among three state-of-the-art discriminative classifiers (AdaBoost, random forest, and support vector machine) is performed to identify the most suitable method for the branching detection task. Second, the results are improved by exploiting contextual information using a multiscale stacked sequential learning scheme. The results are then successively refined using a-priori information about branching dimensions and geometry. The proposed approach provides a robust tool for the quick review of pullback sequences, facilitating the evaluation of the lesion at bifurcation sites. The proposed method reaches an F-Measure score of 86.35%, while the F-Measure scores for inter- and intraobserver variability are 71.63% and 76.18%, respectively. The obtained results are positive. Especially, considering the branching detection task is very challenging, due to high variability in bifurcation dimensions and appearance. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN |
0018-9294 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | MILAB;HuPBA | Approved | no | ||
| Call Number | Admin @ si @ ABG2012 | Serial | 1996 | ||
| Permanent link to this record | |||||
| Author | Jose Manuel Alvarez; Felipe Lumbreras; Antonio Lopez; Theo Gevers | ||||
| Title | Understanding Road Scenes using Visual Cues | Type | Miscellaneous | ||
| Year | 2012 | Publication | European Conference on Computer Vision | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | DEMO | ||||
| Address | Florence; Italy | ||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN |
ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | ISE | Approved | no | ||
| Call Number | Admin @ si @ ALL2012 | Serial | 2795 | ||
| Permanent link to this record | |||||
| Author | Muhammad Muzzamil Luqman; Thierry Brouard; Jean-Yves Ramel; Josep Llados | ||||
| Title | Recherche de sous-graphes par encapsulation floue des cliques d'ordre 2: Application à la localisation de contenu dans les images de documents graphiques | Type | Conference Article | ||
| Year | 2012 | Publication | Colloque International Francophone sur l'Écrit et le Document | Abbreviated Journal | |
| Volume | Issue | Pages | 149-162 | ||
| Keywords | |||||
| Abstract | |||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN |
ISBN | Medium | |||
| Area | Expedition | Conference | CIFED | ||
| Notes | DAG | Approved | no | ||
| Call Number | Admin @ si @ LBR2012 | Serial | 2382 | ||
| Permanent link to this record | |||||
| Author | R. de Nijs; Sebastian Ramos; Gemma Roig; Xavier Boix; Luc Van Gool; K. Kühnlenz. | ||||
| Title | On-line Semantic Perception Using Uncertainty | Type | Conference Article | ||
| Year | 2012 | Publication | International Conference on Intelligent Robots and Systems | Abbreviated Journal | IROS |
| Volume | Issue | Pages | 4185-4191 | ||
| Keywords | Semantic Segmentation | ||||
| Abstract | Visual perception capabilities are still highly unreliable in unconstrained settings, and solutions might not beaccurate in all regions of an image. Awareness of the uncertainty of perception is a fundamental requirement for proper high level decision making in a robotic system. Yet, the uncertainty measure is often sacrificed to account for dependencies between object/region classifiers. This is the case of Conditional Random Fields (CRFs), the success of which stems from their ability to infer the most likely world configuration, but they do not directly allow to estimate the uncertainty of the solution. In this paper, we consider the setting of assigning semantic labels to the pixels of an image sequence. Instead of using a CRF, we employ a Perturb-and-MAP Random Field, a recently introduced probabilistic model that allows performing fast approximate sampling from its probability density function. This allows to effectively compute the uncertainty of the solution, indicating the reliability of the most likely labeling in each region of the image. We report results on the CamVid dataset, a standard benchmark for semantic labeling of urban image sequences. In our experiments, we show the benefits of exploiting the uncertainty by putting more computational effort on the regions of the image that are less reliable, and use more efficient techniques for other regions, showing little decrease of performance | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Place of Publication | Editor | |||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN |
ISBN | Medium | |||
| Area | Expedition | Conference | IROS | ||
| Notes | ADAS | Approved | no | ||
| Call Number | ADAS @ adas @ NRR2012 | Serial | 2378 | ||
| Permanent link to this record | |||||