• 한국공작기계학회:학술대회논문집
• /
• 한국공작기계학회 1999년도 추계학술대회 논문집 - 한국공작기계학회
• /
• pp.99-104
• /
• 1999

This paper proposes an efficient method constructing a local map using the data of a scanning laser range finder. A laser range finder yields distance data of polar form, that is, distance data corresponding to every scanning directions. So, the data consists of directional angle and distance. We propose a new method to find a line fitting with a set of such data. The method uses Log-Hough Transformation. Usually, map building from these data requires some transformations between different coordinate systems. The new method alleviates such complication. Also, the method simplifies computation for line recognition and eliminates the slope quantization problems inherent in the classical Cartesian Hough transform method. To show the efficiency of the proposed method, it is applied to find a local map using the data from a laser range finder PLS(Proximity Laser Scanner, made by SICK).

• 한국마린엔지니어링학회:학술대회논문집
• /
• 한국마린엔지니어링학회 2005년도 후기학술대회논문집
• /
• pp.148-149
• /
• 2005

In this study, among the precision decline main causes of sounding, I suggested the characteristics of sounding data acquired by echo sounder with increasing of turbidity For this, I acquired sounding data by inputting turbidity inducer artificially in artificial water tank. And then achieved regression analysis. Conclusion are as following : Sounding Capabilities can be divided into three ranges according to the turbidity : normal range, critical range and the range where data can not be obtained by an echo sounder

• 정보저장시스템학회논문집
• /
• 제7권1호
• /
• pp.31-35
• /
• 2011

In microholographic data storage system (MDSS), compact recording is required to achieve high capacity.[1] When the data is recorded, neighbor monomer is also affected by reaction at the focal point.[2,3] This unintended process caused more monomer consumption and degradation of total capacity. To avoid this extra consumption of dynamic range, it is required to define the effective dynamic range for MDSS. In this paper, we experimentally investigate the relation between dynamic range consumption and micro grating formation. Dynamic range consumption was monitored by real time read-out system. Micrograting was recorded with different consumption ratio and compared by diffraction efficiency of track direction. Finally, we define suitable dynamic range for MDSS.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2004년도 Proceedings of ISRS 2004
• /
• pp.646-649
• /
• 2004

LiDAR(Light Detection and Ranging) system can record intensity data as well as range data. Recently, LiDAR intensity data is widely used for landcover classification, ancillary data of feature extraction, vegetation species identification, and so on. Since the intensity return value is associated with several factors, same features is not consistent for same flight or multiple flights. This paper investigated correlation between intensity and range data. Once the effects of range was determined, the single flight line normalization and the multiple flight line normalization was performed by an empirical function that was derived from relationship between range and return intensity

• 보건행정학회지
• /
• 제26권1호
• /
• pp.71-78
• /
• 2016

The value of using health insurance claim database is continuously rising in healthcare research. In studies where comorbidities act as a confounder, comorbidity adjustment holds importance. Yet researchers are faced with a myriad of options without sufficient information on how to appropriately adjust comorbidity. The purpose of this study is to assist in selecting an appropriate index, look back period, and data range for comorbidity adjustment. No consensus has been formed regarding the appropriate index, look back period and data range in comorbidity adjustment. This study recommends the Charlson comorbidity index be selected when predicting the outcome such as mortality, and the Elixhauser's comorbidity measures be selected when analyzing the relations between various comorbidities and outcomes. A longer look back period and inclusion of all diagnoses of both inpatient and outpatient data led to increased prevalence of comorbidities, but contributed little to model performance. Limited data range, such as the inclusion of primary diagnoses only, may complement limitations of the health insurance claim database, but could miss important comorbidities. This study suggests that all diagnoses of both inpatients and outpatients data, excluding rule-out diagnosis, be observed for at least 1 year look back period prior to the index date. The comorbidity index, look back period, and data range must be considered for comorbidity adjustment. To provide better guidance to researchers, follow-up studies should be conducted using the three factors based on specific diseases and surgeries.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2005년도 Proceedings of ISRS 2005
• /
• pp.79-82
• /
• 2005

Recently the necessity of road data is still being increased in industrial society, so there are many repairing and new constructions of roads at many areas. According to the development of government, city and region, the update and acquisition of road data for GIS (Geographical Information System) is very necessary. In this study, the fusion method with range data(3D Ground Coordinate System Data) and Intensity data in stand alone LiDAR data is used for road extraction and then digital image processing method is applicable. Up to date Intensity data of LiDAR is being studied. This study shows the possibility method for road extraction using Intensity data. Intensity and Range data are acquired at the same time. Therefore LiDAR does not have problems of multi-sensor data fusion method. Also the advantage of intensity data is already geocoded, same scale of real world and can make ortho-photo. Lastly, analysis of quantitative and quality is showed with extracted road image which compare with I: 1,000 digital map.

