• Title/Summary/Keyword: tile mapping

Search Result 22, Processing Time 0.027 seconds

Wang Tile Terrain Synthesis and Real-Time Rendering using Parallax Mapping (왕(Wang) 타일 지형 합성과 시차 맵핑을 이용한 실시간 렌더링)

  • Jeong, Jae-Won;Choi, Min-Gyu
    • Journal of Korea Game Society
    • /
    • v.8 no.1
    • /
    • pp.71-77
    • /
    • 2008
  • The geometric structure constructs terrain from height map and non-periodically tiling with Wang tile for the detail description. It will be able to express detail bump using parallax mapping to add decal data together with height data in tile. We solve the problem when the real-time rendering and propose improving of parallax mapping for the terrain.

  • PDF

Design of DNS Services be Based on Voice (음성을 기반으로 하는 DNS 서비스의 설계)

  • 이학구;김평수;김선우;김영근
    • Proceedings of the IEEK Conference
    • /
    • 2002.06a
    • /
    • pp.307-310
    • /
    • 2002
  • This paper is proposed due to the fact that resolving domain name with conventional input method to PDA is not so convenient. The substance of this paper is that a user Pronounces tile character which represents tile domain name and that vocalized character is transferred through the GATEWAY, where DNS service can be received in return. PDA receives, compress and send the voice to the GATEWAY, Then, the GATEWAY uncompress, recognizes the voice, converts to characters, search for the mapping entry After mapping to the mapping entry, the GATEWAY sends the DNS request. Combining two entities makes DNS service based on the human voice possible.

  • PDF

Hardware Implementation of Rasterizer with SIMD Architecture Applicable to Mobile 3D Graphics System (모바일 3차원 그래픽스 시스템에 적용 가능한 SIMD 구조를 갖는 래스터라이저의 하드웨어 구현)

  • Ha, Chang-Soo;Sung, Kwang-Ju;Choi, Byeong-Yoon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2010.05a
    • /
    • pp.313-315
    • /
    • 2010
  • In this paper, we describe research results of developing hardware rasterizer that is applicable to mobile 3D graphics system, designed in SIMD architecture and verified in FPGA. Tile-based scan conversion unit is designed like SIMD architecture running four tiles simultaneously and each tile traverses pixels hierarchical in 3-level so that visiting counts is minimized. As experimental results, $8{\times}8$ is the most efficient size of tile and the last step of tile traversing is performed on $2{\times}2$ sized subtile. The rasterizer supports flat shading and gouraud shading and texture mapper supports affine mapping and perspective corrected mapping. Also, texture mapper supports point sampling mode and bilinear interpolating sampling mode and two types of wrapping modes and various blending modes. The rasterzer operates as 120Mhz on xilinx vertex4 $l{\times}100$ device. To easy verification, texture memory and frame buffer are generated as block rom and block ram.

  • PDF

A New Parameter Estimation Method for a Zipf-like Distribution for Geospatial Data Access

  • Li, Rui;Feng, Wei;Wang, Hao;Wu, Huayi
    • ETRI Journal
    • /
    • v.36 no.1
    • /
    • pp.134-140
    • /
    • 2014
  • Many reports have shown that the access pattern for geospatial tiles follows Zipf's law and that its parameter ${\alpha}$ represents the access characteristics. However, visits to geospatial tiles have temporal and spatial popularities, and the ${\alpha}$-value changes as they change. We construct a mathematical model to simulate the user's access behavior by studying the attributes of frequently visited tile objects to determine parameter estimation algorithms. Because the least squares (LS) method in common use cannot obtain an exact ${\alpha}$-value and does not provide a suitable fit to data for frequently visited tiles, we present a new approach, which uses a moment method of estimation to obtain the value of ${\alpha}$ when ${\alpha}$ is close to 1. When ${\alpha}$ is further away from 1, the method uses the associated cache hit ratio for tile access and uses an LS method based on a critical cache size to estimate the value of ${\alpha}$. The decrease in the estimation error is presented and discussed in the section on experiment results. This new method, which provides a more accurate estimate of ${\alpha}$ than earlier methods, promises more effective prediction of requests for frequently accessed tiles for better caching and load balancing.

Design of The Geographic Information Database Structure for Census Mapping (센서스 지도제작을 위한 지리정보데이타베이스 구조연구)

  • 김설희
    • Spatial Information Research
    • /
    • v.1 no.1
    • /
    • pp.17-28
    • /
    • 1993
  • In order to minimize vectorizing tasks, which require huge reso¬urces and time and to support the census mapping effectively, the geographic information databases structure has been studied. The steps of the new approach are as follows. : Step 1, Scanning the maps of the whole country and storing the image data in raster format. Step 2, Vectorizing the data of specific items for Census operation such as Enume¬ration District, and then linking to attribute data in the text format. Step 3, Designing the database with a Tile and Multi-layer structure to make a continuous map logically. Step 4, Implement Censlls Mapping System(CMS) for efficient mapping and retrieving. As a consequence of this study, the cost, manpower and time effectiveness was proved and it was confirmed to produce lIseful and high-qual ified maps for the Census. In the future, this system wi II be able to provide many organizations and individuals with the various data based on geographical statistical information.

  • PDF

