Peter FuMing Hu

Prof. Dr. Peter FuMing Hu


Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 March 2023 in Journal of Clinical Investigation
Verified
Journal Article
Open access
PDF file
WDWeihua Ding
Weihua Ding
LFLukas Fischer
Lukas Fischer
QCQian Chen
Qian Chen
ZLZiyi Li
Ziyi Li
LYLiuyue Yang
Liuyue Yang
SSShiqian Shen
Shiqian Shen
Cortical neural dynamics mediate information processing for the cerebral cortex, implicated in fundamental biological processes, such as vision and olfaction, in addition to neurological and psychiatric diseases. Spontaneous pain is a key feature of human neuropathic pain. Whether spontaneous pain pushes cortical network into an aberrant state, and if so, whether it can be brought back to a ‘normal’ operating range to ameliorate pain are unknown. Using a clinically relevant mouse model of neuropathic pain with spontaneous pain-like behavior, we report that orofacial spontaneous pain activated a specific area within the primary somatosensory cortex (S1), displaying synchronized neural dynamics revealed by intravital two-photon calcium imaging. This synchronization was underpinned by local GABAergic interneuron hypoactivity. Pain-induced cortical synchronization could be attenuated by manipulating local S1 networks or clinically effective pain therapies. Specifically, both chemogenetic inhibition of pain-related c-Fos-expressing neurons, and selective activation of GABAergic interneurons, significantly attenuated S1 synchronization. Clinically effective pain therapies including carbamazepine and nerve root decompression could also dampen S1 synchronization. More importantly, restoring a ‘normal’ range of neural dynamics, through attenuating pain-induced S1 synchronization, alleviated pain-like behavior. These results suggest spontaneous pain pushes S1 regional network into a synchronized state, whereas reversal of this synchronization alleviates pain.

1 June 2019 in Critical Care Medicine
Verified
Journal Article
Open access
SYShiming Yang
Shiming Yang
LSLynn G. Stansbury
Lynn G. Stansbury
PRPeter Rock
Peter Rock
TSThomas Scalea
Thomas Scalea
PHPeter FuMing Hu
Peter FuMing Hu
Objectives: Modern critical care amasses unprecedented amounts of clinical data—so called “big data”—on a minute-by-minute basis. Innovative processing of these data has the potential to revolutionize clinical prognostics and decision support in the care of the critically ill but also forces clinicians to depend on new and complex tools of which they may have limited understanding and over which they have little control. This concise review aims to provide bedside clinicians with ways to think about common methods being used to extract information from clinical big datasets and to judge the quality and utility of that information. Data Sources: We searched the free-access search engines PubMed and Google Scholar using the MeSH terms “big data”, “prediction”, and “intensive care” with iterations of a range of additional potentially associated factors, along with published bibliographies, to find papers suggesting illustration of key points in the structuring and analysis of clinical “big data,” with special focus on outcomes prediction and major clinical concerns in critical care. Study Selection: Three reviewers independently screened preliminary citation lists. Data Extraction: Summary data were tabulated for review. Data Synthesis: To date, most relevant big data research has focused on development of and attempts to validate patient outcome scoring systems and has yet to fully make use of the potential for automation and novel uses of continuous data streams such as those available from clinical care monitoring devices. Conclusions: Realizing the potential for big data to improve critical care patient outcomes will require unprecedented team building across disparate competencies. It will also require clinicians to develop statistical awareness and thinking as yet another critical judgment skill they bring to their patients’ bedsides and to the array of evidence presented to them about their patients over the course of care.

25 December 2023 in IEEE Transactions on Geoscience and Remote Sensing
Verified
Journal Article
Closed access
Chein-I ChangChein-I Chang
Chein-I Chang
CLChien-Yu Lin
Chien-Yu Lin
PHPeter FuMing Hu
Peter FuMing Hu
This paper investigates four issues, BKG suppression (BS), anomaly detectability, noise effect, and inter-band correlation reduction (IBCR), which have significant impacts on its performance. Despite that a recently developed effective anomaly space (EAS) was designed to use data sphering (DS) to remove the 2nd order-data statistics characterized BKG, enhance anomaly detectability and reduce noise effect, it does not address the IBCR issue. To cope with this issue, this paper introduces band sampling (BSam) into EAS to reduce IBCR as well as further suppress BKG more effectively. By implementing EAS in conjunction with BSam (EAS-BSam) these four issues can be resolved all together for any arbitrary anomaly detector. It first modifies iterative spectral-spatial hyperspectral anomaly detection (ISSHAD) to develop a new variant of ISSHAD, called iterative spectral-spatial maximal map (ISSMax) and then generalizes ISSMax to EAS-ISSMax which further enhances anomaly detectability and noise removal. Finally, EAS-BSam is implemented to reduce IBCR. As a result, combining EAS, BSam and ISSMax yields four versions, EAS-BSam, EAS-ISSMax, BSam-SSMAX and EAS-BSam-SSMax. Such integration presents a great challenge because all these four versions are derived from different aspects, iterative spectral-spatial feedback process, compressive sensing and low rank and sparse matrix decomposition. Experiments demonstrate that EAS-BSam and EAS-BSam-SSMax show its superiority to ISSHAD and many current existing hyperspectral anomaly detection (HAD) methods.

