Zenilton Kleber Gonçalves do Patrocínio

Learn More
— Traffic Grooming Problem (TGP) deals with efficiently combining low-speed traffic streams into high-capacity wavelength channels in order to improve bandwidth utilization and minimize network cost. In this paper, we investigate TGP in WDM optical networks regardless of underlying physical topology. The problem is formulated as an integer linear program(More)
Video clip localization consists in identifying real positions of a specific video clip in a video stream. To cope with this problem, we propose a new approach considering the maximum cardinality matching of a bipartite graph to measure video clip similarity with a target video stream which has not been prep recessed. We show that our approach locates(More)
This paper addresses gradual transition detection which is part of video segmentation problem, and consists in identifying the boundary between consecutive shots. In this work, we propose an approach to cope with gradual transition detection in which we define and use a new dissimilarity measure based on the size of the maximum cardinality matching(More)
This paper addresses transition detection which consists in identifying the boundary between consecutive shots. In this work, we propose an approach to cope with transition detection in which we define and use a new dissimilarity measure based on the size of the maximum cardinality matching calculated using a bipartite graph with respect to a sliding(More)