RESUMEN
We demonstrate that isomorphically mapping gray-level medical image matrices onto energy spaces underlying the framework of fast data density functional transform (fDDFT) can achieve the unsupervised recognition of lesion morphology. By introducing the architecture of geometric deep learning and metrics of graph neural networks, gridized density functionals of the fDDFT establish an unsupervised feature-aware mechanism with global convolutional kernels to extract the most likely lesion boundaries and produce lesion segmentation. An AutoEncoder-assisted module reduces the computational complexity from [Formula: see text] to [Formula: see text], thus efficiently speeding up global convolutional operations. We validate their performance utilizing various open-access datasets and discuss limitations. The inference time of each object in large three-dimensional datasets is 1.76 s on average. The proposed gridized density functionals have activation capability synergized with gradient ascent operations, hence can be modularized and embedded in pipelines of modern deep neural networks. Algorithms of geometric stability and similarity convergence also raise the accuracy of unsupervised recognition and segmentation of lesion images. Their performance achieves the standard requirement for conventional deep neural networks; the median dice score is higher than 0.75. The experiment shows that the synergy of fDDFT and a naïve neural network improves the training and inference time by 58% and 51%, respectively, and the dice score raises to 0.9415. This advantage facilitates fast computational modeling in interdisciplinary applications and clinical investigation.
Asunto(s)
Neoplasias Encefálicas , Aprendizaje Profundo , Neoplasias Encefálicas/clasificación , Neoplasias Encefálicas/patología , Humanos , Redes Neurales de la Computación , Reconocimiento de Normas Patrones Automatizadas , Diagnóstico por Imagen , Conjuntos de Datos como AsuntoRESUMEN
Fall accidents can cause severe impacts on the physical health and the quality of life of those who suffer limb diseases or injuries, the elderly, and their caregivers. Moreover, the later the accident is discovered, the lower the chance of recovery of the injured one. In order to detect accidents earlier, we propose a data-driven human fall detection framework. By combining the sensing mechanism of a commercialized webcam and an ultrasonic sensor array, we develop a probability model for automatic human fall monitoring. The webcam and ultrasonic array respectively collect the transverse and longitudinal time-series signals from a moving subject, and then these signals are assembled as a three-dimensional (3D) movement trajectory map. We also use two different detection-tracking algorithms for recognizing the tracked subjects. The mean height of the subjects is 164.2 ± 12 cm. Based on the data density functional theory (DDFT), we use the 3D motion data to estimate the cluster numbers and their cluster boundaries. We also employ the Gaussian mixture model as the DDFT kernel. Then, we utilize those features to build a probabilistic model of human falling. The model visually exhibits three possible states of human motions: normal motion, transition, and falling. The acceptable detection accuracy and the small model size reveals the feasibility of the proposed hybridized platform. The time from starting the alarm to an actual fall is on average about 0.7 s in our platform. The proposed sensing mechanisms offer 90% accuracy, 90% sensitivity, and 95% precision in the data validation. Then these vital results validate that the proposed framework has comparable performance to the contemporary methods.
RESUMEN
Nowadays, deep learning methods with high structural complexity and flexibility inevitably lean on the computational capability of the hardware. A platform with high-performance GPUs and large amounts of memory could support neural networks having large numbers of layers and kernels. However, naively pursuing high-cost hardware would probably drag the technical development of deep learning methods. In the article, we thus establish a new preprocessing method to reduce the computational complexity of the neural networks. Inspired by the band theory of solids in physics, we map the image space into a noninteraction physical system isomorphically and then treat image voxels as particle-like clusters. Then, we reconstruct the Fermi-Dirac distribution to be a correction function for the normalization of the voxel intensity and as a filter of insignificant cluster components. The filtered clusters at the circumstance can delineate the morphological heterogeneity of the image voxels. We used the BraTS 2019 datasets and the dimensional fusion U-net for the algorithmic validation, and the proposed Fermi-Dirac correction function exhibited comparable performance to other employed preprocessing methods. By comparing to the conventional z-score normalization function and the Gamma correction function, the proposed algorithm can save at least 38% of computational time cost under a low-cost hardware architecture. Even though the correction function of global histogram equalization has the lowest computational time among the employed correction functions, the proposed Fermi-Dirac correction function exhibits better capabilities of image augmentation and segmentation.