检索结果-内蒙古大学图书馆

SAR image Despeckling Using Scale Mixtures of Gaussians in the Nonsubsampled Contourlet Domain

Chinese Journal of Electronics 2015年第1期24卷 205-211页

作者： CHANG Xia JIAO Licheng LIU Fang SHA Yuheng Institute of Image Processing and Understanding School of Mathematics and Information Science Beifang University of Nationalities Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education of China International Research Center for Intelligent Perception and Computation Xidian University School of Computer Science and Technology Xidian University

The edge and contour details in SAR images are important for subsequent processing tasks. The multiscale geometric analysis method — Nonsubsampled contourlet transform(NSCT) is able to capture the geometric information of SAR images effectively. Describing the aggregation behavior of the neighborhoods coefficients, the scale mixtures of Gaussians model has exhibited favorable performances. A novel SAR image despeckling method is presented by constructing the scale mixtures of Gaussians model of NSCT. This method models the SAR images using the multiscale and multidirection information in NSCT domain. The dependency relationship of NSCT neighborhoods coefficients are also taken into consideration in our model. The speckle noise coefficients are shrinkaged by statistical prior estimation based on SAR image model constructed. Experimental results demonstrate that our method is advantageous at directional information preservation and the speckle restraint.

关键词： Synthetic aperture radar(SAR) image despeckling Stationary wavelet transform Nonsubsampled contourlet transform Scale mixtures of Gaussians model.

来源：评论

学校读者我要写书评

暂无评论

Matrix flat splicing systems 11th

Matrix flat splicing systems

引用

11th International Conference on Bio-inspired Computing – Theories and Applications, BIC-TA 2016

作者： Ceterchi, Rodica Pan, Linqiang Song, Bosheng Subramanian, K.G. Faculty of Mathematics and Computer Science University of Bucharest 14 Academiei Street Bucharest010014 Romania School of Electric and Information Engineering Zhengzhou University of Light Industry ZhengzhouHenan450002 China Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China School of Automation Huazhong University of Science and Technology WuhanHubei430074 China Department of Mathematics Madras Christian College Chennai600059 India

ISBN: (纸本)9789811036101

In dealing with the problem of modelling DNA recombination, the operation of splicing on linear and circular strings of symbols was introduced. Inspired by splicing on circular strings, the operation of flat splicing on a pair of strings (u, v) was considered. This operation involves "cutting" u at a specified position and "inserting" v into it, with v having a pre-specified prefix as well as suffix defined by a flat splicing rule. In this work, we consider a well-known technique in formal language theory, known as "matrix of rules", and introduce matrix of flat splicing rules and thus define matrix flat splicing system (MFSS). Some results on the language generative power of MFSS are provided. An application of MFSS in the generation of chain code pictures is also pointed out. © Springer Nature Singapore Pte Ltd. 2016.

关键词： Formal languages

来源：评论

学校读者我要写书评

暂无评论

Memory efficient LDDMM for lung CT 1

引用

Lecture Notes in computer Science

作者： Polzin, Thomas Niethammer, Marc Heinrich, Mattias P. Handels, Heinz Modersitzki, Jan Institute of Mathematics and Image Computing University of Lübeck Lübeck Germany Department of Computer Science and Biomedical Research Imaging Center University of North Carolina at Chapel Hill Chapel Hill United States Institute of Medical Informatics University of Lübeck Lübeck Germany Fraunhofer MEVIS Lübeck Germany

ISBN: (数字)9783319467269

ISBN: (纸本)9783319467252

In this paper a novel Large Deformation Diffeomorphic Metric Mapping (LDDMM) scheme is presented which has significantly lower computational and memory demands than standard LDDMM but achieves the same accuracy. We exploit the smoothness of velocities and transformations by using a coarser discretization compared to the image resolution. This reduces required memory and accelerates numerical optimization as well as solution of transport equations. Accuracy is essentially unchanged as the mismatch of transformed moving and fixed image is incorporated into the model at high resolution. Reductions in memory consumption and runtime are demonstrated for registration of lung CT images. State-of-the-art accuracy is shown for the challenging DIRLab chronic obstructive pulmonary disease (COPD) lung CT data sets obtaining a mean landmark distance after registration of 1.03mm and the best average results so far. © Springer International Publishing AG 2016.

关键词： image resolution

来源：评论

学校读者我要写书评

暂无评论

