Searcharxiv⌕ Search

arXiv subjects

Yan Hu

Publications and source records attributed to Yan Hu.

90 records · Page 5Linked to original sources

Automatic Segmentation and Visualization of Choroid in OCT with Knowledge Infused Deep Learning

The choroid provides oxygen and nourishment to the outer retina thus is related to the pathology of various ocular diseases. Optical coherence tomography (OCT) is advantageous in visualizing and quantifying the choroid in vivo. (1) The lower boundary of the choroid (choroid-sclera interface) in OCT is fuzzy, which makes the automatic segmentation difficult and inaccurate. (2) The visualization of the choroid is hindered by the vessel shadows from the superficial layers of the inner retina. In this paper, we propose to incorporate medical and imaging prior knowledge with deep learning to address these two problems. We propose a biomarker infused global-to-local network for the choroid segmentation. It leverages the choroidal thickness, a primary biomarker in clinic, as a constraint to improve the segmentation accuracy. We also design a global-to-local strategy in the choroid segmentation: a global module is used to segment all the retinal and choroidal layers simultaneously for suppressing overfitting and providing global structure information, then a local module is used to refine the segmentation with the biomarker infusion. To eliminate the retinal vessel shadows, we propose a pipeline that firstly use anatomical and OCT imaging knowledge to locate the shadows using their projection on the retinal pigment epithelium layer, then the contents of the choroidal vasculature at the shadow locations are predicted with an edge-to-texture generative adversarial inpainting network. The experiments show our method outperforms the existing methods on both the segmentation and shadow elimination tasks. We further apply the proposed method in a clinical prospective study for understanding the pathology of glaucoma by detecting the structure and vascular changes of the choroid related to the elevation of intra-ocular pressure.

eess.IV↗

Reconstruction and Quantification of 3D Iris Surface for Angle-Closure Glaucoma Detection in Anterior Segment OCT

Precise characterization and analysis of iris shape from Anterior Segment OCT (AS-OCT) are of great importance in facilitating diagnosis of angle-closure-related diseases. Existing methods focus solely on analyzing structural properties identified from the 2D slice, while accurate characterization of morphological changes of iris shape in 3D AS-OCT may be able to reveal in addition the risk of disease progression. In this paper, we propose a novel framework for reconstruction and quantification of 3D iris surface from AS-OCT imagery. We consider it to be the first work to detect angle-closure glaucoma by means of 3D representation. An iris segmentation network with wavelet refinement block (WRB) is first proposed to generate the initial shape of the iris from single AS-OCT slice. The 3D iris surface is then reconstructed using a guided optimization method with Poisson-disk sampling. Finally, a set of surface-based features are extracted, which are used in detecting of angle-closure glaucoma. Experimental results demonstrate that our method is highly effective in iris segmentation and surface reconstruction. Moreover, we show that 3D-based representation achieves better performance in angle-closure glaucoma detection than does 2D-based feature.

eess.IV↗

Rationality of Darmon points over genus fields of non-maximal orders

Stark-Heegner points, also known as Darmon points, were introduced by H. Darmon as certain local points on rational elliptic curves, conjecturally defined over abelian extensions of real quadratic fields. The rationality conjecture for these points is only known in the unramified case, namely, when these points are specializations of global points defined over the strict Hilbert class field $H^+_F$ of the real quadratic field $F$ and twisted by (unramified) quadratic characters of $Gal(H_c^+/F)$. We extend these results to the situation of ramified quadratic characters; more precisely, we show that Darmon points of conductor $c\geq 1$ twisted by quadratic characters of $G_c^+=Gal(H_c^+/F)$, where $H_c^+$ is the strict ring class field of $F$ of conductor $c$, come from rational points on the elliptic curve defined over $H_c^+$.

math.NT↗

Deep-learning-enabled geometric constraints and phase unwrapping for single-shot absolute 3D shape measurement

Fringe projection profilometry (FPP) is one of the most popular three-dimensional (3D) shape measurement techniques, and has becoming more prevalently adopted in intelligent manufacturing, defect detection and some other important applications. In FPP, how to efficiently recover the absolute phase has always been a great challenge. The stereo phase unwrapping (SPU) technologies based on geometric constraints can eliminate phase ambiguity without projecting any additional fringe patterns, which maximizes the efficiency of the retrieval of absolute phase. Inspired by the recent success of deep learning technologies for phase analysis, we demonstrate that deep learning can be an effective tool that organically unifies the phase retrieval, geometric constraints, and phase unwrapping steps into a comprehensive framework. Driven by extensive training dataset, the neutral network can gradually "learn" how to transfer one high-frequency fringe pattern into the "physically meaningful", and "most likely" absolute phase, instead of "step by step" as in convention approaches. Based on the properly trained framework, high-quality phase retrieval and robust phase ambiguity removal can be achieved based on only single-frame projection. Experimental results demonstrate that compared with traditional SPU, our method can more efficiently and stably unwrap the phase of dense fringe images in a larger measurement volume with fewer camera views. Limitations about the proposed approach are also discussed. We believe the proposed approach represents an important step forward in high-speed, high-accuracy, motion-artifacts-free absolute 3D shape measurement for complicated object from a single fringe pattern.

