• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.2
• /
• pp.63-68
• /
• 1999

We propose a new method which can solve the difficulty of separation the character strings from the interconnected lines and the distortions of vectorization at the crossing points and the junction points for the digitized maps at the same time. After the image is thinned, the crossing points and the junction points are detected with their neighbors, which we call the uncertain areas. And then the broken lines are connected each other, and the character strings are separated at the same time. The proposed method is applied to Korean cadastral map. Usually, Korean cadastral map consists of straight lines and character strings. The experimental results show that the method is effective in separating the character strings and getting high quality vectorization for the Korean cadastral map.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.435-440
• /
• 2009

The scalable vector graphics (SVG) standard has allowed the complex bitmap images to be represented by vector based graphics and provided some advantages over the raster based graphics in applications, for example, where scalability is required. This paper presents an algorithmto convert bitmap images into SVG format. The algorithm is an integration of pixel-level triangulation, data dependent triangulation, a new image mesh simplification algorithm, and a polygonization process. Both triangulation techniques enable the image quality (especially the edge features) to be preserved well in the reconstructed image and the simplification and polygonization procedures reduce the size of the SVG file. Experiments confirm the effectiveness of the proposed algorithm.

• Spatial Information Research
• /
• v.2 no.2
• /
• pp.197-205
• /
• 1994

In this paper, we present a vectorization algorithm for finding a vector image from a raster image of the land registered map which is used as the base map for various applications, and an automatic region creation algorithm for generating every re¬gion automatically from the vector image. We describe an ARM (automatic geographical entity recognition and modeling software) which carries out the recognition and process¬ing of geographical entities automatically using those algorithms.

• Nuclear Medicine and Molecular Imaging
• /
• v.43 no.5
• /
• pp.443-450
• /
• 2009

Purpose: Conventional image reconstruction uses simplified physical models of projection. However, real physics, for example 3D reconstruction, takes too long time to process all the data in clinic and is unable in a common reconstruction machine because of the large memory for complex physical models. We suggest the realistic distributed memory model of fast-reconstruction using parallel processing on personal computers to enable large-scale technologies. Materials and Methods: The preliminary tests for the possibility on virtual manchines and various performance test on commercial super computer, Tachyon were performed. Expectation maximization algorithm with common 2D projection and realistic 3D line of response were tested. Since the process time was getting slower (max 6 times) after a certain iteration, optimization for compiler was performed to maximize the efficiency of parallelization. Results: Parallel processing of a program on multiple computers was available on Linux with MPICH and NFS. We verified that differences between parallel processed image and single processed image at the same iterations were under the significant digits of floating point number, about 6 bit. Double processors showed good efficiency (1.96 times) of parallel computing. Delay phenomenon was solved by vectorization method using SSE. Conclusion: Through the study, realistic parallel computing system in clinic was established to be able to reconstruct by plenty of memory using the realistic physical models which was impossible to simplify.

• The KIPS Transactions:PartB
• /
• v.10B no.7
• /
• pp.837-846
• /
• 2003

This paper deals with plain figures on the architectural drawings of apartment. This kind of architectural drawings consist of main walls represented by two parallel bold lines, symbols (door, window, $\cdots$), dimension line, extension line, and dimensions represent various numerical values and characters. This paper suggests a method for recognizing main wall which is a backbone of apartment in an architectural drawing. In this thesis, the following modules are realized : an efficient image barbarization, a removal of thin lines, a vectorization of detected lines, a region bounding for main walls, a calculation of extension lines, a finding main walls based on extension line, and a field expansion by searching other main walls which are linked with the detected main walls. Although the windows between main walls are not represented as main walls, a detection module for the windows is considered during the recognition period. So the windows are found as a part of main wall. An experimental result on 9 different architectural drawings shows 96.5% recognition of main walls and windows, which is about 5.8% higher than that of Karl Tombre.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.5
• /
• pp.1147-1159
• /
• 1996

In this paper. we develop an efficient algorithm which vectorize the table input for mixed document recognition system. It is necessary to separate character and line for recognizing the character in the table. For recognizing table, we have to recognize the character which is blocked by table line and develop the efficient rectorization method for table line. For vectorizing table, we develop several methods. The first method is to extract table line part using 8-dircction chaincodes. The second method is to extract horizontal and vertical lines using histogram of lines. The third one is to extract diagonal lines of table by using the cross points of horizontal and verticallines. Finally we also develop the table vectorization method which finds the regularity characteristics of horizontal and vertical lines composing table, In the paper, we sugest a regularity method for efficient table vectorization.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.11 no.5
• /
• pp.136-146
• /
• 2012

