• Korean Journal of Geomatics
• /
• v.5 no.1
• /
• pp.7-19
• /
• 2005

Photogrammetric mapping procedures have gone through major developments due to significant improvements in its underlying technologies. The availability of GPS/INS systems greatly assist in direct geo-referencing of the acquired imagery. Still, photogrammetric datasets taken without the aid of positioning and navigation systems need control information for the purpose of surface reconstruction. Point features were, and still are, the primary source of control for the photogrammetric triangulation although other higher-order features are available and can be used. LIDAR systems supply dense geometric surface information in the form of three dimensional coordinates with respect to certain reference system. Considering the accuracy improvement of LIDAR systems in the recent years, LIDAR data is considered a viable supply of photogrammetric control. To exploit LIDAR data, new challenges are poised concerning the representation and reference system by which both the photogrammetric and LIDAR datasets are described. In this paper, registration methodologies will be devised for the purpose of integrating the LIDAR data into the photogrammetric triangulation. Such registration methodologies have to deal with three issues: registration primitives, transformation parameters, and similarity measures. Two methodologies will be introduced that utilize straight-line and areal features derived from both datasets as the registration primitives. The first methodology directly incorporates the LIDAR lines as control information in the photogrammetric triangulation, while in the second methodology, LIDAR patches are used to produce and align the photogrammetric model. Also, camera self-calibration experiments were conducted on simulated and real data to test the feasibility of using LIDAR patches for this purpose.

• Journal of Institute of Control, Robotics and Systems
• /
• v.22 no.10
• /
• pp.833-838
• /
• 2016

This paper presents a performance evaluation of various feature-initialization algorithms for forward-viewing mono-camera based simultaneous localization and mapping (SLAM), specifically in indoor environments. For mono-camera based SLAM, the position of feature points cannot be known from a single view; therefore, it should be estimated from a feature initialization method using multiple viewpoint measurements. The accuracy of the feature initialization method directly affects the accuracy of the SLAM system. In this study, four different feature initialization algorithms are evaluated in simulations, including linear triangulation; depth parameterized, linear triangulation; weighted nearest point triangulation; and particle filter based depth estimation algorithms. In the simulation, the virtual feature positions are estimated when the virtual robot, containing a virtual forward-viewing mono-camera, moves forward. The results show that the linear triangulation method provides the best results in terms of feature-position estimation accuracy and computational speed.

• Journal of Korean Society for Geospatial Information Science
• /
• v.14 no.1 s.35
• /
• pp.65-74
• /
• 2006

A rapidly developed satellite technology is used in comprehensive fields such as spatial data aquisition and applications. Especially a GPS positioning is expected to reinvigorate at the national reference system changes to ITRF(International Terrain Reference Frame). Currently the National Geographic Information Institute(NGII) issues a triangulation point coordinate by separating old and new coordinates and in the year of 2007 it will be scheduled to be changed ITRF. The triangulation point coordinate in Cheju area causes some problems due to the difference original observation and re-observation. Thus in this study a GPS observation is conducted after re-organizing geodetic network based on 1st and 2nd order triangulation in order to check the current triangulation points in Cheju area. After the GPS observation data analysis, stable points were extracted, proposed a geodetic network and its application.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.4B
• /
• pp.309-316
• /
• 2012

The compensation algorithm for localization using the least-squires method in NLOS(Non Line of Sight) environment is suggested and the performance of the algorithm is analyzed in this paper. In order to improve the localization correction rate of the moving node, 1) the distance value of the moving node that is moving as an constant speed is measured by SDS-TWR(Symmetric Double-Sided Two-Way Ranging); 2) the location of the moving node is measured using the triangulation scheme; 3) the location of the moving node measured in 2) is compensated using the least-squares method. By the experiments in NLOS environment, it is confirmed that the average localization error rates are measured to ${\pm}1m$, ${\pm}0.2m$ and ${\pm}0.1m$ by the triangulation scheme, the Kalman filter and the least-squires method respectively. As a result, we can see that the localization error rate of the suggested algorithm is higher than that of the triangulation as average 86.0% and the Kalman filter as average 16.0% respectively.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.36 no.4
• /
• pp.235-243
• /
• 2018