A FRAMEWORK OF SINGLE-image DERAINING METHOD BASED ON ANALYSIS OF RAIN CHARACTERISTICS

A FRAMEWORK OF SINGLE-IMAGE DERAINING METHOD BASED ON ANALYS...

引用

IEEE International Conference on image processing

作者： Yinglong Wang Chen Chen Shuyuan Zhu Bing Zeng Institute of Image Processing School of Electronic Engineering University of Electronic Science and Technology of China Department of Electronic and Computer Engineering The Hong Kong University of Science and Technology

ISBN: (纸本)9781467399623

In this paper, we propose an algorithm to remove rain streaks from single color image. Firstly, the guided filter, cooperated with rain pixels detection are used to separate a color image into low-frequency and high-frequency parts so that most rain components exist in the high-frequency part. Then, we focus on the high-frequency part to extract the non-rain details according to the characteristics of the rain in which a dictionary learning method is used. Meanwhile, to enhance the quality of the rain-removed image, the proposed principal direction of an image patch (PDIP) and the sensitivity of variance of color channels (SVCC) are employed in our work to help extract more non-rain details. Compared with the state-of-the-art works, our proposed method can remove the rain (especially heavy rain) from color images more efficiently.

关键词： Rain removal Color channels Rain detection Dictionary learning rain color image High frequency image patch

来源：评论

学校读者我要写书评

暂无评论

Planck intermediate results. LVII. Joint Planck LFI and HFI data processing

arXiv

引用

arXiv 2020年

作者： Akrami, Y. Andersen, K.J. Ashdown, M. Baccigalupi, C. Ballardini, M. Banday, A.J. Barreiro, R.B. Bartolo, N. Basak, S. Benabed, K. Bernard, J.-P. Bersanelli, M. Bielewicz, P. Bond, J.R. Borrill, J. Burigana, C. Butler, R.C. Calabrese, E. Casaponsa, B. Chiang, H.C. Colombo, L.P.L. Combet, C. Crill, B.P. Cuttaia, F. de Bernardis, P. de Rosa, A. de Zotti, G. Delabrouille, J. Di Valentino, E. Diego, J.M. Doré, O. Douspis, M. Dupac, X. Eriksen, H.K. Fernandez-Cobos, R. Finelli, F. Frailis, M. Fraisse, A.A. Franceschi, E. Frolov, A. Galeotta, S. Galli, S. Ganga, K. Gerbino, M. Ghosh, T. González-Nuevo, J. Górski, K.M. Gruppuso, A. Gudmundsson, J.E. Handley, W. Helou, G. Herranz, D. Hildebrandt, S.R. Hivon, E. Huang, Z. Jaffe, A.H. Jones, W.C. Keihänen, E. Keskitalo, R. Kiiveri, K. Kim, J. Kisner, T.S. Krachmalnicoff, N. Kunz, M. Kurki-Suonio, H. Lasenby, A. Lattanzi, M. Lawrence, C.R. Le Jeune, M. Levrier, F. Liguori, M. Lilje, P.B. Lilley, M. Lindholm, V. López-Caniego, M. Lubin, P.M. Macías-Pérez, J.F. Maino, D. Mandolesi, N. Marcos-Caballero, A. Maris, M. Martin, P.G. Martínez-González, E. Matarrese, S. Mauri, N. McEwen, J.D. Meinhold, P.R. Mennella, A. Migliaccio, M. Mitra, S. Molinari, D. Montier, L. Morgante, G. Moss, A. Natoli, P. Paoletti, D. Partridge, B. Patanchon, G. Pearson, D. Pearson, T.J. Perrotta, F. Piacentini, F. Polenta, G. Rachen, J.P. Reinecke, M. Remazeilles, M. Renzi, A. Rocha, G. Rosset, C. Roudier, G. Rubiño-Martín, J.A. Ruiz-Granados, B. Salvati, L. Savelainen, M. Scott, D. Sirignano, C. Sirri, G. Spencer, L.D. Suur-Uski, A.-S. Svalheim, T.L. Tauber, J.A. Tavagnacco, D. Tenti, M. Terenzi, L. Thommesen, H. Toffolatti, L. Tomasi, M. Tristram, M. Trombetti, T. Valiviita, J. van Tent, B. Vielva, P. Villa, F. Vittorio, N. Wandelt, B.D. Wehus, I.K. Zacchei, A. Zonca, A. APC AstroParticule et Cosmologie Université Paris Diderot CNRS/IN2P3 CEA/lrfu Observatoire de Paris Sorbonne Paris Cité 10 rue Alice Domon et Léonie Duquet Paris Cedex 1375205 France African Institute for Mathematical Sciences 6-8 Melrose Road Muizenberg Cape Town South Africa Astrophysics Group Cavendish Laboratory University of Cambridge J J Thomson Avenue CambridgeCB3 0HE United Kingdom Astrophysics & Cosmology Research Unit School of Mathematics Statistics & Computer Science University of KwaZulu-Natal Westville Campus Private Bag X54001 Durban4000 South Africa CITA University of Toronto 60 St. George St. TorontoONM5S 3H8 Canada CNRS IRAP 9 Av. colonel Roche BP 44346 Toulouse cedex 4F-31028 France Cahill Center for Astronomy and Astrophysics California Institute of Technology PasadenaCA91125 United States California Institute of Technology PasadenaCA United States Computational Cosmology Center Lawrence Berkeley National Laboratory BerkeleyCA United States Département de Physique Théorique Université de Genève 24 Quai E. Ansermet Genève 41211 Switzerland Département de Physique École normale supérieure PSL Research University CNRS 24 rue Lhomond Paris75005 France La Laguna TenerifeE-38206 Spain Departamento de Física Universidad de Oviedo C/ Federico García Lorca 18 Oviedo Spain Department of Astrophysics IMAPP Radboud University P.O. Box 9010 Nijmegen6500 GL Netherlands Department of Physics & Astronomy University of British Columbia 6224 Agricultural Road VancouverBC Canada Department of Physics & Astronomy University of the Western Cape Cape Town7535 South Africa Department of Physics Gustaf Hällströmin katu 2a University of Helsinki Helsinki Finland Department of Physics Princeton University PrincetonNJ United States Department of Physics University of California Santa BarbaraCA United States Dipartimento di Fisica e Astronomia G. Galilei Università degli Studi di Padova via Marzolo 8 Padova35131 It

