• Title/Summary/Keyword: full map

Search Result 209, Processing Time 0.061 seconds

CATEGORICAL PROPERTIES OF INTUITIONISTIC FUZZY TOPOLIGICAL SPACES

  • Lee, Seok-Jong;Lee, Eun-Pyo
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1998.06a
    • /
    • pp.225-230
    • /
    • 1998
  • In this paper, we introduce the concepts of intuitionistic fuzzy points and intuitionistic fuzzy neighborhoods. We investigate properties of continuous, open and closed maps in the intuitionistic fuzzy topological spaces, and show that the category of Chang's fuzzy topological spaces is a bireflective full subcategory of that of intuitionistic fuzzy topogical spaces.

  • PDF

Shadow Modeling using Z-map Algorithm for Process Simulation of OLED Evaporation

  • Lee, Eung-Ki
    • 한국정보디스플레이학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.487-490
    • /
    • 2004
  • In order to simulate OLED evaporation process, modeling of directional distribution of the vaporized organic materials, film thickness distribution profile and pattern-mask shadow effect are required In accordance with many literatures; all of them except shadow effect modeling are studied and developed. In this paper, modeling algorithm of evaporation shadow is presented for process simulation of full-color OLED evaporating system. In OLED evaporating process the offset position of the point cell-source against the substrate rotation axis and the usage of the patterned mask are the principal causes for evaporation shadow. For geometric simulation of shadow using z-map, the film thickness profile, which is condensed on a glass substrate, is converted to the z-map data. In practical evaporation process, the glass substrate is rotated. This physical fact is solved and modeled mathematically for z-map simulation. After simulating the evaporation process, the z-map data can present the shadow-effected film thickness profile. Z-map is an efficient method in that the cross-sectional presentations of the film thickness profile and thickness distribution evaluation are easily and rapidly achieved.

  • PDF

Internal cell skip algorithm for TMC2 occuapncy map compression (TMC2 Occupancy map 압축을 위한 내부 블록 스킵 알고리즘)

  • Park, Juntaek;Lee, Jongseok;Park, Seanae;Sim, Donggyu
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2018.06a
    • /
    • pp.193-194
    • /
    • 2018
  • 본 논문은 Point Cloud 데이터 압축을 위해 사용되는 MPEG PCC TMC2의 Occupancy map coding을 효과적으로 압축하기 위해 내부 블록 스킵 방식을 제안한다. TMC2에서 생성된 patch들을 2차원 그리드에 packing 하여 생성된 occupancy map은 patch 내부의 대부분의 occupancy가 'full'이라는 특징을 갖는다. 따라서 이러한 특징을 이용하여 patch 내부의 occupancy를 간소화 하면 occupancy map을 표현하기 위한 비트를 절약 할 수 있다. 이러한 방법을 통해 본 논문에서는 기존 TMC2의 occupancy map의 비트양 대비 평균 -1.37%의 성능을 얻었다.

  • PDF

Efficient View-dependent Refinement of a Height Map (높이 맵의 효율적인 뷰 의존적 표현)

  • Chung, Yong Ho;Hwam, Won K.;Park, Sang Chul
    • Korean Journal of Computational Design and Engineering
    • /
    • v.19 no.1
    • /
    • pp.61-67
    • /
    • 2014
  • This paper proposes a procedure enabling the extraction of view-dependent triangular approximations from a height map. In general, procedures to approximate a height map use tree hierarchies. These methods, however, have a limitation in terms of accuracy, because they depend on tree hierarchy than terrain features. To overcome the difficult, we apply the simplification method for triangular meshes to a height map. The proposed procedure maintains full decimation procedure to support multiresolution. The maintenance of decimation procedure results in creation of the groups (trees), each of which consists of vertices that can be merged into one vertex (root node). As the groups have tolerance which is determined by some tests, they support the generation of view-dependent arbitrary triangular meshes.

