• Title/Summary/Keyword: 탐색 깊이

Search Result 244, Processing Time 0.039 seconds

GPGPU based Depth Image Enhancement Algorithm (GPGPU 기반의 깊이 영상 화질 개선 기법)

  • Han, Jae-Young;Ko, Jin-Woong;Yoo, Jisang
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.12
    • /
    • pp.2927-2936
    • /
    • 2013
  • In this paper, we propose a noise reduction and hole removal algorithm in order to improve the quality of depth images when they are used for creating 3D contents. In the proposed algorithm, the depth image and the corresponding color image are both used. First, an intensity image is generated by converting the RGB color space into the HSI color space. By estimating the difference of distance and depth between reference and neighbor pixels from the depth image and difference of intensity values from the color image, they are used to remove noise in the proposed algorithm. Then, the proposed hole filling method fills the detected holes with the difference of euclidean distance and intensity values between reference and neighbor pixels from the color image. Finally, we apply a parallel structure of GPGPU to the proposed algorithm to speed-up its processing time for real-time applications. The experimental results show that the proposed algorithm performs better than other conventional algorithms. Especially, the proposed algorithm is more effective in reducing edge blurring effect and removing noise and holes.

A Study on Online Consumers′Price Sensitivity (온라인 시장에서 가격민감도에 영향을 미치는 요인에 관한 연구)

  • 송형철
    • The Journal of the Korea Contents Association
    • /
    • v.2 no.3
    • /
    • pp.59-69
    • /
    • 2002
  • This article purpose are on the variables of consumer's Doe sensitivity. Our result from sets of data indicate that the web site trust, the web site interactivity and the perceived risk have an effect on price search. Our result is as follows. First, the more trust the web site, the lower the price search. Second, the more interactivity of the web site, the lower the price search. Third, the greater the depth of information at the web site, the higher the price search. forth, the higher the perceived risk, the higher the price search. Fifth, the higher the knowledge of product, the higher the price search.

  • PDF

오늘의 삶을 돕는 지금 이곳에서의 책읽기(2)

  • Lee, Jung-Han
    • The Korean Publising Journal, Monthly
    • /
    • s.143
    • /
    • pp.4-5
    • /
    • 1994
  • 신중하며 충분한 논증을 거친 자료적 탐색이 있으며, 왜 그렇게 보고자 했는가에 대한 전자의 관점이 명백히 설명되는 저술들 속에서 위대한 천재들의 창조적 업적을 이해할 수 있다면 이보다 좋은 독서는 달리 없다. 인물전기는 고정된 목록에서 벗어나 보다 의외적인 접근을 보이는 책을 읽는 것이 시야도 넓히고 생각의 깊이도 더해준다.

  • PDF

다카키 겐이치 지음 "전후보상의 논리"

  • Kim, Yeong-Ho
    • The Korean Publising Journal, Monthly
    • /
    • s.174
    • /
    • pp.20-20
    • /
    • 1995
  • 정신대.피폭자문제 등에 깊이 관여해온 국제인권변호사 다카키 겐이치의 "전후보상의 논리"는 전후보상문제에 앞장서 실천한 경험을 토대로 이론적 탐색을 시도하고 있다. 저자는 '전후보상'이란 민사적인 피해회복을 위한 피할 수 없는 역사의 과제임을 언급하고 아시아 각국의 전후보상 요구의 움직임을 생생히 들려주고 있다.

  • PDF

A Study on the K Shortest Paths Algorithm in a Transportation Network (Using Ordered Heap Tree) (교통망 분석에서 K경로탐색 알고리즘에 관한 연구(Ordered Heap Tree 구축방식을 중심으로))

  • Im, Gang-Won;Yang, Seung-Muk;Shin, Seong-Il
    • Journal of Korean Society of Transportation
    • /
    • v.23 no.8 s.86
    • /
    • pp.113-128
    • /
    • 2005
  • We propose a modified version of 'a Lazy Version of Eppstein's k shortest paths Algorithm(LVEA)' which can find the k shortest paths in total time O(m+ n log n+ K log K) in the worst-case. The algorithm we propose, since the Link repeated paths are all eliminated when enumerating k shortest paths, is No link repeated paths algorithm that is suitable in a transportation network.

3D Conversion of Image Regions in Webpages (웹페이지 이미지 영역의 3D 변환)

  • Lim, Chang Min;Kim, Manbae
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2013.06a
    • /
    • pp.366-367
    • /
    • 2013
  • 3D Conversion은 3DTV 및 3D Display에 장착되어 제공되고 있다. 이외에도 다양한 변환 방법이 제안되어 왔다 기존 방법들은 영화나 애니메이션 같은 자연영상을 3D로 변환하는 것에 초점이 맞추어져 있었다. 따라서 자동 3D변환에서는 webpage영상처럼 텍스트, 이미지, 로고 등의 혼재되어 있는 영상을 처리하는데 어려움이 있다. 특히 텍스트는 동일한 깊이맵을 얻지 못하면, 깨짐, 흔들림 등의 문제점이 발생한다. 해결방법으로 webpage에서 image region만을 탐색해서, 3D변환을 하고, 다른 영역은 2D로 처리함으로써 상기 문제점을 극복할 수 있다. 이를 위해 본 논문에서는 변환하려는 영상 영역을 탐색하고 이 탐색된 영상들을 단순하게 픽셀의 수평이동이 아닌, 양선형 보간으로 변환하여 홀채움 문제를 극복할 수 있는 변환방법을 제안한다.

  • PDF

