The marching cube algorithm is currently one of the most popular three-dimensional (3D) reconstruction surface rendering algorithms. It forms voxels based on an input image and then uses 15 basic topological configurations to extract isosurfaces from voxels. processes each voxel in a traversal-based manner, but it does not consider relationship between adjacent cubes. Owing ambiguity, final rec...

Edge computing can reduce the transmission pressure of wireless networks in earthquakes by pushing functionalities to network edges and avoiding data cloud servers. However, this also leads scattered storage content each edge server, increasing difficulty search. This paper investigates seismic query problem supported computing. We first design a lookup mechanism based on bloom filter, which qu...

We present a Split Canny edge detection algorithm that results in significantly reduced memory requirements, decreased latency and increased throughput with no loss in edge detection performance as compared to the original Canny algorithm. The Canny edge detector is one of the most widely used edge detection algorithms due to its superior performance. Unfortunately, not only is it computational...

We present new edge splitting-off results maintaining all-pairs edge-connectivities of an undirected graph. We first give an alternate proof of Mader’s theorem, and use it to obtain a deterministic Õ(m + rmax · n2)-time complete edge splitting-off algorithm for unweighted graphs, where rmax denotes the maximum edge-connectivity requirement. This improves upon the best known algorithm by Gabow b...

Targets and objects registration and tracking in a sequence of images play an important role in various areas. One of the methods in image registration is feature-based algorithm which is accomplished in two steps. The first step includes finding features of sensed and reference images. In this step, a scale space is used to reduce the sensitivity of detected features to the scale changes. Afterw...

This paper describes a simulated annealing algorithm to compute k connected graphs that minimize a linear combination of graph edge cost and diameter Repli cas of Internet information services can use graphs with these properties to propagate updates among themselves We report the algorithm s performance on and connected node graphs where edge cost and diame ter correspond to physical distance ...

Design of a new intelligent driver assistance system based on traffic sign detection with Persian context is concerned in this paper. The primary aim of this system is to increase the precision of drivers in choosing their path with regard to traffic signs. To achieve this goal, a new framework that implements fuzzy logic was used to detect traffic signs in videos captured along a highway f...