• Journal of the Korean Institute of Intelligent Systems
• /
• v.25 no.1
• /
• pp.78-84
• /
• 2015

Depth estimation is often required for robot vision, 3D modeling, and motion control. Previous method is based on the focus measures which are calculated for a series of image by a single camera at different distance between and object. This method, however, has disadvantage of taking a long time for calculating the focus measure since the mask operation is performed for every pixel in the image. In this paper, we estimates the depth by using the focus measure of the boundary pixels located between the objects in order to minimize the depth estimate time. To detect the boundary of an object consisting of a straight line and a circle, we use the Hough transform and estimate the depth by using the focus measure. We performed various experiments for PCB images and obtained more effective depth estimation results than previous ones.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.728-731
• /
• 2007

Though the Hough transform is a well-known method for detecting analytical shape represented by a number of free parameters, the basic property of the Hough transform, the one-to-many mapping from an image space to a Hough space, causes the innate problem, the sensitivity to noise. To remedy this problem, Edge Strength Hough Transform (ESHT) was proposed and proved to reduce the noise sensitivity. However the performance of ESHT depends on the size of a Hough space and image and some other parameters, which play an important role in ESHT and should be decided experimentally. In this paper, we derived a formula to decide decreasing parameter. Using the derived formulae, the decreasing parameter value can be decided only with the pre-determined values, the size of a Hough space and an image, which make it possible to decide them automatically.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.6A
• /
• pp.524-532
• /
• 2002

This paper reports that the Lambert W function applies to a non-iterative design of minimum mean square-error scalar quantizers for a Laplacian source. Specifically, it considers a non-iterative design algorithm for optimum quantizers for a Laplacian source; it finds that the solution of the recursive nonlinear equation in the non-iterative design is elegantly expressed in term of the principal branch of the Lambert W function in a closed form; and it proves that the non-iterative algorithm applies only to exponential or Laplacian sources. The contribution of the paper is in the reduction of the time needed for the design and the increased accuracy in resulting quantization points and thresholds, because the algorithm is non-iterative and the Lambert W function can be evaluated as accurately as desired. Also, numerical results show how optimal quantization distortion converges monotonically to the Panter-Dite constant and help derive an approximation formula for the key parameters of optimum quantizers.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.10
• /
• pp.165-173
• /
• 2011

In Mobile Ad-hoc Network(MANET), mobile nodes are operated by limited batteries. Therefore, it is very important to consume the battery power efficiently to prevent termination of the network. In this paper, we propose Energy-aware Dynamic Source Routing(EDSR) which is based on the Dynamic Source Routing(DSR) to increase the packet transmission and lifetime of the network. If the battery power of a node reaches threshold level, then the node gives up the function of relaying to save battery power except as a source and a destination node. While the conventional DSR doesn't consider the battery consumptions of the nodes, EDSR blocks the nodes from relaying whose battery powers are below the threshold level. Simulation results show the proposed EDSR is more efficient in packet transmission and network lifetime through the balanced battery consumption of the mobile nodes.

• Journal of Korean Society for Geospatial Information Science
• /
• v.13 no.1 s.31
• /
• pp.19-25
• /
• 2005

Nowadays, it is possible to construct the DEMs of urban area effectively and economically by LiDAR system. But the data from LiDAR system has form of DSM which is included various objects as trees and buildings. So the preprocess is necessary to extract the DEMs from LiDAR DSMs for particular purpose as effects analysis of man-made objects for flood prediction. As this study is for extracting DEM from LiDAR DSM of urban area, we detected the edges of various objects using edge detecting algorithm of image process. And, we tried mean value filtering, median value filtering and minimum value filtering or detected edges instead of interpolation method which is used in the previous study and could be modified the source data. it could minimize the modification of source data, and the extracting process of DEMs from DSMs could be simplified and automated.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.6
• /
• pp.705-716
• /
• 2002

This paper proposes a method which visualizes MRI head data in 3 dimensions with direct volume rendering. Though surface rendering is usually used for MRI data visualization, it has some limits of displaying little speckles because it loses the information of the speckles in the surfaces while acquiring the information. Direct volume rendering has ability of displaying little speckles, but it doesn't treat MRI data because of the data features of MRI. In this paper, we try to visualize MRI head data in 3 dimensions as follows. First, we separate the brain region from the head region of MRI head data, next increase the pixel level of the brain region, then combine the brain region with the increased pixel level and the head region without brain region, last visualizes the combined MRI head data with direct volume rendering. We segment the brain region from head region based on histogram threshold, morphology operations and snakes algorithm. The proposed segmentation method shows 91~95% similarity with a hand segmentation. The method rather clearly visualizes the organs of the head in 3 dimensions.

• The KIPS Transactions:PartA
• /
• v.16A no.2
• /
• pp.79-88
• /
• 2009

In boundary scan architecture, test stimuli are shifted in one at a time and applied to the on-chip system logic. The test results are captured into the BSR and are examined by subsequent shifting. In this paper, we developed a continuous capture test architecture and test procedure using TPG based on boundary scan is used to performance test. In this architecture, test patterns of TPG are applied to CUT with system clock rate, and response of CUT is continuously captured by CBSR(Continuous Capture Boundary Scan Register) at the same rate and the captured results is shifted to TDO at the same rate. The suggested a continuous capture test architecture and test procedure is simulated by Altera Max+Plus 10.0. The simulation results shows the accurate operation and effectiveness of the proposed test architecture and procedure.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.10A
• /
• pp.1566-1575
• /
• 2000

