| 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 |
