Point pattern matching is an important topic in the field of computervision and patternrecognition. Currently most palmprints automatic recognition methods are only suitable for the online palmprints or full palmpri...
详细信息
ISBN:
(纸本)9781615677214
Point pattern matching is an important topic in the field of computervision and patternrecognition. Currently most palmprints automatic recognition methods are only suitable for the online palmprints or full palmprints. In the practical applications, it have to use high-quality matching method to deal with the full and part palmprints, online and off-line palmprints, different quality of images, and massive samples. To achieve the accurate matching and meet the requirements, this paper proposes a multi-phases point pattern matching method based on both of the local structure and global feature. This method designs a reasonable score mechanism to distinguish the reliability of the candidates. The test on the speed and accuracy shows that the performance of this robust method which can meet the requirements of the practical applications is satisfactory.
This paper presents an analysis of the design of classifiers for use in a hierarchical object recognition approach. In this approach, a cascade of classifiers is arranged in a tree in order to recognize multiple objec...
详细信息
This paper presents an analysis of the design of classifiers for use in a hierarchical object recognition approach. In this approach, a cascade of classifiers is arranged in a tree in order to recognize multiple object classes. We are interested in the problem of recognizing multiple patterns as it is closely related to the problem of locating an articulated object. Each different pattern class corresponds to the hand in a different pose, or set of poses. For this problem obtaining labelled training data of the hand in a given pose can be problematic. Given a parametric 3D model, generating training data in the form of example images is cheap, and we demonstrate that it can be used to design classifiers almost as good as those trained using non-synthetic data. We compare a variety of different template-based classifiers and discuss their merits. (C) 2006 Elsevier B.V. All rights reserved.
This paper presents a methodology for the automatic segmentation of rock-scenes using a combination of range and intensity vision. A major problem in rock scene segmentation is the effect of noise in the form of surfa...
详细信息
ISBN:
(纸本)9783540767244
This paper presents a methodology for the automatic segmentation of rock-scenes using a combination of range and intensity vision. A major problem in rock scene segmentation is the effect of noise in the form of surface texture and color density variations, which causes spurious segmentations. We show that these problems can be avoided through pre-attentive range image segmentation followed by focused attention to edges. The segmentation process is inspired by the Human Visual System's operation of using a priori knowledge from pre-attentive vision for focused attention detail. The result is good rock detection and boundary accuracy that can be attributed to independence of range data to texture and color density variations, and knowledge driven intensity edge detection respectively. Preliminary results on a limited image data-set are promising.
A new vision-based road boundary detection algorithm combining dynamic programming and Hough transform is proposed. The Dynamic programming (DP) is known to be a powerful algorithm for optimal path finding on the cost...
详细信息
ISBN:
(纸本)9781601320438
A new vision-based road boundary detection algorithm combining dynamic programming and Hough transform is proposed. The Dynamic programming (DP) is known to be a powerful algorithm for optimal path finding on the cost field. Utilizing the trace of edge as costs of the DP, most likely road boundaries are obtained in this paper. The results of DP are further utilized as a spatial filter which removes the weak candidates as road boundaries. Hough Transform is applied on the filtered edge image to detect more practical road boundaries with straight line segments. Experimental results about road images under the environment with shadow, unmarked road painting and illumination variations in real road conditions are included.
Visual CAPTCHAs have been widely used across the Internet to defend against undesirable or malicious bot programs. In this paper, we document how we have broken most such visual schemes provided at Captchaservice. org...
详细信息
ISBN:
(纸本)9780769530604
Visual CAPTCHAs have been widely used across the Internet to defend against undesirable or malicious bot programs. In this paper, we document how we have broken most such visual schemes provided at Captchaservice. org, a publicly available web service for CAPTCHA generation. These schemes were effectively resistant to attacks conducted using a high-quality Optical Character recognition program, but were broken with a near 100% success rate by our novel attacks. In contrast to early work that relied on sophisticated computervision or machine learning algorithms, we used simple patternrecognition algorithms but exploited fatal design errors that we discovered in each scheme. Surprisingly, our simple attacks can also break many other schemes deployed on the Internet at the time of writing: their design had similar errors. We also discuss defence against our attacks and new insights on the design of visual CAPTCHA schemes.
The goal of this paper is to detect points of interest within the output data resulting from a simulation of the Astrophysics N-Bodied problem. Prior to data analysis, we must first apply some form of some preliminary...
详细信息
ISBN:
(纸本)9781601320438
The goal of this paper is to detect points of interest within the output data resulting from a simulation of the Astrophysics N-Bodied problem. Prior to data analysis, we must first apply some form of some preliminary data mining techniques since, for the purpose of this investigation, we are only interested in a subset of the data. The output of the simulation is on the order of tens of Gigabytes. Since this amount is too large to visually represent everything, this analysis can be used to yield useful results that can be applied in general to the raw data in order to illuminate areas of interest. After filtering, Morphological Processing techniques are applied to the visualized data in order to detect areas of interest within the original data. Using the VRAD system we can find and track regions of interest over time.
This paper proposes a system to estimate the 3D position and velocity of vehicles, from images acquired with a monocular camera. Given image regions where vehicles are detected, Gaussian distributions are estimated de...
详细信息
ISBN:
(纸本)9783540728467
This paper proposes a system to estimate the 3D position and velocity of vehicles, from images acquired with a monocular camera. Given image regions where vehicles are detected, Gaussian distributions are estimated detailing the most probable 3D road regions where vehicles lay. This is done by combining an assumed image formation model with the Unscented Transform mechanism. These distributions are then fed into a Multiple Hypothesis Tracking algorithm, which constructs trajectories coherent with an assumed model of dynamics. This algorithm not only characterizes the dynamics of detected vehicles, but also discards false detections, as they do not find spatio-temporal support. The proposals is tested in synthetic sequences, evaluating how noisy observations and miss-detections affect the accuracy of recovered trajectories.
Part structure and articulation are of fundamental importance in computer and human vision. We propose using the inner-distance to build shape descriptors that are robust to articulation and capture part structure. Th...
详细信息
Part structure and articulation are of fundamental importance in computer and human vision. We propose using the inner-distance to build shape descriptors that are robust to articulation and capture part structure. The inner-distance is defined as the length of the shortest path between landmark points within the shape silhouette. We show that it is articulation insensitive and more effective at capturing part structures than the Euclidean distance. This suggests that the inner-distance can be used as a replacement for the Euclidean distance to build more accurate descriptors for complex shapes, especially for those with articulated parts. In addition, texture information along the shortest path can be used to further improve shape classification. With this idea, we propose three approaches to using the inner-distance. The first method combines the inner-distance and multidimensional scaling (MDS) to build articulation invariant signatures for articulated shapes. The second method uses the inner-distance to build a new shape descriptor based on shape contexts. The third one extends the second one by considering the texture information along shortest paths. The proposed approaches have been tested on a variety of shape databases, including an articulated shape data set, MPEG7 CE-Shape-1, Kimia silhouettes, the ETH-80 data set, two leaf data sets, and a human motion silhouette data set. In all the experiments, our methods demonstrate effective performance compared with other algorithms.
Mean-Shift tracking gained a lot of popularity in computervision community. This is due to its simplicity and robustness. However, the original formulation does not estimate the orientation of the tracked object. In ...
详细信息
ISBN:
(纸本)9783540742586
Mean-Shift tracking gained a lot of popularity in computervision community. This is due to its simplicity and robustness. However, the original formulation does not estimate the orientation of the tracked object. In this paper, we extend the original mean-shift tracker for orientation estimation. We use the gradient field as an orientation signature and introduce an efficient representation of the gradient-orientation space to speed-up the estimation. No additional parameter is required and the additional processing time is insignificant. The effectiveness of our method is demonstrated on typical sequences.
This paper presents a two-step algorithm to perform automatic extraction of vessel tree on angiogram. Firstly, the approximate vessel centerline is modeled as marked point process with each point denoting a line segme...
详细信息
ISBN:
(纸本)9783540741954
This paper presents a two-step algorithm to perform automatic extraction of vessel tree on angiogram. Firstly, the approximate vessel centerline is modeled as marked point process with each point denoting a line segment. A Double Area prior model is proposed to incorporate the geometrical and topological constraints of segments through potentials on the interaction and the type of segments. Data likelihood allows for the vesselness of the points which the segment covers, which is computed through the Hessian matrix of the image convolved with 2-D Gaussian filter at multiple scales. Optimization is realized by simulated annealing scheme using a Reversible Jump Markov Chain Monte Carlo (RJMCMC) algorithm. Secondly, the extracted approximate vessel centerline, containing global geometry shape as well as location information of vessel, is used as important guide to explore the accurate vessel edges by combination with local gradient information of angiogram. This is implemented by morphological homotopy modification and watershed transform on the original gradient image. Experimental results of clinical digitized coronary angiogram are reported.
暂无评论