Helena Cristina da Gama Leitão

Learn More
We describe here an efficient algorithm for re-assembling one or more unknown objects that have been broken or torn into a large number N of irregular fragments—a problem that often arises in achaeology, art restoration, forensics, and other disciplines. The algorithm compares the curvatureencoded fragment outlines, using a modified dynamic programming(More)
Reassembling unknown broken objects from a large collection of fragments is a common problem in archaeology and other fields. Computer tools have recently been developed, by the authors and by others, which try to help by identifying pairs of fragments with matching outline shapes. Those tools have been successfully tested on small collections of fragments;(More)
The necessary information to reproduce and keep an organism is codified in acid nucleic molecules. Deepening the knowledge about how the information is stored in these bio-sequences can lead to more efficient methods of comparing genomic sequences. In the present study, we analyzed the quantity of information contained in a DNA sequence that can be useful(More)
We describe an ongoing research project on efficient methods for reconstruction of objects from large collections of irregular fragments, such as ancient pottery, collapsed murals, etc.. Our solution for flat objects uses multiscale matching and constrained dynamic programming, and we are now extending it to curved pottery fragments. We seek collaborative(More)
The recognition of splice sites plays an important role in the annotation of the eukaryotic genes structure. The detection of such sites is a highly imbalanced classification task because the number of negatives examples found in the DNA sequences is much higher than the number of positive ones. One possible strategy to deal with this particularity is to(More)
We describe a robust method to recover the depth coordinate from a normal or slope map of a scene, obtained e.g. through photometric stereo or interferometry. The key feature of our method is the fast solution of the Poisson-like integration equations by a multi-scale iterative technique. The method accepts a weight map that can be used to exclude regions(More)