• Title/Summary/Keyword: 벡터 맵

Search Result 103, Processing Time 0.024 seconds

Face Detection Based on Distribution Map (분포맵에 기반한 얼굴 영역 검출)

  • Cho Han-Soo
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.1
    • /
    • pp.11-22
    • /
    • 2006
  • Recently face detection has actively been researched due to its wide range of applications, such as personal identification and security systems. In this paper, a new face detection method based on the distribution map is proposed. Face-like regions are first extracted by applying the skin color map with the frequency to a color image and then, possible eye regions are determined by using the pupil color distribution map within the face-like regions. This enables the reduction of space for finding facial features. Eye candidates are detected by means of a template matching method using weighted window, which utilizes the correlation values of the luminance component and chrominance components as feature vectors. Finally, a cost function for mouth detection and location information between the facial features are applied to each pair of the eye candidates for face detection. Experimental results show that the proposed method can achieve a high performance.

  • PDF

Depth Map Generation Based on Motion (움직임 기반의 실시간 자동 깊이맵 생성)

  • Lee, Kwan Wook;Gil, Jong In;Choi, Chang Yeol;Kim, Man Bae
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2010.11a
    • /
    • pp.242-243
    • /
    • 2010
  • 최근 3D 콘텐츠의 관심 증가는 Display 장치, 모바일 기기 등의 하드웨어적인 발전을 가져왔고, 이에 따른 입체 콘텐츠의 필요성이 대두되고 있다. 또한 단순히 영상을 비 실시간으로 처리하여 입체로 변환하는 것 외에, 방송이나 모니터 자체에서의 입체변환에 대한 기술은 3D콘텐츠 산업에서 또 다른 이슈로 부각되고 있다. 본 논문에서는 깊이 필터와 움직임 예측을 이용한 깊이맵 생성 기법을 제안한다. 영상에서 Y 버퍼를 추출하고, 이에 깊이 필터를 적용시킨 후 블록단위 움직임 예측을 적용한다. 이렇게 구해진 움직임 벡터에 노이즈 제거 등을 통하여 물체의 영역을 추출한 후, 최종적으로 깊이맵을 생성한다.

  • PDF

Hybrid Simplification Method of GIS Vector Map Based on Minimum Area Error Evaluation (최소영역오차 평가 기반 GIS 벡터맵 혼합형 단순화 기법)

  • Im, Dae-Yeop;Yang, Liu;Kwon, Seong-Geun;Lee, Suk-Hwan;Kwon, Ki-Ryong
    • Proceedings of the Korea Multimedia Society Conference
    • /
    • 2012.05a
    • /
    • pp.449-450
    • /
    • 2012
  • 오늘날 컴퓨터와 정보통신 기술에 의해 생성된 디지털 맵(map)은 다양한 분야에서 응용 활용되고 있다. 이에 디지털 맵 제작 기술의 발전과 함께 선형 단순화(line simplification) 기법에 대한 연구가 활발하게 진행되고 있다. 이에 본 논문은 라인의 형상을 최대한 보존하기 위하여 최소영역오차(minimum area error, MAE) 구간을 이용한 혼합형 선형 단순화 기법을 제안한다. 기존의 선형 단순화 기법과의 비교 실험을 통하여, 제안하는 기법의 성능이 우수함을 확인하였다.

  • PDF

Color Image Segmentation Using Color-map Index and Hue (칼라맵 인텍스와 Hue 정보를 이용한 칼라 영상 분할)

  • 유창연;곽내정;김영길;안재형
    • Proceedings of the Korea Multimedia Society Conference
    • /
    • 2003.05b
    • /
    • pp.472-475
    • /
    • 2003
  • 본 논문에서는 칼라맵 인덱스와 Hue 정보를 이용하여 반복적 병합을 통해 분할하는 칼라 영상 분할 방법을 제안하였다. 먼저 영상을 벡터 양자화 한 후 양자화 칼라맵 인덱스를 이용해 초기 영역을 설정한다. 초기 영역으로 선택된 영역들은 Hue 정보를 이용하여 영역을 병합하였고 그 후 미소영역을 병합하였다. 이때 반복처리로 인해 수행시간이 많이 소요되는 것을 개선하기 위해 Hue 정보를 이용한 영역 병합 처리에서 두 개의 테이블을 이용하여 속도를 개선하였다. 후처리에서는 과분할된 영역을 제거하기 위해 RGB 칼라 성분의 유클리디언 거리를 이용하여 주변유사 영역에 병합하였다. 제안 방법은 다수의 칼라 영상에 적용하여 좋은 분할 결과와 빠른 처리속도를 보여주었다.

  • PDF

Vector Approximation Bitmap Indexing Method for High Dimensional Multimedia Database (고차원 멀티미디어 데이터 검색을 위한 벡터 근사 비트맵 색인 방법)

  • Hwang, Jee-Ik;Son, Dae-On;Nang, Jong-Ho
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.07b
    • /
    • pp.46-48
    • /
    • 2005
  • 기존의 다차원 색인 기법들이 고차원의 특징 벡터를 갖는 멀티미디어 컨텐츠 검색 분야에서 만족할 만한 성능을 보이지 못하므로, 이를 해결하기 위해 VA-File, LPC-File 등의 벡터 근사 방법이 개발 되었다. 이러한 방법들은 데이터의 접근에 소요되는 시간이 전체 검색시간의 대부분을 차지하는 경우에 효과적으로 사용할 수 있다. 그러나 고차원의 멀티미디어 데이터 검색에서 객체간의 거리 계산 시간은 데이터 접근 시간에 비해 무시할 만큼 작지 않으므로 이 방법들을 그대로 적용하기는 어렵다. 본 논문에서는 객체간의 거리 계산 시간을 줄이기 위한 새로운 색인 기법을 제안하고 실험을 통해 이 방법이 기존의 방법들에 비해 우수한 검색 성능을 가진다는 것을 보인다.

  • PDF

