http://hdl.handle.net/2117/3755 Tue, 18 Jun 2013 04:48:01 GMT 2013-06-18T04:48:01Z webmaster.bupc@upc.edu Universitat Politècnica de Catalunya. Servei de Biblioteques i Documentació no http://hdl.handle.net/2117/19499 Title: Aprendizaje cooperativo aplicado a la docencia de las asignaturas de programación en ingeniería informática Authors: Ferrer Sumsi, Miquel; Benavente, Robert; Valveny, Ernest; Garcia-Barnés, Jaume; Lapedriza, A.; Sànchez, Gemma Abstract: En este trabajo se presentan los resultados de la aplicación de la metodología del aprendizaje cooperativo a la docencia de dos asignaturas de programación en ingeniería informática. ‘Algoritmos y programación’ y ‘Lenguajes de programación’ son dos asignaturas complementarias que se organizan entorno a un proyecto común que engloba los contenidos de ambas asignaturas. En la docencia de una parte muy importante de estas asignaturas, la metodología del aprendizaje cooperativo se ha adaptado a sus características específicas. Como muestra de esta adaptación presentamos dos ejemplos de las actividades desarrolladas dentro de la docencia de estas asignaturas. Después de tres años de aplicación, el análisis a nivel cualitativo y cuantitativo de los resultados muestra que éstos son muy satisfactorios y que la aplicación del método cooperativo ha mejorado de forma considerable el rendimiento de los alumnos en ambas asignaturas. Tue, 04 Jun 2013 12:44:34 GMT http://hdl.handle.net/2117/19499 2013-06-04T12:44:34Z Ferrer Sumsi, Miquel; Benavente, Robert; Valveny, Ernest; Garcia-Barnés, Jaume; Lapedriza, A.; Sànchez, Gemma no Aprendizaje cooperativo, aprendizaje basado en proyectos, experiencias docentes En este trabajo se presentan los resultados de la aplicación de la metodología del aprendizaje cooperativo a la docencia de dos asignaturas de programación en ingeniería informática. ‘Algoritmos y programación’ y ‘Lenguajes de programación’ son dos asignaturas complementarias que se organizan entorno a un proyecto común que engloba los contenidos de ambas asignaturas. En la docencia de una parte muy importante de estas asignaturas, la metodología del aprendizaje cooperativo se ha adaptado a sus características específicas. Como muestra de esta adaptación presentamos dos ejemplos de las actividades desarrolladas dentro de la docencia de estas asignaturas. Después de tres años de aplicación, el análisis a nivel cualitativo y cuantitativo de los resultados muestra que éstos son muy satisfactorios y que la aplicación del método cooperativo ha mejorado de forma considerable el rendimiento de los alumnos en ambas asignaturas. http://hdl.handle.net/2117/19477 Title: Application of graph embedding to solve graph matching problems Authors: Valveny, Ernest; Ferrer Sumsi, Miquel Abstract: Graphs have very interesting properties for object representation in pattern recognition. However, graph matching algorithms are usually computationally complex. In addition, graphs are harder to manipulate and operate than feature vectors. In the last years, some attempts have been made to combine the best of the graph and the vector domains in order to get the advantages of both worlds. In this paper we review some of these works on graph kernels and graph embedding and we show how graph embedding can be used to obtain accurate and efficient approximations of the median graph. The median graph can be seen as the representative of a set of graphs but its application has been very limited up to now due to computational reasons. With this new approach, we can obtain an approximate median graph using real databases containing large graphs. Mots-clés : Graph Matching, Graph Embedding, Graph Kernels, Vector Spaces, Median Graph tors. Secondly, the repository of algorithmic tools based on graphs is quite limited when compared to the tools available for patterns represented using feature vectors. This is mainly due to the fact that vectors are simple structures with good mathematical properties that can be readily manipulated algebraically. For this reason, new trends in structural pattern recognition have been proposed merging both worlds in order to extend the available statistical tools to the graph domain [BUN 05]. In this way, graph kernels permit to compute the dot product of the representation of a pair of graphs in a vector space without having to define the explicit transformation between the graphs and the vector space. As a consequence all classification algorithms based on the computation of a dot product, such as Support Vector Machines (SVM) become immediately available for graphs. On the other hand, graph embedding aims to find an explicit transformation between graphs and a vector space. In this way, we can give a semantic interpretation to this transformation. In addition we can also manipulate the vectors resulting from this transformation with all the mathematical machinery that can be applied to vectors. We are not restricted to the dot product. In this paper, we firstly review the main techniques used to define graph kernels and graph embedding in sections 2 and 3, respectively. Then, in section 4 we show the application of graph embedding to a particular complex graph matching problem : the computation of the median graph. In this section we introduce the concept of median graph as a representative of a set of graphs and then, we describe how it can be efficiently computed using graph embedding. We also show some results of its application to real pattern recognition problems. Finally, in section 5 we state some conclusions and point out some challenges for the future. Fri, 31 May 2013 13:13:23 GMT http://hdl.handle.net/2117/19477 2013-05-31T13:13:23Z Valveny, Ernest; Ferrer Sumsi, Miquel no Graphs have very interesting properties for object representation in pattern recognition. However, graph matching algorithms are usually computationally complex. In addition, graphs are harder to manipulate and operate than feature vectors. In the last years, some attempts have been made to combine the best of the graph and the vector domains in order to get the advantages of both worlds. In this paper we review some of these works on graph kernels and graph embedding and we show how graph embedding can be used to obtain accurate and efficient approximations of the median graph. The median graph can be seen as the representative of a set of graphs but its application has been very limited up to now due to computational reasons. With this new approach, we can obtain an approximate median graph using real databases containing large graphs. Mots-clés : Graph Matching, Graph Embedding, Graph Kernels, Vector Spaces, Median Graph tors. Secondly, the repository of algorithmic tools based on graphs is quite limited when compared to the tools available for patterns represented using feature vectors. This is mainly due to the fact that vectors are simple structures with good mathematical properties that can be readily manipulated algebraically. For this reason, new trends in structural pattern recognition have been proposed merging both worlds in order to extend the available statistical tools to the graph domain [BUN 05]. In this way, graph kernels permit to compute the dot product of the representation of a pair of graphs in a vector space without having to define the explicit transformation between the graphs and the vector space. As a consequence all classification algorithms based on the computation of a dot product, such as Support Vector Machines (SVM) become immediately available for graphs. On the other hand, graph embedding aims to find an explicit transformation between graphs and a vector space. In this way, we can give a semantic interpretation to this transformation. In addition we can also manipulate the vectors resulting from this transformation with all the mathematical machinery that can be applied to vectors. We are not restricted to the dot product. In this paper, we firstly review the main techniques used to define graph kernels and graph embedding in sections 2 and 3, respectively. Then, in section 4 we show the application of graph embedding to a particular complex graph matching problem : the computation of the median graph. In this section we introduce the concept of median graph as a representative of a set of graphs and then, we describe how it can be efficiently computed using graph embedding. We also show some results of its application to real pattern recognition problems. Finally, in section 5 we state some conclusions and point out some challenges for the future. http://hdl.handle.net/2117/19349 Title: Segmentation robust to the vignette effect for machine vision systems Authors: Karatzas, D; Rusiñol, Marçal; Antens, Coen; Ferrer Sumsi, Miquel Abstract: The vignette effect (radial fall-off) is commonly encountered in images obtained through certain image acquisition setups and can seriously hinder automatic analysis processes. In this paper we present a fast and efficient method for dealing with vignetting in the context of object segmentation in an existing industrial inspection setup. The vignette effect is modelled here as a circular, non-linear gradient. The method estimates the gradient parameters and employs them to perform segmentation. Segmentation results on a variety of images indicate that the presented method is able to successfully tackle the vignette effect. Fri, 17 May 2013 14:48:37 GMT http://hdl.handle.net/2117/19349 2013-05-17T14:48:37Z Karatzas, D; Rusiñol, Marçal; Antens, Coen; Ferrer Sumsi, Miquel no The vignette effect (radial fall-off) is commonly encountered in images obtained through certain image acquisition setups and can seriously hinder automatic analysis processes. In this paper we present a fast and efficient method for dealing with vignetting in the context of object segmentation in an existing industrial inspection setup. The vignette effect is modelled here as a circular, non-linear gradient. The method estimates the gradient parameters and employs them to perform segmentation. Segmentation results on a variety of images indicate that the presented method is able to successfully tackle the vignette effect. http://hdl.handle.net/2117/19347 Title: Combination of OCR engines for page segmentation based on performance evaluation Authors: Ferrer Sumsi, Miquel; Valveny, Ernest Abstract: In this paper we present a method to improve the performance of individual page segmentation engines based on the combination of the output of several engines. The rules of combination are designed after analyzing the results of each individual method. This analysis is performed using a performance evaluation framework that aims at characterizing each method according to its strengths and weaknesses rather than computing a single performance measure telling which is the "best" segmentation method. Fri, 17 May 2013 14:31:18 GMT http://hdl.handle.net/2117/19347 2013-05-17T14:31:18Z Ferrer Sumsi, Miquel; Valveny, Ernest no In this paper we present a method to improve the performance of individual page segmentation engines based on the combination of the output of several engines. The rules of combination are designed after analyzing the results of each individual method. This analysis is performed using a performance evaluation framework that aims at characterizing each method according to its strengths and weaknesses rather than computing a single performance measure telling which is the "best" segmentation method. http://hdl.handle.net/2117/19344 Title: An iterative algorithm for approximate median graph computation Authors: Ferrer Sumsi, Miquel; Bunke, Horst Abstract: Recently, the median graph has been shown to be a good choice to obtain a representative of a given set of graphs. It has been successfully applied to graph-based classification and clustering. In this paper we exploit a theoretical property of the median, which has not yet been utilized in the past, to derive a new iterative algorithm for approximate median graph computation. Experiments done using five different graph databases show that the proposed approach yields, in four out of these five datasets, better medians than two of the previous existing methods. Fri, 17 May 2013 14:07:48 GMT http://hdl.handle.net/2117/19344 2013-05-17T14:07:48Z Ferrer Sumsi, Miquel; Bunke, Horst no Recently, the median graph has been shown to be a good choice to obtain a representative of a given set of graphs. It has been successfully applied to graph-based classification and clustering. In this paper we exploit a theoretical property of the median, which has not yet been utilized in the past, to derive a new iterative algorithm for approximate median graph computation. Experiments done using five different graph databases show that the proposed approach yields, in four out of these five datasets, better medians than two of the previous existing methods. http://hdl.handle.net/2117/19342 Title: An approximate algorithm for median graph computation using graph embedding Authors: Ferrer Sumsi, Miquel; Valveny, Ernest; Serratosa Casanelles, Francesc; Riesen, Kaspar; Bunke, Horst Abstract: Graphs are powerful data structures that have many attractive properties for object representation. However, some basic operations are difficult to define and implement, for instance, how to obtain a representative of a set of graphs. The median graph has been defined for that purpose, but existing algorithms are computationally complex and have a very limited applicability. In this paper we propose a new approach for the computation of the median graph based on graph embedding in vector spaces. Experiments on a real database containing large graphs show that we succeed to compute good approximations of the median graph. We have also applied the median graph to perform some basic classification tasks achieving reasonable good results. Fri, 17 May 2013 13:58:08 GMT http://hdl.handle.net/2117/19342 2013-05-17T13:58:08Z Ferrer Sumsi, Miquel; Valveny, Ernest; Serratosa Casanelles, Francesc; Riesen, Kaspar; Bunke, Horst no Graphs are powerful data structures that have many attractive properties for object representation. However, some basic operations are difficult to define and implement, for instance, how to obtain a representative of a set of graphs. The median graph has been defined for that purpose, but existing algorithms are computationally complex and have a very limited applicability. In this paper we propose a new approach for the computation of the median graph based on graph embedding in vector spaces. Experiments on a real database containing large graphs show that we succeed to compute good approximations of the median graph. We have also applied the median graph to perform some basic classification tasks achieving reasonable good results. http://hdl.handle.net/2117/19254 Title: Spatiotemporal descriptor for wide-baseline stereo reconstruction of non-rigid and ambiguous scenes Authors: Trulls Fortuny, Eduard; Sanfeliu Cortés, Alberto; Moreno-Noguer, Francesc Abstract: This paper studies the use of temporal consistency to match appearance descriptors and handle complex ambiguities when computing dynamic depth maps from stereo. Previous attempts have designed 3D descriptors over the spacetime volume and have been mostly used for monocular action recognition, as they cannot deal with perspective changes. Our approach is based on a state-of-the-art 2D dense appearance descriptor which we extend in time by means of optical flow priors, and can be applied to wide-baseline stereo setups. The basic idea behind our approach is to capture the changes around a feature point in time instead of trying to describe the spatiotemporal volume. We demonstrate its effectiveness on very ambiguous synthetic video sequences with ground truth data, as well as real sequences. Wed, 15 May 2013 13:55:05 GMT http://hdl.handle.net/2117/19254 2013-05-15T13:55:05Z Trulls Fortuny, Eduard; Sanfeliu Cortés, Alberto; Moreno-Noguer, Francesc no appearance descriptors, spatiotemporal, stereo This paper studies the use of temporal consistency to match appearance descriptors and handle complex ambiguities when computing dynamic depth maps from stereo. Previous attempts have designed 3D descriptors over the spacetime volume and have been mostly used for monocular action recognition, as they cannot deal with perspective changes. Our approach is based on a state-of-the-art 2D dense appearance descriptor which we extend in time by means of optical flow priors, and can be applied to wide-baseline stereo setups. The basic idea behind our approach is to capture the changes around a feature point in time instead of trying to describe the spatiotemporal volume. We demonstrate its effectiveness on very ambiguous synthetic video sequences with ground truth data, as well as real sequences. http://hdl.handle.net/2117/18631 Title: LPV model for PV cell and fractional control of DC-DC converter for photovoltaic systems Authors: Martínez González, Rubén; Bolea Monte, Yolanda; Grau Saldes, Antoni; Martínez García, Herminio Abstract: This paper deals with the fractional modelling of a DC-DC converter, suitable in solar-powered electrical generation systems, and the design of a fractional controller for the aforementioned switching converter. A new model for PV cells is proposed in order to obtain a linear equation for V-I characteristic via scheduling dependence of temperature and irradiance. Due to the fractional nature of the ultracapacitors this kind of controller gives a suitable and good performance. Fri, 05 Apr 2013 08:37:19 GMT http://hdl.handle.net/2117/18631 2013-04-05T08:37:19Z Martínez González, Rubén; Bolea Monte, Yolanda; Grau Saldes, Antoni; Martínez García, Herminio no This paper deals with the fractional modelling of a DC-DC converter, suitable in solar-powered electrical generation systems, and the design of a fractional controller for the aforementioned switching converter. A new model for PV cells is proposed in order to obtain a linear equation for V-I characteristic via scheduling dependence of temperature and irradiance. Due to the fractional nature of the ultracapacitors this kind of controller gives a suitable and good performance. http://hdl.handle.net/2117/18423 Title: Characterization of textile grasping experiments Authors: Alenyà Ribas, Guillem; Ramisa Ayats, Arnau; Moreno-Noguer, Francesc; Torras, Carme Abstract: Grasping highly deformable objects, like textiles, is an emerging area of research that involves both percep- tion and manipulation abilities. As new techniques appear, it becomes essential to design strategies to compare them. However, this is not an easy task, since the large state-space of textile objects explodes when coupled with the variability of grippers, robotic hands and robot arms performing the manipulation task. This high variability makes it very difficult to design experiments to evaluate the performance of a system in a repeatable way and compare it to others. We propose a framework to allow the comparison of different grasping methods for textile objects. Instead of measuring each component separately, we there- fore propose a methodology to explicitly measure the vision- manipulation correlation by taking into account the throughput of the actions. Perceptions of deformable objects should be grouped into different clusters, and the different grasping actions available should be tested for each perception type to obtain the action-perception success ratio. This characterization potentially allows to compare very different systems in terms of specialized actions , perceptions or widely useful actions , along with the cost of performing each action. We will also show that this categorization is useful in manipulation planning of deformable objects. Tue, 19 Mar 2013 17:57:49 GMT http://hdl.handle.net/2117/18423 2013-03-19T17:57:49Z Alenyà Ribas, Guillem; Ramisa Ayats, Arnau; Moreno-Noguer, Francesc; Torras, Carme no feature extraction manipulators robot vision PARAULES AUTOR: robot vision, textile manipulation, repeatable experiments, system comparison Grasping highly deformable objects, like textiles, is an emerging area of research that involves both percep- tion and manipulation abilities. As new techniques appear, it becomes essential to design strategies to compare them. However, this is not an easy task, since the large state-space of textile objects explodes when coupled with the variability of grippers, robotic hands and robot arms performing the manipulation task. This high variability makes it very difficult to design experiments to evaluate the performance of a system in a repeatable way and compare it to others. We propose a framework to allow the comparison of different grasping methods for textile objects. Instead of measuring each component separately, we there- fore propose a methodology to explicitly measure the vision- manipulation correlation by taking into account the throughput of the actions. Perceptions of deformable objects should be grouped into different clusters, and the different grasping actions available should be tested for each perception type to obtain the action-perception success ratio. This characterization potentially allows to compare very different systems in terms of specialized actions , perceptions or widely useful actions , along with the cost of performing each action. We will also show that this categorization is useful in manipulation planning of deformable objects. http://hdl.handle.net/2117/18325 Title: Probabilistic invariant image representation and associated distance measure Authors: Scandaliaris, Jorge; Sanfeliu Cortés, Alberto Fri, 15 Mar 2013 07:46:59 GMT http://hdl.handle.net/2117/18325 2013-03-15T07:46:59Z Scandaliaris, Jorge; Sanfeliu Cortés, Alberto no pattern recognition Author keywords: color invariance, color distance http://hdl.handle.net/2117/18283 Title: Online human-assisted learning using random ferns Authors: Villamizar Vergel, Michael Alejandro; Garrell Zulueta, Anais; Sanfeliu Cortés, Alberto; Moreno-Noguer, Francesc Abstract: We present an Online Random Ferns (ORFs) classifier that progressively learns and builds enhanced models of object appearances. During the learning process, we allow the human intervention to assist the classifier and discard false positive training samples. The amount of human intervention is minimized and integrated within the online learning, such that in a few seconds, complex object appearances can be learned. After the assisted learning stage, the classifier is able to detect the object under severe changing conditions. The system runs at a few frames per second, and has been validated for face and object detection tasks on a mobile robot platform. We show that with minimal human assistance we are able to build a detector robust to viewpoint changes, partial occlusions, varying lighting and cluttered backgrounds. Wed, 13 Mar 2013 17:23:20 GMT http://hdl.handle.net/2117/18283 2013-03-13T17:23:20Z Villamizar Vergel, Michael Alejandro; Garrell Zulueta, Anais; Sanfeliu Cortés, Alberto; Moreno-Noguer, Francesc no pattern recognition Author keywords: on line learning, random ferns, object detection, object recognition, human robot interaction We present an Online Random Ferns (ORFs) classifier that progressively learns and builds enhanced models of object appearances. During the learning process, we allow the human intervention to assist the classifier and discard false positive training samples. The amount of human intervention is minimized and integrated within the online learning, such that in a few seconds, complex object appearances can be learned. After the assisted learning stage, the classifier is able to detect the object under severe changing conditions. The system runs at a few frames per second, and has been validated for face and object detection tasks on a mobile robot platform. We show that with minimal human assistance we are able to build a detector robust to viewpoint changes, partial occlusions, varying lighting and cluttered backgrounds. http://hdl.handle.net/2117/18253 Title: Current-mode one-cycle control applied to linear–assisted DC/DC converters Authors: Martínez García, Herminio; Grau Saldes, Antoni; Bolea Monte, Yolanda Abstract: This article shows the proposal of a current-mode one-cycle control for linear-assisted DC/DC converters. Linear-assisted DC/DC converters are structures that allow to take advantages of the two classic alternatives in the design of power supply systems: voltage linear regulators (classic NPN topology or LDO –low dropout–) and switching DC/DC converters. The current-mode onecycle control technique is proposed in order to obtain the duty cycle of the linear-assisted converter switch. The proposed structure can provide an output with suitable load and line regulations. Thus, the paper shows the design and simulation results of the proposed currentmode one-cycle linear-assisted converter. Wed, 13 Mar 2013 10:28:34 GMT http://hdl.handle.net/2117/18253 2013-03-13T10:28:34Z Martínez García, Herminio; Grau Saldes, Antoni; Bolea Monte, Yolanda no This article shows the proposal of a current-mode one-cycle control for linear-assisted DC/DC converters. Linear-assisted DC/DC converters are structures that allow to take advantages of the two classic alternatives in the design of power supply systems: voltage linear regulators (classic NPN topology or LDO –low dropout–) and switching DC/DC converters. The current-mode onecycle control technique is proposed in order to obtain the duty cycle of the linear-assisted converter switch. The proposed structure can provide an output with suitable load and line regulations. Thus, the paper shows the design and simulation results of the proposed currentmode one-cycle linear-assisted converter. http://hdl.handle.net/2117/18243 Title: Design of non-anthropomorphic robotic hands for anthropomorphic tasks Authors: Simo Serra, Edgar; Moreno-Noguer, Francesc; Pérez Gracia, Alba Abstract: In this paper, we explore the idea of designing non- anthropomorphic multi-fingered robotic hands for tasks tha t replicate the motion of the human hand. Taking as input data a finite set of rigid-body positions for the five fingertips, we de- velop a method to perform dimensional synthesis for a kinema tic chain with a tree structure, with five branches that share thr ee common joints. We state the forward kinematics equations of relative dis- placements for each serial chain expressed as dual quaterni ons, and solve for up to five chains simultaneously to reach a numbe r of positions along the hand trajectory. This is done using a h y- brid global numerical solver that integrates a genetic algo rithm and a Levenberg-Marquardt local optimizer. Although the number of candidate solutions in this problem is very high, the use of the genetic algorithm allows us to per form an exhaustive exploration of the solution space to obtain a s et of solutions. We can then choose some of the solutions based on t he specific task to perform. Note that these designs match the ta sk exactly while generally having a finger design radically dif ferent from that of the human hand. Tue, 12 Mar 2013 18:21:39 GMT http://hdl.handle.net/2117/18243 2013-03-12T18:21:39Z Simo Serra, Edgar; Moreno-Noguer, Francesc; Pérez Gracia, Alba no robot kinematics PARAULES AUTOR:kinematic synthesis, robot design In this paper, we explore the idea of designing non- anthropomorphic multi-fingered robotic hands for tasks tha t replicate the motion of the human hand. Taking as input data a finite set of rigid-body positions for the five fingertips, we de- velop a method to perform dimensional synthesis for a kinema tic chain with a tree structure, with five branches that share thr ee common joints. We state the forward kinematics equations of relative dis- placements for each serial chain expressed as dual quaterni ons, and solve for up to five chains simultaneously to reach a numbe r of positions along the hand trajectory. This is done using a h y- brid global numerical solver that integrates a genetic algo rithm and a Levenberg-Marquardt local optimizer. Although the number of candidate solutions in this problem is very high, the use of the genetic algorithm allows us to per form an exhaustive exploration of the solution space to obtain a s et of solutions. We can then choose some of the solutions based on t he specific task to perform. Note that these designs match the ta sk exactly while generally having a finger design radically dif ferent from that of the human hand. http://hdl.handle.net/2117/18241 Title: Robust non-rigid registration of 2D and 3D graphs Authors: Serradell, Eduard; Glowacki, Przemyslaw; Jan, Kybic; Moreno-Noguer, Francesc; Fua, Pascal Abstract: We present a new approach to matching graphs embedded in R2 or R3. Unlike earlier methods, our approach does not rely on the similarity of local appearance features, does not require an initial alignment, can handle partial matches, and can cope with non-linear deformations and topological differences. To handle arbitrary non-linear deformations, we represent them as Gaussian Processes. In the absence of appearance information, we iteratively establish correspondences between graph nodes, update the structure accordingly, and use the current mapping estimate to find the most likely correspondences that will be used in the next iteration. This makes the computation tractable. We demonstrate the effectiveness of our approach first on synthetic cases and then on angiography data, retinal fundus images, and microscopy image stacks acquired at very different resolutions. Tue, 12 Mar 2013 18:06:06 GMT http://hdl.handle.net/2117/18241 2013-03-12T18:06:06Z Serradell, Eduard; Glowacki, Przemyslaw; Jan, Kybic; Moreno-Noguer, Francesc; Fua, Pascal no computer vision Author keywords: deformable models, medical imaging, graph matching We present a new approach to matching graphs embedded in R2 or R3. Unlike earlier methods, our approach does not rely on the similarity of local appearance features, does not require an initial alignment, can handle partial matches, and can cope with non-linear deformations and topological differences. To handle arbitrary non-linear deformations, we represent them as Gaussian Processes. In the absence of appearance information, we iteratively establish correspondences between graph nodes, update the structure accordingly, and use the current mapping estimate to find the most likely correspondences that will be used in the next iteration. This makes the computation tractable. We demonstrate the effectiveness of our approach first on synthetic cases and then on angiography data, retinal fundus images, and microscopy image stacks acquired at very different resolutions. http://hdl.handle.net/2117/18132 Title: Buck–Boost DC-DC converter with fractional control Authors: Martínez García, Herminio; Grau Saldes, Antoni; Bolea Monte, Yolanda; Martínez González, Rubén Abstract: This paper deals with the fractional modeling of a DC-DC buck-boost converter, suitable in solar-powered electrical generation systems, and the design of a fractional controller for the aforementioned switching converter. Although the modeling and design of the controller is carried out for this particular DC-DC converter, it can be easily extended to other kind of switching converter. In addition, the comparison between integer-order plant/controller and fractional-order plants/controller is carried out. The article also shows that, under the same design conditions, the fractional-order controller has a better performance and behaviour than the classical integer-order controller in both situations, that is, with integer-order plant and fractional-order plant models. Thu, 07 Mar 2013 13:21:12 GMT http://hdl.handle.net/2117/18132 2013-03-07T13:21:12Z Martínez García, Herminio; Grau Saldes, Antoni; Bolea Monte, Yolanda; Martínez González, Rubén no This paper deals with the fractional modeling of a DC-DC buck-boost converter, suitable in solar-powered electrical generation systems, and the design of a fractional controller for the aforementioned switching converter. Although the modeling and design of the controller is carried out for this particular DC-DC converter, it can be easily extended to other kind of switching converter. In addition, the comparison between integer-order plant/controller and fractional-order plants/controller is carried out. The article also shows that, under the same design conditions, the fractional-order controller has a better performance and behaviour than the classical integer-order controller in both situations, that is, with integer-order plant and fractional-order plant models.