Depth Map Generation Algorithm from Single Defocused Image (흐린 초점의 단일영상에서 깊이맵 생성 알고리즘)

  • Lee, Yong-Hwan;Kim, Youngseop
    • Journal of the Semiconductor & Display Technology
    • /
    • v.15 no.3
    • /
    • pp.67-71
    • /
    • 2016
  • This paper addresses a problem of defocus map recovery from single image. We describe a simple effective approach to estimate the spatial value of defocus blur at the edge location of the image. At first, we perform a re-blurring process using Gaussian function with input image, and calculate a gradient magnitude ratio with blurring amount between input image and re-blurred image. Then we get a full defocus map by propagating the blur amount at the edge location. Experimental result reveals that our method outperforms a reliable estimation of depth map, and shows that our algorithm is robust to noise, inaccurate edge location and interferences of neighboring edges within input image.

Development of five-hole probe nulling method reliable in complex flow field (복잡한 유동장에서도 신뢰성 있는 5공프로브 널링기법의 개발)

  • Kim, Jin-Gwon;Gang, Sin-Hyeong
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.21 no.11
    • /
    • pp.1449-1457
    • /
    • 1997
  • Since a non-nulling method of five-hole probes is valid only when the flow angle is within the calibrated angle range, it can not be used in a complex flow field. Full angle range pressure coefficient maps show that widely used nulling methods do not guarantee correct alignment of the probe with the flow direction in the unknown complex flow field. Zone decision method and features of zone map were studied by investigating the full angle range pressure coefficient maps. A reliable and efficient new nulling algorithm using zone decision by pressure ordering is proposed and verified. Since the zone decision method by pressure ordering can decide whether the flow is within the calibration angle range or not, it is useful in wide angle nonnulling methods, too.

Stereo Matching Based on Edge and Area Information (경계선 및 영역 정보를 이용한 스테레오 정합)

  • 한규필;김용석;하경훈;하영호
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.32B no.12
    • /
    • pp.1591-1602
    • /
    • 1995
  • A hybrid approach which includes edge- and region-based methods is considered. The modified non-linear Laplacian(MNL) filter is used for feature extraction. The matching algorithm has three steps which are edge, signed region, and residual region matching. At first, the edge points are matched using the sign and direction of edges. Then, the disparity is propagated from edge to inside region. A variable window is used to consider the local method which give accurate matched points and area-based method which can obtain full-resolution disparity map. In addition, a new relaxation algorithm for considering matching possibility derived from normalized error and regional continuity constraint is proposed to reduce the mismatched points. By the result of simulation for various images, this algorithm is insensitive to noise and gives full- resolution disparity map.

  • PDF

Localization of a Monocular Camera using a Feature-based Probabilistic Map (특징점 기반 확률 맵을 이용한 단일 카메라의 위치 추정방법)

  • Kim, Hyungjin;Lee, Donghwa;Oh, Taekjun;Myung, Hyun
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.21 no.4
    • /
    • pp.367-371
    • /
    • 2015
  • In this paper, a novel localization method for a monocular camera is proposed by using a feature-based probabilistic map. The localization of a camera is generally estimated from 3D-to-2D correspondences between a 3D map and an image plane through the PnP algorithm. In the computer vision communities, an accurate 3D map is generated by optimization using a large number of image dataset for camera pose estimation. In robotics communities, a camera pose is estimated by probabilistic approaches with lack of feature. Thus, it needs an extra system because the camera system cannot estimate a full state of the robot pose. Therefore, we propose an accurate localization method for a monocular camera using a probabilistic approach in the case of an insufficient image dataset without any extra system. In our system, features from a probabilistic map are projected into an image plane using linear approximation. By minimizing Mahalanobis distance between the projected features from the probabilistic map and extracted features from a query image, the accurate pose of the monocular camera is estimated from an initial pose obtained by the PnP algorithm. The proposed algorithm is demonstrated through simulations in a 3D space.