• Title/Summary/Keyword: 지-맵

Search Result 924, Processing Time 0.026 seconds

Hangul Bitmap Data Compression Embedded in TrueType Font (트루타입 폰트에 내장된 한글 비트맵 데이타의 압축)

  • Han Joo-Hyun;Jeong Geun-Ho;Choi Jae-Young
    • Journal of KIISE:Software and Applications
    • /
    • v.33 no.6
    • /
    • pp.580-587
    • /
    • 2006
  • As PDA, IMT-2000, and e-Book are developed and popular in these days, the number of users who use these products has been increasing. However, available memory size of these machines is still smaller than that of desktop PCs. In these products, TrueType fonts have been increased in demand because the number of users who want to use good quality fonts has increased, and TrueType fonts are of great use in Windows CE products. However, TrueType fonts take a large portion of available device memory, considering the small memory sizes of mobile devices. Therefore, it is required to reduce the size of TrueType fonts. In this paper, two-phase compression techniques are presented for the purpose of reducing the sire of hangul bitmap data embedded in TrueType fonts. In the first step, each character in bitmap is divided into initial consonant, medial vowel, and final consonant, respectively, then the character is recomposed into the composite bitmap. In the second phase, if any two consonants or vowels are determined to be the same, one of them is removed. The TrueType embedded bitmaps in Hangeul Wanseong (pre-composed) and Hangul Johab (pre-combined) are used in compression. By using our compression techniques, the compression rates of embedded bitmap data for TrueType fonts can be reduced around 35% in Wanseong font, and 7% in Johab font. Consequently, the compression rate of total TrueType Wanseong font is about 9.26%.

Development and User Study on Visualization Tools of Origin-Destination Data for Social Problems (Origin-Destination 기반 시각화 도구의 개발 및 사회 문제 해결을 위한 사용자 연구)

  • Changki Kim;Sungjin Hwang;Hansung Kim;Sugie Lee;Jaehyuk Cha;Kwanguk (Kenny) Kim
    • Journal of the Korea Computer Graphics Society
    • /
    • v.30 no.3
    • /
    • pp.9-22
    • /
    • 2024
  • Mobility data is important to understand social phenomena and problem. Previous studies have utilized Origin-Destination (OD) visualization methods to represent human's mobility. However, the effectiveness of visualization tools as a method for understanding social phenomena remains unexplored. Therefore, in this study, we developed a visualization tool called SeoulOD-Vis to facilitate understanding social issues. It included three different modules: map visualization, condition selection, and detailed information presentation. We recruited 28 participants to evaluate the SeoulOD-Vis and compared it with a publicly available visualization tool. The results suggested that the SeoulOD-Vis had higher usability and problem-solving performances. Interview results suggested that it attributed to its 'condition selection' and 'detailed information presentation' modules. Our results will contribute to develop visualization tools to solve social problems using mobility data.

Construction Technology Roadmapping for Port Offshore Wind Farm (항만해상풍력단지 건설기술 로드맵 수립)

  • Kim, Ki-Yoon;Jeong, Suk-Jai;Lee, Suk-Jun
    • Journal of Digital Convergence
    • /
    • v.11 no.2
    • /
    • pp.137-148
    • /
    • 2013
  • This paper aims to presents a systematic procedure for the development of construction technology roadmap, which can consider the offshore wind farm on port. Then the weight among the large/medium/small classified construction technology has identified through the AHP(Analytical Hierarchy Process) approach using FGI(Focus Group Interview) and questionnaire study. Based on the priority for classified construction technology a construction technology roadmap for port offshore wind farm was also developed. The technology roadmap suggests the time frame(20 years, from 2016 to 2036) to complete R&D work for the classified construction technology of port offshore wind farm. Such construction technology roadmap can be utilized as a milestone in setting up the R&D strategy in the green port construction industry.

