• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.4
• /
• pp.301-310
• /
• 2013

The aim of the present study is to enhance query speed of large 3D point cloud indexed in octree by parallel query using multi-cores. Especially, it is focused on developing methods of accessing multiple leaf nodes in octree concurrently to query points residing within a radius from a given coordinates. To the end, two parallel query methods are suggested using different strategies to distribute query overheads to each core: one using automatic division of 'for routines' in codes controlled by OpenMP and the other considering spatial division. Approximately 18 million 3D points gathered by a terrestrial laser scanner are indexed in octree and tested in a system with a 8-core CPU to evaluate the performances of a non-parallel and the two parallel methods. In results, the performances of the two parallel methods exceeded non-parallel one by several times and the two parallel rivals showed competing aspects confronting various query radii. Parallel query is expected to be accelerated by anticipated improvements of distribution strategies of query overhead to each core.

• The KIPS Transactions:PartD
• /
• v.8D no.2
• /
• pp.145-153
• /
• 2001

The Pyramid-Technique is based on mapping n-dimensional space data into one-dimensional data and expressing it as B-tree ; and by solving the problem of search time complexity the pyramid technique also prevents the effect \"phenomenon of dimensional curse\" which is caused by treatment of hypercube range query in n-dimensional data space. The Spherical Pyramid-Technique applies the pyramid method’s space division strategy, uses spherical range query and improves the search performance to make it suitable for similarity search. However, depending on the size of data and change in dimensions, the two above technique demonstrate significantly inferior search performance for data sizes greater than one million and dimensions greater than sixteen. In this paper, we propose a new index-structured PdR-Tree to improve the search performance for high dimensional data such as multimedia data. Test results using simulation data as well as real data demonstrate that PdR-Tree surpasses both the Pyramid-Technique and Spherical Pyramid-Technique in terms of search performance.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10a
• /
• pp.615-618
• /
• 2001

본 논문은 기존의 3D 게임 엔진에 실시간으로 상호 작용이 가능하고 3D MMORPG(Massive Multi-play Online Role flaying Game) 게임에 적합한 가상 공간을 표현하기 위한 필요한 기술을 분석하고 이를 활용하려 한다. 기존의 머드 게임에 3 차원 기술을 적용하고, 3 차원 물체를 모델링 하는데 있어서 메쉬나 버텍스, 혹은 폴리곤으로 사실적인 지형 처리와 렌드링 속도 향상을 위하여 3 차원 개체의 폴리곤을 동적으로 생성시키고 가시성 판단이나 충돌 검출을 위한 방법으로 Height field 처리 기법과 거리에 변화에 따라 다르게 모델링 된 데이터를 선택적으로 사용하는 CLOD(Continuous Level of Detail) 처리 기법과 입체 컬링 방법으로 옥트리를 이용하여 가상공간을 분해하기 위한 자료 구조로 사용한다. 거리의 변화에 따라 지형을 표현하는 vertex 들을 병합 또는 삭제함으로써 그 표현의 정도를 동적으로 달리 할 수 있는 CLOD 를 이용하여 카메라의 위치와 방향에 따라 적절한 폴리곤을 생성해 낼 수 있다. 본 논문은 기존의 3 차원 공간을 표현하기 위하여 사용되고 있는 옥트리 구조를 이용하여 공간을 분할하고, 이를 세부 수준으로 나누어 처리하기 위한 LOD(Level of Detail)와 CLOD 개념을 이용하여 외부지형을 폴리곤으로 표현하는 방법에 대한 처리 기법과 가시성 판단이나 충돌 검출을 위한 방법을 제시하려 한다.

• Journal of The Korean Association of Information Education
• /
• v.1 no.1
• /
• pp.49-59
• /
• 1997

In this thesis, To provide the base of effective data access methods, performance of some indexing techniques used gent-Tally are compared. They are classified as primary key and multikey. For primary key method, made a comparative analysis on Static index. Dynamic index and Hashing. For multikey indexing method K-d tree, K-d-B tree, Inverted file and Grid file of which characteristics are compared. In many applications, multikey indexings are more requested, but are not supplied enough. So, to satisfy users' request - more fast, more exact and to be applied according to the trend of being huge database systems, it is requested more study about multikey data access methods.

• Journal of the Korean Chemical Society
• /
• v.25 no.5
• /
• pp.311-317
• /
• 1981

A new nickel(II) compound, $Ni(CH_2SiMe_3)_2((C_6H_5)_2PCH_2CH_2P(C_6H_5)_2)$, 1, has been prepared by the reaction of $NiCl_2((C_6H_5)_2PCH_2CH_2P(C_6H_5)_2)$ with $Me_3SiCH_2Li$. The compound, 1, is stable under nitrogen at room temperature both in solution and in the solid state. Thermal decomposition of 1 in solution or in the solid produces the reductive coupling product, $Me_3SiCH_2CH_2SiMe_3$ which is also afforded by the reactions of 1 with CO and $O_2$ at room temperature, and with $(C_6H_5)_2PCH_2CH_2P(C_6H_5)_2$ at 80${\circ}$C.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.6
• /
• pp.238-245
• /
• 2013

