Search

Purpose: To propose and validate a meta-learning approach for detecting retinal vein occlusion (RVO) from multimodal images with only a few samples., Methods: In this cross-sectional study, we formulate the problem as meta-learning. The meta-training dataset consists of 1254 color fundus (CF) images from 39 different fundus diseases. Two meta-testing datasets include a public domain dataset and an independent dataset from Kandze Prefecture People's Hospital. The proposed meta-learning models comprise two modules: the feature extraction networks and the prototypical networks (PNs). We use two deep learning models (the ResNet and the Contrastive Language-Image Pre-Training networks [CLIP]) for feature extraction. We evaluate the performance of the algorithms using accuracy, area under the receiver operating characteristic curve (AUCROC), F1-score, and recall., Results: CLIP-based PNs outperform across all meta-testing datasets. For the public APTOS dataset, meta-learning algorithms achieve good results with an accuracy of 86.06% and an AUCROC of 0.87 with only 16 training images. In the hospital datasets, meta-learning algorithms show excellent diagnostic capability for detecting RVO with a very low number of shots (AUCROC above 0.99 for n = 4, 8, and 16, respectively). Notably, even though the meta-training dataset does not include fluorescein angiography (FA) images, meta-learning algorithms also have excellent diagnostic capability for detecting RVO from images with a different modality (AUCROC above 0.93 for n = 4, 8, and 16, respectively)., Conclusions: The proposed meta-learning models excel in detecting RVO, not only on CF images but also on FA images from a different imaging modality., Translational Relevance: The proposed meta-learning models could be useful in automatically detecting RVO on CF and FA images.

This article studies the passive tracking problem of a wearable exoskeleton for lower limb rehabilitation therapy in the face of unmodeled dynamics, interactive friction, disturbance, prescribed performance constraints, and actuator faults. Adaptive neural networks and a smooth performance function are incorporated to establish a novel fault-tolerant tracking scheme, which can not only compensate for the nonlinear uncertainties and disturbance, but also handle the actuator fault with guaranteed tracking performance. A state feedback controller is presented by using the full state information and an output feedback controller is developed when the angular velocity is unavailable. The differential explosion issue of the backstepping technique is resolved by constructing a first-order filter and the unmeasurable velocity is estimated by a nonlinear observer. Semiglobal uniform boundedness stabilities of the exoskeleton system are proved via the Lyapunov direct method. The tracking performances of the designed control approaches are tested by comparative simulations., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2024 ISA. Published by Elsevier Ltd. All rights reserved.)

Recently considerable advances have been achieved in the incomplete multi-view clustering (IMC) research. However, the current IMC works are often faced with three challenging issues. First, they mostly lack the ability to recover the nonlinear subspace structures in the multiple kernel spaces. Second, they usually neglect the high-order relationship in multiple representations. Third, they often have two or even more hyper-parameters and may not be practical for some real-world applications. To tackle these issues, we present a Tensorized Incomplete Multi-view Kernel Subspace Clustering (TIMKSC) approach. Specifically, by incorporating the kernel learning technique into an incomplete subspace clustering framework, our approach can robustly explore the latent subspace structure hidden in multiple views. Furthermore, we impute the incomplete kernel matrices and learn the low-rank tensor representations in a mutual enhancement manner. Notably, our approach can discover the underlying relationship among the observed and missing samples while capturing the high-order correlation to assist subspace clustering. To solve the proposed optimization model, we design a three-step algorithm to efficiently minimize the unified objective function, which only involves one hyper-parameter that requires tuning. Experiments on various benchmark datasets demonstrate the superiority of our approach. The source code and datasets are available at: https://www.researchgate.net/publication/381828300_TIMKSC_20240629., Competing Interests: Declaration of competing interest The manuscript, or part of it, has neither been published nor is currently under consideration for publication by any other journal. All authors have read and approved the content. No disclosure, ethical or legal conflicts and no competing interests exist in this study. For the manuscript, there is not any potential financial or substantive conflict. We hope that it is in accordance with your publishing regulations and under consideration for publication once got approved., (Copyright © 2024. Published by Elsevier Ltd.)

The rapid and accurate diagnosis of cancer is an important topic in clinical medicine. In the present work, an innovative method based on laser-induced breakdown spectroscopy (LIBS) combined with machine learning was developed to distinguish and classify different tumor cell lines. The LIBS spectra of cells were first acquired. Then the spectral pre-processing was performed as well as detailed optimization to improve the classification accuracy. After that, the convolutional neural network (CNN), support vector machine (SVM), and K-nearest neighbors were further compared for the optimized classification ability of tumor cells. Both the CNN algorithm and SVM algorithm have achieved impressive discrimination performances for tumor cells distinguishing, with an accuracy of 97.72%. The results show that the heterogeneity of elements in tumor cells plays an important role in distinguishing the cells. It also means that the LIBS technique can be used as a fast classification method for classifying tumor cells., (© 2023 Wiley-VCH GmbH.)

Objective and automatic clinical discrimination of normal and necrotic sites of small intestinal tissue remains challenging. In this study, hyperspectral imaging (HSI) and unsupervised classification techniques were used to distinguish normal and necrotic sites of small intestinal tissues. Small intestinal tissue hyperspectral images of eight Japanese large-eared white rabbits were acquired using a visible near-infrared hyperspectral camera, and K-means and density peaks (DP) clustering algorithms were used to differentiate between normal and necrotic tissue. The three cases in this study showed that the average clustering purity of the DP clustering algorithm reached 92.07% when the two band combinations of 500-622 and 700-858 nm were selected. The results of this study suggest that HSI and DP clustering can assist physicians in distinguishing between normal and necrotic sites in the small intestine in vivo., (© 2023 Wiley-VCH GmbH.)

