• Title/Summary/Keyword: Parallelepiped Algorithm

Search Result 5, Processing Time 0.015 seconds

A Study on the Performance of Parallelepiped Classification Algorithm (평행사변형 분류 알고리즘의 성능에 대한 연구)

  • Yong, Whan-Ki
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.4 no.4
    • /
    • pp.1-7
    • /
    • 2001
  • Remotely sensed data is the most fundamental data in acquiring the GIS informations, and may be analyzed to extract useful thematic information. Multi-spectral classification is one of the most often used methods of information extraction. The actual multi-spectral classification may be performed using either supervised or unsupervised approaches. This paper analyze the effect of assigning clever initial values to image classes on the performance of parallelepiped classification algorithm, which is one of the supervised classification algorithms. First, we investigate the effect on serial computing model, then expand it on MIMD(Multiple Instruction Multiple Data) parallel computing model. On serial computing model, the performance of the parallel pipe algorithm improved 2.4 times at most and, on MIMD parallel computing model the performance improved about 2.5 times as clever initial values are assigned to image class. Through computer simulation we find that initial values of image class greatly affect the performance of parallelepiped classification algorithms, and it can be improved greatly when classes on both serial computing model and MIMD parallel computation model.

  • PDF

3-D Model Reconstruction from Three Orthogonal Views Based on Merging Technique of RP Codes (RP 코드 합성을 기반으로 한 세 방향 영상에서의 삼차원 모델의 복원)

  • 박순용;진성일
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.31B no.4
    • /
    • pp.106-114
    • /
    • 1994
  • A new merging technique is adopted for combining rectangular parallelepipes produced by 2-D rectangular code into more intuitive 30D volume elements. Rectangular parallelepiped codes (RP codes) can be used in volume-based representation of a three-dimensional object. We proposed more regularity-conserving 2-D rectangular coding scheme to merge rectangular cells represented by RP codes in three-dimensional space. After being constructed from modified 2-D rectangular code, 3-D RP codes are merged in the two orthogonal directions using new merging algorithm. The shape of merged 3-D object reconstructed by proposed algorithm is shown to be much closer to the original object shape than that of conventional RP codes. The storage requirement of merged object can be also reduced.

  • PDF

Absorptive material arrangement to make a quiet zone in a three dimensional enclosure (실내 정숙 공간 형성을 위한 흡음재 배치 방법)

  • 박주배;김양한
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2002.05a
    • /
    • pp.1061-1066
    • /
    • 2002
  • This study proposes an analytic method that determines an optimal arrangement of absorptive materials on an enclosure surface. Under the optimal arrangement, a quiet zone in the enclosure has the minimum $\varepsilon$$\sub$p/ (acoustic potential energy density). The proposed method has been implemented by using a BEM simulation and a genetic algorithm. The BEM simulation evaluates the $\varepsilon$$\sub$p/ under the prescribed arrangement of the absorptive materials. The genetic algorithm searches the optimal arrangement by referring the ep evaluated from the BEM simulation. In the BEM simulation, the absorptive material arrangement is expressed as a vector, which is denoted as in absorptive material arrangement (AMA) vector. Besides, an admittance vector of which elements are admittances of available absorptive materials and an AMA matrix that transforms the admittance vector into the AMA vector are defined. The AMA matrix is also used as a chromosome in the genetic algorithm so that it functions to relate the BEM simulation to the genetic algorithm. As a verification example, the proposed method is applied to make the quiet zone in a parallelepiped enclosure.

  • PDF

A New branch and bound algorithm for unconstrained three-dimensional cutting problems (무제한 3차원 절단문제를 위한 새로운 분지 한계법)

  • Young-Jo Seong;Maing-Kyu Kang
    • Journal of the Korea Computer Industry Society
    • /
    • v.5 no.3
    • /
    • pp.377-382
    • /
    • 2004
  • An unconstrained three-dimensional cutting problem describes the process of finding the cutting pattern that yields the maximum total profit-sum for the small parallelepipeds pieces cut from a large parallelepiped box and there is no limit to the number of pieces to be cut. The problem is a classic NP-hard. The bottom-up approach, which generates all of the feasible cutting patterns by combining two other cutting patterns, can be applied to the three-dimensional problem. We introduce a build and new branching strategies for the unconstrained three-dimensional cutting problem. The strategies are all generalized from the branching strategies proposed by G et at. to solve unconstrained two-dimensional cutting problems.

  • PDF

A Study on Stereo Visualization of the X-ray Scanned Image Based on Dual-line Sensors (듀얼센서 기반 X-선 검색영상 스테레오 가시화 연구)

  • Lee, Nam-Ho;Hwang, Young-Gwan;Park, Jong-Won;Lim, Yong-Gon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.9
    • /
    • pp.2083-2090
    • /
    • 2010
  • This paper presents a 3-D visualization technique using stereo radioactive images to provide efficient inspection of fast moving cargo objects. The proposed technique can be used for such objects which CT or MRI cannot inspect due to restricted scan environment. Stereo radioactive images are acquired from a specially designed equipment which consists of a X-ray source, linear radioactive sensors, and a moving stage. Two radioactive sensors are installed so that rectified stereo X-ray images of objects are acquired. Using the stereo X-ray images, we run a matching algorithm to find the correspondences between the images and reconstruct 3-D shapes of real objects. The objects are put in a parallelepiped box to simulate cargo inspection. Three real objects are tested and reconstructed. Due to the inherent ambiguity in the stereo X-ray images, we reconstruct 3-D shapes of the edges of the objects. The experimental results show the proposed technique can provide efficient visualization for cargo inspection.