We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
Many vision tasks are posed as either graph partitioning (coloring) or graph matching (correspondence) problems. The former include segmentation and grouping, and the latter inclu...
Recognizing texts from camera images is a known hard problem because of the difficulties in text segmentation from the varied and complicated backgrounds. In this paper, we propo...
Breast cancer conservative treatment (BCCT) is considered the gold standard of breast cancer treatment. However, aesthetic results are heterogeneous and difficult to evaluate in ...
Ricardo Sousa, Jaime S. Cardoso, Joaquim F. Pinto ...
In this paper, we introduce to the special domain of image annotation watermarking, based on embedding of hierarchical data related to objects into user-selected areas on an image...