As information technology used for simulation and virtual reality developed, there is a growing interest in animation technologies which will effectively deliver simulation results to users. Various efforts have been made to improve animation performance, like playback quality and speed, input-output speed and storage space reduction. However, earlier studies generally focused on image compression frame by frame. To significantly improve storage space and playback speed, animation data should be vectorized. Also, spatial and temporal duplication have to be removed. In this study, animation data structure was improved fundamentally through establishment of hierarchy and vectorization. Also Spatial and temporal duplication of animation data was removed through vectorization based on train route. As a result, storage space was reduced, input-output speed and playback speed were considerably improved. According to the test, additional Patternization which followed vectorization brought reduction of over 80% in storage space and input-output speed was quadrupled. Patternization technology can be used as a proper storage method of animation data, and can provide user-specific animation by small data transmission.

• Korean Journal of Remote Sensing
• /
• v.22 no.2
• /
• pp.123-129
• /
• 2006

High-resolution aerial color image offers great possibilities for geometric and semantic information for spatial data generation. However, shadow casts by buildings and trees in high-density urban areas obscure much of the information in the image giving rise to potentially inaccurate classification and inexact feature extraction. Though many researches have been implemented for solving shadow casts, few studies have been carried out about the extraction of features hindered by shadows from aerial color images in urban areas. This paper presents a asphalt road boundary extraction technique that combines information from aerial color image and LIDAR (LIght Detection And Ranging) data. The following steps have been performed to remove shadow effects and to extract road boundary from the image. First, the shadow regions of the aerial color image are precisely located using LEAR DSM (Digital Surface Model) and solar positions. Second, shadow regions assumed as road are corrected by shadow path reconstruction algorithms. After that, asphalt road boundary extraction is implemented by segmentation and edge detection. Finally, asphalt road boundary lines are extracted as vector data by vectorization technique. The experimental results showed that this approach was effective and great potential advantages.

• Proceedings of the KSRS Conference
• /
• 2002.10a
• /
• pp.34-39
• /
• 2002

Road information is very important for topographic mapping, transportation application, urban planning and other related application fields. Therefore, automatic detection of road networks from spatial imagery, such as aerial photos and satellite imagery can play a central role in road information acquisition. In this paper, we use least squares correlation matching alone for road center tracking and show that it works. We assumed that (bright) road centerlines would be visible in the image. We further assumed that within a same road segment, there would be only small differences in brightness values. This algorithm works by defining a template around a user-given input point, which shall lie on a road centerline, and then by matching the template against the image along the orientation of the road under consideration. Once matching succeeds, new match proceeds by shifting a matched target window further along road orientation at the target window. By repeating the process above, we obtain a series of points, which lie on a road centerline successively. A 1m resolution IKONOS images over Seoul and Daejeon were used for tests. The results showed that this algorithm could extract road centerlines in any orientation and help in fast and exact he ad-up digitization/vectorization of cartographic images.

• Geomechanics and Engineering
• /
• v.7 no.4
• /
• pp.375-401
• /
• 2014

It is generally accepted that material heterogeneity has a great influence on the deformation, strength, damage and failure modes of rock. This paper presents numerical simulation on rock failure process based on the characterization of rock heterogeneity by using a digital image processing (DIP) technique. The actual heterogeneity of rock at mesoscopic scale (characterized as minerals) is retrieved by using a vectorization transformation method based on the digital image of rock surface, and it is imported into a well-established numerical code Rock Failure Process Analysis (RFPA), in order to examine the effect of rock heterogeneity on the rock failure process. In this regard, the numerical model of rock could be built based on the actual characterization of the heterogeneity of rock at the meso-scale. Then, the images of granite are taken as an example to illustrate the implementation of DIP technique in simulating the rock failure process. Three numerical examples are presented to demonstrate the impact of actual rock heterogeneity due to spatial distribution of constituent mineral grains (e.g., feldspar, quartz and mica) on the macro-scale mechanical response, and the associated rock failure mechanism at the meso-scale level is clarified. The numerical results indicate that the shape and distribution of constituent mineral grains have a pronounced impact on stress distribution and concentration, which may further control the failure process of granite. The proposed method provides an efficient tool for studying the mechanical behaviors of heterogeneous rock and rock-like materials whose failure processes are strongly influenced by material heterogeneity.