• Title/Summary/Keyword: 다음 MAP

Search Result 538, Processing Time 0.032 seconds

Efficient Adaptive Intra Refresh in MPEG-4 Video (MPEG-4비디오에서의 효율적인 적응 인트라 리프래쉬)

  • 조창호;채병조;오승준;정광수
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2001.10c
    • /
    • pp.790-792
    • /
    • 2001
  • 통신 채널을 이응해서 비디오 데이터를 전송할 경우 데이터에 에러가 삽입되게 된다. 이러한 에러의 영향을 최소화하기 위해서 비디오에서는 여러 가지 에러 강인성 도구들을 제공한다. 하지만 영상에 한번 에러가 발생하게 되면 다음 영상에도 영향을 주게 되므로, 에러가 생긴 부분은 인트라(Intra)코딩을 해주어야 다음 영상에 영향을 주지 않게 된다. MPEG-4는 재 동기 마커와 데이터 분리 같은 에러 내성 도구가 사용되기 때문에 이전에 사용되는 인트라 리트래쉬 방법은 효율성이 떨어진다. 본 논문에서는 이전 방법과 달리 리프래쉬 맵(Refresh Map)을 2개 사용하여 기존에 MPEG-4어서 사용하던 방법보다 0.33 ~0.39 db 정도 화질이 향상되었다.

  • PDF

Adaptive Face Blending for Face Replacement System (얼굴교체 시스템을 위한 적응적 블렌딩 방법)

  • Zhang, Xingjie;Kim, Changseob;Park, Jong-IL
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2018.06a
    • /
    • pp.133-135
    • /
    • 2018
  • 본 논문에서는 포즈에 적응적인 가중치 맵 (weight map)에 기반한, 얼굴 교체시스템을 위한 블렌딩 기법을 제안한다. 우선 얼굴교체를 진행하기 위해 목표얼굴이 들어있는 영상으로부터 실시간으로 얼굴의 기하학적 특징점 (land mark)을 검출한다. 다음 검출된 특징점의 분포에 따라 얼굴영역에 대해 삼각화 (triangulation)를 진행한다. 참조영상에 대해서도 같은 과정을 적용하고 대응되는 영역끼리 워핑 (warping) 변환을 시키면 목표 얼굴과 같은 포즈의 참조얼굴을 얻을 수 있다. 그 다음 두 영상의 피부색 톤을 일치시켜주고 안면교체를 진행한다. 하지만 교체된 영역과 목표 얼굴 사이에 부자연스러운 경계가 발생하게 되는데 블렌딩 기법을 통해 이런 경계를 제거한다. 본 논문에서는 사전에 표준얼굴형태모델을 이용하여 정면 얼굴의 가중치 맵을 생성하고, 표준얼굴형태모델과 목표 얼굴사이 변환관계를 이용하여 포즈에 대응되는 가중치지도를 생성하였다. 이렇게 얻어진 가중치 맵은 일관되게 정해진 가중치 맵에 비해 포즈변화에 적응적으로 대처할 수 있어 보다 자연스러운 얼굴교체 효과를 얻을 수 있다.

  • PDF

The Influence Analysis of Support Working Expenses for Yongdam Dam Area Considering the Resolution of Digital Topographic Map (수치지형도 해상도를 고려한 용담댐 주변지역 지원사업비 영향 분석)

  • Lee, Geun Sang
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.30 no.5D
    • /
    • pp.523-531
    • /
    • 2010
  • A dam is effective in stable supply of water required in daily life and reduced damage from floods, but there are problems as a lot of land or houses are submerged. Therefore many projects have been conducted in order to improve and support daily life environment surrounding a dam. This study has focused on analyzing how to calculate support working expenses for Dam area by using GIS spatial overlay in addition to effects of scale of a topographic map and reached the following conclusion. First, as a result of areal error in submerged area by scale based on a 1/3,000 digital topographic map, it has been found that a 1/5,000 digital topographic map is 9.5 times more accurate than a 1/25,000 digital topographic map in the total of areal error. Second, as a result of areal error in area surrounding a dam, it has been found that a 1/5,000 digital topographic map is 7.4 times more accurate than a 1/25,000 digital topographic map in the total of areal error. Third, as a result of error of support expense for submerged area, it has been found that a 1/5,000 digital topographic is 15.9 times, 14.7 times and 15.9 times more effective than a 1/25,000 digital topographic map in terms of the total error of support expense, standard error and the total support expense error on the entire project costs in submerged area. In addition, as a result of analysis on error of support expense for area surrounding a dam, it has been found that a 1/5,000 digital topographic map was 10.7 times, 9.6 times and 10.6 times more effective, respectively, in the total error of support expense, standard error and the total error of support expense for the entire project costs in area surrounding a dam compared to a 1/25,000 digital topographic map. Lastly, as a result of error of the entire project costs for area surrounding a dam, it has been found that a 1/5,000 digital topographic map was 1.4 times, 1.3 times and 1.4 times more effective, respectively, in the total error of support expense, standard error and the total error of the entire project costs compared to a 1/25,000 digital topographic map, but it was not much different from the result of calculating areal error in submerged area or area surrounding a dam because population item didn't consider areal concept.

