• Title/Summary/Keyword: 데이터 재배열

Search Result 53, Processing Time 0.026 seconds

Analysis of Position Accuracy of Topography using LiDAR Data (LiDAR 데이터를 이용한 지형지물의 위치정확도 분석)

  • Kim, Yong-Suk;Kim, Seong-Cheol
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.3
    • /
    • pp.270-278
    • /
    • 2008
  • This study : An analysis of position accuracy of topography according to using LiDAR data, aerial photo and digital map for a study area was conducted. The study area was selected in Hadan area, Sahagu, Busan aerial LiDAR data and aerial photo in the scales of 1:20,000, which are high tech surveying ways were used. The final digital orthoimage according to orientation process for each image and image resampling was producted. Using it, a checkpoint was chosen, information about the checkpoints selected was extracted, a coordinate of Horizontal Position through the screen digitizing was also extracted. Both the coordinates of LiDAR data and aerial photo using digital map in the scales of 1:20,000 announced to the public from NGII(National Geographic Information Institute) were gradually compared and analyzed. Based on the digital map, as a result of being both compared and analyzed, it has shown to us that horizontal position of aerial photo is more accurate than that of aerial LiDAR surveying (RMSE-building x:24cm, y:26cm).

PingPong 256 shuffling method with Image Encryption and Resistance to Various Noise (이미지 암호화 및 다양한 잡음에 내성을 갖춘 PingPong 256 Shuffling 방법)

  • Kim, Ki Hwan;Lee, Hoon Jae
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.24 no.11
    • /
    • pp.1507-1518
    • /
    • 2020
  • High-quality images have a lot of information, so sensitive data is stored by encryption for private company, military etc. Encrypted images can only be decrypted with a secret key, but the original data cannot be retained when attacked by the Shear attack and Noise pollution attack techniques that overwrite some pixel data with arbitrary values. Important data is the more necessary a countermeasure for the recovery method against attack. In this paper, we propose a random number generator PingPong256 and a shuffling method that rearranges pixels to resist Shear attack and Noise pollution attack techniques so that image and video encryption can be performed more quickly. Next, the proposed PingPong256 was examined with SP800-22, tested for immunity to various noises, and verified whether the image to which the shuffling method was applied satisfies the Anti-shear attack and the Anti-noise pollution attack.

Dragging Body Parts in 3D Space to Direct Animated Characters (3차원 공간 상의 신체 부위 드래깅을 통한 캐릭터 애니메이션 제어)

  • Lee, Kang Hoon;Choi, Myung Geol
    • Journal of the Korea Computer Graphics Society
    • /
    • v.21 no.2
    • /
    • pp.11-20
    • /
    • 2015
  • We present a new interactive technique for directing the motion sequences of an animated character by dragging its specific body part to a desired location in the three-dimensional virtual environment via a hand motion tracking device. The motion sequences of our character is synthesized by reordering subsequences of captured motion data based on a well-known graph representation. For each new input location, our system samples the space of possible future states by unrolling the graph into a spatial search tree, and retrieves one of the states at which the dragged body part of the character gets closer to the input location. We minimize the difference between each pair of successively retrieved states, so that the user is able to anticipate which states will be found by varying the input location, and resultantly, to quickly reach the desired states. The usefulness of our method is demonstrated through experiments with breakdance, boxing, and basketball motion data.

GAN System Using Noise for Image Generation (이미지 생성을 위해 노이즈를 이용한 GAN 시스템)

  • Bae, Sangjung;Kim, Mingyu;Jung, Hoekyung
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.24 no.6
    • /
    • pp.700-705
    • /
    • 2020
  • Generative adversarial networks are methods of generating images by opposing two neural networks. When generating the image, randomly generated noise is rearranged to generate the image. The image generated by this method is not generated well depending on the noise, and it is difficult to generate a proper image when the number of pixels of the image is small In addition, the speed and size of data accumulation in data classification increases, and there are many difficulties in labeling them. In this paper, to solve this problem, we propose a technique to generate noise based on random noise using real data. Since the proposed system generates an image based on the existing image, it is confirmed that it is possible to generate a more natural image, and if it is used for learning, it shows a higher hit rate than the existing method using the hostile neural network respectively.

Time-Varying Parameter Estimation of Passive Telemetry RF Sensor System Using RLS Algorithm (RLS 알고리즘을 이용한 원격 RF 센서 시스템의 시변 파라메타 추정)

  • Kim, Kyung-Yup;Yu, Dong-Gook;Lee, Joon-Tark
    • Proceedings of the KIEE Conference
    • /
    • 2007.04c
    • /
    • pp.29-33
    • /
    • 2007
  • In this paper, time-varying parameter of passive telemetry RF sensor system is estimated using RLS(Rescursive $\leq$* Square) algorithm. In order to overcome the problems such as power limits and complication that general RF sensor system including IC chip has, the principle of inductive coupling is applied to model sensor system The model parameter is rearranged for applying RLS algorithm based on mathematical model to the derived model using inductive coupling principle. Time variant parameter of rearranged model is estimated using forgetting factor, and in case measured data is contaminated by noise and modelling error, the performance of RLS algorithm characterized by the convergence of squared error sum is verified by simulation.

  • PDF

