• Title/Summary/Keyword: high-dimensional objects

Search Result 144, Processing Time 0.026 seconds

A Study of Efficient Access Method based upon the Spatial Locality of Multi-Dimensional Data

  • Yoon, Seong-young;Joo, In-hak;Choy, Yoon-chul
    • Proceedings of the Korea Database Society Conference
    • /
    • 1997.10a
    • /
    • pp.472-482
    • /
    • 1997
  • Multi-dimensional data play a crucial role in various fields, as like computer graphics, geographical information system, and multimedia applications. Indexing method fur multi-dimensional data Is a very Important factor in overall system performance. What is proposed in this paper is a new dynamic access method for spatial objects called HL-CIF(Hierarchically Layered Caltech Intermediate Form) tree which requires small amount of storage space and facilitates efficient query processing. HL-CIF tree is a combination of hierarchical management of spatial objects and CIF tree in which spatial objects and sub-regions are associated with representative points. HL-CIF tree adopts "centroid" of spatial objects as the representative point. By reflecting objects′sizes and positions in its structure, HL-CIF tree guarantees the high spatial locality of objects grouped in a sub-region rendering query processing more efficient.

  • PDF

Feasibility study on developing productivity and quality improved three dimensional printing process

  • Lee, Won-Hee;Kim, Dong-Soo;Lee, Taik-Min;Lee, Min-Cheol
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.2160-2163
    • /
    • 2005
  • Solid freeform fabrication (SFF) technology plays a major role in industry and represents a reasonable percentage of industrial rapid prototyping/tooling/manufacturing (RP/RT/RM) development applications. However, SFF technology still has long way to progress to achieve satisfactory process speed, surface finish and overall quality improvement of its application. Today, three dimensional printing (3DP) technique that is one of SFF technology is receiving many interests, and is applied by various fields. It can fabricate three dimensional objects of solid freeform with high speed and low cost using ink jet printing technology. However, need long curing time after manufacture completion. And it must do post-processing process necessarily to heighten strength of objects because strength of fabricated objects is very weak. Therefore, in this study, we proposed an improved 3DP process that can solve problems of conventional 3DP process. The general 3DP process is method to spout binder simply through printer head on powder, but proposed process is method to cure jetted UV resin by UV lamp after jet UV resin using printhead on powder. The hardening of resin is achieved strongly at early time by UV lamp in proposed method. So, the proposed process can fabricate three dimensional objects with high speed without any post-processing.

  • PDF

A Bayesian Model-based Clustering with Dissimilarities

  • Oh, Man-Suk;Raftery, Adrian
    • Proceedings of the Korean Statistical Society Conference
    • /
    • 2003.10a
    • /
    • pp.9-14
    • /
    • 2003
  • A Bayesian model-based clustering method is proposed for clustering objects on the basis of dissimilarites. This combines two basic ideas. The first is that tile objects have latent positions in a Euclidean space, and that the observed dissimilarities are measurements of the Euclidean distances with error. The second idea is that the latent positions are generated from a mixture of multivariate normal distributions, each one corresponding to a cluster. We estimate the resulting model in a Bayesian way using Markov chain Monte Carlo. The method carries out multidimensional scaling and model-based clustering simultaneously, and yields good object configurations and good clustering results with reasonable measures of clustering uncertainties. In the examples we studied, the clustering results based on low-dimensional configurations were almost as good as those based on high-dimensional ones. Thus tile method can be used as a tool for dimension reduction when clustering high-dimensional objects, which may be useful especially for visual inspection of clusters. We also propose a Bayesian criterion for choosing the dimension of the object configuration and the number of clusters simultaneously. This is easy to compute and works reasonably well in simulations and real examples.

  • PDF

