| Home | [51–60] << 61 62 63 64 65 66 67 68 69 70 >> [71–80] |
|
| Records | |||||
|---|---|---|---|---|---|
Author  |
Mohammad Rouhani; Angel Sappa | ||||
| Title | A Novel Approach to Geometric Fitting of Implicit Quadrics | Type | Conference Article | ||
| Year | 2009 | Publication | 8th International Conference on Advanced Concepts for Intelligent Vision Systems | Abbreviated Journal | |
| Volume | 5807 | Issue | Pages | 121–132 | |
| Keywords | |||||
| Abstract | This paper presents a novel approach for estimating the geometric distance from a given point to the corresponding implicit quadric curve/surface. The proposed estimation is based on the height of a tetrahedron, which is used as a coarse but reliable estimation of the real distance. The estimated distance is then used for finding the best set of quadric parameters, by means of the Levenberg-Marquardt algorithm, which is a common framework in other geometric fitting approaches. Comparisons of the proposed approach with previous ones are provided to show both improvements in CPU time as well as in the accuracy of the obtained results. | ||||
| Address | Bordeaux, France | ||||
| Corporate Author | Thesis | ||||
| Publisher | Springer Berlin Heidelberg | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | LNCS | ||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0302-9743 | ISBN | 978-3-642-04696-4 | Medium | |
| Area | Expedition | Conference | ACIVS | ||
| Notes | ADAS | Approved | no | ||
| Call Number | ADAS @ adas @ RoS2009 | Serial | 1194 | ||
| Permanent link to this record | |||||
| Author |
Mohammad Rouhani; Angel Sappa | ||||
| Title | Relaxing the 3L Algorithm for an Accurate Implicit Polynomial Fitting | Type | Conference Article | ||
| Year | 2010 | Publication | 23rd IEEE Conference on Computer Vision and Pattern Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 3066-3072 | ||
| Keywords | |||||
| Abstract | This paper presents a novel method to increase the accuracy of linear fitting of implicit polynomials. The proposed method is based on the 3L algorithm philosophy. The novelty lies on the relaxation of the additional constraints, already imposed by the 3L algorithm. Hence, the accuracy of the final solution is increased due to the proper adjustment of the expected values in the aforementioned additional constraints. Although iterative, the proposed approach solves the fitting problem within a linear framework, which is independent of the threshold tuning. Experimental results, both in 2D and 3D, showing improvements in the accuracy of the fitting are presented. Comparisons with both state of the art algorithms and a geometric based one (non-linear fitting), which is used as a ground truth, are provided. | ||||
| Address | San Francisco; CA; USA; June 2010 | ||||
| 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 | 1063-6919 | ISBN | 978-1-4244-6984-0 | Medium | |
| Area | Expedition | Conference | CVPR | ||
| Notes | ADAS | Approved | no | ||
| Call Number | ADAS @ adas @ RoS2010a | Serial | 1303 | ||
| Permanent link to this record | |||||
| Author |
Mohammad Rouhani; Angel Sappa | ||||
| Title | A Fast accurate Implicit Polynomial Fitting Approach | Type | Conference Article | ||
| Year | 2010 | Publication | 17th IEEE International Conference on Image Processing | Abbreviated Journal | |
| Volume | Issue | Pages | 1429–1432 | ||
| Keywords | |||||
| Abstract | This paper presents a novel hybrid approach that combines state of the art fitting algorithms: algebraic-based and geometric-based. It consists of two steps; first, the 3L algorithm is used as an initialization and then, the obtained result, is improved through a geometric approach. The adopted geometric approach is based on a distance estimation that avoids costly search for the real orthogonal distance. Experimental results are presented as well as quantitative comparisons. | ||||
| Address | Hong-Kong | ||||
| 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 | 1522-4880 | ISBN | 978-1-4244-7992-4 | Medium | |
| Area | Expedition | Conference | ICIP | ||
| Notes | ADAS | Approved | no | ||
| Call Number | ADAS @ adas @ RoS2010b | Serial | 1359 | ||
| Permanent link to this record | |||||
| Author |
Mohammad Rouhani; Angel Sappa | ||||
| Title | Implicit B-Spline Fitting Using the 3L Algorithm | Type | Conference Article | ||
| Year | 2011 | Publication | 18th IEEE International Conference on Image Processing | Abbreviated Journal | |
| Volume | Issue | Pages | 893-896 | ||
| Keywords | |||||
| Abstract | |||||
| Address | Brussels, Belgium | ||||
| 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 | Medium | |||
| Area | Expedition | Conference | ICIP | ||
| Notes | ADAS | Approved | no | ||
| Call Number | Admin @ si @ RoS2011a; ADAS @ adas @ | Serial | 1782 | ||
| 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 | |||||
| Author |
Mohammad Rouhani; Angel Sappa | ||||
| Title | Implicit Polynomial Representation through a Fast Fitting Error Estimation | Type | Journal Article | ||
| Year | 2012 | Publication | IEEE Transactions on Image Processing | Abbreviated Journal | TIP |
| Volume | 21 | Issue | 4 | Pages | 2089-2098 |
| Keywords | |||||
| Abstract | Impact Factor
This paper presents a simple distance estimation for implicit polynomial fitting. It is computed as the height of a simplex built between the point and the surface (i.e., a triangle in 2-D or a tetrahedron in 3-D), which is used as a coarse but reliable estimation of the orthogonal distance. The proposed distance can be described as a function of the coefficients of the implicit polynomial. Moreover, it is differentiable and has a smooth behavior . Hence, it can be used in any gradient-based optimization. In this paper, its use in a Levenberg-Marquardt framework is shown, which is particularly devoted for nonlinear least squares problems. The proposed estimation is a generalization of the gradient-based distance estimation, which is widely used in the literature. Experimental results, both in 2-D and 3-D data sets, are provided. Comparisons with state-of-the-art techniques are presented, showing the advantages of the proposed 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 | 1057-7149 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | ADAS | Approved | no | ||
| Call Number | Admin @ si @ RoS2012b; ADAS @ adas @ | Serial | 1937 | ||
| Permanent link to this record | |||||
| Author |
Mohammad Rouhani; Angel Sappa | ||||
| Title | Non-Rigid Shape Registration: A Single Linear Least Squares Framework | Type | Conference Article | ||
| Year | 2012 | Publication | 12th European Conference on Computer Vision | Abbreviated Journal | |
| Volume | 7578 | Issue | Pages | 264-277 | |
| Keywords | |||||
| Abstract | This paper proposes a non-rigid registration formulation capturing both global and local deformations in a single framework. This formulation is based on a quadratic estimation of the registration distance together with a quadratic regularization term. Hence, the optimal transformation parameters are easily obtained by solving a liner system of equations, which guarantee a fast convergence. Experimental results with challenging 2D and 3D shapes are presented to show the validity of the proposed framework. Furthermore, comparisons with the most relevant approaches are provided. | ||||
| Address | Florencia | ||||
| Corporate Author | Thesis | ||||
| Publisher | Springer Berlin Heidelberg | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | LNCS | ||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0302-9743 | ISBN | 978-3-642-33785-7 | Medium | |
| Area | Expedition | Conference | ECCV | ||
| Notes | ADAS | Approved | no | ||
| Call Number | Admin @ si @ RoS2012a | Serial | 2158 | ||
| Permanent link to this record | |||||
| Author |
Mohammad Rouhani; Angel Sappa | ||||
| Title | The Richer Representation the Better Registration | Type | Journal Article | ||
| Year | 2013 | Publication | IEEE Transactions on Image Processing | Abbreviated Journal | TIP |
| Volume | 22 | Issue | 12 | Pages | 5036-5049 |
| Keywords | |||||
| Abstract | In this paper, the registration problem is formulated as a point to model distance minimization. Unlike most of the existing works, which are based on minimizing a point-wise correspondence term, this formulation avoids the correspondence search that is time-consuming. In the first stage, the target set is described through an implicit function by employing a linear least squares fitting. This function can be either an implicit polynomial or an implicit B-spline from a coarse to fine representation. In the second stage, we show how the obtained implicit representation is used as an interface to convert point-to-point registration into point-to-implicit problem. Furthermore, we show that this registration distance is smooth and can be minimized through the Levengberg-Marquardt algorithm. All the formulations presented for both stages are compact and easy to implement. In addition, we show that our registration method can be handled using any implicit representation though some are coarse and others provide finer representations; hence, a tradeoff between speed and accuracy can be set by employing the right implicit function. Experimental results and comparisons in 2D and 3D show the robustness and the speed of convergence of the proposed 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 | 1057-7149 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | ADAS | Approved | no | ||
| Call Number | Admin @ si @ RoS2013 | Serial | 2665 | ||
| Permanent link to this record | |||||
| Author |
Mohammad Rouhani | ||||
| Title | 3D Data Fitting and Tracking for Real Time Applications | Type | Report | ||
| Year | 2009 | Publication | CVC Technical Report | Abbreviated Journal | |
| Volume | 138 | Issue | 138 | Pages | |
| Keywords | |||||
| Abstract | |||||
| Address | Barcelona, Spain | ||||
| Corporate Author | Thesis | Master's 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 | Medium | |||
| Area | Expedition | Conference | |||
| Notes | invisible;ADAS | Approved | no | ||
| Call Number | Admin @ si @ Rou2009 | Serial | 1150 | ||
| Permanent link to this record | |||||
| Author |
Mohammad Rouhani | ||||
| Title | Shape Representation and Registration using Implicit Functions | Type | Book Whole | ||
| Year | 2012 | Publication | PhD Thesis, Universitat Autonoma de Barcelona-CVC | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | Shape representation and registration are two important problems in computer vision and graphics. Representing the given cloud of points through an implicit function provides a higher level information describing the data. This representation can be more compact more robust to noise and outliers, hence it can be exploited in different computer vision application. In the first part of this thesis implicit shape representations, including both implicit B-spline and polynomial, are tackled. First, an approximation of a geometric distance is proposed to measure the closeness of the given cloud of points and the implicit surface. The analysis of the proposed distance shows an accurate estimation with smooth behavior. The distance by itself is used in a RANSAC based quadratic fitting method. Moreover, since the gradient information of the distance with respect to the surface parameters can be analytically computed, it is used in Levenberg-Marquadt algorithm to refine the surface parameters. In a different approach, an algebraic fitting method is used to represent an object through implicit B-splines. The outcome is a smooth flexible surface and can be represented in different levels from coarse to fine. This property has been exploited to solve the registration problem in the second part of the thesis. In the proposed registration technique the model set is replaced with an implicit representation provided in the first part; then, the point-to-point registration is converted to a point-to-model one in a higher level. This registration error can benefit from different distance estimations to speed up the registration process even without need of correspondence search. Finally, the non-rigid registration problem is tackled through a quadratic distance approximation that is based on the curvature information of the model set. This approximation is used in a free form deformation model to update its control lattice. Then it is shown how an accurate distance approximation can benefit non-rigid registration problems. | ||||
| Address | |||||
| Corporate Author | Thesis | Ph.D. thesis | |||
| Publisher | Ediciones Graficas Rey | Place of Publication | Editor | Angel Sappa | |
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | ADAS | Approved | no | ||
| Call Number | Admin @ si @ Rou2012 | Serial | 2205 | ||
| Permanent link to this record | |||||
| Author |
Mohammad N. S. Jahromi; Pau Buch Cardona; Egils Avots; Kamal Nasrollahi; Sergio Escalera; Thomas B. Moeslund; Gholamreza Anbarjafari | ||||
| Title | Privacy-Constrained Biometric System for Non-cooperative Users | Type | Journal Article | ||
| Year | 2019 | Publication | Entropy | Abbreviated Journal | ENTROPY |
| Volume | 21 | Issue | 11 | Pages | 1033 |
| Keywords | biometric recognition; multimodal-based human identification; privacy; deep learning | ||||
| Abstract | With the consolidation of the new data protection regulation paradigm for each individual within the European Union (EU), major biometric technologies are now confronted with many concerns related to user privacy in biometric deployments. When individual biometrics are disclosed, the sensitive information about his/her personal data such as financial or health are at high risk of being misused or compromised. This issue can be escalated considerably over scenarios of non-cooperative users, such as elderly people residing in care homes, with their inability to interact conveniently and securely with the biometric system. The primary goal of this study is to design a novel database to investigate the problem of automatic people recognition under privacy constraints. To do so, the collected data-set contains the subject’s hand and foot traits and excludes the face biometrics of individuals in order to protect their privacy. We carried out extensive simulations using different baseline methods, including deep learning. Simulation results show that, with the spatial features extracted from the subject sequence in both individual hand or foot videos, state-of-the-art deep models provide promising recognition performance. | ||||
| 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 | Medium | |||
| Area | Expedition | Conference | |||
| Notes | HuPBA; no proj | Approved | no | ||
| Call Number | Admin @ si @ NBA2019 | Serial | 3313 | ||
| Permanent link to this record | |||||
| Author |
Mohammad N. S. Jahromi; Morten Bojesen Bonderup; Maryam Asadi-Aghbolaghi; Egils Avots; Kamal Nasrollahi; Sergio Escalera; Shohreh Kasaei; Thomas B. Moeslund; Gholamreza Anbarjafari | ||||
| Title | Automatic Access Control Based on Face and Hand Biometrics in a Non-cooperative Context | Type | Conference Article | ||
| Year | 2018 | Publication | IEEE Winter Applications of Computer Vision Workshops | Abbreviated Journal | |
| Volume | Issue | Pages | 28-36 | ||
| Keywords | IEEE Winter Applications of Computer Vision Workshops | ||||
| Abstract | Automatic access control systems (ACS) based on the human biometrics or physical tokens are widely employed in public and private areas. Yet these systems, in their conventional forms, are restricted to active interaction from the users. In scenarios where users are not cooperating with the system, these systems are challenged. Failure in cooperation with the biometric systems might be intentional or because the users are incapable of handling the interaction procedure with the biometric system or simply forget to cooperate with it, due to for example, illness like dementia. This work introduces a challenging bimodal database, including face and hand information of the users when they approach a door to open it by its handle in a noncooperative context. We have defined two (an easy and a challenging) protocols on how to use the database. We have reported results on many baseline methods, including deep learning techniques as well as conventional methods on the database. The obtained results show the merit of the proposed database and the challenging nature of access control with non-cooperative users. | ||||
| Address | Lake Tahoe; USA; March 2018 | ||||
| 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 | Medium | |||
| Area | Expedition | Conference | WACVW | ||
| Notes | HUPBA; 602.133 | Approved | no | ||
| Call Number | Admin @ si @ JBA2018 | Serial | 3121 | ||
| Permanent link to this record | |||||
| Author |
Mohammad Momeny; Ali Asghar Neshat; Ahmad Jahanbakhshi; Majid Mahmoudi; Yiannis Ampatzidis; Petia Radeva | ||||
| Title | Grading and fraud detection of saffron via learning-to-augment incorporated Inception-v4 CNN | Type | Journal Article | ||
| Year | 2023 | Publication | Food Control | Abbreviated Journal | FC |
| Volume | 147 | Issue | Pages | 109554 | |
| Keywords | |||||
| Abstract | Saffron is a well-known product in the food industry. It is one of the spices that are sometimes adulterated with the sole motive of gaining more economic profit. Today, machine vision systems are widely used in controlling the quality of food and agricultural products as a new, non-destructive, and inexpensive approach. In this study, a machine vision system based on deep learning was used to detect fraud and saffron quality. A dataset of 1869 images was created and categorized in 6 classes including: dried saffron stigma using a dryer; dried saffron stigma using pressing method; pure stem of saffron; sunflower; saffron stem mixed with food coloring; and corn silk mixed with food coloring. A Learning-to-Augment incorporated Inception-v4 Convolutional Neural Network (LAII-v4 CNN) was developed for grading and fraud detection of saffron in images captured by smartphones. The best policies of data augmentation were selected with the proposed LAII-v4 CNN using images corrupted by Gaussian, speckle, and impulse noise to address overfitting the model. The proposed LAII-v4 CNN compared with regular CNN-based methods and traditional classifiers. Ensemble of Bagged Decision Trees, Ensemble of Boosted Decision Trees, k-Nearest Neighbor, Random Under-sampling Boosted Trees, and Support Vector Machine were used for classification of the features extracted by Histograms of Oriented Gradients and Local Binary Patterns, and selected by the Principal Component Analysis. The results showed that the proposed LAII-v4 CNN with an accuracy of 99.5% has achieved the best performance by employing batch normalization, Dropout, and leaky ReLU. | ||||
| 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 | Medium | |||
| Area | Expedition | Conference | |||
| Notes | MILAB | Approved | no | ||
| Call Number | Admin @ si @ MNJ2023 | Serial | 3882 | ||
| Permanent link to this record | |||||
| Author |
Mohammad Ali Bagheri; Qigang Gao; Sergio Escalera; Albert Clapes; Kamal Nasrollahi; Michael Holte; Thomas B. Moeslund | ||||
| Title | Keep it Accurate and Diverse: Enhancing Action Recognition Performance by Ensemble Learning | Type | Conference Article | ||
| Year | 2015 | Publication | IEEE Conference on Computer Vision and Pattern Recognition Worshops (CVPRW) | Abbreviated Journal | |
| Volume | Issue | Pages | 22-29 | ||
| Keywords | |||||
| Abstract | The performance of different action recognition techniques has recently been studied by several computer vision researchers. However, the potential improvement in classification through classifier fusion by ensemble-based methods has remained unattended. In this work, we evaluate the performance of an ensemble of action learning techniques, each performing the recognition task from a different perspective.
The underlying idea is that instead of aiming a very sophisticated and powerful representation/learning technique, we can learn action categories using a set of relatively simple and diverse classifiers, each trained with different feature set. In addition, combining the outputs of several learners can reduce the risk of an unfortunate selection of a learner on an unseen action recognition scenario. This leads to having a more robust and general-applicable framework. In order to improve the recognition performance, a powerful combination strategy is utilized based on the Dempster-Shafer theory, which can effectively make use of diversity of base learners trained on different sources of information. The recognition results of the individual classifiers are compared with those obtained from fusing the classifiers’ output, showing enhanced performance of the proposed methodology. |
||||
| Address | Boston; EEUU; June 2015 | ||||
| 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 | Medium | |||
| Area | Expedition | Conference | CVPRW | ||
| Notes | HuPBA;MILAB | Approved | no | ||
| Call Number | Admin @ si @ BGE2015 | Serial | 2655 | ||
| Permanent link to this record | |||||
| Author |
Mohammad Ali Bagheri; Qigang Gao; Sergio Escalera | ||||
| Title | Three-Dimensional Design of Error Correcting Output Codes | Type | Conference Article | ||
| Year | 2012 | Publication | 8th International Conference on Machine Learning and Data Mining | Abbreviated Journal | |
| Volume | Issue | Pages | 29- | ||
| Keywords | |||||
| Abstract | |||||
| Address | Berlin, Germany | ||||
| 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 | Medium | |||
| Area | Expedition | Conference | MLDM | ||
| Notes | HuPBA;MILAB | Approved | no | ||
| Call Number | Admin @ si @ BGE2012a | Serial | 2041 | ||
| Permanent link to this record | |||||