A Study on the Construction of Stable Clustering by Minimizing the Order Bias (순서 바이어스 최소화에 의한 안정적 클러스터링 구축에 관한 연구)

  • Lee, Gye-Seong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.6
    • /
    • pp.1571-1580
    • /
    • 1999
  • When a hierarchical structure is derived from data set for data mining and machine learning, using a conceptual clustering algorithm, one of the unsupervised learning paradigms, it is not unusual to have a different set of outcomes with respect to the order of processing data objects. To overcome this problem, the first classification process is proceeded to construct an initial partition. The partition is expected to imply the possible range in the number of final classes. We apply center sorting to the data objects in the classes of the partition for new data ordering and build a new partition using ITERATE clustering procedure. We developed an algorithm, REIT that leads to the final partition with stable and best partition score. A number of experiments were performed to show the minimization of order bias effects using the algorithm.

  • PDF

Quantification and Graphical Method for DNA Fingerprinting (유전자검사자료의 통계분석을 위한 수량화 및 그래프 방법)

  • 박미라
    • The Korean Journal of Applied Statistics
    • /
    • v.15 no.1
    • /
    • pp.85-105
    • /
    • 2002
  • To explore the relationships among frequencies for sets of alleles, within or between loci, is one of the first analyses in population genetic study. The general question is whether the frequency of a set of alleles is the same as the product of each of the separate allele frequencies. For two alleles of a single locus, Hardy-Weinberg equilibrium is tested and for an allele from each of two loci, linkage disequilibrium is tested. However, it is more useful if we can quantify and graphically represent this information. In this study, we suggest graphical methods to find associations between alleles. We also analyze the STR data of Korean population as an illustration.

3D Mesh Watermarking Using CEGI (CEGI를 이용한 3D 메쉬 워터마킹)

  • 이석환;김태수;김승진;권기룡;이건일
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.4C
    • /
    • pp.472-484
    • /
    • 2004
  • We proposed 3D mesh watermarking algorithm using CEGI distribution. In the proposed algorithm, we divide a 3D mesh of VRML data into 6 patches using distance measure and embed the same watermark bits into the normal vector direction of meshes that mapped into the cells of each patch that have the large magnitude of complex weight of CEGI. The watermark can be extracted based on the known center point of each patch and order information of cell. In an attacked model by affine transformation, we accomplish the realignment process before the extraction of the watermark. Experiment results exhibited the proposed algorithm is robust by extracting watermark bit for geometrical and topological deformed models.

A stochastic rainfall generation model that accurately reproduces the various statistical properties at the timescales from 5 minutes through decades, making it suitable for complex disaster simulations (5분에서 수십년 사이의 모든 타임스케일에서 강수의 다양한 통계적 특성을 정확히 재현하여 복합재난 모의에 적합한 추계학적 강수생성모형)

  • Dongkyun Kim
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2023.05a
    • /
    • pp.117-117
    • /
    • 2023
  • 도시 홍수, 하천 범람, 산사태와 같은 폭우와 관련된 재해는 자주 동시에 발생하며, 각 재해는 서로 다른 범위의 시간 스케일에서 강우 변동성에 민감하게 반응한다. 따라서 재해 복합화 모델링에 적합한 확률 강우 모델은 모든 유형의 재해와 관련된 모든 시간 스케일에서 강우 변동성을 잘 재현할 수 있어야 한다. 본 연구에서는 5분에서 10년 사이의 시간 스케일에서 다양한 강우통계특성을 재현할 수 있는 추계학적 강우 생성기를 제안하였다. 이 모델은 우선 Randomized Bartlett-Lewis Rectangular Pulse (RBLRP) 모델을 사용하여 미세 규모의 강우량 시계열을 생성한 후, 연속된 폭풍 사이의 상관관계 구조가 유지되도록 폭풍우의 순서를 섞는다. 마지막으로, 별도의 월별 강우량 모델링 결과에 따라 월 단위로 시계열을 재배열한다. 독일 보훔에서 기록된 69년간의 5분 강우량 데이터를 사용하여 본 모형을 검증한 결과, 평균, 분산, 공분산, 왜곡도 및 강우 간헐성은 5분에서 10년에 이르는 시간 스케일에서 체계적인 편향 없이 잘 재현됨은 물론, 5분에서 3일 사이의 시간 스케일에서의 극한 강수량 값도 잘 재현음을 확인하였다. 아울러, 극한 강우 및 산사태에 큰 영향을 주는 극한 강우 발생 전 과거 7일간의 강수량도 정확히 재현되었다.

  • PDF

Design of an Efficient VLSI Architecture of SADCT Based on Systolic Array (시스톨릭 어레이에 기반한 SADCT의 효율적 VLSl 구조설계)

  • Gang, Tae-Jun;Jeong, Ui-Yun;Gwon, Sun-Gyu;Ha, Yeong-Ho
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.38 no.3
    • /
    • pp.282-291
    • /
    • 2001
  • In this paper, an efficient VLSI architecture of Shape Adaptive Discrete Cosine Transform(SADCT) based on systolic array is proposed. Since transform size in SADCT is varied according to the shape of object in each block, it are dropped that both usability of processing elements(PE´s) and throughput rate in time-recursive SADCT structure. To overcome these disadvantages, it is proposed that the architecture based on a systolic way structure which doesn´t need memory. In the proposed architecture, throughput rate is improved by consecutive processing of one-dimensional SADCT without memory and PE´s in the first column are connected to that in the last one for improvement of usability of PE. And input data are put into each column of PE in parallel according to the maximum data number in each rearranged block. The proposed architecture is described by VHDL. Also, its function is evaluated by MentorTM. Even though the hardware complexity is somewhat increased, the throughput rate is improved about twofold.

  • PDF