We present the NPIPE processing pipeline, which produces calibrated frequency maps in temperature and polarization from data from the Planck Low Frequency Instrument (LFI) and High Frequency Instrument (HFI) using high-performance computers. NPIPE represents a natural evolution of previous Planck analysis efforts, and combines some of the most powerful features of the separate LFI and HFI analysis pipelines. For example, following the LFI 2018 processing procedure, NPIPE uses foreground polarization priors during the calibration stage in order to break scanning-induced degeneracies. Similarly, NPIPE employs the HFI 2018 time-domain processing methodology to correct for bandpass mismatch at all frequencies. In addition, NPIPE introduces several improvements, including, but not limited to: inclusion of the 8 % of data collected during repointing manoeuvres;smoothing of the LFI reference load data streams;in-flight estimation of detector polarization parameters;and construction of maximally independent detector-set split maps. For component-separation purposes, important improvements include: maps that retain the CMB Solar dipole, allowing for high-precision relative calibration in higher-level analyses;well-defined single-detector maps, allowing for robust CO extraction;and HFI temperature maps between 217 and 857 GHz that are binned into 0.09 pixels (Nside = 4096), ensuring that the full angular information in the data is represented in the maps even at the highest Planck resolutions. The net effect of these improvements is lower levels of noise and systematics in both frequency and component maps at essentially all angular scales, as well as notably improved internal consistency between the various frequency channels. Based on the NPIPE maps, we present the first estimate of the Solar dipole determined through component separation across all nine Planck frequencies. The amplitude is (3366.6 ± 2.7) µK, consistent with, albeit slightly higher than, earlier estimates.

关键词： Cosmology

来源：评论

学校读者我要写书评

暂无评论

Consensus algorithms for biased labeling in crowdsourcing

引用

Information Sciences 2017年 382-383卷 254-273页

作者： Jing Zhang Victor S. Sheng Qianmu Li Jian Wu Xindong Wu School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing 210094 P. R. China Key Laboratory of Image and Video Understanding for Social Safety Nanjing University of Science and Technology Nanjing 210094 P. R. China Department of Computer Science University of Central Arkansas Conway AR 72035 USA Jiangsu Engineering Center of Network Monitoring Nanjing University of Information Science and Technology Nanjing 210044 P. R. China Institute of Intelligent Information Processing and Application Soochow University Suzhou 215006 P. R. China School of Computing and Informatics University of Louisiana at Lafayette LA 70504 USA

