• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.1939-1944
• /
• 2003

This paper presents a global path planning algorithm based on a visibility graph method, and applies additionally various constraints for constructing the reduced visibility graph. The modification algorithm for generating the rounded path is applied to the globally shortest path of the visibility graph using the robot size constraint in order to avoid the obstacle. In order to check the visibility in given 3D map data, 3D CAD data with VRML format is projected to the 2D plane of the mobile robot, and the projected map is converted into an image for easy map analysis. The image processing are applied to this grid map for extracting the obstacles and the free space. Generally, the tree size of visibility graph is proportional to the factorial of the number of the corner points. In order to reduce the tree size and search the shortest path efficiently, the various constraints are proposed. After short paths that crosses the corner points of obstacles lists up, the shortest path among these paths is selected and it is modified to the combination of the line path and the arc path for the mobile robot to avoid the obstacles and follow the rounded path in the environment. The proposed path planning algorithm is applied to the mobile robot LCAR-III.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.25 no.2
• /
• pp.31-42
• /
• 1997

Visibility has been used for Visual Impact Assessment and Buildingheight Control. The purpose of this study is to elaborate visibility analysis technique in GIS, and to design a visual information system baed on this technique for diverse application. The results of this study are as follows : 1) By classifying visibility analysis techniques into two groups, Each one's merits and demerits were investigated. Practically GIS visibility analysis by DTM model using contour map and investigating it by means of site-observation can be the most effective method. 2) A visibility analysis techniquwe for V.I.A. and B.H.C. was presented by studying GIS visibility analysis by means of DTM model using contour map. There were 5 problems. 3) Adequate analysis techniques were presented according to the landscape factor-road, ship-route, port, mountain, etc. 4) Viewing distance from road and ship-route in visual corridor, landma가 visibility and distance, the angle of incidence and invisible region's depth are helpful for land scape management or land use planning.

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.1
• /
• pp.48-52
• /
• 2010

In this paper, we introduce a new path planning algorithm which combines the merits of a visibility graph algorithm and an adaptive cell decomposition. We quantize a given map with empty cells, blocked cells, and mixed cells, then find the optimal path on the quantized map using a visibility graph algorithm. For reducing the number of the quantized cells we use the quad-tree technique which is used in an adaptive cell decomposition, and for improving the performance of the visibility checking in making a visibility graph we propose a new visibility checking method which uses the property of the quad-tree instead of the well-known rotational sweep-line algorithm. For the more efficient visibility checking, we propose two additional improvements for our suggested method. Both of them are used for reducing the visited cells in the quad-tree. The experiments for a performance comparison of our algorithm with other well-known algorithms show that our proposed method is superior to others.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.12 no.1
• /
• pp.80-87
• /
• 2009

The purpose of this study is to analyze the MAUP's effect in visibility analysis using GIS. MAUP normally occurs in the process in terrain spatial analysis including visibility analysis. There are two different types of grid data(based on digital map and Digital Terrain Elevation Data) and 10 different types of areal units are made for modeling, such as $5m{\times}5m,\;10m{\times}10m,\;15m{\times}15m,\;20m{\times}20m,\;25m{\times}25m,\;30m{\times}30m,\;35m{\times}35m,\;40m{\times}40m,\;45m{\times}45m,\;50m{\times}50$. By analyzing the result, it was possible to observe varying viewshed areas according to different grid cell sizes and the viewshed area did not varied linearly as expected. From a general point of view, smaller unit data map out the real world in more detail, but the results of modeling do not always reach a good conclusion when data are used in modeling for terrain analysis because of the MAUP' effect. The grid cell sizes of 30m or less seems to be adequate for visibility analysis, including terrain analysis considering vegetation heights.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.12C
• /
• pp.1194-1200
• /
• 2006

In this paper, we propose an adaptive MAP (Maximum A Posteriori) high-resolution image reconstruction algorithm using local statistics. In order to preserve the edge information of an original high-resolution image, a visibility function defined by local statistics of the low-resolution image is incorporated into MAP estimation process, so that the local smoothness is adaptively controlled. The weighted non-quadratic convex functional is defined to obtain the optimal solution that is as close as possible to the original high-resolution image. An iterative algorithm is utilized for obtaining the solution, and the smoothing parameter is updated at each iteration step from the partially reconstructed high-resolution image is required. Experimental results demonstrate the capability of the proposed algorithm.

• Journal of Korea Multimedia Society
• /
• v.11 no.5
• /
• pp.692-702
• /
• 2008

