It is shown that the color histogram has an even closer relationship to scene properties than has been previously described. Color histograms have identifiable features that relate in a precise mathematical way to sce...
详细信息
It is shown that the color histogram has an even closer relationship to scene properties than has been previously described. Color histograms have identifiable features that relate in a precise mathematical way to scene properties. Object color and illumination color are the most obvious properties that are related to color distribution, and their extraction has already been described. It is shown here that the histogram of color variation may be further exploited to relate its shape to surface roughness and imaging geometry. An understanding of these features allows an improved estimate of illumination color and object color to be made.< >
In this work we present a discriminative codebook weighting approach for action detection. We learn global and local weights for the codewords by considering the spatio-temporal Hough voting space of the training sequ...
详细信息
In this work we present a discriminative codebook weighting approach for action detection. We learn global and local weights for the codewords by considering the spatio-temporal Hough voting space of the training sequences. In contrast to the Implicit Shape Model (ISM) where all the codewords that are matched to a local descriptor cast votes with uniform weights, we learn local weights for the matched codewords. In order to learn the local weights we employ Locality-constrained Linear Coding (LLC). Further, we formulate the learning of the global weights as a convex quadratic programming and use alternating optimization to solve for the weights. We demonstrate the performance of the algorithm on KTH action dataset where we compare with the Hough detector using kmeans codebook.
A formal representation of corner and vertex detection is presented. In particular, an analytical study is presented which allows one to know exactly what the behavior is of a detector around trihedral vertices. It is...
详细信息
A formal representation of corner and vertex detection is presented. In particular, an analytical study is presented which allows one to know exactly what the behavior is of a detector around trihedral vertices. It is shown that near three surfaces, two elliptic maxima of DET exist, and their location is inside extremal contrast surface. The intermediate surface always shows a hyperbolic minima. It is shown that the detector allows to find the exact position of vertex. The approach proposed has been tested on many noisy synthetic data and real images and its robustness seems promising.< >
We propose a method for deblurring of spatially variant object motion. A principal challenge of this problem is how to estimate the point spread function (PSF) of the spatially variant blur. Based on the projective mo...
详细信息
We propose a method for deblurring of spatially variant object motion. A principal challenge of this problem is how to estimate the point spread function (PSF) of the spatially variant blur. Based on the projective motion blur model of, we present a blur estimation technique that jointly utilizes a coded exposure camera and simple user interactions to recover the PSF. With this spatially variant PSF, objects that exhibit projective motion can be effectively de-blurred. We validate this method with several challenging image examples.
The problem of dense optical flow computation is addressed from a variational viewpoint. A new geometric framework is introduced. It unifies previous art and yields new efficient methods. Along with the framework a ne...
详细信息
The problem of dense optical flow computation is addressed from a variational viewpoint. A new geometric framework is introduced. It unifies previous art and yields new efficient methods. Along with the framework a new alignment criterion suggests itself. It is shown that the alignment between the gradients of the optical flow components and between the latter and the intensity gradients is an important measure of the flow’s quality. Adding this criterion as a requirement in the optimization process improves the resulting flow. This is demonstrated in synthetic and real sequences.
This paper presents nonstationary Markovian models and their application to recognition of strings of tokens, such as ZIP codes in the US mailstream. Unlike traditional approaches where digits are simply recognized in...
详细信息
This paper presents nonstationary Markovian models and their application to recognition of strings of tokens, such as ZIP codes in the US mailstream. Unlike traditional approaches where digits are simply recognized in isolation, the novelty of our approach lies in the manner in which recognitions scores along with domain specific knowledge about the frequency distribution of various combination of digits are all integrated into one unified model. The domain knowledge is derived from postal directory files. This data feeds into the models as n-grams statistics that are seamlessly integrated with recognition scores of digit images. We present the recognition accuracy (90%) achieved on a set of 20,000 ZIP codes.
An approach that allows a user to assist an automatic system in modeling buildings is described. The approach is designed to be efficient in user time and effort while preserving the quality of the models created. Cur...
详细信息
An approach that allows a user to assist an automatic system in modeling buildings is described. The approach is designed to be efficient in user time and effort while preserving the quality of the models created. Currently our system is able to handle the rectangular buildings with flat roof or symmetric gabled roof. Models can be created by only one or two clicks in many cases. Efficient editing of automatically derived models is also possible.
This paper presents a novel method to support environmental perception of mobile robots by the use of a global feature map. While typical approaches to simultaneous localization and mapping (SLAM) mainly rely on an on...
详细信息
This paper presents a novel method to support environmental perception of mobile robots by the use of a global feature map. While typical approaches to simultaneous localization and mapping (SLAM) mainly rely on an on-board camera for mapping, our approach uses geographically referenced aerial or satellite images to build a map in advance. The current position on the map is determined by matching features from the on-board camera to the global feature map. The problem of feature matching is posed as a standard point pattern matching problem and a solution using the iterative closest point method is given. The proposed algorithm is designed for use in a street vehicle and uses lane markings as features, but can be adapted to almost any other type of feature that is visible in aerial images. Our approach allows for estimating the robot position at a higher precision than by a purely GPS-based localization, while at the same time providing information about the environment far beyond the current field of view.
We propose a real-time method for counting pedestrians and bicyclists by classifying bulks of asynchronous events generated upon scene activities by an event-based 3D dynamic vision system. The inherent detection of m...
详细信息
We propose a real-time method for counting pedestrians and bicyclists by classifying bulks of asynchronous events generated upon scene activities by an event-based 3D dynamic vision system. The inherent detection of moving objects offered by the 3D dynamic vision system comprising a pair of dynamic vision sensors allows event-based stereo vision in real-time and a 3D representation of moving objects. A clustering method exploits the sparse spatio-temporal representation of sensor's events for real-time detection and separation between moving objects. The method has been demonstrated for clustering the events and classification of pedestrian and cyclists moving across the sensor field of view based on their dimensions and passage duration. Tests on real scenarios with more than 100 cyclists and pedestrians yield a classification performance above 92%.
We develop two algorithms to register a range scan to a previous scan so as to compute relative robot positions in an unknown environment. The first algorithm is used on matching tangent lines defined on two scans and...
详细信息
We develop two algorithms to register a range scan to a previous scan so as to compute relative robot positions in an unknown environment. The first algorithm is used on matching tangent lines defined on two scans and minimizing a distance function. The second algorithm iteratively establishes correspondences between points in the two scans and then solves the point-to-point least-squares problem to compute the relative pose. Our methods avoid the use of localized features. They work in curved environments and can handle partial occlusions.< >
暂无评论