• Transactions of Materials Processing
• /
• v.13 no.1
• /
• pp.90-101
• /
• 2004

An inverse mosaic method has been proposed to generate an initial blank shape from the final product shape. Differently from the geometric mapping method, the method can handle triangular patches. However, the generated blank shape is strongly dependent on the order of determination of nodes. In order to compensate the dependency error smoothing technique has been also developed. Although the accuracy has been improved greatly compared with the geometrical mapping method, the method has limitation, due to the no incorporation of plasticity theory. Even though the accuracy of the radius vector method is already proved. the method requires initial guess to start the method. In order to compromise the limitation of the present method and the radius vector method, the method has been connected to the radius vector method. The efficiency of the present optimal blank design method has been verified with some chosen examples.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.2
• /
• pp.391-399
• /
• 2012

This paper proposes a particle filter approach for SLAM(Simultaneous Localization and Mapping) of a mobile robot. The SLAM denotes estimation of both the robot location and map while the robot navigates in an unknown environment without map. The proposed method estimates robot location simultaneously with the locations of the ultrasonic beacons which constitute landmarks for navigation. The particle filter method represents the locations of the robot and landmarks in probabilistic manner by the distribution of particles. The method takes care of the uncertainty of the landmarks' location as well as that of the robot motion. Therefore, the locations of the landmarks are updated including uncertainty at every sampling time. Performance of the proposed method is verified through simulation and experiments. The method yields practically useful mapping information even if the range data from the landmarks include random noise. Also, it provides more accurate and robust estimation of the robot location than the usual least squares methods or dead-reckoning method.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.1
• /
• pp.99-113
• /
• 2004

A new architecture called SAN(Storage Area Network) was developed in response to the requirements of high availability of data, scalable growth, and system performance. In order to use SAN more efficiently, most of SAN operating softwares support storage virtualization concepts that allow users to view physical storage devices attached to SAN as a large volume virtually h logical volume manager plays a key role in storage virtualization. It realizes the storage virtualization by mapping logical addresses to physical addresses. A logical volume manager also supports a snapshot that preserves a volume image at certain time and on-line reorganization to allow users to add/remove storage devices to/from SAN even while the system is running. To support the snapshot and the on-line reorganization, most logical volume managers have used table based mapping methods. However, it is very difficult to manage mapping table because the mapping table is large in proportion to a storage capacity. In this paper, we design and implement an efficient and flexible hybrid mapping method based on mathematical equations. The mapping method in this paper supports a snapshot and on-line reorganization. The proposed snapshot and on-line reorganization are performed on the reserved area which is separated from data area of a volume. Due to this strategy normal I/O operations are not affected by snapshot and reorganization. Finally, we show the superiority of our proposed mapping method through various experiments.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.7 no.6
• /
• pp.897-906
• /
• 2017

Projection Mapping, also known as Spatial Augmented Reality(SAR) has attracted much attention recently and used for many division, which can augment physical objects with projected various virtual replications. However, conventional approaches towards projection mapping have faced some limitations. Target objects' geometric transformation property does not considered, and movements of flexible objects-like paper are hard to handle, such as folding and bending as natural interaction. Also, precise registration and tracking has been a cumbersome process in the past. While there have been many researches on Projection Mapping on static objects, dynamic projection mapping that can keep tracking of a moving flexible target and aligning the projection at interactive level is still a challenge. Therefore, this paper propose a new method using Unity3D and ARToolkit for high-speed robust tracking and dynamic projection mapping onto non-rigid deforming objects rapidly and interactively. The method consists of four stages, forming cubic bezier surface, process of rendering transformation values, multiple marker recognition and tracking, and webcam real time-lapse imaging. Users can fold, curve, bend and twist to make interaction. This method can achieve three high-quality results. First, the system can detect the strong deformation of objects. Second, it reduces the occlusion error which reduces the misalignment between the target object and the projected video. Lastly, the accuracy and the robustness of this method can make result values to be projected exactly onto the target object in real-time with high-speed and precise transformation tracking.

• Journal of KIISE:Software and Applications
• /
• v.33 no.1
• /
• pp.114-129
• /
• 2006

Ontology mapping is the task of finding semantic correspondences between two ontologies. In order to improve the effectiveness of ontology mapping, we need to consider the characteristics and constraints of data models used for implementing ontologies. Earlier research on ontology mapping, however, has proven to be inefficient because the approach should transform input ontologies into graphs and take into account all the nodes and edges of the graphs, which ended up requiring a great amount of processing time. In this paper, we propose a multi-strategic mapping approach to find correspondences between ontologies based on the syntactic or semantic characteristics and constraints of the topic maps. Our multi-strategic mapping approach includes a topic name-based mapping, a topic property-based mapping, a hierarchy-based mapping, and an association-based mapping approach. And it also uses a hybrid method in which a combined similarity is derived from the results of individual mapping approaches. In addition, we don't need to generate a cross-pair of all topics from the ontologies because unmatched pairs of topics can be removed by characteristics and constraints of the topic maps. For our experiments, we used oriental philosophy ontologies, western philosophy ontologies, Yahoo western philosophy dictionary, and Yahoo german literature dictionary as input ontologies. Our experiments show that the automatically generated mapping results conform to the outputs generated manually by domain experts, which is very promising for further work.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.29 no.5
• /
• pp.479-485
• /
• 2011

