| Records |
| Author |
Jürgen Brauer; Wenjuan Gong; Jordi Gonzalez; Michael Arens |
| Title |
On the Effect of Temporal Information on Monocular 3D Human Pose Estimation |
Type |
Conference Article |
| Year |
2011 |
Publication |
2nd IEEE International Workshop on Analysis and Retrieval of Tracked Events and Motion in Imagery Streams |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
906 - 913 |
| Keywords |
|
| Abstract |
We address the task of estimating 3D human poses from monocular camera sequences. Many works make use of multiple consecutive frames for the estimation of a 3D pose in a frame. Although such an approach should ease the pose estimation task substantially since multiple consecutive frames allow to solve for 2D projection ambiguities in principle, it has not yet been investigated systematically how much we can improve the 3D pose estimates when using multiple consecutive frames opposed to single frame information. In this paper we analyze the difference in quality of 3D pose estimates based on different numbers of consecutive frames from which 2D pose estimates are available. We validate the use of temporal information on two major different approaches for human pose estimation – modeling and learning approaches. The results of our experiments show that both learning and modeling approaches benefit from using multiple frames opposed to single frame input but that the benefit is small when the 2D pose estimates show a high quality in terms of precision. |
| Address |
Barcelona |
| Corporate Author |
|
Thesis |
|
| Publisher |
|
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
|
ISBN  |
978-1-4673-0062-9 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
ARTEMIS |
| Notes |
ISE |
Approved |
no |
| Call Number |
Admin @ si @BGG 2011 |
Serial |
1860 |
| Permanent link to this record |
| |
|
| |
| Author |
Antonio Hernandez; Carlos Primo; Sergio Escalera |
| Title |
Automatic user interaction correction via Multi-label Graph cuts |
Type |
Conference Article |
| Year |
2011 |
Publication |
In ICCV 2011 1st IEEE International Workshop on Human Interaction in Computer Vision HICV |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
1276-1281 |
| Keywords |
|
| Abstract |
Most applications in image segmentation requires from user interaction in order to achieve accurate results. However, user wants to achieve the desired segmentation accuracy reducing effort of manual labelling. In this work, we extend standard multi-label α-expansion Graph Cut algorithm so that it analyzes the interaction of the user in order to modify the object model and improve final segmentation of objects. The approach is inspired in the fact that fast user interactions may introduce some pixel errors confusing object and background. Our results with different degrees of user interaction and input errors show high performance of the proposed approach on a multi-label human limb segmentation problem compared with classical α-expansion algorithm. |
| Address |
|
| Corporate Author |
|
Thesis |
|
| Publisher |
|
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
|
ISBN |
978-1-4673-0062-9 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
HICV |
| Notes |
MILAB; HuPBA |
Approved |
no |
| Call Number |
Admin @ si @ HPE2011 |
Serial |
1892 |
| Permanent link to this record |
| |
|
| |
| Author |
Miguel Reyes; Gabriel Dominguez; Sergio Escalera |
| Title |
Feature Weighting in Dynamic Time Warping for Gesture Recognition in Depth Data |
Type |
Conference Article |
| Year |
2011 |
Publication |
1st IEEE Workshop on Consumer Depth Cameras for Computer Vision |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
1182-1188 |
| Keywords |
|
| Abstract |
We present a gesture recognition approach for depth video data based on a novel Feature Weighting approach within the Dynamic Time Warping framework. Depth features from human joints are compared through video sequences using Dynamic Time Warping, and weights are assigned to features based on inter-intra class gesture variability. Feature Weighting in Dynamic Time Warping is then applied for recognizing begin-end of gestures in data sequences. The obtained results recognizing several gestures in depth data show high performance compared with classical Dynamic Time Warping approach. |
| Address |
|
| Corporate Author |
|
Thesis |
|
| Publisher |
|
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
|
ISBN |
978-1-4673-0062-9 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
CDC4CV |
| Notes |
HuPBA;MILAB |
Approved |
no |
| Call Number |
Admin @ si @ RDE2011 |
Serial |
1893 |
| Permanent link to this record |
| |
|
| |
| Author |
David Geronimo; Antonio Lopez |
| Title |
Vision-based Pedestrian Protection Systems for Intelligent Vehicles |
Type |
Book Whole |
| Year |
2014 |
Publication |
SpringerBriefs in Computer Science |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
1-114 |
| Keywords |
Computer Vision; Driver Assistance Systems; Intelligent Vehicles; Pedestrian Detection; Vulnerable Road Users |
| Abstract |
Pedestrian Protection Systems (PPSs) are on-board systems aimed at detecting and tracking people in the surroundings of a vehicle in order to avoid potentially dangerous situations. These systems, together with other Advanced Driver Assistance Systems (ADAS) such as lane departure warning or adaptive cruise control, are one of the most promising ways to improve traffic safety. By the use of computer vision, cameras working either in the visible or infra-red spectra have been demonstrated as a reliable sensor to perform this task. Nevertheless, the variability of human’s appearance, not only in terms of clothing and sizes but also as a result of their dynamic shape, makes pedestrians one of the most complex classes even for computer vision. Moreover, the unstructured changing and unpredictable environment in which such on-board systems must work makes detection a difficult task to be carried out with the demanded robustness. In this brief, the state of the art in PPSs is introduced through the review of the most relevant papers of the last decade. A common computational architecture is presented as a framework to organize each method according to its main contribution. More than 300 papers are referenced, most of them addressing pedestrian detection and others corresponding to the descriptors (features), pedestrian models, and learning machines used. In addition, an overview of topics such as real-time aspects, systems benchmarking and future challenges of this research area are presented. |
| Address |
|
| Corporate Author |
|
Thesis |
|
| Publisher |
Springer Briefs in Computer Vision |
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
|
ISBN |
978-1-4614-7986-4 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
ADAS; 600.076 |
Approved |
no |
| Call Number |
GeL2014 |
Serial |
2325 |
| Permanent link to this record |
| |
|
| |
| Author |
C. Alejandro Parraga |
| Title |
Color Vision, Computational Methods for |
Type |
Book Chapter |
| Year |
2014 |
Publication |
Encyclopedia of Computational Neuroscience |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
1-11 |
| Keywords |
Color computational vision; Computational neuroscience of color |
| Abstract |
The study of color vision has been aided by a whole battery of computational methods that attempt to describe the mechanisms that lead to our perception of colors in terms of the information-processing properties of the visual system. Their scope is highly interdisciplinary, linking apparently dissimilar disciplines such as mathematics, physics, computer science, neuroscience, cognitive science, and psychology. Since the sensation of color is a feature of our brains, computational approaches usually include biological features of neural systems in their descriptions, from retinal light-receptor interaction to subcortical color opponency, cortical signal decoding, and color categorization. They produce hypotheses that are usually tested by behavioral or psychophysical experiments. |
| Address |
|
| Corporate Author |
|
Thesis |
|
| Publisher |
Springer-Verlag Berlin Heidelberg |
Place of Publication |
|
Editor |
Dieter Jaeger; Ranu Jung |
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
|
ISBN |
978-1-4614-7320-6 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
CIC; 600.074 |
Approved |
no |
| Call Number |
Admin @ si @ Par2014 |
Serial |
2512 |
| Permanent link to this record |
| |
|
| |
| Author |
Muhammad Muzzamil Luqman; Jean-Yves Ramel; Josep Llados |
| Title |
Multilevel Analysis of Attributed Graphs for Explicit Graph Embedding in Vector Spaces |
Type |
Book Chapter |
| Year |
2013 |
Publication |
Graph Embedding for Pattern Analysis |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
1-26 |
| Keywords |
|
| Abstract |
Ability to recognize patterns is among the most crucial capabilities of human beings for their survival, which enables them to employ their sophisticated neural and cognitive systems [1], for processing complex audio, visual, smell, touch, and taste signals. Man is the most complex and the best existing system of pattern recognition. Without any explicit thinking, we continuously compare, classify, and identify huge amount of signal data everyday [2], starting from the time we get up in the morning till the last second we fall asleep. This includes recognizing the face of a friend in a crowd, a spoken word embedded in noise, the proper key to lock the door, smell of coffee, the voice of a favorite singer, the recognition of alphabetic characters, and millions of more tasks that we perform on regular basis. |
| Address |
|
| Corporate Author |
|
Thesis |
|
| Publisher |
Springer New York |
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
|
ISBN |
978-1-4614-4456-5 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
DAG |
Approved |
no |
| Call Number |
Admin @ si @ LRL2013b |
Serial |
2271 |
| Permanent link to this record |
| |
|
| |
| Author |
Miquel Ferrer; I. Bardaji; Ernest Valveny; Dimosthenis Karatzas; Horst Bunke |
| Title |
Median Graph Computation by Means of Graph Embedding into Vector Spaces |
Type |
Book Chapter |
| Year |
2013 |
Publication |
Graph Embedding for Pattern Analysis |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
45-72 |
| Keywords |
|
| Abstract |
In pattern recognition [8, 14], a key issue to be addressed when designing a system is how to represent input patterns. Feature vectors is a common option. That is, a set of numerical features describing relevant properties of the pattern are computed and arranged in a vector form. The main advantages of this kind of representation are computational simplicity and a well sound mathematical foundation. Thus, a large number of operations are available to work with vectors and a large repository of algorithms for pattern analysis and classification exist. However, the simple structure of feature vectors might not be the best option for complex patterns where nonnumerical features or relations between different parts of the pattern become relevant. |
| Address |
|
| Corporate Author |
|
Thesis |
|
| Publisher |
Springer New York |
Place of Publication |
|
Editor |
Yun Fu; Yungian Ma |
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
|
ISBN |
978-1-4614-4456-5 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
DAG |
Approved |
no |
| Call Number |
Admin @ si @ FBV2013 |
Serial |
2421 |
| Permanent link to this record |
| |
|
| |
| Author |
Sergio Vera; Miguel Angel Gonzalez Ballester; Debora Gil |
| Title |
A medial map capturing the essential geometry of organs |
Type |
Conference Article |
| Year |
2012 |
Publication |
ISBI Workshop on Open Source Medical Image Analysis software |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
1691 - 1694 |
| Keywords |
Medial Surface Representation, Volume Reconstruction,Geometry , Image reconstruction , Liver , Manifolds , Shape , Surface morphology , Surface reconstruction |
| Abstract |
Medial representations are powerful tools for describing and parameterizing the volumetric shape of anatomical structures. Accurate computation of one pixel wide medial surfaces is mandatory. Those surfaces must represent faithfully the geometry of the volume. Although morphological methods produce excellent results in 2D, their complexity and quality drops across dimensions, due to a more complex description of pixel neighborhoods. This paper introduces a continuous operator for accurate and efficient computation of medial structures of arbitrary dimension. Our experiments show its higher performance for medical imaging applications in terms of simplicity of medial structures and capability for reconstructing the anatomical volume |
| Address |
Barcelona,Spain |
| Corporate Author |
|
Thesis |
|
| Publisher |
IEEE |
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
1945-7928 |
ISBN |
978-1-4577-1857-1 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
ISBI |
| Notes |
IAM |
Approved |
no |
| Call Number |
IAM @ iam @ VGG2012a |
Serial |
1989 |
| Permanent link to this record |
| |
|
| |
| Author |
Muhammad Muzzamil Luqman; Jean-Yves Ramel; Josep Llados; Thierry Brouard |
| Title |
Subgraph Spotting Through Explicit Graph Embedding: An Application to Content Spotting in Graphic Document Images |
Type |
Conference Article |
| Year |
2011 |
Publication |
11th International Conference on Document Analysis and Recognition |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
870-874 |
| Keywords |
|
| Abstract |
We present a method for spotting a subgraph in a graph repository. Subgraph spotting is a very interesting research problem for various application domains where the use of a relational data structure is mandatory. Our proposed method accomplishes subgraph spotting through graph embedding. We achieve automatic indexation of a graph repository during off-line learning phase, where we (i) break the graphs into 2-node sub graphs (a.k.a. cliques of order 2), which are primitive building-blocks of a graph, (ii) embed the 2-node sub graphs into feature vectors by employing our recently proposed explicit graph embedding technique, (iii) cluster the feature vectors in classes by employing a classic agglomerative clustering technique, (iv) build an index for the graph repository and (v) learn a Bayesian network classifier. The subgraph spotting is achieved during the on-line querying phase, where we (i) break the query graph into 2-node sub graphs, (ii) embed them into feature vectors, (iii) employ the Bayesian network classifier for classifying the query 2-node sub graphs and (iv) retrieve the respective graphs by looking-up in the index of the graph repository. The graphs containing all query 2-node sub graphs form the set of result graphs for the query. Finally, we employ the adjacency matrix of each result graph along with a score function, for spotting the query graph in it. The proposed subgraph spotting method is equally applicable to a wide range of domains, offering ease of query by example (QBE) and granularity of focused retrieval. Experimental results are presented for graphs generated from two repositories of electronic and architectural document images. |
| Address |
Beijing, China |
| Corporate Author |
|
Thesis |
|
| Publisher |
|
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
1520-5363 |
ISBN |
978-1-4577-1350-7 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
ICDAR |
| Notes |
DAG |
Approved |
no |
| Call Number |
Admin @ si @ LRL2011 |
Serial |
1790 |
| Permanent link to this record |
| |
|
| |
| Author |
Anjan Dutta; Josep Llados; Umapada Pal |
| Title |
Symbol Spotting in Line Drawings Through Graph Paths Hashing |
Type |
Conference Article |
| Year |
2011 |
Publication |
11th International Conference on Document Analysis and Recognition |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
982-986 |
| Keywords |
|
| Abstract |
In this paper we propose a symbol spotting technique through hashing the shape descriptors of graph paths (Hamiltonian paths). Complex graphical structures in line drawings can be efficiently represented by graphs, which ease the accurate localization of the model symbol. Graph paths are the factorized substructures of graphs which enable robust recognition even in the presence of noise and distortion. In our framework, the entire database of the graphical documents is indexed in hash tables by the locality sensitive hashing (LSH) of shape descriptors of the paths. The hashing data structure aims to execute an approximate k-NN search in a sub-linear time. The spotting method is formulated by a spatial voting scheme to the list of locations of the paths that are decided during the hash table lookup process. We perform detailed experiments with various dataset of line drawings and the results demonstrate the effectiveness and efficiency of the technique. |
| Address |
Beijing, China |
| Corporate Author |
|
Thesis |
|
| Publisher |
|
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
1520-5363 |
ISBN |
978-1-4577-1350-7 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
ICDAR |
| Notes |
DAG |
Approved |
no |
| Call Number |
Admin @ si @ DLP2011b |
Serial |
1791 |
| Permanent link to this record |
| |
|
| |
| Author |
Dimosthenis Karatzas; Sergi Robles; Joan Mas; Farshad Nourbakhsh; Partha Pratim Roy |
| Title |
ICDAR 2011 Robust Reading Competition – Challege 1: Reading Text in Born-Digital Images (Web and Email) |
Type |
Conference Article |
| Year |
2011 |
Publication |
11th International Conference on Document Analysis and Recognition |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
1485-1490 |
| Keywords |
|
| Abstract |
This paper presents the results of the first Challenge of ICDAR 2011 Robust Reading Competition. Challenge 1 is focused on the extraction of text from born-digital images, specifically from images found in Web pages and emails. The challenge was organized in terms of three tasks that look at different stages of the process: text localization, text segmentation and word recognition. In this paper we present the results of the challenge for all three tasks, and make an open call for continuous participation outside the context of ICDAR 2011. |
| Address |
Beijing, China |
| Corporate Author |
|
Thesis |
|
| Publisher |
|
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
1520-5363 |
ISBN |
978-1-4577-1350-7 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
ICDAR |
| Notes |
DAG |
Approved |
no |
| Call Number |
Admin @ si @ KRM2011 |
Serial |
1793 |
| Permanent link to this record |
| |
|
| |
| Author |
Koen E.A. van de Sande; Jasper Uilings; Theo Gevers; Arnold Smeulders |
| Title |
Segmentation as Selective Search for Object Recognition |
Type |
Conference Article |
| Year |
2011 |
Publication |
13th IEEE International Conference on Computer Vision |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
1879-1886 |
| Keywords |
|
| Abstract |
For object recognition, the current state-of-the-art is based on exhaustive search. However, to enable the use of more expensive features and classifiers and thereby progress beyond the state-of-the-art, a selective search strategy is needed. Therefore, we adapt segmentation as a selective search by reconsidering segmentation: We propose to generate many approximate locations over few and precise object delineations because (1) an object whose location is never generated can not be recognised and (2) appearance and immediate nearby context are most effective for object recognition. Our method is class-independent and is shown to cover 96.7% of all objects in the Pascal VOC 2007 test set using only 1,536 locations per image. Our selective search enables the use of the more expensive bag-of-words method which we use to substantially improve the state-of-the-art by up to 8.5% for 8 out of 20 classes on the Pascal VOC 2010 detection challenge. |
| Address |
Barcelona |
| Corporate Author |
|
Thesis |
|
| Publisher |
|
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
1550-5499 |
ISBN |
978-1-4577-1101-5 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
ICCV |
| Notes |
ISE |
Approved |
no |
| Call Number |
Admin @ si @ SUG2011 |
Serial |
1780 |
| Permanent link to this record |
| |
|
| |
| Author |
Shida Beigpour; Joost Van de Weijer |
| Title |
Object Recoloring Based on Intrinsic Image Estimation |
Type |
Conference Article |
| Year |
2011 |
Publication |
13th IEEE International Conference in Computer Vision |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
327 - 334 |
| Keywords |
|
| Abstract |
Object recoloring is one of the most popular photo-editing tasks. The problem of object recoloring is highly under-constrained, and existing recoloring methods limit their application to objects lit by a white illuminant. Application of these methods to real-world scenes lit by colored illuminants, multiple illuminants, or interreflections, results in unrealistic recoloring of objects. In this paper, we focus on the recoloring of single-colored objects presegmented from their background. The single-color constraint allows us to fit a more comprehensive physical model to the object. We demonstrate that this permits us to perform realistic recoloring of objects lit by non-white illuminants, and multiple illuminants. Moreover, the model allows for more realistic handling of illuminant alteration of the scene. Recoloring results captured by uncalibrated cameras demonstrate that the proposed framework obtains realistic recoloring for complex natural images. Furthermore we use the model to transfer color between objects and show that the results are more realistic than existing color transfer methods. |
| Address |
Barcelona |
| Corporate Author |
|
Thesis |
|
| Publisher |
|
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
1550-5499 |
ISBN |
978-1-4577-1101-5 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
ICCV |
| Notes |
CIC |
Approved |
no |
| Call Number |
Admin @ si @ BeW2011 |
Serial |
1781 |
| Permanent link to this record |
| |
|
| |
| Author |
Bhaskar Chakraborty; Michael Holte; Thomas B. Moeslund; Jordi Gonzalez; Xavier Roca |
| Title |
A Selective Spatio-Temporal Interest Point Detector for Human Action Recognition in Complex Scenes |
Type |
Conference Article |
| Year |
2011 |
Publication |
13th IEEE International Conference on Computer Vision |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
1776-1783 |
| Keywords |
|
| Abstract |
Recent progress in the field of human action recognition points towards the use of Spatio-Temporal Interest Points (STIPs) for local descriptor-based recognition strategies. In this paper we present a new approach for STIP detection by applying surround suppression combined with local and temporal constraints. Our method is significantly different from existing STIP detectors and improves the performance by detecting more repeatable, stable and distinctive STIPs for human actors, while suppressing unwanted background STIPs. For action representation we use a bag-of-visual words (BoV) model of local N-jet features to build a vocabulary of visual-words. To this end, we introduce a novel vocabulary building strategy by combining spatial pyramid and vocabulary compression techniques, resulting in improved performance and efficiency. Action class specific Support Vector Machine (SVM) classifiers are trained for categorization of human actions. A comprehensive set of experiments on existing benchmark datasets, and more challenging datasets of complex scenes, validate our approach and show state-of-the-art performance. |
| Address |
Barcelona |
| Corporate Author |
|
Thesis |
|
| Publisher |
|
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
1550-5499 |
ISBN |
978-1-4577-1101-5 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
ICCV |
| Notes |
ISE |
Approved |
no |
| Call Number |
Admin @ si @ CHM2011 |
Serial |
1811 |
| Permanent link to this record |
| |
|
| |
| Author |
Mohammad Rouhani; Angel Sappa |
| Title |
Correspondence Free Registration through a Point-to-Model Distance Minimization |
Type |
Conference Article |
| Year |
2011 |
Publication |
13th IEEE International Conference on Computer Vision |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
2150-2157 |
| Keywords |
|
| Abstract |
This paper presents a novel formulation, which derives in a smooth minimization problem, to tackle the rigid registration between a given point set and a model set. Unlike most of the existing works, which are based on minimizing a point-wise correspondence term, we propose to describe the model set by means of an implicit representation. It allows a new definition of the registration error, which works beyond the point level representation. Moreover, it could be used in a gradient-based optimization framework. The proposed approach consists of two stages. Firstly, a novel formulation is proposed that relates the registration parameters with the distance between the model and data set. Secondly, the registration parameters are obtained by means of the Levengberg-Marquardt algorithm. Experimental results and comparisons with state of the art show the validity of the proposed framework. |
| Address |
Barcelona |
| Corporate Author |
|
Thesis |
|
| Publisher |
|
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
1550-5499 |
ISBN |
978-1-4577-1101-5 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
ICCV |
| Notes |
ADAS |
Approved |
no |
| Call Number |
Admin @ si @ RoS2011b; ADAS @ adas @ |
Serial |
1832 |
| Permanent link to this record |