This paper studies mismatched scalar quantization of a generalized gamma source by a quantizer that is optimally (in the mean square error sense) designed for another generalized gamma source. Specifically, it considers variance-mismatched quantization which occurs when the variance of the source to be quantized differs from tat of the designed-for source. The main result is the two distortion formulas derived from Bennett's integral. The first formula is an approximation expression that uses the outermost threshold of an optimum scalar quantizer, and the second formula, in turn, uses an approximation formula for this outermost threshold. Numerical results are obtained for Laplacian sources, which are example of a generalized gamma source, and comparisons are made between actual mismatched distortions and the two formulas. These numerical results show that the two formulas become more accurate, as the number of quantization points gets larger and the ratio of the source variance to that of the designed-for source gets bigger. For example, the formulas are within 2~4% of the actual distortion for approximately 64 quantization points or more. In conclusion, the proposed approximation formulas are considered to have contribution as closed formulas and for their accuracy.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.8A
• /
• pp.786-795
• /
• 2002

In this paper, we present a histogram and moment-based vidoe scencd change detection technique using hierarchical Hidden Markov Models(HMMs). The proposed method extracts histograms from a low-frequency subband and moments of edge components from high-frequency subbands of wavelet transformed images. Then each HMM is trained by using histogram difference and directional moment difference, respectively, extracted from manually labeled video. The video segmentation process consists of two steps. A histogram-based HMM is first used to segment the input video sequence into three categories: shot, cut, gradual scene changes. In the second stage, a moment-based HMM is used to further segment the gradual changes into a fade and a dissolve. The experimental results show that the proposed technique is more effective in partitioning video frames than the previous threshold-based methods.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2012.05a
• /
• pp.403-403
• /
• 2012

최근 단시간 동안에 특정지역에 집중되는 국지적 호우에 의한 돌발홍수가 빈번히 발생하고 있으며, 이에 따른 위험과 손실이 증가하고 있는 추세이다. 현재 국내에서는 이러한 피해를 최소화하고자 돌발홍수 예측모형을 개발하고 예 경보 시스템을 구축하여 다양한 비구조적 대책을 마련하고 있다. 그러나 활용되는 예측모형의 경우 개념적 유출량인 한계유출량으로부터 돌발홍수능(Flash Flood Guidance, FFG)을 결정하여 예측 강우와 상대적인 대소 비교를 통해 돌발홍수의 발생가능성 유무를 판단하게 되는데, 문제는 산정되는 한계유출량은 개념적이기 때문에 검증이 어렵고 산정방법도 다양하여 불확실성이 높다는 단점이 있다. 이에 본 연구에서는 기존의 돌발홍수 예측 방법이 아닌, 수문모형 Nesting 기법을 이용한 돌발 홍수 예측 방법을 개발하였다. 저해상도의 대유역 기반의 유출량이 큰 영역의 경계값이 되고, 대유역을 이루고 있는 소유역을 고해상도의 작은 영역이라 할 때, 경계값인 대유역의 기반의 유출량을 참고 유출량으로 하여 소유역의 유출을 물리적 혹은 개념적으로 보다 타당하게 모의하는 방법이 수문모형 Nesting 기법이다. 이러한 기법에 필요한 강우-유출 모형으로는 대유역의 경우, SURR 모형(Sejong University Rainfall-Runoff model)을 선택하였으며, 대유역을 이루는 소유역의 유출모의는 물리적 기반의 분포형 모형인 CASC2D 모형을 이용하였다. 또한 실시간 활용을 위해서는 CASC2D 모형의 매개변수를 자동으로 추정하는 기술이 요구되며, 본 연구에서는 매개변수 전역 최적화 방법인 SCE-UA(The Shuffled Complex Evolution, University of Arizona) 기법을 활용하였다. 본 연구에서 사용한 수문모형의 적용성을 평가한 결과 대상유역에 대한 적용성이 높은 것으로 나타났으며, 연계된 두 모형의 유출거동이 유사하게 나타난 것으로 확인되었다. 본 연구에서는 Nesting 기법을 이용하여 0.5m 하천 수위의 상승 여부에 따라 돌발홍수의 발생 가능성을 예측하는 기법을 제안하였으며, 돌발홍수 사례와 일반호우사상으로부터 이 방법의 적용성을 평가하였다. 실제 돌발홍수가 발생한 유역을 선정하고 연계된 두 모형을 대상 유역에 적용한 결과 Nesting 기반의 돌발홍수 예측방법은 기존의 한계유출량 산정 방법에서 반영하지 못한 사상을 적절히 반영한 것으로 나타났다. 본 연구에서 개발한 Nesting 기법을 이용한 돌발홍수 예측모형은 일반적인 강우량 비교의 돌발홍수 예측방법에서 벗어나 새로운 돌발홍수 예측방법을 제안한 측면에서 큰 의미가 있다고 사료되며, 이러한 연구 결과는 실시간 돌발홍수 예측 시스템의 기본 모형으로 활용이 가능할 것으로 판단된다.