The identification of the optic disc (OD) is necessary for the computer aided diagnosis of retinal diseases, but most methods for the OD detection often fail in the existence of retinal lesions and imaging artifacts. ...
详细信息
ISBN:
(纸本)9781479952779
The identification of the optic disc (OD) is necessary for the computer aided diagnosis of retinal diseases, but most methods for the OD detection often fail in the existence of retinal lesions and imaging artifacts. This paper proposes a new method based on iterative brightest pixels extraction (IBPE) for OD localization, which is designed to overcome the presence of large exudates or bright artifacts. The iterative algorithm integrates brightest pixels extraction and discrimination of geometric features. At each iteration step, the brightest pixels are extracted and a binary candidate map is constructed. In order to distinguish the OD region from candidates, two geometric features of each candidate are employed. Then, a checking process is performed. The algorithm deletes the false positive OD region and re-gets the new brightest pixels, iteratively. Hence, the real OD region rises finally though it is not bright at the first. The proposed method is evaluated on STARE retinal database. The experimental results show that the performance achieves a success rate of 95%.
Taking into account saturation of electrical machine's magnetic circuit is still a problem when circuit models are used. Steady-states are usually determined in such cases by numerical integration of the machine d...
详细信息
ISBN:
(纸本)9781538603598
Taking into account saturation of electrical machine's magnetic circuit is still a problem when circuit models are used. Steady-states are usually determined in such cases by numerical integration of the machine dynamic equations in time long enough. The paper presents a method which allows finding steady-state solutions directly in time domain. The method is presented along with computational example for a simple electromechanical converter.
The article describes the building of the search results ranking model based on the user evaluation of web resource quality and usability. Such ranking models are subjective for each user. This is achieved due to the ...
详细信息
ISBN:
(纸本)9781538664636
The article describes the building of the search results ranking model based on the user evaluation of web resource quality and usability. Such ranking models are subjective for each user. This is achieved due to the fact that the main influence on the model has the user's trust rank for the expert's evaluation on which basis it is built. To determine the trust rank, the generalized iterative algorithm of the group method of data handling was applied, which has already showed high accuracy in the experiments on building Google ranking model.
An Improved iterative Reprojection Reconstruction (IIRR) from a view of integral equation for incomplete image reconstruction is presented. IIRR is convergence under L2 norm. The convergent velocity and the error of t...
详细信息
An Improved iterative Reprojection Reconstruction (IIRR) from a view of integral equation for incomplete image reconstruction is presented. IIRR is convergence under L2 norm. The convergent velocity and the error of the reconstructed image depend on the relaxed parameter, the detected data and some prior information on image. The reconstructed image can be expressed in term of a series of image reconstructed by the detected data. Numerical simulation also shows that IIRR is effective to image reconstruction.
In this paper, an iterative algorithm is designed to compute the sparse graphs for traveling salesman problem (TSP) according to the frequency quadrilaterals so that the computation time of the algorithms for TSP will...
详细信息
ISBN:
(纸本)9783319784557;9783319784540
In this paper, an iterative algorithm is designed to compute the sparse graphs for traveling salesman problem (TSP) according to the frequency quadrilaterals so that the computation time of the algorithms for TSP will be lowered. At each computation cycle, the algorithm first computes the average frequency (f) over bar (e) of an edge e with N frequency quadrilaterals containing e in the input graph G(V, E). Then the 1/3 vertical bar E vertical bar edges with low frequency are eliminated to generate the output graph with a smaller number of edges. The algorithm can be iterated several times and the original optimal Hamiltonian cycle is preserved with a high probability. The experiments demonstrate the algorithm computes the sparse graphs with the O(nlog(2)n) edges containing the original optimal Hamiltonian cycle for most of the TSP instances in the TSPLIB. The computation time of the iterative algorithm is O(Nn(2)).
It is well known that the iterative stepwise quantization algorithm is very powerful for the optimization of amplitude digital Fourier transform holograms. We suggest a pre-iterative process to uniform the histogram d...
详细信息
ISBN:
(纸本)081944121X
It is well known that the iterative stepwise quantization algorithm is very powerful for the optimization of amplitude digital Fourier transform holograms. We suggest a pre-iterative process to uniform the histogram distribution of the Fourier transform of the input image in order to reduce the reconstruction error of amplitude digital Fourier transform holograms. Simulation results show that the reconstruction error can be reduced much when our pre-iterative process is used in the iterative stepwise quantization algorithm.
The scale of data in the Internet environment is becoming increasingly large and complex. Its heterogeneous, dynamic and distributed information characteristics have caused the existing business scanning and monitorin...
详细信息
Model-based image reconstruction (MBIR) is a powerful technique for solving ill-posed inverse problems. Compared with direct methods, it can provide better estimates from noisy measurements and from incomplete data, a...
详细信息
Model-based image reconstruction (MBIR) is a powerful technique for solving ill-posed inverse problems. Compared with direct methods, it can provide better estimates from noisy measurements and from incomplete data, at the cost of much longer computation time. In this work, we focus on accelerating and applying MBIR for solving reconstruction problems, including X-ray computed tomography (CT) image reconstruction and light field reconstruction, using variable splitting based on the augmented Lagrangian (AL) methods. For X-ray CT image reconstruction, we combine the AL method and ordered subsets (OS), a well-known technique in the medical imaging literature for accelerating tomographic reconstruction, by considering a linearized variant of the AL method and propose a fast splitting-based ordered-subset algorithm, OS-LALM, for solving X-ray CT image reconstruction problems with penalized weighted least-squares (PWLS) criterion. Practical issues such as the non-trivial parameter selection of AL methods and remarkable memory overhead when considering the finite difference image variable splitting are carefully studied, and several variants of the proposed algorithm are investigated for solving practical model-based X-ray CT image reconstruction problems. Experimental results show that the proposed algorithm significantly accelerates the convergence of X-ray CT image reconstruction with negligible overhead and greatly reduces the noise-like OS artifacts in the reconstructed image when using many subsets for OS acceleration. For light field reconstruction, considering decomposing the camera imaging process into a linear convolution and a non-linear slicing operations for faster forward projection, we propose to reconstruct light field from a sequence of photos taken with different focus settings, i.e., a focal stack, using an alternating direction method of multipliers (ADMM). To improve the quality of the reconstructed light field, we also propose a signal-independent sp
The authors proposed an iterative algorithm for the phase-controlled power synthesis of beam scanning arrays of arbitrary geometry, with simultaneous reduction of the maximum electric field amplitude in a near field r...
详细信息
ISBN:
(纸本)9781424449682
The authors proposed an iterative algorithm for the phase-controlled power synthesis of beam scanning arrays of arbitrary geometry, with simultaneous reduction of the maximum electric field amplitude in a near field region of interest and of the dynamic range ratio of the excitations. The presented example demonstrates the effectiveness of the proposed algorithm.
As the explosive growth of wireless date requirements, heterogeneous network (HetNet) has become an effective solution for improving the system performance such as the throughput. The femtocells are always arranged to...
详细信息
ISBN:
(纸本)9781509013456
As the explosive growth of wireless date requirements, heterogeneous network (HetNet) has become an effective solution for improving the system performance such as the throughput. The femtocells are always arranged to share the spectrum with the macro base stations (MBSs). Thus, the co-channel interference leads to the degradation of the HetNet throughput. In this paper, we discuss the program of spectrum reuse in the two-tier HetNet, and the problem is defined as a Stackelberg game approach. The MBS is play as a leader and it releases a part of spectrum resource for femtocells to avoid intertier interference. And the femtocells provide services to fractional macro users (MUEs) in return. Therefore, the throughput can be improved by the reduction of the inter-tier interference. Compared with the former works, the prominent characteristic of the method in the paper is that the benefit relation between the leader and followers is not measured by the real money. Furthermore, considering the system throughput specifically, we define the utility of the femto base stations (FBSs) by the average throughput as same as the utility of the MBS, which is used to improve the overall throughput of the system. Moreover, the gradient descent algorithm is also applied to compute the Nash equilibrium as the range of variables become continuous. The simulation results indicate that the proposed algorithm can observably reduce the interference and enhance the throughput of the network.
暂无评论