• Journal of information and communication convergence engineering
• /
• v.7 no.1
• /
• pp.41-45
• /
• 2009

In mobile GIS environments, a client needs to receive the isogram data with a topographical map from a server, if the mobile client wants to display map with elevation information. Because the elevation data size is normally quite large, the client will suffer some problems to receive the elevation data from server. The main reason is a resource limitation of the mobile devices. To overcome these problems, this paper proposes new data structures and algorithms. They are designed for efficient transmission of contour data to a client. Because of the contour data are generated as a vector style from elevation information stored at a server, the proposed algorithms are focused to minimize the transmission data volume and time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.2
• /
• pp.276-283
• /
• 1994

Using a neural network for vector quantization, we can expect to have better codebook design algorithm for its adaptive process. Also, the designed codebook puts the codewords in order by its self-organizing characteristics, which makes it possible to partially search the codebook for real time process. To exploit these features of the neural network, in this paper, we propose a new codebook design algorithm that modified the KSFM(Kohonen`s Self-organizing Feature Map) and then combines the K-means algorithm. Experimental results show the performance improvment and the ability of the partical seach of the codebook for the real time process.

• Journal of the Korean Mathematical Society
• /
• v.49 no.2
• /
• pp.251-263
• /
• 2012

A CW complex B is said to be I-trivial if there does not exist a $\mathbb{Z}_2$-map from $S^{i-1}$ to S(${\alpha}$) for any vector bundle ${\alpha}$ over B a any integer i with i > dim ${\alpha}$. In this paper, we consider the question of determining whether $\Sigma^k\mathbb{R}P^n$ is I-trivial or not, and to this question we give complete answers when k $\neq$ 1, 3, 8 and partial answers when k = 1, 3, 8. A CW complex B is I-trivial if it is "W-trivial", that is, if for every vector bundle over B, all the Stiefel-Whitney classes vanish. We find, as a result, that $\Sigma^k\mathbb{R}P^n$ is a counterexample to the converse of th statement when k = 2, 4 or 8 and n $\geq$ 2k.

• Proceedings of the Korean Statistical Society Conference
• /
• 2005.05a
• /
• pp.161-166
• /
• 2005

Locus ordering is the necessary step in constructing genetic map, and the construction of reliable and fine genetic map is one of the most important issue in genetic research area. Locus ordering searches for the best locus order among the possible orders and it amounts to evaluating the maximum likelihood for each order. With only 10 loci, for example, there are 1,814,000 possible orders, and therefore, locus ordering entails a big computational problem. In this paper we suggest a useful algorithm for loci ordering via the Fiedler vector. The suggested algorithm is easy to compute and can handle many loci simultaneously. Furthermore, the required computation time is very short compared to others and the result of locus ordering is very accurate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9A
• /
• pp.1411-1418
• /
• 1999

In this paper, we propose a fast motion estimation algorithm using motion prediction and neural network. Considering that the motion vectors have high spatial correlation, the motion vector of current block is predicted by those of neighboring blocks. The codebook of motion vector is designed by Kohonen self-organizing feature map(KSFM) learning algorithm which has a fast learning speed and 2-D adaptive chararteristics. Since the similar codevectors are closely located in the 2-D codebook the motion is progressively estimated from the predicted codevector in the codebook. Computer simulation results show that the proposed method has a good performance with reduced computational complexity.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.4
• /
• pp.950-954
• /
• 2004

According to the rapid advance of computer and communication techniques, the request of mobile internet services is highly increasing. However, the main obstacles for mobile vector map service environments, are large data volume and narrow wireless bandwidth. Among the many possible solutions, spatial data compression technique may contribute to reduce the load of bandwidth and client response time. This thesis proposes two methods for spatial data compression. The one is relative coordinates transformation method, and the other is client coordinates transformation method. And, this thesis also proposes the system architecture for experiments. The two compression methods could be evaluated the compression effect and the response time.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.156-158
• /
• 2003

Analysis of high-resolution satellite image becomes important for cartography, surveillance, and remote sensing. However, there are lots of problems to be solved for automatic analysis of high-resolution satellite image especially in urban area. The problems are originated from the increased complexity due to the unnecessary details and shadows, and time-varying illuminations. Because of such obstacles, it seems impossible to make automatic analysis. This paper proposes a way of change detection of buildings in urban area by using digital vector map. The proposed way makes the buildings on the vector map parameterized, and searches them in the preprocessed high-resolution image by using generalized Hough transform. The searched building objects are overlaid on the satellite image. The overlaid image can help to detect the change of building rapidly.

• Journal of Advanced Navigation Technology
• /
• v.16 no.4
• /
• pp.673-678
• /
• 2012

Traditional culture's researcher has attempting to public use as a various method. Example is design of digital archive and digital contents. However, in spite of this effort, traditional culture's researcher has difficulty to public use. Because traditional culture is hard to understand, and less interest than the other area. Especially, traditional culture has not environment that user can searching and using the culture's information due to difficult to search the data and layers. We propose a design to make an ontology using information profile for digital contents of traditional culture. Also, we use topic-map for the factors of ontology's relation, and specify their relation using topic vector.

• Proceedings of the KSRS Conference
• /
• 2004.10a
• /
• pp.522-525
• /
• 2004

Interferometry SAR (InSAR) is a technique to generate topographic map from complex data pairs observed by antennas at different locations. However, to obtain topographic information using InSAR is difficult task because it requires series of complicated process including phase unwrapping and precise recovery of the SAR geometry. Especially, accuracy of the DEM (Digital Elevation Model) produced by repeat pass single SAR pair could be influenced by atmospheric effect. Recently, a new InSAR technique to improve accuracy of DEM has been introduced that utilizes low resolution DEM with a number of SAR image pairs. The coarse DEM plays an important role in reducing phase unwrapping error caused by layover and satellite orbit error. In this study, we implemented DInSAR (Differential InSAR) method which combines low resolution DEMs and ERS tandem pair images. GTOPO30 DEM with 1km resolution, SRTM-3 DEM with 100m resolution, and DEM with 10m resolution derived from 1:25,000 digital vector map were used to investigate feasibility of DInSAR. The accuracy of the DEMs generated both by InSAR and DInSAR was evaluated.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.22 no.4
• /
• pp.331-338
• /
• 2004

This paper describes capability of utilizing ground control points(GCPs) obtained from 1:1,000 and 1:5,000 digital vector maps to correct image coordinates which have errors due to bais rational polynomial coefficient(RPC) of IKONOS Geo-level stereo images. The accuracy of the bias-corrected images was improved to approximately 4m and 2m in planimetry and height, respectively. The accuracy was also compared with results from using GCPs obtained by GPS surveying. In consequence, bias-compensated IKONOS sereo imagery was evaluated to satisfy generating topographic map 1:10,000.