Endoscopic medical imaging in complex curved intestinal structures are prone to uneven illumination, low contrast and lack of texture information. These problems may lead to diagnostic challenges. This paper described the first supervised deep learning based image fusion framework to enable the polyp region highlight through a global image enhancement and a local region of interest (ROI) with paired supervision. Firstly, we conducted a dual attention based network in global image enhancement. The Detail Attention Maps was used to preserve more image details and the Luminance Attention Maps was used to adjust the global illumination of the image. Secondly, we adopted the advanced polyp segmentation network ACSNet to obtain the accurate mask image of lesion region in local ROI acquisition. Finally, a new image fusion strategy was proposed to realize the local enhancement effect of polyp image. Experimental results show that our method can highlight the local details of the lesion area better and reach the optimal comprehensive performance with comparing with 16 traditional and state-of-the-art enhancement algorithms. And 8 doctors and 12 medical students were asked to evaluate our method for assisting clinical diagnosis and treatment effectively. Furthermore, the first paired image dataset LHI was constructed, which will be made available as an open source to research communities., Competing Interests: Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2023 Elsevier Ltd. All rights reserved.)

We present a molecular geometry optimization algorithm based on the gradient-enhanced universal kriging (GEUK) formalism with ab initio prior mean functions, which incorporates prior physical knowledge to surrogate-based optimization. In this formalism, we have demonstrated the advantage of allowing the prior mean functions to be adaptive during geometry optimization over a pre-fixed choice of prior functions. Our implementation is general and flexible in two senses. First, the optimizations on the surrogate surface can be in both Cartesian coordinates and curvilinear coordinates. We explore four representative curvilinear coordinates in this work, including the redundant Coulombic coordinates, the redundant internal coordinates, the non-redundant delocalized internal coordinates, and the non-redundant hybrid delocalized internal Z-matrix coordinates. We show that our GEUK optimizer accelerates geometry optimization as compared to conventional non-surrogate-based optimizers in internal coordinates. We further showcase the power of the GEUK with on-the-fly adaptive priors for efficient optimizations of challenging molecules (Criegee intermediates) with a high-accuracy electronic structure method (the coupled-cluster method). Second, we present the usage of internal coordinates under the complete curvilinear scheme. A complete curvilinear scheme performs both surrogate potential-energy surface (PES) fitting and structure optimization entirely in the curvilinear coordinates. Our benchmark indicates that the complete curvilinear scheme significantly reduces the cost of structure minimization on the surrogate compared to the incomplete curvilinear scheme, which fits the surrogate PES in curvilinear coordinates partially and optimizes a structure in Cartesian coordinates through curvilinear coordinates via the chain rule.

Gaussian process (GP) regression has been recently developed as an effective method in molecular geometry optimization. The prior mean function is one of the crucial parts of the GP. We design and validate two types of physically inspired prior mean functions: force-field-based priors and posterior-type priors. In this work, we implement a dual-level training (DLT) optimizer for the posterior-type priors. The DLT optimizers can be considered as a class of optimization algorithms that belong to the delta-machine learning paradigm but with several major differences compared to the previously proposed algorithms in the same paradigm. In the first level of the DLT, we incorporate the classical mechanical descriptions of the equilibrium geometries into the prior function, which enhances the performance of the GP optimizer as compared to the one using a constant (or zero) prior. In the second level, we utilize the surrogate potential energy surfaces (PESs), which incorporate the physics learned in the first-level training, as the prior function to refine the model performance further. We find that the force-field-based priors and posterior-type priors reduce the overall optimization steps by a factor of 2-3 when compared to the limited-memory Broyden-Fletcher-Goldfarb-Shanno (L-BFGS) optimizer as well as the constant-prior GP optimizer proposed in previous works. We also demonstrate the potential of recovering the real PESs with GP with a force-field prior. This work shows the importance of including domain knowledge as an ingredient in the GP, which offers a potentially robust learning model for molecular geometry optimization and for exploring molecular PESs.

Currently, the connectivity calculation of complex pipeline networks is mostly simplified or ignores the influence of nodes such as elbows and tees on the connectivity reliability of the entire network. Historical earthquake damage shows that the seismic performance of municipal buried pipelines depends on the ability of nodes and interfaces to resist deformation. The influence of node reliability on network connectivity under reciprocal loading is a key issue to be addressed. Therefore, based on the general connectivity probabilistic analysis algorithm, this paper embeds the reliability of nodes into the reliability of edges, and derives a more detailed and comprehensive on-intersecting minimum path recursive decomposition algorithm considering elbows, tees, and other nodes; then, based on the reliability calculation theory of various pipeline components, the reliability of various nodes in different soil is calculated using finite element numerical simulation; finally, the reliability of a small simple pipeline network and a large complex pipeline network are used as examples to reveal the importance of considering nodes in the connectivity calculation of pipeline network. The reliability of the network system decreases significantly after considering the nodes such as elbows and tees. The damage of one node usually causes the failure of the whole pipes of the path. The damage probability is greater in the area with dense elbow and tee nodes. In this study, all types of nodes that are more prone to damage are considered in detail in the calculation. As a result, the proposed algorithm has been improved in computational accuracy, which lays the foundation for further accurate calculation of pipeline network connectivity., Competing Interests: The authors have declared that no competing interests exist.

Multiview subspace clustering (MVSC) is a recently emerging technique that aims to discover the underlying subspace in multiview data and thereby cluster the data based on the learned subspace. Though quite a few MVSC methods have been proposed in recent years, most of them cannot explicitly preserve the locality in the learned subspaces and also neglect the subspacewise grouping effect, which restricts their ability of multiview subspace learning. To address this, in this article, we propose a novel MVSC with grouping effect (MvSCGE) approach. Particularly, our approach simultaneously learns the multiple subspace representations for multiple views with smooth regularization, and then exploits the subspacewise grouping effect in these learned subspaces by means of a unified optimization framework. Meanwhile, the proposed approach is able to ensure the cross-view consistency and learn a consistent cluster indicator matrix for the final clustering results. Extensive experiments on several benchmark datasets have been conducted to validate the superiority of the proposed approach.

The copyright problem of digital products is becoming more and more prominent. In this case, digital watermarking technology has attracted the attention of many experts and scholars in the field of information security. Among the proposed technologies, zero-watermarking technology has been favored greatly with its excellent imperceptibility. In this paper, a novel robust audio zero-watermarking scheme is designed by applying non-negative matrix decomposition algorithm to zero-watermarking technology. Firstly, the proposed scheme divides the input audio signal into fixed frames, then applies fast Fourier transform(FFT) and non-negative matrix factorization(NMF) algorithm to extract the feature vector of the original audio signal. Finally, XOR the feature vector and the digital watermark sequence to achieve the embedding of zero-watermarking. The experimental results show that the proposed scheme performs more effectively in resisting common and frame-desynchronization attacks than the existing zero-watermarking schemes., Competing Interests: The authors have declared that no competing interests exist.