19 February 2024 in IEEE Transactions on Geoscience and Remote Sensing
Verified
Journal Article
Closed access
Chein-I ChangChein-I Chang
Chein-I Chang
CLChia-Chen Liang
Chia-Chen Liang
PHPeter FuMing Hu
Peter FuMing Hu
Gaussian pyramid (GP) is a commonly used image coding technique which encodes an image as a pyramid which is stacked by a set of images with Gaussian window-reduced sizes and multiple spatial resolutions. Associated with GP a Laplacian pyramid (LP) can be also constructed to represent differential images between images in two consecutive layers of GP. Such resulting Gaussian-Laplacian pyramid (GLP) performs data compression in a lossless and lossy manner. A convolutional neural network (CNN) consists of a series of layers concatenated in a feedforward manner where each layer has a convolutional sublayer (CL) and a pooling sublayer (PL). Interestingly, each layer implemented by CL and PL in a CNN can be realized by a single layer in GP in the sense that CL and PL can be carried out by a low-pass Gaussian filter operated as a Gaussian kernel in a single layer of GP. This paper develops a new approach to hyperspectral image classification (HSIC), called Gaussian-Laplacian pyramid network (GLPN) which uses not only GP to realize CNN, but also LP to capture differential information between two consecutive layers that CNN cannot. Furthermore, by incorporating an iterative process into GLPN we can derive an iterative GLPN (IGLPN) that can be considered as a companion of a recently developed iterative random training sampling CNN (IRTS-CNN) by replacing CNN with GLPN. Since GLPN can realize CNN in a better way, it is expected that IGLPN will perform better than IRTS-CNN and also significantly reduce computational efficiency compared to IRTS-CNN.

19 July 2023 in IEEE Transactions on Geoscience and Remote Sensing
Verified
Journal Article
Closed access
Chein-I ChangChein-I Chang
Chein-I Chang
YKYi-Mei Kuo
Yi-Mei Kuo
PHPeter FuMing Hu
Peter FuMing Hu
Due to significant inter-band correlation resulting from use of hundreds of contiguous spectral bands, band selection (BS) is one of most widely used methods to reduce data dimensionality for band redundancy removal. A challenge for BS is how to design an effective criterion which can select bands with preserving crucial spectral information, while also avoiding selecting highly correlated bands. Information theory turns out to be one of best means to address such issue in terms of information redundancy, specifically, the rate distortion function (RDF) of Shannon’s 3 rd noisy source coding (or joint source and channel coding) theorem, which has been widely used in image compression/coding. This paper presents a novel unsupervised RDF-based band subset selection (RDFBSS) for hyperspectral image classification (HSIC). To accomplish this goal, a new concept of the area under an RDF curve, A RDF similar to the area under a receiver operating characteristic (ROC), A z defined in hyperspectral target detection is coined and defined as a criterion for BSS. Since BSS generally requires an exhaustive search for an optimal band subset, two iterative algorithms similar to sequential (SQ) N-FINDR and successive (SC) N-FINDR for finding endmembers, called sequential (SQ) RDFBSS and successive (SC) RDFBSS, can be derived and coupled with Ardf as a criterion to find optimal band subsets. The experimental results demonstrate that RDFBSS is indeed a very effective BS method to find best possible band subsets and also performs better than most recent BS methods.

1 December 2012
Verified
Conference Paper
Closed access
SYShiming Yang
Shiming Yang
KKKonstantinos Kalpakis
Konstantinos Kalpakis
CMColin F. Mackenzie
Colin F. Mackenzie
LSLynn G. Stansbury
Lynn G. Stansbury
DSDeborah M. Stein
Deborah M. Stein
PHPeter FuMing Hu
Peter FuMing Hu
Continuous, automated, electronic patient vital signs data are important to physicians in evaluating traumatic brain injury (TBI) patients' physiological status and reaching timely decisions for therapeutic interventions. However, missing values in the medical data streams hinder applying many standard statistical or machine learning algorithms and result in losing some episodes of clinical importance. In this paper, we present a novel approach to filling missing values in streams of vital signs data. We construct sequences of Hankel matrices from vital signs data streams, find that these matrices exhibit low-rank, and utilize low-rank matrix completion methods from compressible sensing to fill in the missing data. We demonstrate that our approach always substantially outperforms other popular fill-in methods, like k-nearest-neighbors and expectation maximization. Further, we show that our approach recovers thousands of simulated missing data for intracranial pressure, a critical stream of measurements for guiding clinical interventions and monitoring traumatic brain injuries.