• Journal of the Korean School Mathematics Society
• /
• v.21 no.4
• /
• pp.327-342
• /
• 2018

The purpose of this paper is to review the domestic research on mathematical modeling by using three dimensional mathematical modeling map composed of perspective axis, domain axis, level axis, and to give direction to mathematical modeling research. The findings of this study show that the domestic research on mathematical modeling focuses on application perspective, notions and classroom domain and secondary level, and that we need various studies with concept formation perspective, system domain, tertiary level, and teacher(education) level on the future work about mathematical modeling.

• Journal of Advanced Navigation Technology
• /
• v.13 no.1
• /
• pp.134-141
• /
• 2009

In this paper, it is proposed a mind map program using open API to provide mashup function. Web paradigm is changing to Web 2.0. So mashup using open API is much applied. Mashup is good method for not only web service, but making new ideas or informations. It is mind map that was made systematical like this method. In this paper, a mind map application based on mobile that provides mashup function implemented for modern people that mostly process their business during movement.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.12
• /
• pp.91-97
• /
• 2013

Image and it's processing techniques are widely applied and very important in the recent IT environment. In this paper, we try to reconstruct original BMP(Bitmap) image into indexed image and codebook utilizing vector quantization and represent high quality image only with same pixel depth of previous indexed image like JPEG etc. That is, By adopting common map method onto index image with $2^n$ color codebook, image can be represented as high quality as $2^{n+1}$ color codebook. When proposed output image is compared with original BMP image, it provides as much around 2dB as higher PSNR than conventional 8 bit index image(normal JPEG). Furthermore, this improvement(2 dB higher PSNR) could be provided when using the 9 bit indexed image.

• Spatial Information Research
• /
• v.20 no.5
• /
• pp.67-76
• /
• 2012

Recently the mobile DBMS (Database Management System) is popular to store and manage large data in a mobile device. Especially, the research and development about mobile storage structure and querying method for navigation map data in a mobile device have been performed. The performance of the mobile DBMS in which random data accesses are most queries if the NAND flash memory is used as storage media of the DBMS is degraded. The reason is that the performance of flash memory is good in writing sequentially but bad in writing randomly as the features of the NAND flash memory. So, new storage structure and querying policies of the mobile DBMS are needed in the mobile DBMS in which a flash memory is used as storage media. In this paper, we have studied the policy of the database page management to enhance the performance of the frequent random update and applied this policy to the navigation-specialized mobile DBMS which supports incremental map update. And also we have evaluated the performance of this policy by experiments.

• Journal of KIISE:Software and Applications
• /
• v.31 no.7
• /
• pp.939-948
• /
• 2004

In this paper. we Propose a robust and fast image registration technique for motion correction in brain CT-CT angiography obtained from same patient to be taken at different time. First, the feature points of two images are respectively extracted by 3D edge detection technique, and they are converted to locally weighted 3D distance map in reference image. Second, we search the optimal location whore the cross-correlation of two edges is maximized while floating image is transformed rigidly to reference image. This optimal location is determined when the maximum value of cross-correlation does't change any more and iterates over constant number. Finally, two images are registered at optimal location by transforming floating image. In the experiment, we evaluate an accuracy and robustness using artificial image and give a visual inspection using clinical brain CT-CT angiography dataset. Our proposed method shows that two images can be registered at optimal location without converging at local maximum location robustly and rapidly by using locally weighted 3D distance map, even though we use a few number of feature points in those images.

• Smart Media Journal
• /
• v.12 no.10
• /
• pp.19-28
• /
• 2023

In the fruit harvesting field, interest in automatic robot harvesting is increasing due to various seasonality and rising harvesting costs. Accurate apple detection is a difficult problem in complex orchard environments with changes in light, vibrations caused by wind, and occlusion of leaves and branches. In this paper, we introduce a dataset and an adaptive heatmap regression model that are advantageous for robot automatic apple harvesting. The apple dataset was labeled with not only the apple location but also the visibility. We propose a method to detect the center point of an apple using an adaptive heatmap regression model that adjusts the Gaussian shape according to visibility. The experimental results showed that the performance of the proposed method was applicable to apple harvesting robots, with MAP@K of 0.9809 and 0.9801 when K=5 and K=10, respectively.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2010.07a
• /
• pp.265-268
• /
• 2010

