In this paper we combine the largest minimum distance algorithm and the traditional K-Means algorithm to propose an improved K-Means clustering algorithm. This improved algorithm can make up the shortcomings for the t...
详细信息
In this paper we combine the largest minimum distance algorithm and the traditional K-Means algorithm to propose an improved K-Means clustering algorithm. This improved algorithm can make up the shortcomings for the traditional K-Means algorithm to determine the initial focal point. The improved K-Means algorithm effectively solved two disadvantages of the traditional algorithm, the first one is greater dependence to choice the initial focal point, and another one is easy to be trapped in local minimum[1][2].
Based on the distance algorithm by Gilbert et al., this paper presents a numerical algorithm for computing the intersection of the boundary of a compact convex set with a ray emanating from an interior point of the se...
详细信息
ISBN:
(纸本)9781424427888
Based on the distance algorithm by Gilbert et al., this paper presents a numerical algorithm for computing the intersection of the boundary of a compact convex set with a ray emanating from an interior point of the set, which is known as the ray-shooting problem. Affinely independent points on the boundary of the convex set are also determined such that the intersection point can be written as their convex combination. Because of its high efficiency and other good qualities, this algorithm provides superior solutions to three fundamental problems in robotic grasping, i.e., force-closure test, contact force optimization, and grasp quality evaluation, which can be formulated as the ray-shooting problem.
In this paper we introduce the new method for computing the 2D position of an eye and its gaze direction from a single camera and one light source. The method is based on distance algorithm compound with skeleting and...
详细信息
ISBN:
(纸本)9783540368397
In this paper we introduce the new method for computing the 2D position of an eye and its gaze direction from a single camera and one light source. The method is based on distance algorithm compound with skeleting and layering algorithm for detecting the central point of gaze. After above steps we have been used reversed distance algorithm to correct probable error. Next, the direction of gaze can be computed from comparison of this central point with calibration's points that we call them "point of space limited". At the end, we compare our method with other method like cross-line that has been used in newest eye tracking equipments and found that our method worked clearly better.
The massive web-based information resources have led to an increasing demand for effective automatic retrieval of target information for web applications. This paper introduces a web-based data extraction tool that de...
详细信息
The massive web-based information resources have led to an increasing demand for effective automatic retrieval of target information for web applications. This paper introduces a web-based data extraction tool that deploys various algorithms to locate, extract and filter tabular data from HTML pages and to transform them into new web-based representations. The tool has been applied in an aquaculture web application platform for extracting and generating aquatic product market information. Results prove that this tool is very effective in extracting the required data from web pages.
The k most vital arcs in a network are those whose removal from the network results in the greatest increase in the shortest distance between two specified nodes. An exact algorithm is proposed to determine the k most...
详细信息
The k most vital arcs in a network are those whose removal from the network results in the greatest increase in the shortest distance between two specified nodes. An exact algorithm is proposed to determine the k most vital arcs. Furthermore, an algorithm of time complexity equal to that of Dijkstra's algorithm for the shortest path problem is developed to solve the single most vital arc problem.
暂无评论