Although it has become an accepted lay view that when labeling objects through crowdsourcing systems, non-expert annotators often exhibit biases, this argument lacks sufficient evidential observation and systematic empirical study. This paper initially analyzes eight real-world datasets from different domains whose class labels were collected from crowdsourcing systems. Our analyses show that biased labeling is a systematic tendency for binary categorization; in other words, for a large number of annotators, their labeling qualities on the negative class (supposed to be the majority) are significantly greater than are those on the positive class (minority). Therefore, the paper empirically studies the performance of four existing EM-based consensus algorithms , DS, GLAD, RY, and ZenCrowd, on these datasets. Our investigation shows that all of these state-of-the-art algorithms ignore the potential bias characteristics of datasets and perform badly although they model the complexity of the systems. To address the issue of handling biased labeling, the paper further proposes a novel consensus algorithm, namely adaptive weighted majority voting (AWMV), based on the statistical difference between the labeling qualities of the two classes. AWMV utilizes the frequency of positive labels in the multiple noisy label set of each example to obtain a bias rate and then assigns weights derived from the bias rate to negative and positive labels. Comparison results among the five consensus algorithms (AWMV and the four existing) show that the proposed AWMV algorithm has the best overall performance. Finally, this paper notes some potential related topics for future study.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Phenotypic redshifts with self-organizing maps: A novel method to characterize redshift distributions of source galaxies for weak lensing

arXiv

引用

arXiv 2019年

作者： Buchs, R. Davis, C. Gruen, D. DeRose, J. Alarcon, A. Bernstein, G.M. Sánchez, C. Myles, J. Roodman, A. Allen, S. Amon, A. Choi, A. Masters, D.C. Miquel, R. Troxel, M.A. Wechsler, R.H. Abbott, T.M.C. Annis, J. Avila, S. Bechtol, K. Bridle, S.L. Brooks, D. Buckley-Geer, E. Burke, D.L. Carnero Rosell, A. Carrasco Kind, M. Carretero, J. Castander, F.J. Cawthon, R. D'Andrea, C.B. Da Costa, L.N. De Vicente, J. Desai, S. Diehl, H.T. Doel, P. DrlicaWagner, A. Eifler, T.F. Evrard, A.E. Flaugher, B. Fosalba, P. Frieman, J. García-Bellido, J. Gaztanaga, E. Gruendl, R.A. Gschwend, J. Gutierrez, G. Hartley, W.G. Hollowood, D.L. Honscheid, K. James, D.J. Kuehn, K. Kuropatkin, N. Lima, M. Lin, H. Maia, M.A.G. March, M. Marshall, J.L. Melchior, P. Menanteau, F. Ogando, R.L.C. Plazas, A.A. Rykoff, E.S. Sanchez, E. Scarpine, V. Serrano, S. Sevilla-Noarbe, I. Smith, M. Soares-Santos, M. Sobreira, F. Suchyta, E. Swanson, M.E.C. Tarle, G. Thomas, D. Vikram, V. SLAC National Accelerator Laboratory Menlo ParkCA94025 United States Kavli Institute for Particle Astrophysics & Cosmology Stanford University P. O. Box 2450 StanfordCA94305 United States École Polytechnique Fédérale de Lausanne Route Can-tonale Lausanne1015 Switzerland Institute of Science Technology and Policy ETH Zurich Universitätstrasse 41 Zurich8092 Switzerland Descartes Labs Inc. 100 N Guadelupe St Santa FeNM87501 United States Department of Physics Stanford University 382 Via Pueblo Mall StanfordCA94305 United States Barcelona08034 Spain Campus UAB Carrer de Can Magrans s/n Barcelona08193 Spain Department of Physics and Astronomy University of Pennsylvania PhiladelphiaPA19104 United States Center for Cosmology and Astro-Particle Physics Ohio State University ColumbusOH43210 United States Infrared Processing and Analysis Center PasadenaCA91125 United States Jet Propulsion Laboratory California Institute of Technology 4800 Oak Grove Dr. PasadenaCA91109 United States Institució Catalana de Recerca i Estudis Avançats Barcelona08010 Spain 08193 Spain Department of Physics Duke University DurhamNC27708 United States Cerro Tololo Inter-American Observatory National Optical Astronomy Observatory Casilla 603 La Serena Chile Fermi National Accelerator Laboratory P. O. Box 500 BataviaIL60510 United States Institute of Cosmology and Gravitation University of Portsmouth PortsmouthPO1 3FX United Kingdom LSST 933 North Cherry Avenue TucsonAZ85721 United States Physics Department 2320 Chamberlin Hall University of Wisconsin-Madison 1150 University Avenue MadisonWI53706 United States Jodrell Bank Center for Astrophysics School of Physics and Astronomy University of Manchester Oxford Road ManchesterM13 9PL United Kingdom Department of Physics & Astronomy University College London Gower Street LondonWC1E 6BT United Kingdom Madrid Spain Laboratório Interinstitucional de E-Astronomia - LIneA Rua Gal. José Cristino