A number of case studies that find distribution of longevity population and influencing factors through the spatial data fusion using GIS techniques are growing. The majority cases of these studies are adopt census administrative boundary data for the spatial analysis. However, these methods cannot fully explain the phenomenon of longevity because there are a variety of spatial characteristics within the census administrative boundaries. Therefore, studies of spatial unit are required that realistically reflect the phenomenon of human longevity. The dasymetric mapping method enables to product of spatial unit more realistic than census administrative boundary map and statistic estimates of small area utilizing diversity spatial information. In this study, elderly population of small area has been estimated within statistically significant level that applied the vector based dasymetric mapping method. Also, the cluster analysis confirmed that the variation of local spatial relationship within census administrative boundary. The result of this study implied that the need for local-level studies of the human longevity and the validity of the dashmetric mapping techniques.

• Journal of Broadcast Engineering
• /
• v.15 no.6
• /
• pp.757-767
• /
• 2010

In this paper, we have studied the color compensation method for 3D that enables 3D color presentation similar to 2D. The color compensation method uses the difference of color presentation in 2D and 3D mode. First, the RGB I/O relationship curve was derived in 2D and 3D mode based on the input RGB color bar images. The relationship was modeled in modified power-law forms. Based on the modeling information, we generated color mapping tables, which can be used for compensating the difference of colors. The proposed color mapping block can be added at the output block of a 3DTV system, where the 2D content can be bypassed but the 3D content RGB data can be processed using the color mapping table. The experimental results show that the proposed method improves color presentation of a 3DTV system using a proper color compensation based on 2D presentation.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.2
• /
• pp.1-10
• /
• 2004

This paper proposes the method that design CLUT(color look-up table) simultaneously processing gamut mapping and color space conversion using only CLUT without complex computation. After CLUT is constructed using scanner gamut and printer gamut, the scanner gamut is extended to include original scanner gamut. This extended scanner gamut is used as input CIE $L^{*}$ $a^{*}$ $b^{*}$ values for CLUT. Then CMY values are computed by using gamut mapping. Input RGB image of scanner is converted into CIE $L^{*}$ $a^{*}$ $b^{*}$ by using regression function. CIE $L^{*}$ $a^{*}$ $b^{*}$ values of scanner are converted into CMY values without computation of additional gamut mapping using the proposed CLUT. In the experiments, the proposed method resulted in the similar color difference, but reduced the complexity computation than the direct computing method to process gamut mapping and color space conversion respectively.espectively.ively.

• Journal of Fashion Business
• /
• v.13 no.6
• /
• pp.20-30
• /
• 2009

The purpose of this study is to develop the effective customized elderly fashion marketing process based on the web site, where older customer will be able to choose various fabrics and to try them out. This aims to establish new prototype of internet shopping mall for customized elderly fashion clothing. In this study, new method of product presentation on the online shopping mall is proposed to offer product information through 3D virtual reality. With the online shopping mall(SATC Mall) as a showcase, we presented virtual mapping system so that it enable the customers to select the fabrics and to see exactly how chosen fabric will look when applied to image of clothing. As an initial test of the application of simulation to measure 3D visualization of product, mapping software Vision Easy Map Pro Version 6.0(NedGraphics) Vision Easy Map Viewer Version 5.0(NedGraphics) were chosen and applied. By using this mapping system, the fabric change of the apparel product could be made on the internet shopping web site. However, this approach has been successful applied for presenting and customizing garment products. Future research will focus on the integration of mapping coordination into SATC Mall.

• Journal of KIISE:Software and Applications
• /
• v.27 no.1
• /
• pp.41-49
• /
• 2000

This paper describes a method of generating MPHFs(Minimal Perfect Hash Functions) for large static search key sets. The MOS(Mapping-Ordering-Searching) approach is widely used presently in MPHF generation. In this research, the MOS approach is improved and a SOMS(Selecting-Ordering-Mapping-Searching) approach is proposed, where the Selecting step is newly introduced and the Orderng step is performed before the Mapping step to generate MPHFs more effectively. The MPHF generation algorithm proposed in this research is probabilistic and the expected processing time is linear to the number of keys. Experimental results show that MPHFs are generated fast and the space needed to represent the hash functions is small.