Optical Multi-Normal Vector Based Iridescence BRDF Compression Method (광학적 다중 법선 벡터 기반 훈색(暈色)현상 BRDF 압축 기법)

  • Ryu, Sae-Woon;Lee, Sang-Hwa;Park, Jong-Il
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.37 no.3
    • /
    • pp.184-193
    • /
    • 2010
  • This paper proposes a biological iridescence BRDF(Bidirectional Reflectance Distribution Function) compression and rendering method. In the graphics technology, iridescence sometimes is named structure colors. The main features of these symptoms are shown transform of color and brightness by varying viewpoint. Graphics technology to render this is the BRDF technology. The BRDF methods enable realistic representation of varying view direction, but it requires a lot of computing power because of large data. In this paper, we obtain reflection map from iridescence BRDF, analyze color of reflection map and propose representation method by several colorfully concentric circle. The one concentric circle represents beam width of reflection ray by one normal vector. In this paper, we synthesize rough concentric by using several virtually optical normal vectors. And we obtain spectrum information from concentric circles passing through the center point. The proposed method enables IBR(image based rendering) technique which results is realistic illuminance and spectrum distribution by one texture from reduced BRDF data within spectrum.

Image Compression Using DCT Map FSVQ and Single - side Distribution Huffman Tree (DCT 맵 FSVQ와 단방향 분포 허프만 트리를 이용한 영상 압축)

  • Cho, Seong-Hwan
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.10
    • /
    • pp.2615-2628
    • /
    • 1997
  • In this paper, a new codebook design algorithm is proposed. It uses a DCT map based on two-dimensional discrete cosine of transform (2D DCT) and finite state vector quantizer (FSVQ) when the vector quantizer is designed for image transmission. We make the map by dividing input image according to edge quantity, then by the map, the significant features of training image are extracted by using the 2D DCT. A master codebook of FSVQ is generated by partitioning the training set using binary tree based on tree-structure. The state codebook is constructed from the master codebook, and then the index of input image is searched at not master codebook but state codebook. And, because the coding of index is important part for high speed digital transmission, it converts fixed length codes to variable length codes in terms of entropy coding rule. The huffman coding assigns transmission codes to codes of codebook. This paper proposes single-side growing huffman tree to speed up huffman code generation process of huffman tree. Compared with the pairwise nearest neighbor (PNN) and classified VQ (CVQ) algorithm, about Einstein and Bridge image, the new algorithm shows better picture quality with 2.04 dB and 2.48 dB differences as to PNN, 1.75 dB and 0.99 dB differences as to CVQ respectively.

  • PDF

A study of improve vectorising technique on the internet (인터넷에서의 개선된 벡터라이징 기법에 관한 연구)

  • 김용호;이윤배
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.6 no.2
    • /
    • pp.271-281
    • /
    • 2002
  • Currently, most web designers guarante high quality using bitmap graphics as fixed font size, but that has defects about file size and flexibility. Especially, to provide high quality of banner and advertise characters, after you should use a bitmap edit program, and then we should follow the method we add that program to HTML documents as bitmap data. In this study, as I show a couple of new tags in front of HTML documents, I show methods which can be presented diverse effects. When text information are stored, because we print out a screen with simple control points and outside information, it can be possible for us to express the same quality of Hangul characters like printed documents in a web browser. Regardless of the second class of platform, we can make it possible the character expression with exact character expressions and diverse effects.

Real-Time Image-Based Relighting for Tangible Video Teleconference (실감화상통신을 위한 실시간 재조명 기술)

  • Ryu, Sae-Woon;Parka, Jong-Il
    • Journal of Broadcast Engineering
    • /
    • v.14 no.6
    • /
    • pp.807-810
    • /
    • 2009
  • This paper deals with a real-time image based relighting system for tangible video teleconference. The proposed image based relighting system renders the extracted human object using the virtual environmental images. The proposed system can homogenize virtually the lighting environments of remote users on the video teleconference, or render the humans like they are in the virtual places. To realize the video teleconference, the paper obtains the 3D object models of users in real-time using the controlled lighting system. In this paper, we use single color camera and synchronized two directional flash lights. Proposed system generates pure shading images using on and off flash images subtraction. One pure shading reflectance map generates a directional normal map from multiplication of each reflectance map and basic normal vector map. Each directional basic normal map is generated by inner vector calculation of incident light vector and camera viewing vector. And the basic normal vector means a basis component of real surface normal vector. The proposed system enables the users to immerse video teleconference just as they are in the virtual environments.

Terrain Rendering Using Vertex Cohesion Map (정점 응집맵을 이용한 지형 렌더링)

  • Jo, In-Woo;Lee, Eun-Seok;Shin, Byeong-Seok
    • Journal of Korea Game Society
    • /
    • v.11 no.1
    • /
    • pp.131-138
    • /
    • 2011
  • Recently in terrain rendeing, most researches introduce mipmap-based out-of-core methods for handling large sized DEM data which does not fit in main memory of general computer. However, mipmap-based LOD(level-of-detail) methods occur geometric errors which appear in data simplifying the higher LOD level. These geometric errors cause geometric popping effects where LOD level changes when viewpoint moves. In this paper, we propose vertex cohesion map for reducing geometric error. In preprocessing step, we generate vertex cohesion map, which is a texture that stores the vectors. By these vectors, each vertex will be cohered into the position in which the difference of gradient value is bigger than others. Therefore in terrain rendering, using vertex cohesion map can dramatically reduce the geometry popping effects rather than using mipmap.