This paper developed a fully automatic method to locate the brain tumor from Magnetic resonance imaging (MRI) head scans using wavelet packet transformation (WPT) based feature set. WPT is used to extract high frequen...
详细信息
As a key technology to implement Semantic Web, linked data have gradually been an academic and industrial concern. Linked data represents a practice of technologies on the web and linked structure data. The goal of li...
详细信息
As a key technology to implement Semantic Web, linked data have gradually been an academic and industrial concern. Linked data represents a practice of technologies on the web and linked structure data. The goal of linked data is to enable people to share structured data on the web as easily as they can share documents today. On the Web of data structured with linked data, users can jump from one dataset to another. Compared with the Web of document which enables one to jump from one document to another, data Web provides much more links and has semantics. Mapping relational databases to RDF is a fundamental problem for the development of linked data. This paper firstly makes an improvement with R2RML to open source software named D2R which can publish linked data, and then takes an example of the data concerning a college enrollment in Sichuan of China in 2011, demonstrating that we can publish the data in RDB into RDF as linked data through the new approach more efficient and make it browsable.
Given a planar curve s(t), the locus of those points from which the curve can be seen under a fixed angle is called isoptic curve of s(t). Isoptics are well-known and widely studied, especially for some classical curv...
详细信息
Motion artifacts of digital subtraction angiography (DSA) are usually corrected by image registration. image registration is the process of transforming different sets of feature points into one coordinate system. Mis...
详细信息
Biometric authentication procedures use facial images for authentication in an organization. Storing of large facial images require large storage space. To reduce the storage space, compression methods are employed. J...
详细信息
作者：
Kalaiselvi, T.Nagaraja, P.Image Processing Lab.
Department of Computer Science and Applications Gandhigram Rural Institute-Deemed University Gandhigram-624 302 Dindigul Tamil Nadu India
This work is aimed to produce a robust thresholding method for segmenting the MRI brain images. A popular thresholding method commonly used in digital image segmentation is the Kittler and Illingworth's (MET) meth...
详细信息
In positron emission tomography (PET) imaging, the segmentation of organs is necessary for many quantitative image analysis tasks, e.g., estimation of individual organ concentration or partial volume correction. To th...
详细信息
Applications running in multi-tenant IaaS clouds increasingly require networked compute resources, which may belong to several clouds hosted in multiple data-centers. To accommodate these applications network virtuali...
详细信息
An effective approach for coverage holes was proposed, called Distance-assistant Coverage Hole Parching (DACHP) strategy. DACHP strategy would achieve the purpose of patching coverage holes using redundant sensor node...
详细信息
ISBN:
(纸本)9781629932170
An effective approach for coverage holes was proposed, called Distance-assistant Coverage Hole Parching (DACHP) strategy. DACHP strategy would achieve the purpose of patching coverage holes using redundant sensor nodes within the wireless sensor networks. Simulation results show, compared with DFNFP and random algorithm, for the same size and shape coverage hole, DACHP can awaken five redundant nodes to patch 92.19% of hole, yet DFNFP needs awaken nine redundant nodes and just patch 90.28%. It can be seen that DFNFP not only awaken four extra nodes, but also is lower 1.19% in patching rate of hole than DACHP. In addition, DACHP is more stable in utilization of redundant nodes and does not produce additional cost.
In this paper, we present solutions to an Advanced Computing with Words problem that is equivalent to one of Zadeh's challenge problems on linguistic probabilities. We use a syllogism based on the entailment princ...
详细信息
ISBN:
(纸本)9781479900213
In this paper, we present solutions to an Advanced Computing with Words problem that is equivalent to one of Zadeh's challenge problems on linguistic probabilities. We use a syllogism based on the entailment principle to interpret the problem so that it yields two linguistic belief structures. Then we perform an addition of those linguistic belief structures to obtain a belief structure on the variable about which linguistic probabilities have to be inferred. We show that pessimistic (lower) and optimistic (upper) probabilities can be inferred from such a belief structure using Linguistic Weighted Averages and pessimistic and optimistic compatibility measures. Then, we choose vocabularies for linguistic attributes (lifetimes of products) and linguistic probabilities that are involved in the problem statement. The vocabularies are modeled using interval type-2 fuzzy sets. We calculate optimistic (upper) and pessimistic (lower) probabilities, and map them into words present in the vocabulary of linguistic probabilities, so that the results can be comprehended by a human.
暂无评论