• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.5
• /
• pp.583-597
• /
• 2001

Tracking the targets of interest has been one of the major research areas in radar surveillance system. We formulate the tracking problem as an incomplete data problem and apply the EM algorithm to obtain the MAP estimate. The resulting filter has a recursive structure analogous to the Kalman filter. The difference is that the measurement-update deals with multiple measurements and the parameter-update can estimate the system parameters. Through extensive experiments, it turns out that the proposed system is better than PDAF and NNF in tracking the targets. Also, the performance degrades gracefully as the disturbances become stronger.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2010.04a
• /
• pp.281-284
• /
• 2010

Recently the development of digital based measurement sensor with which a variety of surveying equipment and methods are being developed. In the field of aerial mapping using GPS, INS and Digital Camera instead of Film based Camera. In case of aerial photogrammetry for mapping, it is effective on wide area. But it is ineffective on narrow area. Therefore, the research experimented that used LiDAR sensor based mobile mapping systems for modify and update about region of Suwon and Yeouido. From these results a possibility and an effectiveness analyzed and evaluated LiDAR sensor based mobile mapping systems.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.7-8
• /
• 2006

F-HMIPv6 is protocol that supports fast handovers for Hierarchical Mobile IPv6. Unlike HMIPv6 (Hierarchical Mobile IPv6), it sends FBU(Fast Binding Update) by predicted Router's Information for a potential handover. But, The current version of this protocol doesn't ensure impeccably between mobile node and router. To make up for the weak points of the security, we propose the architecture for F-HMIPv6 protocol to structurally reinforce the security and improve weak security of among mobile node, MAP(Mobility Anchor Point), and routers for binding update when mobile node conducts handovers.

• Journal of Korean Society for Geospatial Information Science
• /
• v.22 no.4
• /
• pp.3-11
• /
• 2014

Recently, rapid urbanization has necessitated continuous updates in digital map to provide the latest and accurate information for users. However, conventional aerial photogrammetry has some restrictions on periodic updates of small areas due to high cost, and as-built drawing also brings some problems with maintaining quality. Alternatively, this paper proposes a scheme for efficient and accurate update of digital map using point cloud data acquired by Terrestrial Laser Scanner (TLS). Initially, from the whole point cloud data, the building sides are extracted and projected onto a 2D image to trace out the 2D building footprints. In order to register the footprint extractions on the digital map, 2D Affine model is used. For Affine parameter estimation, the centroids of each footprint groups are randomly chosen and matched by means of a modified RANSAC algorithm. Based on proposed algorithm, the experimental results showed that it is possible to renew digital map using building footprint extracted from TLS data.

• Journal of Korean Society for Geospatial Information Science
• /
• v.16 no.3
• /
• pp.35-41
• /
• 2008

Recently needs for the convergence of CAD and GIS data are increasing, and many studies on converting two systems to each other are being carried out. In this study, to revise and update the building data of digital map using CAD data for construction, the outline of building is abstracted from the CAD data and the outline is generalized to the same level of detail with the building data of digital map. Several line simplification algorithms to generalize the outline are adopted and compared, especially at the view of satisfaction to the drawing rule for digital map. Douglas-Peucker algorithm, Lang's algorithm, Reumann-Witkam algorithm, and Opheim algorithm are applied as the line simplification method. To evaluate the results of these algorithms, visual assessment and variation ratio of the number of points, total length of lines, the area of polygon, and satisfaction ratio to the drawing rule of digital map are analyzed. The result of Lang algorithm and Douglas-Peucker algorithm show superior satisfaction ratio. But general satisfaction ratio is 50~60% for all algorithm. Therefore there seems to be a limit to use these algorithms for the simplification method to update the building data in digital map and it is necessary to develop line simplification algorithm which satisfy the drawing rule well.

• The KIPS Transactions:PartC
• /
• v.11C no.2
• /
• pp.213-218
• /
• 2004

Recently MIP becomes more important for the macro mobility support in the emergence of the global system such as IMT-2000. However this Protocol suffers from many weaknesses on the location management. MIPv4 regional registration is presented for the local registration of MNs. MIPv6 can benefit from the reduced mobility signaling with external networks by employing a local MAP, that is called HMIPv6. The total signaling cost of HMIPv6 is rapidly increased by the number of CNs of an MN when the MN moves around between MAPs. In this paper, we propose a new location management scheme in MIPv6 that reduces the total signaling cost in the location update based on HMIPv6 Here the MN does not send the BU to CNs and HA when it moves around between MAPs. Instead it informs the current location by transferring the modified BU to the previous MAP. According to the results of the performance analysis, we determine the upper bound for the number of forwarding links allowed among adjacent MAPs without the BU information.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.250-255
• /
• 2005

For navigation of a service robot, mapping and localization are very important. To estimate the robot pose, the map of the environment is required and it can be built by exploration or SLAM. Exploration is the fundamental task of guiding a robot autonomously during mapping such that it covers the entire environment with its sensors. In this paper, an efficient exploration scheme based on the position probability of the end nodes of a topological map is proposed. In this scheme, a topological map is constructed in real time using the thinning-based approach. The robot then updates the position probability of each end node maintaining its position at the current location based on the Bayesian update rule using the range data. From this probability, the robot can determine whether or not it needs to visit the specific end node to examine the environment around this node. Various experiments show that the proposed exploration scheme can perform exploration more efficiently than other schemes in that, in most cases, exploration for the entire environment can be completed without directly visiting everywhere in the environment.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2010.04a
• /
• pp.57-59
• /
• 2010

The current Digital map is ambiguous to be managed because that's managed partition unit file-based. It brings about the cost of consumption because area has been changed or not is managed redundantly and there has been no way to provide digital map of spatial and time management. In addition, digital map can't have the management of security assurance and systematization because it is managed file-based. Therefore, this research provides figures that after applying UFID per object, it can be managed history every update of it by object unit.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2009.04a
• /
• pp.15-17
• /
• 2009

The line simplification method based on the turning function is studied in this paper for conversion of ground plan data to geospatial data to update the digital map. This method eliminate vertices effectively by estimating the length and the angle between the vertices based on the turning function which is useful to express the shape of linear feature. As the result, this method shows high shape similarity, high elimination rate of vertices and 100% of satisfaction degree to the drawing rules. Thus this line simplification method is judged to be effective in updating the digital map with ground plans.

• The Journal of Korean Association of Computer Education
• /
• v.6 no.4
• /
• pp.49-59
• /
• 2003

In order to index exactly moving objects(vehicle, mobile phone, PDA, etc.) in a mobile database, continuous updates of their locations arc inevitable as well as time-consuming. In this paper, we propose a spatial indexing method of moving objects for the efficient mobile map services. In detail, we analyze the characteristics of both the method to re-index all the objects after each time period and the method to update immediately the locations on reporting their locations. We also newly propose a bucket split method using the properties of moving objects in order to minimize the number of database updates. The experiments conducted on the environments of moving object show that the proposed indexing method is appropriate to map services for mobile devices.