• Title/Summary/Keyword: 랜덤 맵

Search Result 21, Processing Time 0.056 seconds

A Propagation Control Method Using Codes In The Fractal Deformation (코드를 활용한 프랙탈 변형의 전파 제어 방법)

  • Han, Yeong-Deok
    • Journal of Korea Game Society
    • /
    • v.16 no.1
    • /
    • pp.119-128
    • /
    • 2016
  • In this paper, we consider an improved deformation method of IFS(iterated function system) fractal using codes of fractal points. In the existing deformation methods, the intermediate results of position dependent partial deformation propagate randomly due to the randomly selected maps of iteration. Therefore, in many cases, the obtained results become somewhat monotonous feeling shapes. To improve these limitations, we propose a method in which the selection of maps are controlled by codes of fractal points. Applying this method, we can obtain interesting fractal deformation conforming with its fractal features. Also, we propose a simple method, incorporating state variables, that can be applied to deformation of some fractal features other than position coordinates.

A Multibit Tree Bitmap based Packet Classification (멀티 비트 트리 비트맵 기반 패킷 분류)

  • 최병철;이정태
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.3B
    • /
    • pp.339-348
    • /
    • 2004
  • Packet classification is an important factor to support various services such as QoS guarantee and VPN for users in Internet. Packet classification is a searching process for best matching rule on rule tables by employing multi-field such as source address, protocol, and port number as well as destination address in If header. In this paper, we propose hardware based packet classification algorithm by employing tree bitmap of multi-bit trio. We divided prefixes of searching fields and rule into multi-bit stride, and perform a rule searching with multi-bit of fixed size. The proposed scheme can reduce the access times taking for rule search by employing indexing key in a fixed size of upper bits of rule prefixes. We also employ a marker prefixes in order to remove backtracking during searching a rule. In this paper, we generate two dimensional random rule set of source address and destination address using routing tables provided by IPMA Project, and compare its memory usages and performance.

Study on Soil Moisture Predictability using Machine Learning Technique (머신러닝 기법을 활용한 토양수분 예측 가능성 연구)

  • Jo, Bongjun;Choi, Wanmin;Kim, Youngdae;kim, Kisung;Kim, Jonggun
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2020.06a
    • /
    • pp.248-248
    • /
    • 2020
  • 토양수분은 증발산, 유출, 침투 등 물수지 요소들과 밀접한 연관이 있는 주요한 변수 중에 하나이다. 토양수분의 정도는 토양의 특성, 토지이용 형태, 기상 상태 등에 따라 공간적으로 상이하며, 특히 기상 상태에 따라 시간적 변동성을 보이고 있다. 기존 토양수분 측정은 토양시료 채취를 통한 실내 실험 측정과 측정 장비를 통한 현장 조사 방법이 있으나 시간적, 경제적 한계점이 있으며, 원격탐사 기법은 공간적으로 넓은 범위를 포함하지만 시간 해상도가 낮은 단점이 있다. 또한, 모델링을 통한 토양수분 예측 기술은 전문적인 지식이 요구되며, 복잡한 입력자료의 구축이 요구된다. 최근 머신러닝 기법은 수많은 자료 학습을 통해 사용자가 원하는 출력값을 도출하는데 널리 활용되고 있다. 이에 본 연구에서는 토양수분과 연관된 다양한 기상 인자들(강수량, 풍속, 습도 등)을 활용하여 머신러닝기법의 반복학습을 통한 토양수분의 예측 가능성을 분석하고자 한다. 이를 위해 시공간적으로 토양수분 실측 자료가 잘 구축되어 있는 청미천과 설마천 유역을 대상으로 머신러닝 기법을 적용하였다. 두 대상지에서 2008년~2012년 수문자료를 확보하였으며, 기상자료는 기상자료개방포털과 WAMIS를 통해 자료를 확보하였다. 토양수분 자료와 기상자료를 머신러닝 알고리즘을 통해 학습하고 2012년 기상 자료를 바탕으로 토양수분을 예측하였다. 사용되는 머신러닝 기법은 의사결정 나무(Decision Tree), 신경망(Multi Layer Perceptron, MLP), K-최근접 이웃(K-Nearest Neighbors, KNN), 서포트 벡터 머신(Support Vector Machine, SVM), 랜덤 포레스트(Random Forest), 그래디언트 부스팅 (Gradient Boosting)이다. 토양수분과 기상인자 간의 상관관계를 분석하기 위해 히트맵(Heat Map)을 이용하였다. 히트맵 분석 결과 토양수분의 시간적 변동은 다양한 기상 자료 중 강수량과 상대습도가 가장 큰 영향력을 보여주었다. 또한 다양한 기상 인자 기반 머신러닝 기법 적용 결과에서는 두 지역 모두 신경망(MLP) 기법을 제외한 모든 기법이 전반적으로 실측값과 유사한 형태를 보였으며 비교 그래프에서도 실측값과 예측 값이 유사한 추세를 나타냈다. 따라서 상관관계있는 과거 기상자료를 통해 머신러닝 기법 기반 토양수분의 시간적 변동 예측이 가능할 것으로 판단된다.

  • PDF

