Département signal et communications

Le département Signal & Communications est spécialisé dans le domaine des Mathématiques et Traitement de l’Information. Il s’intéresse à la fois aux aspects méthodologiques et théoriques mais également aux problèmes de mise en œuvre et des implémentations des algorithmes étudiés notamment via les techniques de radio logicielle. Les domaines d’applications concernent principalement la Mer, la Défense et les Télécommunications.

Le département Signal & Communications est composé en 2018 de quelques 54 membres dont 17 permanents.

Département signal et communications

 

 

Recherche
Enseignement
Innovation
International

Les prochains événements du département

Il n'y a pas d'événement en cours ou à venir pour le département.
Les dernières publications du département
Article dans une revue
Sánchez-Román A., Gómez-Navarro L., Fablet Ronan, Oro D., Mason E., Arcos J., Ruiz S., Pascual A.
Rafting behaviour of seabirds as a proxy to describe surface ocean currents in the Balearic Sea
Scientific Reports, Nature Publishing Group, 2019, 9 (1)
Bibtext :
@article{sanchezroman:hal-02005270,
TITLE = {{Rafting behaviour of seabirds as a proxy to describe surface ocean currents in the Balearic Sea}},
AUTHOR = {S{\'a}nchez-Rom{\'a}n, A. and G{\'o}mez-Navarro, L. and Fablet, Ronan and Oro, D. and Mason, E. and Arcos, J. and Ruiz, S. and Pascual, A.},
URL = {https://hal-imt-atlantique.archives-ouvertes.fr/hal-02005270},
JOURNAL = {{Scientific Reports}},
PUBLISHER = {{Nature Publishing Group}},
VOLUME = {9},
NUMBER = {1},
YEAR = {2019},
MONTH = Dec,
HAL_ID = {hal-02005270},
HAL_VERSION = {v1},
}
Endnote :
%0 Journal Article
%T Rafting behaviour of seabirds as a proxy to describe surface ocean currents in the Balearic Sea
%+ Lab-STICC_IMTA_CID_TOMS
%+ Département Signal et Communications (IMT Atlantique - SC)
%+ Miquel Marques, 21
%+ Laboratoire de Chimie des Polymères Organiques (LCPO)
%A Sánchez-Román, A.
%A Gómez-Navarro, L.
%A Fablet, Ronan
%A Oro, D.
%A Mason, E.
%A Arcos, J.
%A Ruiz, S.
%A Pascual, A.
%< avec comité de lecture
%@ 2045-2322
%J Scientific Reports
%I Nature Publishing Group
%V 9
%N 1
%8 2019-12
%D 2019
%Z Environmental Sciences/Biodiversity and Ecology
%Z Sciences of the Universe [physics]/Ocean, AtmosphereJournal articles
%G English
%L hal-02005270
%U https://hal-imt-atlantique.archives-ouvertes.fr/hal-02005270
%~ IMT-ATLANTIQUE
%~ CNRS
%~ UNIV-BREST
%~ UNIV-UBS
%~ SDE
%~ INSTITUT-TELECOM
%~ ENIB
%~ LAB-STICC
%~ GIP-BE
%~ INC-CNRS
%~ LAB-STICC_IMTA_CID_TOMS
%~ LAB-STICC_IMTA
%~ IMTA_SC
%~ PRACOM
Communication dans un congrès
Lassami Nacerredine, Aissa El Bey Abdeldjalil, Abed-Meraim Karim
adaptive blind sparse source separation Based on Shear and Givens Rotations
IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP), May 2019, Brighton, United Kingdom. Proceedings IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP), 2019
Bibtext :
@inproceedings{lassami:hal-02059638,
TITLE = {{adaptive blind sparse source separation Based on Shear and Givens Rotations}},
AUTHOR = {Lassami, Nacerredine and Aissa El Bey, Abdeldjalil and Abed-Meraim, Karim},
URL = {https://hal.archives-ouvertes.fr/hal-02059638},
BOOKTITLE = {{IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP)}},
ADDRESS = {Brighton, United Kingdom},
HAL_LOCAL_REFERENCE = {19585},
PAGES = {.},
YEAR = {2019},
MONTH = May,
KEYWORDS = {Blind source separation ; Sparse signals ; Adaptive algorithm ; Shear and Givens rotations},
HAL_ID = {hal-02059638},
HAL_VERSION = {v1},
}
Endnote :
%0 Conference Proceedings
%T adaptive blind sparse source separation Based on Shear and Givens Rotations
%+ Lab-STICC_IMTA_CACS_COM
%+ Département Signal et Communications (IMT Atlantique - SC)
%+ Laboratoire Pluridisciplinaire de Recherche en Ingénierie des Systèmes, Mécanique et Energétique (PRISME)
%A Lassami, Nacerredine
%A Aissa El Bey, Abdeldjalil
%A Abed-Meraim, Karim
%< avec comité de lecture
%Z 19585
%( Proceedings IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP)
%B IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP)
%C Brighton, United Kingdom
%P .
%8 2019-05-12
%D 2019
%K Blind source separation
%K Sparse signals
%K Adaptive algorithm
%K Shear and Givens rotations
%Z Engineering Sciences [physics]/Signal and Image processingConference papers
%X This paper addresses the problem of adaptive blind sparse source separation in the time domain of an over-determined instantaneous noisy mixture. A two-step approach is proposed: first, the data are projected on the signal subspace estimated using the principal subspace tracker FAPI. In the second step, an L1 criterion is used to represent the sparsity property of the signal sources. For the optimization of this cost function, an adaptive method based on Givens and Shear rotations is used. This algorithm, referred to SGDS-FAPI, guarantees low computational complexity which is essential in the adaptive context. Numerical simulations have been performed, and showed that the proposed algorithm outperforms existing solutions in both convergence speed and estimation quality.
%G English
%L hal-02059638
%U https://hal.archives-ouvertes.fr/hal-02059638
%~ INSTITUT-TELECOM
%~ TELECOM-BRETAGNE
%~ CNRS
%~ UNIV-BREST
%~ UNIV-UBS
%~ ENSI-BOURGES
%~ MSL
%~ MSL-THESE
%~ ENIB
%~ LAB-STICC
%~ UNIV-ORLEANS
%~ IMT-ATLANTIQUE
%~ LAB-STICC_IMTA_CACS_COM
%~ PRISME-CVL
%~ IMTA_SC
%~ LAB-STICC_IMTA
%~ PRACOM
Communication dans un congrès
Mouchet Maxime, Chonavel Thierry, Vaton Sandrine
Statistical Characterization of Round-Trip Times with Nonparametric Hidden Markov Models
IFIP/IEEE IM 2019 Workshop: 4th International Workshop on Analytics for Network and Service Management (AnNet 2019), Apr 2019, Washington, DC, United States
Bibtext :
@inproceedings{mouchet:hal-02010099,
TITLE = {{Statistical Characterization of Round-Trip Times with Nonparametric Hidden Markov Models}},
AUTHOR = {Mouchet, Maxime and Chonavel, Thierry and Vaton, Sandrine},
URL = {https://hal.archives-ouvertes.fr/hal-02010099},
BOOKTITLE = {{IFIP/IEEE IM 2019 Workshop: 4th International Workshop on Analytics for Network and Service Management (AnNet 2019)}},
ADDRESS = {Washington, DC, United States},
YEAR = {2019},
MONTH = Apr,
PDF = {https://hal.archives-ouvertes.fr/hal-02010099/file/AnNet_2019.pdf},
HAL_ID = {hal-02010099},
HAL_VERSION = {v1},
}
Endnote :
%0 Conference Proceedings
%T Statistical Characterization of Round-Trip Times with Nonparametric Hidden Markov Models
%+ Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA)
%+ Département Informatique (IMT Atlantique - INFO)
%+ Université Bretagne Loire (UBL)
%+ Lab-STICC_TB_CID_TOMS
%+ Département Signal et Communications (IMT Atlantique - SC)
%A Mouchet, Maxime
%A Chonavel, Thierry
%A Vaton, Sandrine
%< avec comité de lecture
%B IFIP/IEEE IM 2019 Workshop: 4th International Workshop on Analytics for Network and Service Management (AnNet 2019)
%C Washington, DC, United States
%8 2019-04-08
%D 2019
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X The study of round-trip time (RTT) measurements on the Internet is of particular importance for improving real-time applications, enforcing QoS with traffic engineering, or detecting unexpected network conditions. On large timescales, from 1 hour to several days, RTT measurements exhibit characteristic patterns due to inter and intra-AS routing changes and traffic engineering, in addition to link congestion. We propose the use of a nonparametric Bayesian model, the Hierarchical Dirichlet Process Hidden Markov Model (HDP-HMM), to characterize RTT timeseries. The parameters of the HMM, including the number of states, as well as the values of hidden states are estimated from delay observations by Gibbs sampling. No assumptions are made on the number of states, and a nonparametric mixture model is used to represent a wide range of delay distribution in each state for more flexibility. We validate the model through three applications: on RIPE Atlas measurements we show that 80% of the states learned on RTTs match only one AS path; on a labelled delay changepoint dataset we show that the model is competitive with state-of-the-art changepoint detection methods in terms of precision and recall; and we show that the predictive ability of the model allows us to reduce the monitoring cost by 90% in routing overlays using Markov decision processes.
%G English
%2 https://hal.archives-ouvertes.fr/hal-02010099/document
%2 https://hal.archives-ouvertes.fr/hal-02010099/file/AnNet_2019.pdf
%L hal-02010099
%U https://hal.archives-ouvertes.fr/hal-02010099
%~ CNRS
%~ UNIV-BREST
%~ UNIV-UBS
%~ INSTITUT-TELECOM
%~ IRISA_SET
%~ ENIB
%~ LAB-STICC_ENIB
%~ LAB-STICC
%~ LAB-STICC_TB
%~ CENTRALESUPELEC
%~ IRISA
%~ INRIA
%~ IMT-ATLANTIQUE
%~ LAB-STICC_IMTA_CID_TOMS
%~ LAB-STICC_IMTA
%~ INRIA-AUT
%~ IMTA_INFO
%~ IMTA_SC
%~ INSA-GROUPE
%~ UNIV-RENNES1
%~ UR1-MATH-STIC
%~ UR1-HAL
%~ UR1-UFR-ISTIC
%~ TEST-UR-CSS
%~ IRISA_IMTA
%~ UNIV-RENNES
%~ PRACOM
Article dans une revue
Messai Malek, Aissa El Bey Abdeldjalil, Amis Cavalec Karine, Guilloud Frédéric
Iteratively Reweighted two-Stage LASSO for Block-Sparse Signal Recovery Under Finite-Alphabet Constraints
Signal Processing, Elsevier, 2019, 157, pp.73-77. 〈10.1016/j.sigpro.2018.11.007〉
Bibtext :
@article{messai:hal-01933349,
TITLE = {{Iteratively Reweighted two-Stage LASSO for Block-Sparse Signal Recovery Under Finite-Alphabet Constraints}},
AUTHOR = {Messai, Malek and Aissa El Bey, Abdeldjalil and Amis Cavalec, Karine and Guilloud, Fr{\'e}d{\'e}ric},
URL = {https://hal.archives-ouvertes.fr/hal-01933349},
JOURNAL = {{Signal Processing}},
HAL_LOCAL_REFERENCE = {19289},
HAL_LOCAL_REFERENCE = {ACL+},
PUBLISHER = {{Elsevier}},
VOLUME = {157},
PAGES = {73-77},
YEAR = {2019},
MONTH = Apr,
DOI = {10.1016/j.sigpro.2018.11.007},
KEYWORDS = {Iterative reweighting ; Iterative recovery algorithms ; LASSO ; l1-minimization ; Finite-alphabet ; Block-sparsity recovery},
PDF = {https://hal.archives-ouvertes.fr/hal-01933349/file/letter_singlecolumn_final.pdf},
HAL_ID = {hal-01933349},
HAL_VERSION = {v1},
}
Endnote :
%0 Journal Article
%T Iteratively Reweighted two-Stage LASSO for Block-Sparse Signal Recovery Under Finite-Alphabet Constraints
%+ Département Signal et Communications (IMT Atlantique - SC)
%+ Lab-STICC_IMTA_CACS_COM
%A Messai, Malek
%A Aissa El Bey, Abdeldjalil
%A Amis Cavalec, Karine
%A Guilloud, Frédéric
%< avec comité de lecture
%Z 19289
%Z ACL+
%@ 0165-1684
%J Signal Processing
%I Elsevier
%V 157
%P 73-77
%8 2019-04
%D 2019
%R 10.1016/j.sigpro.2018.11.007
%K Iterative reweighting
%K Iterative recovery algorithms
%K LASSO
%K l1-minimization
%K Finite-alphabet
%K Block-sparsity recovery
%Z Engineering Sciences [physics]/Signal and Image processingJournal articles
%X In this paper, we derive an efficient iterative algorithm for the recovery of block-sparse signals given the finite data alphabet and the non-zero block probability. The non-zero block number is supposed to be far smaller than the total block number (block-sparse). The key principle is the separation of the unknown signal vector into an unknown support vector s and an unknown data symbol vector a. Both number (‖s‖0) and positions (s ∈ {0, 1}) of non-zero blocks are unknown. The proposed algorithms use an iterative two-stage LASSO procedure consisting in optimizing the recovery problem alternatively with respect to a and with respect to s. The first algorithm resorts on ℓ1-norm of the support vector and the second one applies reweighted ℓ1-norm, which further improves the recovery performance. Performance of proposed algorithms is illustrated in the context of sporadic multiuser communications. Simulations show that the reweighted-ℓ1 algorithm performs close to its lower bound (perfect knowledge of the support vector).
%G English
%2 https://hal.archives-ouvertes.fr/hal-01933349/document
%2 https://hal.archives-ouvertes.fr/hal-01933349/file/letter_singlecolumn_final.pdf
%L hal-01933349
%U https://hal.archives-ouvertes.fr/hal-01933349
%~ UNIV-BREST
%~ IMT-ATLANTIQUE
%~ LAB-STICC_IMTA
%~ IMTA_SC
%~ LAB-STICC_IMTA_CACS_COM
%~ LAB-STICC
%~ ENIB
%~ UNIV-UBS
%~ CNRS
%~ INSTITUT-TELECOM
%~ PRACOM
Pré-publication, Document de travail
Nguyen Duong, Kirsebom Oliver, Frazão Fábio, Fablet Ronan, Matwin Stan
Recurrent Neural Networks with Stochastic Layers for Acoustic Novelty Detection
2019
Bibtext :
@unpublished{nguyen:hal-02018277,
TITLE = {{Recurrent Neural Networks with Stochastic Layers for Acoustic Novelty Detection}},
AUTHOR = {Nguyen, Duong and Kirsebom, Oliver S and Fraz{\~a}o, F{\'a}bio and Fablet, Ronan and Matwin, Stan},
URL = {https://hal.archives-ouvertes.fr/hal-02018277},
NOTE = {working paper or preprint},
YEAR = {2019},
MONTH = Feb,
PDF = {https://hal.archives-ouvertes.fr/hal-02018277/file/Recurrent%20Neural%20Networks%20with%20Stochastic%20Layers%20for%20Acoustic%20Novelty%20Detection.pdf},
HAL_ID = {hal-02018277},
HAL_VERSION = {v1},
}
Endnote :
%0 Unpublished work
%T Recurrent Neural Networks with Stochastic Layers for Acoustic Novelty Detection
%+ Département Signal et Communications (IMT Atlantique - SC)
%+ Lab-STICC_TB_CID_TOMS
%+ Institute for Big Data Analytics, Dalhousie University
%+ Lab-STICC_TB_CID_TOMS
%+ University of Ottawa [Ottawa] (uOttawa)
%A Nguyen, Duong
%A Kirsebom, Oliver, S
%A Frazão, Fábio
%A Fablet, Ronan
%A Matwin, Stan
%8 2019-02-13
%D 2019
%Z Computer Science [cs]
%Z Computer Science [cs]/Artificial Intelligence [cs.AI]
%Z Engineering Sciences [physics]/Acoustics [physics.class-ph]
%Z Engineering Sciences [physics]/Signal and Image processingPreprints, Working Papers, ...
%X In this paper, we adapt Recurrent Neural Networks with Stochastic Layers, which are the state-of-the-art for generating text, music and speech, to the problem of acoustic novelty detection. By integrating uncertainty into the hidden states, this type of network is able to learn the distribution of complex sequences. Because the learned distribution can be calculated explicitly in terms of probability, we can evaluate how likely an observation is then detect low-probability events as novel. The model is robust, highly unsupervised, end-to-end and requires minimum preprocessing, feature engineering or hyperparameter tuning. An experiment on a benchmark dataset shows that our model outperforms the state-of-the-art acoustic novelty detectors.
%G English
%2 https://hal.archives-ouvertes.fr/hal-02018277/document
%2 https://hal.archives-ouvertes.fr/hal-02018277/file/Recurrent%20Neural%20Networks%20with%20Stochastic%20Layers%20for%20Acoustic%20Novelty%20Detection.pdf
%L hal-02018277
%U https://hal.archives-ouvertes.fr/hal-02018277
%~ CNRS
%~ UNIV-BREST
%~ UNIV-UBS
%~ ENIB
%~ LAB-STICC_ENIB
%~ LAB-STICC
%~ LAB-STICC_TB
%~ IMT-ATLANTIQUE
%~ LAB-STICC_IMTA_CID_TOMS
%~ IMTA_SC
%~ INSTITUT-TELECOM
%~ LAB-STICC_IMTA
%~ PRACOM
Article dans une revue
Hehdly K., Laaraiedh M., Abdelkefi F., Siala M.
Cooperative localization and tracking in wireless sensor networks
International Journal of Communication Systems, Wiley, 2019, 32 (1)
Bibtext :
@article{hehdly:hal-01973665,
TITLE = {{Cooperative localization and tracking in wireless sensor networks}},
AUTHOR = {Hehdly, K. and Laaraiedh, M. and Abdelkefi, F. and Siala, M. },
URL = {https://hal-imt-atlantique.archives-ouvertes.fr/hal-01973665},
JOURNAL = {{International Journal of Communication Systems, Wiley}},
VOLUME = {32},
NUMBER = {1},
YEAR = {2019},
MONTH = Jan,
HAL_ID = {hal-01973665},
HAL_VERSION = {v1},
}
Endnote :
%0 Journal Article
%T Cooperative localization and tracking in wireless sensor networks
%+ Unité de Recherche en Réseaux Radio Mobile Multimédia (MEDIATRON)
%+ Département Signal et Communications (IMT Atlantique - SC)
%+ Lab-STICC_IMTA_CACS_COM
%A Hehdly, K.
%A Laaraiedh, M.
%A Abdelkefi, F.
%A Siala, M.
%< avec comité de lecture
%J International Journal of Communication Systems, Wiley
%V 32
%N 1
%8 2019-01-10
%D 2019
%Z Engineering Sciences [physics]/Signal and Image processing
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Journal articles
%G English
%L hal-01973665
%U https://hal-imt-atlantique.archives-ouvertes.fr/hal-01973665
%~ IMT-ATLANTIQUE
%~ IMTA_SC
%~ CNRS
%~ UNIV-BREST
%~ UNIV-UBS
%~ INSTITUT-TELECOM
%~ ENIB
%~ LAB-STICC
%~ LAB-STICC_IMTA
%~ LAB-STICC_IMTA_CACS_COM
%~ PRACOM
Article dans une revue
De Pontual Hélène, Lalire Maxime, Fablet Ronan, Laspougeas Claire, Garren Francois, Martin Stéphane, Drogou Mickael, Woillez Mathieu
New insights into behavioural ecology of European seabass off the West Coast of France: implications at local and population scales
ICES Journal of Marine Science, Oxford University Press (OUP), In press, 〈10.1093/icesjms/fsy086〉
Bibtext :
@article{depontual:hal-02013003,
TITLE = {{New insights into behavioural ecology of European seabass off the West Coast of France: implications at local and population scales}},
AUTHOR = {De Pontual, H{\'e}l{\`e}ne and LALIRE, Maxime and Fablet, Ronan and Laspougeas, Claire and GARREN, Francois and Martin, St{\'e}phane and Drogou, Mickael and Woillez, Mathieu},
URL = {https://hal-imt-atlantique.archives-ouvertes.fr/hal-02013003},
JOURNAL = {{ICES Journal of Marine Science}},
PUBLISHER = {{Oxford University Press (OUP)}},
YEAR = {2019},
DOI = {10.1093/icesjms/fsy086},
KEYWORDS = {depth ; Data Storage Tag (DST) ; connectivity ; cod ; Dicentrarchus labrax ; geolocation ; spawning site fidelity ; partial migration ; vertical movement ; temperature ; European sea bass},
PDF = {https://hal-imt-atlantique.archives-ouvertes.fr/hal-02013003/file/57790.pdf},
HAL_ID = {hal-02013003},
HAL_VERSION = {v1},
}
Endnote :
%0 Journal Article
%T New insights into behavioural ecology of European seabass off the West Coast of France: implications at local and population scales
%+ Département Sciences et Technologies Halieutiques / Laboratoire Technologie Halieutique (Ifremer) (STH - LTH)
%+ Département Sciences et Technologies Halieutiques / Laboratoire Technologie Halieutique (Ifremer) (STH - LTH)
%+ Lab-STICC_IMTA_CID_TOMS
%+ Département Signal et Communications (IMT Atlantique - SC)
%A De Pontual, Hélène
%A LALIRE, Maxime
%A Fablet, Ronan
%A Laspougeas, Claire
%A GARREN, Francois
%A Martin, Stéphane
%A Drogou, Mickael
%A Woillez, Mathieu
%< avec comité de lecture
%@ 1054-3139
%J ICES Journal of Marine Science
%I Oxford University Press (OUP)
%8 2019
%D 2019
%R 10.1093/icesjms/fsy086
%K depth
%K Data Storage Tag (DST)
%K connectivity
%K cod
%K Dicentrarchus labrax
%K geolocation
%K spawning site fidelity
%K partial migration
%K vertical movement
%K temperature
%K European sea bass
%Z Life Sciences [q-bio]/Animal biology/Vertebrate Zoology
%Z Life Sciences [q-bio]/Ecology, environmentJournal articles
%X data storage tags were deployed on European seabass in the Iroise Natural Marine Park, a marine protected area (MPA) off west Brittany, France. A return rate of 14.6% associated with long time series of data provided new information on fish ecology (e.g. maximum experienced depth greater than 225 m, temperature range 6.80-21.87 C). Depth and temperature series were used to infer individual migration using an innovative hidden Markov model (HMM) especially developed for seabass geolocation. Reconstructed fish tracks revealed that seabass is a partially migratory species, as individuals exhibited either long-distance migrations towards the Bay of Biscay or the Celtic Sea, or residency behaviour in the Iroise Sea. Fidelity to summer feeding areas and to winter spawing areas was demonstrated. These results suggest that the population is spatially structured. The Iroise Sea is likely a mixing zone for different stocks or sub-populations, and may also shelter a resident population. At the population scale, such findings may impact ICES stock assessment and the resulting decisions from EU managers. At the local scale, conservation action could be taken by MPA managers. Besides, this study demonstrates the high potential of archival tags for investigating multi-year behavioural patterns such as site fidelity to offshore spawning areas.
%G English
%2 https://hal-imt-atlantique.archives-ouvertes.fr/hal-02013003/document
%2 https://hal-imt-atlantique.archives-ouvertes.fr/hal-02013003/file/57790.pdf
%L hal-02013003
%U https://hal-imt-atlantique.archives-ouvertes.fr/hal-02013003
%~ IMT-ATLANTIQUE
%~ CNRS
%~ UNIV-BREST
%~ UNIV-UBS
%~ IFREMER
%~ INSTITUT-TELECOM
%~ ENIB
%~ LAB-STICC
%~ GIP-BE
%~ LAB-STICC_IMTA_CID_TOMS
%~ LAB-STICC_IMTA
%~ IMTA_SC
%~ PRACOM
Communication dans un congrès
Pham Chi-Hieu, Tor-Díez Carlos, Meunier Hélène, Bednarek Nathalie, Fablet Ronan, Passat Nicolas, Rousseau François
Simultaneous super-resolution and segmentation using a generative adversarial network: Application to neonatal brain MRI
International Symposium on Biomedical Imaging (ISBI), 2019, Venice, Italy
Bibtext :
@inproceedings{pham:hal-01895163,
TITLE = {{Simultaneous super-resolution and segmentation using a generative adversarial network: Application to neonatal brain MRI}},
AUTHOR = {Pham, Chi-Hieu and Tor-D{\'i}ez, Carlos and Meunier, H{\'e}l{\`e}ne and Bednarek, Nathalie and Fablet, Ronan and Passat, Nicolas and Rousseau, Fran{\c c}ois},
URL = {https://hal.archives-ouvertes.fr/hal-01895163},
BOOKTITLE = {{International Symposium on Biomedical Imaging (ISBI)}},
ADDRESS = {Venice, Italy},
YEAR = {2019},
KEYWORDS = {segmentation ; super-resolution ; neonatal brain MRI ; 3D generative adversarial networks},
PDF = {https://hal.archives-ouvertes.fr/hal-01895163/file/Pham%20ISBI%202019.pdf},
HAL_ID = {hal-01895163},
HAL_VERSION = {v1},
}
Endnote :
%0 Conference Proceedings
%T Simultaneous super-resolution and segmentation using a generative adversarial network: Application to neonatal brain MRI
%+ Laboratoire de Traitement de l'Information Medicale (LaTIM)
%+ Département lmage et Traitement Information (IMT Atlantique - ITI)
%+ Service de médecine néonatale et réanimation pédiatrique, CHU de Reims
%+ Centre de Recherche en Sciences et Technologies de l'Information et de la Communication - EA 3804 (CRESTIC)
%+ Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (Lab-STICC)
%+ Département Signal et Communications (IMT Atlantique - SC)
%A Pham, Chi-Hieu
%A Tor-Díez, Carlos
%A Meunier, Hélène
%A Bednarek, Nathalie
%A Fablet, Ronan
%A Passat, Nicolas
%A Rousseau, François
%< avec comité de lecture
%B International Symposium on Biomedical Imaging (ISBI)
%C Venice, Italy
%8 2019
%D 2019
%K segmentation
%K super-resolution
%K neonatal brain MRI
%K 3D generative adversarial networks
%Z Computer Science [cs]/Artificial Intelligence [cs.AI]
%Z Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]
%Z Computer Science [cs]/Medical ImagingConference papers
%X The analysis of clinical neonatal brain MRI remains challenging due to low anisotropic resolution of the data. In most pipelines, images are first re-sampled using interpolation or single image super-resolution techniques and then segmented using (semi-)automated approaches. Image reconstruction and segmentation are then performed separately. In this paper, we propose an end-to-end generative adversarial network for simultaneous high-resolution reconstruction and segmentation of brain MRI data. This joint approach is first assessed on the simulated low-resolution images of the high-resolution neonatal dHCP dataset. Then, the learned model is used to enhance and segment real clinical low-resolution images. Results demonstrate the potential of our proposed method with respect to practical medical applications.
%G English
%2 https://hal.archives-ouvertes.fr/hal-01895163/document
%2 https://hal.archives-ouvertes.fr/hal-01895163/file/Pham%20ISBI%202019.pdf
%L hal-01895163
%U https://hal.archives-ouvertes.fr/hal-01895163
%~ IBSAM
%~ LATIM
%~ IMT-ATLANTIQUE
%~ LATIM_IMTA
%~ LAB-STICC_IMTA
%~ IMTA_SC
%~ IMTA_ITI
%~ CRESTIC
%~ LAB-STICC
%~ ENIB
%~ UNIV-UBS
%~ URCA
%~ CNRS
%~ INSTITUT-TELECOM
%~ UNIV-BREST
%~ INSERM
Communication dans un congrès
Dupraz Elsa, Leduc Primeau Francois, Gagnon François
Low-Latency LDPC Decoding Achieved by Code and Architecture Co-Design
ISTC 2018 : International Symposium on Turbo Codes & Iterative Information Processing, Dec 2018, Hong Kong, Hong Kong SAR China. Proceedings ISTC 2018 : International Symposium on Turbo Codes & Iterative Information Processing, 2018
Bibtext :
@inproceedings{dupraz:hal-02009983,
TITLE = {{Low-Latency LDPC Decoding Achieved by Code and Architecture Co-Design}},
AUTHOR = {Dupraz, Elsa and Leduc Primeau, Francois and Gagnon, Fran{\c c}ois},
URL = {https://hal.archives-ouvertes.fr/hal-02009983},
BOOKTITLE = {{ISTC 2018 : International Symposium on Turbo Codes \& Iterative Information Processing}},
ADDRESS = {Hong Kong, Hong Kong SAR China},
HAL_LOCAL_REFERENCE = {19340},
PAGES = {.},
YEAR = {2018},
MONTH = Dec,
KEYWORDS = {Energy efficiency ; LDPC codes ; Decoder architecture},
HAL_ID = {hal-02009983},
HAL_VERSION = {v1},
}
Endnote :
%0 Conference Proceedings
%T Low-Latency LDPC Decoding Achieved by Code and Architecture Co-Design
%+ Lab-STICC_IMTA_CACS_COM
%+ Département Signal et Communications (IMT Atlantique - SC)
%+ Ecole de Technologie Supérieure [Montréal] (ETS)
%+ Département Electronique (IMT Atlantique - ELEC)
%A Dupraz, Elsa
%A Leduc Primeau, Francois
%A Gagnon, François
%< avec comité de lecture
%Z 19340
%( Proceedings ISTC 2018 : International Symposium on Turbo Codes & Iterative Information Processing
%B ISTC 2018 : International Symposium on Turbo Codes & Iterative Information Processing
%C Hong Kong, Hong Kong SAR China
%P .
%8 2018-12-03
%D 2018
%K Energy efficiency
%K LDPC codes
%K Decoder architecture
%Z Mathematics [math]/Information Theory [math.IT]
%Z Engineering Sciences [physics]/Electronics
%Z Engineering Sciences [physics]/Signal and Image processingConference papers
%X A novel low-density parity-check decoder architecture is presented that can achieve a high data throughput while retaining the flexibility to decode a wide range of quasi-cyclic codes. The proposed architecture allows to combine multiple message-update schedules, providing an additional degree of freedom to jointly optimize the code and decoder architecture. Protograph-based code constructions are introduced that exploit this added degree of freedom in order to maximize data throughput, and that are also optimized to reduce the complexity of the required parallel data accesses.For some examples and under an ideal pipeline speedup assumption, the proposed architecture and code designs reduce decoding latency by a factor of $3.2\times$ compared to a decoder using a strict sequential schedule.
%G English
%L hal-02009983
%U https://hal.archives-ouvertes.fr/hal-02009983
%~ INSTITUT-TELECOM
%~ TELECOM-BRETAGNE
%~ CNRS
%~ UNIV-BREST
%~ UNIV-UBS
%~ INSMI
%~ ENIB
%~ LAB-STICC
%~ IMT-ATLANTIQUE
%~ IMTA_ELEC
%~ LAB-STICC_IMTA_CACS_COM
%~ IMTA_SC
%~ LAB-STICC_IMTA
%~ PRACOM
Communication dans un congrès
Hajji Zahran, Amis Cavalec Karine, Aissa El Bey Abdeldjalil
Joint channel estimation and simplicity-based detection for large-scale MIMO FEC-coded systems
10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC), Dec 2018, Honk-Kong, Hong Kong SAR China. Proceedings 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC), 2018
Bibtext :
@inproceedings{hajji:hal-01893584,
TITLE = {{Joint channel estimation and simplicity-based detection for large-scale MIMO FEC-coded systems}},
AUTHOR = {Hajji, Zahran and Amis Cavalec, Karine and Aissa El Bey, Abdeldjalil},
URL = {https://hal.archives-ouvertes.fr/hal-01893584},
BOOKTITLE = {{10th International Symposium on Turbo Codes \& Iterative Information Processing (ISTC)}},
ADDRESS = {Honk-Kong, Hong Kong SAR China},
HAL_LOCAL_REFERENCE = {19247},
PAGES = {.},
YEAR = {2018},
MONTH = Dec,
KEYWORDS = {Channel estimation ; Simplicity ; Massive MIMO ; Turbo-detection},
PDF = {https://hal.archives-ouvertes.fr/hal-01893584/file/1570474591.pdf},
HAL_ID = {hal-01893584},
HAL_VERSION = {v1},
}
Endnote :
%0 Conference Proceedings
%T Joint channel estimation and simplicity-based detection for large-scale MIMO FEC-coded systems
%+ Lab-STICC_IMTA_CACS_COM
%+ Département Signal et Communications (IMT Atlantique - SC)
%A Hajji, Zahran
%A Amis Cavalec, Karine
%A Aissa El Bey, Abdeldjalil
%< avec comité de lecture
%Z 19247
%( Proceedings 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC)
%B 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC)
%C Honk-Kong, Hong Kong SAR China
%P .
%8 2018-12-03
%D 2018
%K Channel estimation
%K Simplicity
%K Massive MIMO
%K Turbo-detection
%Z Engineering Sciences [physics]/Signal and Image processingConference papers
%X In this paper, we address the problem of channel estimation and signal detection in large MIMO FEC-coded systems assuming finite alphabet modulations. We consider a semi-blind iterative expectation maximization algorithm which relies on a limited number of pilot sequences to initialize the estimation process. We propose to include the estimation process within a turbo finite-alphabet simplicity (FAS)-based detection receiver. To that purpose we define two estimation updates from the FEC decoder output. Simulations carried out in both determined and undetermined configurations show that the resulting scheme outperforms the state-of-the-art receiver which uses an MMSE estimation criterion and that it reaches the maximum-likelihood lower-bound.
%G English
%2 https://hal.archives-ouvertes.fr/hal-01893584/document
%2 https://hal.archives-ouvertes.fr/hal-01893584/file/1570474591.pdf
%L hal-01893584
%U https://hal.archives-ouvertes.fr/hal-01893584
%~ INSTITUT-TELECOM
%~ TELECOM-BRETAGNE
%~ CNRS
%~ UNIV-BREST
%~ UNIV-UBS
%~ ENIB
%~ LAB-STICC
%~ IMT-ATLANTIQUE
%~ LAB-STICC_IMTA_CACS_COM
%~ IMTA_SC
%~ LAB-STICC_IMTA
%~ PRACOM
Voir toutes les publications du département
Contacts
Responsable de département : Samir SAOUDI
Tél : +33 2 29 00 11 79
Assistante de département : Martine BESNARD
Tél : +33 2 29 00 13 81
Voir tous les membres du département
Infos pratiques :
Bâtiment K01