In this article, a novel change detection algorithm is proposed based on the Kantorovich distance concept. Incorporating the proposed change detection algorithm with the existing process monitoring tools may assist th...
详细信息
The major contributions of this paper are as follows: (1) the Gilbert-Johnson-Keerthi (GJK) algorithm is a collisions detector algorithm, a modified Gilbert-Johnson-Keerthi algorithm is presented, the proposed GJK alg...
详细信息
The major contributions of this paper are as follows: (1) the Gilbert-Johnson-Keerthi (GJK) algorithm is a collisions detector algorithm, a modified Gilbert-Johnson-Keerthi algorithm is presented, the proposed GJK algorithm uses a different distance, (2) some examples of GJK algorithm are presented, in the last example, the GJK distance algorithm is used to detect the collisions of a camera with its environment inside of a warehouse, the camera cannot cross any part of the structure of the warehouse, the camera needs to go around the structure, when the camera touches the structure, the camera goes to the right or to the left, (3) the time used in a cycle of work of the transelevator robotic arm is presented, it can be extended to other kind of robotic arms, (4) some examples of the time used in a cycle of work are presented, in the least example, the algorithm is used to control the time needed for the transelevator to go from one place to other one, (5) this paper presents a new trajectory planning algorithm which divides the trajectory in n periods, when n is equal to 2, the proposed algorithm is the same as other algorithms, but for n higher than 2, the proposed algorithm gives other optional trajectories, so the proposed algorithm lets the designer to take a better trajectory than with the previous algorithms, (6) some examples of the proposed trajectories planning algorithm are presented, in the least example, the proposed trajectory planning algorithm is used to control the movements of a transelevator inside of a warehouse.
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.
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.
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.
With development of content-based image retrieval (CBIR), mobile visual search (MVS) is a promising application. In typical MVS, similar images are retrieved from the database maintained by the server, given a query i...
详细信息
ISBN:
(纸本)9780769550886
With development of content-based image retrieval (CBIR), mobile visual search (MVS) is a promising application. In typical MVS, similar images are retrieved from the database maintained by the server, given a query image taken by mobile devices. Different from general CBIR, the problem of transmission latency should be considered in MVS. In existing work, the progressive transmission is proposed to minimize the data size in transmission by low-dimensional feature descriptors and compression coding in order to reduce the transmission latency in MVS. Although the retrieval speed is improved by existing progressive transmission methods, the result accuracy is decreased because of the information loss in these methods. To address this problem, this paper proposes a novel framework for MVS which consists of a new progressive transmission model based on image saliency (MVSS) and a new distance metric corresponding to the proposed progressive transmission model. In our framework, we use SIFT descriptors to represent images, which can preserve more information than other low-dimensional feature descriptors and compression coding. Although SIFT is high-dimensional descriptor, we only transmit the SIFT descriptors in salient regions of image to reduce the transmission latency. We evaluate our framework on Stanford image set, and the results demonstrate that our framework not only reduces the transmission latency but also achieves a better retrieval accuracy.
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.
In cases where addresses entry should be entered as free text, it is necessary for the delivery service quality to be improved by correcting the errors and deficiencies of the addresses and standardizing them to geogr...
详细信息
ISBN:
(纸本)9781728119045
In cases where addresses entry should be entered as free text, it is necessary for the delivery service quality to be improved by correcting the errors and deficiencies of the addresses and standardizing them to geographic coordinate information. In our study, it is aimed to develop a system using Support Vector Machines algorithm which is used on matching free text address data with standard address. The model trained with using classified data serves to express the similarity between a free text address and a standard address as a numerical value. It is confirmed that using the developed system, queries made with free text addresses over a database created from 250.000 addresses, the system has achieved a matching accuracy exceeding 81%.
To enhance the fault location precision of multistage feeders in distribution network, a new section location method is proposed. In this paper, the fault characteristics of transient zero-sequence current transient c...
详细信息
ISBN:
(纸本)9781728121482
To enhance the fault location precision of multistage feeders in distribution network, a new section location method is proposed. In this paper, the fault characteristics of transient zero-sequence current transient components are analyzed, and the amplitude characteristics of zero-sequence current in the upstream and downstream nodes of the fault point are determined by using the mathematical relationship. The Hausdorff distance algorithm is introduced to construct a comprehensive criterion combining section distance and correlation coefficient. Further, the fault section can be effectively distinguished by comparing the criterion with the set threshold The Matlab simulation demonstrates that the proposed method can accurately locate the fault section.
When entering a PIN on the touch screen of smartphone, users have their unique patterns, which shows different time interval, strength, position, and usage angel. Using this user's pattern, it is possible to disti...
详细信息
ISBN:
(纸本)9781509013258
When entering a PIN on the touch screen of smartphone, users have their unique patterns, which shows different time interval, strength, position, and usage angel. Using this user's pattern, it is possible to distinguish the imposter who knows the user's PIN, then the PIN verification can be enhanced in the smartphone environment. In this paper, we tested classifiers with five features that can be extracted from smartphone sensors. Also, we collected keystroke data for each user's posture, and compared the characteristics of the posture. We consider the importance of preprocessing and feature combinations.
暂无评论