• Title/Summary/Keyword: 맵

Search Result 2,513, Processing Time 0.032 seconds

A Study of NormalMap Texture in Game Engine (게임엔진에서의 노말맵 텍스쳐에 대한 연구)

  • Jung, Jong-Pil
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2020.01a
    • /
    • pp.203-205
    • /
    • 2020
  • 본 논문에서는 게임 엔진에서 사용되는 노말맵(Normal Map)의 원리와 그 응용 방식에 대해 연구하였다. 노말맵은 게임에서 하이 폴리곤 모델링에 적용되는 조명 적용 데이터를 로우 폴리곤에 적용할 수 있는 기술로, 하이 폴리곤 모델링의 벡터 방향 데이터를 텍스쳐로 저장하여 로우 폴리곤에 적용해서 벡터 방향을 텍셀단위로 조정할 수 있게 한다. 여기에서는 게임에서의 노말맵 저장 방식과 연산 방식에 대해 소개하고 이를 응용하여 최적화 시킬 수 있는 방법에 대해 연구한다.

  • PDF

옵토메카트로닉스 계측 기술 로드맵(Ⅱ)

  • Korea Optical Industry Association
    • The Optical Journal
    • /
    • s.104
    • /
    • pp.51-51
    • /
    • 2006
  • 본 고는 사단법인 일본기계공업연합회 및 일본옵토메카트로닉스협회에서 2003년도 3월에 발행한“옵토메카트로닉스 로드맵 작성 조사연구보고서(정밀가공 및 계측요소기술)”로서 국내 광학산업 발전에 도움이 되고자 한국광학기기협회에서 일부 자료를 번역한 것이다. 3월호의 정밀가공 기술로드맵에 이어 5월호와 7월호에서는 계측요소기술 로드맵을 2회 나누어 게재한다.

  • PDF

Implementing a Depth Map Generation Algorithm by Convolutional Neural Network (깊이맵 생성 알고리즘의 합성곱 신경망 구현)

  • Lee, Seungsoo;Kim, Hong Jin;Kim, Manbae
    • Journal of Broadcast Engineering
    • /
    • v.23 no.1
    • /
    • pp.3-10
    • /
    • 2018
  • Depth map has been utilized in a varity of fields. Recently research on generating depth map by artificial neural network (ANN) has gained much interest. This paper validates the feasibility of implementing the ready-made depth map generation by convolutional neural network (CNN). First, for a given image, a depth map is generated by the weighted average of a saliency map as well as a motion history image. Then CNN network is trained by test images and depth maps. The objective and subjective experiments are performed on the CNN and showed that the CNN can replace the ready-made depth generation method.

Evolutionary Topic Maps (진화연산을 통해 만들어지는 토픽맵)

  • Kim, Ju-Ho;Hong, Won-Wook;McKay, Robert Ian
    • 한국HCI학회:학술대회논문집
    • /
    • 2009.02a
    • /
    • pp.685-689
    • /
    • 2009
  • Evolutionary Computation is not only widely used in optimization and machine learning, but also being applied in creating novel structures and entities. This paper proposes evolutionary topic maps that can suggest new and creative knowledge not easily producible by humans. Interactive evolutionary computation method is applied into topic maps in order to accept human evaluation on feasibility of intermediate topic maps. Evolutionary topic maps are creativity support tools, helping users to encounter new and creative knowledge. Further work can greatly improve the system by providing more operations, preventing over-convergence, and overcoming user fatigue problem by providing more intuitive user interface, better visualization, and interpolation mechanisms.

  • PDF

Design of the composition state machine based on the chaotic maps (혼돈맵들에 기반한 합성 상태머신의 설계)

  • Seo, Yong-Won;Park, Jin-Soo
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.10 no.12
    • /
    • pp.3688-3693
    • /
    • 2009
  • In this paper the design methode of a separated composition state machine based on the compositive map with connecting two chaotic maps together - sawtooth map $S_2(x)$ and tent map $T_2(x)$ and the result of that is proposed. this paper gives a graph of the chaotic states generated by the composition state machine using the compositive logic of two different chaotic maps - sawtooth map and tent map and also shows that the period of pseudo-random states has the length according to the precision of the discreet truth table.

