A cross point assignment algorithm is proposed under consideration of very long nets (LCPA).It is to consider not only the cost of connection between cross points and pins and the exclusive cost among cross points on ...A cross point assignment algorithm is proposed under consideration of very long nets (LCPA).It is to consider not only the cost of connection between cross points and pins and the exclusive cost among cross points on the boundary of a global routing cell,but also the cost of displacement among cross points of the same net.The experiment results show that the quality and speed in the following detailed routing are improved obviously,especially for very long nets.展开更多
An algorithm to resolve the coupling effect problem is proposed during the cross point assignment (CPA) stage.In the algorithm,the priority queue concept and the rip-up and reroute strategy are combined to control cro...An algorithm to resolve the coupling effect problem is proposed during the cross point assignment (CPA) stage.In the algorithm,the priority queue concept and the rip-up and reroute strategy are combined to control crosstalk noise caused by interconnect coupling capacitance.First,the nets are arranged into different priority queues according to their weighted sum of their length and criticality.Then,the CPA problem for one queue of nets is translated into a linear assignment problem.After the assignment of one queue of nets,a post-CPA checking routine is performed to check and rip up the net pairs which violate the crosstalk noise constraint and then push them into the next queue to be reassigned.The algorithm is tested by a set of bench mark examples,and the experimental results are promising...展开更多
Visual tracking, which has been widely used in many vision fields, has been one of the most active research topics in computer vision in recent years. However, there are still challenges in visual tracking, such as il...Visual tracking, which has been widely used in many vision fields, has been one of the most active research topics in computer vision in recent years. However, there are still challenges in visual tracking, such as illumination change, object occlu- sion, and appearance deformation. To overcome these difficulties, a reliable point assignment （RPA） algorithm based on wavelet transform is proposed. The reliable points are obtained by searching the location that holds local maximal wavelet coefficients. Since the local maximal wavelet coefficients indicate high variation in the image, the reliable points are robust against image noise, illumination change, and appearance deformation. Moreover, a Kalman filter is applied to the detection step to speed up the detection processing and reduce false detection. Finally, the proposed RPA is integrated into the tracking-learning-detection （TLD） framework with the Kalman filter, which not only improves the tracking precision, but also reduces the false detections. Experimental results showed that the new framework outperforms TLD and kernelized correlation filters with respect to precision, f-measure, and average overlap in percent.展开更多
文摘A cross point assignment algorithm is proposed under consideration of very long nets (LCPA).It is to consider not only the cost of connection between cross points and pins and the exclusive cost among cross points on the boundary of a global routing cell,but also the cost of displacement among cross points of the same net.The experiment results show that the quality and speed in the following detailed routing are improved obviously,especially for very long nets.
文摘An algorithm to resolve the coupling effect problem is proposed during the cross point assignment (CPA) stage.In the algorithm,the priority queue concept and the rip-up and reroute strategy are combined to control crosstalk noise caused by interconnect coupling capacitance.First,the nets are arranged into different priority queues according to their weighted sum of their length and criticality.Then,the CPA problem for one queue of nets is translated into a linear assignment problem.After the assignment of one queue of nets,a post-CPA checking routine is performed to check and rip up the net pairs which violate the crosstalk noise constraint and then push them into the next queue to be reassigned.The algorithm is tested by a set of bench mark examples,and the experimental results are promising...
基金Project supported by the National Natural Science Foundation of China （Nos. 61671213 and 61302058） and the Guangzhou Key Lab of Body Data Science （No. 201605030011）
文摘Visual tracking, which has been widely used in many vision fields, has been one of the most active research topics in computer vision in recent years. However, there are still challenges in visual tracking, such as illumination change, object occlu- sion, and appearance deformation. To overcome these difficulties, a reliable point assignment （RPA） algorithm based on wavelet transform is proposed. The reliable points are obtained by searching the location that holds local maximal wavelet coefficients. Since the local maximal wavelet coefficients indicate high variation in the image, the reliable points are robust against image noise, illumination change, and appearance deformation. Moreover, a Kalman filter is applied to the detection step to speed up the detection processing and reduce false detection. Finally, the proposed RPA is integrated into the tracking-learning-detection （TLD） framework with the Kalman filter, which not only improves the tracking precision, but also reduces the false detections. Experimental results showed that the new framework outperforms TLD and kernelized correlation filters with respect to precision, f-measure, and average overlap in percent.
