A primal-dual infeasible interior point algorithm for multiple objective linear programming (MOLP) problems was presented. In contrast to the current MOLP algorithm. moving through the interior of polytope but not con...A primal-dual infeasible interior point algorithm for multiple objective linear programming (MOLP) problems was presented. In contrast to the current MOLP algorithm. moving through the interior of polytope but not confining the iterates within the feasible region in our proposed algorithm result in a solution approach that is quite different and less sensitive to problem size, so providing the potential to dramatically improve the practical computation effectiveness.展开更多
Anchor-based detectors are widely used in object detection.To improve the accuracy of object detection,multiple anchor boxes are intensively placed on the input image,yet.Most of which are invalid.Although the anchor-...Anchor-based detectors are widely used in object detection.To improve the accuracy of object detection,multiple anchor boxes are intensively placed on the input image,yet.Most of which are invalid.Although the anchor-free method can reduce the number of useless anchor boxes,the invalid ones still occupy a high proportion.On this basis,this paper proposes a multiscale center point object detection method based on parallel network to further reduce the number of useless anchor boxes.This study adopts the parallel network architecture of hourglass-104 and darknet-53 of which the first one outputs heatmaps to generate the center point for object feature location on the output attribute feature map of darknet-53.Combining feature pyramid and CIoU loss function,this algorithm is trained and tested on MSCOCO dataset,increasing the detection rate of target location and the accuracy rate of small object detection.Though resembling the state-of-the-art two-stage detectors in overall object detection accuracy,this algorithm is superior in speed.展开更多
Swarm robot systems are an important application of autonomous unmanned surface vehicles on water surfaces.For monitoring natural environments and conducting security activities within a certain range using a surface ...Swarm robot systems are an important application of autonomous unmanned surface vehicles on water surfaces.For monitoring natural environments and conducting security activities within a certain range using a surface vehicle,the swarm robot system is more efficient than the operation of a single object as the former can reduce cost and save time.It is necessary to detect adjacent surface obstacles robustly to operate a cluster of unmanned surface vehicles.For this purpose,a LiDAR(light detection and ranging)sensor is used as it can simultaneously obtain 3D information for all directions,relatively robustly and accurately,irrespective of the surrounding environmental conditions.Although the GPS(global-positioning-system)error range exists,obtaining measurements of the surface-vessel position can still ensure stability during platoon maneuvering.In this study,a three-layer convolutional neural network is applied to classify types of surface vehicles.The aim of this approach is to redefine the sparse 3D point cloud data as 2D image data with a connotative meaning and subsequently utilize this transformed data for object classification purposes.Hence,we have proposed a descriptor that converts the 3D point cloud data into 2D image data.To use this descriptor effectively,it is necessary to perform a clustering operation that separates the point clouds for each object.We developed voxel-based clustering for the point cloud clustering.Furthermore,using the descriptor,3D point cloud data can be converted into a 2D feature image,and the converted 2D image is provided as an input value to the network.We intend to verify the validity of the proposed 3D point cloud feature descriptor by using experimental data in the simulator.Furthermore,we explore the feasibility of real-time object classification within this framework.展开更多
Low-order wavefront error account for a large proportion of wave aberrations.A compensation method for low order aberration of projection lithography objective based on Interior Point Method is presented.Compensation ...Low-order wavefront error account for a large proportion of wave aberrations.A compensation method for low order aberration of projection lithography objective based on Interior Point Method is presented.Compensation model between wavefront error and degree of movable lens freedom is established.Converting over-determined system to underdetermined system,the compensation is solved by Interior Point Method(IPM).The presented method is compared with direct solve the over-determined system.Then,other algorithm GA,EA and PS is compared with IPM.Simulation and experimental results show that the presented compensation method can obtained compensation with less residuals compared with direct solve the over-determined system.Also,the presented compensation method can reduce computation time and obtain results with less residuals compare with AGA,EA and PS.Moreover,after compensation,RMS of wavefront error of the experimental lithography projection objective decrease from 56.05 nm to 17.88 nm.展开更多
This paper presents the Pareto solutions in continuous multi-objective mathematical programming. We discuss the role of some assumptions on the objective functions and feasible domain, the relationship between them, a...This paper presents the Pareto solutions in continuous multi-objective mathematical programming. We discuss the role of some assumptions on the objective functions and feasible domain, the relationship between them, and compactness, contractibility and fixed point properties of the Pareto sets. The authors have tried to remove the concavity assumptions on the objective functions which are usually used in multi-objective maximization problems. The results are based on constructing a retraction from the feasible domain onto the Pareto-optimal set.展开更多
A new approach to select anoptimal set of test points is proposed. The described method uses fault-wise table and multi-objective genetic algorithm to find the optimal set of test points. First, the fault-wise table i...A new approach to select anoptimal set of test points is proposed. The described method uses fault-wise table and multi-objective genetic algorithm to find the optimal set of test points. First, the fault-wise table is constructed whose entries are measurements associated with faults and test points. The selection of optimal test points is transformed to the selection of the columns that isolate the rows of the table. Then, four objectives are described according to practical test requirements. The multi-objective genetic algorithm is explained. Finally, the presented approach is illustrated by a practical example. The results indicate that the proposed method can efficiently and accurately find the optimal set of test points and is practical for large scale systems.展开更多
Segmenting the touching objects in an image has been remaining as a hot subject due to the problematic complexities, and a vast number of algorithms designed to tackle this issue have come into being since a decade ag...Segmenting the touching objects in an image has been remaining as a hot subject due to the problematic complexities, and a vast number of algorithms designed to tackle this issue have come into being since a decade ago. In this paper, a new granule segmentation algorithm is developed using saddle point as the cutting point. The image is binarized and then sequentially eroded to form a gray-scale topographic counterpart, followed by using Hessian matrix computation to search for the saddle point. The segmentation is performed by cutting through the saddle point and along the maximal gradient path on the topographic surface. The results of the algorithm test on the given real images indicate certain superiorities in both the segmenting robustness and execution time to the referenced methods.展开更多
基金Supported by the Doctoral Educational Foundation of China of the Ministry of Education(20020486035)
文摘A primal-dual infeasible interior point algorithm for multiple objective linear programming (MOLP) problems was presented. In contrast to the current MOLP algorithm. moving through the interior of polytope but not confining the iterates within the feasible region in our proposed algorithm result in a solution approach that is quite different and less sensitive to problem size, so providing the potential to dramatically improve the practical computation effectiveness.
文摘Anchor-based detectors are widely used in object detection.To improve the accuracy of object detection,multiple anchor boxes are intensively placed on the input image,yet.Most of which are invalid.Although the anchor-free method can reduce the number of useless anchor boxes,the invalid ones still occupy a high proportion.On this basis,this paper proposes a multiscale center point object detection method based on parallel network to further reduce the number of useless anchor boxes.This study adopts the parallel network architecture of hourglass-104 and darknet-53 of which the first one outputs heatmaps to generate the center point for object feature location on the output attribute feature map of darknet-53.Combining feature pyramid and CIoU loss function,this algorithm is trained and tested on MSCOCO dataset,increasing the detection rate of target location and the accuracy rate of small object detection.Though resembling the state-of-the-art two-stage detectors in overall object detection accuracy,this algorithm is superior in speed.
基金supported by the Future Challenge Program through the Agency for Defense Development funded by the Defense Acquisition Program Administration (No.UC200015RD)。
文摘Swarm robot systems are an important application of autonomous unmanned surface vehicles on water surfaces.For monitoring natural environments and conducting security activities within a certain range using a surface vehicle,the swarm robot system is more efficient than the operation of a single object as the former can reduce cost and save time.It is necessary to detect adjacent surface obstacles robustly to operate a cluster of unmanned surface vehicles.For this purpose,a LiDAR(light detection and ranging)sensor is used as it can simultaneously obtain 3D information for all directions,relatively robustly and accurately,irrespective of the surrounding environmental conditions.Although the GPS(global-positioning-system)error range exists,obtaining measurements of the surface-vessel position can still ensure stability during platoon maneuvering.In this study,a three-layer convolutional neural network is applied to classify types of surface vehicles.The aim of this approach is to redefine the sparse 3D point cloud data as 2D image data with a connotative meaning and subsequently utilize this transformed data for object classification purposes.Hence,we have proposed a descriptor that converts the 3D point cloud data into 2D image data.To use this descriptor effectively,it is necessary to perform a clustering operation that separates the point clouds for each object.We developed voxel-based clustering for the point cloud clustering.Furthermore,using the descriptor,3D point cloud data can be converted into a 2D feature image,and the converted 2D image is provided as an input value to the network.We intend to verify the validity of the proposed 3D point cloud feature descriptor by using experimental data in the simulator.Furthermore,we explore the feasibility of real-time object classification within this framework.
文摘Low-order wavefront error account for a large proportion of wave aberrations.A compensation method for low order aberration of projection lithography objective based on Interior Point Method is presented.Compensation model between wavefront error and degree of movable lens freedom is established.Converting over-determined system to underdetermined system,the compensation is solved by Interior Point Method(IPM).The presented method is compared with direct solve the over-determined system.Then,other algorithm GA,EA and PS is compared with IPM.Simulation and experimental results show that the presented compensation method can obtained compensation with less residuals compared with direct solve the over-determined system.Also,the presented compensation method can reduce computation time and obtain results with less residuals compare with AGA,EA and PS.Moreover,after compensation,RMS of wavefront error of the experimental lithography projection objective decrease from 56.05 nm to 17.88 nm.
文摘This paper presents the Pareto solutions in continuous multi-objective mathematical programming. We discuss the role of some assumptions on the objective functions and feasible domain, the relationship between them, and compactness, contractibility and fixed point properties of the Pareto sets. The authors have tried to remove the concavity assumptions on the objective functions which are usually used in multi-objective maximization problems. The results are based on constructing a retraction from the feasible domain onto the Pareto-optimal set.
基金supported by the Advanced Research Project of a National Department of China under Grant No.51317040102
文摘A new approach to select anoptimal set of test points is proposed. The described method uses fault-wise table and multi-objective genetic algorithm to find the optimal set of test points. First, the fault-wise table is constructed whose entries are measurements associated with faults and test points. The selection of optimal test points is transformed to the selection of the columns that isolate the rows of the table. Then, four objectives are described according to practical test requirements. The multi-objective genetic algorithm is explained. Finally, the presented approach is illustrated by a practical example. The results indicate that the proposed method can efficiently and accurately find the optimal set of test points and is practical for large scale systems.
基金Ningbo Natural Science Foundation (No.2006A610016)Foundation of the Ministry of Education Ministry for Returned Overseas Students & Scholars (SRF for ROCS, SEM. No.2006699).
文摘Segmenting the touching objects in an image has been remaining as a hot subject due to the problematic complexities, and a vast number of algorithms designed to tackle this issue have come into being since a decade ago. In this paper, a new granule segmentation algorithm is developed using saddle point as the cutting point. The image is binarized and then sequentially eroded to form a gray-scale topographic counterpart, followed by using Hessian matrix computation to search for the saddle point. The segmentation is performed by cutting through the saddle point and along the maximal gradient path on the topographic surface. The results of the algorithm test on the given real images indicate certain superiorities in both the segmenting robustness and execution time to the referenced methods.