Interactive genetic algorithm (IGA) is an effective way to help users with product design optimization. However, in this process, users need to evaluate the fitness of all individuals in each generation. It will cause users' fatigue when users cannot find satisfactory products after multi-generation evaluations. To solve this problem, an improved interactive genetic algorithm (IGA-KDTGIM) is proposed, which combines K-dimensional tree surrogate model and a graphic interaction mechanism. In this algorithm, the K-dimensional tree surrogate model is built on the basis of users' historical evaluation information to assist the user's evaluation, so as to reduce the times of users' evaluation. At the same time, users are allowed to interact with the graphic interface to adjust the shape of the individual, so as to increase users' creation fun and to make the evolution direction of the population conform to users' expectations. The IGA-KDTGIM is applied to the 3D vase design system and independently experimented with IGA, IGA-KDT, and IGA-GIM, respectively. The average fitness, maximum average fitness, and evaluation times of statistical data were compared and analyzed. Compared with traditional IGA, the number of evaluations required by users decreased by 60.0%, and the average fitness of the population increased by 15.0%. The results show that this method can reduce the users' operation fatigue and improve the ability of finding satisfactory solutions to a certain extent., Competing Interests: The authors declare that they have no conflicts of interest., (Copyright © 2022 Dongbo Huang et al.)

Background and Objective: A deep unsupervised endoscopic image enhancement method is proposed based on multi-image fusion to achieve high quality endoscope images from poorly illuminated, low contrast and color deviated images through an unsupervised mapping and deep learning network without the need for ground truth., Methods: Firstly, three image enhancement methods are used to process original endoscopic images to obtain three derived images, which are then transformed into HSI color space. Secondly, a deep unsupervised multi-image fusion network (DerivedFuse) is proposed to extract and fuse features of the derived images accurately by utilizing a new no-reference quality metric as loss function. I-channel images of the three derived images are inputted into the DerivedFuse network to enhance the intensity component of the original image. Finally, a saturation adjustment function is proposed to adaptive adjusting the saturation component of HSI color space to enrich the color information of the original input image., Results: Three evaluation metrics: Entropy, Contrast Improvement Index (CII) and Average Gradient (AG) are used to evaluate the performance of the proposed method. The results are compared with that of fourteen state-of-the-art algorithms. Experiments on endoscopic image enhancement show that the Entropy value of our method is 3.27% higher than the optimal entropy value of comparison algorithms. The CII of our proposed method is 6.19% higher than that of comparison algorithms. The AG of our method is 7.83% higher than the optimal AG of comparison algorithms., Conclusions: The proposed deep unsupervised multi-image fusion method can obtain image information details, enhance endoscopic images with high contrast, rich and natural color information, visual and image quality. Sixteen doctors and medical students have given their assessments on the proposed method for assisting clinical diagnoses., Competing Interests: Declaration of Competing Interest The authors declare that they have no conflict of interest., (Crown Copyright © 2022. Published by Elsevier B.V. All rights reserved.)

Solving the phase ambiguity problem is crucial to achieving a wide-range and high-precision measurement for the frequency-domain sampling (FDS)-based surface acoustic wave (SAW) delay-line sensor systems. This study proposes an improved phase estimation algorithm called dual-band phase estimation (DBPE) to solve the problem. By using DBPE, the SAW sensor system can obtain an extensive and alterable measuring range without further requirements for sensor design or transmitted signals. Thus, it can be widely used in various FDS-based SAW delay-line sensor systems. Monte Carlo simulations and temperature measuring experiments, based on a YZ-cut LiNbO 3 SAW delay-line sensor and a switched frequency-stepped continuous wave (S-FSCW) reader, are performed to demonstrate the algorithm's validity. The Monte Carlo simulations show that DBPE can effectively solve the phase ambiguity problem and has better performance than frequency estimation in measuring precision at a low signal-to-noise ratio (SNR). The temperature-sensing experiments show that DBPE has a good performance in measuring range and precision, serving as a phase ambiguity solver in the temperature sensor system.

The data volume and computation task of MIMO radar is huge; a very high-speed computation is necessary for its real-time processing. In this paper, we mainly study the time division MIMO radar signal processing flow, propose an improved MIMO radar signal processing algorithm, raising the MIMO radar algorithm processing speed combined with the previous algorithms, and, on this basis, a parallel simulation system for the MIMO radar based on the CPU/GPU architecture is proposed. The outer layer of the framework is coarse-grained with OpenMP for acceleration on the CPU, and the inner layer of fine-grained data processing is accelerated on the GPU. Its performance is significantly faster than the serial computing equipment, and satisfactory acceleration effects have been achieved in the CPU/GPU architecture simulation. The experimental results show that the MIMO radar parallel simulation system with CPU/GPU architecture greatly improves the computing power of the CPU-based method. Compared with the serial sequential CPU method, GPU simulation achieves a speedup of 130 times. In addition, the MIMO radar signal processing parallel simulation system based on the CPU/GPU architecture has a performance improvement of 13%, compared to the GPU-only method.

In deep learning tasks, the update step size determined by the learning rate at each iteration plays a critical role in gradient-based optimization. However, determining the appropriate learning rate in practice typically relies on subjective judgment. In this work, we propose a novel optimization method based on local quadratic approximation (LQA). In each update step, we locally approximate the loss function along the gradient direction by using a standard quadratic function of the learning rate. Subsequently, we propose an approximation step to obtain a nearly optimal learning rate in a computationally efficient manner. The proposed LQA method has three important features. First, the learning rate is automatically determined in each update step. Second, it is dynamically adjusted according to the current loss function value and parameter estimates. Third, with the gradient direction fixed, the proposed method attains a nearly maximum reduction in the loss function. Extensive experiments were conducted to prove the effectiveness of the proposed LQA method., Competing Interests: Declaration of Competing Interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2021 Elsevier Ltd. All rights reserved.)

