• Journal of Broadcast Engineering
• /
• v.17 no.6
• /
• pp.933-944
• /
• 2012

In this paper, we propose a new method to convert a low-resolution depth map into its high-resolution one called distance transform-based bilateral upsampling. Since the proposed method controls the spatial domain weighting function based on distance transform values of the depth map, it increases the input depth map resolution while preserving edge sharpness. The proposed method is composed of three main steps: distance transform, spatial weighting control, and image interpolation. Experimental results show that our method outperforms the conventional bilateral upsampling in terms of the quality of output depth maps.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.22 no.4
• /
• pp.349-357
• /
• 2004

In order to manage the waterfront efficiently, we are to find the efficiency of producing method for digital orthophoto that presents natural form on lands and digital orthophoto cadastral map that presents the range of physical situation and property on lands in this study. Through this study, We can check that digital orthophoto cadastral maps for the boundary management of the waterfront are utilized widely at various field except the main purpose. Thus, we resolve the leading subjects that include the accuracy evaluation on produced maps and the bond edge of map sheet for the cadastral maps in order to drive activistic utilization and application.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.25 no.5
• /
• pp.502-508
• /
• 2015

Stereo images have an advantage of calculating depth(distance) values which can not analyze from 2-D images. However, depth information obtained by stereo images has due to following reasons: it can be obtained by computation process; mismatching occurs when stereo matching is processing in occlusion which has an effect on accuracy of calculating depth information. Also, if global method is used for stereo matching, it needs a lot of computation. Therefore, this paper proposes the method obtaining disparity map which can reduce computation time and has higher accuracy than established method. Edge extraction which is image segmentation based on feature is used for improving accuracy and reducing computation time. Color K-Means method which is image segmentation based on color estimates correlation of objects in an image. And it extracts region of interest for applying Loopy Belief Propagation(LBP). For this, disparity map can be compensated by considering correlation of objects in the image. And it can reduce computation time because of calculating region of interest not all pixels. As a result, disparity map has more accurate and the proposed method reduces computation time.

• Journal of the Korean Society for Precision Engineering
• /
• v.27 no.1
• /
• pp.64-75
• /
• 2010

This study introduces a complete feature map building method of sonar sensors for mobile robots. This method enhances the reality of feature maps by extracting even circle features as well as line and point features from sonar data. Edge features are, moreover, generated by combining line features close to circle features extracted around comer sites. The uncertainties of the specular reflection phenomenon and wide beam width of sonar data can be, therefore, reduced through this map building method. The experimental results demonstrate a practical validity of the proposed method in those environments.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.134.1-134
• /
• 2001

The paper presents a sonar based map building method. The environment is a room or area inside a building, which is composed of four types of geometric primitives(corners, edges, cylinders, and walls). We also assume the environment can be modeled into two dimensional map in terms of planes(walls), points(corner and edge), and circle(cylinder). In a real world where most of the object surfaces are specular ones, a sonar sensor suffers from a multipath effect which results in a wrong interpretation of the location of an object. To reduce the effect and uncertainty, the method employs a simple thresholding technique for extracting circular arc features called regions of constant depth(RCD) from scanning sonar data. The usefulness of the approach is illustrated with the results produced by sets of experiments.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.99-102
• /
• 2009

In this paper a hierarchical stereo matching algorithm based on feature extraction is proposed. The boundary (edge) as feature point in an image is first obtained by segmenting an image into red, green, blue and white regions. With the obtained boundary information, disparities are extracted by matching window on the image boundary, and the initial disparity map is generated when assigned the same disparity to neighbor pixels. The final disparity map is created with the initial disparity. The regions with the same initial disparity are classified into the regions with the same color and we search the disparity again in each region with the same color by changing block size and search range. The experiment results are evaluated on the Middlebury data set and it show that the proposed algorithm performed better than a phase based algorithm in the sense that only about 14% of the disparities for the entire image are inaccurate in the final disparity map. Furthermore, it was verified that the boundary of each region with the same disparity was clearly distinguished.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2002.10a
• /
• pp.654-658
• /
• 2002

The purpose of this paper is to establish an effective featured based inspection planning system for OMM(On-Machine Measurement) process. In this system, an effective inspection process planning is accomplished by determining the number of measuring points, their locations and probing paths using fuzzy logic, Hammersley method and TSP problem. Also, an effective collision-free algorithm Is proposed based on the EZ-map analysis. All the inspection planning processes are performed based on the defined inspection features those are derived from the CAD database. Proposed inspection planning method is simulated for the given sample wrokpieces, and the results are analyzed. The results show that the proposed method can be successfully implemented in real OMM process.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2002.10a
• /
• pp.3-6
• /
• 2002

This paper presents the cutting simulation system for prediction and regulation of cutting force in CNC machining. The cutting simulation system includes geometric model, cutting force model, and off-line fred rate scheduling model. ME Z-map(Moving Edge node Z-map) is constructed for cutting configuration calculation. The cutting force models using cutting-condition-independent coefficients are developed for flat-end milling and ball-end milling. The off-line feed rate scheduling model is derived from the developed cutting force model. The scheduled feed rates are automatically added to a given set of NC code, which regulates the maximum resultant cutting force to the reference force preset by an operator. The cutting simulation system can be used as an effective tool for improvement of productivity in CNC machining.

• Journal of information and communication convergence engineering
• /
• v.9 no.1
• /
• pp.59-63
• /
• 2011

Conventional noise reduction filtering schemes realize limited improvements of the peak signal-to-noise ratio (PSNR) in the low-level noisy images. The flatness degree and the edge information are effectively used to estimate the noise volume. We propose a noise estimator for reducing noise in the AWGN (additive white gaussian noise) corrupted images using three intermediate image maps (FGM(flatness gray map), FIM(flatness index map), NEM(noise estimate map)). The proposed noise estimator is fed into the conventional noise reduction filters as a pre-processor. The performance of noise reduction is tested in the various AWGN corrupted images.

• Journal of KIISE:Software and Applications
• /
• v.27 no.5
• /
• pp.543-550
• /
• 2000

An adaptive bit-reduced mean absolute difference (ABRMAD) is presented as a criterion for the block-matching algorithm (BMA) to reduce the complexity of the VLSI Implementation and to improve the processing time. The ABRMAD uses the lower pixel resolution of the significant bits instead of full resolution pixel values to estimate the motion vector (MV) by examining the pixels Ina block. Simulation results show that the 4-bit ABRMAD has competitive mean square error (MSE)results and a half less hardware complexity than the MAD criterion, It has also better characteristics in terms of both MSE performance and hardware complexity than the Minimax criterion and has better MSE performance than the difference pixel counting(DPC), binary block-matching with edge-map(BBME), and bit-plane matching(BPM) with the same number of bits.