• Journal of KIBIM
• /
• v.11 no.4
• /
• pp.1-9
• /
• 2021

Comparing to general scanning data, the 3D digital map for large construction sites and complex buildings consists of millions of points. The large construction site needs to be scanned multiple times by drone photogrammetry or terrestrial laser scanner (TLS) survey. The scanned point cloud data are required to be registrated with high resolution and high point density. Unlike the registration of 2D data, the matrix of translation and rotation are used for registration of 3D point cloud data. Archiving high accuracy with 3D point cloud data is not easy due to 3D Cartesian coordinate system. Therefore, in this study, iterative closest point (ICP) registration method for improve accuracy of 3D digital map was employed by different overlap ratio on 3D digital maps. This study conducted the accuracy test using different overlap ratios of two digital maps from 10% to 100%. The results of the accuracy test presented the optimal overlap ratios for an ICP registration method on digital maps.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.2
• /
• pp.385-391
• /
• 2007

In this paper, we propose and observe the Adaptive Modulation system with optimal Turbo Coded V-BLAST (Vertical-Bell-lab Layered Space-Time) technique that is applied the extrinsic information from MAP (Maximum A Posteriori) Decoder with Iterative Decoding to use as a priori probability in two decoding procedures of V-BLAST: ordering and slicing. Also, comparing with the Adaptive Modulation system using conventional Turbo Coded V-BLAST technique that is simply combined V-BLAST with Turbo Coding scheme, we observe how much throughput performance has been improved. As a result of simulation, in the Adaptive Modulation systems with several Turbo Coded V-BLAST techniques, the optimal Turbo Coded V-BLAST technique has higher throughput gain than the conventional Turbo Coded V-BLAST technique. Especially, the results show that the proposed scheme achieves the gain of 1.5 dB SNR compared to the conventional system at 2.5 Mbps throughput.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.8
• /
• pp.2068-2082
• /
• 2023

With the rapid development of deep learning, Depth Map Super-Resolution (DMSR) method has achieved more advanced performances. However, when the upsampling rate is very large, it is difficult to capture the structural consistency between color features and depth features by these DMSR methods. Therefore, we propose a color-image guided DMSR method based on iterative depth feature enhancement. Considering the feature difference between high-quality color features and low-quality depth features, we propose to decompose the depth features into High-Frequency (HF) and Low-Frequency (LF) components. Due to structural homogeneity of depth HF components and HF color features, only HF color features are used to enhance the depth HF features without using the LF color features. Before the HF and LF depth feature decomposition, the LF component of the previous depth decomposition and the updated HF component are combined together. After decomposing and reorganizing recursively-updated features, we combine all the depth LF features with the final updated depth HF features to obtain the enhanced-depth features. Next, the enhanced-depth features are input into the multistage depth map fusion reconstruction block, in which the cross enhancement module is introduced into the reconstruction block to fully mine the spatial correlation of depth map by interleaving various features between different convolution groups. Experimental results can show that the two objective assessments of root mean square error and mean absolute deviation of the proposed method are superior to those of many latest DMSR methods.

• Korean Journal of Computational Design and Engineering
• /
• v.17 no.2
• /
• pp.132-139
• /
• 2012

Presented in the paper is a procedure to extract simplified triangular mesh from a height map (terrain data). The proposed algorithm works directly on a height map that extracts a simplified triangular mesh. For the simplification, the paper employs an iterative method of edge contractions. To determine an edge to be contracted, the contraction cost of an edge is evaluated through the QEM method. Normally, an edge contraction will remove two triangles sharing the edge. Although the edge contraction can be implemented easily on a triangular mesh, it is not viable to implement the operation on a height map due to the irregular topology. To handle the irregular topology during the simplification procedure, a new algorithm is introduced.

• Proceedings of the KIEE Conference
• /
• 2000.07d
• /
• pp.2834-2836
• /
• 2000

This paper introduces the behavior-based learning controller for mobile robot using topological map. When the mobile robot navigates to the goal position, it utilizes given information of topological map and its location. Under navigating in unknown environment, the robot classifies its situation using ultrasonic sensor data, and calculates each motor schema multiplied by respective gain for all behaviors, and then takes an action according to the vector sum of all the motor schemas. After an action, the information of the robot's location in given topological map is incorporated to the learning module to adapt the weights of the neural network for gain learning. As a result of simulation, the robot navigates to the goal position successfully after iterative gain learning with topological information.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.32 no.5
• /
• pp.459-467
• /
• 2014