Retinal fundus diseases can lead to irreversible visual impairment without timely diagnoses and appropriate treatments. Single disease-based deep learning algorithms had been developed for the detection of diabetic retinopathy, age-related macular degeneration, and glaucoma. Here, we developed a deep learning platform (DLP) capable of detecting multiple common referable fundus diseases and conditions (39 classes) by using 249,620 fundus images marked with 275,543 labels from heterogenous sources. Our DLP achieved a frequency-weighted average F1 score of 0.923, sensitivity of 0.978, specificity of 0.996 and area under the receiver operating characteristic curve (AUC) of 0.9984 for multi-label classification in the primary test dataset and reached the average level of retina specialists. External multihospital test, public data test and tele-reading application also showed high efficiency for multiple retinal diseases and conditions detection. These results indicate that our DLP can be applied for retinal fundus disease triage, especially in remote areas around the world., (© 2021. The Author(s).)

This paper proposes a sorghum adulteration detection model using hyperspectral imaging technology (HSI), image processing technology, and multivariate analysis technology. The model used a watershed algorithm to extract hyperspectral data from sorghum grains. Principal component analysis (PCA) and clustering analysis (CA) were used to remove abnormal samples of sorghum. Partial least squares discriminant analysis (PLS-DA) was used to identify the variety of sample, and a sorghum distribution map and adulteration ratios were obtained by marking varieties with different colors. This paper presents, for the first time, HSI use for identification of adulteration in sorghum using PCA and CA. Accuracy of the model identification for the validation set reached 96%, and for the adulterated samples reached 91%, and comprehensive accuracy of the model could reach more than 90%. These results show that the model can rapidly and nondestructively detect sorghum adulteration., Competing Interests: Declaration of Competing Interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2020 Elsevier Ltd. All rights reserved.)

Purpose: To elucidate the relationship between vessel density (VD) measurements and signal strength in OCT angiography (OCTA)., Design: Cross-sectional study., Participants: Healthy volunteers., Methods: OCT angiography images obtained from healthy volunteers were analyzed to demonstrate the relationship between signal strength index (SSI) and VD. Experiments were performed to determine the effects of signal strength reduction on VD measurements on the Optovue/AngioVue (Optovue, Inc, Fremont, CA) and Cirrus/AngioPlex OCTA (Carl Zeiss Meditec, Inc, Dublin, CA) systems. Signal strength reduction was generated by either neutral density filters (NDFs) or defocus., Main Outcome Measures: Regression analysis of signal strength effects on VD., Results: Vessel density decreased linearly with signal strength with high statistical significance on both OCTA systems tested and for all analyzed sources of variation in signal strength. The slope of VD versus SSI was greatest when signal strength was adjusted by NDFs, followed by defocus, interscan difference, interindividual variation, and left-right eye difference. Multivariate analysis revealed that both SSI and age had a significant effect on the interindividual variation in VD., Conclusions: Vessel density measurements using OCTA were affected significantly by OCT signal strengths on 2 OCTA platforms. Investigators should exercise caution when interpreting VD data from OCTA scans. Quantification algorithms for OCTA should ideally remove the signal strength bias., (Copyright © 2019 American Academy of Ophthalmology. Published by Elsevier Inc. All rights reserved.)

For most of the cells, water permeability and plasma membrane properties play a vital role in the optimal protocol for successful cryopreservation. Measuring the water permeability of cells during subzero temperature is essential. So far, there is no perfect segmentation technique to be used for the image processing task on subzero temperature accurately. The ice formation and variable background during freezing posed a significant challenge for most of the conventional segmentation algorithms. Thus, a robust and accurate segmentation approach that can accurately extract cells from extracellular ice that surrounding the cell boundary is needed. Therefore, we propose a convolutional neural network (CNN) architecture similar to U-Net but differs from those conventionally used in computer vision to extract all the cell boundaries as they shrank in the engulfing ice. The images used was obtained from the cryo-stage microscope, and the data was validated using the Hausdorff distance, means ± standard deviation for different methods of segmentation result using the CNN model. The experimental results prove that the typical CNN model extracts cell borders contour from the background in its subzero state more coherent and effective as compared to other traditional segmentation approaches., (Copyright © 2018 Elsevier Inc. All rights reserved.)

Compressed sensing (CS) is an important research area of signal sampling and compression, and the essence of signal recovery in CS is an optimization problem of solving the underdetermined system of equations. Greedy pursuit algorithms are widely used to solve this problem. They have low computational complexity; however, their recovery performance is limited. In this paper, an intelligence recovery algorithm is proposed by combining the Bat Algorithm (BA) and the pruning technique in subspace pursuit. Experimental results illustrate that the proposed algorithm has better recovery performance than greedy pursuit algorithms. Moreover, applied to the microseismic monitoring system, the BA can recover the signal well.

Purpose: To describe an automated algorithm to quantify the foveal avascular zone (FAZ), using optical coherence tomography angiography (OCTA), and to compare its performance for diagnosis of diabetic retinopathy (DR) and association with best-corrected visual acuity (BCVA) to that of extrafoveal avascular area (EAA)., Methods: We obtained 3 × 3-mm macular OCTA scans in diabetic patients with various levels of DR and healthy controls. An algorithm based on a generalized gradient vector flow (GGVF) snake model detected the FAZ, and metrics assessing FAZ size and irregularity were calculated. We compared the automated FAZ segmentation to manual delineation and tested the within-visit repeatability of FAZ metrics. The correlations of two conventional FAZ metrics, two novel FAZ metrics, and EAA with DR severity and BCVA, as determined by Early Treatment Diabetic Retinopathy Study (ETDRS) charts, were assessed., Results: Sixty-six eyes from 66 diabetic patients and 19 control eyes from 19 healthy participants were included. The agreement between manual and automated FAZ delineation had a Jaccard index > 0.82, and the repeatability of automated FAZ detection was excellent in eyes at all levels of DR severity. FAZ metrics that incorporated both FAZ size and shape irregularity had the strongest correlation with clinical DR grade and BCVA. Of all the tested OCTA metrics, EAA had the greatest sensitivity in differentiating diabetic eyes without clinical evidence of retinopathy, mild to moderate nonproliferative DR (NPDR), and severe NPDR to proliferative DR from healthy controls., Conclusions: The GGVF snake algorithm tested in this study can accurately and reliably detect the FAZ, using OCTA data at all DR severity grades, and may be used to obtain clinically useful information from OCTA data regarding macular ischemia in patients with diabetes. While FAZ metrics can provide clinically useful information regarding macular ischemia, and possibly visual acuity potential, EAA measurements may be a better biomarker for DR.

