Target classification using SIFT sequence scale invariants

On the basis of scale invariant feature transform（SIFT） descriptors,a novel kind of local invariants based on SIFT sequence scale（SIFT-SS） is proposed and applied to target classification.First of all,the merits of using an SIFT algorithm for target classification are discussed.Secondly,the scales of SIFT descriptors are sorted by descending as SIFT-SS,which is sent to a support vector machine（SVM） with radial based function（RBF） kernel in order to train SVM classifier,which will be used for achieving target classification.Experimental results indicate that the SIFT-SS algorithm is efficient for target classification and can obtain a higher recognition rate than affine moment invariants（AMI） and multi-scale auto-convolution（MSA） in some complex situations,such as the situation with the existence of noises and occlusions.Moreover,the computational time of SIFT-SS is shorter than MSA and longer than AMI.

Feature Scale Simulation of PECVD of SiO_2 in SiH_4/N_2O Mixture

In this paper, to simulate the process of PECVD （plasma enhanced chemical vapor deposition） of SiO2, the plasma chemistry and plasma density of SiH4/N2O mixture have been studied with an inductive coupled plasma model, and the level set methodology has been used to obtain the feature scale variation during the process. In this simulation, the goal is to fill a trench. We studied how ion sputtering and chamber pressure affect the feature scale model. After the simulation, we found that the trench will close up at the top after a few steps, and if we add the ion sputtering into the surface reactions, the trench top will close up a little later. When the chamber pressure is improved, the plasma density will increase, so the trench top will close up earlier. In semiconductor device manufacture, people can control the trench＇s feature scale through adjusting these two parameters.

Robust Radiometric Normalization of the near Equatorial Satellite Images Using Feature Extraction and Remote Sensing Analysis

Relative radiometric normalization (RRN) minimizes radiometric differences among images caused by inconsistencies of acquisition conditions rather than changes in surface. Scale invariant feature transform (SIFT) has the ability to automatically extract control points (CPs) and is commonly used for remote sensing images. However, its results are mostly inaccurate and sometimes contain incorrect matching caused by generating a small number of false CP pairs. These CP pairs have high false alarm matching. This paper presents a modified method to improve the performance of SIFT CPs matching by applying sum of absolute difference (SAD) in a different manner for the new optical satellite generation called near-equatorial orbit satellite and multi-sensor images. The proposed method, which has a significantly high rate of correct matches, improves CP matching. The data in this study were obtained from the RazakSAT satellite a new near equatorial satellite system. The proposed method involves six steps: 1) data reduction, 2) applying the SIFT to automatically extract CPs, 3) refining CPs matching by using SAD algorithm with empirical threshold, and 4) calculation of true CPs intensity values over all image’ bands, 5) preforming a linear regression model between the intensity values of CPs locate in reverence and sensed image’ bands, 6) Relative radiometric normalization conducting using regression transformation functions. Different thresholds have experimentally tested and used in conducting this study (50 and 70), by followed the proposed method, and it removed the false extracted SIFT CPs to be from 775, 1125, 883, 804, 883 and 681 false pairs to 342, 424, 547, 706, 547, and 469 corrected and matched pairs, respectively.

Color Correction for Multi-view Video Using Energy Minimization of View Networks

Systems using numerous cameras are emerging in many fields due to their ease of production and reduced cost, and one of the fields where they are expected to be used more actively in the near future is in image-based rendering （IBR）. Color correction between views is necessary to use multi-view systems in IBR to make audiences feel comfortable when views are switched or when a free viewpoint video is displayed. Color correction usually involves two steps： the first is to adjust camera parameters such as gain, brightness, and aperture before capture, and the second is to modify captured videos through image processing. This paper deals with the latter, which does not need a color pattern board. The proposed method uses scale invariant feature transform （SIFT） to detect correspondences, treats RGB channels independently, calculates lookup tables with an energy-minimization approach, and corrects captured video with these tables. The experimental results reveal that this approach works well.

Modified SIFT descriptor and key-point matching for fast and robust image mosaic

To improve the performance of the scale invariant feature transform （ SIFT）, a modified SIFT （M-SIFT） descriptor is proposed to realize fast and robust key-point extraction and matching. In descriptor generation, 3 rotation-invariant concentric-ring grids around the key-point location are used instead of 16 square grids used in the original SIFT. Then, 10 orientations are accumulated for each grid, which results in a 30-dimension descriptor. In descriptor matching, rough rejection mismatches is proposed based on the difference of grey information between matching points. The per- formance of the proposed method is tested for image mosaic on simulated and real-worid images. Experimental results show that the M-SIFT descriptor inherits the SIFT＇ s ability of being invariant to image scale and rotation, illumination change and affine distortion. Besides the time cost of feature extraction is reduced by 50% compared with the original SIFT. And the rough rejection mismatches can reject at least 70% of mismatches. The results also demonstrate that the performance of the pro- posed M-SIFT method is superior to other improved SIFT methods in speed and robustness.

Image matching algorithm based on SIFT using color and exposure information

