Mean shift is an effective iterative algorithm widely used in computervision community. However, to our knowledge, its convergence, a key aspect of any iterative algorithm, has not been rigorously proved up to now. I...
详细信息
Mean shift is an effective iterative algorithm widely used in computervision community. However, to our knowledge, its convergence, a key aspect of any iterative algorithm, has not been rigorously proved up to now. In this paper, by further imposing some commonly acceptable conditions, its convergence is proved. (c) 2006 Published by Elsevier Ltd on behalf of patternrecognition Society.
Planar mapped trajectories (curves composed of time-stamped points) matching differs to other planar curves correspondence in stereo vision. Most methods proposed for general planar curves matching are not much suitab...
详细信息
ISBN:
(纸本)9780819469526
Planar mapped trajectories (curves composed of time-stamped points) matching differs to other planar curves correspondence in stereo vision. Most methods proposed for general planar curves matching are not much suitable for it. In this paper, a new coarse-to-fine method for planar trajectories is proposed;some physical constraints such as time, height, speed limitation and continuousness of aerocraft trajectories are used to make matching process more reasonable. Similarity Measures between left and right images planar trajectories are calculated for matching, flight trajectories are reconstructed at last, and reconstruction error is also discussed at last.
A novel algorithm for matching synthetic aperture radar (SAR) image to Optical image based on lineal feature using Hausdorff distance combined with genetic algorithm is proposed in this paper. A new method is presente...
详细信息
ISBN:
(纸本)9780819469526
A novel algorithm for matching synthetic aperture radar (SAR) image to Optical image based on lineal feature using Hausdorff distance combined with genetic algorithm is proposed in this paper. A new method is presented to extract lineal feature from low signal to noise ratio (SNR) SAR image. Based on the edge image from SAR and Optical image, modified Hausdorff distance is adopted as a similarity measure because it is insensitive to noise. Genetic algorithm is used as searching strategy to achieve high computation speed for its inertial parallel. Experimental results using real SAR and Optical images demonstrate that the algorithm is robust, fast and can achieve high matching accuracy.
Image rectification reduce the search space from 2-dimension to 1-dimension and improve the searching efficiency of stereo matching algorithm greatly. In this paper, a simple and convenient method, which fully conside...
详细信息
ISBN:
(纸本)9780819498045
Image rectification reduce the search space from 2-dimension to 1-dimension and improve the searching efficiency of stereo matching algorithm greatly. In this paper, a simple and convenient method, which fully considered image sequence of monocular motion vision, is proposed to rectify the calibrated image sequence. The method is based on coordinate system transformation, which can avoid the mass and complex computations, and the method rectifies image sequence (three images) at once, which is efficient in image sequence processing. In this method, the rectification is composed of several steps. Firstly, we establish a reference coordinate system by three movement position. The Z axis of the reference coordinate system o_XYZ is the normal vector of the plane which three positions located. The direction of X axis coincides with the baseline from position 2 to position 1. We set Y axis according to right-hand principle. Secondly, we set the x axis and z axis of reference image space coordinate system o_xyz coincides with the X axis and Z axis of the reference coordinate system, and the y axis is set to coincide with the line from position 2 to position 3. Finally, we deduce a homography matrix to realize the image rectification. Both image data and computer simulation data show that the method is an effective rectification method.
There are a large number of fuzzy concepts and fuzzy phenomena in traditional Chinese medicine, which have led to great difficulties for study of traditional Chinese medicine. In this paper, the mathematical methods a...
详细信息
We develop a novel approach for object detection and location task. This paper proposed a novel method to represent local regions around keypoints, called lifetime. Lifetime of a keypoint is used to describe its stabi...
详细信息
Rice yield estimation is an important aspect in the agriculture research field. For the rice yield estimation, rice density is one of its useful factors. In this paper, we propose a new method to automatically detect ...
详细信息
ISBN:
(纸本)9780819498045
Rice yield estimation is an important aspect in the agriculture research field. For the rice yield estimation, rice density is one of its useful factors. In this paper, we propose a new method to automatically detect the rice density from the rice transplanting stage to rice jointing stage. It devotes to detect rice planting density by image low-level features of the rice image sequences taken in the fields. Moreover, a rice jointing stage automatic detection method is proposed so as to terminate the rice density detection algorithm. The validities of the proposed rice density detection method and the rice jointing stage automatic detection method are proved in the experiment.
An airborne vehicle must avoid obstacles like towers, fences, tree branches, mountains and building across the flight path. So the ability to detect and locate obstacles using on-board sensors is an essential step in ...
详细信息
Location measurement of 3D point in stereo vision is subjected to different sources of uncertainty that propagate to the final result. For current methods of error analysis, most of them are based on ideal intersectio...
详细信息
ISBN:
(纸本)9781510600546
Location measurement of 3D point in stereo vision is subjected to different sources of uncertainty that propagate to the final result. For current methods of error analysis, most of them are based on ideal intersection model to calculate the uncertainty region of point location via intersecting two fields of view of pixel that may produce loose bounds. Besides, only a few of sources of error such as pixel error or camera position are taken into account in the process of analysis. In this paper we present a straightforward and available method to estimate the location error that is taken most of source of error into account. We summed up and simplified all the input errors to five parameters by rotation transformation. Then we use the fast algorithm of midpoint method to deduce the mathematical relationships between target point and the parameters. Thus, the expectations and covariance matrix of 3D point location would be obtained, which can constitute the uncertainty region of point location. Afterwards, we turned back to the error propagation of the primitive input errors in the stereo system and throughout the whole analysis process from primitive input errors to localization error. Our method has the same level of computational complexity as the state-of-the-art method. Finally, extensive experiments are performed to verify the performance of our methods.
This paper proposed a model for 2.1D sketch based on primalsketch [6,7] and a corresponding algorithm based on SWC(Swendsen-Wang Cut)[1,2]. Given a primal sketch graph, all boundaries' color and curvature informat...
详细信息
ISBN:
(纸本)9780819469526
This paper proposed a model for 2.1D sketch based on primalsketch [6,7] and a corresponding algorithm based on SWC(Swendsen-Wang Cut)[1,2]. Given a primal sketch graph, all boundaries' color and curvature information can be gotten from the dictionary of image primitives of the primal sketch. Suppose all curves in the sketch graph can be combined into closed contours and then contour can be combined into regions. Calculating boundaries similarity energy of two regions by comparing the comparability using the color and curvature information of boundaries, then the energy is regarded as the proposal of SWC. All regions are regarded as nodes of graph space, then the 2.1D sketch problem can be looked as graph partition problem. In each step, all curves will be reorganized into contours and then contours generate regions. Some experiment results based on above model and algorithm are given in the paper.
暂无评论