Gesture recognition has been widely one of the research areas for natural user interface. This paper presents a novel gesture recognition method using tree classification and multiclass SVM(Support Vector Machine). In the learning step, 3D trajectory of human gesture obtained by a Kinect sensor is classified into the tree nodes according to their distributions. The gestures are resampled and we obtain the histogram of the chain code from the normalized data. Then multiclass SVM is applied to the classified gestures in the node. The input gesture classified using the constructed tree is recognized with multiclass SVM.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.1
• /
• pp.65-74
• /
• 2012

In this paper, we explore the application of 2-D dual-tree discrete wavelet transform (DDWT), which is a directional and redundant transform, for image coding. DDWT introduces limited redundancy and allows the transform to provide approximate shift invariance and directionally selective filters while preserving the usual properties of perfect reconstruction and computational efficiency with good well-balanced frequency responses. Also, quincunx lattice yields a non separable 2D-wavelet transform, which is also symmetric in both horizontal and vertical direction. And non-separable wavelet transformation can generate sub-images of multiple degrees rotated versions. The proposed 2-D non-separable DDWT can provide efficient approximation for directional features of images schemes, such as edges and contours in images that are not aligned with the horizontal or vertical direction. Finally, non-separable image processing using DDWT services good performance.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.3
• /
• pp.133-140
• /
• 2008

This paper proposes an effective k-D tree traversal algorithm for ray tracing on a GPU. The previous k-D tree traverse algorithm based on GPU uses bottom-up searching from a leaf to the root after failing to find the ray intersected primitive in the leaf node. During the bottom-up search the algorithm decides the current node is visited or not from the parent node. In such a way, we need to visit the parent node which was already visited and the duplicated bounding box intersection tests. The new k-D tree traverse algorithm reduces the brother and parent duplicated visit by using an efficient method which decides whether the brother node is already visited or not during the bottom-up search. Also the algorithm take place bounding box intersection tests only for the nodes which is not yet done. As a result our experiment shows the new algorithm is about 30% faster than the previous.

• Journal of Food Hygiene and Safety
• /
• v.33 no.5
• /
• pp.354-360
• /
• 2018

This study presents a method validation for extraction and quantitative analysis of trichothecene mycotoxins in nuts based on quick, easy, cheap, effective, rugged, and safe (QuEChERS) approach for extraction and enhanced matrix removal (EMR)-lipid-disperive-SPE (d-SPE) cleanup method, with detection and quantification by high-performance liquid chromatography coupled with tandem mass spectrometry (LC-MS/MS) in positive- and negative-ion modes. Linearity, precision, and accuracy were validated for LC-MS/MS methods. Results obtained with LC-MS/MS were linear, with correlation coefficient ($R^2$) of 0.998. Limits of detection and quantification for mycotoxins were $0.41-3.57{\mu}g/kg$ and $1.23-10.82{\mu}g/kg$, respectively. Intra- and inter-day precisions (RSD, %) were 0.40-8.44% and 1.93-12.46%, respectively. Results indicated to be rapidly and accurately identifying trichothecene mycotoxins and may be used as a suitable safety management method for nuts and nuts related commodities.

• Journal of KIISE:Software and Applications
• /
• v.26 no.3
• /
• pp.365-379
• /
• 1999

본 논문에서는 객체지향 데이터베이스의 클래스 계층에 대한 색인기법으로 이차원 색인구조를 이용하여 조율 가능한 이차원 클래스 색인기법인 2D-CHI를 제안한다. 2D-CHI 에서는 색인된 속성의 키값 도메인과 클래스 식별자 도메인으로 구성된 이차원 도메인상의 색인엔트리들에 대한 클러스터링 문제를 다룬다. 클러스터링 특성이 하나의 속성에 의해서 독점되는 B+-Tree 와 같은 일차원 색인구조를 이용하는 기존의 클래스 색인기법들은 특정 형태의 질의에 대해서만 적합한 색인기법들로서 다양한 형태의 질의들로 구성된 질의 패턴에 대해서 적절하게 대응하지 못한다. 2D-CHI에서는 질의 피턴에 따라 키값 도메인과 클래스 식별자 도메인 사이에서 색이 엔트리들의 클러스터링 정도를 조정함으로써 질의처리의 성능을 향상시킨다. 2D-CHI 의 성능평가를 위하여, 먼저 데이터의 균일 분포를 가정으로 비용 모델을 정립하여 기존의 색인기법들과 색인의 성능을 비교한다. 그리고, 계층 그리드 파일을 이용하여 구현한 2D-CHI의 실험으로 비용 모델을 검증하며, 다양한 실험을 통하여 데이터의 분포와 주어진 질의 형태에 따라 최적의 이차원 클래스 계층 색인구조를 구성할 수 있음을 보인다.