default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBoris Mailhé
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[i6]Charles Millard, Mark Chiew, Jared Tanner, Aaron T. Hess, Boris Mailhé:
Tuning-free multi-coil compressed sensing MRI with Parallel Variable Density Approximate Message Passing (P-VDAMP). CoRR abs/2203.04180 (2022)- 2020
- [c15]Charles Millard, Aaron T. Hess
, Boris Mailhé, Jared Tanner:
An Approximate Message Passing Algorithm For Rapid Parameter-Free Compressed Sensing MRI. ICIP 2020: 91-95 - [c14]Mahmoud Mostapha, Boris Mailhé, Xiao Chen, Pascal Ceccaldi, Youngjin Yoo, Mariappan S. Nadar:
Braided Networks for Scan-Aware MRI Brain Tissue Segmentation. ISBI 2020: 136-139 - [i5]Charles Millard, Aaron T. Hess, Boris Mailhé, Jared Tanner:
Approximate Message Passing with a Colored Aliasing Model for Variable Density Fourier Sampled Images. CoRR abs/2003.02701 (2020) - [i4]Eduardo Jose Mortani Barbosa Jr., Warren B. Gefter, Rochelle Yang, Florin C. Ghesu, Siqi Liu, Boris Mailhé, Awais Mansoor, Sasa Grbic, Sebastian Piat, Guillaume Chabin, R. S. Vishwanath, Abishek Balachandran, Sebastian Vogt, Valentin Ziebandt, Steffen Kappler, Dorin Comaniciu:
Automated detection and quantification of COVID-19 airspace disease on chest radiographs: A novel approach achieving radiologist-level performance using a CNN trained on digital reconstructed radiographs (DRRs) from CT-based ground-truth. CoRR abs/2008.06330 (2020)
2010 – 2019
- 2019
- [j4]Julian Krebs, Hervé Delingette, Boris Mailhé, Nicholas Ayache, Tommaso Mansi:
Learning a Probabilistic Model for Diffeomorphic Registration. IEEE Trans. Medical Imaging 38(9): 2165-2176 (2019) - [i3]Charles Millard, Aaron T. Hess, Boris Mailhé, Jared Tanner:
An Approximate Message Passing Algorithm for Rapid Parameter-Free Compressed Sensing MRI. CoRR abs/1911.01234 (2019) - 2018
- [c13]Julian Krebs, Tommaso Mansi, Boris Mailhé, Nicholas Ayache, Hervé Delingette:
Unsupervised Probabilistic Deformation Modeling for Robust Diffeomorphic Registration. DLMIA/ML-CDS@MICCAI 2018: 101-109 - [i2]Julian Krebs, Tommaso Mansi, Boris Mailhé, Nicholas Ayache, Hervé Delingette:
Learning Structured Deformations using Diffeomorphic Registration. CoRR abs/1804.07172 (2018) - [i1]Julian Krebs, Hervé Delingette, Boris Mailhé, Nicholas Ayache, Tommaso Mansi:
Learning a Probabilistic Model for Diffeomorphic Registration. CoRR abs/1812.07460 (2018) - 2017
- [c12]Katrin Mentl, Boris Mailhé, Florin C. Ghesu, Frank Schebesch, Tino Haderlein, Andreas K. Maier, Mariappan S. Nadar:
Noise reduction in low-dose ct using a 3D multiscale sparse denoising autoencoder. MLSP 2017: 1-6 - 2016
- [c11]Yevgen Matviychuk, Boris Mailhé, Xiao Chen, Qiu Wang, Atilla P. Kiraly, Norbert Strobel, Mariappan S. Nadar:
Learning a multiscale patch-based representation for image denoising in X-RAY fluoroscopy. ICIP 2016: 2330-2334 - 2013
- [j3]Bob L. Sturm, Boris Mailhé, Mark D. Plumbley:
On Theorem 10 in "On Polar Polytopes and the Recovery of Sparse Representations" [Sep 07 3188-3195]. IEEE Trans. Inf. Theory 59(8): 5206-5209 (2013) - [c10]Boris Mailhé, Mark D. Plumbley:
Dictionary learning via projected maximal exploration. GlobalSIP 2013: 626 - [c9]Boris Mailhé, Bob L. Sturm, Mark D. Plumbley:
Behavior of greedy sparse representation algorithms on nested supports. ICASSP 2013: 5710-5714 - 2012
- [c8]Boris Mailhé, Mark D. Plumbley:
Dictionary Learning with Large Step Gradient Descent for Sparse Representations. LVA/ICA 2012: 231-238 - [c7]Boris Mailhé, Daniele Barchiesi, Mark D. Plumbley:
INK-SVD: Learning incoherent dictionaries for sparse representations. ICASSP 2012: 3573-3576 - 2011
- [j2]Boris Mailhé, Rémi Gribonval, Pierre Vandergheynst, Frédéric Bimbot:
Fast orthogonal sparse approximation algorithms over local dictionaries. Signal Process. 91(12): 2822-2835 (2011)
2000 – 2009
- 2009
- [c6]Boris Mailhé, Rémi Gribonval, Frédéric Bimbot, Mathieu Lemay, Pierre Vandergheynst, Jean-Marc Vesin:
Dictionary learning for the sparse modelling of atrial fibrillation in ECG signals. ICASSP 2009: 465-468 - [c5]Boris Mailhé, Rémi Gribonval, Frédéric Bimbot, Pierre Vandergheynst:
A low complexity Orthogonal Matching Pursuit for sparse signal approximation with shift-invariant dictionaries. ICASSP 2009: 3445-3448 - 2008
- [c4]Boris Mailhé, Sylvain Lesage, Rémi Gribonval, Frédéric Bimbot, Pierre Vandergheynst:
Shift-invariant dictionary learning for sparse representations: Extending K-SVD. EUSIPCO 2008: 1-5 - 2007
- [j1]Gianluca Monaci, Philippe Jost, Pierre Vandergheynst, Boris Mailhé, Sylvain Lesage, Rémi Gribonval:
Learning Multimodal Dictionaries. IEEE Trans. Image Process. 16(9): 2272-2283 (2007) - [c3]Rémi Gribonval, Boris Mailhé, Holger Rauhut, Karin Schnass, Pierre Vandergheynst:
Average Case Analysis of Multichannel Thresholding. ICASSP (2) 2007: 853-856 - 2006
- [c2]Gianluca Monaci, Philippe Jost, Pierre Vandergheynst, Boris Mailhé, Sylvain Lesage, Rémi Gribonval:
Learning Multi-modal Dictionaries: Application to Audiovisual Data. MRCS 2006: 538-545 - 2004
- [c1]Boris Mailhé, Henri Prade:
Updating of a Possibilistic Knowledge Base by Crisp or Fuzzy Transition Rules. KR 2004: 338-347
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
