• Journal of Korea Multimedia Society
• /
• v.21 no.2
• /
• pp.87-97
• /
• 2018

Maximum intensity projection (MIP) is a common visualization technique in medical imaging system. A typical method to improve the performance of MIP is empty space leaping, which skips unnecessary area. This research proposes a new method to improve the existing empty space leaping. In order to skip more regions, we introduce a variety of acceleration strategies that use some tolerance given by the user to take part in image quality loss. Each proposed method shows various image quality and speed, and this study compares them to select the best one. Experimental results show that it is most efficient to add a constant tolerance function when the image quality required by the user is low. Conversely, when the user required image quality is high, a function with a low tolerance of volume center is most effective. Applying the proposed method to general MIP visualization can generate a relatively high quality image in a short time.

• Journal of the Korean Institute of Rural Architecture
• /
• v.24 no.1
• /
• pp.27-36
• /
• 2022

Currently the population of rural areas in Korea continue to decline due to low birth rate, aging population, and migration. This phenomenon is accelerated over time. And as a result, there are some declining phenomenon in rural society. And it is same in the residential and basic living conditions of rural villages. The increase ratio of empty houses exacerbates the rural landscape, acts as a cause of crime and bring out various social and economic problems such as worsening settlement conditions and local slums. The study is carried out to prevent this phenomenon by investigating the architectural contents of empty houses in the village, surveyed residents and owners and finally analyzed and synthesized to make a plan to utilize empty houses in the village. This study was conducted from June to December 2021. The conclusions are followings: 1. The empty houses in Korea were 1,511 million in 2020, 8.2% of the total number of houses, whereas those in Jeollabuk-do were 95,412, 12.9% of those of houses, and those in Gimje-city, the subject of this study, were 5,944. It is up to 15.8%. In particular, empty houses in Hacheon village, the site of this study, accounted for the highest ratio, with 25% of the total number of houses. 2. To understand the utilization and improvement of empty houses, surveys and interviews were conducted to residents and owners of Hacheon village in Gimje, and most of the residents submit proposals that empty houses were not desirable in terms of village landscape and safety. The owners don't have intentions of selling or leasing them. They want to remodel them and rent for a specific period. 3. As the physical condition of the empty houses(9empty houses) 6 empty houses of them are good. 4 of them are in poor condition. 4. By synthesizing these contents, nine empty houses in Hacheon village will be remodeled as the space for those of rural start-up young people, smart farm area, community space and rental housings for rural returnees.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06a
• /
• pp.118-120
• /
• 2006

최신 GPU는 일반 CPU보다 10배 이상 빠른 연산능력을 갖추고 있는데다가 사용자가 직접 프로그래밍 할 수 있기 때문에 이를 이용한 고속 볼륨 렌더링 알고리즘에 대한 연구가 활발하게 진행되고 있다. 그러나 스트림 프로세싱에 특화 돼있는 GPU의 특성상 early ray termination과 empty space skipping을 구현하는 것이 쉽지만은 않다. 특히 지금까지 제안됐던, 프록시 도형(proxy geometry)을 사용하는 볼륨 렌더링 알고리즘은 empty space skipping은 비교적 효율적으로 구현하지만 early ray termination의 지원은 상대적으로 미비했다. 본 논문에서는 스텐실 버퍼와 OpenGL 확장(extension)을 이용한 2-Pass 알고리즘을 통해서 early ray termination과 empty space skipping을 동시에 구현하는 방법을 제시하고, 그 성능을 측정했다.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10a
• /
• pp.722-725
• /
• 1990

This paper proposes a new path planning method for obstacle avoidance of mobile robot. In order to achieve easy planning of the path, a simple representation of the empty space is achieved based on thinning algorithm. The proposed Planning technique facilitates the direct use of information obtained by camera. Comparing to the V-graph method, the task of determining the shortest path from the resulting skeleton of empty space is optimized in terms of number of computation steps. The usefulness of the proposed method is ascertained by simulation.

• Journal of Korean Society of Rural Planning
• /
• v.19 no.3
• /
• pp.169-182
• /
• 2013

