• Title/Summary/Keyword: 공간 분할 기법

Search Result 654, Processing Time 0.027 seconds

Design and Implementation of a Cloth Simulation System based on Hierarchical Space Subdivision Method (계층적 공간 분할 방법을 이용한 의복 시뮬레이션 시스템의 설계 및 구현)

  • Kim Ju-Ri;Cho Jin-Ei;Joung Suck-Tae;Lee Yong-Ju;Jung Sung-Tae
    • Journal of the Korea Society of Computer and Information
    • /
    • v.9 no.4 s.32
    • /
    • pp.109-116
    • /
    • 2004
  • This paper describes a cloth simulation system for dressing 3D virtual human model with different pieces of clothing. The garments are constructed of cutting patterns seamed together. The system reads a body file and a cutting pattern file and produces a new model dressed with the specified garment by using a physical simulation based on a mass-spring model. For the realistic cloth simulation, it performs collision detection and response between triangles of the 3D human model and the garment. Because the number of triangles of a human model is very large. the collision detection and response requires a lot of time. To overcome this problem, we propose a pruning method which decreases the number of collision detection and response by a space-subdivision method. Experimental results show that the system produces realistic images and makes it possible to sew a garment around a virtual human body in several seconds.

  • PDF

TPKDB-tree : An Index Structure for Efficient Retrieval of Future Positions of Moving Objects (TPKDB 트리 : 이동 객체의 효과적인 미래 위치 검색을 위한 색인구조)

  • Seo Dong Min;Bok Kyoung Soo;Yoo Jae Soo;Lee Byoung Yup
    • Journal of KIISE:Databases
    • /
    • v.31 no.6
    • /
    • pp.624-640
    • /
    • 2004
  • Recently, with the rapid development of location-based techniques, index structures to efficiently manage moving objects have been required. In this paper, we propose a new spatio-temporal index structure that supports a future position retrieval and minimizes a update cost. The proposed index structure combines an assistant index structure that directly accesses current positions of moving objects with KDB-tree that is a space partitioning access method. The internal node in our proposed index structure keeps time parameters in order to support the future position retrieval and to minimize a update cost. Moreover, we propose new update and split methods to maximize the space utilization and the search performance. We perform various experiments to show that our proposed index structure outperforms the existing index structure.

Plant Species Utilization and Care Patterns Using Potted Plants in the Traditional Gardening (전통조경에서 분(盆)을 이용한 식물의 활용과 애호 행태)

  • Kim, Myung-Hee
    • Journal of the Korean Institute of Traditional Landscape Architecture
    • /
    • v.31 no.3
    • /
    • pp.61-74
    • /
    • 2013
  • This study examined and analyzed ancient writing and poetry regarding cases of appreciating plants by using pots in a garden of a palace or private houses by ancestors, and examined shape and planting method of plant species and potted plants, arrangement and preference of potted plants. As for the method of the study, description research method which examines and interprets poem and painting based on potted plants. The results of this study is summarized like the following. First, the plants which were favorably used for potted plants include 19 kinds such as Prunus mume, Pinus densiflora, Pinus pumila, Phyllostachys spp., Camellia japonica, Punica granatum, and Gardenia jasminoidesa, and as for herbs, 12 kinds such as Chrysanthemum monifolium and Nelumbo nusifera . Second, the species which were specially arranged into artificial shapes include Prunus mume and Pinus densiflora. The two plants made the shape of severe curves of stems such as Wangpi. Gyuban, and Bangan, and there are Pinus densiflora dwarfed potted plant whose roots are stretched on Prunus mume grafted into a strange stump and an oddly shaped stone. For the beauty of the dwarfed tree shape, pine cones are added to an old Pinus densiflora or Parthenocissus tricuspidata is planted to stems, and additional method of making moss on the soil, which is called 'Jongbunchuigyeong'. As for planting method, water culture, planting on a stone, planting on a charcoal, and assembled planting are expressed in poetry. Third, as for external space for potted plants, a place where a king stays, a bed room for a king, surrounding areas and gardens of private houses, and step stones were used as a space which adds artistic effects. Potted plants are placed on a table in a library, on a desk, on a drawer, and near a pillow as a small items in a room, and scholars enjoyed original characteristics and symbolism of the potted plants. Fourth, at the time of flowering of Prunus mume, poetry event was held to enjoy the tree and writing poetry begun. And at the time of flowering of Chrysanthemum monifolium, the flowers were floated in a liquor glass or shadow play was enjoyed. Fifth, potted plants played the role of garden ornaments in elegant events of a palace, the gentry, wedding ceremony, and sacrificial rites. Sixth, potted plants were used as tributes between countries, donation to a king, or a gift of a king. In addition, there were many cases where scholars exchanged potted plants and there is the first record of giving a potted plant in 'Mokeunsigo' by Mokeun Isaek, scholar in the late era of Goryeo. Seventh, at the time of flowering Prunus mume, Chrysanthemum monifolium, Gardenia jasminoides, Nelumbo nusifera, and Narcissustazetta var. chinensis, they enjoyed the particular fragrance and express it into poetry. Eighth, plant species from southern parts such as Camellia japonica, Daphne odora, Gardenia jasminoides, Citrus unshiu, Phyllostachys spp., Punica granatum, Rosa rugosa, and Musa basjoo, or foreign plant species, and species weak against the cold were utilized as pot plants for enjoying green trees indoors in northern central province in harshly cold winter.