The importance of fusion and association using established spatial information has increased gradually with the production and supply of various spatial data by public institutions. The generation of necessary spatial information without field investigation and additional surveying can reduce time, labor, and financial costs. However, the study of the integration of the newly introduced road name address map with the digital map is very insufficient. Even though the use of the road name address map is encouraged for public works related to spatial information, the digital map is still widely used because it is the national basic map. Therefore, in this study, building matching and update were performed to associate the digital map with the road name address map. After geometric calibration using the block-based ICP (Iterative Closest Point) method, multi-scale corresponding pair searching with hierarchical clustering was applied to detect the multi-type match. The accuracy assessment showed that the proposed method is more than 95% accurate and the matched building layer of the two maps is useful for the integrated application and fusion. In addition, the use of the road name address map, which carries the latest and most frequently renewed data, enables cost-effective updating of new buildings.

• ETRI Journal
• /
• v.26 no.5
• /
• pp.384-390
• /
• 2004

We propose a new bandwidth-efficient technique that achieves high data rates over a wideband wireless channel. This new scheme is targeted for a multiple-input multiple- output orthogonal frequency-division multiplexing (MIMO-OFDM) system that achieves transmit diversity through a space frequency block code and capacity enhancement through the iterative joint processing of zero-forcing detection and maximum a posteriori (MAP) decoding. Furthermore, the proposed scheme is compared to the coded Bell Labs Layered Space-Time OFDM (BLAST-OFDM) scheme.

• Proceedings of the KSRS Conference
• /
• 2007.03a
• /
• pp.126-129
• /
• 2007

In this paper, an iterative MAP approach using a Bayesian model based on the lognormal distribution for image intensity and a GRF for image texture is proposed for despeckling the SAR images that are corrupted by multiplicative speckle noise. When the image intensity is logarithmically transformed, the speckle noise is approximately Gaussian additive noise, and it tends to a normal probability much faster than the intensity distribution. The MRF is incorporated into digital image analysis by viewing pixel type s as states of molecules in a lattice-like physical system defined on a GRF. Because of the MRFGRF equivalence, the assignment of an energy function to the physical system determines its Gibbs measure, which is used to model molecular mteractions. The proposed adaptive iterative method was evaluated using simulation data generated by the Monte Carlo method. In the extensive experiments of this study, the proposed method demonstrated the capability to relax speckle noise and estimate noise-free intensity.

• 한국전산유체공학회:학술대회논문집
• /
• 1995.10a
• /
• pp.82-89
• /
• 1995

In the present paper, a method of nearly orthogonal grid generation in an arbitrary simply-connected 3D domain will be presented. The method is a new direct and non-iterative scheme based on the concept of the decomposition of the global orthogonal transformation into consecutive mapping of a conformal mapping and an auxiliary orthogonal mapping, which was suggested by King and Leal [4]. In our numerical scheme. Kang and Leal's method is extended from 2D problems to 3D problems while the advantage of the non-iterative algorithm is maintained. The essence of the present mapping method is that an iterative scheme can be avoided by introducing a preliminary step. This preliminary step corresponds to a conformal map and is based on the boundary element method(BEM). This scheme is applied to generate several nearly-orthogonal grid systems which are orthogonal at boundaries.

• Journal of applied mathematics & informatics
• /
• v.28 no.3_4
• /
• pp.931-938
• /
• 2010

The disentangling map from the commutative algebra to the noncommutative algebra of operators is the essential operation of Feynman's operational calculus for noncommuting operators. Thus formulas which simplify this operation are meaningful to the subject. In a recent paper the procedure for "methods for iterative disentangling" has been established in the setting of Feynman's operational calculus for time independent operators $A_1$, $\cdots$, $A_n$ and associated probability measures${\mu}_1$, $\cdots$, ${\mu}_n$. The main purpose for this paper is to extend the procedure for methods for iterative disentangling to time dependent operators.