The purpose of this study is derived by Utilization Strategy for Rural empty houses stability of Return to the Farm and Rural. The main findings can be summarized as follows. First, the recent return to the farm and rural has increased, and life patterns of diversification, and the retirement of the baby boomer generation return to the farm and rural ratio differed by region. Second, the required first order accurate and detailed to maximize the utilization of the rural empty houses Survey, and the integrated management system based on it should be built. Third, the public lead in pushing for policy to take advantage of an empty house, leasing and management capabilities by strengthening return to the farm and rural characters, revitalizing rural and residential stabilization is necessary. Finally, in order to enhance the utilization of the rural empty houses should prepare return to the farm and rural, Multi-Habitation and a common space for existing residents for a variety of purposes. The results of these studies has a significance that can promote rural housing return to the farm and rural, resource utilization and stable settlement, and rural areas activated at the same time. Utilization of specific rural empty houses feasible policy being prepared, by linking rural areas that can bring effects on the activation of alternative hope.

• Journal of Navigation and Port Research
• /
• v.43 no.3
• /
• pp.197-208
• /
• 2019

This paper assessed the impacts of the specification of the yard, handling equipment, and operation approaches on the expected number of re-handles during the loading operation for empty containers. When the various types of empty containers from multiple shipping liners are placed in separate spaces from each other, then the storage space cannot be fully utilized. So as to increase the utilization of the storage space, empty containers from multiple vessel liners are stored together incurring additional re-handles during the loading operation. Several formulas are derived for the estimation of the expected number of handles, including re-handles, for empty container retrieval from a bay. Transfer cranes and top handlers are utilized as handling equipment and various retrieval strategies are examined. Numerical analysis was conducted to assess the effects of various designs and operational parameters of the container stacking yard on the expected number of handles.

• Journal of Korea Game Society
• /
• v.12 no.2
• /
• pp.53-62
• /
• 2012

Visualizing a volume dataset with ray-casting which of visualization methods provides high quality image. However it spends too much time for rendering because the size of volume data are huge. Recently, various researches have been proposed to accelerate GPU-based volume rendering to solve these problems. In this paper, we propose an efficient GPU-based empty space skipping to accelerate volume ray-casting using octree traversal. This method creates min-max octree and searches empty space using vertex splitting. It minimizes the bounding polyhedron by eliminating empty space found in the octree traveral step. The rendering results of our method are identical to those of previous GPU-based volume ray-casting, with the advantage of faster run-time because of using minimized bounding polyhedron.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.21 no.12
• /
• pp.1992-2007
• /
• 1997

A new algorithm for planning a collision-free path is developed based on linear prametric curve. In this paper robot is assumed to a point, and two linear parametric curve is used to construct a path connecting start and goal point, in which single intermediate connection point between start and goal point is considered. The intermediate connection point is set in polar coordinate(${\theta}{\delta}$) , and the interference between path and obstacle is mapped into CPS(connection point space), which is defined a CWS GM(circular work space geometry mapping). GM of all obstacles in workspace creates overlapping images of obstacle in CPS(Connection Point Space). The GM for all obstacles produces overlapping images of obstacle in CPS. The empty area of CPS that is not occupied by obstacle images represents collision-free paths in Euclidian Space. A GM based on connection point in elliptic coordinate(${\theta}{\delta}$) is also developed in that the total length of path is depend only on the variable .delta.. Hence in EWS GM(elliptic work space geometry mapping), increasing .delta. and finding the value of .delta. for collision-free path, the shortest path can be searched without carring out whole GM. The GM of obstacles expersses all possible collision-free path as empty spaces in CPS. If there is no empty space available in CPS, it indicates that path planning is not possible with given number of connection points, i.e. path planning is failed, and it is necessary to increase the number of connection point. A general case collision-free path planning is possible by appling GM to configuration space obstacles. Simulation of GM of obstacles in Euclidian space is carried out to measure performance of algorithm and the resulting obstacle images are reported.

• Journal of the Korean Statistical Society
• /
• v.10
• /
• pp.83-90
• /
• 1981

Let (X, A) be a measurable space, i.e. X is a non-empty set and A is a $\sigma$-field of subsets of X. Let $\Omega$ be a parameter space and P be a family of probability measures $P_\theta, \theta \in \Omega$ defined on (X, A).

• Journal of the Chungcheong Mathematical Society
• /
• v.10 no.1
• /
• pp.141-146
• /
• 1997

In this paper we prove that the corona theorem for the algebra $H^{\infty}(D){\cap}D(D)$. That is, we prove that $\mathcal{M}{\setminus}{\overline{D}}$ is an empty set where $\mathcal{M}$ is the maximal ideal space of the given algebra.