Aim: To assess total retinal blood flow (TRBF) in diabetic retinopathy (DR) using multiplane en face Doppler optical coherence tomography (OCT)., Methods: A 70 kHz spectral-domain OCT system scanned a 2×2 mm area centred at the optic disc of the eyes with DR and healthy participants. The multiplane en face Doppler OCT algorithm generated a three-dimensional volumetric data set consisting of 195 en face planes. The TRBF was calculated from the maximum flow values of each branching retinal vein at an optimised en face plane. DR severity was graded according to the international clinical classification system. The generalised linear model method was used to compare flow values between DR groups and the control group., Results: A total of 71 eyes from 71 participants were included. Ten eyes were excluded due to poor image quality. The within-visit repeatability of scans was 4.1% (coefficient of variation). There was no significant difference in the TRBF between the healthy (46.7±10.2 µL/min) and mild/moderate non-proliferative DR (44.9±12.6 µL/min) groups. The TRBF in severe non-proliferative DR (39.1±12.6 µL/min) and proliferative DR (28.9±8.85 µL/min) groups were significantly lower ( p =0.04 and p <0.0001, respectively) than that of the healthy group. TRBF was correlated with DR disease severity ( p <0.0001, linear trend test)., Conclusion: The novel multiplane en face Doppler OCT method provided reliable measurements of TRBF in DR eyes. This may be a useful tool in understanding the pathophysiology of DR., Competing Interests: Competing interests: Oregon Health & Science University (OHSU), OT, DH and YJ have a significant financial interest in Optovue, a company that may have a commercial interest in the results of this research and technology. OT and DH have a significant financial interest in Carl Zeiss Meditec. These potential conflicts of interest have been reviewed and managed by OHSU., (© Article author(s) (or their employer(s) unless otherwise stated in the text of the article) 2018. All rights reserved. No commercial use is permitted unless otherwise expressly granted.)

In smart parking environments, how to choose suitable parking facilities with various attributes to satisfy certain criteria is an important decision issue. Based on the multiple attributes decision making (MADM) theory, this study proposed a smart parking guidance algorithm by considering three representative decision factors (i.e., walk duration, parking fee, and the number of vacant parking spaces) and various preferences of drivers. In this paper, the expected number of vacant parking spaces is regarded as an important attribute to reflect the difficulty degree of finding available parking spaces, and a queueing theory-based theoretical method was proposed to estimate this expected number for candidate parking facilities with different capacities, arrival rates, and service rates. The effectiveness of the MADM-based parking guidance algorithm was investigated and compared with a blind search-based approach in comprehensive scenarios with various distributions of parking facilities, traffic intensities, and user preferences. Experimental results show that the proposed MADM-based algorithm is effective to choose suitable parking resources to satisfy users' preferences. Furthermore, it has also been observed that this newly proposed Markov Chain-based availability attribute is more effective to represent the availability of parking spaces than the arrival rate-based availability attribute proposed in existing research.

Purpose: To use multiplane en face Doppler optical coherence tomography (OCT) to measure the change in total retinal blood flow (TRBF) in response to hyperoxia., Methods: One eye of each healthy human participant (n = 8) was scanned with a commercial high-speed (70-kHz) spectral OCT system. Three repeated scans were captured at baseline and after 10 minutes of oxygen (hyperoxia) by open nasal mask. The procedure was performed twice on day 1 and once more on day 2. Blood flow of each vein was estimated using Doppler OCT at an optimized en face plane. The TRBF was summed from all veins at the optic disc. The TRBF hyperoxic response was calculated as the TRBF percent change from baseline., Results: Participants experienced a 23.6% ± 10.7% (mean ± standard deviation [SD]) decrease (P < 0.001, paired t-test) in TRBF during hyperoxia. The within-day repeatability of baseline TRBF was 4.1% and the between-day reproducibility was 10.9% coefficient of variation (CV). Between-grader reproducibility was 3.9% CV. The repeatability and reproducibility (pooled SD) of hyperoxic response were 6.1% and 6.4%, respectively., Conclusions: The multiplane en face Doppler OCT algorithm was able to detect, in all participants, a decreased TRBF in response to hyperoxia. The response magnitude for each participant varied among repeated trials, and the averaging of multiple trials was helpful in establishing the individual response. This technique shows good potential for the clinical investigation of vascular autoregulation.

Quantification of choroidal neovascularization (CNV) as visualized by optical coherence tomography angiography (OCTA) may have importance clinically when diagnosing or tracking disease. Here, we present an automated algorithm to quantify the vessel skeleton of CNV as vessel length. Initial segmentation of the CNV on en face angiograms was achieved using saliency-based detection and thresholding. A level set method was then used to refine vessel edges. Finally, a skeleton algorithm was applied to identify vessel centerlines. The algorithm was tested on nine OCTA scans from participants with CNV and comparisons of the algorithm’s output to manual delineation showed good agreement.

Environmental monitoring is fundamental in assessing environmental quality and to fulfill protection and management measures with permit conditions. However, coastal environmental monitoring work faces many problems and challenges, including the fact that monitoring information cannot be linked up with evaluation, monitoring data cannot well reflect the current coastal environmental condition, and monitoring activities are limited by cost constraints. For these reasons, protection and management measures cannot be developed and implemented well by policy makers who intend to solve this issue. In this paper, Quanzhou Bay in southeastern China was selected as a case study; and the Kriging method and a geographic information system were employed to evaluate and optimize the existing monitoring network in a semienclosed bay. This study used coastal environmental monitoring data from 15 sites (including COD, DIN, and PO 4 -P) to adequately analyze the water quality from 2009 to 2012 by applying the Trophic State Index. The monitoring network in Quanzhou Bay was evaluated and optimized, with the number of sites increased from 15 to 24, and the monitoring precision improved by 32.9%. The results demonstrated that the proposed advanced monitoring network optimization was appropriate for environmental monitoring in Quanzhou Bay. It might provide technical support for coastal management and pollutant reduction in similar areas.