Image matching based on scale invariant feature transform（SIFT） is one of the most popular image matching algorithms, which exhibits high robustness and accuracy. Grayscale images rather than color images are generally used to get SIFT descriptors in order to reduce the complexity. The regions which have a similar grayscale level but different hues tend to produce wrong matching results in this case. Therefore, the loss of color information may result in decreasing of matching ratio. An image matching algorithm based on SIFT is proposed, which adds a color offset and an exposure offset when converting color images to grayscale images in order to enhance the matching ratio. Experimental results show that the proposed algorithm can effectively differentiate the regions with different colors but the similar grayscale level, and increase the matching ratio of image matching based on SIFT. Furthermore, it does not introduce much complexity than the traditional SIFT.

An Approach to Parallelization of SIFT Algorithm on GPUs for Real-Time Applications

Scale Invariant Feature Transform (SIFT) algorithm is a widely used computer vision algorithm that detects and extracts local feature descriptors from images. SIFT is computationally intensive, making it infeasible for single threaded im-plementation to extract local feature descriptors for high-resolution images in real time. In this paper, an approach to parallelization of the SIFT algorithm is demonstrated using NVIDIA’s Graphics Processing Unit (GPU). The parallel-ization design for SIFT on GPUs is divided into two stages, a) Algorithm de-sign-generic design strategies which focuses on data and b) Implementation de-sign-architecture specific design strategies which focuses on optimally using GPU resources for maximum occupancy. Increasing memory latency hiding, eliminating branches and data blocking achieve a significant decrease in aver-age computational time. Furthermore, it is observed via Paraver tools that our approach to parallelization while optimizing for maximum occupancy allows GPU to execute memory bound SIFT algorithm at optimal levels.

Wide-baseline stereo matching based on multiple views

To solve the problem of wide-baseline stereo image matching based on multiple cameras,the paper puts forward an image matching method of combining maximally stable extremal regions (MSER) with Scale Invariant Feature Transform (SIFT) . It uses MSER to detect feature regions instead of difference of Gaussian. After fitted into elliptical regions,those regions will be normalized into unity circles and represented with SIFT descriptors. The method estimates fundamental matrix and removes outliers by auto-maximum a posteriori sample consensus after initial matching feature points. The experimental results indicate that the method is robust to viewpoint changes,can reduce computational complexity effectively and improve matching accuracy.

Research on will-dimension SIFT algorithms for multi-attitude face recognition

The results of face recognition are often inaccurate due to factors such as illumination,noise intensity,and affine/projection transformation.In response to these problems,the scale invariant feature transformation(SIFT) is proposed,but its computational complexity and complication seriously affect the efficiency of the algorithm.In order to solve this problem,SIFT algorithm is proposed based on principal component analysis(PCA) dimensionality reduction.The algorithm first uses PCA algorithm,which has the function of screening feature points,to filter the feature points extracted in advance by the SIFT algorithm;then the high-dimensional data is projected into the low-dimensional space to remove the redundant feature points,thereby changing the way of generating feature descriptors and finally achieving the effect of dimensionality reduction.In this paper,through experiments on the public ORL face database,the dimension of SIFT is reduced to 20 dimensions,which improves the efficiency of face extraction;the comparison of several experimental results is completed and analyzed to verify the superiority of the improved algorithm.

Scale characters analysis for gully structure in the watersheds of loess landforms based on digital elevation models

Scale is the basic attribute for expressing anddescribing spatial entity and phenomena. It offerstheoretical significance in the study of gully structureinformation, variable characteristics of watershed mor-phology, and development evolution at different scales.This research selected five different areas in China＇s LoessPlateau as the experimental region and used DEM data atdifferent scales as the experimental data. First, the changerule of the characteristic parameters of the data at differentscales was analyzed. The watershed structure informationdid not change along with a change in the data scale. Thiscondition was proven by selecting indices of gullybifurcation ratio and fractal dimension as characteristicparameters of watershed structure information. Then, thechange rule of the characteristic parameters of gullystructure with different analysis scales was analyzed bysetting the scale sequence of analysis at the extractiongully. The gully structure of the watershed changed withvariations in the analysis scale, and the change rule wasobvious when the gully level changed. Finally, the changerule of the characteristic parameters of the gully structure atdifferent areas was analyzed. The gully fractal dimensionshowed a significant numerical difference in differentareas, whereas the variation of the gully branch ratio wassmall. The change rule indicated that the developmentdegree of the gully obviously varied in different regions,but the morphological structure was basically similar.

The Improved Characteristics of Bionic Gabor Representations by Combining with SIFT Key-points for Iris Recognition