• 한국정보과학회논문지:시스템및이론
• /
• 제31권3_4호
• /
• pp.145-151
• /
• 2004

본 논문에서는 배열에서 구간 최소값 위치를 상수 시간에 찾기 위한 효율적인 자료구조를 제시한다. 최근의 생물 정보학 분야에서 빠른 DNA 서열의 검색을 위해 접미사 배열이 많이 사용되고 있는데 이 접미사 배열을 생성하는 문제는 구간 최소값 위치 문제를 포함하고 있다. 이 접미사 배열을 생성할 때는 구간 최소값 위치 문제를 빠르게 푸는 것뿐만 아니라 공간 효율적으로 해결하는 것도 중요하다. 그 이유는 DNA 서열이 수백만 개에서 수십 억 개의 염기를 가진 굉장히 큰 데이타이기 때문이다. 배열의 구간 최소간 위치를 상수 시간에 찾기 위해 지금까지 알려진 가장 효율적인 자료구조는 배열의 구간 최소값 문제를 Cartesian 트리에서의 LCA(Lowest Common Ancestor) 문제로 바꾸고 이 트리에서의 LCA 문제를 다시 특수한 배열에서의 구간 최소값 문제로 바꾸어 푸는 방법을 이용한 자료구조이다. 이 자료구조는 이론적으로 O(n) 공간을 사용하여 O(n) 시간에 생성된다. 하지만 이 자료구조는 배열의 구간 최소값 문제를 두 번에 걸쳐 다른 문제로 변환하는 과정을 포함하고 있기 때문에 실제로 사용되는 공간은 상당히 큰 13n이며 또한 많은 시간이 요구된다. 본 논문에서 제시하는 자료구조는 배열의 구간 최소값 문제를 다른 문제로 변환하지 않고 직접 구하는 자료구조이다. 따라서 이론적으로 O(n) 공간을 차지하며 O(n) 시간에 생성될 뿐만 아니라 실제적으로도 5n의 적은 공간을 사용하며 빠른 시간에 생성된다.

• 전기학회논문지
• /
• 제61권4호
• /
• pp.632-638
• /
• 2012

ZigBee network, based on PHY, MAC layer provides a specification for a suite of high level communication protocols using small, low-power digital radio based on an IEEE 802.15.4 standard. Meshing is a type of daisy chaining from one device to another. This technique allows the short range of an individual node to be expanded and multiplied, covering a much larger area. Each wireless technology that makes it to market serves a special purpose or function. Zigbee provides short-range connectivity in what is called a personal-area network (PAN). Within ZigBee PAN coordinator as manages an entire ZigBee network, the short range of frequency band was only selected because the technology allows typically less than 100 kbp or ZigBee troubles in retransmission processing and delaying data tranmission works to create unproductive condition of work. This research was proposed the method, based on short range frequency of zigBee nodes enable to long range of remote data transmission with specific algorithm tools.

• 전자공학회논문지S
• /
• 제34S권8호
• /
• pp.74-83
• /
• 1997

In this paper, we propose a new fractal image decoding algorithm with fast convergence speed by using the data dependence and the improved initial image estimation. Conventional method for fractal image decoding requires high-degrdd computational complexity in decoding process, because of iterated contractive transformations applied to whole range blocks. On proposed method, Range of reconstruction imagte is divided into referenced range and data dependence region. And computational complexity is reduced by application of iterated contractive transformations for the referenced range only. Data dependence region can be decoded by one transformations when the referenced range is converged. In addition, more exact initial image is estimated by using bound () function in case of all, and an initial image more nearer to a fixed point is estimated by using range block division estimation. Consequently, the convergence speed of reconstruction iamge is improved with 40% reduction of computational complexity.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅳ
• /
• pp.1903-1906
• /
• 2003

This paper proposes an adaptive regularized noise smoothing algorithm for range image using the area decreasing flow method, which can preserve meaningful edges during the smoothing process. Although the area decreasing flow method can easily smooth Gaussian noise, it has two problems; ⅰ) it is not easy to remove impulsive noise from observed range data, and ⅱ) it is also difficult to remove noise near edge when the adaptive regularization is used. In the paper, therefore, the second smoothness constraint is addtionally incorporated into the existing regularization algorithm, which minimizes the difference between the median filtered data and the estimated data. As a result, the Proposed algorithm can effectively remove the noise of dense range data with edge preserving.