Design and Analysis of an Efficient Evolutionary Image Segmentation Algorithm

Evolutionary image segmentation algorithms have a number of advantages such as continuous contour, non-oversegmentation, and non-thresholds. However, most of the evolutionary image segmentation algorithms suffer from long computation time because the number of encoding parameters is large. In this paper, design and analysis of an efficient evolutionary image segmentation algorithm EISA are proposed. EISA uses a K-means algorithm to split an image into many homogeneous regions, and then uses an intelligent genetic algorithm IGA associated with an effective chromosome encoding method to merge the regions automatically such that the objective of the desired segmentation can be effectively achieved, where IGA is superior to conventional genetic algorithms in solving large parameter optimization problems. High performance of EISA is illustrated in terms of both the evaluation performance and computation time, compared with some current segmentation methods. It is empirically shown that EISA is robust and efficient using nature images with various characteristics.     

EPCCL理论的并行知识编译算法

基于超扩展规则，证明了EPCCL（Each Pair Contains Complementary Literal）理论的合并过程是可并行执行的，并设计了针对多个EPCCL理论的并行合并算法PUAE（Parallel computing Union of Any number of EPCCL）.通过对EPCCL理论原始子句集的利用，提出了另一种高效的EPCCL理论并行合并算法imp-PUAE（improvement of PUAE）.UKCHER（computing Union sets of maximum terms for Knowledge Compilation based on Hyper Extension Rule）是一种可并行的EPCCL理论编译算法，分别利用PUAE和imp-PUAE设计了两个并行知识编译算法P-UKCHER（UKCHER with PUAE）和impP-UKCHER（UKCHER with imp-PUAE）.实验结果表明：P-UKCHER算法虽然没有提升UKCHER算法的效率，但能够提升UKCHER算法编译结果的质量，最好情况下可提升4倍；而impP-UKCHER算法能够提高UKCHER算法的效率，同时也能够提升编译结果的质量，同样最好情况下可提升4倍.     

An efficient face segmentation algorithm based on binary partition tree

This paper presents an efficient face segmentation algorithm based on binary partition tree. Skin-like regions are first obtained by integrating the results of pixel classification and watershed segmentation. Facial features are extracted by the techniques of valley detection and entropic thresholding, and are used to refine the skin-like regions. In order to segment the facial regions from the skin-like regions, a novel region merging algorithm is proposed by considering the impact of the common border ratio between adjacent regions, and the binary partition tree is used to represent the whole region merging process. Then the facial likeness of each node in the binary partition tree is evaluated using a set of fuzzy membership functions devised for a number of facial primitives of geometrical, elliptical and facial features. Finally, an efficient algorithm of node selecting in the binary partition tree is proposed for the final face segmentation, which can exactly segment the faces without any underlying assumption. The performance of the proposed face segmentation algorithm is demonstrated by experimental results carried out on a variety of images in different scenarios.     

Partitioning-based decoupling capacitor budgeting via sequence of linear programming

In this paper, we propose an efficient algorithm to reduce the voltage noises for on-chip power/ground (P/G) networks of VLSI. The new method is based on the sequence of linear programming (SLP) as the optimization engine, and partitioning scheme for dealing with large-sized circuits. We show that by directly optimizing the decoupling capacitor (decap) areas as the objective function and using the time-domain adjoint method, SLP can deliver much better quality in terms of decap budget than existing methods based on the merged time-domain adjoint method. The partitioning strategy further improves the scalability of the proposed algorithm and makes it efficient for larger circuits. The resulting algorithm is general enough for any P/G network. Experimental results demonstrate the advantage of the proposed method over existing state-of-the-art methods in terms of solution quality at a mild computation cost increase.     

Relative accuracy of several finite-difference time-domain methodsin two and three dimensions

A comparison of the accuracy of several orthogonal-grid finite-difference-time-domain (FDTD) schemes is made in both two and three-dimensions. The relative accuracy is determined from the dispersion error associated with each algorithm and the number of floating-point operations required to obtain a desired accuracy level. In general, in both 2-D and 3-D, fourth-order algorithms are more efficient than second-order schemes in terms of minimizing the number of computations for a given accuracy level. In 2-D, a second-order approach proposed by Z. Chen et al. (1991) is much more accurate than the scheme of K.S. Yee (1966) for a given amount of computation, and can be as efficient as fourth-order algorithms. In 3-D, Yee's algorithm is slightly more efficient than the approach of Chen et al. in terms of operations, but much more efficient in terms of memory requirements     

An energy‐efficient hole‐healing mechanism for wireless sensor networks with obstacles

