• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10a
• /
• pp.137-140
• /
• 1996

Finding line segments in an intensity image has been one of the most fundamental issues in computer vision. In complex scenes, it is hard to detect the locations of point features. Line features are more robust in providing greater positional accuracy. In this paper we present a robust "line features extraction" algorithm which extracts line feature in a single pass without using any assumptions and constraints. Our algorithm consists of five steps: (1) edge scanning, (2) edge normalization, (3) line-blob extraction, (4) line-feature computation, and (5) line linking. By using edge scanning, the computational complexity due to too many edge pixels is drastically reduced. Edge normalization improves the local quantization error induced from the gradient space partitioning and minimizes perturbations on edge orientation. We also analyze the effects of edge processing, and the least squares-based method and the principal axis-based method on the computation of line orientation. We show its efficiency with some real images.al images.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.918-920
• /
• 2011

In this paper, a simple edge pattern classification method is proposed for detecting straight line segments in an image corrupted by impulse noise. Corrupted images have complicated edge patterns. To detect straight line from an complicated edge pattern, it is needed to simplify the entire edge. The proposed algorithm separates the entire edge into 4 directional partial edge patterns. Each line segment is separated from the partial edge image where several line segments are overlapped, and then the straight line is detected. The results of the experiments emphasize that the proposed algorithm is simple but accurate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.6B
• /
• pp.993-1001
• /
• 2000

This research features a method that quantitatively evaluates the performance of edge detection algorithms. Contrary to conventional methods that evaluate the performance of edge detection as a function of the amount of noise added to he input image, the proposed method is capable of assessing the performance of edge detection algorithms based on chosen parameters that influence the performance of edge detection. We have proposed a quantitative measure, called average performance index, that compares the average performance of different edge detection algorithms. We have applied the method to the commonly used edge detectors, Sobel, LOG(Laplacian of Gaussian), and Canny edge detectors for noisy images that contain straight line edges and curved line edges. Two kinds of noises i.e, Gaussian and impulse noises, are used. Experimental results show that our method of quantitatively evaluating the performance of edge detection algorithms can facilitate the selection of the optimal dge detection algorithm for a given task.

• Journal of the Institute of Convergence Signal Processing
• /
• v.11 no.2
• /
• pp.92-96
• /
• 2010

Deinterlacing methods are usually divided into inter-field deinterlacing and intra-field deinterlacing. The most common method of intra-field deinterlacing is the linear method which uses line doubling or line averaging. There are also some edge-enhancement methods such as ELA(Edge Based Line Average) and modified ELA. However, the linear interpolation generates edge blurring or staircase artifacts. The methods using ELA or modified ELA show poor deinterlacing at various types of edges because of insufficient edge information in a certain direction. This paper presents an intra-field deinterlacing algorithm that considers the interpolation based on edges in 7 directions and an edge line in the horizontal direction. It demonstrates better picture quality by reducing the staircase phenomenon of object in the conventional methods.

• Journal of IKEEE
• /
• v.19 no.1
• /
• pp.10-17
• /
• 2015

In this Paper, an efficient method of FPGA based design and implementation of Sobel Edge detector block using 3-Line buffers is presented. The FPGA provides the proper and sufficient hardware for image processing algorithms with flexibility to support Sobel edge detection algorithm. A pipe-lined method is used to implement the edge detector. The proposed Sobel edge detection operator is an model using of Finite State Machine(FSM) which executes a matrix mask operation to determine the level of edge intensity through different of pixels on an image. This approach is useful to improve the system performance by taking advantage of efficient look up tables, flip-flop resources on target device. The proposed Sobel detector using 3-line buffers is synthesized with Xilinx ISE 14.2 and implemented on Virtex II xc2vp-30-7-FF896 FPGA device. Using matlab, we show better PSNR performance of proposed design in terms of 3-Line buffers utilization.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4C
• /
• pp.223-229
• /
• 2005

In this paper, we proposed an extended edge-based line averaging method for deinterlacing with restricted search range. Conversion from interlaced signal to non-interlaced signal is one of important issues. Conventional deinterlacing algorithms usually utilize edge-based line average algorithm(ELA) within pixel-by-pixel approach. However, it is very sensitive to noise and variation of intensity. To reduce the sensitivity, the proposed method adopts a block-by-block approach and provides reliable direction of edge. Simulation results show that it provides a better performance than other pixel-by-pixel ELA-based methods.

• Journal of Korea Multimedia Society
• /
• v.18 no.10
• /
• pp.1164-1171
• /
• 2015