Wide-field imaging surveys such as the Dark Energy Survey (DES) rely on coarse measurements of spectral energy distributions in a few filters to estimate the redshift distribution of source galaxies. In this regime, sample variance, shot noise, and selection effects limit the attainable accuracy of redshift calibration and thus of cosmological constraints. We present a new method to combine wide-field, few-filter measurements with catalogs from deep fields with additional filters and sufficiently low photometric noise to break degeneracies in photometric redshifts. The multi-band deep field is used as an intermediary between wide-field observations and accurate redshifts, greatly reducing sample variance, shot noise, and selection effects. Our implementation of the method uses self-organizing maps to group galaxies into phenotypes based on their observed fluxes, and is tested using a mock DES catalog created from N-body simulations. It yields a typical uncertainty on the mean redshift in each of five tomographic bins for an idealized simulation of the DES Year 3 weak-lensing tomographic analysis of σΔz= 0.007, which is a 60% improvement compared to the Year 1 analysis. Although the implementation of the method is tailored to DES, its formalism can be applied to other large photometric surveys with a similar observing strategy. Copyright © 2019, The Authors. All rights reserved.

关键词： Galaxies

来源：评论

学校读者我要写书评

暂无评论

DC coefficient estimation of intra-predicted residuals in high efficiency video coding

DC coefficient estimation of intra-predicted residuals in hi...

引用

IEEE Visual Communications and image processing (VCIP)

作者： Chen Chen Zexiang Miao Xiandong Meng Shuyuan Zhu Bing Zeng Department of Electronic & Computer Engineering The Hong Kong University of Science and Technology Hong Kong China Institute of Image Processing University of Electronic Science and Technology of China Chengdu Sichuan China

ISBN: (纸本)9781509053179

This paper proposes a DC coefficient estimation algorithm for intra-predicted residual blocks in the High Efficiency Video Coding (HEVC) standard. Discarding the DC coefficient in the current coding block leads to a substantial bit-saving but produces at the same time strong discontinuities between this block and its neighboring reconstructed blocks. To overcome this problem, we propose an estimation algorithm for the DC coefficient, which solves an optimal offset in a closed-form in the pixel domain to recover the corresponding block edges. Test results show that our algorithm achieves 1.0% and 1.4% BD-rate reduction on average for luma and chroma as compared with HM-16.6, respectively, when the sign-bit-hiding (SBH) technique is disabled. When SDH is set on, namely under the common test condition (CTC), the BD-rate reduction drops slightly to 0.7% and 1.1% for luma and chroma, respectively. In the meantime, the test results show that both encoding time and decoding time increase only slightly (about 10%, without any special optimization on programming our proposed algorithm).

关键词： Estimation image reconstruction Encoding Transforms Video coding Decoding Quantization (signal)

来源：评论

学校读者我要写书评

暂无评论

New framework for decomposing a polygon with zero or more holes

引用

Open Cybernetics and Systemics Journal 2015年第1期9卷 390-405页

作者： Hongguang, Zhou Guozhao, Wang Institute of Computer Graphics and Image Processing Department of Mathematics Zhejiang University Hangzhou Zhejiang China

In this paper, we propose a unified framework for decomposition of a polygon with or without holes, enlightened by approximate convex decomposition. We transform target polygon containing holes into the polygon without holes by merging holes into external boundary, thus only need to partition the polygon without holes. Several constraints are enforced to ensure generate more visually meaningful decompositions, more elegant final components than that of other methods. Moreover, we estimate tolerance δ from geometry information of target polygon to obtain a naturally visual decomposition, a polished hierarchical representation. Our approach computes a decomposition of a polygon, containing zero or more holes, with n vertices and r notches in O(nr) time. In contrast, exact convex decomposition is NP-hard, or if the polygon has no holes, takes much more time. Many experimental results and applications are presented to show the superiority, applicability and flexibility of our approach. © Hongguang and Guozhao;Licensee Bentham Open.