Depth Map Upsampling via Markov Random Field without Color Boundary Noise Effect (컬러경계 잡음 현상을 제거한 Markov 랜덤 필드 기반 깊이맵 업샘플링)

  • Mun, Ji-Hun;Ho, Yo-Sung
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2014.06a
    • /
    • pp.101-104
    • /
    • 2014
  • 3차원 영상 제작을 위해서는 장면의 색상 영상과 함께 깊이 정보가 필요하다. 일반적으로 깊이를 측정하는 TOF 카메라에 의해 획득된 깊이 영상은 컬러 영상에 비해 매우 작은 해상도의 영상을 갖게 되는 문제가 있다. 따라서 색상 영상과 함께 3차원 영상 제작에 깊이 영상을 사용하기 위해서는 저해상도 깊이 영상의 업샘플링 방법이 필요하다. 특히 컬러 영상에서 사물 간의 경계에 해당하는 부분에서 색상 차이를 인지하지 못하여 깊이 맵을 부적절하게 처리하게 되는 경우가 발생한다. 본 논문에서는 색상 영상에서 경계부분에 해당하는 영역을 이용하여 저해상도 깊이 영상을 업샘플링 하는 방법을 제안한다. 깊이 영상을 업샘플링 할 때 중요하게 다루어야 할 경계 부분을, 고해상도 색상 영상과 저해상도 깊이 영상을 이용하여 찾아낸다. 색상 경계 부분을 고려하여 깊이 영상 업샘플링을 위한 에너지 함수를 MRF를 이용하여 모델링하고, 신뢰 확산(belief propagation)방법을 이용하여 에너지 함수 최적화를 수행한다. 제안한 방법은 기존의 다른 에너지 함수나 필터 기반 업샘플링 방법보다 우수한 성능을 나타내었다.

  • PDF

Analysis for Scalar Mixing Characteristics using Linear Eddy Model (Linear Eddy Model을 이용한 스칼라의 혼합특성 해석)

  • Kim, H.J.;Ryu, L.S.;Kim, Y.M.
    • Journal of ILASS-Korea
    • /
    • v.11 no.1
    • /
    • pp.1-6
    • /
    • 2006
  • The present study is focused on the small scale turbulent mixing processes in the scalar Held. In order to deal with molecular mixing in turbulent flow, the linear eddy model is addressed. In each realization, the molecular mixing term is implemented deterministically, and turbulent stirring is represented by a sequence of instantaneous, statistically independent rearrangement event called by triplet map. The LEM approach is applied with relatively simple conditions. The characteristics of scalar mixing and PDF profiles are addressed in detail.

  • PDF

Wafer bin map failure pattern recognition using hierarchical clustering (계층적 군집분석을 이용한 반도체 웨이퍼의 불량 및 불량 패턴 탐지)

  • Jeong, Joowon;Jung, Yoonsuh
    • The Korean Journal of Applied Statistics
    • /
    • v.35 no.3
    • /
    • pp.407-419
    • /
    • 2022
  • The semiconductor fabrication process is complex and time-consuming. There are sometimes errors in the process, which results in defective die on the wafer bin map (WBM). We can detect the faulty WBM by finding some patterns caused by dies. When one manually seeks the failure on WBM, it takes a long time due to the enormous number of WBMs. We suggest a two-step approach to discover the probable pattern on the WBMs in this paper. The first step is to separate the normal WBMs from the defective WBMs. We adapt a hierarchical clustering for de-noising, which nicely performs this work by wisely tuning the number of minimum points and the cutting height. Once declared as a faulty WBM, then it moves to the next step. In the second step, we classify the patterns among the defective WBMs. For this purpose, we extract features from the WBM. Then machine learning algorithm classifies the pattern. We use a real WBM data set (WM-811K) released by Taiwan semiconductor manufacturing company.

