Image segmentation is one of the most difficult tasks in image processing. Segmentation algorithms are generally based on searching a region where pixels share similar gray level intensity and satisfy a set of defined criteria. However, the segmented region cannot be used directly for partial image retrieval. In this dissertation, a Contour Based Image Structure (CBIS) model is introduced. In t...

Matching concept descriptions against concept patterns was introduced as a new inference task in Description Logics (DLs) almost 20 years ago, motivated by applications in the Classic system. For the DL EL, it was shown in 2000 that the matching problem is NP-complete. It then took almost 10 years before this NP-completeness result could be extended from matching to unification in EL. The next ...

In this paper, we propose a modified approach for the basic meet-in-the-middle attack which we call differential sieving for 2-step matching. This technique improves the scope of the basic meet in the middle attack by providing means to extend the matching point for an extra round through differential matching and hence the overall number of the attacked rounds is extended. Our approach starts ...

A matching of size 2n is a partition of the set [2n] = {1, 2, . . . , 2n} into n disjoint pairs. A matching may be identified with a canonical sequence, which is a sequence of integers in which each integer i ∈ [n] occurs exactly twice, and the first occurrence of i precedes the first occurrence of i+ 1. A partial pattern with k symbols is a sequence of integers from the set [k], in which each ...

Often, stereo matching is treated as two quite independent subprocesses: segmentation, followed by matching. In this paper, we treat these processes as naturally related, with partial matching results feeding back into the segmentation and both proceeding simultaneously in a cooperative fashion. We consider regions as the primitives to be matched, and our implementation is based upon maintainin...

Managing semantic heterogeneity is a complex task. One solution involves matching like terms to each other. We view Match as an operator that takes two graph-like structures (e.g., concept hierarchies or ontologies) and returns a mapping between the nodes of the graphs that correspond semantically to each other. State of the art matching systems (e.g., COMA, Cupid) perform well for many real wo...

of Dissertation presented to COPPE/UFRJ as a partial fulfillment of the requirements for the degree of Master of Science (M.Sc.) PROBABILISTIC POINT MATCHING Gustavo Thebit Pfeiffer

The conventional search algorithms for block motion estimation reduce the set of possible displacements for locating the motion vector. All of these algorithms produce some quality degradation of the predicted image. To reduce the computational complexity of the full search algorithm without introducing any loss in the predicted image, we propose an adaptive partial distortion search algorithm ...

This paper describes the use of partial Pad e approximation to generate stable and passive reduced-order models of linear circuits. For similarly-sized models, partial Pad e-based reduced-oreder modeling has superior moment-matching capabilities than competing techniques based on the Arnoldi process. The paper introduces PVL, an algorithm for computing partial Pad e-based reduced-order models v...

In this paper, we present an algorithm for detecting partial Euclidean symmetries in volume data. Our algorithm finds subsets in voxel data that map to each other approximately under translations, rotations, and reflections. We implement the search for partial symmetries efficiently and robustly using a feature-based approach: We first reduce the volume to salient line features and then create ...