关键词： Decomposition

来源：评论

学校读者我要写书评

暂无评论

Author Correction: The challenge of mapping the human connectome based on diffusion tractography

引用

Nature communications 2019年第1期10卷 5059页

作者： Klaus H Maier-Hein Peter F Neher Jean-Christophe Houde Marc-Alexandre Côté Eleftherios Garyfallidis Jidan Zhong Maxime Chamberland Fang-Cheng Yeh Ying-Chia Lin Qing Ji Wilburn E Reddick John O Glass David Qixiang Chen Yuanjing Feng Chengfeng Gao Ye Wu Jieyan Ma Renjie He Qiang Li Carl-Fredrik Westin Samuel Deslauriers-Gauthier J Omar Ocegueda González Michael Paquette Samuel St-Jean Gabriel Girard François Rheault Jasmeen Sidhu Chantal M W Tax Fenghua Guo Hamed Y Mesri Szabolcs Dávid Martijn Froeling Anneriet M Heemskerk Alexander Leemans Arnaud Boré Basile Pinsard Christophe Bedetti Matthieu Desrosiers Simona Brambati Julien Doyon Alessia Sarica Roberta Vasta Antonio Cerasa Aldo Quattrone Jason Yeatman Ali R Khan Wes Hodges Simon Alexander David Romascano Muhamed Barakovic Anna Auría Oscar Esteban Alia Lemkaddem Jean-Philippe Thiran H Ertan Cetingul Benjamin L Odry Boris Mailhe Mariappan S Nadar Fabrizio Pizzagalli Gautam Prasad Julio E Villalon-Reina Justin Galvis Paul M Thompson Francisco De Santiago Requejo Pedro Luque Laguna Luis Miguel Lacerda Rachel Barrett Flavio Dell'Acqua Marco Catani Laurent Petit Emmanuel Caruyer Alessandro Daducci Tim B Dyrby Tim Holland-Letz Claus C Hilgetag Bram Stieltjes Maxime Descoteaux Division of Medical Image Computing German Cancer Research Center (DKFZ) Heidelberg 69120 Germany. k.maier-hein@dkfz.de. Division of Medical Image Computing German Cancer Research Center (DKFZ) Heidelberg 69120 Germany. Sherbrooke Connectivity Imaging Lab (SCIL) Université de Sherbrooke Sherbrooke QC J1K 0A5 QC Canada. Department of Intelligent Systems Engineering School of Informatics and Computing Indiana University Bloomington IN 47408 USA. Krembil Research Institute University Health Network Toronto Canada M5G 2C4. Department of Neurological Surgery University of Pittsburgh School of Medicine Pittsburgh PA 15213 USA. IMT-Institute for Advanced Studies Lucca 55100 Italy. Department of Diagnostic Imaging St. Jude Children's Research Hospital Memphis TN 38105 USA. University of Toronto Institute of Medical Science Toronto Canada M5S 1A8. Institute of Information Processing and Automation Zhejiang University of Technology Hangzhou 310023 Zhejiang China. United Imaging Healthcare Co Shanghai 201807 China. Shanghai Advanced Research Institute Shanghai 201210 China. Laboratory of Mathematics in Imaging Harvard Medical School Boston MA 02215 USA. Center for Research in Mathematics Guanajuato 36023 Mexico. PROVIDI Lab Image Sciences Institute University Medical Center Utrecht Utrecht 3508 The Netherlands. Cardiff University Brain Research Imaging Centre School of Psychology Cardiff University Maindy Road Cardiff CF24 4HQ UK. Department of Radiology University Medical Center Utrecht Utrecht 3508 The Netherlands. Centre de recherche institut universitaire de geriatrie de Montreal (CRIUGM) Université de Montréal Montreal QC Canada H3W 1W5. Sorbonne Universités UPMC Univ Paris 06 CNRS INSERM Laboratoire d'Imagerie Biomédicale (LIB) 75013 Paris France. Center for Advanced Research in Sleep Medicine Hôpital du Sacré-Coeur de Montréal Montreal Canada H4J 1C5. Neuroimaging Unit Institute of Bioimaging and Molecular Physiology (IBFM) Nat

An amendment to this paper has been published and can be accessed via a link at the top of the paper.

关键词：

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：