A Video Watermarking Method using Global Masking (전역 마스킹을 이용한 비디오 워터마킹 방법)

  • 문지영;호요성
    • Journal of Broadcast Engineering
    • /
    • v.8 no.3
    • /
    • pp.268-277
    • /
    • 2003
  • In this paper, we propose a new video watermarking method exploiting the human visual system (HVS) to find effective locations. in the video frames which make the watermark robust and imperceptible simultaneously. In particular, we propose a new HVS-optimized weighting map for hiding the watermark by considering HVS in three different aspects : frequency, spatial, and motion masking effects. The global masking map is modeled by combining the frequency masking, the spatial masking, and the motion masking. In this paper, we use a watermark which is generated by the bitwise exclusive-OR operation between a logo image and a random sequence. The amount of watermarks is weighted by a control parameter. Furthermore, we embed the watermark in the uncompressed video sequence for the general watermarking method available to various coding schemes. Simulation results show that the watermark is imperceptible and the proposed method is good for watermark capacity. It is also demonstrated that the proposed method is robust against various attacks, such as MPEG coding, MPEG re-encoding, and frame attacks.

Image Encryption using Shrinking Generator based on CA (CA기반의 수축생성기를 이용한 영상 암호)

  • Choi, Un-Sook;Cho, Sung-Jin;Kim, Han-Doo;Kang, Sung-Won
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.15 no.1
    • /
    • pp.179-184
    • /
    • 2020
  • Cellular automata (CA), which is known as a pseudo random number generator due to its excellent randomness, has various applications. Cho et al. designed a CA-based shrinking generator to generate a long period of nonlinear sequence. In addition, chaotic cat maps have been studied by many researchers as the complex nonlinear dynamics systems with sensitivity in initial conditions and unpredictable characteristics. In this paper, we propose a new image encryption method using nonlinear sequence generated by CA-based shrinking generator with maximum period and 3D chaotic cat map for high security.

Spatial Analyses and Modeling of Landsacpe Dynamics (지표면 변화 탐색 및 예측 시스템을 위한 공간 모형)

  • 정명희;윤의중
    • Spatial Information Research
    • /
    • v.11 no.3
    • /
    • pp.227-240
    • /
    • 2003
  • The primary focus of this study is to provide a general methodology which can be utilized to understand and analyze environmental issues such as long term ecosystem dynamics and land use/cover change by development of 2D dynamic landscape models and model-based simulation. Change processes in land cover and ecosystem function can be understood in terms of the spatial and temporal distribution of land cover resources. In development of a system to understand major processes of change and obtain predictive information, first of all, spatial heterogeneity is to be taken into account because landscape spatial pattern affects on land cover change and interaction between different land cover types. Therefore, the relationship between pattern and processes is to be included in the research. Landscape modeling requires different approach depending on the definition, assumption, and rules employed for mechanism behind the processes such as spatial event process, land degradation, deforestration, desertification, and change in an urban environment. The rule-based models are described in the paper for land cover change by natural fires. Finally, a case study is presented as an example using spatial modeling and simulation to study and synthesize patterns and processes at different scales ranging from fine-scale to global scale.

  • PDF

A Reliable Broadcast Scheme for Wireless Sensor Networks (무선 센서 네트워크를 위한 신뢰적 브로드캐스팅 기법)

  • Choi, Won-Suk;Cho, Sung-Rae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.4B
    • /
    • pp.165-173
    • /
    • 2008
  • In this paper, we propose a new reliable broadcast protocol referred to as timer-based reliable broadcast (TRB) for wireless sensor networks (WSNs). The proposed TRB scheme exploits (1) bitmap based explicit ACK to effectively reduce the unnecessary error control messages and (2) randomized timer for ACK transmission to substantially reduce the possibility of contentions. Although it has been argued that 100% reliability is not necessary in WSNs, there should be messages (such as mission-critical message, task assignment, software updates, etc.) that need to be reliably delivered to the entire sensor field. We propose to use the TRB algorithm for such cases. Performance evaluation shows that the TRB scheme achieves 100 % reliability significantly better than other schemes with expense of slightly increased energy consumption.