In wireless sensor networks (WSNs), coverage of the monitoring area represents the surveillance quality. Since sensor nodes are battery powered and placed outdoor, there will be failures due to energy exhaustion or environmental influence, resulting in coverage‐loss. In literature, a number of studies developed robot repairing algorithms that aim at maintaining full coverage. However, they did not consider the time constraint for network maintenance. Furthermore, they did not consider the existence of obstacles and the constraint of limited energy of the robot. This paper presents a novel tracking mechanism and robot repairing algorithm for maintaining the coverage quality of the given WSN. Without support of location information, the tracking mechanism leaves robot's footmark on sensors so that they can learn better routes for sending repairing requests to the robot. Upon receiving several repairing request messages, the robot applies the proposed repairing algorithm to establish an efficient route that passes through all failure regions with low overhead in terms of the required time and the power consumption. In addition, the proposed repairing algorithm also considers the remaining energy of the robot so that the robot can move back to home for recharging energy and overcome the unpredicted obstacles. Performance results reveal that the developed protocol can efficiently maintain the coverage quality while the required time and energy consumption are significantly reduced. Copyright © 2011 John Wiley & Sons, Ltd.     

基于区域划分的立体视频整帧丢失错误隐藏新算法

针对立体视频传输中右视点整帧丢失,提出了一种基于区域划分的立体视频整帧丢失错误隐藏新算法。首先通过丢失帧视点内和视点间相邻帧的运动信息,估计丢失帧的运动区域与静止区域;然后利用视点间的全局视差,将丢失帧运动区域进一步划分为遮挡边界区域和非遮挡边界区域,并对遮挡边界区域和非遮挡边界区域分别采用运动补偿预测和视差补偿预测进行恢复,而对静止区域则直接采用帧拷贝的方法恢复丢失信息。实验结果表明,本文算法有效提高了所恢复的立体视频丢失帧图像的主客观质量。     

快速菱形搜索运动估计方法

提出一种快速菱形运动估计算法,利用运动矢量的中心偏移特性,在第一步搜索时设立一个门限值,减小获得运动矢量所需的搜索次数。实验结果表明,算法在降低计算复杂度的同时,保持了较好的图像质量。     

Adaptive Hysteresis Using Mobility Correlation for Fast Handover

The value of hysteresis has a significant effect on the handover performance measured in terms of the handover initiation delay and the number of handovers. To determine the hysteresis value effectively, a mobility correlation among users is utilized. In this letter, a grouping algorithm and an adaptive hysteresis algorithm based on the mobility correlation are proposed. It is shown that the proposed algorithms are very efficient in reducing both the handover initiation delay and the number of handovers.     

Empirical formulas and global reliability evaluation of reliability graphs

Some formulas have been reported, in terms of elements and nodes, to calculate the number of reliability graphs of identical elements in series-parallel configurations. A simple and efficient algorithm has been proposed for enumeration of spanning trees using an incidence matrix which is used for global reliability evaluation of a graph. An example demonstrates the effectiveness of the algorithm.     

State assignment scheme for two-level logic implementation based on a simulate annealing algorithm with a fast cost estimation method

A state assignment algorithm for two-level logic implementation based on a simulated annealing algorithm is proposed. To save CPU time an efficient cost estimation method is devised without losing much estimation accuracy. The experimental results based on 40 benchmark example finite state machines show that the number of cubes and area obtained by the proposed approach is approximately 10% less than that of the two-level state assignment program NOVA within a comparable CPU time. For a large example, it could reduce the number of product terms by more than 40%.<>     

无线传感器网络中ε-近似区域聚集算法

提出了能够满足任意误差和任意查询区域的ε-近似区域聚集算法。针对聚集函数SUM,提出了动态规划算法计算达到任意误差的最小数据传输量;针对聚集函数MAX/MIN,提出的算法通过只传输可能成为查询结果的数据来降低能量的消耗。在真实数据集上进行的实验表明,算法在满足任意区域和任意精度的同时,能够有效地减少能量消耗。     

Patch based image denoising using the finite ridgelet transform for less artifacts

Patch based denoising methods have proved to lead to state-of-the-art results. However, in contrast with intensive pursuing of higher peak signal to noise ratio (PSNR), less attention is paid to visual quality improvement of denoised images. In this paper, we first compare the denoising performance in edge and smooth regions. Results reveal that edge regions are the main source for potential performance improvement. This motivates us to investigate the use of the finite ridgelet transform as a local transform for better preservation of directional singularities. A two stage denoising algorithm is then proposed to improve the representation of detail structures. Experimental results in denoising images which only contain white noise show that the proposed algorithm consistently outperforms other methods in terms of PSNR and Structural SIMilarity index. Denoised images by the proposed method also demonstrate good visual quality with the least artifacts and fake structures in experiments on natural images.     

Recursive Algorithm for Reliability Evaluation of k-out-of-n:G System

An algorithm for computing recursively the exact system reliability of k-out-of-n systems is proposed. It is simple, easy to implement, fast, and memory efficient. It gives a reliability expression with minimal number of terms, C(k, n) and involves only a few multiplications. The reduction in number of terms and multiplications is over 50 percent compared to some methods. The recursive nature of the algorithm enables one to design easily the number of units in the system to meet a reliability target. An alternative representation of the algorithm which is easy to remember and good for manual computation is given. However, it involves a few more multiplications compared to the original one but fewer than those required with existing methods.     

Wavelet image coding based on significance extraction usingmorphological operations

