- 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
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.
Improved Rapid Corner Detection Algorithm in Medical Image
Improved Rapid Corner Detection Algorithm in Medical Image
Revisiting 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 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 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 moreScene analysis for robotic watercraft
Scene analysis for robotic watercraft
Virtual earthquake engineering laboratory with physics-based degrading materials on parallel computers
Virtual earthquake engineering laboratory with physics-based degrading materials on parallel computers
DIGITAL PROCESSING FOR FLUOROSCOPY-BASED INTERVERTEBRAL KINEMATIC ANALYSIS
Spinal degenerations can lead to segmental instability that is regarded as a major cause of back pain and is often an important factor in deciding on surgical fusion or prosthesis implant. The spinal kinematics analysis can provide useful information for diagnosis of instability and for the assessment of therapy and surgical treatment or for performance evaluation of disc prostheses. Digitized videofluoroscopy permits to analyze spinal motion during the full patient’s movement, with an acceptable low X-ray dose. By recognizing the vertebrae position on successive fluoroscopic images through manual selection or automated algorithms the relative kinematics between pairs of adjacent vertebrae (i.e. intervertebral kinematics) can be easily estimated. The application of fluoroscopy in the study of spinal kinematics is, however, limited because large errors can occur in the measurements. This thesis presents a comprehensive study of an innovative technique designed to provide a more accurate estimation of intervertebral kinematics. The recognition of vertebrae along the fluoroscopic sequence is implemented using an automated template-matching algorithm and involving a strong enhancement of the outline of vertebrae by resorting to derivative operators. Particular attention is devoted to fluoroscopic noise suppression and to edge-preserving filter design. Spline interpolation of the kinematic data extracted by videofluoroscopy is applied in order to obtain a more complete, continuous description of spinal kinematics and, more specifically, of instantaneous center of rotation. In the introductory part of the thesis (Chapter I and II) the motivation of the study and a survey of spinal measurement techniques are given. The feasibility of videofluoroscopic analysis of spinal motion is extensively discussed. In Chapter III common kinematic parameters (such as range of motion, center of rotation, etc.) utilized for describing intervertebral spinal behaviour are presented, providing particular emphasis on the difficulty to determine a “boundary” between normal and abnormal measures of segmental kinematics for the definition of spinal instability. An extensive review of recent proposals in analysis of segmental motion is reported. Manual recognition of anatomical landmarks in videofluoroscopy can be very problematic. It is also well-known that derivative operators, commonly used for automatic recognition, are highly sensitive to noise. Chapter IV attempts to address this issue: fluoroscopic noise model, also in presence of non-linear gray-level transformations for image enhancement, is presented; various denoising algorithms specifically designed for signal-dependent noise and AWGN are examined and a performance comparison among them is carried out. In Chapter V the proposed algorithm for automated vertebrae recognition is described and its performance is experimentally analyzed on fluoroscopic images of a calibration model. A comparison with a manual selection procedure and other automated algorithms on real lumbar fluoroscopic sequences is presented. In Chapter VI a continuous-time description of intervertebral motion by cubic smoothing spline interpolation is presented and the evaluation of instantaneous center of rotation of spinal motion segments by videofluoroscopy is discussed.
Read moreRobust template based corner detection algorithms for robotic vision
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.
Read more時間-空間-都卜勒超寬頻系統(UWB)設計應用於漸褪頻道
In this thesis, we cope with the fundamental mathematical and physical problems of the space-time-Doppler UWB system design for fading channels: multi-input multi-output (MIMO) wireless communication with adaptive filtering. The estimation algorithm from equalizer providing an accurate parameters estimate is investigated. UWB radio is a fast emerging technology with uniquely attractively features inviting major advances in wireless communications, networking, radar, imaging, and positioning systems. By its rule-making proposal in 2002, the Federal Communications Commission (FCC) in the United States essentially unleashed huge new bandwidth (3.6-10.6 GHz) at the noise floor, where UWB radios overlaying coexistence RF systems cerate using low-power ultra-short information bearing pulses. Right now, there are three basic types of UWB: multiband OFDM UWB (MB-OFDM UWB), impulse-UWB (I-UWB), and direct sequence UWB (DS-UWB). We focus on I-UWB and MB-OFDM-UWB, and compare their performance. A simple means for spreading the spectrum of low duty cycle pulse trains is time hopping (TH), with pulse position modulation (PPM) for data modulation at the rate of many pulses per data bit. The main contribution of this thesis for I-UWB is the design of leading edge detectors, coherent correlation detector (CCD), and pilot performance enhancement compared with different Rayleigh and Ricean fading conditions. For MB-OFDM UWB, we have considered the performance analysis and design criteria of MIMO OFDM UWB systems for high data-rate wireless transmission. The signal processing of frame detection, time synchronization, frequency synchronization, channel estimation, synchronization tracking using pilot subcarriers and 2-D MIMO detection algorithms is discussed. The main contributions of this thesis are 1) Compared with receiver employing the Maximum Likelihood (ML) detector, the receiver employing a low-complexity linear Minimum Mean Square Error (MMSE) demodulator can perform a limited performance loss in spatially uncorrelated channels. 2) Due to the operations of spreading and dispreading combined with MMSE-based frequency domain equalization, the adverse effects of the low-SNR subcarriers on the average BER performance are potentially improved. This is a direct consequence of spreading, because even if the signal corresponding to a specific chip is obliterated by a deep frequency domain channel fade, after dispreading these effects are spread over the Walsh-Hadamard Transform (WHT) length. Hence there is a high chance of still recovering all the partially affected subcarrier symbols without errors. 3) As a test case, the OFDM-based 200 Mb/s MB-UWB network (IEEE 802.15.3a) are considered, but the simulation results are shown above section. 4) The simulation channel can be easily applied to NOS and NLOS situation with WHT transformation from Simulink model. The fading channels of UWB with low/high signal to noise ratio (SNR), multipath effects, and multiuser interference may introduce large errors in location. The location engine performs the following tasks: █ Data fusion techniques: Different data fusion techniques are implemented using Time Of Arrival (TOA), Angle Of Arrival (AOA), or a combination of both. █ Channel modeling: A multipath, multiuser channel environment is created that models path loss, shadowing, Rayleigh fading, and Doppler frequency effects. █ Parameter estimation: TOA and AOA estimation algorithms are implemented as part of the location finding engine. Different variations of algorithms are implemented for performance and comparison purposes. █ Configuring the physical layer for different wireless networks. Among the programmable parameters are spreading factor, packet size, training length, constellation type, modulation technique, carrier frequency, level of transmitted signal power, and the number of antennas at the transmitter for both sides. █ Configuring the mobile user conditions. The wireless channel models depend on the Doppler frequencies present in the environment. The Doppler frequency depends on the mobile speed and carrier frequencies as input and generates a Rayleigh fading channel with the U-shape Doppler spectrum. █ Configuring the environmental parameters and network geographical structure. One of the factors affecting the performance of the wireless location system is the environment type (e.g., bad urban, urban, suburban, or rural area). For example, in a bad urban area with many blocking objects and buildings, non-line of sight (NLOS) effects plays an important role in the estimation accuracy.
Read moreParallel and Distributed Computing Techniques, Selection of papers from ISPDC 2008
Dear SCPE Reader, We present a selection of papers which are extensions of papers presented at the 7-th International Symposium on Parallel and Distributed Computing, 1–5 July 2008, in Krakow, Poland. The motivation for publishing the selection in the SCPE Journal was, on the one hand, to present the flavour of the research reported at the conference and on the other hand to present some of the most relevant topics currently focused on the research on parallel and distributed computing in general. The selection contains only 6 papers out of about 60 presented at the conference, and thus, is far from covering all relevant topics represented at the ISPDC 2008. This is because not all of the invited authors were patient enough to accept a fairly long paper publishing process. Nevertheless, we hope that the presented papers will bring you closer to the research covered by the ISPDC conferences and will encourage you to participate in future ISPDC editions. The first paper ``The Impact of Workload Variability on Load Balancing Algorithms'' is by Marta Beltran and Antonio Guzman from King Juan Carlos University in Spain. It concerns an important topic of load balancing in cluster systems, namely adaptativity of the load balancing algorithms to changes of the workload in the system. Adequate accounting for additional load in the hosting system is of great relevance for correct optimization effects. The paper presents a thorough formal analysis of the workload variability metrics and their influence on the quality of load balancing algorithms. Four basic activities appearing in load balancing algorithms are identified, and based on them some algorithmic solutions are proposed to correctly deal with workload variability in system load balancing. The problem of dynamic load balancing algorithms robustness has been discussed. Two different robustness metrics sensitive to the applied type of opimization: local task-oriented or a global one enable selecting task remote execution or migration as load balancing operations. The proposed approach is illustrated with experiments. The second paper ``Model-Driven Engineering and Formal Validation of High-Performance Embedded Systems'' is by Abdoulaye Gamatie, Eric Rutten, Huafeng Yu, Pierre Boulet, Jean-Luc Dekeyser, from University of Lille and INRIA in France. The paper is concerned with a very advanced methodology of designing correct parallel embedded systems for intensive data-parallel computing. In their previous research, the authors of the paper designed the GASPARD embedded system design framework. It is based on the hardware/software co-design approach through model-driven engineering. The framework is based on an UML-like model specification language in which hardware and software elements are modelled using a component approach with special mechanisms for repetitive structures. This paper tries to combine the modelling framework of GASPARD with the mechanisms of synchronous languages to achieve design verifiability provided for such languages. The paper shows how GASPARD models can be translated into synchronous models based on data flow equations in order to formally check their correctness. The proposed approach is illustrated with an example of a video processing system. The third paper ``Relations Between Several Parallel Computational Models'' is by Stephan Bruda and Yuanqiao Zhang from Bishop’s University in Canada. The paper is concerned with theoretical aspects of shared memory systems described by the parallel random access machine PRAM model and aims in studying performance properties of different types of PRAM systems. The attention is focussed on analysing the computational power of two more sophisticated PRAM models (Combining CRCW and Broadcast Selective Reduction), which include data reduction in case of concurrent writes. The paper shows that these two models have equivalent computational power, which is a new result comparing the existing literature. The performance of both models applied to reconfigurable multiple bus machines was studied as a possible architectural solution for current VLSI processor implementations. It was shown that in such systems under reasonable assumptions concurrent-write does not enhance performance comparing the exclusive-write model. Another result important for the VLSI technology is that the Combining CRCW PRAM model (in which data of concurrent writes are arthmetically or logically combined before write) and the exclusive-write on directed reconfigurable busses perform in equivalent way under strong real-time requirements. The fourth paper ``Experiences with Mesh-Like Computations Using Prediction Binary Trees'' is by Gennaro Cordasco, Biagio Cosenza, Rosario de Chiara, Ugo Erra and Vittorio Scarano from the University ``degli Studi'' of Salerno and the University ``degli Studi della Biasilicata'' of Potenza in Italy. The paper concerns optimization methods for mesh-like computations in clusters of processors. The computations are perfomed assuming a phase-like program execution control using a tiling approach which reduces inter-processor communication. A temporal coherence is also assumed, which means that task sizes provide similar execution times in consecutive phases. Temporary coherent computations are structured in a Prediction Binary Tree, in which leaves represent computing tiles to be mapped to processors. A phase-by-phase semi-static load balancing is introduced to the scheduling algorithm. The scheduling algorithm is equipped with a predictor, which estimates the computation time of next phase tiles based on previous execution times and modifies the tiles to achieve balanced execution in phases. For this, two heuristics are used to leverage on data locality in processors. The proposed approach is illustrated by the example of interactive rendering with Parallel Ray Tracing algorithm. The fifth paper ``The Influence of the IBM pSeries Servers Virtualization Mechanism on Dynamic Resource Allocation in AIX 5L'' is by Maciej Mlynski from ASpartner Limited in Poland. The paper concerns a very up-to-date problem of system virtualization and presents the results of research carried on IBM pSeries servers. IBM is strongly developing the virtualization technique especially on IBM pSeries servers enabling an improved and flexible sharing of system resources between applications. The paper investigates novel facilities for dynamic resource management such as micro-partitioning and partition load manager. They enable dynamic creation of workload logical partitions of system resources and their dynamic mangement. It includes run-time resource re-alocation between logical partitions including setting of sharing specifications as well as run-time adding/removing/setting parameters of resources in the system. It remains an open question how to properly tune parameters of the operating system using the provided virtualization facilities to obtain the best efficiency for a given application program. The paper presents the results of experiments which study the effects of tuning the disk subsystem parameters under the IBM AIX 5L operating system with the use of the provided virtualization facilities on the resulting application execution performance. The results show that even small deterioration in the resource pool status requires an immediate adaptation of the operating system parameters to maintain the required performance. The sixth paper ``HeteroPBLAS: A Set of Parallel Basic Linear Algebra Subprograms Optimized for Heterogeneous Computational Clusters'' is by Ravi Reddy, Alexey Lastovetsky and Pedro Alonso from University College Dublin in Ireland and Polytechnic University of Valencia in Spain. The paper concerns the methodology for parallelization of linear algebra computations for execution in heterogeneous cluster environments. The design of the HeteroPBLAS library (Parallel Basic Linear Algebra Subprograms) for heterogeneous computational clusters is presented. The main contribution of the paper is the automation of the parallelization and optimization of the PBLAS, which is done by means of a special user interface and the underlying set of functions. An important element is here a performance model that is based on program code instrumentation, which determines parameters of the application and the executive heterogeneous platform relevant for execution performance of parallel code. The parameter values specified for or returned by execution of the performance model functions are next used for generation and optimal mapping of the parallel code of the library subroutines. The proposed approach is illustrated by experimental results of execution of optimized HeteroPBLAS programs on homogeneous and heterogeneous computing clusters. Marek Tudruj
Read moreMachinery Prognostic Method Based on Multi-Class Support Vector Machines and Hybrid Differential Evolution – Particle Swarm Optimization
Recently, focus on maintenance strategies has been shifted towards prognostic health management (PHM) and a number of state of the art algorithms based on data-driven prognostics have been developed to predict the health states of degrading components based on sensory data. Amongst these algorithms, Multiclass Support Vector Machines (MC-SVM) has gained popularity due to its relatively high classification accuracy, ability to classify multiple patterns and capability to handle noisy / incomplete data. However, its application is limited by the difficulty in determining the required kernel function and penalty parameters. To address this problem, this paper proposes a hybrid differential evolution – particle swarm optimization (DE-PSO) algorithm to optimize the MC-SVM kernel function and penalty parameters. The differential algorithm (DE) obtains the search limit for the SVM parameters, while the particle swarm optimization algorithm (PSO) determines the global optimum parameters for a given training data set. Since degrading machinery components display several degradation stages in their lifetime, the MC-SVM trained with optimum parameters are used to estimate the health states of a degrading machinery component, from which the remaining useful life (RUL) is predicted. This method improves the classification accuracy of MC-SVM in predicting the health states of a machinery component and consequently increases the accuracy of RUL predictions. The feasibility of the method is validated using bearing prognostic run-to-failure data obtained from NASA public data repository. A comparative study between MC-SVM with parameters obtained using simple grid search with n-fold cross validation and MC- SVM with DE-PSO based on prognostic performance metrics reveals that the proposed method has better performance, with all the cases considered falling within a 10 % error margin. The method also outperforms other soft computing methods proposed in literature.
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 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 morePattern transformation-invariant schemes for wireless sensor networks based on an edge detection gradient-based mechanism
Pattern transformation-invariant schemes for wireless sensor networks based on an edge detection gradient-based mechanism
Read moreOptimization of Ferrite Number of Solution Annealed Duplex Stainless Steel Claddings Using Integrated Artificial Neural Network – Genetic Algorithm
Cladding is the most economical process used on the surface of low carbon structural steel to improve the corrosion resistance. The corrosion resistant property is based on the amount of ferrite present in the clad layer. Generally, the ferrite content present in the layer is expressed in terms of ferrite number (FN). The optimum range of ferrite number plays an instrumental role to bring adequate surface properties like chloride stress corrosion cracking resistance, pitting and crevice corrosion resistance and mechanical properties. For achieving maximum economy and enhanced life, duplex stainless steel (E2209T1-4/1) is deposited on the surface of low carbon structural steel of IS: 2062. The problem faced in the weld cladding towards achieving the required amount of ferrite number is the selection of an optimum combination of input process parameters (welding current, welding speed, contact tip to specimen distance and gun angle). This paper mainly concentrates on estimating FN and analysis of input process parameters on FN of heat treated duplex stainless steel cladding. To predict FN, mathematical equations was developed based on four factor five level central composite rotatable design with full replication using regression methods. In this paper, artificial neural network (ANN) and genetic algorithm (GA) techniques were integrated and labeled as ANN-GA to identify the optimum process parameters in FCAW to get maximum FN. From the results, the integrated ANN-GA (I OR II) is capable of giving maximum FN at optimum process parameters compared to that of experimental, regression and ANN modeling
Read more