Person:
Muñoz López, Susana

Loading...
Profile Picture
First Name
Susana
Last Name
Muñoz López
Affiliation
Universidad Complutense de Madrid
Faculty / Institute
Informática
Department
Estadística e Investigación Operativa
Area
Estadística e Investigación Operativa
Identifiers
UCM identifierScopus Author IDDialnet ID

Search Results

Now showing 1 - 3 of 3
  • Item
    An Improved Iterative Binary Coloring Procedure for Color Image Segmentation
    (Foundations of intelligent systems, 2012) Montero, Javier; Muñoz López, Susana; Gómez, D.; Wang, Yinglin; Li, Tianrui
    n this work we present an improvement on an iterative binary coloring procedure for image segmentation taken from the literature. We introduce some modifications in the way of dealing with the so-called inconsistent pixels, and we show the results obtained by applying both procedures to a satellite image of the province of Seville. The computational experience that we have performed shows that, in general, the modified procedure leads to images of similar or better quality than the ones obtained by the original procedure, as well as to a significant reduction of the number of final regions.
  • Item
    Segmentación y clasificación en la toma de decisiones
    (1ª Reunión Científica Instituto de Geociencias IGEO (CSIC-UCM), 2011) Montero, Javier; Ardizone García, Juan Alfonso; Franco, Camilo; García-Santesmases, J M; Garmendia, L.; Gómez, Daniel; González del Campo Rodríguez Barbero, Ramón; Lopez, Victoria; Muñoz López, Susana; Ortuño, M. T.; Roanes-Lozano, E.; Rodríguez, Juan Tinguaro; Rojas, Karina; Tirado, Gregorio; Vitoriano, Begoña; Yáñez, Javier; Zarrazola, E.; Pérez-Monserrat, Elena Mercedes; Charco Romero, María
  • Item
    Designing Rapid Transit Networks from the Results of a Survey
    (2010) Escudero, L.F.; Muñoz López, Susana
    In this work we present a two-stage approach for designing rapid transit networks. It is based on another approach that we described elsewhere. In the first stage, the stations and links to be constructed are selected by solving an integer linear programming model that maximizes an estimation of the number of trips through the rapid transit network. In the second stage, a set of lines is generated by utilizing a greedy heuristic procedure that, taking into consideration the transfers that should be made by the users to arrive at their destinations, attempts to maximize a more accurate estimation for the number of trips. This new estimation is done by means of a modification of the well-known Floyd-Warshall algorithm. The main contributions are a novel way of computing the expected number of trips by making use of the results from a survey amongst the potential users of the rapid transit network, as well as the contemplation of the possibility of linking certain pairs of station locations by more than one line. Some computational experiments on several randomly generated instances are also reported.