eess.IV↗

High signal-to-noise ratio reconstruction of low bit-depth optical coherence tomography using deep learning

Reducing the bit-depth is an effective approach to lower the cost of optical coherence tomography (OCT) systems and increase the transmission efficiency in data acquisition and telemedicine. However, a low bit-depth will lead to the degeneration of the detection sensitivity thus reduce the signal-to-noise ratio (SNR) of OCT images. In this paper, we propose to use deep learning for the reconstruction of the high SNR OCT images from the low bit-depth acquisition. Its feasibility was preliminarily evaluated by applying the proposed method to the quantized $3\sim8$-bit data from native 12-bit interference fringes. We employed a pixel-to-pixel generative adversarial network architecture in the low to high bit-depth OCT image transition. Retinal OCT data of a healthy subject from a homemade spectral-domain OCT system was used in the study. Extensively qualitative and quantitative results show this deep-learning-based approach could significantly improve the SNR of the low bit-depth OCT images especially at the choroidal region. Superior similarity and SNR between the reconstructed images and the original 12-bit OCT images could be derived when the bit-depth $\geq 5$. This work demonstrates the proper integration of OCT and deep learning could benefit the development of healthcare in low-resource settings.

eess.IV↗

Universal digital filtering for denoising volumetric retinal OCT and OCT angiography in 3D shearlet domain

Retinal optical coherence tomography (OCT) and OCT angiography (OCTA) suffer from the degeneration of image quality due to speckle noise and bulk-motion noise, respectively. Because the cross-sectional retina has distinct features in OCT and OCTA B-scans, existing digital filters that can denoise OCT efficiently are unable to handle the bulk-motion noise in OCTA. In this Letter, we propose a universal digital filtering approach that is capable of minimizing both types of noise. Considering the retinal capillaries in OCTA are hard to differentiate in B-scans while having distinct curvilinear structures in 3D volumes, we decompose the volumetric OCT and OCTA data with 3D shearlets thus efficiently separate the retinal tissue and vessels from the noise in this transform domain. Compared with wavelets and curvelets, the shearlets provide better representation of the layer edges in OCT and the vasculature in OCTA. Qualitative and quantitative results show the proposed method outperforms the state-of-the-art OCT and OCTA denoising methods. Besides, the superiority of 3D denoising is demonstrated by comparing the 3D shearlet filtering with its 2D counterpart.

eess.IV↗

Digital resolution enhancement in low transverse sampling optical coherence tomography angiography using deep learning

Optical coherence tomography angiography (OCTA) requires high transverse sampling density for visualizing retinal and choroidal capillaries. Low transverse sampling causes resolution degradation, such as the angiograms in wide-field OCTA. In this paper, we propose to address this problem using deep learning. We conducted extensive experiments on converting the centrally cropped 3 x 3 mm2 field of view (FOV) of the 8 x 8 mm2 foveal OCTA images (a sampling density of 22.9 $μ$m) to the native 3 x 3 mm2 en face OCTA images (a sampling density of 12.2 $μ$m). We employed a cycle-consistent adversarial network architecture in this conversion. The quantitative analysis using the perceptual similarity measures shows the generated OCTA images are closer to the native 3 x 3 mm2 scans. Besides, the results show the proposed method could also enhance signal-to-noise ratio. We further applied our method to enhance diseased cases and calculate vascular biomarkers, which demonstrates its generalization performance and clinical perspective.

eess.IV↗

Deep learning enables extraction of capillary-level angiograms from single OCT volume

Optical coherence tomography angiography (OCTA) has drawn numerous attentions in ophthalmology. However, its data acquisition is time-consuming, because it is based on temporal-decorrelation principle thus requires multiple repeated volumetric OCT scans. In this paper, we developed a deep learning algorithm by combining a fovea attention mechanism with a residual neural network, which is able to extract capillary-level angiograms directly from a single OCT scan. The segmentation results of the inner limiting membrane and outer plexiform layers and the central $1\times1$ mm$^2$ field of view of the fovea are employed in the fovea attention mechanism. So the influences of large retinal vessels and choroidal vasculature on the extraction of capillaries can be minimized during the training of the network. The results demonstrate that the proposed algorithm has the capacity to better-visualizing capillaries around the foveal avascular zone than the existing work using a U-Net architecture.