Derivation of Building Fire Safety Assessment Factors for Generating 3D Safety Status Map (3D 안전상태지도 제작을 위한 건물 화재안전 평가항목 도출)

  • Youn, Junhee;Kim, Taehoon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.21 no.10
    • /
    • pp.40-47
    • /
    • 2020
  • Various technologies, systems, and legal systems are applied to prevent and quickly respond to fire disaster; nevertheless, the damages to life and property caused by fires are not reduced every year. For managing fire disaster, generating spatial information-based safety status map and procuring suitability of attribute information for each position information are essential. The safety status map is generated by deriving the fire safety status assessment factors, indexing, and locating the surveying results through various methods. In this paper, we deal with derivation of building fire safety assessment factors for 3D safety status map. At first, we survey the foreign and domestic fire assessment model cases and its factors, and analyze the applicability of Korean 3D fire safety status map. Next, assessment factors for fire safety assessment model are derived. Assessment factors are derived and categorized by their information collecting activity; factors that can be accessed through basic building information and factors that can be accessed through field survey. As a derivation result, 14 assessment factors were derived over five categories(Industry Risk, Structural Risk, Fire Fighting Facility, Fire Dangerousness, Fire Response Status).

Study on Forest Functions Classification using GIS - Chunyang National Forest Management Planning - (GIS를 이용한 산림기능구분에 관한 연구 - 춘양 국유림 산림경영계획구를 대상으로 -)

  • Kwon, Soon-Duk;Park, Young-Kyu;Kim, Eun-Hee
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.11 no.4
    • /
    • pp.10-21
    • /
    • 2008
  • A forest functions classification map is an essential element for the management planning of national forests. This study was intended to make out the map at the stand level by utilizing the Forest Functions Evaluation Program(FFEP), developed by Korea Forest Research Institute. In this program, the potential of each function was evaluated in each grid cell, and then a forest functions estimation map was generated based on the optimum grid cell values in each sub-compartment unit. Finally, the program produced a forest functions classification map with consideration of the priority of the functions. The final forest functions classification map required for the national forest management planning made out overlapping those results which the rest of the forest classified referring priority functions classification map to national forest manager and classified according to the local administrative guidance and sustainable forest resources management guidance. The results indicated that the forest function classification using the FFEP program could be an efficient tool for providing the data required for national forest management planning. Also this study made a meaningful progress in the forest function classification by considering the local forest administrative guidance and sustainable forest resources management guidance.

  • PDF

Construction of Record Retrieval System based on Topic Map (토픽맵 기반의 기록정보 검색시스템 구축에 관한 연구)

  • Kwon, Chang-Ho
    • The Korean Journal of Archival Studies
    • /
    • no.19
    • /
    • pp.57-102
    • /
    • 2009
  • Recently, distribution of record via web and coefficient of utilization are increase. so, Archival information service using website becomes essential part of record center. The main point of archival information service by website is making record information retrieval easy. It has need of matching user's request and representation of record resources correctly to making archival information retrieval easy. Archivist and record manager have used various information representation tools from taxonomy to recent thesaurus, still, the accuracy of information retrieval has not solved. This study constructed record retrieval system based on Topic Map by modeling record resources which focusing on description metadata of the records to improve this problem. The target user of the system is general web users and its range is limited to the president related sources in the National Archives Portal Service. The procedure is as follows; 1) Design an ontology model for archival information service based on topic map which focusing on description metadata of the records. 2) Buildpractical record retrieval system with topic map that received information source list, which extracted from the National Archives Portal Service, by editor. 3) Check and assess features of record retrieval system based on topic map through user interface. Through the practice, relevance navigation to other record sources by semantic inference of description metadata is confirmed. And also, records could be built up as knowledge with result of scattered archival sources.

