14 research outputs found
A reversible and statistical method for discrete surfaces smoothing
In this article we propose an original reversible method for discrete surface smoothing. This method is based on a statistical estimation of the discrete tangent plane on the voxels of the discrete surface. A geometrical constraint is used to control the recognition of the tangent plane. The resulting surface representation allows us to get both smooth normal vectors of the surface and a smooth surface mesh while preserving the geometrical properties of the surface
Euclidean Nets: An Automatic and Reversible Geometric Smoothing of Discrete 3D Object Boundaries
Map Edit Distance vs. Graph Edit Distance for Matching Images
International audienceGeneralized maps are widely used to model the topology of nD objects (such as 2D or 3D images) by means of incidence and adjacency relationships between cells (0D vertices, 1D edges, 2D faces, 3D volumes, ...). Recently, we have introduced a map edit distance. This distance compares maps by means of a minimum cost sequence of edit operations that should be performed to transform a map into another map. In this paper, we introduce labelled maps and we show how the map edit distance may be extended to compare labeled maps. We experimentally compare our map edit distance to the graph edit distance for matching regions of different segmentations of a same image
A causal extraction scheme in top-down pyramids for large images segmentation
International audienceApplicative fields based on the analysis of large images must deal with two important problems. First, the size in memory of such images usually forbids a global image analysis hereby inducing numerous problems for the design of a global image partition. Second, due to the high resolution of such images, global features only appear at low resolutions and a single resolution analysis may loose important information. The tiled top-down pyramidal model has been designed to solve this two major challenges. This model provides a hierarchical encoding of the image at single or multiple resolutions using a top-down construction scheme. Moreover, the use of tiles bounds the amount of memory required by the model while allowing global image analysis. The main limitation of this model is the splitting step used to build one additional partition from the above level. Indeed, this step requires to temporary refine the split region up to the pixel level which entails high memory requirements and processing time. In this paper, we propose a new splitting step within the tiled top-down pyramidal framework which overcomes the previously mentioned limitations