#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2007

2012

- This year (0)
- Last 5 years (1)
- Last 10 years (6)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

- Xingwei Yang, Suzan Köknar-Tezel, Longin Jan Latecki
- 2009 IEEE Conference on Computer Vision and…
- 2009

The matching and retrieval of 2D shapes is an important challenge in computer vision. A large number of shape similarity approaches have been developed, with the main focus being the comparison or matching of pairs of shapes. In these approaches, other shapes do not influence the similarity measure of a given pair of shapes. In the proposed approach, other… (More)

- Longin Jan Latecki, Qiang Wang, Suzan Köknar-Tezel, Vasileios Megalooikonomou
- Seventh IEEE International Conference on Data…
- 2007

We consider the problem of elastic matching of sequences of real numbers. Since both a query and a target sequence may be noisy, i.e., contain some outlier elements, it is desirable to exclude the outlier elements from matching in order to obtain a robust matching performance. Moreover, in many applications like shape alignment or stereo correspondence it… (More)

- Suzan Köknar-Tezel, Longin Jan Latecki
- Knowledge and Information Systems
- 2010

Imbalanced data sets present a particular challenge to the data mining community. Often, it is the rare event that is of interest and the cost of misclassifying the rare event is higher than misclassifying the usual event. When the data is highly skewed toward the usual, it can be very difficult for a learning system to accurately detect the rare event.… (More)

- Suzan Köknar-Tezel, Longin Jan Latecki
- 2009 Ninth IEEE International Conference on Data…
- 2009

Imbalanced data sets present a particular challenge to the data mining community. Often, it is the rare event that is of interest and the cost of misclassifying the rare event is higher than misclassifying the usual event. When the data is highly skewed toward the usual, it can be very difficult for a learning system to accurately detect the rare event.… (More)

- Xingwei Yang, Xiang Bai, Suzan Köknar-Tezel, Longin Jan Latecki
- Journal of Mathematical Imaging and Vision
- 2012

Sparse data sets are an ever-present problem in many fields of computer science. In the shape retrieval community, several researchers use graph transduction algorithms to reveal the underlying structure of the shape manifold. Without an infinite number of shapes, the data sets can only imprecisely describe the shape manifold. For this problem, adding… (More)

iv ACKNOWLEDGEMENT vi DEDICATION viii LIST OF FIGURES xi LIST OF TABLES xiv

- ‹
- 1
- ›