A Fast Algorithm for Target Detection in High Spatial Resolution Imagery

  • Kim Kwang-Eun
    • Proceedings of the KSRS Conference
    • /
    • 2006.03a
    • /
    • pp.7-14
    • /
    • 2006
  • Detection and identification of targets from remotely sensed imagery are of great interest for civilian and military application. This paper presents an algorithm for target detection in high spatial resolution imagery based on the spectral and the dimensional characteristics of the reference target. In this algorithm, the spectral and the dimensional information of the reference target is extracted automatically from the sample image of the reference target. Then in the entire image, the candidate target pixels are extracted based on the spectral characteristics of the reference target. Finally, groups of candidate pixels which form isolated spatial objects of similar size to that of the reference target are extracted as detected targets. The experimental test results showed that even though the algorithm detected spatial objects which has different shape as targets if the spectral and the dimensional characteristics are similar to that of the reference target, it could detect 97.5% of the targets in the image. Using hyperspectral image and utilizing the shape information are expected to increase the performance of the proposed algorithm.

  • PDF

A Fast Algorithm for Target Detection in High Spatial Resolution Imagery

  • Kim Kwang-Eun
    • Korean Journal of Remote Sensing
    • /
    • v.22 no.1
    • /
    • pp.41-47
    • /
    • 2006
  • Detection and identification of targets from remotely sensed imagery are of great interest for civilian and military application. This paper presents an algorithm for target detection in high spatial resolution imagery based on the spectral and the dimensional characteristics of the reference target. In this algorithm, the spectral and the dimensional information of the reference target is extracted automatically from the sample image of the reference target. Then in the entire image, the candidate target pixels are extracted based on the spectral characteristics of the reference target. Finally, groups of candidate pixels which form isolated spatial objects of similar size to that of the reference target are extracted as detected targets. The experimental test results showed that even though the algorithm detected spatial objects which has different shape as targets if the spectral and the dimensional characteristics are similar to that of the reference target, it could detect 97.5% of the targets in the image. Using hyperspectral image and utilizing the shape information are expected to increase the performance of the proposed algorithm.

An Efficient Processing of Continuous Range Queries on High-Dimensional Spatial Data (고차원 공간 데이터를 위한 연속 범위 질의의 효율적인 처리)

  • Jang, Su-Min;Yoo, Jae-Soo
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.13 no.6
    • /
    • pp.397-401
    • /
    • 2007
  • Recent applications on continuous queries on moving objects are extended quickly to various parts. These applications need not only 2-dimensional space data but also high-dimensional space data. If we use previous index for overlapped continuous range queries on high-dimensional space data, as the number of continuous range queries on a large number of moving objects becomes larger, their performance degrades significantly. We focus on stationary queries, non-exponential increase of storage cost and efficient processing time for large data sets. In this paper, to solve these problems, we present a novel query indexing method, denoted as PAB(Projected Attribute Bit)-based query index. We transfer information of high-dimensional continuous range query on each axis into one-dimensional bit lists by projecting technique. Also proposed query index supports incremental update for efficient query processing. Through various experiments, we show that our method outperforms the CES(containment-encoded squares)-based indexing method which is one of the most recent research.

Inverse Scattering of Two-Dimensional Objects Using Linear Sampling Method and Adjoint Sensitivity Analysis

  • Eskandari, Ahmadreza;Eskandari, Mohammad Reza
    • Journal of Electrical Engineering and Technology
    • /
    • v.10 no.1
    • /
    • pp.308-313
    • /
    • 2015
  • This paper describes a technique for complete identification of a two-dimensional scattering object and multiple objects immersed in air using microwaves where the scatterers are assumed to be a homogenous dielectric medium. The employed technique consists of initially retrieving the shape and position of the scattering object using a linear sampling method and then determining the electric permittivity and conductivity of the scatterer using adjoint sensitivity analysis. Incident waves are assumed to be TM (Transverse Magnetic) plane waves. This inversion algorithm results in high computational speed and efficiency, and it can be generalized for any scatterer structure. Also, this method is robust with respect to noise. The numerical results clearly show that this hybrid approach provides accurate reconstructions of various objects.

