Minh Ôn Vũ Ngọc

Automatic vectorization of historical maps: A benchmark

Abstract Shape vectorization is a key stage of the digitization of large-scale historical maps, especially city maps that exhibit complex and valuable details. Having access to digitized buildings, building blocks, street networks and other geographic content opens numerous new approaches for historical studies such as change tracking, morphological analysis and density estimations. In the context of the digitization of Paris atlases created in the 19th and early 20th centuries, we have designed a supervised pipeline that reliably extract closed shapes from historical maps.

Continue reading

The Dahu graph-cut for interactive segmentation on 2D/3D images

Abstract Interactive image segmentation is an important application in computer vision for selecting objects of interest in images. Several interactive segmentation methods are based on distance transform algorithms. However, the most known distance transform, geodesic distance, is sensitive to noise in the image and to seed placement. Recently, the Dahu pseudo-distance, a continuous version of the minimum barrier distance (MBD), is proved to be more powerful than the geodesic distance in noisy and blurred images.

Continue reading

Topology-aware method to segment 3D plan tissue images

By Minh Ôn Vũ Ngọc, Nicolas Boutry, Jonathan Fabrizio

2022-10-25

In 36th conference on neural information processing systems, AI for science workshop

Abstract The study of genetic and molecular mechanisms underlying tissue morphogenesis has received a lot of attention in biology. Especially, accurate segmentation of tissues into individual cells plays an important role for quantitative analyzing the development of the growing organs. However, instance cell segmentation is still a challenging task due to the quality of the image and the fine-scale structure. Any small leakage in the boundary prediction can merge different cells together, thereby damaging the global structure of the image.

Continue reading

Introducing the boundary-aware loss for deep image segmentation

By Minh Ôn Vũ Ngọc, Yizi Chen, Nicolas Boutry, Joseph Chazalon, Edwin Carlinet, Jonathan Fabrizio, Clément Mallet, Thierry Géraud

2021-11-28

In Proceedings of the 32nd british machine vision conference (BMVC)

Abstract Most contemporary supervised image segmentation methods do not preserve the initial topology of the given input (like the closeness of the contours). One can generally remark that edge points have been inserted or removed when the binary prediction and the ground truth are compared. This can be critical when accurate localization of multiple interconnected objects is required. In this paper, we present a new loss function, called, Boundary-Aware loss (BALoss), based on the Minimum Barrier Distance (MBD) cut algorithm.

Continue reading

A new minimum barrier distance for multivariate images with applications to salient object detection, shortest path finding, and segmentation

By Minh Ôn Vũ Ngọc, Nicolas Boutry, Jonathan Fabrizio, Thierry Géraud

2020-06-02

In Computer Vision and Image Understanding

Abstract Distance transforms and the saliency maps they induce are widely used in image processing, computer vision, and pattern recognition. One of the most commonly used distance transform is the geodesic one. Unfortunately, this distance does not always achieve satisfying results on noisy or blurred images. Recently, a new (pseudo-)distance, called the minimum barrier distance (MBD), more robust to pixel variations, has been introduced. Some years after, Géraud et al. have proposed a good and fast-to compute approximation of this distance: the Dahu pseudo-distance.

Continue reading

A new minimum barrier distance for multivariate images with applications to salient object detection, shortest path finding, and segmentation

Abstract Hierarchical image representations are widely used in image processing to model the content of an image in the multi-scale structure. A well-known hierarchical representation is the tree of shapes (ToS) which encodes the inclusion relationship between connected components from different thresholded levels. This kind of tree is self-dual, contrast-change invariant and popular in computer vision community. Typically, in our work, we use this representation to compute the new distance which belongs to the mathematical morphology domain.

Continue reading

Document detection in videos captured by smartphones using a saliency-based method

By Minh Ôn Vũ Ngọc, Jonathan Fabrizio, Thierry Géraud

2018-09-20

In International conference on document analysis and recognition workshops (ICDARW)

Abstract Smartphones are now widely used to digitizepaper documents. Document detection is the first importantstep of the digitization process. Whereas many methods extractlines from contours as candidates for the document boundary, we present in this paper a region-based approach. A key feature of our method is that it relies on visual saliency, using a recent distance existing in mathematical morphology. We show that the performance of our method is competitive with state-of-the-art methods on the ICDAR Smartdoc 2015 Competition dataset.

Continue reading

Saliency-based detection of identity documents captured by smartphones

By Minh Ôn Vũ Ngọc, Jonathan Fabrizio, Thierry Géraud

2018-02-02

In Proceedings of the IAPR international workshop on document analysis systems (DAS)

Abstract Smartphones have became an easy and convenient mean to acquire documents. In this paper, we focus on the automatic segmentation of identity documents in smartphone photos or videos using visual saliency (VS). VS-based approaches, which pertain to computer vision, have not be considered yet for this particular task. Here we compare different VS methods, and we propose a new VS scheme, based on a recent distance belonging to the scope of mathematical morphology.

Continue reading