902 resultados para Miguel Jiménez López


Relevância:

80.00% 80.00%

Publicador:

Resumo:

Deformable Template models are first applied to track the inner wall of coronary arteries in intravascular ultrasound sequences, mainly in the assistance to angioplasty surgery. A circular template is used for initializing an elliptical deformable model to track wall deformation when inflating a balloon placed at the tip of the catheter. We define a new energy function for driving the behavior of the template and we test its robustness both in real and synthetic images. Finally we introduce a framework for learning and recognizing spatio-temporal geometric constraints based on Principal Component Analysis (eigenconstraints).

Relevância:

80.00% 80.00%

Publicador:

Resumo:

In this paper we introduce a probabilistic approach to support visual supervision and gesture recognition. Task knowledge is both of geometric and visual nature and it is encoded in parametric eigenspaces. Learning processes for compute modal subspaces (eigenspaces) are the core of tracking and recognition of gestures and tasks. We describe the overall architecture of the system and detail learning processes and gesture design. Finally we show experimental results of tracking and recognition in block-world like assembling tasks and in general human gestures.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

This paper deals with stability properties of the feasible set of linear inequality systems having a finite number of variables and an arbitrary number of constraints. Several types of perturbations preserving consistency are considered, affecting respectively, all of the data, the left-hand side data, or the right-hand side coefficients.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

This paper provides new versions of the Farkas lemma characterizing those inequalities of the form f(x) ≥ 0 which are consequences of a composite convex inequality (S ◦ g)(x) ≤ 0 on a closed convex subset of a given locally convex topological vector space X, where f is a proper lower semicontinuous convex function defined on X, S is an extended sublinear function, and g is a vector-valued S-convex function. In parallel, associated versions of a stable Farkas lemma, considering arbitrary linear perturbations of f, are also given. These new versions of the Farkas lemma, and their corresponding stable forms, are established under the weakest constraint qualification conditions (the so-called closedness conditions), and they are actually equivalent to each other, as well as equivalent to an extended version of the so-called Hahn–Banach–Lagrange theorem, and its stable version, correspondingly. It is shown that any of them implies analytic and algebraic versions of the Hahn–Banach theorem and the Mazur–Orlicz theorem for extended sublinear functions.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

Purpose. To investigate the spatiotemporal relationship between rod and cone degeneration in the P23H-1 rat. Methods. Control Sprague-Dawley (SD) and P23H-1 rats of ages ranging from P30 to P365 were used. Retinas were processed for whole mounts or cross sections and rods and cones were immunodetected. We used newly developed image analysis techniques to quantify the total population of L/M cones (the most abundant cones in the rat) and analyzed the rings of rod-cone degeneration. Results. In P23H-1 rats, rod degeneration occurs rapidly: first the rod outer segment shortens, at P30 there is extensive rod loss, and by P180 rod loss is almost complete except for the most peripheral retina. The numbers of L/M cones are, at all postnatal ages, lower in P23H-1 rats than in control SD rats, and decrease significantly with age (by P180). Rod and cone degeneration is spatiotemporally related and occurs in rings that appear already at P90 and spread throughout the entire retina. At P180, the rings of rod-cone degeneration are more abundant in the equatorial retina and are larger in the dorsal retina. Conclusions. This work describes for the first time that in the P23H-1 rat, rod and cone degeneration is spatiotemporally related and occurs in rings. Cone loss follows rod loss and starts very soon, even before P30, the first age analyzed here. The characteristics of the rings suggest that secondary cone degeneration is influenced by retinal position and/or other intrinsic or extrinsic factors.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

This article provides results guarateeing that the optimal value of a given convex infinite optimization problem and its corresponding surrogate Lagrangian dual coincide and the primal optimal value is attainable. The conditions ensuring converse strong Lagrangian (in short, minsup) duality involve the weakly-inf-(locally) compactness of suitable functions and the linearity or relative closedness of some sets depending on the data. Applications are given to different areas of convex optimization, including an extension of the Clark-Duffin Theorem for ordinary convex programs.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

Se plantea al alumnado el análisis de la huella de carbono que tiene, en la actualidad, la asignatura práctica Experimentación en Química Inorgánica, con el objetivo de que busquen las posibilidades de sustitución y/o reducción de reactivos tóxicos y peligrosos en las prácticas de laboratorio que se imparten. Previamente, en base a dicho análisis, la red ha redactado las directrices que guiarán al alumno en sus búsquedas en bases de datos y su proposición de sustitución razonada de reactivos. Cada grupo de alumnos que trabaja en un proyecto particular de “Síntesis y caracterización de sustancias inorgánicas”, redacta un protocolo de actuación para eliminar/reducir el uso de reactivos peligrosos/contaminantes en su proyecto. Como colofón, se redacta un protocolo global para hacer más sostenible el proceso de enseñanza/aprendizaje de esta asignatura práctica. Además de trabajar el contenido específico de la asignatura, con esta metodología de aprendizaje, se pretende aumentar la capacidad del alumnado del Grado en Química para ser autónomo a la hora de proponer actuaciones fundamentadas que conduzcan a preservar el medio ambiente en su futuro ejercicio de la profesión de graduado en química.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

The Remez penalty and smoothing algorithm (RPSALG) is a unified framework for penalty and smoothing methods for solving min-max convex semi-infinite programing problems, whose convergence was analyzed in a previous paper of three of the authors. In this paper we consider a partial implementation of RPSALG for solving ordinary convex semi-infinite programming problems. Each iteration of RPSALG involves two types of auxiliary optimization problems: the first one consists of obtaining an approximate solution of some discretized convex problem, while the second one requires to solve a non-convex optimization problem involving the parametric constraints as objective function with the parameter as variable. In this paper we tackle the latter problem with a variant of the cutting angle method called ECAM, a global optimization procedure for solving Lipschitz programming problems. We implement different variants of RPSALG which are compared with the unique publicly available SIP solver, NSIPS, on a battery of test problems.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

Given a convex optimization problem (P) in a locally convex topological vector space X with an arbitrary number of constraints, we consider three possible dual problems of (P), namely, the usual Lagrangian dual (D), the perturbational dual (Q), and the surrogate dual (Δ), the last one recently introduced in a previous paper of the authors (Goberna et al., J Convex Anal 21(4), 2014). As shown by simple examples, these dual problems may be all different. This paper provides conditions ensuring that inf(P)=max(D), inf(P)=max(Q), and inf(P)=max(Δ) (dual equality and existence of dual optimal solutions) in terms of the so-called closedness regarding to a set. Sufficient conditions guaranteeing min(P)=sup(Q) (dual equality and existence of primal optimal solutions) are also provided, for the nominal problems and also for their perturbational relatives. The particular cases of convex semi-infinite optimization problems (in which either the number of constraints or the dimension of X, but not both, is finite) and linear infinite optimization problems are analyzed. Finally, some applications to the feasibility of convex inequality systems are described.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

This paper studies stability properties of linear optimization problems with finitely many variables and an arbitrary number of constraints, when only left hand side coefficients can be perturbed. The coefficients of the constraints are assumed to be continuous functions with respect to an index which ranges on certain compact Hausdorff topological space, and these properties are preserved by the admissible perturbations. More in detail, the paper analyzes the continuity properties of the feasible set, the optimal set and the optimal value, as well as the preservation of desirable properties (boundedness, uniqueness) of the feasible and of the optimal sets, under sufficiently small perturbations.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

Mode of access: Internet.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

Mode of access: Internet.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

Mode of access: Internet.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

Mode of access: Internet.