Grouping Algorithms for Efficient Use of Wireless Channel and High-Rate Transmission in Wireless LANs (무선랜 환경에서 자원효율적인 무선채널의 사용과 고속 데이터 전송을 위한 그룹화 알고리즘)

  • Woo, Sung-Je;Lee, Tae-Jin
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2003.05b
    • /
    • pp.1269-1272
    • /
    • 2003
  • 무선랜은 무선으로 근거리 단말들을 연결하는 통신 기술로, 높은 데이터 전송률을 제공할 수 있다. 무선랜은 보통 하나의 AP와 하나 이상의 단탈 기기가 BSS를 구성하는데 AP에서 거리가 멀리 떨어진 단말은 신호의 세기가 약해지므로 고속 데이터 전송률의 보장을 반을 수 없는 단점을 가지고 있다. 본 논문에서는 무선 단말중 일부를 리피터로 이용함으로써 그룹화를 통해 고속 데이터 전송을 가능하게 하는 방법을 제안하고, 시뮬레이션을 통해 무선 단말의 그룹화를 위한 깊이우선탐색 알고리즘과 넓이우선탐색 알고리즘을 비친, 분석하였다. 그 결과 넓이우선탐색 알고리즘이 무선 단말을 위한 그룹화에 보다 효과적인 알고리즘임을 보였다.

  • PDF

A Maximum Likelihood Decoding Scheme Based on Breadth-First Searching for Multi-Input Multi-Output Systems (여러 입력 여러 출력 시스템에 알맞도록 너비를 먼저 탐색하는 가장 비슷함 복호 방식)

  • Kang, Hyun-Gu;Song, Iick-Ho;An, Tae-Hun;Kim, Yun-Hee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.1C
    • /
    • pp.34-42
    • /
    • 2007
  • The sphere decoder (SD) has recently been proposed to perform maximum likelihood (ML) decoding for multi-input multi-output systems. Employing a 'breadth-first' searching algorithm for closet points in a lattice, we propose a novel ML decoding scheme for multi-input multi-output systems. Simulation results show that the proposed scheme has the same bit error rate performance as the conventional ML decoders while allowing significantly lower computational burden than the SD.

IR Signal Analysis and Band Selection for Two-color Seeker (Two-color 탐색기를 위한 적외선 신호 분석 및 대역 선정)

  • 오정수;서동선;최종수
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.1B
    • /
    • pp.112-119
    • /
    • 2000
  • A two-color infrared (IR) seeker employs two detection-bands for efficient target tracking under countermeasures and background noises. This paper describes a study on the detection-band selections for the two-color seeker. To select the detection-bands, we analysis infrared radiation characteristics of a target, a flare, and background noises and then other characteristics closely related with the received power, such as the atmospheric transmission, acquisition range, background noise effect, and signal-to-noises. The analysis shows that the pertinent bands of two-color IR seeker are 3 um~5 um for target detection and 1.5 um~l.7 um for counter-countermeasures. The results of our study will play a significant role in the further study of two-color seekers.

  • PDF

Real-Time Virtual-View Image Synthesis Algorithm Using Kinect Camera (키넥트 카메라를 이용한 실시간 가상 시점 영상 생성 기법)

  • Lee, Gyu-Cheol;Yoo, Jisang
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38C no.5
    • /
    • pp.409-419
    • /
    • 2013
  • Kinect released by Microsoft in November 2010 is a motion sensing camera in xbox360 and gives depth and color images. However, Kinect camera also generates holes and noise around object boundaries in the obtained images because it uses infrared pattern. Also, boundary flickering phenomenon occurs. Therefore, we propose a real-time virtual-view video synthesis algorithm which results in a high-quality virtual view by solving these problems. In the proposed algorithm, holes around the boundary are filled by using the joint bilateral filter. Color image is converted into intensity image and then flickering pixels are searched by analyzing the variation of intensity and depth images. Finally, boundary flickering phenomenon can be reduced by converting values of flickering pixels into the maximum pixel value of a previous depth image and virtual views are generated by applying 3D warping technique. Holes existing on regions that are not part of occlusion region are also filled with a center pixel value of the highest reliability block after the final block reliability is calculated by using a block based gradient searching algorithm with block reliability. The experimental results show that the proposed algorithm generated the virtual view image in real-time.