Hedge detection is used to distinguish uncertain information from facts, which is of essential importance in biomedical information extraction. The task of hedge detection is often divided into two subtasks: detecting uncertain cues and their linguistic scope. Hedge scope is a sequence of tokens including the hedge cue in a sentence. Previous hedge scope detection methods usually take all tokens in a sentence as candidate boundaries, which inevitably generate a large number of negatives for classifiers. The imbalanced instances seriously mislead classifiers and result in lower performance. This paper proposes a dependency-based candidate boundary selection method (DCBS), which selects the most likely tokens as candidate boundaries and removes the exceptional tokens which have less potential to improve the performance based on dependency tree. In addition, we employ the composite kernel to integrate lexical and syntactic information and demonstrate the effectiveness of structured syntactic features for hedge scope detection. Experiments on the CoNLL-2010 Shared Task corpus show that our method achieves 71.92% F1-score on the golden standard cues, which is 4.11% higher than the system without using DCBS. Although the candidate boundary selection method is only evaluated on hedge scope detection here, it can be popularized to other kinds of scope learning tasks.

The split-spectrum amplitude-decorrelation angiography algorithm was optimized on a spectral optical coherence tomography system using a flow phantom. The number of times the spectrum was split and the bandwidth of each split were adjusted to maximize the flow phantom decorrelation signal-to-noise ratio. The improvement in flow detection was then demonstrated with en face retinal angiograms. The optimized algorithm increased the detectable retinal microvascular flow and decreased the variability of the quantified vessel density in OCT retinal angiograms of healthy human subjects.

DNA computing provides a promising method to solve the computationally intractable problems. The n-queens problem is a well-known NP-hard problem, which arranges n queens on an n × n board in different rows, columns and diagonals in order to avoid queens attack each other. In this paper, we present a novel parallel DNA algorithm for solving the n-queens problem using DNA molecular operations based on a biologically inspired computational model. For the n-queens problem, we reasonably design flexible length DNA strands representing elements of the allocation matrix, take appropriate biologic manipulations and get the solutions of the n-queens problem in proper length and O(n(2)) time complexity. We extend the application of DNA molecular operations, simultaneity simplify the complexity of the computation and simulate to verify the feasibility of the DNA algorithm., (Copyright © 2015 Elsevier Ireland Ltd. All rights reserved.)

Recent investigations on human vision discover that the retinal image is a landscape or a geometric surface, consisting of features such as ridges and summits. However, most of existing popular local image descriptors in the literature, e.g., scale invariant feature transform (SIFT), histogram of oriented gradient (HOG), DAISY, local binary Patterns (LBP), and gradient location and orientation histogram, only employ the first-order gradient information related to the slope and the elasticity, i.e., length, area, and so on of a surface, and thereby partially characterize the geometric properties of a landscape. In this paper, we introduce a novel and powerful local image descriptor that extracts the histograms of second-order gradients (HSOGs) to capture the curvature related geometric properties of the neural landscape, i.e., cliffs, ridges, summits, valleys, basins, and so on. We conduct comprehensive experiments on three different applications, including the problem of local image matching, visual object categorization, and scene classification. The experimental results clearly evidence the discriminative power of HSOG as compared with its first-order gradient-based counterparts, e.g., SIFT, HOG, DAISY, and center-symmetric LBP, and the complementarity in terms of image representation, demonstrating the effectiveness of the proposed local descriptor.

Gene/protein recognition and normalization is an important preliminary step for many biological text mining tasks. In this paper, we present a multistage gene normalization system which consists of four major subtasks: pre-processing, dictionary matching, ambiguity resolution and filtering. For the first subtask, we apply the gene mention tagger developed in our earlier work, which achieves an F-score of 88.42% on the BioCreative II GM testing set. In the stage of dictionary matching, the exact matching and approximate matching between gene names and the EntrezGene lexicon have been combined. For the ambiguity resolution subtask, we propose a semantic similarity disambiguation method based on Munkres' Assignment Algorithm. At the last step, a filter based on Wikipedia has been built to remove the false positives. Experimental results show that the presented system can achieve an F-score of 90.1%, outperforming most of the state-of-the-art systems.

The minimum spanning tree (MST) problem is to find minimum edge connected subsets containing all the vertex of a given undirected graph. It is a vitally important NP-complete problem in graph theory and applied mathematics, having numerous real life applications. Moreover in previous studies, DNA molecular operations usually were used to solve NP-complete head-to-tail path search problems, rarely for NP-hard problems with multi-lateral path solutions result, such as the minimum spanning tree problem. In this paper, we present a new fast DNA algorithm for solving the MST problem using DNA molecular operations. For an undirected graph with n vertex and m edges, we reasonably design flexible length DNA strands representing the vertex and edges, take appropriate steps and get the solutions of the MST problem in proper length range and O(3m+n) time complexity. We extend the application of DNA molecular operations and simultaneity simplify the complexity of the computation. Results of computer simulative experiments show that the proposed method updates some of the best known values with very short time and that the proposed method provides a better performance with solution accuracy over existing algorithms., (Copyright © 2013 The Authors. Published by Elsevier Ireland Ltd.. All rights reserved.)

Blinks are related to several emotional states, and the present report describes a simple, reliable way to measure blinks from the video stream of an eye obtained during eyetracking, where the source of the eye video is a video camera attached to a head-mounted eyetracker. Computer vision techniques are employed to determine the moments that a blink starts and ends, for the purpose of calculating blink frequency and duration. The video is first processed to show blocks of eyelid and pupil movements, and is then analyzed for blink starts and ends. The moment of a blink start is reported when the eyelid starts to move quickly, exceeding a predetermined threshold. The end of a blink arises when the pupil size increases by less than a separate threshold. We observed several different blink patterns from different subjects, and our algorithm was designed to work for all of these patterns. We evaluated our algorithm by manually measuring the true blinks of five different subjects while they were eyetracked. To test the sensitivity and specificity of the algorithm, we employed a series of threshold values to plot the receiver operating characteristic curves. Using the best thresholds, we achieved excellent sensitivity (>90 %) and specificity (>99 %) over the five subjects. Potential applications of this research include real-time, nonintrusive, continuous and automated measurements of mental workload and other emotional states related to blink rates and durations.