physics.med-ph↗

Eliminating Shadow Artifacts via Generative Inpainting Networks to Quantify Vascular Changes of the Choroid

Shadow artifacts from retinal vessels hinder the development of quantitative choroidal biomarkers in Optical Coherence Tomography (OCT), which limits the clinical applications of the choroidal OCT to the measures of layer thickness. In this paper, we present a novel framework that could eliminate the retinal shadows and realize the quantification of choroidal vasculature. Different from existing methods, we convert the shadow elimination into an object removal task, which can be handled by image inpainting techniques. We adopt and finetune a two-stage generative inpainting network which connects the edges of the vessels ahead of refilling the shadow-contaminated areas. It shows surpassing performance in repairing the choroidal vasculature compared with traditional inpainting algorithms. We further verify the feasibility of the proposed frame using a prospective observational study, which detects the choroidal vascular changes related to the Intra-Ocular Pressure (IOP) elevation of 34 healthy volunteers. As the average IOP increases from $15.84\pm1.99$ mmHg to $34.48\pm5.35$ mmHg, we achieve the decreases of the choroidal vessel density and flow index from $0.491\pm0.020$ to $0.463\pm0.019$ and from $0.336\pm0.025$ to $0.300\pm0.019$, respectively.

physics.med-ph↗

Microscopic 3D measurement of shiny surfaces based on a multi-frequency phase-shifting scheme

Microscopic fringe projection profilometry is a powerful 3D measurement technique with a theoretical measurement accuracy better than one micron provided that the measured targets can be imaged with good fringe visibility. However, practically, the 3D shape of the measured surface can hardly be fully reconstructed due to the defocus of the dense fringes and complex surface reflexivity characteristics, which lead to low fringe quality and intensity saturation. To address this problem, we propose to calculate phases of these highlighted areas from a subset of the fringe sequence which is not subjected to the intensity saturation. By using the proposed multi-frequency phase-shifting scheme, the integrity of the 3D surface reconstruction can be significantly improved. The ultimate phase maps obtained from unsaturated intensities are used to achieve high-accuracy 3D recovering of shiny surfaces based on a phase stereo matching method. Experimental results on different metal surfaces show that our approach is able to retrieve the complete morphology of shiny surfaces with high accuracy and fidelity.

eess.IV↗

Fringe pattern analysis using deep learning

In many optical metrology techniques, fringe pattern analysis is the central algorithm for recovering the underlying phase distribution from the recorded fringe patterns. Despite extensive research efforts for decades, how to extract the desired phase information, with the highest possible accuracy, from the minimum number of fringe patterns remains one of the most challenging open problems. Inspired by recent successes of deep learning techniques for computer vision and other applications, here, we demonstrate for the first time, to our knowledge, that the deep neural networks can be trained to perform fringe analysis, which substantially enhances the accuracy of phase demodulation from a single fringe pattern. The effectiveness of the proposed method is experimentally verified using carrier fringe patterns under the scenario of fringe projection profilometry. Experimental results demonstrate its superior performance in terms of high accuracy and edge-preserving over two representative single-frame techniques: Fourier transform profilometry and Windowed Fourier profilometry.

eess.IV↗

Towards Effective Bug Triage with Towards Effective Bug Triage with Software Data Reduction Techniques

Software companies spend over 45 percent of cost in dealing with software bugs. An inevitable step of fixing bugs is bug triage, which aims to correctly assign a developer to a new bug. To decrease the time cost in manual work, text classification techniques are applied to conduct automatic bug triage. In this paper, we address the problem of data reduction for bug triage, i.e., how to reduce the scale and improve the quality of bug data. We combine instance selection with feature selection to simultaneously reduce data scale on the bug dimension and the word dimension. To determine the order of applying instance selection and feature selection, we extract attributes from historical bug data sets and build a predictive model for a new bug data set. We empirically investigate the performance of data reduction on totally 600,000 bug reports of two large open source projects, namely Eclipse and Mozilla. The results show that our data reduction can effectively reduce the data scale and improve the accuracy of bug triage. Our work provides an approach to leveraging techniques on data processing to form reduced and high-quality bug data in software development and maintenance.

cs.SE↗

Debt-Prone Bugs: Technical Debt in Software Maintenance

Fixing bugs is an important phase in software development and maintenance. In practice, the process of bug fixing may conflict with the release schedule. Such confliction leads to a trade-off between software quality and release schedule, which is known as the technical debt metaphor. In this article, we propose the concept of debt-prone bugs to model the technical debt in software maintenance. We identify three types of debt-prone bugs, namely tag bugs, reopened bugs, and duplicate bugs. A case study on Mozilla is conducted to examine the impact of debt-prone bugs in software products. We investigate the correlation between debt-prone bugs and the product quality. For a product under development, we build prediction models based on historical products to predict the time cost of fixing bugs. The result shows that identifying debt-prone bugs can assist in monitoring and improving software quality.

