• 한국시뮬레이션학회논문지
• /
• 제11권4호
• /
• pp.1-14
• /
• 2002

This paper presents bounding space(BS) management for real-time visual simulation when using GK-DEVS models. Since GK-DEVS, extended from DEVS formalism, has information of 3D geometry and 3D hierarchical structure, we employs three types of bounding spaces: BS of its own shape, BS of its children GK-DEVS, and total BS. In addition to next-event scheduling functionality of previous GK-Simulator, its abstract simulation algorithms is extended to manage the three types of BSs so that BSs can be utilized in the rendering process of a renderer, so called GK-Renderer, We have implemented the method and evaluated it with an automated manufacturing system. In the case study, the proposed BSs management method showed about 2 times improvement in terms of rendering process speed.

• 대한전자공학회논문지
• /
• 제25권12호
• /
• pp.1633-1638
• /
• 1988

This paper proposes the lattice-structured space subdivision method using bounding volume to reduce a great number of ray-surface intersection calculations in ray tracing algorithm for the computer graphics. We show that this method reduced 50%-70% calculations compard to pre-exist method by experiments.

• IEIE Transactions on Smart Processing and Computing
• /
• 제3권2호
• /
• pp.59-64
• /
• 2014

This paper presents a method for estimating the bounding volume for image-based 3D object reconstruction. The bounding volume of an object is a three-dimensional space where the object is expected to exist, and the size of the bounding volume strongly affects the resolution of the reconstructed geometry. Therefore, the size of a bounding volume should be as small as possible while it encloses an actual object. To this end, the proposed method uses a set of silhouettes of an object and generates a point cloud using a point filter. A bounding volume is then determined as the minimum sphere that encloses the point cloud. The experimental results show that the proposed method generates a bounding volume that encloses an actual object as small as possible.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2022년도 추계학술대회
• /
• pp.400-403
• /
• 2022

본 논문은 가시화 기반 LBVH(Linear Bounding Volume Hierarchy))을 이용한 빠른 GPU기반 N-body 충돌 체크 알고리즘을 제안한다. 본 알고리즘은 움직이는 n-body 개체에 대한 수정된 모튼코드(Morton code)를 이용하며, 이 모튼코드는, 일반적으로 사용되는 개체의 위치 정보뿐 아니라 이 개체가 스크린상에 차지하는 가시화 영역 정보를 이용하기 때문에, 카메라의 위치 및 방향에 따라 화면상에 차지하는 영역이 작은 개체에 대한 빠른 GPU기반 정렬(sorting)이 가능하게 된다. 실험을 통해, 본 논문에서 제안하는 방법이 기존 방법보다 15%이상 성능 향상이 있음을 알게 되었다

• 한국멀티미디어학회논문지
• /
• 제20권8호
• /
• pp.1271-1281
• /
• 2017

It is essential to collect and analyze target information around the vehicle for autonomous driving of the vehicle. Based on the analysis, environmental information such as location and direction should be analyzed in real time to control the vehicle. In particular, obstruction or cutting of objects in the image must be handled to provide accurate information about the vehicle environment and to facilitate safe operation. In this paper, we propose a method to simultaneously generate 2D and 3D bounding box proposals using LiDAR Edge generated by filtering LiDAR sensor information. We classify the classes of each proposal by connecting them with Region-based Fully-Covolutional Networks (R-FCN), which is an object classifier based on Deep Learning, which uses two-dimensional images as inputs. Each 3D box is rearranged by using the class label and the subcategory information of each class to finally complete the 3D bounding box corresponding to the object. Because 3D bounding boxes are created in 3D space, object information such as space coordinates and object size can be obtained at once, and 2D bounding boxes associated with 3D boxes do not have problems such as occlusion.

• 한국통신학회논문지
• /
• 제35권9B호
• /
• pp.1350-1359
• /
• 2010

