• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.29 no.1
• /
• pp.71-80
• /
• 2011

Thresholding is important step for detecting binary change/non-change information in the unsupervised change detection. This study proposes new unsupervised change detection method using Hyperion hyperspectral images, which are expected with data increased demand. A graph is drawn with applying the range average method for the result value through pixel-based similarity measurement, and thresholding value is decided at the maximum distance point from a straight line. The proposed method is assessed in comparison with expectation-maximization algorithm, coner method, Otsu's method using synthetic images and Hyperion hyperspectral images. Throughout the results, we validated that the proposed method can be applied simply and had similar or better performance than the other methods.

• Journal of Broadcast Engineering
• /
• v.14 no.3
• /
• pp.366-377
• /
• 2009

In this paper, we implement the real-time system which extracts 3-dimensional coordinates from right and left images captured by a stereo camera and provides users with reality through a virtual space operated by the 3-dimensional coordinates. In general, all pixels in correspondence region are compared for the disparity estimation. However, for a real time process, the central coordinates of the correspondence region are only used in the proposed algorithm. In the implemented system, 3D coordinates are obtained by using the depth information derived from the estimated disparity and we set user's hand as a region of interest(ROI). After user's hand is detected as the ROI, the system keeps tracking a hand's movement and generates a virtual space that is controled by the hand. Experimental results show that the implemented system could estimate the disparity in real -time and gave the mean-error less than 0.68cm within a range of distance, 1.5m. Also It had more than 90% accuracy in the hand recognition.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.13 no.3
• /
• pp.48-57
• /
• 2005

This paper presents a novel algorithm in order to extract lane-related information based on machine vision techniques. The algorithm makes up for the weak points of the former method, the Edge Distribution Function(EDF)-based approach, by introducing a Lane Boundary Pixel Extractor (LBPE) and the well-known Hough Transform(HT). The LBPE that serves as a filter to extract pixels expected to be on lane boundaries enhances the robustness of machine vision, and provides its results to the HT implementation and EDF construction. The HT forms the accumulator arrays and extracts the lane-related parameters composed of orientation and distance. Furthermore, as the histogram of edge magnitude with respect to edge orientation angle, the EDF has peaks at the orientations corresponding to lane slopes on the perspective image domain. Therefore, by fusing the results from the EDF and the HT the proposed algorithm improves the confidence of the extracted lane-related information. The system shows successful results under various degrees of illumination.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.6
• /
• pp.2669-2688
• /
• 2016

An efficient and effective unsupervised single moving object detection framework is presented in this paper. Given the sparsely labelled trajectory points, we adopt a coarse-to-fine strategy to detect and segment the foreground from the background. The superpixel level coarse segmentation reduces the complexity of subsequent processing, and the pixel level refinement improves the segmentation accuracy. A distance measurement is devised in the coarse segmentation stage to measure the similarities between generated superpixels, which can then be used for clustering. Moreover, a Quadmap is introduced to facilitate the refinement in the fine segmentation stage. According to the experiments, our algorithm is effective and efficient, and favorable results can be achieved compared with state-of-the-art methods.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.39 no.1
• /
• pp.37-45
• /
• 2002

This paper proposes new features for recognizing telltale bulb in a cluster. A typical feature employed in model-based pattern recognition is polygonal approximation points of object. But recognition using these dominant points has many mismatching counts in small model such as telltale bulb. To reduce mismatching counts, proposed features are the circle distribution of object pixel and the ratio of distance from center to boundary in object. This Paper also proposes new decision function using three features. In simulation result, we make a comparison mismatching counts between recognition using dominant points and the new recognition algorithm using three features.

• Proceedings of the IEEK Conference
• /
• 2000.06c
• /
• pp.157-160
• /
• 2000

This paper proposes a color-based image retrieval method using color adjacency and gradient. In proposed method, both the adjacency of different colors and gradient of a color in homogeneous region are considered as features of an image. The gradient, defined as the maximum distance along the direction with largest change of color, is computed for each pixel to determine whether the center color is similar or different to the neighboring colors. Therefore the problems caused by uniform quantization, which is popularly used at most existing retrieval, can be avoided. And furthermore, the storage of the feature is reduced by the proposed binary representation.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2010.07a
• /
• pp.241-243
• /
• 2010

Previous approaches to the 2D to 3D conversion problem require heavy computation or considerable amount of user input. In this paper, we propose a rather simple method in estimating the depth map from a single image using a monocular depth cue: haze. Using the haze imaging model, we obtain the distance information and estimate a reliable depth map from a single scenery image. Using the depth map, we also suggest an algorithm that converts the single image to 3D stereoscopic images. We determine a disparity value for each pixel from the original 'left' image and generate a corresponding 'right' image. Results show that the algorithm gives well refined depth maps despite the simplicity of the approach.

• Journal of Information Display
• /
• v.5 no.3
• /
• pp.18-24
• /
• 2004

Voltage-dependent transmittance characteristics associated with various cell parameters have been studied in-plane switching liquid crystal display when both common and pixel electrodes are transparent. When both electrodes are opaque, the transmittance is related to only the distance (I) between electrodes. However, where transparent electrode is used, it is influenced not only the 1but also an electrode width (w) and rubbing angle. In addition, these factors are related to operating voltage which shows maximal transmittance. To maximize the light efficiency of the cell and obtain low operating voltage, the above-mentioned cell parameters need to be optimized.

• Proceedings of the KIEE Conference
• /
• 2000.11d
• /
• pp.747-749
• /
• 2000

In this paper, we proposed color stereo matching algorithm using dynamic programming. The conventional gray stereo matching algorithms show blur at depth discontinuities and non-existence of matching pixel in occlusion lesions. Also it accompanies matching error by lack of matching information in the untextured region. This paper defines new cost function makes up for the problems happening in conventional gray stereo matching algorithm. New cost function contain the following properties. I) Edge points are corresponded to edge points. ii) Non-edge points are corresponded to non-edge points. iii) In case of exiting the amount of edges, the cost function has some weight in proportion to path distance. Proposed algorithm was applied in various images obtained by parallel camera model. As the result, proposed algorithm showed improved performance in the aspect of matching error and processing in the occlusion region compared to conventional gray stereo matching algorithms.

• Journal of the Korean Society for Precision Engineering
• /
• v.17 no.5
• /
• pp.55-62
• /
• 2000

In this paper, an algorithm for determining the optimal resolution has been described for measuring the actual length of circular objects. As the resolution gets higher, the measurement error in general becomes smaller because of the reduced distance per pixel. However, the higher resolution makes circular objects enlarged, which may produce an ill-conditioned system. That is, a small error in the boundary positions may result in a large error in the analysis of the circular objects. Taking this fact into account, a new measure is proposed to determine the optimal resolution. The actual errors have been calculated with various resolutions and the resolution with the minimum error has been decided as the optimal resolution. The analysis using various circles with different sizes indicates that the minimum measurement error is obtained when the whole circle appears in the screen as large as possible, regardless of the size of circle. The experimental results using real images have verified the validity of our analysis.