A Bitmap-based Continuous Block Allocation Scheme for Realtime Retrieval Service (실시간 재생 서비스를 위한 비트맵 방식의 연속 블록 할당 기법)

  • 박기현
    • Journal of Korea Multimedia Society
    • /
    • v.5 no.3
    • /
    • pp.316-322
    • /
    • 2002
  • In this paper we consider continuous block allocation scheme of UNIX file system to support real time retrieval service. The proposed block allocation scheme is designed to place real time data at appropriate disk block location in considering the consume-rate that is given with real time data. To effectively determine the disk block location we analyze the relationship between consume-rate and the two variable factors that are the number of continuous blocks and the cylinder distance of logically consecutive data. In traditional UNIX block allocation scheme it is in fact impossible to find continuous free disk blocks in a specific cylinder location. Thus we propose new bitmap-based free block allocation scheme that enables to determine whether a block in specific cylinder location is free state, or not.

  • PDF

K-Box: Ontology Management System based on Topic Maps (K-Box: 토픽맵 기반의 온톨로지 관리 시스템)

  • 김정민;박철만;정준원;이한준;민경섭;김형주
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.10 no.1
    • /
    • pp.1-13
    • /
    • 2004
  • The Semantic Web introduces the next generation of the Web by establishing a semantic layer of machine-understandable data to enable machines (i.e intelligent agents) retrieve more relevant information and execute automated web services using semantic information. Ontology-related technologies are very important to evolve the World Wide Web of today into the Semantic Web in representation and share of semantic data. In this paper, we proposed and implemented the efficient ontology management system, K-Box, which constructs and manages ontologies using topic maps. We can use K-Box system to construct, store and retrieve ontologies. K-Box system has several components: Topicmap Factory, Topicmap Provider, Topicmap Query Processor, Topicmap Object Wrapper, Topicmap Cache Manager, Topicmap Storage Wrapper.

Relationship between the HVM and Cut-Off Level of Means-End Chain (수단-목적사슬(Means-End)이론의 컷오프(Cut-off) 수준과 가치 맵(Hierarchical Value Map)의 관계 분석)

  • Han, Hag-Chin;Cho, Moon-Sik;Oh, Ju-Seong;Seo, Jung-Mo
    • The Journal of the Korea Contents Association
    • /
    • v.11 no.4
    • /
    • pp.414-427
    • /
    • 2011
  • The Means-end theory has successfully been applied in academics circles and is one of the qualitative methodologies, aiming at classifying into groups based on the specific values that they pursue. The more specific purposes of this study is to identify the relationship between the levels of abstraction and HVM(Hierarchical Value Map) and to identify the statistical changes in frequency activated cell and ladders among A-C-V. And lastly, to suggest the HVM according to the levels of abstraction. The subjects of this study includes the 100 hikers who joined the hiking at least once a year for 2007. The results of analysis show that as the level of abstraction goes up, the HVM itself is depicted more simple and the loss of information is also occurred. Consequently, the decision of levels of abstraction is should be made on the basis of objective validity.

A study on developing information and communications technology roadmap through statistical meta analysis (통계적 메타분석을 응용한 미래기술개발로드맵 도출에 관한 연구)

  • Yoo, Young-Sang;Park, Jeong-Seok;Jeong, Nae-Yang;Park, Chan-Keun;Heo, Tae-Young
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.13 no.4
    • /
    • pp.98-107
    • /
    • 2008
  • As the information and communications market goes more uncertain, foresight activities becomes more important. A number of foresight activities, such as trend analysis, have been used to predict customer needs. However previous studies tend to lack objectivity and systematization. In this study, we suggest a meta analysis methodology which combines both top-down and bottom-up approach in order to systematize the analysis process. Secondly, we applied this approach to ICT market to identify essential future technologies. Based on the result from the meta analysis, we have constructed the future technology roadmap.

  • PDF

