Segmentation of cardiac images, particularly late gadolinium-enhanced magnetic resonance imaging (LGE-MRI)widely used for visualizing diseased cardiacstructures, is a crucial first step for clinical diagnosis and trea...
详细信息
Learning of classification rules is a popular approach of machine learning, which can be achieved through two strategies, namely divide-and-conquer and separate-and-conquer. The former is aimed at generating rules in ...
详细信息
ISBN:
(纸本)9781538652152
Learning of classification rules is a popular approach of machine learning, which can be achieved through two strategies, namely divide-and-conquer and separate-and-conquer. The former is aimed at generating rules in the form of a decision tree, whereas the latter generates if-then rules directly from training data. From this point of view, the above two strategies are referred to as decision tree learning and rule learning, respectively. Both learning strategies can lead to production of complex rule based classifiers that overfit training data, which has motivated researchers to develop pruning algorithms towards reduction of overfitting. In this paper, we propose a J-measure based pruning algorithm, which is referred to as Jmean-pruning. The proposed pruning algorithm is used to advance the performance of the information entropy based rule generation method that follows the separate and conquer strategy. An experimental study is reported to show how Jmean-pruning can effectively help the above rule learning method avoid overfitting. The results show that the use of Jmean-pruning achieves to advance the performance of the rule learning method and the improved performance is very comparable or even considerably better than the one of C4.5.
Kernel methods have been extensively used in a variety of machine learning tasks such as classification, clustering, and dimensionality reduction. For complicated practical tasks, the traditional kernels, e.g., Gaussi...
详细信息
Kernel methods have been extensively used in a variety of machine learning tasks such as classification, clustering, and dimensionality reduction. For complicated practical tasks, the traditional kernels, e.g., Gaussian kernel and sigmoid kernel, or their combinations are often not sufficiently flexible to fit the data. In this paper, we present a Data-Adaptive Nonparametric Kernel (DANK) learning framework in a data-driven manner. To be specific, in model formulation, we impose an adaptive matrix on the kernel/Gram matrix in an entry-wise strategy. Since we do not specify the formulation of the adaptive matrix, each entry in the adaptive matrix can be directly and flexibly learned from the data. Therefore, the solution space of the learned kernel is largely expanded, which makes our DANK model flexible to capture the data with different local statistical properties. Specifically, the proposed kernel learning framework can be seamlessly embedded to support vector machines (SVM) and support vector regression (SVR), which has the capability of enlarging the margin between classes and reducing the model generalization error. Theoretically, we demonstrate that the objective function of our DANK model embedded in SVM/SVR is gradient-Lipschitz continuous. Thereby, the training process for kernel and parameter learning in SVM/SVR can be efficiently optimized in a unified framework. Further, to address the scalability issue in nonparametric kernel learning framework, we decompose the entire optimization problem in DANK into several smaller easy-to-solve problems, so that our DANK model can be efficiently approximated by this partition. The effectiveness of this approximation is demonstrated by both empirical studies and theoretical guarantees. Experimentally, the proposed DANK model embedded in SVM/SVR achieves encouraging performance on various classification and regression benchmark datasets when compared with other representative kernel learning based algorithms. Copyrig
Localization is a fundamental function in cooperative control of micro unmanned aerial vehicles (UAVs), but is easily affected by flip ambiguities because of measurement errors and flying motions. This study proposes ...
详细信息
In this paper, a coarse-to-fine framework for image noise removal is proposed. The bilateral filter is redefined by the manner of progressive refining to effectively eliminate noise, thus forming progressive refinemen...
详细信息
ISBN:
(纸本)9781538678626;9781538678619
In this paper, a coarse-to-fine framework for image noise removal is proposed. The bilateral filter is redefined by the manner of progressive refining to effectively eliminate noise, thus forming progressive refinement bilateral filter (PRBF), which estimates the pixel values of a noisy image through the method of progressive refinement with gradual recursion and its result retains more details, infinite close to the original image. PRBF is further integrated into the denoising model for the details processing again after denoising of the major part of the image. Our algorithm is evaluated and compared on two large standardized datasets and a number of selected images. The experimental results show that our algorithm consistently outperforms other approaches for image denoising and demonstrates the effectiveness of our framework for stereo matching.
In this paper, a novel approach for content based image retrieval (CBIR) in diabetic retinopathy (DR) is proposed. The concept of salient point selection and inter-plane relationship technique is used. Salient points ...
详细信息
In this paper, a novel approach for content based image retrieval (CBIR) in diabetic retinopathy (DR) is proposed. The concept of salient point selection and inter-plane relationship technique is used. Salient points are selected from edgy image and later using inter-planer relationship, Local Binary patterns (LBPs) are calculated using the salient point as a center pixel. Our approach enhanced the results as we used color features in combination with LBP features. Experimentation is carried out on MESSIDOR database of 1200 retinal images, proposed approach has average precision of 57.82% as compared to the earlier approach whose average precision is 53.70%.
Cross-media analysis and reasoning is an active research area in computer science, and a promising direction for artificial intelligence. However, to the best of our knowledge, no existing work has summarized the stat...
详细信息
Cross-media analysis and reasoning is an active research area in computer science, and a promising direction for artificial intelligence. However, to the best of our knowledge, no existing work has summarized the state-of-the-art methods for cross-media analysis and reasoning or presented advances, challenges, and future directions for the field. To address these issues, we provide an overview as follows： （1） theory and model for cross-media uniform representation; （2） cross-media correlation understanding and deep mining; （3） cross-media knowledge graph construction and learning methodologies; （4） cross-media knowledge evolution and reasoning; （5） cross-media description and generation; （6） cross-media intelligent engines; and （7） cross-media intelligent applications. By presenting approaches, advances, and future directions in cross-media analysis and reasoning, our goal is not only to draw more attention to the state-of-the-art advances in the field, but also to provide technical insights by discussing the challenges and research directions in these areas.
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...
详细信息
Although TMDC monolayers offer giant optical nonlinearity within few-angstrom thickness, it is still elusive to modulate and engineer the wavefront of nonlinear emissions. The grain size of high-quality monolayers als...
详细信息
暂无评论