In heterogeneous scenes with latent non-deterministic states, template features determine the performance of the Siamese network-based trackers, however, background noise is easily introduced in the search area matchi...
详细信息
A novel way achieving geometrical reconstruction of actual human face through projecting two types of texture on face in short time is advanced. The first type texture is stripe which is used to establish parallax gri...
详细信息
A novel way achieving geometrical reconstruction of actual human face through projecting two types of texture on face in short time is advanced. The first type texture is stripe which is used to establish parallax grid between images. Taking into account of its results, the second type projecting texture is used to match by virtue of its abundant traits. After realizing geometrical reconstruction, the paper provides a general way about achieving actual texture reconstruction by the outer spherical surface surrounding object. In order to uniform color, it deals with parts of images in conjunct region and makes the color change meeting a certain function on condition of keeping their original information mostly. Results show this way can improve reconstruction quality and decrease complicacy of algorithm.
This paper generalizes regularized regression problems in a hyper-reproducing kernel Hilbert space (hyper-RKHS), illustrates its utility for kernel learning and out-of-sample extensions, and proves asymptotic converge...
详细信息
Single amino acid polymorphisms (SAPs) are the most abundant form of known genetic variations associated with human diseases. It is of great interest to study the sequence-structure-function relationship underlying SA...
详细信息
Single amino acid polymorphisms (SAPs) are the most abundant form of known genetic variations associated with human diseases. It is of great interest to study the sequence-structure-function relationship underlying SAPs. In this work, we collected the human variant data from three databases and divided them into three categories, i.e. cancer somatic mutations (CSM), Mendelian disease-related variant (SVD) and neutral polymorphisms (SVP). We built support vector machine (SVM) classifiers to predict these three classes of SAPs, using the optimal features selected by a random forest algorithm. Consequently, 280 sequence-derived and structural features were initially extracted from the curated datasets from which 18 optimal candidate features were further selected by random forest. Furthermore, we performed a stepwise feature selection to select characteristic sequence and structural features that are important for predicting each SAPs class. As a result, our predictors achieved a prediction accuracy (ACC) of 84.97, 96.93, 86.98 and 88.24%, for the three classes, CSM, SVD and SVP, respectively. Performance comparison with other previously developed tools such as SIFT, SNAP and Polyphen2 indicates that our method provides a favorable performance with higher Sensitivity scores and Matthew's correlation coefficients (MCC). These results indicate that the prediction performance of SAPs classifiers can be effectively improved by feature selection. Moreover, division of SAPs into three respective categories and construction of accurate SVM-based classifiers for each class provides a practically useful way for investigating the difference between Mendelian disease-related variants and cancer somatic mutations.
In this paper, we propose a data-adaptive non-parametric kernel learning framework in margin based kernel methods. In model formulation, given an initial kernel matrix, a data-adaptive matrix with two constraints is i...
详细信息
In this paper, we propose a data-adaptive non-parametric kernel learning framework in margin based kernel methods. In model formulation, given an initial kernel matrix, a data-adaptive matrix with two constraints is imposed in an entry-wise scheme. Learning this data-adaptive matrix in a formulation-free strategy enlarges the margin between classes and thus improves the model flexibility. The introduced two constraints are imposed either exactly (on small data sets) or approximately (on large data sets) in our model, which provides a controllable trade-off between model flexibility and complexity with theoretical demonstration. In algorithm optimization, the objective function of our learning framework is proven to be gradient-Lipschitz continuous. Thereby, kernel and classifier/regressor learning can be efficiently optimized in a unified framework via Nesterov's acceleration. For the scalability issue, we study a decomposition-based approach to our model in the large sample case. The effectiveness of this approximation is illustrated by both empirical studies and theoretical guarantees. Experimental results on various classification and regression benchmark data sets demonstrate that our non-parametric kernel learning framework achieves good performance when compared with other representative kernel learning based algorithms.
Segmentation of colorectal cancerous regions from 3D Magnetic Resonance (MR) images is a crucial procedure for radiotherapy which conventionally requires accurate delineation of tumour boundaries at an expense of labo...
详细信息
One of the problems with Smart Transportation is the problem of cost and travel time. This problem is known as the Variable Routing Problem (VRP). In some real cases, in addition to considering route selection, there ...
详细信息
ISBN:
(数字)9798350355314
ISBN:
(纸本)9798350355321
One of the problems with Smart Transportation is the problem of cost and travel time. This problem is known as the Variable Routing Problem (VRP). In some real cases, in addition to considering route selection, there are limitations on the capacity and time period for the vehicle to serve each customer known as Time Windows, so VRP has developed into Variable Routing Problem with Time Windows (VRPTW). One way to solve VRPTW is to use metaheuristic methods. However, the metaheuristic method has a weakness, which are it can get stuck in local optimums and fail to find better global solutions. To overcome this, a combination with other methods or known as hybrid is needed. The formulation of this research problem is how to develop a Smart transportation model using a metaheuristic hybrid algorithm. The purpose of this study is to develop a Smart transportation model using a metaheuristic hybrid algorithm. The method used is to combine two metaheuristic algorithms, which are the Dragonfly Algorithm (DA) and the Variable Neighborhood Search (VNS). The result of this research is a new algorithm model which is a hybrid between DA and VNS. Through a combination of global exploration using DA and local exploitation using VNS, this algorithm is expected to be able to find a better solution and faster convergence in solving VRPTW problems
Achieving high-precision measurements in a large field of view (FOV) is a challenging task. The accuracy of vision measurements is determined by the quality of camera calibration, which is influenced by the pose of th...
详细信息
Achieving high-precision measurements in a large field of view (FOV) is a challenging task. The accuracy of vision measurements is determined by the quality of camera calibration, which is influenced by the pose of the target. To obtain suitable target pose, a target pose optimization method based on multi-agent reinforcement learning (MARL) is proposed. Firstly, the target pose optimization problem is modelled as a Markov decision process (MDP). Secondly, a multi-agent proximal policy optimization (MAPPO) algorithm for target pose optimization is designed by parameter sharing mechanism. Finally, optimization algorithm is adopted to camera calibration process. The calibration experiment was carried out under the large FOV of 4600 mm × 2300 mm. The results show that the back-projection error was 0.198 mm, the relative error of the diagonal length of target (505.847 mm) was 0.789 mm, and the success rate of large FOV camera calibration was 98.5%.
Radiomics aims to extract and analyze large numbers of quantitative features from medical images and is highly promising in staging, diagnosing, and predicting outcomes of cancer treatments. Nevertheless, several chal...
详细信息
The main content of the research in this paper is the estimation of depth and pose based on monocular vision and Inertial Measurement Unit (IMU). The usual depth estimation network and pose estimation network require ...
The main content of the research in this paper is the estimation of depth and pose based on monocular vision and Inertial Measurement Unit (IMU). The usual depth estimation network and pose estimation network require depth ground truth or pose ground truth as a supervised signal for training, while the depth ground truth and pose ground truth are hard to obtain, and monocular vision based depth estimation cannot predict absolute depth. In this paper, with the help of IMU, which is inexpensive and widely used, we can obtain angular velocity and acceleration information. Two new supervision signals are proposed and the calculation expressions are given. Among them, the model trained with acceleration constraint shows a good ability to estimate the absolute depth during the test. It can be considered that the model can estimate the absolute depth. We also derive the method of estimating the scale factor during the test from the acceleration constraint, and also achieve good results as the acceleration constraint does. In addition, this paper also studies the method of using IMU information as pose network input and as selecting conditions. Moreover, it analyzes and discusses the experimental results. At the same time, we also evaluate the effect of the pose estimation of the relevant models. This article starts by reviewing the achievements and deficiencies of the work in this field, combines the use of IMU, puts forward three new methods such as a new loss function, and conducts a test analysis and discussion of relevant indicators on the KITTI data set.
暂无评论