• Title/Summary/Keyword: Range processing

Search Result 2,762, Processing Time 0.058 seconds

Reconstruction of HDR Environment Map using a Single LDR Environment Map (단일 LDR 환경 맵을 이용한 HDR 환경 맵 복원)

  • Yoo, Jae-Doug;Cho, Ji-Ho;Lee, Kwan H.
    • Annual Conference of KIPS
    • /
    • 2010.04a
    • /
    • pp.550-553
    • /
    • 2010
  • 최근 영화, 광고 그리고 증강현실과 혼합현실 등 다양한 분야에서 실제 영상에 가상의 객체를 합성하는 기법이 자주 사용되고 있다. 보다 사실적인 합성 결과를 생성하기 위해서는 실제 배경영상의 광원정보를 그대로 적용해야 한다. 이러한 실 세계의 광원 정보를 이용하기 위해서는 HDR(High Dynamic Range) 영상을 생성해야 한다. 일반적으로 HDR 영상을 생성하기 위해서는 고가의 HDR 카메라를 사용하거나 LDR(Low Dynamic Range) 카메라를 사용하여 노출 시간을 달리한 일련의 LDR 영상을 촬영하여 이를 기반으로 HDR 영상을 생성해야 한다. 본 논문에서는 이러한 단점을 보완하기 위해 한 장의 LDR 환경 맵을 HDR 환경 맵으로 복원하는 방법에 대해 제안한다. 제안하는 방법을 통해 LDR 환경 맵을 HDR 환경 맵으로 복원할 수 있으며 결과에서 볼 수 있듯이 HDR 영상을 이용했을 때와 유사한 렌더링 결과를 생성할 수 있다.

A Study on Multilevel Coverage Placement Scheme based on Dynamic Sensing Range in Wireless Sensor Network (무선 센서 네트워크에서 유동 센싱 범위 기반 멀티레벨 커버리지 배치 기법에 대한 연구)

  • Oh, Sang-Seok;Han, Youn Hee;Min, Sung-Gi
    • Annual Conference of KIPS
    • /
    • 2011.11a
    • /
    • pp.485-488
    • /
    • 2011
  • 무선 센서 네트워크에는 한정된 배터리 자원과 네트워크의 라이프타임(lifetime)으로 인해 멀티레벨 커버리지 문제가 이슈가 되어 왔다. 하지만, 대부분의 연구에서는 멀티레벨 커버리지 문제를 해결할 때 센싱 범위는 고정적이며 변경할 수 없음을 가정하고 있으며, 이로 인해 센싱 범위와 커버리지 범위와의 관계에 대해서 고려하고 않고 있다. 본 연구에서는 센싱 범위와 커버리지 범위와의 관계를 이용하여 유동 센싱 범위(DSR, Dynamic Sensing Range) 배치에 대하여 연구하였다.

Development of Range of Motion Visualization System using 3D Avatar (3차원 아바타를 이용한 관절 가동 범위 시각화 시스템 개발)

  • Yoon, Chang-Rak;Chang, Yoon-Seop;Kim, Jae-Chul
    • Annual Conference of KIPS
    • /
    • 2022.11a
    • /
    • pp.303-304
    • /
    • 2022
  • 근골격계 질환 재활환자들의 신체 능력을 평가하기 위한 주요 측정 도구로 관절 가동 범위(ROM: Range of Motion)가 사용된다. 본 논문에서는 근골격계 환자들의 재활운동을 통한 관절 가동 범위 정보를 시각적 이해하기 용이하도록 서비스하기 위하여 3차원 아바타를 이용한 관절 가동 범위 시각화 시스템을 제안한다. 제안하는 3차원 아바타를 이용한 관절 가동 범위 시각화 시스템은 근골격계 질환 재활환자들의 관절 가동 범위 데이터를 3차원 아바타의 대응하는 관절 작동 범위로 사상하고 다양한 시점으로 시각화하거나 애니메이션으로 재현함으로써 재활 수준의 변화를 직관적으로 제공할 수 있다.

Wireless Data Transmission Algorithm Using Cyclic Redundancy Check and High Frequency of Audible Range (가청 주파수 영역의 고주파와 순환 중복 검사를 이용한 무선 데이터 전송 알고리즘)

  • Chung, Myoungbeom
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.4 no.9
    • /
    • pp.321-326
    • /
    • 2015
  • In this paper, we proposed an algorithm which could transmit reliable data between smart devices by using inaudible high frequency of audible frequency range and cyclic redundancy check method. The proposed method uses 18 kHz~22 kHz as high frequency which inner speaker of smart device can make a sound in audible frequency range (20 Hz~22 kHz). To increase transmission quantity of data, we send mixed various frequencies at high frequency range 1 (18.0 kHz~21.2 kHz). At the same time, to increase accuracy of transmission data, we send some mixed frequencies at high frequency range 2 (21.2 kHz~22.0 kHz) as checksum. We did experiments about data transmission between smart devices by using the proposed method to confirm data transmission speed and accuracy of the proposed method. From the experiments, we showed that the proposed method could transmit 32 bits data in 235 ms, the transmission success rate was 99.47%, and error detection by using cyclic redundancy check was 0.53%. Therefore, the proposed method will be a useful for wireless transmission technology between smart devices.

