A noise erosion operator based on partial differential equation (PDE) is introduced, which has an excellent ability of noise removal and edge preservation for two-dimensional (2D) gradient data. The operator is applie...
详细信息
A noise erosion operator based on partial differential equation (PDE) is introduced, which has an excellent ability of noise removal and edge preservation for two-dimensional (2D) gradient data. The operator is applied to estimate a new diffusion coefficient. Experimental results demonstrate that anisotropic diffusion based on this new erosion operator can efficiently reduce noise and sharpen object boundaries.
This paper proposes a new post-processing algorithm with edge preserving. To control the granular and edge preserving in the process of post-processing, we introduce a new potential function. To avoid the non-linear o...
详细信息
This paper proposes a new post-processing algorithm with edge preserving. To control the granular and edge preserving in the process of post-processing, we introduce a new potential function. To avoid the non-linear obstacle, the object energy is converted with half-quadratic regularization. At last, the implementation of the algorithm is improved to speed up the computation. Experiments show our method can achieve the design object that effectively remove artifacts at the same time maintain the edges.
The residue number system (RNS) has computational advantages in addition and multiplication compared with weighted number systems, such as the binary number system (BNS), since operations on residue digits are perform...
详细信息
The residue number system (RNS) has computational advantages in addition and multiplication compared with weighted number systems, such as the binary number system (BNS), since operations on residue digits are performed independently and these processes can be performed in parallel. Thus they are widely used in digital signal processing etc. Since residue to binary conversion is critical and difficult for the practicality of RNS, in this paper, a novel residue to binary (R/B) conversion algorithm for the restricted moduli set (2/sup n/ -1, 2/sup n/, 2n+1), based on exploring the periodicity of modulo (2/sup n/ /spl plusmn/ 1) operations is presented. A new 2n-bit adder based R/B converter is also proposed. The performance comparison results demonstrate that the new converter is faster and requires less area compared with the others reported in the previous literature.
A new parallel-based lifting algorithm (PBLA) for the 9/7 filters, exploring the parallelism of arithmetic operations in each lifting step, was proposed in this paper. It shortened significantly the critical path of c...
详细信息
ISBN:
(纸本)0780384032
A new parallel-based lifting algorithm (PBLA) for the 9/7 filters, exploring the parallelism of arithmetic operations in each lifting step, was proposed in this paper. It shortened significantly the critical path of computation, and resulted in a fast VLSI implementation architecture. In comparison with the conventional lifting algorithm based implementation (CLABI), the latency is reduced by more than half from (4T/sub m/ + 8T/sub a/) to (T/sub m/ + 4T/sub a/), which is competitive to that of convolution based implementation CBI, and can be further reduced to Tm by inserting 3 stages of pipeline. The experimental results demonstrate that the proposed architecture has good performances in both speed and area.
For effective image segmentation methods, speed, accuracy and smoothness of the result are essential. In this paper, an iterative object segmentation approach is proposed based on minimal path theory. Each iterative s...
详细信息
For effective image segmentation methods, speed, accuracy and smoothness of the result are essential. In this paper, an iterative object segmentation approach is proposed based on minimal path theory. Each iterative step includes one morphological dilatation and one multi-label front propagation. A narrow band is obtained by dilating the current contour with the known size. A new contour is again formed by multi-label front propagation, which is based on minimal path theory. Its propagation speed is decided by the local image mean values together with the edge function. The final boundary is obtained automatically through finite iterations. This algorithm is a global optimization method. It is simple and fast with complexity O(N). The initial contour may be chosen freely. The multi-label front propagation guarantees continuity and smooth contours with the capability to handle topology changes. Furthermore, it is easy to extend to the 3D case. Some experimental results are also presented.
This paper presents a new technique for non-rigid body interpolation based on generalized morphologic morphing. Non-rigid body interpolation can be divided into non-rigid body metamorphosis and local rigid body rotati...
详细信息
A novel evolutionary route planner for aircraft is proposed in this paper. In the new planner, individual candidates are evaluated with respect to the workspace, thus the computation of the configuration space is not ...
详细信息
A novel evolutionary route planner for aircraft is proposed in this paper. In the new planner, individual candidates are evaluated with respect to the workspace, thus the computation of the configuration space is not required. By using problem-specific chromosome structure and genetic operators, the routes are generated in real time, with different mission constraints such as minimum route leg length and flying altitude, maximum turning angle, maximum climbing/diving angle and route distance constraint taken into account.
A new technique is presented for computing continuous shape transformations between polyhedral objects. The polyhedron shape transformations can be divided into polyhedron metamorphosis and bi-directional local rigid ...
A new technique is presented for computing continuous shape transformations between polyhedral objects. The polyhedron shape transformations can be divided into polyhedron metamorphosis and bi-directional local rigid body rotation transformation. By decomposing two objects into sets of individual convex sub-objects respectively, and establishing the matching between two subsets, the approach can solve the metamorphosis problem of two non-homotopic objects (including concave objects and holey objects). Compared with other methods, this metamorphosis algorithm can be executed automatically for arbitrary polyhedrons and no need user interaction. The user has the ability to choose an automatic matching or to select interactively pairs of corresponding matching convex subsets to obtain special effects. Experiments show that this method can generate natural, high-fidelity, eye-pleasing metamorphosis results with simple computation.
A novel evolutionary route planner for aircraft is proposed in this paper. In the new planner, individual candidates are evaluated with respect to the workspace, thus the computation of the configuration space is not ...
详细信息
A novel evolutionary route planner for aircraft is proposed in this paper. In the new planner, individual candidates are evaluated with respect to the workspace, thus the computation of the configuration space is not required. By using problem-specific chromosome structure and genetic operators, the routes are generated in real time,with different mission constraints such as minimum route leg length and flying altitude, maximum turning angle, maximum climbing/diving angle and route distance constraint taken into account.
The coordinated path-planning problem for multiple unmanned air vehicles is studied with the proposal of a co-evolving and cooperating path planner. In the new planner, potential paths of each vehicle form their own s...
详细信息
The coordinated path-planning problem for multiple unmanned air vehicles is studied with the proposal of a co-evolving and cooperating path planner. In the new planner, potential paths of each vehicle form their own subpopulation, and evolve only in their own sub-population, while the interaction among all sub-problems is reflected by the definition of fitness function. Meanwhile, the individual candidates are evaluated with respect to the workspace so that the computation of the configuration space is avoided. By using a problem-specific representation of candidate solutions and genetic operators, our algorithm can take into account different kinds of mission constraints and generate the solutions in real-time.
暂无评论