Person:
Muñoz López, Susana

Profile Picture
First Name
Susana
Last Name
Muñoz López
URI
https://hdl.handle.net/20.500.14352/78695
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

Filters

2005 - 200922010 - 20123
Reset filters

Settings

End date: 2019 ×

Search Results

Now showing 1 - 5 of 5
  • Thumbnail Image
    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.
  • Thumbnail Image
    Item
    Coloring fuzzy graphs
    (OMEGA - The International Journal of Management Science, 2005) Ortuño, M. T.; Ramírez, Javier; Yáñez, Javier ; Muñoz López, Susana
    Given a graph G = (V, E), a coloring function C assigns an integer value C(i) to each node i epsilon V in such a way that the extremes of any edge {i,j} epsilon E cannot share the same color, i.e., C(i) epsilon C(j). Two different approaches to the graph coloring problem of a fuzzy graph 6 = ( V, (E) over tilde) are introduced in this paper. The classical concept of the (crisp) chromatic number of a graph is generalized for these approaches. The first approach is based on the successive coloring functions C-x of the crisp graphs G(x) = (T E.), the alpha-cuts of (G) over tilde; the traffic lights problem is analyzed following this approach. The second approach is based on an extension of the concept of coloring function by means of a distance defined between colors; a timetabling problem is analyzed within this approach. An exact algorithm for obtaining the chromatic number associated with the second approach is proposed, and some computational results on randomly generated fuzzy graphs are reported.
  • Thumbnail Image
    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
  • Thumbnail Image
    Item
    Fuzzy information representation for decision aiding
    (Proceedings of the IPMU Conference, Málaga, Spain, 2008) Montero, Javier; Gomez, D.; Muñoz López, Susana; Magdalena, L.; Ojeda-Aciego, M.; Verdegay, J.L.
    In this paper we want to stress the relevance of decision aid procedures in complex decision making problems and claim for an extra effort in order to develop appropriate representation tools when fuzzy criteria or objectives are present. In particular, we point out how some painting algorithms may help decision makers to understand problems subject to fuzziness based upon a graphical first approach, like Statistics use to do. Moreover, we point out that although the standard communication tool with machines are either data or words, we should also consider certain families of graphics for such a role, mainly for the output.
  • Thumbnail Image
    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.