- Research Article
- 10.4028/www.scientific.net/amr.345.210
Improved Rapid Corner Detection Algorithm in Medical Image
- Sep 01, 2011
- Advanced Materials Research
- Peng He + 2 more +2
Improved Rapid Corner Detection Algorithm in Medical Image
Image corners encapsulate gradient changes in multiple directions. Therefore, corners are considered as efficient features for use in robotic navigation algorithms. Template based corner detection has a low computational complexity and is straightforward to implement. With the appropriate design of templates, satisfactory detection accuracy can also be achieved. In this paper, we introduce two new template based corner detection algorithms to be used to assist robot vision: the matching based corner detection, namely, MBCD; and the correlation based corner detection, namely, CBCD. These two approaches outperform existing template based approaches in the means that they reduce detection of spurious corners by considering ideal corners with at least two-pixel length on the corner arm directions. Experimental results show that the proposed algorithms detect essential corners for synthetic images and natural images satisfactorily according to human visual perception. We also examine the robustness of the two corner detection approaches in terms of the average repeatability and localization error. Since our approaches are computationally efficient, it makes these template based corner detection algorithms suitable for real time support in robotic applications. Comparisons with existing corner detection algorithms are also presented.
Improved Rapid Corner Detection Algorithm in Medical Image
Improved Rapid Corner Detection Algorithm in Medical Image
Robust Image Corner Detection Based on Maximum Point-to-Chord Distance
This paper first analysed the state-of-the-art corner detection algorithms and then proposed a novel corner detection approach based on a maximum point-to-chord distance. The proposed corner detector consists of three steps: First, several curves of original image is extracted using Canny edge detector. Second, a method of maximum point-to-chord distance is used in each curve to get the initial corner points. Third, non-maximum suppression and threshold are used to remove corner points with low curvature and get the final result. Different from the CPDA (chord-to-point distance accumulation) corner detector, our proposed detector neither need to accumulate each distance from a moving chord, nor need to computer the accumulation of each point in a curve, therefore achieves better speed while keeping the good average repeatability and accuracy. Compared with the existing methods, the proposed detector attains better performance on average repeatability and localization error under affine transforms, JPEG compression and Gaussian noise.
Read moreA Target Corner Detection Algorithm Based on the Fusion of FAST and Harris
Corner detection is a common method to obtain image features, and the detection effect influences the performance of matching and tracking directly. A FAST-Harris fusion corner detection algorithm is proposed to improve the shortcomings of the Harris algorithm, such as the low detection accuracy and low positioning accuracy, and a corner detection fusion model is established. First, the detected target image is padded, and then the FAST algorithm is used with a 25% reduced contrast points to achieve fast capture roughly; in this way, a candidate corner set is obtained. Then, screening the candidate corner is set one by one by calculating the response function of the Harris with Scharr operator to achieve capture accurately. Finally, the real corners are obtained using SAD for nonmaximum suppression. The positioning error, error detection rate, robustness, and running time of corner detection are obtained by the PyCharm platform. Compared with Harris, the error detection rate and localization error of the algorithm are reduced by 16.89% and 42.04%, respectively. Compared with 8 popular corner detection algorithms, the error detection rate and localization error of the algorithm in this paper are the lowest, which are 24.60% and 1.42 pixels. The robust performance in lossy JPEG compression is the best, with 17.37% shorter running time than Harris algorithm. The method in this paper can be used in scenarios such as autonomous driving and image search services.
Read moreRevisiting Mehrotra and Nichani's Corner Detection Method for Improvement with Truncated Anisotropic Gaussian Filtering.
In the early 1990s, Mehrotra and Nichani developed a filtering-based corner detection method, which, though conceptually intriguing, suffered from limited reliability, leading to minimal references in the literature. Despite its underappreciation, the core concept of this method, rooted in the half-edge concept and directional truncated first derivative of Gaussian, holds significant promise. This article presents a comprehensive assessment of the enhanced corner detection algorithm, combining both qualitative and quantitative evaluations. We thoroughly explore the strengths, limitations, and overall effectiveness of our approach by incorporating visual examples and conducting evaluations. Through experiments conducted on both synthetic and real images, we demonstrate the efficiency and reliability of the proposed algorithm. Collectively, our experimental assessments substantiate that our modifications have transformed the method into one that outperforms established benchmark techniques. Due to its ease of implementation, our improved corner detection process has the potential to become a valuable reference for the computer vision community when dealing with corner detection algorithms. This article thus highlights the quantitative achievements of our refined corner detection algorithm, building upon the groundwork laid by Mehrotra and Nichani, and offers valuable insights for the computer vision community seeking robust corner detection solutions.
Read moreA New Stereo Matching Method Based on Sub-pixel Corner Detection
Corner detection and stereo matching play an important role in the machine vision. The detection accuracy and matching velocity are highly demanded in the stereo vision. In this paper, dual-Harris corner detection algorithm and corner matching method are proposed. Corner detection algorithm adopts random mid-point displacement method in fractal geometry to subdivide and amplify the pixel precision corner detected by the Harris algorithm and its surrounding pixel block. And then, it reuses harris algorithm to provide sub-pixel corner position by detecting the fractal interpolation map and the FBS surface. This method accords with human thought manner that is to observe things ranging from whole to part and form macroscopy to microcosm, which avoids detecting the edge and fitting lines by comparing with the common sub-pixel detection algorithm. Corner matching method uses the corner characteristic constraint to limit the amount of the alternative corners in the searching window, which sharply decreases the amount of correlation coefficient computation, and saves the stereo matching time. Simultaneity, the constraint of disparity gradient is selectively adopted to increase the stereo matching veracity. Large numbers of experiment results show the veracity and real-time of the proposed method.
Read moreApplication of Nonlinear Diffusion in Corner Detection
Although many work have been done on corner detection, no generally accepted mathematical definition exists. This paper gives an explicit definition of corner which is based on the multi-orientation nature of corner and presents an algorithm for corner detection based on orientation estimation. Experimental results show that the proposed algorithm is more accurate and noise-robust compared with three popularly used corner detection algorithms.
Read moreA Semi-Automatic Image Registration Scheme based on a Noval Asymmetrical Corner Detector (ACD)
In this paper, a novel Asymmetrical Corner Detector (ACD) algorithm based on the auto-correlation is presented. Based on the study of the fact that asymmetrical corner points are the most common reality in remotely sensed imagery data, the ACD is designed to detect interest points more favourable to slightly asymmetrical points rather than ideal symmetrical points. The experimentation results using images taken by different sensors indicate that the ACD has obtained excellent performance in terms of point localization and computational efficiency. It is more capable of selecting high quality ground control points (GCPs) than some well-established corner detectors, e.g. the Harris Corner Detector [1]. A semi-automatic image co-registration scheme is then proposed, which employed the ACD algorithm to extract evenly distributed GCPs across the overlapped area in the reference image.
Read morePipelining Harris corner detection with a tiny FPGA for a mobile robot
With their parallelizable inner structures, field programmable gate array (FPGA) are increasing their popularity in today's embedded systems. In this paper, we present an implemented, unique and pipelined FPGA architecture designed with Verilog HDL to be used on a mobile robot for detecting corners in colored stereo images using Harris corner detection (HCD) algorithm in real time. The architecture consists of 3 pipelined modules and processes RGB555 formatted images in 640×480 resolution. The design is implemented on Xilinx's ML501 board having a XC5VLX50 FPGA, one of the smallest FPGAs of Virtex-5 series. Raw and processed data are stored into a single DDR2 memory of Micron, MT4HTF3264HY on the board, allowing only a single read or write operation at a time. By using less than 75% of FPGA resources and a 100MHz system clock, we achieved a corner detection rate of 0.33 pixels per clock cycle (ppcc) corresponding to a corner detection frequency of 54Hz for the stereo images.
Read moreCorner relocation based on density gradient direction
As a result of the impact of external factors,corners detected by corner detection algorithm may be offset.Based on the analysis of this phenomenon,this paper proposed a new algorithm for corner relocation.Firstly,through calculating the second-order template value for every corner,the fuzzy corner relocation was carried out;secondly,the density gradient direction of pixel was introduced.Comparing the density gradient directions of the corners and the neighborhood pixels of the corners,the wrong corners were determined precisely and all candidates were found;finally,according to the relationship between the corner and the candidate pixels,new corner was found.Experimental results show that the algorithm can accurately relocate the wrong corners.
Read moreAnalysis of Harris corner detection for color images
Corner detection algorithm is an algorithm which helps in identifying the corners in an image. Corners are mainly formed by the combination of two or more edges. These corners may or may not define the boundary of an image. Here the method used is Harris corner detection algorithm. It helps in pointing out the corners in a color image, for each component. This improves the detection efficiency and the experimental results shows that this method is more reliable than traditional methods.
Read moreImage Alignment Using Pyramid Structure with Harris Corner Detection
A corner-based image alignment algorithm based on the procedures of corner-based template matching is presented in this study. This algorithm consists of two stages: training and matching. In the matching phase, the corners are obtained using Harris corner detection algorithm. These corners are then used to build the pyramid images. In the matching phase, the corners are obtained using the same corner detection algorithm. The similarity measure is then determined by the differences of gradient vector between the corners obtained in the template image and the inspection image, respectively. Furthermore, it further applied the refined function to evaluate the geometric relationship between the template and the inspection images. Results show that the corner-based template matching outperforms the original edge-based template matching in efficiency, and both of them are robust against lighting changes.
Read moreIsometric efficient and accurate Fourier-SIFT method in iris recognition system
Iris is the Optimum Biometric-trait present in Biometrics Security. Our emphasis on this paper is to obtain efficient, fast and robust algorithm set for iris detection. There are number of algorithms proposed for the efficient result but fails due to limitations. We tried in this paper to make, an efficient combination of the best schemes of normalization, corner detection, feature extraction and best matching algorithm available. We have used Modified-Trajkovic Operator (8-neighbours) to detect the corner, in which, the iris image sample is first optimized by sector based normalization into four sectors, this decreases the iris area but the modified 8-neighbours detect the corner accurately. Fourier-SIFT is then used to determine the keypixels with enhanced threshold cutoff and finally Modified-Hausdorff distance (or Gromov-Hausdorff distance) determines the matching algorithm and measures the distance between keypixels of enrolled and scanned iris during matching. The limitations in the above algorithms are rectified in this paper. This process is rigorously checked on CASIA-V3and MMU iris images.
Read moreAn Improved Algorithm for the Estimation of Multibody Motion
The problem of estimating ego motion and eoru motions through a vehicle mounted with a camera is related in this paper. Localization of multiple moving objects and estimating their motion are crucial for autonomous vehicles, but it is not that much successful in estimating the motion of the moving vehicles and objects. Ego motion can be calculated only by conventional localization and mapping techniques. The framework for estimation of multiple motions in addition to the camera ego motion is presented. The video is processed through MATLAB for pre-processing. The video is then segmented into frames, and then the framework is done to estimate the multibody motion through different algorithms. The algorithms like block matching algorithms, corner detection, and background subtraction algorithm are used to estimate the multibody motions of the moving objects. From this, we can detect and estimate the motion and speed of the object in the frame. Then, it is processed in hardware (raspberry pi3) using the same algorithms, so that we can effectively use it in any autonomous cars.
Read moreCorner detection with covariance propagation
This paper presents a statistical approach for detecting corners from chain encoded digital arcs. An arc point is declared as a corner if the estimated parameters of the two fitted lines of the two arc segments immediately to the right and left of the are point are statistically significantly different. The corner detection algorithm consists of two steps: corner detection and optimization. While corner detection involves statistically identifying the most likely corner points along an arc sequence, corner optimization deals with improving the locational errors of the detected corners. The major contributions of this research include developing a method for analytically estimating the covariance matrix of the fitted line parameters and developing a hypothesis test statistic to statistically test the difference between the parameters of two fitted lines. Performance evaluation study showed that the algorithm is robust and accurate for complex images. It has an average misdetection rate of 2.5% and false alarm rate of 2.2% for the complex RADIUS images. This paper discusses the theory and performance characterization of the proposed corner detector.
Read moreRobust Corner Detection Using Linear Fitting Error Estimation
Image corners have been widely used in image processing and computer vision applications. For a variety of contour-based corner detection methods the key step is curvature estimation, which reflects the bending strength of a curve. Corner detection aims to achieve the lowest possible computational cost and maximal detection accuracy. Instead of estimating the discrete curve directly like most contour-based corner detectors, we propose to utilize the linear fitting error to measure the corner response strength of the contour points. The proposed method consists of three aspects: First, a small curve segment is parameterized to two curves; then the minimum linear fitting errors with respect to the above two curves are estimated by employing the least-squares fitting technique; Finally, the estimated minimum fitting errors are considered as the local bending strength of the small curve segment for corner finding. The experimental results show that the proposed corner detection algorithm outperforms the five state-of-the-art corner detection methods in terms of localization error and average repeatability.
Read more