ANFIS Definition of Focal Length for Zoom Lens via Fuzzy Logic Functions

The digital cameras have been effected from systematical errors which decreased metric quality of image. The digital cameras have been effected from systematical errors that decreases metric quality of image. The aim of this chapter is to explore usability of fuzzy logic on calibration of digital cameras. Therefore, a 145‐pointed planar test field has been prepared in the laboratories of Department of Geodesy and Photogrammetric Engineering at the Gebze Technical University. The test field has been imaged from five points of view with the digital camera Nikon Coolpix‐E8700 within maximum (71.2 mm) and minimum (8.9 mm) focal length. The input-output data have been determined from 10 calibration images obtained for fuzzy logic process. These data have also been used and formed for the space resection process. Adaptive neuro‐fuzzy inference system (ANFIS) functions have been used for fuzzy process at MATLAB 7.0, and the results of these two distinct methods have been compared. Finally, the most convenient (least squares average error) or the most useful ANFIS “Trimf, trapmf, gbellmf, gaussmf, gauss2mf, pimf, dsigmf and psigmf” functions are determined and compared for space resection method for the conventional bundle adjustment process

Shortest Route at Dynamic Location with Node Combination-Dijkstra Algorithm

Abstract— Online transportation has become a basic requirement of the general public in support of all activities to go to work, school or vacation to the sights. Public transportation services compete to provide the best service so that consumers feel comfortable using the services offered, so that all activities are noticed, one of them is the search for the shortest route in picking the buyer or delivering to the destination. Node Combination method can minimize memory usage and this methode is more optimal when compared to A* and Ant Colony in the shortest route search like Dijkstra algorithm, but can’t store the history node that has been passed. Therefore, using node combination algorithm is very good in searching the shortest distance is not the shortest route. This paper is structured to modify the node combination algorithm to solve the problem of finding the shortest route at the dynamic location obtained from the transport fleet by displaying the nodes that have the shortest distance and will be implemented in the geographic information system in the form of map to facilitate the use of the system. Keywords— Shortest Path, Algorithm Dijkstra, Node Combination, Dynamic Location (key words