Massively-parallel column-level segmentation of depth images
نویسندگان
چکیده
منابع مشابه
Sclability of Massively Parallel Depth-First Search
We analyze and compare the scalability of two generic schemes for heuristic depthrst search on highly parallel MIMD systems. The rst one employs a task attraction mechanism where the work packets are generated on demand by splitting the donor's stack. Analytical and empirical analyses show that this stack-splitting scheme works e ciently on parallel systems with a small communication diameter a...
متن کاملScalability of Massively Parallel Depth-first Search
We analyze and compare the scalability of two generic schemes for heuristic depthrst search on highly parallel MIMD systems. The rst one employs a task attraction mechanism where the work packets are generated on demand by splitting the donor's stack. Analytical and empirical analyses show that this stack-splitting scheme works e ciently on parallel systems with a small communication diameter a...
متن کاملSegmenting Text Images With Massively Parallel Machines
Image segmentation, the partitioning of an image into meaningful parts, is a major concern of any computer vision system. The meaningful parts of a text image are lines of text, words and characters. In this paper, the segmentation of pages of text into lines of text and lines of text into characters on a parallel machine will be examined. Using a parallel machine for text image segmentation al...
متن کاملFast planar segmentation of depth images
One of the major challenges for applications dealing with the 3D concept is the real-time execution of the algorithms. Besides this, for the indoor environments, perceiving the geometry of surrounding structures plays a prominent role in terms of application performance. Since indoor structures mainly consist of planar surfaces, fast and accurate detection of such features has a crucial impact ...
متن کاملReal-time Planar Segmentation of Depth Images
Handling depth images as a point cloud in a 3D data framework and performing planar segmentation in real-time requires heavy computation and it is a major challenge. Available planar-segmentation algorithms are mostly based on surface normals and/or curvatures, and consequently, do not provide real-time performance. In this abstract paper, we introduce a real-time planar-segmentation method for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational Science
سال: 2021
ISSN: 1877-7503
DOI: 10.1016/j.jocs.2021.101298