Background and Objective: To evaluate frame registration and averaging algorithms for optical coherence tomography., Patients and Methods: Twenty normal and 20 glaucomatous eyes were imaged. Objective differences were measured by comparing noise variance, spread of edge, and contrast-to-noise ratio. Subjective image quality was also evaluated., Results: Two frame-averaging algorithms (FA400 and FA407) had better noise variance and contrast-to-noise ratio but worse spread of edge than did single frames (P < .01). Both algorithms provided better subjective assessments of structure boundaries than did single images (P < .001). FA407 had significantly lower spread of edge and better internal limiting membrane visualization than FA400., Conclusion: Frame averaging significantly suppressed speckle noise and increased the visibility of retinal structures, but imperfect image registration caused edge blurring that could be detected by the spread of edge parameter. In frame-averaging algorithms, higher contrast-to-noise ratio and lower noise variance indicated better noise suppression, but spread of edge was most sensitive in comparing edge preservation between algorithms., (Copyright 2013, SLACK Incorporated.)

In this paper, a competitive method for 3-D face recognition (FR) using spherical harmonic features (SHF) is proposed. With this solution, 3-D face models are characterized by the energies contained in spherical harmonics with different frequencies, thereby enabling the capture of both gross shape and fine surface details of a 3-D facial surface. This is in clear contrast to most 3-D FR techniques which are either holistic or feature based, using local features extracted from distinctive points. First, 3-D face models are represented in a canonical representation, namely, spherical depth map, by which SHF can be calculated. Then, considering the predictive contribution of each SHF feature, especially in the presence of facial expression and occlusion, feature selection methods are used to improve the predictive performance and provide faster and more cost-effective predictors. Experiments have been carried out on three public 3-D face datasets, SHREC2007, FRGC v2.0, and Bosphorus, with increasing difficulties in terms of facial expression, pose, and occlusion, and which demonstrate the effectiveness of the proposed method.

Background: Nowadays, it is possible to collect expression levels of a set of genes from a set of biological samples during a series of time points. Such data have three dimensions: gene-sample-time (GST). Thus they are called 3D microarray gene expression data. To take advantage of the 3D data collected, and to fully understand the biological knowledge hidden in the GST data, novel subspace clustering algorithms have to be developed to effectively address the biological problem in the corresponding space., Results: We developed a subspace clustering algorithm called Order Preserving Triclustering (OPTricluster), for 3D short time-series data mining. OPTricluster is able to identify 3D clusters with coherent evolution from a given 3D dataset using a combinatorial approach on the sample dimension, and the order preserving (OP) concept on the time dimension. The fusion of the two methodologies allows one to study similarities and differences between samples in terms of their temporal expression profile. OPTricluster has been successfully applied to four case studies: immune response in mice infected by malaria (Plasmodium chabaudi), systemic acquired resistance in Arabidopsis thaliana, similarities and differences between inner and outer cotyledon in Brassica napus during seed development, and to Brassica napus whole seed development. These studies showed that OPTricluster is robust to noise and is able to detect the similarities and differences between biological samples., Conclusions: Our analysis showed that OPTricluster generally outperforms other well known clustering algorithms such as the TRICLUSTER, gTRICLUSTER and K-means; it is robust to noise and can effectively mine the biological knowledge hidden in the 3D short time-series gene expression data.

This paper introduces a modified technique based on Hilbert-Huang transform (HHT) to improve the spectrum estimates of heart rate variability (HRV). In order to make the beat-to-beat (RR) interval be a function of time and produce an evenly sampled time series, we first adopt a preprocessing method to interpolate and resample the original RR interval. Then, the HHT, which is based on the empirical mode decomposition (EMD) approach to decompose the HRV signal into several monocomponent signals that become analytic signals by means of Hilbert transform, is proposed to extract the features of preprocessed time series and to characterize the dynamic behaviors of parasympathetic and sympathetic nervous system of heart. At last, the frequency behaviors of the Hilbert spectrum and Hilbert marginal spectrum (HMS) are studied to estimate the spectral traits of HRV signals. In this paper, two kinds of experiment data are used to compare our method with the conventional power spectral density (PSD) estimation. The analysis results of the simulated HRV series show that interpolation and resampling are basic requirements for HRV data processing, and HMS is superior to PSD estimation. On the other hand, in order to further prove the superiority of our approach, real HRV signals are collected from seven young health subjects under the condition that autonomic nervous system (ANS) is blocked by certain acute selective blocking drugs: atropine and metoprolol. The high-frequency power/total power ratio and low-frequency power/high-frequency power ratio indicate that compared with the Fourier spectrum based on principal dynamic mode, our method is more sensitive and effective to identify the low-frequency and high-frequency bands of HRV.

Compared to backward feature selection (BFS) method in gene expression data analysis, forward feature selection (FFS) method can obtain an expected feature subset with less iteration. However, the number of FFS method is considerably less than that of BFS method. More efficient FFS methods need to be developed. In this paper, two FFS methods based on the pruning of the classifier ensembles generated by single attribute are proposed for gene selection. The main contributions are as follows: (1) a new loss function, p-insensitive loss function, is proposed to overcome the disadvantage of the margin Euclidean distance loss function in the pruning of classifier ensembles; (2) two FFS methods based on the margin Euclidean distance loss function and the p-insensitive loss function, named as FFS-ACSA1 and FFS-ACSA2 respectively, are proposed; (3) the comparison experiments on four gene expression datasets show that FFS-ACSA2 obtains the best results among three FFS methods (i.e. signal-to-noise ratio (SNR), FFS-ACSA1 and FFS-ACSA2), and is competitive to the famous support vector machine-based recursive feature elimination (SVM-RFE), while FFS-ACSA1 is unstable., (Copyright © 2011 Elsevier Ltd. All rights reserved.)

In this paper, we propose a simple method to analyze the similarity of biological sequences. By taking the average contents of biological sequences and their information entropies as the variables, the fuzzy method is used to cluster them. From the results of application, it finds that the method is relatively easy and rapid. Unlike other methods such as the graphical representation methods, which is usually very complex to compute some invariants of matric derived from graphical representation, our method pays more attention to the information of biological sequences themselves. Especially with the help of the software (SPSS), it seems to be very convenient. Therefore, it may be used to study the new biological sequences such as their evolution relationship and structures., (Copyright 2010 Elsevier Ltd. All rights reserved.)

