- 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
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.
Improved Rapid Corner Detection Algorithm in Medical Image
Improved Rapid Corner Detection Algorithm in Medical Image
GCP acquisition using simulated SAR and evaluation of GCP matching accuracy with texture features
A method for ground control point (GCP) acquisition using a simulated synthetic aperture radar (SAR) image derived from a digital elevation model (DEM) is proposed. Also proposed is a method for the evaluation of the accuracy of GCP matching with texture features from a reference GCP chip image. Results from experiments with simulated GCP chip images as reference images and geometrically distorted GCP chip images, derived using simulated SAR images as current images, show good coincidence with GCP matching accuracy in terms of pixel distances between matched GCP points in reference and current chip images and texture features. In particular, the correlation coefficient between the angular second moment (ASM) and the matching accuracy is 0.757, followed by Ent (entropy), Horn (homoginiety), Dis (dissimilarity), Con (contrast), Var (variability coefficient) and Chi (Chi-square), for the skewed images while for the rotated images, Dis shows the highest correlation of 0.628, followed by Horn, Asm, Co...
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 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 moreASSESSING THE VIABILITY OF PPK TECHNIQUES FOR ACCURATE MAPPING WITH UAS
Abstract. Utilizing ground control points (GCPs) to georeference photogrammetry-based point cloud data is a common practice in unmanned aerial system (UAS) mapping. Direct georeferencing or integrated sensor orientation (ISO) can be used to obtain georeferenced point clouds from UAS without relying heavily on GCPs. However, the accuracy of the point cloud may be impacted by the accuracy of the trajectory solution obtained by GNSS. To improve point cloud accuracy, post-processing kinematic (PPK) solutions can be applied to the UAS trajectory, which may provide higher accuracy than low-accuracy trajectory solutions and minimize the reliance on GCPs. This study compares the accuracy and precision of two different point clouds generated using different methods. One point cloud was generated using traditional photogrammetric methods with low accuracy Global Navigation Satellite System (GNSS) observations from the UAS and GCPs that have an average accuracy of one to two centimeters, while the other was generated using PPK trajectory solution for the UAS’s trajectory with two software: open-source Emlid Studio and the widely used Inertial Explorer. The use of PPK techniques in UAS mapping may have several potential benefits over traditional methods. By correcting the errors in the UAS's trajectory, a user may only need to depend on fewer ground control points, which can reduce the time and cost associated with fieldwork. This is particularly useful in areas that are difficult to access or have limited ground control point options, such as in urban or forested areas. To evaluate performance, a GNSS receiver is used to obtain measurements on checkpoints, which are used to assess the accuracies of the point clouds. In our experiments, the accuracy of the point clouds generated using PPK trajectory solution with high accuracy GCPs was found to be higher than those generated with low accuracy GNSS observations while aided with high accuracy ground control points. While the use of PPK with GCPs is generally expected to provide more accurate and reliable data than low-accuracy GNSS observations even after adjusting with GCPs, the number and distribution of GCPs can still significantly impact overall accuracy. Therefore, careful consideration of the number of GCPs and their placement is essential to achieve the desired level of efficiency and effectiveness in UAS mapping.
Read moreThreshold-Guided Design and Optimization for Harris Corner Detector Architecture
High-speed corner detection is an essential step in many real-time computer vision applications, e.g., object recognition, motion analysis, and stereo matching. Hardware implementation of corner detection algorithms, such as the Harris corner detector (HCD) has become a viable solution for meeting real-time requirements of the applications. A major challenge lies in the design of power, energy and area efficient architectures that can be deployed in tightly constrained embedded systems while still meeting real-time requirements. In this paper, we proposed a bit-width optimization strategy for designing hardware-efficient HCD that exploits the thresholding step in the algorithm to determine interest points from the corner responses. The proposed strategy relies on the threshold as a guide to truncate the bit-widths of the operators at various stages of the HCD pipeline with only marginal loss of accuracy. Synthesis results based on 65-nm CMOS technology show that the proposed strategy leads to power-delay reduction of 35.2%, and area reduction of 35.4% over the baseline implementation. In addition, through careful retiming, the proposed implementation achieves over 2.2 times increase in maximum frequency while achieving an area reduction of 35.1% and power-delay reduction of 35.7% over the baseline implementation. Finally, we performed repeatability tests to show that the optimized HCD architecture achieves comparable accuracy with the baseline implementation (average decrease of repeatability is less than 0.6%).
Read moreEye glint detection and location algorithm in eye tracking
Eye gaze means either the gaze direction or the distance between the pupil and fixed points such as canthus or glint inside pupil. Eye-Tracking aims to record the relative offsets of this distance as time goes by. For eye-tracking, to guarantee the precision of eye glint detection and location is really important. An accurate glint detection and location algorithm based on Harris corner detection is proposed in this paper. We exploit an adaptive binarization threshold which referred to OTSU algorithm to get candidate glint connected domain via thresholding the gradient image of eye. Meanwhile, we take the advantage of improved Harris corner detection algorithm to get another candidate glint position, where Corner Reflection Function of Trajkovic corner detection is introduced to pre-filter large amount of pixels and decrease the number of pixels for Harris detection, which will reduce the computation time substantially. The result connected domain is then obtained by cross-correlating two different candidate glints. To get the accurate coordinates of glint and ignore the influence of color values, we deal the final glint with Centroid method inside which the values are all set to one. Result indicates that this algorithm achieves real-time glint detection and computes the centroid coordinates of glint, which is robust and adaptive for eye images in different environment.
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 moreCorner Detection of the Computer VR Microscope Image Based on the 3D Reconstruction Algorithm.
In order to solve the problem of multisolution and ill-formedness of the 3D reconstruction method of a single image (purpose), the author proposes a microscope image segmentation algorithm based on the Harris multiscale corner detection. Separating complex engineering images into several simple basic geometric shapes, rebuild them separately to avoid the ill-conditioned solution problem of directly recovering depth information. In order to improve the registration accuracy of the corner-based image registration algorithm, the idea of multiresolution analysis was introduced into the classic Harris corner detection, and a gray intensity variation formula based on the wavelet transform was constructed, and a scale transformation characteristic was obtained so that the improved Harris corner detection algorithm is invariant to rotation, translation, and scale. Experimental results show that after reconstruction, the error between the length of the object measured based on the point cloud data and the actual length of the object is small, and both remain within the error range of 3 mm. The experiment verifies the fast, accurate, and stable characteristics of the improved algorithm.
Read moreExtracting photogrammetric ground control from lidar DEMs for change detection
Research has shown the importance of measuring topography for surface change detection and that the use of remote sensing methods is ideal for this application. A prerequisite for measuring change is a historical data‐set that covers the time period of interest. Many remote methods of topographic data collection such as lidar are relatively recent developments and therefore cannot provide records longer than about a decade. Alternatively, aerial photography has been in common use since the early 20th century and archives upwards of 50 years are therefore not uncommon. While photogrammetry is dependent on well distributed, high quality ground control points (GCPs), such data has been successfully applied retroactively. Therefore, contemporary lidar data, which requires little ground‐truth data, should be an ideal source of GCPs for controlling historical aerial photographs. This study aims to evaluate the success with which GCPs can be extracted from a high‐resolution lidar data‐set for controlling aerial photography for digital elevation model (DEM) production. Using a data‐set collected in Upper Wharfedale, northern England, GCPs were measured both by means of a lidar data‐set and by using traditional field‐based methods. The results showed that while the use of lidar‐derived ground control produced a DEM of inferior quality, increasing the number of GCPs used in the model produced results comparable to the GPS‐controlled DEM. These results are significant especially for surface change detection research in remote areas where high quality ground control is difficult to secure.
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 moreAutomatic GCP extraction with high resolution COSMO-SkyMed products
High-resolution Synthetic Aperture Radar (SAR) data represent an essential resource for the extraction of Ground Control Points (GCP) with sub-metric accuracy without in situ measurement campaigns. Conceptually, SAR-based GCP extraction consists of the following two steps: (i) identification of the same local feature on more SAR images and determination of their range/azimuth coordinates; (ii) spatial 3D positioning retrieval from the 2D radar coordinates, through spatial triangulation (stereo analysis) and inversion methods. In order to boost the geolocation accuracy, SAR images must be acquired from different line of sights, with intersection angles typically wider than 10 degrees, or even in opposite looking directions. In the present study, we present an algorithm specifically designed for ensuring robustness and accuracy in the fully automatic detection of bright isolated targets (steel light poles or towers) even when dealing with opposite looking data takes. In particular, the popular Harris algorithm has been selected as detector because it is the most stable and robust-to-noise algorithm for corners detection on SAR images. We outline the designed algorithmic solution and discusses the results derived over the urban area of Pisa (Italy), where more than ten COSMO-SkyMed Enhanced Spotlight (ES) stereo images are available, thus resulting an optimal test site for an assessment of the performances of the processing chain. The experimental analysis proofs that, assumed timing has been properly recalibrated, we are capable to automatically extract GCP from CSK ES data takes consisting in a very limited number of images.
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 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 more