| Home | [181–190] << 191 192 193 194 195 196 197 198 199 200 >> [201–210] |
|
| Records | |||||
|---|---|---|---|---|---|
| Author | Lluis Gomez; Anguelos Nicolaou; Dimosthenis Karatzas | ||||
| Title | Improving patch‐based scene text script identification with ensembles of conjoined networks | Type | Journal Article | ||
| Year | 2017 | Publication | Pattern Recognition | Abbreviated Journal | PR |
| Volume | 67 | Issue | Pages | 85-96 | |
| 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  |
|||
| Notes | DAG; 600.084; 600.121; 600.129 | Approved | no | ||
| Call Number | Admin @ si @ GNK2017 | Serial | 2887 | ||
| Permanent link to this record | |||||
| Author | Marc Sunset Perez; Marc Comino Trinidad; Dimosthenis Karatzas; Antonio Chica Calaf; Pere Pau Vazquez Alcocer | ||||
| Title | Development of general‐purpose projection‐based augmented reality systems | Type | Journal | ||
| Year | 2016 | Publication | IADIs international journal on computer science and information systems | Abbreviated Journal | IADIs |
| Volume | 11 | Issue | 2 | Pages | 1-18 |
| Keywords | |||||
| Abstract | Despite the large amount of methods and applications of augmented reality, there is little homogenizatio n on the software platforms that support them. An exception may be the low level control software that is provided by some high profile vendors such as Qualcomm and Metaio. However, these provide fine grain modules for e.g. element tracking. We are more co ncerned on the application framework, that includes the control of the devices working together for the development of the AR experience. In this paper we describe the development of a software framework for AR setups. We concentrate on the modular design of the framework, but also on some hard problems such as the calibration stage, crucial for projection – based AR. The developed framework is suitable and has been tested in AR applications using camera – projector pairs, for both fixed and nomadic setups | ||||
| 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 |
|||
| Notes | DAG; 600.084 | Approved | no | ||
| Call Number | Admin @ si @ SCK2016 | Serial | 2890 | ||
| Permanent link to this record | |||||
| Author | Lluis Gomez | ||||
| Title | Exploiting Similarity Hierarchies for Multi-script Scene Text Understanding | Type | Book Whole | ||
| Year | 2016 | Publication | PhD Thesis, Universitat Autonoma de Barcelona-CVC | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | This thesis addresses the problem of automatic scene text understanding in unconstrained conditions. In particular, we tackle the tasks of multi-language and arbitrary-oriented text detection, tracking, and script identification in natural scenes.
For this we have developed a set of generic methods that build on top of the basic observation that text has always certain key visual and structural characteristics that are independent of the language or script in which it is written. Text instances in any language or script are always formed as groups of similar atomic parts, being them either individual characters, small stroke parts, or even whole words in the case of cursive text. This holistic (sumof-parts) and recursive perspective has lead us to explore different variants of the “segmentation and grouping” paradigm of computer vision. Scene text detection methodologies are usually based in classification of individual regions or patches, using a priory knowledge for a given script or language. Human perception of text, on the other hand, is based on perceptual organization through which text emerges as a perceptually significant group of atomic objects. In this thesis, we argue that the text detection problem must be posed as the detection of meaningful groups of regions. We address the problem of text detection in natural scenes from a hierarchical perspective, making explicit use of the recursive nature of text, aiming directly to the detection of region groupings corresponding to text within a hierarchy produced by an agglomerative similarity clustering process over individual regions. We propose an optimal way to construct such an hierarchy introducing a feature space designed to produce text group hypothese with high recall and a novel stopping rule combining a discriminative classifier and a probabilistic measure of group meaningfulness based in perceptual organization. Within this generic framework, we design a text-specific object proposals algorithm that, contrary to existing generic object proposals methods, aims directly to the detection of text regions groupings. For this, we abandon the rigid definition of “what is text” of traditional specialized text detectors, and move towards more fuzzy perspective of grouping-based object proposals methods. Then, we present a hybrid algorithm for detection and tracking of scene text where the notion of region groupings plays also a central role. By leveraging the structural arrangement of text group components between consecutive frames we can improve the overall tracking performance of the system. Finally, since our generic detection framework is inherently designed for multi-language environments, we focus on the problem of script identification in order to build a multi-language end-toend reading system. Facing this problem with state of the art CNN classifiers is not straightforward, as they fail to address a key characteristic of scene text instances: their extremely variable aspect ratio. Instead of resizing input images to a fixed size as in the typical use of holistic CNN classifiers, we propose a patch-based classification framework in order to preserve discriminative parts of the image that are characteristic of its class. We describe a novel method based on the use of ensembles of conjoined networks to jointly learn discriminative stroke-parts representations and their relative importance in a patch-based classification scheme. |
||||
| Address | |||||
| Corporate Author | Thesis | Ph.D. thesis | |||
| Publisher | Place of Publication | Editor | Dimosthenis Karatzas | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference |
|||
| Notes | DAG | Approved | no | ||
| Call Number | Admin @ si @ Gom2016 | Serial | 2891 | ||
| Permanent link to this record | |||||
| Author | Ivet Rafegas; Javier Vazquez; Robert Benavente; Maria Vanrell; Susana Alvarez | ||||
| Title | Enhancing spatio-chromatic representation with more-than-three color coding for image description | Type | Journal Article | ||
| Year | 2017 | Publication | Journal of the Optical Society of America A | Abbreviated Journal | JOSA A |
| Volume | 34 | Issue | 5 | Pages | 827-837 |
| Keywords | |||||
| Abstract | Extraction of spatio-chromatic features from color images is usually performed independently on each color channel. Usual 3D color spaces, such as RGB, present a high inter-channel correlation for natural images. This correlation can be reduced using color-opponent representations, but the spatial structure of regions with small color differences is not fully captured in two generic Red-Green and Blue-Yellow channels. To overcome these problems, we propose a new color coding that is adapted to the specific content of each image. Our proposal is based on two steps: (a) setting the number of channels to the number of distinctive colors we find in each image (avoiding the problem of channel correlation), and (b) building a channel representation that maximizes contrast differences within each color channel (avoiding the problem of low local contrast). We call this approach more-than-three color coding (MTT) to enhance the fact that the number of channels is adapted to the image content. The higher color complexity an image has, the more channels can be used to represent it. Here we select distinctive colors as the most predominant in the image, which we call color pivots, and we build the new color coding using these color pivots as a basis. To evaluate the proposed approach we measure its efficiency in an image categorization task. We show how a generic descriptor improves its performance at the description level when applied on the MTT coding. | ||||
| 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 |
|||
| Notes | CIC; 600.087 | Approved | no | ||
| Call Number | Admin @ si @ RVB2017 | Serial | 2892 | ||
| Permanent link to this record | |||||
| Author | Jordi Roca | ||||
| Title | Constancy and inconstancy in categorical colour perception | Type | Book Whole | ||
| Year | 2012 | Publication | PhD Thesis, Universitat Autonoma de Barcelona-CVC | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | To recognise objects is perhaps the most important task an autonomous system, either biological or artificial needs to perform. In the context of human vision, this is partly achieved by recognizing the colour of surfaces despite changes in the wavelength distribution of the illumination, a property called colour constancy. Correct surface colour recognition may be adequately accomplished by colour category matching without the need to match colours precisely, therefore categorical colour constancy is likely to play an important role for object identification to be successful. The main aim of this work is to study the relationship between colour constancy and categorical colour perception. Previous studies of colour constancy have shown the influence of factors such the spatio-chromatic properties of the background, individual observer's performance, semantics, etc. However there is very little systematic study of these influences. To this end, we developed a new approach to colour constancy which includes both individual observers' categorical perception, the categorical structure of the background, and their interrelations resulting in a more comprehensive characterization of the phenomenon. In our study, we first developed a new method to analyse the categorical structure of 3D colour space, which allowed us to characterize individual categorical colour perception as well as quantify inter-individual variations in terms of shape and centroid location of 3D categorical regions. Second, we developed a new colour constancy paradigm, termed chromatic setting, which allows measuring the precise location of nine categorically-relevant points in colour space under immersive illumination. Additionally, we derived from these measurements a new colour constancy index which takes into account the magnitude and orientation of the chromatic shift, memory effects and the interrelations among colours and a model of colour naming tuned to each observer/adaptation state. Our results lead to the following conclusions: (1) There exists large inter-individual variations in the categorical structure of colour space, and thus colour naming ability varies significantly but this is not well predicted by low-level chromatic discrimination ability; (2) Analysis of the average colour naming space suggested the need for an additional three basic colour terms (turquoise, lilac and lime) for optimal colour communication; (3) Chromatic setting improved the precision of more complex linear colour constancy models and suggested that mechanisms other than cone gain might be best suited to explain colour constancy; (4) The categorical structure of colour space is broadly stable under illuminant changes for categorically balanced backgrounds; (5) Categorical inconstancy exists for categorically unbalanced backgrounds thus indicating that categorical information perceived in the initial stages of adaptation may constrain further categorical perception. | ||||
| Address | |||||
| Corporate Author | Thesis | Ph.D. thesis | |||
| Publisher | Place of Publication | Editor | Maria Vanrell;C. Alejandro Parraga | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference |
|||
| Notes | CIC | Approved | no | ||
| Call Number | Admin @ si @ Roc2012 | Serial | 2893 | ||
| Permanent link to this record | |||||
| Author | Marçal Rusiñol; Josep Llados | ||||
| Title | Flowchart Recognition in Patent Information Retrieval | Type | Book Chapter | ||
| Year | 2017 | Publication | Current Challenges in Patent Information Retrieval | Abbreviated Journal | |
| Volume | 37 | Issue | Pages | 351-368 | |
| Keywords | |||||
| Abstract | |||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Springer Berlin Heidelberg | Place of Publication | Editor | M. Lupu; K. Mayer; N. Kando; A.J. Trippe | |
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference |
|||
| Notes | DAG; 600.097; 600.121 | Approved | no | ||
| Call Number | Admin @ si @ RuL2017 | Serial | 2896 | ||
| Permanent link to this record | |||||
| Author | Alicia Fornes; Josep Llados; Oriol Ramos Terrades; Marçal Rusiñol | ||||
| Title | La Visió per Computador com a Eina per a la Interpretació Automàtica de Fonts Documentals | Type | Journal | ||
| Year | 2016 | Publication | Lligall, Revista Catalana d'Arxivística | Abbreviated Journal | |
| Volume | 39 | Issue | Pages | 20-46 | |
| 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 |
|||
| Notes | DAG; 600.097 | Approved | no | ||
| Call Number | Admin @ si @ FLR2016 | Serial | 2897 | ||
| Permanent link to this record | |||||
| Author | Joana Maria Pujadas-Mora; Alicia Fornes; Josep Llados; Anna Cabre | ||||
| Title | Bridging the gap between historical demography and computing: tools for computer-assisted transcription and the analysis of demographic sources | Type | Book Chapter | ||
| Year | 2016 | Publication | The future of historical demography. Upside down and inside out | Abbreviated Journal | |
| Volume | Issue | Pages | 127-131 | ||
| Keywords | |||||
| Abstract | |||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher | Acco Publishers | Place of Publication | Editor | K.Matthijs; S.Hin; H.Matsuo; J.Kok | |
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | 978-94-6292-722-3 | Medium | ||
| Area | Expedition | Conference |
|||
| Notes | DAG; 600.097 | Approved | no | ||
| Call Number | Admin @ si @ PFL2016 | Serial | 2907 | ||
| Permanent link to this record | |||||
| Author | Miguel Oliveira; Victor Santos; Angel Sappa; P. Dias; A. Moreira | ||||
| Title | Incremental texture mapping for autonomous driving | Type | Journal Article | ||
| Year | 2016 | Publication | Robotics and Autonomous Systems | Abbreviated Journal | RAS |
| Volume | 84 | Issue | Pages | 113-128 | |
| Keywords | Scene reconstruction; Autonomous driving; Texture mapping | ||||
| Abstract | Autonomous vehicles have a large number of on-board sensors, not only for providing coverage all around the vehicle, but also to ensure multi-modality in the observation of the scene. Because of this, it is not trivial to come up with a single, unique representation that feeds from the data given by all these sensors. We propose an algorithm which is capable of mapping texture collected from vision based sensors onto a geometric description of the scenario constructed from data provided by 3D sensors. The algorithm uses a constrained Delaunay triangulation to produce a mesh which is updated using a specially devised sequence of operations. These enforce a partial configuration of the mesh that avoids bad quality textures and ensures that there are no gaps in the texture. Results show that this algorithm is capable of producing fine quality textures. | ||||
| 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 |
|||
| Notes | ADAS; 600.086 | Approved | no | ||
| Call Number | Admin @ si @ OSS2016b | Serial | 2912 | ||
| Permanent link to this record | |||||
| Author | Cristhian A. Aguilera-Carrasco; Angel Sappa; Cristhian Aguilera; Ricardo Toledo | ||||
| Title | Cross-Spectral Local Descriptors via Quadruplet Network | Type | Journal Article | ||
| Year | 2017 | Publication | Sensors | Abbreviated Journal | SENS |
| Volume | 17 | Issue | 4 | Pages | 873 |
| Keywords | |||||
| Abstract | This paper presents a novel CNN-based architecture, referred to as Q-Net, to learn local feature descriptors that are useful for matching image patches from two different spectral bands. Given correctly matched and non-matching cross-spectral image pairs, a quadruplet network is trained to map input image patches to a common Euclidean space, regardless of the input spectral band. Our approach is inspired by the recent success of triplet networks in the visible spectrum, but adapted for cross-spectral scenarios, where, for each matching pair, there are always two possible non-matching patches: one for each spectrum. Experimental evaluations on a public cross-spectral VIS-NIR dataset shows that the proposed approach improves the state-of-the-art. Moreover, the proposed technique can also be used in mono-spectral settings, obtaining a similar performance to triplet network descriptors, but requiring less training data. | ||||
| 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 |
|||
| Notes | ADAS; 600.086; 600.118 | Approved | no | ||
| Call Number | Admin @ si @ ASA2017 | Serial | 2914 | ||
| Permanent link to this record | |||||
| Author | Mikhail Mozerov; Joost Van de Weijer | ||||
| Title | Improved Recursive Geodesic Distance Computation for Edge Preserving Filter | Type | Journal Article | ||
| Year | 2017 | Publication | IEEE Transactions on Image Processing | Abbreviated Journal | TIP |
| Volume | 26 | Issue | 8 | Pages | 3696 - 3706 |
| Keywords | Geodesic distance filter; color image filtering; image enhancement | ||||
| Abstract | All known recursive filters based on the geodesic distance affinity are realized by two 1D recursions applied in two orthogonal directions of the image plane. The 2D extension of the filter is not valid and has theoretically drawbacks, which lead to known artifacts. In this paper, a maximum influence propagation method is proposed to approximate the 2D extension for the
geodesic distance-based recursive filter. The method allows to partially overcome the drawbacks of the 1D recursion approach. We show that our improved recursion better approximates the true geodesic distance filter, and the application of this improved filter for image denoising outperforms the existing recursive implementation of the geodesic distance. As an application, we consider a geodesic distance-based filter for image denoising. Experimental evaluation of our denoising method demonstrates comparable and for several test images better results, than stateof-the-art approaches, while our algorithm is considerably fasterwith computational complexity O(8P). |
||||
| 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 |
|||
| Notes | LAMP; ISE; 600.120; 600.098; 600.119 | Approved | no | ||
| Call Number | Admin @ si @ Moz2017 | Serial | 2921 | ||
| Permanent link to this record | |||||
| Author | Pau Rodriguez; Guillem Cucurull; Jordi Gonzalez; Josep M. Gonfaus; Kamal Nasrollahi; Thomas B. Moeslund; Xavier Roca | ||||
| Title | Deep Pain: Exploiting Long Short-Term Memory Networks for Facial Expression Classification | Type | Journal Article | ||
| Year | 2017 | Publication | IEEE Transactions on cybernetics | Abbreviated Journal | Cyber |
| Volume | Issue | Pages | 1-11 | ||
| Keywords | |||||
| Abstract | Pain is an unpleasant feeling that has been shown to be an important factor for the recovery of patients. Since this is costly in human resources and difficult to do objectively, there is the need for automatic systems to measure it. In this paper, contrary to current state-of-the-art techniques in pain assessment, which are based on facial features only, we suggest that the performance can be enhanced by feeding the raw frames to deep learning models, outperforming the latest state-of-the-art results while also directly facing the problem of imbalanced data. As a baseline, our approach first uses convolutional neural networks (CNNs) to learn facial features from VGG_Faces, which are then linked to a long short-term memory to exploit the temporal relation between video frames. We further compare the performances of using the so popular schema based on the canonically normalized appearance versus taking into account the whole image. As a result, we outperform current state-of-the-art area under the curve performance in the UNBC-McMaster Shoulder Pain Expression Archive Database. In addition, to evaluate the generalization properties of our proposed methodology on facial motion recognition, we also report competitive results in the Cohn Kanade+ facial expression database. | ||||
| 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 |
|||
| Notes | ISE; 600.119; 600.098 | Approved | no | ||
| Call Number | Admin @ si @ RCG2017a | Serial | 2926 | ||
| Permanent link to this record | |||||
| Author | Anjan Dutta; Josep Llados; Horst Bunke; Umapada Pal | ||||
| Title | Product graph-based higher order contextual similarities for inexact subgraph matching | Type | Journal Article | ||
| Year | 2018 | Publication | Pattern Recognition | Abbreviated Journal | PR |
| Volume | 76 | Issue | Pages | 596-611 | |
| Keywords | |||||
| Abstract | Many algorithms formulate graph matching as an optimization of an objective function of pairwise quantification of nodes and edges of two graphs to be matched. Pairwise measurements usually consider local attributes but disregard contextual information involved in graph structures. We address this issue by proposing contextual similarities between pairs of nodes. This is done by considering the tensor product graph (TPG) of two graphs to be matched, where each node is an ordered pair of nodes of the operand graphs. Contextual similarities between a pair of nodes are computed by accumulating weighted walks (normalized pairwise similarities) terminating at the corresponding paired node in TPG. Once the contextual similarities are obtained, we formulate subgraph matching as a node and edge selection problem in TPG. We use contextual similarities to construct an objective function and optimize it with a linear programming approach. Since random walk formulation through TPG takes into account higher order information, it is not a surprise that we obtain more reliable similarities and better discrimination among the nodes and edges. Experimental results shown on synthetic as well as real benchmarks illustrate that higher order contextual similarities increase discriminating power and allow one to find approximate solutions to the subgraph matching problem. | ||||
| 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 |
|||
| Notes | DAG; 602.167; 600.097; 600.121 | Approved | no | ||
| Call Number | Admin @ si @ DLB2018 | Serial | 3083 | ||
| Permanent link to this record | |||||
| Author | Karim Lekadir; Alfiia Galimzianova; Angels Betriu; Maria del Mar Vila; Laura Igual; Daniel L. Rubin; Elvira Fernandez-Giraldez; Petia Radeva; Sandy Napel | ||||
| Title | A Convolutional Neural Network for Automatic Characterization of Plaque Composition in Carotid Ultrasound | Type | Journal Article | ||
| Year | 2017 | Publication | IEEE Journal Biomedical and Health Informatics | Abbreviated Journal | J-BHI |
| Volume | 21 | Issue | 1 | Pages | 48-55 |
| Keywords | |||||
| Abstract | Characterization of carotid plaque composition, more specifically the amount of lipid core, fibrous tissue, and calcified tissue, is an important task for the identification of plaques that are prone to rupture, and thus for early risk estimation of cardiovascular and cerebrovascular events. Due to its low costs and wide availability, carotid ultrasound has the potential to become the modality of choice for plaque characterization in clinical practice. However, its significant image noise, coupled with the small size of the plaques and their complex appearance, makes it difficult for automated techniques to discriminate between the different plaque constituents. In this paper, we propose to address this challenging problem by exploiting the unique capabilities of the emerging deep learning framework. More specifically, and unlike existing works which require a priori definition of specific imaging features or thresholding values, we propose to build a convolutional neural network (CNN) that will automatically extract from the images the information that is optimal for the identification of the different plaque constituents. We used approximately 90 000 patches extracted from a database of images and corresponding expert plaque characterizations to train and to validate the proposed CNN. The results of cross-validation experiments show a correlation of about 0.90 with the clinical assessment for the estimation of lipid core, fibrous cap, and calcified tissue areas, indicating the potential of deep learning for the challenging task of automatic characterization of plaque composition in carotid ultrasound. | ||||
| 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 |
|||
| Notes | MILAB; no menciona | Approved | no | ||
| Call Number | Admin @ si @ LGB2017 | Serial | 2931 | ||
| Permanent link to this record | |||||
| Author | Umut Guclu; Yagmur Gucluturk; Meysam Madadi; Sergio Escalera; Xavier Baro; Jordi Gonzalez; Rob van Lier; Marcel A. J. van Gerven | ||||
| Title | End-to-end semantic face segmentation with conditional random fields as convolutional, recurrent and adversarial networks | Type | Miscellaneous | ||
| Year | 2017 | Publication | Arxiv | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | arXiv:1703.03305
Recent years have seen a sharp increase in the number of related yet distinct advances in semantic segmentation. Here, we tackle this problem by leveraging the respective strengths of these advances. That is, we formulate a conditional random field over a four-connected graph as end-to-end trainable convolutional and recurrent networks, and estimate them via an adversarial process. Importantly, our model learns not only unary potentials but also pairwise potentials, while aggregating multi-scale contexts and controlling higher-order inconsistencies. We evaluate our model on two standard benchmark datasets for semantic face segmentation, achieving state-of-the-art results on both of them. |
||||
| 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 |
|||
| Notes | HuPBA; ISE; 600.098; 600.119 | Approved | no | ||
| Call Number | Admin @ si @ GGM2017 | Serial | 2932 | ||
| Permanent link to this record | |||||