GB-Index: An Indexing Method for High Dimensional Complex Similarity Queries with Relevance Feedback (GB-색인: 고차원 데이타의 복합 유사 질의 및 적합성 피드백을 위한 색인 기법)

  • Cha Guang-Ho
    • Journal of KIISE:Databases
    • /
    • v.32 no.4
    • /
    • pp.362-371
    • /
    • 2005
  • Similarity indexing and searching are well known to be difficult in high-dimensional applications such as multimedia databases. Especially, they become more difficult when multiple features have to be indexed together. In this paper, we propose a novel indexing method called the GB-index that is designed to efficiently handle complex similarity queries as well as relevance feedback in high-dimensional image databases. In order to provide the flexibility in controlling multiple features and query objects, the GB-index treats each dimension independently The efficiency of the GB-index is realized by specialized bitmap indexing that represents all objects in a database as a set of bitmaps. Main contributions of the GB-index are three-fold: (1) It provides a novel way to index high-dimensional data; (2) It efficiently handles complex similarity queries; and (3) Disjunctive queries driven by relevance feedback are efficiently treated. Empirical results demonstrate that the GB-index achieves great speedups over the sequential scan and the VA-file.

CAD-Based 3-D Object Recognition Using Hough Transform (Hough 변환을 이용한 캐드 기반 삼차원 물체 인식)

  • Ja Seong Ku;Sang Uk Lee
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.32B no.9
    • /
    • pp.1171-1180
    • /
    • 1995
  • In this paper, we present a 3-D object recognition system in which the 3-D Hough transform domain is employed to represent the 3-D objects. In object modeling step, the features for recognition are extracted from the CAD models of objects to be recognized. Since the approach is based on the CAD models, the accuracy and flexibility are greatly improved. In matching stage, the sensed image is compared with the stored model, which is assumed to yield a distortion (location and orientation) in the 3-D Hough transform domain. The high dimensional (6-D) parameter space, which defines the distortion, is decomposed into the low dimensional space for an efficient recognition. At first we decompose the distortion parameter into the rotation parameter and the translation parameter, and the rotation parameter is further decomposed into the viewing direction and the rotational angle. Since we use the 3-D Hough transform domain of the input images directly, the sensitivity to the noise and the high computational complexity could be significantly alleviated. The results show that the proposed 3-D object recognition system provides a satisfactory performance on the real range images.

  • PDF

Numerical Analysis of the Three-Dimensional Wake Flow and Acoustic Field around a Circular Cylinder

  • Kim, Tae-Su;Kim, Jae-Soo
    • International Journal of Aeronautical and Space Sciences
    • /
    • v.11 no.4
    • /
    • pp.319-325
    • /
    • 2010
  • For decades, researchers have rigorously studied the characteristics of flow traveling around blunt objects in order to gain greater understanding of the flow around aircraft, vehicles or vessels. Many different types of flow exist, such as boundary layer flow, flow separation, laminar and turbulent flow, vortex and vortex shedding; such types are especially observed around circular cylinders. Vortex shedding around a circular cylinder exhibits a two-dimensional flow structure possessing a Reynolds number within the range of 47 and 180. As the Reynolds number increases, the Karman vortex changes into a three-dimensional flow structure. In this paper, a numerical analysis was performed examining the flow and aero-acoustic field characteristics around a circular cylinder using an optimized high-order compact scheme, which is a high order scheme. The analysis was conducted with a Reynolds number ranging between 300 and 1,000, which belongs to B-mode flow around a circular cylinder. For a B-mode Reynolds number, a proper spanwise length is analyzed in order to obtain the characteristics of three-dimensional flow. The numerical results of the Strouhal number as well as the lift and drag coefficients according to Reynolds numbers are coincident with the other experimental results. Basic research has been conducted studying the effects an unstable three-dimensional wake flow on an aero-acoustic field.