295 research outputs found
Simplicial resolutions and Ganea fibrations
In this work, we compare the two approximations of a path-connected space
, by the Ganea spaces and by the realizations of the truncated simplicial resolutions emerging from the
loop-suspension cotriple . For a simply connected space , we
construct maps over , up to homotopy. In the case , we prove the existence of
a map over (up to homotopy) and
conjecture that this map exists for any
Community Development Society (CDS) Fellows Program: A Purposeful Exploration to Strengthen Community
The practice of community development is both a process and an outcome. The Community Development Society (CDS) Fellows initiative sought to initiate a shared learning agenda, and in the process, strengthen participation in the Society community through collective learning and problem solving. Lessons learned through this project included the importance of designing constructive interactions, and the importance of planning for and overcoming obstacles that might impact participation
Finding Publicly Available Data for Extension Planning and Programming: Developing Community Portraits
Although there have been calls for many years for Extension professionals to use secondary data in their work, finding appropriate data online can still be a challenge. With the multitude of data sources available online, it can be helpful to use the concept of developing a community portrait as the context for becoming proficient at locating secondary data. Once compiled, the data in a community portrait can have multiple uses. In this article, we provide direction for finding specific online data sources and using those sources to compile a community portrait, tips on using data websites, and a quick guide to help with locating data
A linear framework for region-based image segmentation and inpainting involving curvature penalization
We present the first method to handle curvature regularity in region-based
image segmentation and inpainting that is independent of initialization.
To this end we start from a new formulation of length-based optimization
schemes, based on surface continuation constraints, and discuss the connections
to existing schemes. The formulation is based on a \emph{cell complex} and
considers basic regions and boundary elements. The corresponding optimization
problem is cast as an integer linear program.
We then show how the method can be extended to include curvature regularity,
again cast as an integer linear program. Here, we are considering pairs of
boundary elements to reflect curvature. Moreover, a constraint set is derived
to ensure that the boundary variables indeed reflect the boundary of the
regions described by the region variables.
We show that by solving the linear programming relaxation one gets quite
close to the global optimum, and that curvature regularity is indeed much
better suited in the presence of long and thin objects compared to standard
length regularity
Dense Tracking and Mapping with a Quadrocopter
In this paper, we present an approach for acquiring textured 3D models of room-sized indoor spaces using a quadrocopter. Such room models are for example useful for architects and interior designers as well as for factory planners and construction man- agers. The model is internally represented by a signed distance function (SDF) and the SDF is used to directly track the camera with respect to the model. Our solution enables accurate position control of the quadrocopter, so that it can automatically follow a pre-defined flight pattern. Our system provides live feedback of the acquired 3D model to the user. The final model consisting of a textured 3D triangle mesh can be saved in several standard CAD file formats
Real-Time Camera Tracking and 3D Reconstruction Using Signed Distance Functions
The ability to quickly acquire 3D models is an essential capability needed in many disciplines including robotics, computer vision, geodesy, and architecture. In this paper we present a novel method for real-time camera tracking and 3D reconstruction of static indoor environments using an RGB-D sensor. We show that by representing the geometry with a signed distance function (SDF), the camera pose can be efficiently estimated by directly minimizing the error of the depth images on the SDF. As the SDF contains the distances to the surface for each voxel, the pose optimization can be carried out extremely fast. By iteratively estimating the camera poses and integrating the RGB-D data in the voxel grid, a detailed reconstruction of an indoor environment can be achieved. We present reconstructions of several rooms using a hand-held sensor and from onboard an autonomous quadrocopter. Our extensive evaluation on publicly available benchmark data shows that our approach is more accurate and robust than the iterated closest point algorithm (ICP) used by KinectFusion, and yields often a comparable accuracy at much higher speed to feature-based bundle adjustment methods such as RGB-D SLAM for up to medium-sized scenes
Organic Food Claims in Europe
Better regulatory guidelines, improved testing methods, and additional research into product quality criteria are needed to further develop the European organic food market
Benchmarking 6DOF Outdoor Visual Localization in Changing Conditions
Visual localization enables autonomous vehicles to navigate in their
surroundings and augmented reality applications to link virtual to real worlds.
Practical visual localization approaches need to be robust to a wide variety of
viewing condition, including day-night changes, as well as weather and seasonal
variations, while providing highly accurate 6 degree-of-freedom (6DOF) camera
pose estimates. In this paper, we introduce the first benchmark datasets
specifically designed for analyzing the impact of such factors on visual
localization. Using carefully created ground truth poses for query images taken
under a wide variety of conditions, we evaluate the impact of various factors
on 6DOF camera pose estimation accuracy through extensive experiments with
state-of-the-art localization approaches. Based on our results, we draw
conclusions about the difficulty of different conditions, showing that
long-term localization is far from solved, and propose promising avenues for
future work, including sequence-based localization approaches and the need for
better local features. Our benchmark is available at visuallocalization.net.Comment: Accepted to CVPR 2018 as a spotligh
- …