Vector Data Hashing Using Line Curve Curvature (라인 곡선 곡률 기반의 벡터 데이터 해싱)

  • Lee, Suk-Hwan;Kwon, Ki-Ryong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.2C
    • /
    • pp.65-77
    • /
    • 2011
  • With the rapid expansion of application fields of vector data model such as CAD design drawing and GIS digital map, the security technique for vector data model has been issued. This paper presents the vector data hashing for the authentication and copy protection of vector data model. The proposed hashing groups polylines in main layers of a vector data model and generates the group coefficients by the line curve curvatures of the first and second type of all poly lines. Then we calculate the feature coefficients by projecting the group coefficients onto the random pattern and generate finally the binary hash from the binarization of the feature coefficients. From experimental results using a number of CAD drawings and GIS digital maps, we verified that the proposed hashing has the robustness against various attacks and the uniqueness and security by the random key.

A Multiresolution Stereo Matching Based on Genetic Algorithm using Edge Information (에지 정보를 이용한 유전 알고리즘 기반의 다해상도 스테레오 정합)

  • Hong, Seok-Keun;Cho, Seok-Je
    • The KIPS Transactions:PartB
    • /
    • v.17B no.1
    • /
    • pp.63-68
    • /
    • 2010
  • In this paper, we propose a multiresolution stereo matching method based on genetic algorithm using edge information. The proposed approach considers the matching environment as an optimization problem and finds the solution by using a genetic algorithm. A cost function composes of certain constraints which are commonly used in stereo matching. We defines the structure of chromosomes using edge pixel information of reference image of stereo pair. To increase the efficiency of process, we apply image pyramid method to stereo matching and calculate the initial disparity map at the coarsest resolution. Then initial disparity map is propagated to the next finer resolution, interpolated and performed disparity refinement. We valid our approach not only reduce the search time for correspondence but alse ensure the validity of matching.

Fully Automatic Liver Segmentation Based on the Morphological Property of a CT Image (CT 영상의 모포러지컬 특성에 기반한 완전 자동 간 분할)

  • 서경식;박종안;박승진
    • Progress in Medical Physics
    • /
    • v.15 no.2
    • /
    • pp.70-76
    • /
    • 2004
  • The most important work for early detection of liver cancer and decision of its characteristic and location is good segmentation of a liver region from other abdominal organs. This paper proposes a fully automatic liver segmentation algorithm based on the abdominal morphology characteristic as an easy and efficient method. Multi-modal threshold as pre-processing is peformed and a spine is segmented for finding morphological coordinates of an abdomen. Then the liver region is extracted using C-class maximum a posteriori (MAP) decision and morphological filtering. In order to estimate results of the automatic segmented liver region, area error rate (AER) and correlation coefficients of rotational binary region projection matching (RBRPM) are utilized. Experimental results showed automatic liver segmentation obtained by the proposed algorithm provided strong similarity to manual liver segmentation.

  • PDF

High Speed Self-Adaptive Algorithms for Implementation in a 3-D Vision Sensor (3-D 비젼센서를 위한 고속 자동선택 알고리즘)

  • Miche, Pierre;Bensrhair, Abdelaziz;Lee, Sang-Goog
    • Journal of Sensor Science and Technology
    • /
    • v.6 no.2
    • /
    • pp.123-130
    • /
    • 1997
  • In this paper, we present an original stereo vision system which comprises two process: 1. An image segmentation algorithm based on new concept called declivity and using automatic thresholds. 2. A new stereo matching algorithm based on an optimal path search. This path is obtained by dynamic programming method which uses the threshold values calculated during the segmentation process. At present, a complete depth map of indoor scene only needs about 3 s on a Sun workstation IPX, and this time will be reduced to a few tenth of second on a specialised architecture based on several DSPs which is currently under consideration.

  • PDF