The national geodetic control point is very important as a framework for drafting plans for construction and civil engineering works as well as mapping for various development and utilization plans related to the national land. Since the 1910s, Korea has established and managed the national geodetic control points, the triangulation points and the benchmarks. Currently, these point information is provided through the land information platform. The national geodetic control point has been changed through the process of loss, re-establishment, and re-location by the events and environment of the times. Therefore, it is very important to provide information by linking these past national geodetic control points in time series. In this study, we classified the triangulation points into five groups(Japanese Government General of Korea, YUCCA Project, National Construction Institute, Past Control Point Data Sheet, and Current) by age and then suggests a method to match the same control points in each time period. Finally we also applied the proposed method to Jecheon and analyzed the results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.1C
• /
• pp.45-54
• /
• 2010

This paper studies the design of a multiuser multiple-input multiple-output (MIMO) system, where a base station (BS) transmits independent messages to multiple users. The remarkable "dirty paper coding (DPC)" result was first presented by Costa that the capacity does not change if the Gaussian interference is known at the transmitter noncausally. While several implementable DPC schemes have been proposed recently for single-user dirty-paper channels, DPC is still difficult to implement directly in practical multiuser MIMO channels. In this paper, we propose a network channel matrix triangulation (NMT) algorithm for utilizing interference known at the transmitter. The NMT algorithm decomposes a multiuser MIMO channel into a set of parallel, single-input single-output dirty-paper subchannels and then successively employs the DPC to each subchannel. This approach allows us to extend practical single-user DPC techniques to multiuser MIMO downlink cases. We present the sum rate analysis for the proposed scheme. Simulation results show that the proposed schemes approach the sum rate capacity of the multiuser MIMO downlink at moderate signal-to-noise ratio (SNR) values.

• Korean Journal of Computational Design and Engineering
• /
• v.1 no.3
• /
• pp.224-233
• /
• 1996

An automatic mesh generation scheme with triangular finite elements on three-dimensional surfaces has been developed. The surface triangulation process is performed as follows. To begin, surfaces with key nodes are transformed to two-dimensional planes and the meshes with triangular elements are constructed in these planes. Finally, the constructed meshes are transformed back to the original 3D surfaces. For the mesh generation, an irregular mesh generation scheme is employed in which local mesh densities are assigned by the user along the boundaries of the analysis domain. For this purpose a looping algorithm combined with an advancing front technique using basic operators has been developed, in which the loops are recursively subdivided into subloops with the use of the best split lines and then the basic operators generate elements. Using the split lines, the original boundaries are split recursively until each loop contains a certain number of key nodes, and then using the basic operators such as type-1 and type-2, one or two triangular elements are generated at each operation. After the triangulation process has been completed for each meshing domain, the resulting meshes are finally improved by smoothing process. Sample meshes are presented to demonstrate the versatility of the algorithm.

• Journal of Korea Multimedia Society
• /
• v.13 no.4
• /
• pp.547-559
• /
• 2010

Delaunay triangulation is suitable for fingerprint matching because of its robustness to rotation and translation. However, missing and spurious minutiae degrade the performance and computational efficiency. In this paper, we propose a method of combining local quality assessment and 4-category minutiae classification to improve accuracy and decrease computational complexity in matching process. Experimental results suggest that removing low quality areas from matching candidate areas and classifying minutiae improve computational efficiency without degrading performance. The results proved that the proposed algorithm outperforms the matching algorithm (BOZORTH3) provided by NIST.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.3 no.4
• /
• pp.859-865
• /
• 1999

Many sensors such as a laser, and CCD camera to obtain 3D information have been used, but most of algorithms for laser calibration are inefficient since a huge memory and experiment data are required. This method saves a memory and an experimental data since the 3D information are obtained simply triangulation method. In this paper, the calibration algorithm of a slit km laser based on triangulation method is introduced to calculate 3D information in the real world. The laser beam orthogonally mounted on the XY table is projected on the floor. A CCD camera observes the intersection plane of a light and an object plane. The 3D information is calculated using observed and calibration data.

• The KIPS Transactions:PartA
• /
• v.15A no.5
• /
• pp.295-300
• /
• 2008

In this paper, we consider a characterization of a Guard Sufficiency Set(GSS) in the hierarchy of simple polygons. we propose the diagonals of a arbitrary triangulation of a polygon as a GSS when guards see the diagonals with completely visibility and both sides of the diagonal. we show that this can be a GSS in convex polygons, unimodal polygons, spiral polygons but this can not be a GSS in star-shaped polygons, monotone polygons, completely external visible polygons.