The Policy of Minimizing Spatio-Temporal Overlaps on the TB-tree for Trajectories Index (과거 궤적 색인을 위한 TB-트리의 시공간 중첩 최소화 정책)

  • Cho, Dae-Soo;Lim, Duk-Sung;Hong, Bong-Hee
    • Journal of Korea Spatial Information System Society
    • /
    • v.7 no.1 s.13
    • /
    • pp.13-24
    • /
    • 2005
  • Objects, which change their positions over time such as cars, are called moving objects. Trajectories of a moving object have large volumes because trajectories are accumulated. Efficient indexing techniques for searching these large volumes of trajectories are needed in the moving object databases. Especially the TB-tree which supports bundling trajectories is suitable for processing combined queries which have 2 steps: first step is selecting trajectories (range search), next is selecting the parts of each trajectory (trajectory search). But the TB-tree has unnecessary disk accesses cause of lack of spatial discrimination in range queries. In this paper, we propose and implement the splitting polity which can reduce dead spaces of non-leaf node in order to process range queries efficiently. The policy has better performance about range queries than the TB-tree as well as the advantages of the TB-tree, such as highly space utilization and efficient trajectory extraction. This paper shows that the newly proposed split policy has better performance in processing the range queries than that of the TB-tree by experimental evaluation.

  • PDF

Extension of Measurement Range of Gyro Sensor Data (누적형 자이로 센서 데이터의 최대측정영역 확장 방법)

  • Oh, Shi-Hwan;Kim, Jin-Hee
    • Aerospace Engineering and Technology
    • /
    • v.11 no.2
    • /
    • pp.39-48
    • /
    • 2012
  • In case a measurement output of gyro sensor is an accumulated angle counts, it is usually provided as a binary bit counter which is allowed to roll-over at its maximum or minimum value. And it is a well known fact that the roll-over behavior restricts the measurement range of the processed sensor output below the actual measurable range of sensor hardware itself. In this study, a conventional sensor data processing method for a gyro with an accumulated angle output is introduced. And also, an improved method which can extend the processed output range over the conventional one is proposed. It is also derived that the increased range depends on the variation speed of a input signal. Finally, the derived equations and the performance of the proposed algorithm are verified using a computer simulation.

Range Query Processing using Space and Time Filtering in Fixed Grid Indexing (고정 그리드 인덱싱에서 공간과 시간 필터링을 이용한 범위 질의 처리)

  • Jeon, Se-Gil;Nah, Yun-Mook
    • The KIPS Transactions:PartD
    • /
    • v.11D no.4
    • /
    • pp.835-844
    • /
    • 2004
  • Recently, the location-based service for moving customers is becoming one of the most important service in mobile communication area. For moving object applications, there are lots of update operations and such update loads are concentrated on some particular area unevenly. Range queries, whose range can be window or circular, are the most essential query types in LBS. We need to distinguish completely contained cells from partially contained cells in those range queries. Also, it is necessary to consider temporal dimension to filter out qualifying objects correctly. In this paper, we adopt two-level index structures with fixed grid file structures in the second level, which are designed to minimize update operations. We propose a spatial ceil filtering method using VP filtering and a combined spatio-temporal filtering method using time gone concepts. Some experimental results are shown for various window queries and circular queries with different filtering combinations to show the performance tradeoffs of the proposed methods.

A Constrast Conatrol Method for Real-Time Processing (실시간 처리를 위한 콘트라스트 조정 기법)

  • Jo, Hwa-Hyeon;Choe, Cheol-Ho;Gwon, Byeong-Heon;Choe, Myeong-Ryeol
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.6
    • /
    • pp.1988-1995
    • /
    • 2000
  • In this paper, we have proposed the contrast control method for improving image quality. The proposed method can be easily applied to the FPD (flat panel display) which requires real-time processing because of its lower hardware complexity that the conventional methods. In addition, it can flexibly control the contrast of input image by arraying the weight values that control the contrast range. Visual test and standard deviation of their histograms have been introduced to evaluate the results of proposed method and the original images. The functional operation of he proposed method has been verified using the SYNOPSYS VHDL tool and computer simulation. Its results show that he proposed method might be very suitable for real-time processing on the FPD.

  • PDF

A Study on Life Estimate of Insulation Cable for Image Processing of Electrical Tree (전기트리의 영상처리를 이용한 절연케이블의 수명예측에 관한 연구)

  • 정기봉;김형균;김창석;최창주;오무송;김태성
    • Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
    • /
    • 2001.07a
    • /
    • pp.319-322
    • /
    • 2001
  • The proposed system was composed of pre-processor which was executing binary/high-pass filtering and post-processor which ranged from statistic data to prediction. In post-processor work, step one was filter process of image, step two was image recognition, and step three was destruction degree/time prediction. After these processing, we could predict image of the last destruction timestamp. This research was produced variation value according to growth of tree pattern. This result showed improved correction, when this research was applied image Processing. Pre-processing step of original image had good result binary work after high pass- filter execution. In the case of using partial discharge of the image, our research could predict the last destruction timestamp. By means of experimental data, this Prediction system was acquired ${\pm}$3.2% error range.

  • PDF

Realization for Image Distortion Correction Processing System with Fisheye Lens Camera

  • Kim, Ja-Hwan;Ryu, Kwang-Ryol;Sclabassi, Robert J.
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.10a
    • /
    • pp.281-284
    • /
    • 2007
  • A realization for image distortion correction processing system with DSP processor is presented in this paper. The image distortion correcting algorithm is realized by DSP processor for focusing on more real time processing than image quality. The lens and camera distortion coefficients are processed by YCbCr Lookup Tables and the correcting algorithm is applied to reverse mapping method for geometrical transform. The system experimentation results in the processing time about 34.6 msec on $720{\times}480$ curved image at 150 degree visual range.

  • PDF