A Parallel Video Encoding Technique for U-HDTV (U-HDTV를 위한 향상된 병렬 비디오 부호화 기법)

  • Jung, Seung-Won;Ko, Sung-Jea
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.48 no.1
    • /
    • pp.132-140
    • /
    • 2011
  • Ultra-High Definition Television (U-HDTV) is a promising candidate for the next generation television. Since the U-HDTV video signal requires a huge amount of data, parallel implementation of the U-HDTV compression system is highly demanding. In the conventional parallel video codec, a video is divided into sub-sequences and the sub-sequences are independently encoded. In this paper, for efficient parallel processing, we propose a pipelined encoding structure which exploits cross-correlation among the sub-sequences. The experimental results demonstrate that the proposed technique improves the coding efficiency and provides the sub-sequences of the balanced visual quality.

GC-Tree: A Hierarchical Index Structure for Image Databases (GC-트리 : 이미지 데이타베이스를 위한 계층 색인 구조)

  • 차광호
    • Journal of KIISE:Databases
    • /
    • v.31 no.1
    • /
    • pp.13-22
    • /
    • 2004
  • With the proliferation of multimedia data, there is an increasing need to support the indexing and retrieval of high-dimensional image data. Although there have been many efforts, the performance of existing multidimensional indexing methods is not satisfactory in high dimensions. Thus the dimensionality reduction and the approximate solution methods were tried to deal with the so-called dimensionality curse. But these methods are inevitably accompanied by the loss of precision of query results. Therefore, recently, the vector approximation-based methods such as the VA- file and the LPC-file were developed to preserve the precision of query results. However, the performance of the vector approximation-based methods depend largely on the size of the approximation file and they lose the advantages of the multidimensional indexing methods that prune much search space. In this paper, we propose a new index structure called the GC-tree for efficient similarity search in image databases. The GC-tree is based on a special subspace partitioning strategy which is optimized for clustered high-dimensional images. It adaptively partitions the data space based on a density function and dynamically constructs an index structure. The resultant index structure adapts well to the strongly clustered distribution of high-dimensional images.

Synthesis method of elemental images from Kinect images for space 3D image (공간 3D 영상디스플레이를 위한 Kinect 영상의 요소 영상 변환방법)

  • Ryu, Tae-Kyung;Hong, Seok-Min;Kim, Kyoung-Won;Lee, Byung-Gook
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2012.05a
    • /
    • pp.162-163
    • /
    • 2012
  • In this paper, we propose a synthesis method of elemental images from Kinect images for 3D integral imaging display. Since RGB images and depth image obtained from Kinect are not able to display 3D images in integral imaging system, we need transform the elemental images in integral imaging display. To do so, we synthesize the elemental images based on the geometric optics mapping from the depth plane images obtained from RGB image and depth image. To show the usefulness of the proposed system, we carry out the preliminary experiments using the two person object and present the experimental results.

  • PDF

Representing variables in the latent space (분석변수들의 잠재공간 표현)

  • Huh, Myung-Hoe
    • The Korean Journal of Applied Statistics
    • /
    • v.30 no.4
    • /
    • pp.555-566
    • /
    • 2017
  • For multivariate datasets with large number of variables, classical dimensional reduction methods such as principal component analysis may not be effective for data visualization. The underlying reason is that the dimensionality of the space of variables is often larger than two or three, while the visualization to the human eye is most effective with two or three dimensions. This paper proposes a working procedure which first partitions the variables into several "latent" clusters, explores individual data subsets, and finally integrates findings. We use R pakacage "ClustOfVar" for partitioning variables around latent dimensions and the principal component biplot method to visualize within-cluster patterns. Additionally, we use the technique for embedding supplementary variables to figure out the relationships between within-cluster variables and outside variables.

