| Home | << 1 2 3 4 5 6 7 8 9 10 >> [11–11] |
|
| Records | |||||
|---|---|---|---|---|---|
| Author | Miguel Angel Bautista; Oriol Pujol; Fernando De la Torre; Sergio Escalera | ||||
| Title | Error-Correcting Factorization | Type | Journal Article | ||
| Year | 2018 | Publication | IEEE Transactions on Pattern Analysis and Machine Intelligence | Abbreviated Journal | TPAMI |
| Volume | 40 | Issue | Pages  |
2388-2401 | |
| Keywords | |||||
| Abstract | Error Correcting Output Codes (ECOC) is a successful technique in multi-class classification, which is a core problem in Pattern Recognition and Machine Learning. A major advantage of ECOC over other methods is that the multi- class problem is decoupled into a set of binary problems that are solved independently. However, literature defines a general error-correcting capability for ECOCs without analyzing how it distributes among classes, hindering a deeper analysis of pair-wise error-correction. To address these limitations this paper proposes an Error-Correcting Factorization (ECF) method, our contribution is three fold: (I) We propose a novel representation of the error-correction capability, called the design matrix, that enables us to build an ECOC on the basis of allocating correction to pairs of classes. (II) We derive the optimal code length of an ECOC using rank properties of the design matrix. (III) ECF is formulated as a discrete optimization problem, and a relaxed solution is found using an efficient constrained block coordinate descent approach. (IV) Enabled by the flexibility introduced with the design matrix we propose to allocate the error-correction on classes that are prone to confusion. Experimental results in several databases show that when allocating the error-correction to confusable classes ECF outperforms state-of-the-art approaches. | ||||
| 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 | Medium | ||
| Area | Expedition | Conference | |||
| Notes | HuPBA; no menciona | Approved | no | ||
| Call Number | Admin @ si @ BPT2018 | Serial | 3015 | ||
| Permanent link to this record | |||||
| Author | Albert Clapes; Ozan Bilici; Dariia Temirova; Egils Avots; Gholamreza Anbarjafari; Sergio Escalera | ||||
| Title | From apparent to real age: gender, age, ethnic, makeup, and expression bias analysis in real age estimation | Type | Conference Article | ||
| Year | 2018 | Publication | IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops | Abbreviated Journal | |
| Volume | Issue | Pages |
2373-2382 | ||
| Keywords | |||||
| Abstract | |||||
| Address | Salt Lake City; USA; June 2018 | ||||
| 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 | CVPRW | ||
| Notes | HUPBA | Approved | no | ||
| Call Number | Admin @ si @ | Serial | 3116 | ||
| Permanent link to this record | |||||
| Author | Xialei Liu; Marc Masana; Luis Herranz; Joost Van de Weijer; Antonio Lopez; Andrew Bagdanov | ||||
| Title | Rotate your Networks: Better Weight Consolidation and Less Catastrophic Forgetting | Type | Conference Article | ||
| Year | 2018 | Publication | 24th International Conference on Pattern Recognition | Abbreviated Journal | |
| Volume | Issue | Pages |
2262-2268 | ||
| Keywords | |||||
| Abstract | In this paper we propose an approach to avoiding catastrophic forgetting in sequential task learning scenarios. Our technique is based on a network reparameterization that approximately diagonalizes the Fisher Information Matrix of the network parameters. This reparameterization takes the form of
a factorized rotation of parameter space which, when used in conjunction with Elastic Weight Consolidation (which assumes a diagonal Fisher Information Matrix), leads to significantly better performance on lifelong learning of sequential tasks. Experimental results on the MNIST, CIFAR-100, CUB-200 and Stanford-40 datasets demonstrate that we significantly improve the results of standard elastic weight consolidation, and that we obtain competitive results when compared to the state-of-the-art in lifelong learning without forgetting. |
||||
| 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 | ICPR | ||
| Notes | LAMP; ADAS; 601.305; 601.109; 600.124; 600.106; 602.200; 600.120; 600.118 | Approved | no | ||
| Call Number | Admin @ si @ LMH2018 | Serial | 3160 | ||
| Permanent link to this record | |||||
| Author | Pau Riba; Andreas Fischer; Josep Llados; Alicia Fornes | ||||
| Title | Learning Graph Distances with Message Passing Neural Networks | Type | Conference Article | ||
| Year | 2018 | Publication | 24th International Conference on Pattern Recognition | Abbreviated Journal | |
| Volume | Issue | Pages |
2239-2244 | ||
| Keywords | ★Best Paper Award★ | ||||
| Abstract | Graph representations have been widely used in pattern recognition thanks to their powerful representation formalism and rich theoretical background. A number of error-tolerant graph matching algorithms such as graph edit distance have been proposed for computing a distance between two labelled graphs. However, they typically suffer from a high
computational complexity, which makes it difficult to apply these matching algorithms in a real scenario. In this paper, we propose an efficient graph distance based on the emerging field of geometric deep learning. Our method employs a message passing neural network to capture the graph structure and learns a metric with a siamese network approach. The performance of the proposed graph distance is validated in two application cases, graph classification and graph retrieval of handwritten words, and shows a promising performance when compared with (approximate) graph edit distance benchmarks. |
||||
| Address | Beijing; China; August 2018 | ||||
| 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 | ICPR | ||
| Notes | DAG; 600.097; 603.057; 601.302; 600.121 | Approved | no | ||
| Call Number | Admin @ si @ RFL2018 | Serial | 3168 | ||
| Permanent link to this record | |||||
| Author | Patricia Suarez; Angel Sappa; Boris X. Vintimilla; Riad I. Hammoud | ||||
| Title | Near InfraRed Imagery Colorization | Type | Conference Article | ||
| Year | 2018 | Publication | 25th International Conference on Image Processing | Abbreviated Journal | |
| Volume | Issue | Pages |
2237 - 2241 | ||
| Keywords | Convolutional Neural Networks (CNN), Generative Adversarial Network (GAN), Infrared Imagery colorization | ||||
| Abstract | This paper proposes a stacked conditional Generative Adversarial Network-based method for Near InfraRed (NIR) imagery colorization. We propose a variant architecture of Generative Adversarial Network (GAN) that uses multiple
loss functions over a conditional probabilistic generative model. We show that this new architecture/loss-function yields better generalization and representation of the generated colored IR images. The proposed approach is evaluated on a large test dataset and compared to recent state of the art methods using standard metrics. |
||||
| Address | Athens; Greece; October 2018 | ||||
| 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 | ICIP | ||
| Notes | MSIAU; 600.086; 600.130; 600.122 | Approved | no | ||
| Call Number | Admin @ si @ SSV2018b | Serial | 3195 | ||
| Permanent link to this record | |||||
| Author | Akhil Gurram; Onay Urfalioglu; Ibrahim Halfaoui; Fahd Bouzaraa; Antonio Lopez | ||||
| Title | Monocular Depth Estimation by Learning from Heterogeneous Datasets | Type | Conference Article | ||
| Year | 2018 | Publication | IEEE Intelligent Vehicles Symposium | Abbreviated Journal | |
| Volume | Issue | Pages |
2176 - 2181 | ||
| Keywords | |||||
| Abstract | Depth estimation provides essential information to perform autonomous driving and driver assistance. Especially, Monocular Depth Estimation is interesting from a practical point of view, since using a single camera is cheaper than many other options and avoids the need for continuous calibration strategies as required by stereo-vision approaches. State-of-the-art methods for Monocular Depth Estimation are based on Convolutional Neural Networks (CNNs). A promising line of work consists of introducing additional semantic information about the traffic scene when training CNNs for depth estimation. In practice, this means that the depth data used for CNN training is complemented with images having pixel-wise semantic labels, which usually are difficult to annotate (eg crowded urban images). Moreover, so far it is common practice to assume that the same raw training data is associated with both types of ground truth, ie, depth and semantic labels. The main contribution of this paper is to show that this hard constraint can be circumvented, ie, that we can train CNNs for depth estimation by leveraging the depth and semantic information coming from heterogeneous datasets. In order to illustrate the benefits of our approach, we combine KITTI depth and Cityscapes semantic segmentation datasets, outperforming state-of-the-art results on Monocular Depth Estimation. | ||||
| 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 | IV | ||
| Notes | ADAS; 600.124; 600.116; 600.118 | Approved | no | ||
| Call Number | Admin @ si @ GUH2018 | Serial | 3183 | ||
| Permanent link to this record | |||||
| Author | Arash Akbarinia; C. Alejandro Parraga | ||||
| Title | Colour Constancy Beyond the Classical Receptive Field | Type | Journal Article | ||
| Year | 2018 | Publication | IEEE Transactions on Pattern Analysis and Machine Intelligence | Abbreviated Journal | TPAMI |
| Volume | 40 | Issue | 9 | Pages |
2081 - 2094 |
| Keywords | |||||
| Abstract | The problem of removing illuminant variations to preserve the colours of objects (colour constancy) has already been solved by the human brain using mechanisms that rely largely on centre-surround computations of local contrast. In this paper we adopt some of these biological solutions described by long known physiological findings into a simple, fully automatic, functional model (termed Adaptive Surround Modulation or ASM). In ASM, the size of a visual neuron's receptive field (RF) as well as the relationship with its surround varies according to the local contrast within the stimulus, which in turn determines the nature of the centre-surround normalisation of cortical neurons higher up in the processing chain. We modelled colour constancy by means of two overlapping asymmetric Gaussian kernels whose sizes are adapted based on the contrast of the surround pixels, resembling the change of RF size. We simulated the contrast-dependent surround modulation by weighting the contribution of each Gaussian according to the centre-surround contrast. In the end, we obtained an estimation of the illuminant from the set of the most activated RFs' outputs. Our results on three single-illuminant and one multi-illuminant benchmark datasets show that ASM is highly competitive against the state-of-the-art and it even outperforms learning-based algorithms in one case. Moreover, the robustness of our model is more tangible if we consider that our results were obtained using the same parameters for all datasets, that is, mimicking how the human visual system operates. These results might provide an insight on how dynamical adaptation mechanisms contribute to make object's colours appear constant to us. | ||||
| 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 | NEUROBIT; 600.068; 600.072 | Approved | no | ||
| Call Number | Admin @ si @ AkP2018a | Serial | 2990 | ||
| Permanent link to this record | |||||
| Author | Xavier Soria; Angel Sappa; Riad I. Hammoud | ||||
| Title | Wide-Band Color Imagery Restoration for RGB-NIR Single Sensor Images | Type | Journal Article | ||
| Year | 2018 | Publication | Sensors | Abbreviated Journal | SENS |
| Volume | 18 | Issue | 7 | Pages |
2059 |
| Keywords | RGB-NIR sensor; multispectral imaging; deep learning; CNNs | ||||
| Abstract | Multi-spectral RGB-NIR sensors have become ubiquitous in recent years. These sensors allow the visible and near-infrared spectral bands of a given scene to be captured at the same time. With such cameras, the acquired imagery has a compromised RGB color representation due to near-infrared bands (700–1100 nm) cross-talking with the visible bands (400–700 nm).
This paper proposes two deep learning-based architectures to recover the full RGB color images, thus removing the NIR information from the visible bands. The proposed approaches directly restore the high-resolution RGB image by means of convolutional neural networks. They are evaluated with several outdoor images; both architectures reach a similar performance when evaluated in different scenarios and using different similarity metrics. Both of them improve the state of the art approaches. |
||||
| 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; MSIAU; 600.086; 600.130; 600.122; 600.118 | Approved | no | ||
| Call Number | Admin @ si @ SSH2018 | Serial | 3145 | ||
| Permanent link to this record | |||||
| Author | Gemma Rotger; Felipe Lumbreras; Francesc Moreno-Noguer; Antonio Agudo | ||||
| Title | 2D-to-3D Facial Expression Transfer | Type | Conference Article | ||
| Year | 2018 | Publication | 24th International Conference on Pattern Recognition | Abbreviated Journal | |
| Volume | Issue | Pages |
2008 - 2013 | ||
| Keywords | |||||
| Abstract | Automatically changing the expression and physical features of a face from an input image is a topic that has been traditionally tackled in a 2D domain. In this paper, we bring this problem to 3D and propose a framework that given an
input RGB video of a human face under a neutral expression, initially computes his/her 3D shape and then performs a transfer to a new and potentially non-observed expression. For this purpose, we parameterize the rest shape –obtained from standard factorization approaches over the input video– using a triangular mesh which is further clustered into larger macro-segments. The expression transfer problem is then posed as a direct mapping between this shape and a source shape, such as the blend shapes of an off-the-shelf 3D dataset of human facial expressions. The mapping is resolved to be geometrically consistent between 3D models by requiring points in specific regions to map on semantic equivalent regions. We validate the approach on several synthetic and real examples of input faces that largely differ from the source shapes, yielding very realistic expression transfers even in cases with topology changes, such as a synthetic video sequence of a single-eyed cyclops. |
||||
| 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 | ICPR | ||
| Notes | MSIAU; 600.086; 600.130; 600.118 | Approved | no | ||
| Call Number | Admin @ si @ RLM2018 | Serial | 3232 | ||
| Permanent link to this record | |||||
| Author | Ilke Demir; Dena Bazazian; Adriana Romero; Viktoriia Sharmanska; Lyne P. Tchapmi | ||||
| Title | WiCV 2018: The Fourth Women In Computer Vision Workshop | Type | Conference Article | ||
| Year | 2018 | Publication | 4th Women in Computer Vision Workshop | Abbreviated Journal | |
| Volume | Issue | Pages |
1941-19412 | ||
| Keywords | Conferences; Computer vision; Industries; Object recognition; Engineering profession; Collaboration; Machine learning | ||||
| Abstract | We present WiCV 2018 – Women in Computer Vision Workshop to increase the visibility and inclusion of women researchers in computer vision field, organized in conjunction with CVPR 2018. Computer vision and machine learning have made incredible progress over the past years, yet the number of female researchers is still low both in academia and industry. WiCV is organized to raise visibility of female researchers, to increase the collaboration,
and to provide mentorship and give opportunities to femaleidentifying junior researchers in the field. In its fourth year, we are proud to present the changes and improvements over the past years, summary of statistics for presenters and attendees, followed by expectations from future generations. |
||||
| Address | Salt Lake City; USA; June 2018 | ||||
| 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 | WiCV | ||
| Notes | DAG; 600.121; 600.129 | Approved | no | ||
| Call Number | Admin @ si @ DBR2018 | Serial | 3222 | ||
| Permanent link to this record | |||||
| Author | Dena Bazazian; Dimosthenis Karatzas; Andrew Bagdanov | ||||
| Title | Word Spotting in Scene Images based on Character Recognition | Type | Conference Article | ||
| Year | 2018 | Publication | IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops | Abbreviated Journal | |
| Volume | Issue | Pages |
1872-1874 | ||
| Keywords | |||||
| Abstract | In this paper we address the problem of unconstrained Word Spotting in scene images. We train a Fully Convolutional Network to produce heatmaps of all the character classes. Then, we employ the Text Proposals approach and, via a rectangle classifier, detect the most likely rectangle for each query word based on the character attribute maps. We evaluate the proposed method on ICDAR2015 and show that it is capable of identifying and recognizing query words in natural scene images. | ||||
| Address | Salt Lake City; USA; June 2018 | ||||
| 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 | CVPRW | ||
| Notes | DAG; 600.129; 600.121 | Approved | no | ||
| Call Number | BKB2018a | Serial | 3179 | ||
| Permanent link to this record | |||||
| Author | Arash Akbarinia; C. Alejandro Parraga | ||||
| Title | Feedback and Surround Modulated Boundary Detection | Type | Journal Article | ||
| Year | 2018 | Publication | International Journal of Computer Vision | Abbreviated Journal | IJCV |
| Volume | 126 | Issue | 12 | Pages |
1367–1380 |
| Keywords | Boundary detection; Surround modulation; Biologically-inspired vision | ||||
| Abstract | Edges are key components of any visual scene to the extent that we can recognise objects merely by their silhouettes. The human visual system captures edge information through neurons in the visual cortex that are sensitive to both intensity discontinuities and particular orientations. The “classical approach” assumes that these cells are only responsive to the stimulus present within their receptive fields, however, recent studies demonstrate that surrounding regions and inter-areal feedback connections influence their responses significantly. In this work we propose a biologically-inspired edge detection model in which orientation selective neurons are represented through the first derivative of a Gaussian function resembling double-opponent cells in the primary visual cortex (V1). In our model we account for four kinds of receptive field surround, i.e. full, far, iso- and orthogonal-orientation, whose contributions are contrast-dependant. The output signal from V1 is pooled in its perpendicular direction by larger V2 neurons employing a contrast-variant centre-surround kernel. We further introduce a feedback connection from higher-level visual areas to the lower ones. The results of our model on three benchmark datasets show a big improvement compared to the current non-learning and biologically-inspired state-of-the-art algorithms while being competitive to the learning-based methods. | ||||
| 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 | NEUROBIT; 600.068; 600.072 | Approved | no | ||
| Call Number | Admin @ si @ AkP2018b | Serial | 2991 | ||
| Permanent link to this record | |||||
| Author | F. Javier Sanchez; Jorge Bernal | ||||
| Title | Use of Software Tools for Real-time Monitoring of Learning Processes: Application to Compilers subject | Type | Conference Article | ||
| Year | 2018 | Publication | 4th International Conference of Higher Education Advances | Abbreviated Journal | |
| Volume | Issue | Pages |
1359-1366 | ||
| Keywords | Monitoring; Evaluation tool; Gamification; Student motivation | ||||
| Abstract | The effective implementation of the Higher European Education Area has meant a change regarding the focus of the learning process, being now the student at its very center. This shift of focus requires a strong involvement and fluent communication between teachers and students to succeed. Considering the difficulties associated to motivate students to take a more active role in the learning process, we explore how the use of a software tool can help both actors to improve the learning experience. We present a tool that can help students to obtain instantaneous feedback with respect to their progress in the subject as well as providing teachers with useful information about the evolution of knowledge acquisition with respect to each of the subject areas. We compare the performance achieved by students in two academic years: results show an improvement in overall performance which, after observing graphs provided by our tool, can be associated to an increase in students interest in the subject. | ||||
| Address | Valencia; June 2018 | ||||
| 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 | HEAD | ||
| Notes | MV; no proj | Approved | no | ||
| Call Number | Admin @ si @ SaB2018 | Serial | 3165 | ||
| Permanent link to this record | |||||
| Author | Zhijie Fang; Antonio Lopez | ||||
| Title | Is the Pedestrian going to Cross? Answering by 2D Pose Estimation | Type | Conference Article | ||
| Year | 2018 | Publication | IEEE Intelligent Vehicles Symposium | Abbreviated Journal | |
| Volume | Issue | Pages |
1271 - 1276 | ||
| Keywords | |||||
| Abstract | Our recent work suggests that, thanks to nowadays powerful CNNs, image-based 2D pose estimation is a promising cue for determining pedestrian intentions such as crossing the road in the path of the ego-vehicle, stopping before entering the road, and starting to walk or bending towards the road. This statement is based on the results obtained on non-naturalistic sequences (Daimler dataset), i.e. in sequences choreographed specifically for performing the study. Fortunately, a new publicly available dataset (JAAD) has appeared recently to allow developing methods for detecting pedestrian intentions in naturalistic driving conditions; more specifically, for addressing the relevant question is the pedestrian going to cross? Accordingly, in this paper we use JAAD to assess the usefulness of 2D pose estimation for answering such a question. We combine CNN-based pedestrian detection, tracking and pose estimation to predict the crossing action from monocular images. Overall, the proposed pipeline provides new state-ofthe-art results. | ||||
| 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 | IV | ||
| Notes | ADAS; 600.124; 600.116; 600.118 | Approved | no | ||
| Call Number | Admin @ si @ FaL2018 | Serial | 3181 | ||
| Permanent link to this record | |||||
| Author | Patricia Suarez; Angel Sappa; Boris X. Vintimilla; Riad I. Hammoud | ||||
| Title | Deep Learning based Single Image Dehazing | Type | Conference Article | ||
| Year | 2018 | Publication | 31st IEEE Conference on Computer Vision and Pattern Recognition Workhsop | Abbreviated Journal | |
| Volume | Issue | Pages |
1250 - 12507 | ||
| Keywords | Gallium nitride; Atmospheric modeling; Generators; Generative adversarial networks; Convergence; Image color analysis | ||||
| Abstract | This paper proposes a novel approach to remove haze degradations in RGB images using a stacked conditional Generative Adversarial Network (GAN). It employs a triplet of GAN to remove the haze on each color channel independently.
A multiple loss functions scheme, applied over a conditional probabilistic model, is proposed. The proposed GAN architecture learns to remove the haze, using as conditioned entrance, the images with haze from which the clear images will be obtained. Such formulation ensures a fast model training convergence and a homogeneous model generalization. Experiments showed that the proposed method generates high-quality clear images. |
||||
| Address | Salt Lake City; USA; June 2018 | ||||
| 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 | CVPRW | ||
| Notes | MSIAU; 600.086; 600.130; 600.122 | Approved | no | ||
| Call Number | Admin @ si @ SSV2018d | Serial | 3197 | ||
| Permanent link to this record | |||||