Search results for "minimum spanning tree"
showing 4 items of 34 documents
An Image Segmentation Algorithm based on Community Detection
2016
International audience; With the recent advances in complex networks, image segmentation becomes one of the most appropriate application areas. In this context, we propose in this paper a new perspective of image segmentation by applying two efficient community detection algorithms. By considering regions as communities, these methods can give an over-segmented image that has many small regions. So, the proposed algorithms are improved to automatically merge those neighboring regions agglomerative to achieve the highest modularity/stability. To produce sizable regions and detect homogeneous communities, we use the combination of a feature based on the Histogram of Oriented Gradients of the …
Region-based segmentation on depth images from a 3D reference surface for tree species recognition.
2013
International audience; The aim of the work presented in this paper is to develop a method for the automatic identification of tree species using Terrestrial Light Detection and Ranging (T-LiDAR) data. The approach that we propose analyses depth images built from 3D point clouds corresponding to a 30 cm segment of the tree trunk in order to extract characteristic shape features used for classifying the different tree species using the Random Forest classifier. We will present the method used to transform the 3D point cloud to a depth image and the region based segmentation method used to segment the depth images before shape features are computed on the segmented images. Our approach has be…
A new minimum trees-based approach for shape matching with improved time computing : application to graphical symbols recognition
2010
Recently we have developed a model for shape description and matching. Based on minimum spanning trees construction and specifics stages like the mixture, it seems to have many desirable properties. Recognition invariance in front shift, rotated and noisy shape was checked through median scale tests related to GREC symbol reference database. Even if extracting the topology of a shape by mapping the shortest path connecting all the pixels seems to be powerful, the construction of graph induces an expensive algorithmic cost. In this article we discuss on the ways to reduce time computing. An alternative solution based on image compression concepts is provided and evaluated. The model no longe…
Counting the minimum node weight spanning trees for broadcast transmission in wireless sensor networks
2017
Artykuł przedstawia algorytm optymalizacji zużycia energii dla broadcastu w sieciach sensorowych. Transmisja broadcastu pozwala na wysłanie danych do wszystkich portów składających się na sieć. Bezprzewodowe sieci sensorowe zbudowane są z rozproszonych urządzeń pomiarowych. Mają one ograniczone zasoby energii. W tym artykule stworzymy model sieci sensorowej z jednym sensorem broadcastującym. Do tej sieci użyjemy algorytmu znajdującego minimalne spinające drzewo wag, pozwalające na oszczędne wykorzystanie energii sensorów.