Accurative Continuous Cadastral Mapping by Field Surveying (현지측량에 의한 정밀연속도지적도 작성)

  • Kim, Kam-Lea;Ko, Jeong-Seok;Cho, Won-Woo
    • Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
    • /
    • 2007.04a
    • /
    • pp.21-25
    • /
    • 2007
  • A computerization project was completed in Korea to computerize the paper cadastral maps in sheet and tile format in 2003. There were errors, which had not been found during the computerization project, as a part of efforts to implement the cadastral database. The drawing mismatching one of those errors, which has caused inconvenience to surveyors in providing the survey results in the cadastral survey. This study suggested the plan for the preparation of the accurative continuous cadastral mapping by field surveying eliminating the drawing mismatching, which may cause inconvenience to surveyors during the field surveying.

  • PDF

Image Coding by Block Based Fractal Approximation (블록단위의 프래탈 근사화를 이용한 영상코딩)

  • 정현민;김영규;윤택현;강현철;이병래;박규태
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.31B no.2
    • /
    • pp.45-55
    • /
    • 1994
  • In this paper, a block based image approximation technique using the Self Affine System(SAS) from the fractal theory is suggested. Each block of an image is divided into 4 tiles and 4 affine mapping coefficients are found for each tile. To find the affine mapping cefficients that minimize the error between the affine transformed image block and the reconstructed image block, the matrix euation is solved by setting each partial differential coefficients to aero. And to ensure the convergence of coding block. 4 uniformly partitioned affine transformation is applied. Variable block size technique is employed in order to applynatural image reconstruction property of fractal image coding. Large blocks are used for encoding smooth backgrounds to yield high compression efficiency and texture and edge blocks are divided into smaller blocks to preserve the block detail. Affine mapping coefficinets are found for each block having 16$\times$16, 8$\times$8 or 4$\times$4 size. Each block is classified as shade, texture or edge. Average gray level is transmitted for shade bolcks, and coefficients are found for texture and edge blocks. Coefficients are quantized and only 16 bytes per block are transmitted. Using the proposed algorithm, the computational load increases linearly in proportion to image size. PSNR of 31.58dB is obtained as the result using 512$\times$512, 8 bits per pixel Lena image.

  • PDF

Vegetation Mapping of Hawaiian Coastal Lowland Using Remotely Sensed Data (원격탐사 자료를 이용한 하와이 해안지역 식생 분류)

  • Park, Sun-Yurp
    • Journal of the Korean association of regional geographers
    • /
    • v.12 no.4
    • /
    • pp.496-507
    • /
    • 2006
  • A hybrid approach integrating both high-resolution and hyperspectral data sets was used to map vegetation cover of a coastal lowland area in the Hawaii Volcanoes National Park. Three common grass species (broomsedge, natal redtop, and pili) and other non-grass species, primarily shrubs, were focused in the study. A 3-step, hybrid approach, combining an unsupervised and a supervised classification schemes, was applied to the vegetation mapping. First, the IKONOS 1-m high-resolution data were classified to create a binary image (vegetated vs. non--vegetated) and converted to 20-meter resolution percent cover vegetation data to match AVIRIS data pixels. Second, the minimum noise fraction (MNF) transformation was used to extract a coherent dimensionality from the original AVIRIS data. Since the grasses and shubs were sparsely distributed and most image pixels were intermingled with lava surfaces, the reflectance component of lava was filtered out with a binary fractional cover analysis assuming that tile total reflectance of a pixel was a linear combination of the reflectance spectra of vegetation and the lava surface. Finally, a supervised approach was used to classify the plant species based on tile maximum likelihood algorithm.

  • PDF

A Study on Nonlinear Water-Wave Profile (비선형 해양파의 파형 연구에 관하여)

  • JANG TAEK-SOO;WANG SUNG-HYUNH;KWON SUN-HONG
    • Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
    • /
    • 2004.11a
    • /
    • pp.179-182
    • /
    • 2004
  • This paper deals with a new mathematical formulation of nonlinear wave profile based on Banach fixed point theorem. As application of the formulation and its solution procedure, some numerical solutions was presented in this paper and nonlinear equation was derived. Also we introduce a new operator for iteration and getting solution. A numerical study was accomplished with Stokes' first-order solution and iteration scheme, and then we can know the nonlinear characteristic of Stokes' high-order solution. That is, using only Stokes' first-oder(linear) velocity potential and an initial guess of wave profile, it is possible to realize the corresponding high-oder Stokian wave profile with tile new numerical scheme which is the method of iteration. We proved the mathematical convergence of tile proposed scheme. The nonlinear strategy of iterations has very fast convergence rate, that is, only about 6-10 iterations arc required to obtain a numerically converged solution.

  • PDF

FPGA Implementation of Scan Conversion Unit using SIMD Architecture and Hierarchical Tile-based Traversing Method (계층적 타일기반 탐색기법과 SIMD 구조가 적용된 스캔변환회로의 FPGA 구현)

  • Ha, Chang-Soo;Choi, Byeong-Yoon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.9
    • /
    • pp.2023-2030
    • /
    • 2010
  • In this paper, we present research results of developing high performance scan conversion unit and implementing it on FPGA chip. To increase performance of scan conversion unit, we propose an architecture of scan converter that is a SIMD architecture and uses tile-based traversing method. The proposed scan conversion unit can operate about 124Mhz clock frequency on Xilinx Vertex4 LX100 device. To verify the scan conversion unit, we also develop shader unit, texture mapping unit and $240{\times}320$ color TFT-LCD controller to display outputs of the scan conversion unit on TFT-LCD. Because the scan conversion unit implemented on FPGA has 311Mpixels/sec pixel rate, it is applicable to desktop pc's 3d graphics system as well as mobile 3d graphics system needing high pixel rates.