cs.SE↗

A Random Walk Based Algorithm for Structural Test Case Generation

Structural testing is a significant and expensive process in software development. By converting test data generation into an optimization problem, search-based software testing is one of the key technologies of automated test case generation. Motivated by the success of random walk in solving the satisfiability problem (SAT), we proposed a random walk based algorithm (WalkTest) to solve structural test case generation problem. WalkTest provides a framework, which iteratively calls random walk operator to search the optimal solutions. In order to improve search efficiency, we sorted the test goals with the costs of solutions completely instead of traditional dependence analysis from control flow graph. Experimental results on the condition-decision coverage demonstrated that WalkTest achieves better performance than existing algorithms (random test and tabu search) in terms of running time and coverage rate.

cs.SE↗

Approximating the Backbone in the Weighted Maximum Satisfiability Problem

The weighted Maximum Satisfiability problem (weighted MAX-SAT) is a NP-hard problem with numerous applications arising in artificial intelligence. As an efficient tool for heuristic design, the backbone has been applied to heuristics design for many NP-hard problems. In this paper, we investigated the computational complexity for retrieving the backbone in weighted MAX-SAT and developed a new algorithm for solving this problem. We showed that it is intractable to retrieve the full backbone under the assumption that . Moreover, it is intractable to retrieve a fixed fraction of the backbone as well. And then we presented a backbone guided local search (BGLS) with Walksat operator for weighted MAX-SAT. BGLS consists of two phases: the first phase samples the backbone information from local optima and the backbone phase conducts local search under the guideline of backbone. Extensive experimental results on the benchmark showed that BGLS outperforms the existing heuristics in both solution quality and runtime.

cs.AI↗

A Hybrid ACO Algorithm for the Next Release Problem

In this paper, we propose a Hybrid Ant Colony Optimization algorithm (HACO) for Next Release Problem (NRP). NRP, a NP-hard problem in requirement engineering, is to balance customer requests, resource constraints, and requirement dependencies by requirement selection. Inspired by the successes of Ant Colony Optimization algorithms (ACO) for solving NP-hard problems, we design our HACO to approximately solve NRP. Similar to traditional ACO algorithms, multiple artificial ants are employed to construct new solutions. During the solution construction phase, both pheromone trails and neighborhood information will be taken to determine the choices of every ant. In addition, a local search (first found hill climbing) is incorporated into HACO to improve the solution quality. Extensively wide experiments on typical NRP test instances show that HACO outperforms the existing algorithms (GRASP and simulated annealing) in terms of both solution uality and running time.

cs.NE↗

Towards Training Set Reduction for Bug Triage

Bug triage is an important step in the process of bug fixing. The goal of bug triage is to assign a new-coming bug to the correct potential developer. The existing bug triage approaches are based on machine learning algorithms, which build classifiers from the training sets of bug reports. In practice, these approaches suffer from the large-scale and low-quality training sets. In this paper, we propose the training set reduction with both feature selection and instance selection techniques for bug triage. We combine feature selection with instance selection to improve the accuracy of bug triage. The feature selection algorithm, instance selection algorithm Iterative Case Filter, and their combinations are studied in this paper. We evaluate the training set reduction on the bug data of Eclipse. For the training set, 70% words and 50% bug reports are removed after the training set reduction. The experimental results show that the new and small training sets can provide better accuracy than the original one.

cs.SE↗

A systematic literature review of cloud computing in eHealth

Cloud computing in eHealth is an emerging area for only few years. There needs to identify the state of the art and pinpoint challenges and possible directions for researchers and applications developers. Based on this need, we have conducted a systematic review of cloud computing in eHealth. We searched ACM Digital Library, IEEE Xplore, Inspec, ISI Web of Science and Springer as well as relevant open-access journals for relevant articles. A total of 237 studies were first searched, of which 44 papers met the Include Criteria. The studies identified three types of studied areas about cloud computing in eHealth, namely (1) cloud-based eHealth framework design (n=13); (2) applications of cloud computing (n=17); and (3) security or privacy control mechanisms of healthcare data in the cloud (n=14). Most of the studies in the review were about designs and concept-proof. Only very few studies have evaluated their research in the real world, which may indicate that the application of cloud computing in eHealth is still very immature. However, our presented review could pinpoint that a hybrid cloud platform with mixed access control and security protection mechanisms will be a main research area for developing citizen centred home-based healthcare applications.

cs.CY↗