Gabor filters are generally regarded as the most bionic filters corresponding to the visual perception of human. Their filtered coefficients thus are widely utilized to represent the texture information of irises. However, these wavelet-based iris representations are inevitably being misaligned in iris matching stage. In this paper, we try to improve the characteristics of bionic Gabor representations of each iris via combining the local Gabor features and the key-point descriptors of Scale Invariant Feature Transformation （SIFT）, which respectively simulate the process of visual object class recognition in frequency and spatial domains. A localized approach of Gabor features is used to avoid the blocking effect in the process of image division, meanwhile a SIFT key point selection strategy is provided to remove the noises and probable misaligned key points. For the combination of these iris features, we propose a support vector regression based fusion rule, which may fuse their matching scores to a scalar score to make classification decision. The experiments on three public and self-developed iris datasets validate the discriminative ability of our multiple bionic iris features, and also demonstrate that the fusion system outperforms some state-of-the-art methods.

Optical flow based guidance system design for semi-strapdown image homing guided missiles

This paper focuses mainly on semi-strapdown image homing guided （SSIHG） system design based on optical flow for a six-degree-of-freedom （6-DOF） axial-symmetric skid-to-turn missile. Three optical flow algorithms suitable for large displacements are introduced and compared. The influence of different displacements on computational accuracy of the three algorithms is analyzed statistically. The total optical flow of the SSIHG missile is obtained using the Scale Invariant Feature Transform （SIFT） algorithm, which is the best among the three for large displacements. After removing the rotational optical flow caused by rotation of the gimbal and missile body from the total optical flow, the remaining translational optical flow is smoothed via Kalman filtering. The circular navigation guidance （CNG） law with impact angle constraint is then obtained utilizing the smoothed translational optical flow and position of the target image. Simulations are carried out under both disturbed and undisturbed conditions, and results indicate the proposed guidance strategy for SSIHG missiles can result in a precise target hit with a desired impact angle without the need for the time-to-go parameter.

Image Forgery Detection Using Segmentation and Swarm Intelligent Algorithm

Small or smooth cloned regions are difficult to be detected in image copy-move forgery （CMF） detection. Aiming at this problem, an effective method based on image segmentation and swarm intelligent （SI） algorithm is proposed. This method segments image into small nonoverlapping blocks. A calculation of smooth degree is given for each block. Test image is segmented into independent layers according to the smooth degree. SI algorithm is applied in finding the optimal detection parameters for each layer. These parameters are used to detect each layer by scale invariant features transform （SIFT）-based scheme, which can locate a mass of keypoints. The experimental results prove the good performance of the proposed method, which is effective to identify the CMF image with small or smooth cloned region.

SWF-SIFT Approach for Infrared Face Recognition

The scale invariant feature transform （SIFT） feature descriptor is invariant to image scale and location, and is robust to affine transformations and changes in illumination, so it is a powerful descriptor used in many applications, such as object recognition, video tracking, and gesture recognition. However, in noisy and non-rigid object recognition applications, especially for infrared human face recognition, SIFT-based algorithms may mismatch many feature points. This paper presents a star-styled window filter-SIFT （SWF-SIFT） scheme to improve the infrared human face recognition performance by filtering out incorrect matches. Performance comparisons between the SIFT and SWF-SIFT algorithms show the advantages of the SWF-SIFT algorithm through tests using a typical infrared human face database.

Super-resolution enhancement of UAV images based on fractional calculus and POCS

A super-resolution enhancement algorithm was proposed based on the combination of fractional calculus and Projection onto Convex Sets(POCS)for unmanned aerial vehicles(UAVs)images.The representative problems of UAV images including motion blur,fisheye effect distortion,overexposed,and so on can be improved by the proposed algorithm.The fractional calculus operator is used to enhance the high-resolution and low-resolution reference frames for POCS.The affine transformation parameters between low-resolution images and reference frame are calculated by Scale Invariant Feature Transform(SIFT)for matching.The point spread function of POCS is simulated by a fractional integral filter instead of Gaussian filter for more clarity of texture and detail.The objective indices and subjective effect are compared between the proposed and other methods.The experimental results indicate that the proposed method outperforms other algorithms in most cases,especially in the structure and detail clarity of the reconstructed images.

Detecting Designated Building Areas From Remote Sensing Images Using Hierarchical Structural Constraints

Automatic detection of a designated building area(DBA)is a research hotspot in the field of target detection using remote sensing images.Target detection is urgently needed for tasks such as illegal building monitoring,dynamic land use monitoring,antiterrorism efforts,and military reconnaissance.The existing detection methods generally have low efficiency and poor detection accuracy due to the large size and complexity of remote sensing scenes.To address the problems of the current detection methods,this paper presents a DBA detection method that uses hierarchical structural constraints in remote sensing images.Our method was conducted in two main stages.(1)During keypoint generation,we proposed a screening method based on structural pattern descriptors.The local pattern feature of the initial keypoints was described by a multilevel local pattern histogram(MLPH)feature;then,we used one-class support vector machine(OC-SVM)merely to screen those building attribute keypoints.(2)To match the screened keypoints,we proposed a reliable DBA detection method based on matching the local structural similarities of the screened keypoints.We achieved precise keypoint matching by calculating the similarities of the local skeletal structures in the neighboring areas around the roughly matched keypoints to achieve DBA detection.We tested the proposed method on building area sets of different types and at different time phases.The experimental results show that the proposed method is both highly accurate and computationally efficient.