Planar Texture Replacement in Spherical Images using Cubemap (큐브맵을 사용한 구면 영상에서의 평면 텍스처 대치)

  • Park, Jeong-Hyeon;Park, Jong-Seung
    • Journal of Korea Game Society
    • /
    • v.17 no.6
    • /
    • pp.153-164
    • /
    • 2017
  • In spherical panoramic images, SURF, a feature description method for planar patterns, does not work correctly due to heavy spherical distortion. Since a plane pattern is distorted in a spherical image, the pattern search and replacement in a spherical panoramic image should be treated differently from the case of the planar image. This paper proposes a planar texture replacement method, which transforms a spherical panoramic image into a cubemap panoramic image, searches a pattern using SURF, replaces a plane pattern, and then converts it into a spherical panoramic image.

An Efficient Scheme for Motion Estimation Using Multi-reference Frames in H.264/AVC (H.264에서 다중참조 프레임을 이용한 효율적인 움직임 예측)

  • Kim Sung-Eun;Han Jong-Ki
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.9C
    • /
    • pp.859-868
    • /
    • 2006
  • H.264에서 다중참조 프레임을 사용한 움직임 예측 방법은 단일 참조프레임을 이용한 움직임 예측보다 더 많은 시간적 중복성을 제거하여 부호화 효율을 높이거나 채널에러에 강인하게 부호화하기 위해 사용된다. 하지만 다중 참조 프레임을 이용하여 움직임 예측을 하는 것은 단일의 참조 프레임을 이용하는 것보다 많은 계산량을 요구하기 때문에 비디오 인코더의 복잡도를 증가시키게 된다. 본 논문에서는 다중참조 프레임을 사용한 움직임 예측을 화질 열화 없이 적은 복잡도로서 가능하게 하는 알고리즘을 제안한다. 움직임 예측 절차의 복잡도를 줄이기 위해, 제안한 알고리즘에서는 연속되는 프레임 사이에 구성된 움직임 벡터맵을 이용하여 움직임벡터를 추정한다. 제안한 방식은 추정된 움직임벡터를 작은 탐색영역에서 보정하는 방식을 적용하기 때문에 기존의 방식들에 비해 적은 복잡도가 요구된다. 제안된 방법으로 추정된 움직임벡터는 각 참조프레임들에 대해 최적의 움직임 벡터를 효과적으로 추적하기 때문에 부호화 된 영상의 화질은 전 탐색영역 움직임 예측 알고리즘을 이용한 결과와 매우 비슷하다. 제안된 방식은 세가지 단계로 구성된다. (a) 연속되는 두 개의 프레임 사이에 벡터맵을 구성한다. (b) 벡터맵에 있는 요소벡터를 이용하여 시간적 움직임 벡터를 구성한다. (c) 마지막으로, 임시 움직임 벡터를 좁은 탐색영역에서 보정한다. 컴퓨터 실험을 통해 제안된 방식의 효율성을 입증하였다. 제안된 방식과 기존의 방식들과의 비교를 위해 H.264 부호화기에서 움직임 예측 모듈에 의해 소비된 CPU 시간을 측정하였다. 컴퓨터 실험을 통해 알 수 있듯이 제안된 방식에 의해 부호화된 영상의 화질은 기존 방식과 을 통해 얻은 영상화질과 거의 같으면서 알고리즘 복잡도는 크게 줄어드는 것을 볼 수 있다.

An Acceleration Method of Face Detection using Forecast Map (예측맵을 이용한 얼굴탐색의 가속화기법)

  • 조경식;구자영
    • Journal of the Korea Society of Computer and Information
    • /
    • v.8 no.2
    • /
    • pp.31-36
    • /
    • 2003
  • This paper proposes an acceleration method of PCA(Principal Component Analysis) based feature detection. The feature detection method makes decision whether the target feature is included in a given image, and if included, calculates the position and extent of the target feature. The position and scale of the target feature or face is not known previously, all the possible locations should be tested for various scales to detect the target. This is a search Problem in huge search space. This Paper proposes a fast face and feature detection method by reducing the search space using the multi-stage prediction map and contour Prediction map. A Proposed method compared to the existing whole search way, and it was able to reduce a computational complexity below 10% by experiment.

  • PDF