Visualizing Excercise Prescription Using Visual Path Map (비쥬얼패스맵을 이용한 운동처방 과정 시각화)

  • Ham, Jun-Seok;Jeong, Chan-Soon;Ko, Il-Ju
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.9
    • /
    • pp.1182-1189
    • /
    • 2011
  • We named the system Visual Path Map which visualizes the distribution of clusters according to characteristics and entire process about exercise prescription, and we purpose to visualize a process according to exercise prescription. Visual Path Map visualizes the distribution of clusters according to characteristics, current and object distribution, and changed distribution for prescription. So it visualizes paths from current distribution to object distribution according to prescription. We used SOM in order to express properties along subjects in Visual Path map, and visualized distribution of clusters about physical characteristics, body mass index, and age information of 1,500 ordinary people. Also we visualize practical exercise prescription according to real data of expert of exercise prescription.

Learning Map as Omniscient View for Learning Interaction in Educational Games (교육용 게임의 학습 인터렉션을 위한 전지적 뷰로서 학습맵)

  • Chang, Hee-Dong
    • Journal of Korea Game Society
    • /
    • v.11 no.3
    • /
    • pp.3-8
    • /
    • 2011
  • The learning by computer games, is in the spotlight as an effective education method for the game generation. The educational games need to provide additionally an omniscient view of the learning as an objective viewpoint for storytelling of learning. The omniscient viewpoint needs good readability in real-time, and to provide systematically overall and detailed informations of learning. In this paper, we propose the visual learning map as the omniscient view for storytelling of learning. The proposed learning map is composed of the district map, the topic map, and the progress map for the omniscient view of the learning. The proposed learning map is represented by several visual diagrams for real-time readability. The proposed learning map can apply to all the educational games which provide the game minimaps.

Lossless Compression and Rendering of Multiple Layer Displacement Map (다층 변위 맵의 비손실 압축과 렌더링)

  • Chun, Young-Jae;Kim, Hae-Dong;Cho, Sung-Hyun
    • Journal of Korea Game Society
    • /
    • v.9 no.6
    • /
    • pp.171-178
    • /
    • 2009
  • Multiple layer displacement mapping methods are able to represent more complex and general geometries which cannot be presented by single layer displacement mapping methods, and provide a realistic scene to digital contents such as 3D games and movies with relatively low costs. However, as we use more layers for details, data space is wasted more because lower layers have less displacement data than higher layers. In this paper, we suggest a lossless compression and rendering method of a multiple layer displacement map. Since we compress the map without data loss, the proposed method provides the same quality as the rendering result that uses an original multiple layer displacement map.

  • PDF

Generation of ROI Enhanced High-resolution Depth Maps in Hybrid Camera System (복합형 카메라 시스템에서 관심영역이 향상된 고해상도 깊이맵 생성 방법)

  • Kim, Sung-Yeol;Ho, Yo-Sung
    • Journal of Broadcast Engineering
    • /
    • v.13 no.5
    • /
    • pp.596-601
    • /
    • 2008
  • In this paper, we propose a new scheme to generate region-of-interest (ROI) enhanced depth maps in the hybrid camera system, which is composed of a low-resolution depth camera and a high-resolution stereoscopic camera. The proposed method creates an ROI depth map for the left image by carrying out a three-dimensional (3-D) warping operation onto the depth information obtained from the depth camera. Then, we generate a background depth map for the left image by applying a stereo matching algorithm onto the left and right images captured by the stereoscopic camera. Finally, we merge the ROI map with the background one to create the final depth map. The proposed method provides higher quality depth information on ROI than the previous methods.

Topic maps Matching and Merging Techniques based on Partitioning of Topics (토픽 분할에 의한 토픽맵 매칭 및 통합 기법)

  • Kim, Jung-Min;Chung, Hyun-Sook
    • The KIPS Transactions:PartD
    • /
    • v.14D no.7
    • /
    • pp.819-828
    • /
    • 2007
  • In this paper, we propose a topic maps matching and merging approach based on the syntactic or semantic characteristics and constraints of the topic maps. Previous schema matching approaches have been developed to enhance effectiveness and generality of matching techniques. However they are inefficient because the approaches should transform input ontologies into graphs and take into account all the nodes and edges of the graphs, which ended up requiring a great amount of processing time. Now, standard languages for developing ontologies are RDF/OWL and Topic Maps. In this paper, we propose an enhanced version of matching and merging technique based on topic partitioning, several matching operations and merging conflict detection.