An Efficient Angular Space Partitioning Based Skyline Query Processing Using Sampling-Based Pruning (데이터 샘플링 기반 프루닝 기법을 도입한 효율적인 각도 기반 공간 분할 병렬 스카이라인 질의 처리 기법)

  • Choi, Woosung;Kim, Minseok;Diana, Gromyko;Chung, Jaehwa;Jung, Soonyong
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.6 no.1
    • /
    • pp.1-8
    • /
    • 2017
  • Given a multi-dimensional dataset of tuples, a skyline query returns a subset of tuples which are not 'dominated' by any other tuples. Skyline query is very useful in Big data analysis since it filters out uninteresting items. Much interest was devoted to the MapReduce-based parallel processing of skyline queries in large-scale distributed environment. There are three requirements to improve parallelism in MapReduced-based algorithms: (1) workload should be well balanced (2) avoid redundant computations (3) Optimize network communication cost. In this paper, we introduce MR-SEAP (MapReduce sample Skyline object Equality Angular Partitioning), an efficient angular space partitioning based skyline query processing using sampling-based pruning, which satisfies requirements above. We conduct an extensive experiment to evaluate MR-SEAP.

Fuzzy-based Processor Allocation Strategy for Multiprogrammed Shared-Memory Multiprocessors (다중프로그래밍 공유메모리 다중프로세서 시스템을 위한 퍼지 기반 프로세서 할당 기법)

  • 김진일;이상구
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.10 no.5
    • /
    • pp.409-416
    • /
    • 2000
  • In the shared-memory mutiprocessor systems, shared processing techniques such as time-sharing, space¬sharing, and gang-scheduling are used to improve the overall system utilization for the parallel operations. Recently, LLPC(Loop-Level Process Control) allocation technique was proposed. It dynamically adjusts the needed number of processors for the execution of the parallel code portions based on the current system load in the given job. This method allocates as many available processors as possible, and does not save any processors for the parallel sections of other later-arriving applications. To solve this problem, in this paper, we propose a new processor allocation technique called FPA(Fuzzy Processor Allocation) that dynamically adjusts the number of processors by fuzzifYing the amounts ofueeded number of processors, loads, and estimated execution times of job. The proposed method provides the maximum possibility of the parallism of each job without system overload. We compare the performances of our approaches with the conventional results. The experiments show that the proposed method provides a better performance.

  • PDF

Preemptive Garbage Collection Scheme for the Responsiveness Improvement of NAND Flash Memories (낸드 플래시 메모리의 응답시간 향상을 위한 선점방식 가비지 컬렉션 기법)

  • Jung, Sang-Hyuk;Song, Yong-Ho
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2012.06a
    • /
    • pp.176-178
    • /
    • 2012
  • 낸드 플래시 메모리는 FTL의 페이지 re-mapping 동작으로 인하여 특정 페이지가 무효화되었음에도 불구하고 물리적으로 소거되지 않은 상태로 낸드 플래시 공간을 점유하는 문제가 발생할 수 있다. 플래시 저장장치의 제어기는 플래시 기반 저장장치의 지속적인 쓰기 성능 유지와 저장 용량 확보를 위해 무효 페이지를 물리적으로 제거하고 유효 페이지를 수집하는 가비지 컬렉션 연산을 수행한다. 따라서 다수의 블록을 대상으로 가비지 컬렉션 연산을 수행할 경우, 많은 페이지 복사와 블록 삭제 연산들로 인한 저장장치 지연현상이 발생할 수 있다. 본 논문에서는 낸드 플래시 저장장치에 적용 가능한 효과적인 가비지 컬렉션 메커니즘을 제안한다. 선점방식 가비지 컬렉션 기법은 블록 맵의 데이터 구조를 간단히 수정하여, 단일 블록을 대상으로 가비지 컬렉션을 수행한다. 이 기법의 유효성은 페이지 복사와 블록 삭제 연산을 세부 단위로 분할하여 처리가 가능하므로 가비지 컬렉션이 수행되는 도중에 요청되는 호스트의 요청에 기민하게 응답가능하다는 것이다.