• Journal of Korea Multimedia Society
• /
• v.19 no.10
• /
• pp.1747-1758
• /
• 2016

In this paper, we propose a new fast Hough transform to improve the processing time and line detection of Hough transform that is widely used in various vision systems. First, for the fast processing time, we reduce the number of features by using multi-statistical methods and also reduce the dimension of angle through six separate directions. Next, for improving the line detection, we effectively detect the lines of various directions by designing the line detection method which detects line in proportion to the number of features in six separate directions. The proposed method was evaluated with previous methods and obtained the excellent results. The processing time was improved in about 20% to 50% and line detection was performed better in various directions than conventional methods with experimental images.

• Journal of the Korea Computer Industry Society
• /
• v.8 no.3
• /
• pp.155-166
• /
• 2007

In this paper, captured face-image was pre-processing, segmentation, and extracting features from thinning by differential operator and minute-delineation. A straight line in slope-intercept form was transformed at the $r-\theta$ domain using Hough Transform, instead of Housdorff distance are extract feature as length, rotation, displacement of lines from thinning line components by differentiation. This research proposed a new approach compare with Hough Transformation and Housdorff Distance for face recognition so that Hough transform is simple and fast processing of face recognition than processing by Housdorff Distance. Rcognition accuracy rate is that Housdorff method is higher than Hough transformation's method.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.4
• /
• pp.715-717
• /
• 2008

The connectivity weighted Hough transform is a useful method for detecting well-connected short lines without generating false lines yet requires extensive computation. This letter describes a method that reduces the computation of the connectivity weighted Hough transform by removing unnecessary weight calculations using the gradient angles of feature points. In simulations with synthetic images and experiments with liquid crystal display panel images, the proposed method showed significantly improved speed without compromising detectability.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.10 no.3
• /
• pp.143-149
• /
• 2014

This paper is on the blind signal separation(BSS) method by the geometric method. To separate the signal sources, we use Hough transform and BSS. Hough transform is a geometric method which let us know the local informations of the signal. We find the orientations of signals by Hough transform and know the number of signal sources. When the number of sensors is more than the number of sources. the BSS algorithm can separate the mixtures well in the time domain. This algorithm has a good performance in converging fast. We had checked up the quality of the algorithm after separating the mixed signals. The results of simulations show that this BSS method has the abnormal waveforms due to unconverging coefficients in the beginning, and stably has the separated waveforms which almost equal to the sources in the most period.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.3
• /
• pp.66-76
• /
• 1995

In this research, a mesh connected VLSI structure is proposed for the real time computation of the generalized Hough transform(GHT). The purpose of the research is to design a generalized Hough transformer that can be realized as a single chip processor. The GHT has been modified to yield a highly parallel structure consisting of simple processing elements(PEs) and communication networks. In the proposed structure, the GHT can be computed by first assigning an image pixel to a PE and performing shift and add operations. The result of the CAD circuit simulation shows that it can be computed in the time proportional to the number of pixels in the pattern. In addition to the Hough transformer, the peak detector has been designed to reduce 1)the number of the I/O operations between the transformer and the host computer and 2) the host computer's burden for peak detection by transmitting only the local peaks detected from the transformed accumulator. It is expected that the proposed single chip Hough transformer with peak detector makes a fast and inexpensive edge based object recognition systems possible for many industrial and military applications.

• Journal of Korea Multimedia Society
• /
• v.14 no.6
• /
• pp.719-729
• /
• 2011

This paper presents a research on the fast and accurate method of line detection in the image of a wireless mobile robot (WMR). For the improvement of the processing time to detect lines, the characteristics of the transmitted image from the WMR was analyzed, and the efficient preprocessing method among the existing preprocessing methods was selected. And for the improvement of the accuracy to detect lines, the selection method of local maximum value at the Hough array (HA) which has the result of Hough transform was improved by designing a mask and applying it to HA. The experiment was performed with acquired images from the WMR, and the proposed method outperformed the existing methods in terms of processing time and line detection.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.5
• /
• pp.596-600
• /
• 2010