본 논문에서는 지하철 정보를 제공하는 모바일 응용 프로그램을 제안하였다. 윈도우 모바일 6.0을 기반으로 한 이 응용프로그램은 지하철 역정보와 관련된 사용자의 편의성을 증대시키기 위하여 설계 및 구현되었다. 이 프로그램에서 지하철 노선도와 부가기능이 성공적으로 실행될 수 있도록 UI 인터페이스, 맵 모듈, 최단거리 모듈, 메모 모듈, 다익스트라 알고리즘 등을 설계하였다. 특히 다익스트라 알고리즘은 프로그램 내의 알람 기능과 역 정보에 적용되었고, 또한 역 정보와 같은 방대한 정보와 데이터를 인접 행렬을 이용하여 구축하였다. 이 응용프로그램은 보다 쉽게 조작하기 위해 6개의 메뉴들로 구성되어있다. 지하철의 종합 관제 센터로부터 신호를 받아 이 프로그램에 적용된다면, 많은 유저들이 보다 정확한 정보를 제공 받을 수 있다고 사료한다.

• Journal of Broadcast Engineering
• /
• v.11 no.4 s.33
• /
• pp.471-482
• /
• 2006

In this paper, we propose a new scheme to generate multi-view images utilizing depth map decomposition and adaptive edge smoothing. After carrying out smooth filtering based on an adaptive window size to regions of edges in the depth map, we decompose the smoothed depth map into four types of images: regular mesh, object boundary, feature point, and number-of-layer images. Then, we generate 3-D scenes from the decomposed images using a 3-D mesh triangulation technique. Finally, we extract multi-view images from the reconstructed 3-D scenes by changing the position of a virtual camera in the 3-D space. Experimental results show that our scheme generates multi-view images successfully by minimizing a rubber-sheet problem using edge smoothing, and renders consecutive 3-D scenes in real time through information decomposition of depth maps. In addition, the proposed scheme can be used for 3-D applications that need the depth information, such as depth keying, since we can preserve the depth data unlike the previous unsymmetric filtering method.

• Journal of Internet Computing and Services
• /
• v.12 no.6
• /
• pp.43-51
• /
• 2011

The recent development of the technology for wireless mobile computing and applied technology for location-based services has made it possible to support query processing faster than that in the past. However, some technological limitations on hardware and software still exist. The most critical aspects of query processing are accuracy and speed. For improving the accuracy, it is required that detailed information on the data involved in query processing be saved. In this case, the amount of information on the data increases, which decreases the speed. On the other hand, for increasing the speed, it is necessary to reduce the broadcast cycle, which enables rapid data acquisition as desired. In this case, because of insufficient index information, the listen time for the client increases, which may cause unnecessary energy consumption. Therefore, a trade-off occurs between the accuracy and speed. This paper proposes a hierarchical bitmap-based spatial index (HBI) as a solution for the aforementioned problems. HBI describes an object with 0 and 1 on the Hilbert curve map. It reduces the broadcast cycle by decreasing the index size on the basis of bit information and tree structure. Therefore, it is able to shorten the listen time and query processing time. In addition, HBI enables the detection of the locations of all the objects so that it is possible selectively listen to a broadcast. A performance evaluation of the proposed technique demonstrates that it is excellent.

• Journal of Korea Game Society
• /
• v.7 no.4
• /
• pp.71-80
• /
• 2007

In this paper, we introduce an efficient GPU-based real-time rendering technique applicable to every kind of game. Our method, without an extra geometry, can represent terrain just with a height map. It makes it possible to freely go around in the air or on the surface, so we can directly apply it to any computer games as well as a virtual reality. Since our method is not based on any geometrical structure, it doesn't need special LOD policy and the precision of geometrical representation and visual quality absolutely depend on the resolution of height map and color map. Moreover, GPU-only technique allows the general CPU to be dedicated to more general work, and as a result, enhances the overall performance of the computer. To date, there have been many researches related to the terrain representation, but most of them rely on CPU or confmed its applications to flight simulation, Improving existing displacement mapping techniques and applying it to our terrain rendering, we completely ruled out the problems, such as cracking, poping etc, which cause in polygon-based techniques, The most important contributions are to efficiently deal with arbitrary LOS(Line Of Sight) and dramatically improve visual quality during walk-through by reconstructing a height field with curved patches. We suggest a simple and useful method for calculating ray-patch intersections. We implemented all these on GPU 100%, and got tens to hundreds of framerates with height maps a variety of resolutions$(256{\times}256\;to\;4096{\times}4096)$.