Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
213
Coil sensitivity encoding for fast MRI. In:
- Proceedings of the ISMRM 6th Annual Meeting,
, 1998
"... New theoretical and practical concepts are presented for considerably enhancing the performance of magnetic resonance imaging (MRI) by means of arrays of multiple receiver coils. Sensitivity encoding (SENSE) is based on the fact that receiver sensitivity generally has an encoding effect complementa ..."
Abstract
-
Cited by 193 (3 self)
- Add to MetaCart
it is not possible to assess absolute sensitivity values. However, according to Eq. [4], a spatial scaling of sensitivity values, as long as it is the same for all coils, is mapped onto the final image without further interference with reconstruction. Therefore it is sufficient to determine sensitivity maps
Abstract Approximating Radio Maps
"... Given a terrain T and an antenna A located on it, we would like to approximate the radio map of A over T, namely, to associate the signal strength of each point p ∈ T as received from A. Several facility location algorithms, which involve locating large scale wireless networks (W iMAX), use approxim ..."
Abstract
- Add to MetaCart
Given a terrain T and an antenna A located on it, we would like to approximate the radio map of A over T, namely, to associate the signal strength of each point p ∈ T as received from A. Several facility location algorithms, which involve locating large scale wireless networks (W iMAX), use
LOD-based Clustering Techniques for Efficient Large-scale Terrain Storage and Visualization
"... Large multi-resolution terrain data sets are usually stored out-of-core. To visualize terrain data at interactive frame rates, the data needs to be organized on disk, loaded into main memory part by part, then rendered efficiently. Many main-memory algorithms have been proposed for efficient vertex ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
terrain data sets. Therefore, the vertex sequences on disk are exactly the same for any terrain. In this paper, we propose a novel clustering algorithm which introduces the level-of-detail (LOD) information to terrain data organization to map multi-resolution terrain data to external memory. In our
Chapter 12 Rough Sets and Rough Logic: A KDD Perspective
"... Abstract Basic ideas of rough set theory were proposed by Zdzis law Pawlak [85, 86] in the early 1980’s. In the ensuing years, we have witnessed a systematic, world–wide growth of interest in rough sets and their applications. The main goal of rough set analysis is induction of approximations of con ..."
Abstract
- Add to MetaCart
Abstract Basic ideas of rough set theory were proposed by Zdzis law Pawlak [85, 86] in the early 1980’s. In the ensuing years, we have witnessed a systematic, world–wide growth of interest in rough sets and their applications. The main goal of rough set analysis is induction of approximations
Large scale SLAM building conditionally independent local maps: Application to monocular vision
- IEEE TRANSACTIONS ON ROBOTICS (T-RO
, 2008
"... SLAM algorithms based on local maps have been demonstrated to be well suited for mapping large environments as they reduce the computational cost and improve the consistency of the final estimation. The main contribution of this paper is a novel submapping technique that does not require independen ..."
Abstract
-
Cited by 16 (3 self)
- Add to MetaCart
SLAM algorithms based on local maps have been demonstrated to be well suited for mapping large environments as they reduce the computational cost and improve the consistency of the final estimation. The main contribution of this paper is a novel submapping technique that does not require
Large-Scale SLAM Building Conditionally Independent Local Maps: Application to Monocular Vision
- IEEE TRANSACTIONS ON ROBOTICS
, 2008
"... Simultaneous localization and mapping (SLAM) algorithms based on local maps have been demonstrated to be well suited for mapping large environments as they reduce the computational cost and improve the consistency of the final estimation. The main contribution of this paper is a novel submapping tec ..."
Abstract
-
Cited by 14 (0 self)
- Add to MetaCart
Simultaneous localization and mapping (SLAM) algorithms based on local maps have been demonstrated to be well suited for mapping large environments as they reduce the computational cost and improve the consistency of the final estimation. The main contribution of this paper is a novel submapping
3D Surface Localization with Terrain Model
"... Abstract—The majority of current research on sensor network localization focuses on wireless sensor networks deployed on two dimensional (2D) plane or in three dimensional (3D) space, very few on 3D surface. However, many real world applications require large-scale sensor networks deployed on the su ..."
Abstract
- Add to MetaCart
, we can extract a triangular mesh from the connectivity graph of the network. The constraint that the sensors must be on the known 3D terrain’s surface ensures that the triangular meshes of the network and the DTM of the terrain’s surface approximate the same geometric shape and overlap. We propose a
Towards Efficient and Exact MAP-Inference for Large Scale Discrete Computer Vision Problems via Combinatorial Optimization
, 2013
"... Discrete graphical models (also known as discrete Markov random fields) are a major conceptual tool to model the structure of optimization problems in computer vision. While in the last decade research has focused on fast approximative methods, algorithms that provide globally optimal solutions have ..."
Abstract
-
Cited by 9 (1 self)
- Add to MetaCart
Discrete graphical models (also known as discrete Markov random fields) are a major conceptual tool to model the structure of optimization problems in computer vision. While in the last decade research has focused on fast approximative methods, algorithms that provide globally optimal solutions
Results 1 - 10
of
213