This paper proposes hough transform-based semi-automatic vertex detection algorithm for object modeling on a mobile phone supporting touch-screens. The proposed algorithm shows fast processing time by searching the limited range of parameters for computing hough transform with a small range of ROI image. Moreover, the proposed algorithm removes bad candidates among the detected lines by selecting the two closest candidate lines from the position of user's input. After that, it accurately detects an interesting vertex without additionally required interactions by detecting an intersection point of the two lines. As a result, we believe that the proposed algorithm shows a 1.4 pixel distance error on average as a vertex detection accuracy under such conditions as a 5.7 pixel distance error on average as an inaccurate input.

• Journal of Internet Computing and Services
• /
• v.11 no.6
• /
• pp.31-39
• /
• 2010

The Generalized Hough Transform(GHT) is the most used algorithm for circle detection with high accuracy. However, it requires many computation time, because many different templates are applied in order to find circles of various size. In the case of circle detection and tracking in video, the classical approach applies GHT for each frame in video and thus needs much high processing time for all frames. This paper proposes the fast GHT algorithm in video, using two consecutive frames are similar. In the proposed algorithm, a change-driven method conducts GHT only when two consecutive frames have many changes, and trajectory-based method does GHT in candidate areas and with candidate radius using circles detected in a previous frame. The algorithm can reduce computation time by reducing the number of frames, the edge count, and the number of searching circles, as factors which affects the speed of GHT. Our experimental results show that the algorithm successfully detects circles with less processing time and no loss of accuracy in video acquisited by a fixed camera and a moving camera.

• Geomechanics and Engineering
• /
• v.36 no.3
• /
• pp.205-215
• /
• 2024

Manually mapping fractures in construction stone mines is challenging, time-consuming, and hazardous. In this method, there is no physical access to all points. In contrast, digital image processing offers a safe, cost-effective, and fast alternative, with the capability to map all joints. In this study, two methods of detecting the trace of discontinuities using image processing in construction stone mines are presented. To achieve this, we employ two modified Hough transform algorithms and the degree of neighborhood technique. Initially, we introduced a method for selecting the best edge detector and smoothing algorithms. Subsequently, the Canny detector and median smoother were identified as the most efficient tools. To trace discontinuities using the mentioned methods, common preprocessing steps were initially applied to the image. Following this, each of the two algorithms followed a distinct approach. The Hough transform algorithm was first applied to the image, and the traces were represented through line drawings. Subsequently, the Hough transform results were refined using fuzzy clustering and reduced clustering algorithms, along with a novel algorithm known as the farthest points' algorithm. Additionally, we developed another algorithm, the degree of neighborhood, tailored for detecting discontinuity traces in construction stones. After completing the common preprocessing steps, the thinning operation was performed on the target image, and the degree of neighborhood for lineament pixels was determined. Subsequently, short lines were removed, and the discontinuities were determined based on the degree of neighborhood. In the final step, we connected lines that were previously separated using the method to be described. The comparison of results demonstrates that image processing is a suitable tool for identifying rock mass discontinuity traces. Finally, a comparison of two images from different construction stone mines presented at the end of this study reveals that in images with fewer traces of discontinuities and a softer texture, both algorithms effectively detect the discontinuity traces.

• Journal of Broadcast Engineering
• /
• v.17 no.6
• /
• pp.1040-1047
• /
• 2012

In this paper, we propose a ball tracking algorithm robust against occlusion in broadcasting soccer video sequences. Soccer ball tracking is a challenging task due to occlusion, fast motion and fast direction changes. Many works have been proposed based on ball trajectory. However, this approach requires heavy computational complexity. We propose a ball tracking algorithm with occlusion handling capability. Initial ball location is calculated using the circular hough transform. Then, the ball is tracked using template matching. Occlusion is handled by matching score. In occlusion cases, we generate a set of ball candidates. The ball candidates which exist in the previous frame were removed. On the other hand, the new appearing candidate is determined as the ball. Experiments with several broadcasting soccer video sequences show that the proposed method efficiently handles the occlusion cases.