• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.2
• /
• pp.145-148
• /
• 2011

In this paper, we proposed a search method for structured light pixels of omnidirectional structured light image. Since the omnidirectional structured light image is composed of several circular arc segments, the proposed algorithm searches the structured light pixels in radial direction rather than horizontal or vertical directions. The proposed search algorithm is based on the well-known Bresenham raster algorithm for line drawing in discrete integer space, thereby computation of the algorithm is very efficient. Comparison results between the proposed search algorithm and the conventional horizontal search are presented in experiments.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.19 no.1
• /
• pp.181-188
• /
• 2024

With the development of precision facility technology, the importance of four-axis CNC precision processing technology is increasing. However, due to complex shape processing, it is difficult to operate the system. This paper compared precision control and efficiency by manufacturing a four-axis control structure to solve this problem and implementing Bresenham's Line Algorithm and Runspeed Algorithm without using commercial programs. When Runspeed was applied, there was an error improvement of about 12.03% and curvature accuracy improvement compared to Bresenham. It was confirmed that precise processing was possible to a three-dimensional structure by driving a rotary shaft A motor.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.7
• /
• pp.1429-1434
• /
• 2017

In automatic defect detection problem for spectacle lenses, it is important to extract lens area accurately. Many existing detection methods fail to do it due to insufficient minute noise removal. In this paper, we propose an automatic defect detection method using Bresenham algorithm and adaptive binarization strategy. After usual average binarization, we apply Bresenham algorithm that has the power in extracting ellipse shape from image. Then, adaptive binarization strategy is applied to the critical minute noise removal inside the lens area. After noise removal, We can also compute the influence factor of the defect based on the fuzzy logic with two membership functions such as the size of the defect and the distance of the defect from the center of the lens. In experiment, our method successfully extracts defects in 10 out of 12 example images that include CHEMI, MID, HL, HM type lenses.

• The Journal of the Convergence on Culture Technology
• /
• v.9 no.3
• /
• pp.683-688
• /
• 2023

Content featuring next-generation weapons is continuously appearing in games and virtual reality. In the context of story development, the traces of a target's bullet marks are observed differently according to the unique characteristics of the rifle and bullet. Additionally, there is an example of using forensic ballistics to investigate crime by examining the traces of bullets. Understanding the relationship between the ballistic coefficient and cavity by ballistics is crucial during this process. This paper proposes a physics-based cavity simulation using the modified Bresenham's line algorithm, which can enhance realism in games and virtual reality. This simulation accurately models the trajectory of bullets and cavity formation upon impact, creating a more realistic representation of how bullets interact with materials. Overall, physics-based simulations can greatly enhance the realism and immersion of games and virtual reality experiences and can have applications in forensic investigations.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.61 no.6
• /
• pp.872-878
• /
• 2012

It is quite important to improve the visual acuity of a medical image by suppressing noisy parts and simultaneously keeping the details of signal components to draw the accurate diagnostics. With this aim, we suggest a novel method to generate Rotational Kernel Transformation (RKT) filter mask with applying Bresenham's algorithm and implement an nonlinear filtering algorithm to eliminate noises. As a result, we can find the fact that RKT filter mask can be automatically created and the visual acuity of a corrupted image can be elevated in terms of the signal-to-noise ratio (SNR) with applying the RKT filter.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.8
• /
• pp.2213-2221
• /
• 1999

A line segment has a symmetrical property about its midpoint. With this symmetrical property for a line segment we have proposed a variant of Bresenham's line drawing algorithm that selects two pixels at the same time. It implies that bi-directional line drawing toward the midpoint of line segment from each-end be possible. Besiders, it can select two pixels using only one decision parameter, instead of two different parameters for each pixel. We also present a theoretical proof for the correctness of such a selection. Thus, we can reduce the time of generating line segment by approximately less than 5% compared to the Bresenham's method. Also, our experimental results show that the shape of line segment generated by the proposed approach is the exactly same as that of Bresenham's method.

• Journal of applied mathematics & informatics
• /
• v.7 no.2
• /
• pp.629-640
• /
• 2000

this paper present an efficient line-drawing algorithm that reduces the amount of space required, Because of its efficiency , this line-drawing algorithm is faster than the Bresenham algorithm or the recursive bisection method. this efficiency was achieved through a new data structure; namely , the modified segment tree (MST). Using the modified segment tree and the distribution rule suggested in this paper, we dra lines without generating the recursive calls used in [3] and without creating the binary operation used in [4]. we also show that line accuracy improves in proportion to the display resolution . In practice, we can significantly improve the algorithm's performance with respect to time and space, This improvement offer an increase in speed, specially with lines at or near horizontal, diagonal. or vertical ; that is, this algorithm requires the time complexity of (n) and the space complexity O(2k+1), where n is the number of pixels and k is a level of the modified segment tree.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.5
• /
• pp.479-486
• /
• 2012

In this paper, a ranging system is proposed that is able to measure 360 degree omnidirectional distances to environment objects. The ranging system is based on the structured light imaging system with catadioptric omnidirectional mirror. In order to make the ranging system robust against environmental illumination, efficient structured light image processing algorithms are developed; sequential integration of difference images with modulated structured light and radial search based on Bresenham line drawing algorithm. A dedicated FPGA image processor is developed to speed up the overall image processing. Also the distance equation is derived in the omnidirectional imaging system with a hyperbolic mirror. It is expected that the omnidirectional ranging system is useful for mapping and localization of mobile robot. Experiments are carried out to verify the performance of the proposed ranging system.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11
• /
• pp.3140-3149
• /
• 1999

Skew correction for document images can be using a rotational transformation of pixel coordinates. In this paper we propose a method which corrects the document skew, by an amount of $\theta$ degrees, using block information, where the block is defined as a rectangular area containing adjacent black pixels. Processing speed of the proposed method is faster than that of the method using pixel transformation, since the number of floating-point operations can be reduced significantly. In the proposed method, we rotate only the four corner points of each block, and then identify the pixels inside the block. Two methods for inside pixel identification are proposed; the first method finds two points intersecting the boundary of the rotated block in each row, and determines the pixels between the two intersection points as the inside pixel. The second method finds boundary points based on Bresenham's line drawing algorithm, using fixed-point operation, and fills the region surrounded by these boundaries as black pixels. We have measured the performance of the proposed method by experimenting it with 2,016 images of various English and Korean documents. We have also proven the superiority of our algorithm through performance comparison with respect to existing methods based on pixel transformation.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.9
• /
• pp.2334-2339
• /
• 2009

In case of an embedded system having an LCD panel with touch-screen capability, various figures such as rectangles, pentagons, circles, and arrows are frequently used for the delivery of user-input commands. In such a case, it is necessary to have an algorithm that can recognize whether a touched location is within a figure on which a specific user-input command is assigned. Such algorithms, however, impose a considerable amount of overhead for embedded systems with restricted amount of computing resources. This paper first describes a method for initializing and driving a touch-screen LCD and a coordinate-calibration method that converts touch-screen coordinates into LCD panel coordinates. Then it introduces methods that can be used for recognizing touched areas of rectangles, many-sided figures like pentagons, and circles; they are a range checking method for rectangles, a crossing number checking method for many-sided figures, a distance measurement method for circles, and a color comparison method that can be applied to all figures. In order to evaluate the performance of these methods, we implement two-dimensional graphics functions for drawing figures like triangles, rectangles, circles, and images. Then, we draw such figures and measures times spent for the touched-area recognition of these figures. Measurements show that the range checking is the most suitable method for rectangles, the distance measurement for circles, and the color comparison for many-sided figures and images.