| Records |
| Author |
Sudeep Katakol; Luis Herranz; Fei Yang; Marta Mrak |
Title  |
DANICE: Domain adaptation without forgetting in neural image compression |
Type |
Conference Article |
| Year |
2021 |
Publication |
Conference on Computer Vision and Pattern Recognition Workshops |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
1921-1925 |
| Keywords |
|
| Abstract |
Neural image compression (NIC) is a new coding paradigm where coding capabilities are captured by deep models learned from data. This data-driven nature enables new potential functionalities. In this paper, we study the adaptability of codecs to custom domains of interest. We show that NIC codecs are transferable and that they can be adapted with relatively few target domain images. However, naive adaptation interferes with the solution optimized for the original source domain, resulting in forgetting the original coding capabilities in that domain, and may even break the compatibility with previously encoded bitstreams. Addressing these problems, we propose Codec Adaptation without Forgetting (CAwF), a framework that can avoid these problems by adding a small amount of custom parameters, where the source codec remains embedded and unchanged during the adaptation process. Experiments demonstrate its effectiveness and provide useful insights on the characteristics of catastrophic interference in NIC. |
| Address |
Virtual; June 2021 |
| 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 |
LAMP; 600.120; 600.141; 601.379 |
Approved |
no |
| Call Number |
Admin @ si @ KHY2021 |
Serial |
3568 |
| Permanent link to this record |
| |
|
| |
| Author |
Albert Clapes; Tinne Tuytelaars; Sergio Escalera |
| Title |
Darwintrees for action recognition |
Type |
Conference Article |
| Year |
2017 |
Publication |
Chalearn Workshop on Action, Gesture, and Emotion Recognition: Large Scale Multimodal Gesture Recognition and Real versus Fake expressed emotions at ICCV |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
|
| 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 |
ICCVW |
| Notes |
HUPBA; no menciona |
Approved |
no |
| Call Number |
Admin @ si @ CTE2017 |
Serial |
3069 |
| Permanent link to this record |
| |
|
| |
| Author |
Debora Gil; Antonio Esteban Lansaque; Sebastian Stefaniga; Mihail Gaianu; Carles Sanchez |
| Title |
Data Augmentation from Sketch |
Type |
Conference Article |
| Year |
2019 |
Publication |
International Workshop on Uncertainty for Safe Utilization of Machine Learning in Medical Imaging |
Abbreviated Journal |
|
| Volume |
11840 |
Issue |
|
Pages |
155-162 |
| Keywords |
Data augmentation; cycleGANs; Multi-objective optimization |
| Abstract |
State of the art machine learning methods need huge amounts of data with unambiguous annotations for their training. In the context of medical imaging this is, in general, a very difficult task due to limited access to clinical data, the time required for manual annotations and variability across experts. Simulated data could serve for data augmentation provided that its appearance was comparable to the actual appearance of intra-operative acquisitions. Generative Adversarial Networks (GANs) are a powerful tool for artistic style transfer, but lack a criteria for selecting epochs ensuring also preservation of intra-operative content.
We propose a multi-objective optimization strategy for a selection of cycleGAN epochs ensuring a mapping between virtual images and the intra-operative domain preserving anatomical content. Our approach has been applied to simulate intra-operative bronchoscopic videos and chest CT scans from virtual sketches generated using simple graphical primitives. |
| Address |
Shenzhen; China; October 2019 |
| Corporate Author |
|
Thesis |
|
| Publisher |
|
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
LNCS |
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
|
ISBN |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
CLIP |
| Notes |
IAM; 600.145; 601.337; 600.139; 600.145 |
Approved |
no |
| Call Number |
Admin @ si @ GES2019 |
Serial |
3359 |
| Permanent link to this record |
| |
|
| |
| Author |
Antonio Lopez; David Vazquez; Gabriel Villalonga |
| Title |
Data for Training Models, Domain Adaptation |
Type |
Book Chapter |
| Year |
2018 |
Publication |
Intelligent Vehicles. Enabling Technologies and Future Developments |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
395–436 |
| Keywords |
Driving simulator; hardware; software; interface; traffic simulation; macroscopic simulation; microscopic simulation; virtual data; training data |
| Abstract |
Simulation can enable several developments in the field of intelligent vehicles. This chapter is divided into three main subsections. The first one deals with driving simulators. The continuous improvement of hardware performance is a well-known fact that is allowing the development of more complex driving simulators. The immersion in the simulation scene is increased by high fidelity feedback to the driver. In the second subsection, traffic simulation is explained as well as how it can be used for intelligent transport systems. Finally, it is rather clear that sensor-based perception and action must be based on data-driven algorithms. Simulation could provide data to train and test algorithms that are afterwards implemented in vehicles. These tools are explained in the third subsection. |
| 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.118 |
Approved |
no |
| Call Number |
Admin @ si @ LVV2018 |
Serial |
3047 |
| Permanent link to this record |
| |
|
| |
| Author |
P. Andreeva; Maya Dimitrova; Petia Radeva |
| Title |
Data Mining Learning Models and Algorithms for Medical Applications |
Type |
Book Chapter |
| Year |
2004 |
Publication |
18 Conference Systems for Automation of Engineering and Research (SEAR 2004) |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
|
| Keywords |
|
| Abstract |
|
| Address |
Varna (Bulgaria) |
| 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 |
Approved |
no |
| Call Number |
BCNPCL @ bcnpcl @ ADR2004 |
Serial |
474 |
| Permanent link to this record |
| |
|
| |
| Author |
Adria Molina; Pau Riba; Lluis Gomez; Oriol Ramos Terrades; Josep Llados |
| Title |
Date Estimation in the Wild of Scanned Historical Photos: An Image Retrieval Approach |
Type |
Conference Article |
| Year |
2021 |
Publication |
16th International Conference on Document Analysis and Recognition |
Abbreviated Journal |
|
| Volume |
12822 |
Issue |
|
Pages |
306-320 |
| Keywords |
|
| Abstract |
This paper presents a novel method for date estimation of historical photographs from archival sources. The main contribution is to formulate the date estimation as a retrieval task, where given a query, the retrieved images are ranked in terms of the estimated date similarity. The closer are their embedded representations the closer are their dates. Contrary to the traditional models that design a neural network that learns a classifier or a regressor, we propose a learning objective based on the nDCG ranking metric. We have experimentally evaluated the performance of the method in two different tasks: date estimation and date-sensitive image retrieval, using the DEW public database, overcoming the baseline methods. |
| Address |
Lausanne; Suissa; September 2021 |
| Corporate Author |
|
Thesis |
|
| Publisher |
|
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
LNCS |
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
|
ISBN |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
ICDAR |
| Notes |
DAG; 600.121; 600.140; 110.312 |
Approved |
no |
| Call Number |
Admin @ si @ MRG2021b |
Serial |
3571 |
| Permanent link to this record |
| |
|
| |
| Author |
Saiping Zhang; Luis Herranz; Marta Mrak; Marc Gorriz Blanch; Shuai Wan; Fuzheng Yang |
| Title |
DCNGAN: A Deformable Convolution-Based GAN with QP Adaptation for Perceptual Quality Enhancement of Compressed Video |
Type |
Conference Article |
| Year |
2022 |
Publication |
47th International Conference on Acoustics, Speech, and Signal Processing |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
|
| Keywords |
|
| Abstract |
In this paper, we propose a deformable convolution-based generative adversarial network (DCNGAN) for perceptual quality enhancement of compressed videos. DCNGAN is also adaptive to the quantization parameters (QPs). Compared with optical flows, deformable convolutions are more effective and efficient to align frames. Deformable convolutions can operate on multiple frames, thus leveraging more temporal information, which is beneficial for enhancing the perceptual quality of compressed videos. Instead of aligning frames in a pairwise manner, the deformable convolution can process multiple frames simultaneously, which leads to lower computational complexity. Experimental results demonstrate that the proposed DCNGAN outperforms other state-of-the-art compressed video quality enhancement algorithms. |
| Address |
Virtual; May 2022 |
| 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 |
ICASSP |
| Notes |
MACO; 600.161; 601.379 |
Approved |
no |
| Call Number |
Admin @ si @ ZHM2022a |
Serial |
3765 |
| Permanent link to this record |
| |
|
| |
| Author |
Mohamed Ali Souibgui; Y.Kessentini |
| Title |
DE-GAN: A Conditional Generative Adversarial Network for Document Enhancement |
Type |
Journal Article |
| Year |
2022 |
Publication |
IEEE Transactions on Pattern Analysis and Machine Intelligence |
Abbreviated Journal |
TPAMI |
| Volume |
44 |
Issue |
3 |
Pages |
1180-1191 |
| Keywords |
|
| Abstract |
Documents often exhibit various forms of degradation, which make it hard to be read and substantially deteriorate the performance of an OCR system. In this paper, we propose an effective end-to-end framework named Document Enhancement Generative Adversarial Networks (DE-GAN) that uses the conditional GANs (cGANs) to restore severely degraded document images. To the best of our knowledge, this practice has not been studied within the context of generative adversarial deep networks. We demonstrate that, in different tasks (document clean up, binarization, deblurring and watermark removal), DE-GAN can produce an enhanced version of the degraded document with a high quality. In addition, our approach provides consistent improvements compared to state-of-the-art methods over the widely used DIBCO 2013, DIBCO 2017 and H-DIBCO 2018 datasets, proving its ability to restore a degraded document image to its ideal condition. The obtained results on a wide variety of degradation reveal the flexibility of the proposed model to be exploited in other document enhancement problems. |
| Address |
1 March 2022 |
| 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.230; 600.121; 600.140 |
Approved |
no |
| Call Number |
Admin @ si @ SoK2022 |
Serial |
3454 |
| Permanent link to this record |
| |
|
| |
| Author |
Robert Benavente |
| Title |
Dealing with colour variability: application to a colour naming task |
Type |
Report |
| Year |
1999 |
Publication |
CVC Technical Report #32 |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
|
| Keywords |
|
| Abstract |
|
| Address |
CVC (UAB) |
| 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 |
Approved |
no |
| Call Number |
CAT @ cat @ Ben1999 |
Serial |
53 |
| Permanent link to this record |
| |
|
| |
| Author |
Sergio Escalera; Oriol Pujol; Petia Radeva |
| Title |
Decoding of Ternary Error Correcting Output Codes |
Type |
Book Chapter |
| Year |
2006 |
Publication |
11th Iberoamerican Congress on Pattern Recognition (CIARP´06), LNCS 4225: 753–763 |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
|
| Keywords |
|
| Abstract |
|
| Address |
Cancun (Mexico) |
| 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;HuPBA |
Approved |
no |
| Call Number |
BCNPCL @ bcnpcl @ EPR2006e |
Serial |
696 |
| Permanent link to this record |
| |
|
| |
| Author |
Clementine Decamps; Alexis Arnaud; Florent Petitprez; Mira Ayadi; Aurelia Baures; Lucile Armenoult; Sergio Escalera; Isabelle Guyon; Remy Nicolle; Richard Tomasini; Aurelien de Reynies; Jerome Cros; Yuna Blum; Magali Richard |
| Title |
DECONbench: a benchmarking platform dedicated to deconvolution methods for tumor heterogeneity quantification |
Type |
Journal Article |
| Year |
2021 |
Publication |
BMC Bioinformatics |
Abbreviated Journal |
|
| Volume |
22 |
Issue |
|
Pages |
473 |
| Keywords |
|
| Abstract |
Quantification of tumor heterogeneity is essential to better understand cancer progression and to adapt therapeutic treatments to patient specificities. Bioinformatic tools to assess the different cell populations from single-omic datasets as bulk transcriptome or methylome samples have been recently developed, including reference-based and reference-free methods. Improved methods using multi-omic datasets are yet to be developed in the future and the community would need systematic tools to perform a comparative evaluation of these algorithms on controlled 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 |
HUPBA; no proj |
Approved |
no |
| Call Number |
Admin @ si @ DAP2021 |
Serial |
3650 |
| Permanent link to this record |
| |
|
| |
| Author |
Ruben Ballester; Carles Casacuberta; Sergio Escalera |
| Title |
Decorrelating neurons using persistence |
Type |
Miscellaneous |
| Year |
2023 |
Publication |
ARXIV |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
|
| Keywords |
|
| Abstract |
We propose a novel way to improve the generalisation capacity of deep learning models by reducing high correlations between neurons. For this, we present two regularisation terms computed from the weights of a minimum spanning tree of the clique whose vertices are the neurons of a given network (or a sample of those), where weights on edges are correlation dissimilarities. We provide an extensive set of experiments to validate the effectiveness of our terms, showing that they outperform popular ones. Also, we demonstrate that naive minimisation of all correlations between neurons obtains lower accuracies than our regularisation terms, suggesting that redundancies play a significant role in artificial neural networks, as evidenced by some studies in neuroscience for real networks. We include a proof of differentiability of our regularisers, thus developing the first effective topological persistence-based regularisation terms that consider the whole set of neurons and that can be applied to a feedforward architecture in any deep learning task such as classification, data generation, or regression. |
| 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 |
Approved |
no |
| Call Number |
Admin @ si @ BCE2023 |
Serial |
3977 |
| Permanent link to this record |
| |
|
| |
| Author |
Jaume Garcia; Albert Andaluz; Debora Gil; Francesc Carreras |
| Title |
Decoupled External Forces in a Predictor-Corrector Segmentation Scheme for LV Contours in Tagged MR Images |
Type |
Conference Article |
| Year |
2010 |
Publication |
32nd Annual International Conference of the IEEE Engineering in Medicine and Biology Society |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
4805-4808 |
| Keywords |
|
| Abstract |
Computation of functional regional scores requires proper identification of LV contours. On one hand, manual segmentation is robust, but it is time consuming and requires high expertise. On the other hand, the tag pattern in TMR sequences is a problem for automatic segmentation of LV boundaries. We propose a segmentation method based on a predictorcorrector (Active Contours – Shape Models) scheme. Special stress is put in the definition of the AC external forces. First, we introduce a semantic description of the LV that discriminates myocardial tissue by using texture and motion descriptors. Second, in order to ensure convergence regardless of the initial contour, the external energy is decoupled according to the orientation of the edges in the image potential. We have validated the model in terms of error in segmented contours and accuracy of regional clinical scores. |
| Address |
Buenos Aires (Argentina) |
| Corporate Author |
IEEE EMB |
Thesis |
|
| Publisher |
|
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
1557-170X |
ISBN |
978-1-4244-4123-5 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
EMBC |
| Notes |
IAM |
Approved |
no |
| Call Number |
IAM @ iam @ GAG2010 |
Serial |
1514 |
| Permanent link to this record |
| |
|
| |
| Author |
Katerine Diaz; Jesus Martinez del Rincon; Aura Hernandez-Sabate |
| Title |
Decremental generalized discriminative common vectors applied to images classification |
Type |
Journal Article |
| Year |
2017 |
Publication |
Knowledge-Based Systems |
Abbreviated Journal |
KBS |
| Volume |
131 |
Issue |
|
Pages |
46-57 |
| Keywords |
Decremental learning; Generalized Discriminative Common Vectors; Feature extraction; Linear subspace methods; Classification |
| Abstract |
In this paper, a novel decremental subspace-based learning method called Decremental Generalized Discriminative Common Vectors method (DGDCV) is presented. The method makes use of the concept of decremental learning, which we introduce in the field of supervised feature extraction and classification. By efficiently removing unnecessary data and/or classes for a knowledge base, our methodology is able to update the model without recalculating the full projection or accessing to the previously processed training data, while retaining the previously acquired knowledge. The proposed method has been validated in 6 standard face recognition datasets, showing a considerable computational gain without compromising the accuracy of the model. |
| 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.118; 600.121 |
Approved |
no |
| Call Number |
Admin @ si @ DMH2017a |
Serial |
3003 |
| Permanent link to this record |
| |
|
| |
| Author |
Beata Megyesi; Bernhard Esslinger; Alicia Fornes; Nils Kopal; Benedek Lang; George Lasry; Karl de Leeuw; Eva Pettersson; Arno Wacker; Michelle Waldispuhl |
| Title |
Decryption of historical manuscripts: the DECRYPT project |
Type |
Journal Article |
| Year |
2020 |
Publication |
Cryptologia |
Abbreviated Journal |
CRYPT |
| Volume |
44 |
Issue |
6 |
Pages |
545-559 |
| Keywords |
automatic decryption; cipher collection; historical cryptology; image transcription |
| Abstract |
Many historians and linguists are working individually and in an uncoordinated fashion on the identification and decryption of historical ciphers. This is a time-consuming process as they often work without access to automatic methods and processes that can accelerate the decipherment. At the same time, computer scientists and cryptologists are developing algorithms to decrypt various cipher types without having access to a large number of original ciphertexts. In this paper, we describe the DECRYPT project aiming at the creation of resources and tools for historical cryptology by bringing the expertise of various disciplines together for collecting data, exchanging methods for faster progress to transcribe, decrypt and contextualize historical encrypted manuscripts. We present our goals and work-in progress of a general approach for analyzing historical encrypted manuscripts using standardized methods and a new set of state-of-the-art tools. We release the data and tools as open-source hoping that all mentioned disciplines would benefit and contribute to the research infrastructure of historical cryptology. |
| 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.140; 600.121 |
Approved |
no |
| Call Number |
Admin @ si @ MEF2020 |
Serial |
3347 |
| Permanent link to this record |