Optical coherence tomography (OCT) has recently become one of the primary methods for noninvasive probing of the human retina. The pseudoimage formed by OCT (the so-called B-scan) varies probabilistically across pixels due to complexities in the measurement technique. Hence, sensitive automatic procedures of diagnosis using OCT may exploit statistical analysis of the spatial distribution of reflectance. In this paper, we perform a statistical study of retinal OCT data. We find that the stretched exponential probability density function can model well the distribution of intensities in OCT pseudoimages. Moreover, we show a small, but significant correlation between neighbor pixels when measuring OCT intensities with pixels of about 5 microm. We then develop a simple joint probability model for the OCT data consistent with known retinal features. This model fits well the stretched exponential distribution of intensities and their spatial correlation. In normal retinas, fit parameters of this model are relatively constant along retinal layers, but varies across layers. However, in retinas with diabetic retinopathy, large spikes of parameter modulation interrupt the constancy within layers, exactly where pathologies are visible. We argue that these results give hope for improvement in statistical pathology-detection methods even when the disease is in its early stages.

The objective of this research is to explore whether a two-dimensional BCI can be achieved by reliably decoding single-trial magneto-encephalography (MEG) signal associated with sustaining or ceasing right and left hand movements. Seven naïve subjects participated in the study. Signals were recorded from 275-channel MEG and synthetic aperture magnetometry (SAM) was employed. The multi-class classification for four-directional control was evaluated offline from 10-fold cross-validation using direct-decision tree classifier and genetic algorithm based Mahalanobis linear distance. Beta band (15-30Hz) event-related desynchronization and event related synchronization were observed in right and left hand movement related motor areas for physical movements as well as motor imagery. The cross-validation accuracy for the proposed four-direction classification from SAM- filtered MEG signal was as high as 95-97% for physical movements and 86-87% for motor imagery. The high classification accuracy suggests that a reliable high performance two-dimensional BCI can be achieved from single trial detection of human natural movement intentions from SAM-filtered MEG signals, where user may not need extensive training.

In this paper, we propose a blind image watermarking algorithm based on the multiband wavelet transformation and the empirical mode decomposition. Unlike the watermark algorithms based on the traditional two-band wavelet transform, where the watermark bits are embedded directly on the wavelet coefficients, in the proposed scheme, we embed the watermark bits in the mean trend of some middle-frequency subimages in the wavelet domain. We further select appropriate dilation factor and filters in the multiband wavelet transform to achieve better performance in terms of perceptually invisibility and the robustness of the watermark. The experimental results show that the proposed blind watermarking scheme is robust against JPEG compression, Gaussian noise, salt and pepper noise, median filtering, and ConvFilter attacks. The comparison analysis demonstrate that our scheme has better performance than the watermarking schemes reported recently.

There is considerable interest in new methods for the assessment of retinal blood flow for the diagnosis of eye diseases. We present in vivo normal human volumetric retinal flow measurement using Fourier domain Doppler optical coherence tomography. We used a dual-plane scanning pattern to determine the angle between the blood flow and the scanning beam in order to measure total flow velocity. Volumetric flow in each blood vessel around the optic nerve head was integrated in one cardiac cycle in each measurement. Measurements were performed in the right eye of one human subject. The measured venous flow velocity ranged from 16.26 mm/s to 29.7 mm/s. The arterial flow velocity ranged from 38.35 mm/s to 51.13 mm/s. The total retinal venous and arterial flow both added up to approximately 54 microl/min. We believe this is the first demonstration of total retinal blood flow measurement using the OCT technique.

Motivation: Because co-expressed genes are likely to share the same biological function, cluster analysis of gene expression profiles has been applied for gene function discovery. Most existing clustering methods ignore known gene functions in the process of clustering., Results: To take advantage of accumulating gene functional annotations, we propose incorporating known gene functions into a new distance metric, which shrinks a gene expression-based distance towards 0 if and only if the two genes share a common gene function. A two-step procedure is used. First, the shrinkage distance metric is used in any distance-based clustering method, e.g. K-medoids or hierarchical clustering, to cluster the genes with known functions. Second, while keeping the clustering results from the first step for the genes with known functions, the expression-based distance metric is used to cluster the remaining genes of unknown function, assigning each of them to either one of the clusters obtained in the first step or some new clusters. A simulation study and an application to gene function prediction for the yeast demonstrate the advantage of our proposal over the standard method.

In molecular mechanics calculations, electrostatic interactions between chemical groups are usually represented by a Coulomb potential between the partial atomic charges of the groups. In aqueous solution these interactions are modified by the polarizable solvent. Although the electrostatic effects of the polarized solvent on the protein are well described by the Poisson--Boltzmann equation, its numerical solution is computationally expensive for large molecules such as proteins. The procedure of nonuniform charge scaling (NUCS) is a pragmatic approach to implicit solvation that approximates the solvent screening effect by individually scaling the partial charges on the explicit atoms of the macromolecule so as to reproduce electrostatic interaction energies obtained from an initial Poisson--Boltzmann analysis. Once the screening factors have been determined for a protein the scaled charges can be easily used in any molecular mechanics program that implements a Coulomb term. The approach is particularly suitable for minimization-based simulations, such as normal mode analysis, certain conformational reaction path or ligand binding techniques for which bulk solvent cannot be included explicitly, and for combined quantum mechanical/molecular mechanical calculations when the interface to more elaborate continuum solvent models is lacking. The method is illustrated using reaction path calculations of the Tyr 35 ring flip in the bovine pancreatic trypsin inhibitor., ((c) 2005 Wiley Periodicals, Inc. J Comput Chem 26: 1359-1371, 2005.)

In this paper, a new, fully-automatic method for the quantification of brain atrophy based on CT volume data is put forward by taking advantage of the characteristics of cerebral CT images in combination with the prior medical knowledge. This algorithm has been verified through the calculation of 2388 cases of normal and brain atrophy subjects.

A novel feature selection method using the concept of mutual information (MI) is proposed in this paper. In all MI based feature selection methods, effective and efficient estimation of high-dimensional MI is crucial. In this paper, a pruned Parzen window estimator and the quadratic mutual information (QMI) are combined to address this problem. The results show that the proposed approach can estimate the MI in an effective and efficient way. With this contribution, a novel feature selection method is developed to identify the salient features one by one. Also, the appropriate feature subsets for classification can be reliably estimated. The proposed methodology is thoroughly tested in four different classification applications in which the number of features ranged from less than 10 to over 15,000. The presented results are very promising and corroborate the contribution of the proposed feature selection methodology.