최근에 근접 인증(proximity authentication)을 위해 사용하는 RFID 시스템이 경계 위조(distance fraud), 마피아 위조(mafia fraud), 테러리스트 위조(terrorist fraud) 공격들과 같은 다양한 위치 기반의 중계 공격(relay attack)들에 취약함이 증명되었다. 이러한 중계 공격들을 방지하기 위해 리더와 태그사이의 데이터 왕복 전송 시간을 측정하는 경계 결정(distance-bounding) 프로토콜이 한 해결책으로 연구되고 있다. 2008년에 Munilla와 Peinado는 Hancke-Kuhn이 제안한 프로토콜을 수정하여 보이드-시도(void-challenge) 기법을 적용한 RFID 경계 결정 프로토콜을 제안하였다. Hancke-Kuhn 프로토콜과 비교하여 Munilla-Peinado의 프로토콜은 공격자에게 n번의 왕복에서(5/8)n의 성공 확률을 제공함으로써 공격 성공 확률을 감소시켜준다. 하지만 저장 공간 낭비와 많은 해쉬 함수 연산으로 인해 저비용 수동형 태그에는 비효율적이다. 이에 본 논문에서는 태그측의 해쉬 함수 연산량을 줄이고, 적은 저장 공간을 요구함으로써 저비용 수동형 태그에 적합한 새로운 RFID 경계 결정 프로토콜을 제안한다. 결론적으로 제안한 경계 결정 프로토콜은 Munilla-Peinado의 프로토콜과 비교하여 저장 공간 효율성과 연산 효율성을 높여줄 뿐만 아니라, $(5/8)^n$의 공격자 성공 확률을 보장함으로써 동일한 안전성을 제공할 수 있다.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2003년도 가을 학술발표논문집 Vol.30 No.2 (2)
• /
• pp.43-45
• /
• 2003

Nowadays, with numerous emerging applications (e.g., traffic control, meteorology monitoring, mobile computing, etc.), access methods to process current and future queries for moving objects are becoming increasingly important. Among these methods, the time-parameterized R-tree (TPR-tree) seems likely the most flexible method in one, two, or three-dimensional space. A key point of TPR-tree is that the (conservative) bounding rectangles are expressed by functions of time. In this paper, we propose a new method, which takes into account positions of its moving objects against the rectangle's bounds. In proposed method, the size of bounding rectangle is significantly smaller than the traditional bounding rectangle in many cases. By this approach, we believe that the TPR-tree can improve query performance considerably.

• 한국공간정보시스템학회:학술대회논문집
• /
• 한국공간정보시스템학회 2003년도 추계학술대회
• /
• pp.159-162
• /
• 2003

In this paper, to find probable collision positions between moving object and terrain in 3D space efficiently, we use a model, similar to Ray Tracing, which finds the triangles intersected by a directed line segment from a large amount of triangles. We try to reduce dead space as much as possible to find candidate triangles intersected by a directed line segment than previous work's. A new modified octree, LBV-Octree(Least Bounding Voxel Octree), is proposed, and we have a ray tracing with it. In the experiment, ray tracing with LBV-Octree provides $5%{\sim}11%$ better performance than with classical octree.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2004년도 가을 학술발표논문집 Vol.31 No.2 (2)
• /
• pp.91-93
• /
• 2004

이동 객체의 현재와 미래 위치 질의에 최적화된 색인 구조로써 TPR-트리가 있다 TPR-트리는 기존의 공간 색인 구조와 달리 이동 객체와 경계 사각형을 참조 위치와 속도 벡터를 매개 변수로 한 시간에 대한 선형 함수 형태로 모델링 함으로써 갱신 비용을 줄이고 현재 및 가까운 미래 위치 정보의 예측을 가능하도록 한다 . 하지만 TPR- 트리는 시간의 정파에 따라 경계 사각형이 선형적으로 환장됨으로 인해 경계 사각형 내의 객체를 제외한 나머지 공간인 사장 공간과 경계 사각 혈들 간의 겹침 현상을 증가시켜 정의 성능이 떨어진다는 단점을 가진다. 본 논문에서는 질의 성능을 향상시키기 위하여 경계 사각형 내의 이동 객체들이 이동함에 따라 변경되는 최소 경계 사각형 (MBR: Minimim Bounding Rectangle)을 베지어 곡선 함수를 이용하여 근사함으로써 사장 공간을 줄이는 적응 경계 사각형 (ABR: Adaptive Bounding Rectangle) 기법을 제안한다.

• 방송공학회논문지
• /
• 제27권7호
• /
• pp.999-1010
• /
• 2022

The increase in vehicle purchases worldwide is having a very significant impact on the availability of parking spaces. In particular, since it is difficult to secure a parking space in an urban area, it may be of great help to the driver to check vehicle parking information in advance. However, the current parking lot information is still operated semi-manually, such as notifications. Therefore, in this study, we propose a system for detecting a parking space using a relatively simple image processing method based on an image taken from the sky and evaluate its performance. The proposed method first converts the captured RGB image into a black-and-white binary image. This is to simplify the calculation for detection using discrete information. Next, a morphological operation is applied to increase the clarity of the binary image, and a template mask in the form of a bounding box indicating a parking space is applied to check the parking state. Twelve image samples and 2181 total of test, were used for the experiment, and a threshold of 40% was used to detect each parking space. The experimental results showed that information on the availability of parking spaces for parking users was provided with an accuracy of 95%. Although the number of experimental images is somewhat insufficient to address the generality of accuracy, it is possible to confirm the possibility of parking space detection with a simple image processing method.