The edge preserving method is important for image storage and geometric transformation. In this paper, we propose a new edge preserving method using HOG-Guide filter for image segmentation. In our approach, we extract edge information using gradient histogram to set HOG guide line. Then, we use HOG guide line to smooth image. With two to four iterations of smoothing operations, we finally obtain desirable edge preserved image. Our experimental results showed good performances showing that our proposed method is better than other methods.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2011.05a
• /
• pp.185-185
• /
• 2011

Mapping of artificial levee lines, one of major tasks in river zone mapping, is critical to prevention of river flood, protection of environments and eco systems in river zones. Thus, mapping of artificial levee lines is essential for management and development of river zones. Coastal mapping including river zone mapping has been historically carried out using surveying technologies. Photogrammetry, one of the surveying technologies, is recently used technology for national river zone mapping in Korea. Airborne laser scanning has been used in most advanced countries for coastal mapping due to its ability to penetrate shallow water and its high vertical accuracy. Due to these advantages, use of LiDAR data in coastal mapping is efficient for monitoring and predicting significant topographic change in river zones. This paper introduces a method for construction of a 3D artificial levee line using a set of LiDAR points that uses normal vectors. Multiple steps are involved in this method. First, a 2.5-dimensional Delaunay triangle mesh is generated based on three nearest-neighbor points in the LiDAR data. Second, a median filtering is applied to minimize noise. Third, edge selection algorithms are applied to extract break edges from a Delaunay triangle mesh using two normal vectors. In this research, two methods for edge selection algorithms using hypothesis testing are used to extract break edges. Fourth, intersection edges which are extracted using both methods at the same range are selected as the intersection edge group. Fifth, among intersection edge group, some linear feature edges which are not suitable to compose a levee line are removed as much as possible considering vertical distance, slope and connectivity of an edge. Sixth, with all line segments which are suitable to constitute a levee line, one river levee line segment is connected to another river levee line segment with the end points of both river levee line segments located nearest horizontally and vertically to each other. After linkage of all the river levee line segments, the initial river levee line is generated. Since the initial river levee line consists of the LiDAR points, the pattern of the initial river levee line is being zigzag along the river levee. Thus, for the last step, a algorithm for smoothing the initial river levee line is applied to fit the initial river levee line into the reference line, and the final 3D river levee line is constructed. After the algorithm is completed, the proposed algorithm is applied to construct the 3D river levee line in Zng-San levee nearby Ham-Ahn Bo in Nak-Dong river. Statistical results show that the constructed river levee line generated using a proposed method has high accuracy in comparison to the ground truth. This paper shows that use of LiDAR data for construction of the 3D river levee line for river zone mapping is useful and efficient; and, as a result, it can be replaced with ground surveying method for construction of the 3D river levee line.

• Proceedings of the IEEK Conference
• /
• 2003.07c
• /
• pp.2581-2584
• /
• 2003

In this paper, we propose a self-localization algorithm using vertical line segments. Indoor environment is consist of horizontal and vertical line features such as doors, furniture, and so on. From the input image, vertical line edges are detected by an edge operator, Then, line segments are obtained by projecting edge image vertically and detecting local maximum from the projected histogram. From the relation of horizontal position of line segments and the location of the robot, nonlinear equations are come out Localization is done by solving the equations by using Newton's method. Experimental results show that the proposed algorithm using one camera is simple and applicable to indoor environment.

• Transactions of Materials Processing
• /
• v.15 no.6 s.87
• /
• pp.459-466
• /
• 2006

Trimming line design plays an important role in obtaining accurate edge profile after flanging. Compared to the traditional section-based method, simulation-based method can produce more accurate trimming line by considering deformation mechanics. Recently, the use of a finite element inverse method is proposed to obtain optimal trimming line. By analyzing flanging inversely from the final mesh after flanging, trimming line can be obtained from initial mesh on the drawing die surface. Initial guess generation fer finite element inverse method is obtained by developing the final mesh onto drawing tool mesh. Incremental development method is adopted to handle irregular mesh with various size and undercut. In this study, improved incremental development algorithm to handle complex shape is suggested. When developing the final mesh layer by layer, the algorithm which can define the development sequence and the position of developing nodes is thoroughly described. Flanging of front fender is analyzed to demonstrate the effectiveness of the present method. By using section-based trimming line and simulation-based trimming line, incremental finite element simulations are carried out. In comparison with experiment, it is clearly shown that the present method yields more accurate edge profile than section-based method.