An algorithm is proposed for improving Servetto et al.'s (see Proceedings of the International Conference on Image Processing, Washington, DC, p.530-3, 1995) method of morphological representation of wavelet data (MRWD), which is among the most efficient wavelet-based image compression algorithms. In MRWD, morphological dilation is used to capture and encode the arbitrarily shaped clusters of significant coefficients within each subband and high compression is achieved. But there are still several deficiencies for rectification in MRWD. An efficient image compression algorithm is proposed, in which, for each subband, morphological dilation is first used to extract and encode the clustered significant coefficients, and the remaining space is encoded in an efficient way. Instead of encoding the large number of zeros one by one, only the small number of remaining significant coefficients and their positional information are encoded. Experimental results show that this improvement is very effective, especially for images with large and relatively smooth regions     

An efficient algorithm for mobile objects localization

A new efficient algorithm based on time of arrival to determine the position of a mobile object (MO) in a wireless environment is proposed. Since all operations in our algorithm are simple add and shift operations, it can be easily implemented in the MO's firmware or hardware to reduce the number of instructions and computational cost involved in the localization task. Simulation results show that the proposed algorithm outperforms other algorithms in terms of computational cost and implementation simplicity. Copyright © 2007 John Wiley & Sons, Ltd.     

Analysis of Heuristic Graph Partitioning Methods for the Assignment of Packet Control Units in GERAN

Over the last few years, graph partitioning has been recognized as a suitable technique for optimizing cellular network structure. For example, in a recent paper, the authors proposed a classical graph partitioning algorithm to optimize the assignment of cells to Packet Control Units (PCUs) in GSM-EDGE Radio Access Network. Based on this approach, the quality of packet data services in a live environment was increased by reducing the number of cell re-selections between different PCUs. To learn more about the potential of graph partitioning in cellular networks, in this paper, a more sophisticated, yet computationally efficient, partitioning algorithm is proposed for the same problem. The new method combines multi-level refinement and adaptive multi-start techniques with algorithms to ensure the connectivity between cells under the same PCU. Performance assessment is based on an extensive set of graphs constructed with data taken from a live network. During the tests, the new method is compared with classical graph partitioning approaches. Results show that the proposed method outperforms classical approaches in terms of solution quality at the expense of a slight increase in computing time, while providing solutions that are easier to check by the network operator.     

链接文档中基于子空间分解的高效谱聚类算法

提出了一种基于子空间分解的高效谱聚类算法。首先,基于共识信息和特定域信息的矩阵分解将链接文档划分为3个子空间,然后对子空间添加正则化项建模共识信息和特定域信息对聚类的不同影响,并采用交替优化方法实现谱聚类。考虑到谱聚类的复杂性,提出了一种带曲线搜索的梯度下降法加速求解过程。3个真实数据集上的实验结果表明,所提算法在聚类质量和效率方面始终明显优于目前典型的基线算法,且对输入参数不敏感。     

Multi-frame de-raining algorithm using a motion-compensated non-local mean filter for rainy video sequences

This paper proposes a rain detection and removal algorithm that is robust against camera motion. The proposed algorithm initially detects possible rain streaks by using spatial properties, such as the luminance and structure of rain streaks. Then, the rain streak candidates are selected based on a Gaussian distribution model. Finally, these detected regions are improved with an advanced temporal property in a block-matching process. After the rain detection step, a non-rain block-matching algorithm for each block is performed between adjacent frames to find blocks similar to the block that has rain pixels. If similar blocks are obtained, the rain region of the block is reconstructed by spatio-temporal non-local mean filtering using similar neighboring regions. Finally, a specific post-processing is performed for visibility enhancement and flickering artifact removal. Experiment results show that the proposed algorithm uses only five temporally adjacent frames for rain removal but outperforms previous methods in terms of subjective visual quality.     

Relax online resource allocation algorithms for D2D communication

Maximizing the system sumrate by sharing the resource blocks among the cellular user equipments and the D2D (device to device) pairs while maintaining the quality of service is an important research question in a D2D communication underlaying cellular networks. The problem can be optimally solved in offline by using the weighted bipartite matching algorithm. However, in long‐term evolution and beyond (4G and 5G) systems, scheduling algorithms should be very efficient where the optimal algorithm is quite complex to implement. Hence, a low complexity algorithm that returns almost the optimal solution can be an alternative to this research problem. In this paper, we propose 2 less complex stable matching–based relax online algorithms those exhibit very close to the optimal solution. Our proposed algorithms deal with fixed number of cellular user equipments and a variable number of D2D pairs those arrive in the system online. Unlike online matching algorithms, we consider that an assignment can be revoked if it improves the objective function (total system sumrate). However, we want to minimize the number of revocation (ie, the number of changes in the assignments) as a large number of changes can be expensive for the networks too. We consider various offline algorithms proposed for the same research problem as relaxed online algorithms. Through extensive simulations, we find that our proposed algorithms outperform all of the algorithms in terms of the number of changes in assignment between 2 successive allocations while maintaining the total system sumrate very close to the optimal algorithm.