Simulated annealing technique has mostly been used to solve various optimization and learning problems, and it is well known that the maximum clique problem is one of the most studied NP-hard optimization problems owi...
详细信息
Simulated annealing technique has mostly been used to solve various optimization and learning problems, and it is well known that the maximum clique problem is one of the most studied NP-hard optimization problems owing to its numerous applications. In this note, a simple simulated annealing algorithm for the maximum clique problem is proposed and tested on all 80 DIMACS maximum clique instances. Although it is simple, the proposed simulated annealing algorithm is efficient on most of the DIMACS maximum clique instances. The simulation results show that the proposed simulated annealing algorithm outperforms a recent efficient simulated annealing algorithm proposed by Xu and Ma, and the solutions obtained by the proposed simulated annealing algorithm have the equal quality with those obtained by a recent trust region heuristic algorithm of Stanislav Busygin. (C) 2007 Elsevier Inc. All rights reserved.
Among various DNA computing algorithms, it is very important to generate an initial data pool that covers both correct and incorrect answers. However, algorithms based on brute force search are limited to problem size...
详细信息
Among various DNA computing algorithms, it is very important to generate an initial data pool that covers both correct and incorrect answers. However, algorithms based on brute force search are limited to problem size, since the bigger the problem, the bigger the initial data pool. In this paper, we propose a recursive molecular sticker algorithm to resolve the maximal clique problem. Some graphs with more vertices can be handled with the proposed algorithm. Particularly, our algorithm is adapted to some graphs with lower edge density. For a given graph with n vertices, the time complexity of our algorithm is O(n(2)). In addition, three kinds of enzymes, two kinds of memory strands, n kinds of stickers, n sticker tubes, n+2 separation tubes and n data tubes are necessary for our recursive molecular sticker algorithm to resolve the maximal clique problem.
In this paper, we propose an improved particle filter algorithm for real-time tracking a randomly moving target in dynamic environment with a moving monocular camera. For making the tracking task robustly and effectiv...
详细信息
ISBN:
(纸本)9780819469502
In this paper, we propose an improved particle filter algorithm for real-time tracking a randomly moving target in dynamic environment with a moving monocular camera. For making the tracking task robustly and effectively, color histogram based target model is integrated into particle filter algorithm. Bhattacharyya distance is used to weight samples by calculating each sample's histogram with a specified target model and it makes the measurement matching and samples' weight updating more reasonable. In order to reduce sample depletion, the improved algorithm will be able to take the latest observation into account. The experimental results confirm that the method is effective even when the monocular camera is moving and the target object is partially occluded in a clutter background.
The digital compensatory millimeter wave radiometer is a new type of radiometer, which uses the digital compensatory operator to compensate gain and receiver noise fluctuation. This paper aims at the full digital comp...
详细信息
The digital compensatory millimeter wave radiometer is a new type of radiometer, which uses the digital compensatory operator to compensate gain and receiver noise fluctuation. This paper aims at the full digital compensatory 8 MMW radiometer which was designed, proposing the analysis method of its sensitivity, obtaining the mathematical formulae of its equivalent integration time and the best sensitivity adjustment method by software.
This paper presents an enhanced multi-level filter algorithm and its Very Large Scale Integration (VLSI) architecture for infrared imageprocessing. The modified multi-level filter algorithm resolves the splitting tar...
详细信息
This paper presents an enhanced multi-level filter algorithm and its Very Large Scale Integration (VLSI) architecture for infrared imageprocessing. The modified multi-level filter algorithm resolves the splitting targets problem using Gaussian pyramid processing. Owning three filtering paths, the proposed VLSI architecture of the filter can simultaneously enhance small targets with different sizes in infrared images. Some design techniques in implementing hardwired multiplication, subsample and asynchronous FIFO have been presented. This VLSI architecture has been implemented using Semiconductor Manufacturing International Corporation (SMIC) 0.35 mu m 4-layer CMOS technology. The simulation results show that it not only effectively suppresses background, eliminates noise and enhances small targets in an infrared image comparing with other small target detective methods, but also meets infrared image real-time processing requirements (5M similar to 10M pixels/s). The implemented filter chip consists of 60,284 gates and 8 K Static Random Access Memory (SRAM), operates at 50 MHz.
A novel improved broyden's method has been presented to estimate image jacobian matrix for uncalibrated visual servoing. In this paper, we apply chebyshev polynomial as a cost function to approximate best value. C...
详细信息
ISBN:
(纸本)9780819469526
A novel improved broyden's method has been presented to estimate image jacobian matrix for uncalibrated visual servoing. In this paper, we apply chebyshev polynomial as a cost function to approximate best value. Compared with recursive least square (RLS) algorithm which is restricted by the prior knowledge for obtaining some performances, chebyshev polynomial algorithm has a great adaptability to estimate jacobian parameter, even without the prior knowledge. A microscopic image jacobian model has been developed for the four degree-of-freedom micromanipulator in our microassembly system. The performance has been confirmed by simulations and experiments.
A contour detection model, inspired by the behavior of the primary visual cortex, is presented. The response of a central stimulus in the receptive field is affected by the presence of surrounding stimuli - for some s...
详细信息
A contour detection model, inspired by the behavior of the primary visual cortex, is presented. The response of a central stimulus in the receptive field is affected by the presence of surrounding stimuli - for some stimulus conditions, the response is suppressed and for other conditions the response is enhanced. The visual mechanisms of contextual influences are utilized to extract "coherent" configurations. This is mainly due to the following two reasons: (1) on the one hand, a smooth contour can yield collinear excitation, which highlights smooth contours from irregularly textured surround;(2) on the other hand, similar orientation textures receive iso-orientation surround suppression and region boundary is subjected to the less inhibition, which makes boundary more salient for perceptual pop-out. Accordingly, smooth contours progressively stand out from their surround and at the same time textures are gradually suppressed by their surround through dynamic fine-tuning of contextual information. The proposed method which distinguishes between contours and texture edges is more effective for contour-based object recognition tasks. Initial experiments show that the model can be successfully applied to contour detection. Especially, when object contours are lumped together with unwantedly cluttered surround, the advantage of our approach is more prominent. This study provides a biological scheme for contour detection in computer vision. (c) 2006 Elsevier B.V. All rights reserved.
In traditional Direct Torque control (DTC), speed regulator is widely based on conventional Proportional Integral Derivative (PID) controller, which has to depend on precise math model of the subject. However, PID can...
详细信息
ISBN:
(纸本)9781424407361
In traditional Direct Torque control (DTC), speed regulator is widely based on conventional Proportional Integral Derivative (PID) controller, which has to depend on precise math model of the subject. However, PID cannot easily achieve swift response, small overshooting and fine speed control precision especially in low speed range. This paper introduces a nonlinear control tcchnology-Auto Disturbance Rejection controller (ADRC) into DTC to improve the speed adaptation capability and robustness, and a parameter design method of stator flux estimation is proposed. The simulation results prove the system has good control performance.
In this paper, a face recognition method using local qualitative representations is proposed to solve the problem of face recognition in varying lighting. Based on the observation that the ordinal relationship between...
详细信息
ISBN:
(纸本)9780819469526
In this paper, a face recognition method using local qualitative representations is proposed to solve the problem of face recognition in varying lighting. Based on the observation that the ordinal relationship between the average brightness of image regions pair is invariant under lighting changes, Local Binary Mapping is defined as an illumination invariant for face recognition based on Local Binary Pattern descriptor, which extracts the local variance features of an image. For the 'symbol' feature vector, hamming distance is used as similarity measurement. It has been proved that the proposed method can provide the accuracy of 100 percent for subset 2, 3, 4 and 98.89 percent for subset 5 of the Yale facial database B when all images in subset 1 are used as gallery.
Vessel segmentation is the base of three dimensional reconstruction on digital subtraction angiography (DSA) images. In this paper we propose two simple but efficient methods of vessel segmentation for DSA images. The...
详细信息
Vessel segmentation is the base of three dimensional reconstruction on digital subtraction angiography (DSA) images. In this paper we propose two simple but efficient methods of vessel segmentation for DSA images. The original DSA image is divided into several appropriate subimages according to a prior knowledge of the diameter of vessels. We introduce the vessels existence measure to determine whether each subimage contains vessels and then choose an optimal threshold, respectively, for every subimage previously determined to contain vessels. Finally, an overall binarization of the original image is achieved by combining the thresholded subimages. Experiments are implemented on cerebral and hepatic DSA images. The results demonstrate that our proposed methods yield better binary results than global thresholding methods and some other local thresholding methods do. (c) 2006 Elsevier B.V. All rights reserved.
暂无评论