Path planning is gaining more weight in computer games and virtual reality as the number of self-moving characters increases. In the roadmap approach, the map of possible paths is built in advance to plan paths for a character, whose advantage is to provide high-quality paths. On the other hand, a disadvantage is that the road map doesn't reflect properties of characters such as their sizes because they move on the same map once the road map is constructed. In this paper we propose an efficient method to build a different road map for each character so that it can use its own map for path-planning. This method is efficient because the whole map is built once by applying the Visibility Graph regardless of the number of characters and walkable paths are incrementally inserted according to the sizes of characters. The effects of using separate roadmaps are demonstrated through simulations and the trade-offs accompanied with these effects are analyzed.

• Journal of the Korea Society for Simulation
• /
• v.15 no.2
• /
• pp.31-39
• /
• 2006

The visibility graph is a well-known method for efficient path-finding with the minimum search space modelling the game world. The generalized visibility graph is constructed on the expanded obstacle boundaries to eliminate the "wall-hugging" problem which is a major disadvantage of using the visibility graph. The paths generated by the generalized visibility graph are guaranteed to be near optimal and natural-looking. In this paper we propose the method to apply the generalized visibility graph efficiently for game characters who moves among static obstacles between varying start and goal points. Even though the space is minimal once the generalized visibility graph is constructed, the construction itself is time-consuming in checking the intersection between every two links connecting nodes. The idea is that we build the map for static obstacles first and then incorporate start and goal nodes quickly. The incorporation of start and goal nodes is the part that must be executed repeatedly. Therefore we propose to use the rotational plane-sweep algorithm in the computational geometry for incorporating start and goal nodes efficiently. The simulation result shows that the execution time has been improved by 39%-68% according to running times in the game environment with multiple static obstacles.

• Journal of information and communication convergence engineering
• /
• v.22 no.1
• /
• pp.70-79
• /
• 2024

Bad weather conditions such as haze lead to a significant lack of visibility in images, which can affect the functioning and reliability of image processing systems. Accordingly, various single-image dehazing (SID) methods have recently been proposed. Existing SID methods have introduced effective visibility improvement algorithms, but they do not reflect the image's perspective, and thus have limitations that distort the sky area and nearby objects. This study proposes a new SID method that reflects the sense of space by defining the correlation between image brightness and haze. The proposed method defines the haze intensity by calculating the airlight brightness deviation and sets the weight factor of the depth map by classifying images based on the defined haze intensity into images with a large sense of space, images with high intensity, and general images. Consequently, it emphasizes the contrast of nearby images where haze is present and naturally smooths the sky region to preserve the image's perspective.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.35 no.12
• /
• pp.1095-1100
• /
• 2007

Visibility of the satellite navigation is related to a environmental condition of a receiver. Obstacles like buildings and trees in urban areas can block signals and have effects on accuracy and reliability of positioning. This paper presents a method of creating 3D analysis model of urban canyon of Seoul using three-Dimensional digital map. Analysis techniques of visible satellites with Ray-Polygon Collision Detection and validation of algorithm through field tests are discussed. We have compared and analyzed the visibility of GPS and Galileo with respect to separate and simultaneous tracking in view of DOP (Dilution of Precision) using the 3D GIS digital map.

• IEIE Transactions on Smart Processing and Computing
• /
• v.3 no.2
• /
• pp.65-73
• /
• 2014

An overall responding security-centered framework is necessary required for infringement accidents, failures, and cyber threats. On the other hand, the correspondence structures of existing administrative, technical, physical security have weakness in a system responding to complex attacks because each step is performed independently. This study will recognize all internal and external users as a potentially threatening element. To perform connectivity analysis regarding an action, an intelligent convergence security framework and road map is suggested. A suggested convergence security framework was constructed to be independent of an automatic framework, such as the conventional single solution for the priority defense system of APT of the latest attack type, which makes continuous reputational attacks to achieve its goals. This study suggested the next generation convergence security framework to have preemptive responses, possibly against an APT attack, consisting of the following five hierarchical layers: domain security, domain connection, action visibility, action control, and convergence correspondence. In the domain, the connection layer suggests a security instruction and direction in the domains of administrative, physical and technical security. The domain security layer has consistency of status information among the security domain. A visibility layer of an intelligent attack action consists of data gathering, comparison and decision cycle. The action control layer is a layer that controls the visibility action. Finally, the convergence corresponding layer suggests a corresponding system of before and after an APT attack. The administrative security domain had a security design based on organization, rule, process, and paper information. The physical security domain is designed to separate into a control layer and facility according to the threats of the control impossible and control possible. Each domain action executes visible and control steps, and is designed to have flexibility regarding security environmental changes. In this study, the framework to address an APT attack and load map will be used as an infrastructure corresponding to the next generation security.