Sciweavers

4581 search results - page 52 / 917
» Computing Transformation Semigroups
Sort
View
73
Voted
ICASSP
2011
IEEE
14 years 4 months ago
Efficient discrete fractional Hirschman optimal transform and its application
All of the existing N-point discrete fractional signal transforms require O(N2 ) computation complexity. In this paper, we propose a new discrete fractional signal transform whose...
Wen-Liang Hsue, Soo-Chang Pei, Jian-Jiun Ding
ICPR
2008
IEEE
15 years 7 months ago
Constrained clustering by a novel graph-based distance transformation
In this work we present a novel method to model instance-level constraints within a clustering algorithm. Thereby, both similarity and dissimilarity constraints can be used coeval...
Kai Rothaus, Xiaoyi Jiang
116
Voted
CORR
2008
Springer
112views Education» more  CORR 2008»
15 years 27 days ago
The discrete Fourier transform: A canonical basis of eigenfunctions
We exhibit a canonical basis of eigenvectors for the discrete Fourier transform (DFT). The transition matrix from the standard basis to defines a novel transform which we call ...
Shamgar Gurevich, Ronny Hadani, Nir A. Sochen
ENTCS
2006
172views more  ENTCS 2006»
15 years 25 days ago
Efficient Detection of Conflicts in Graph-based Model Transformation
Using graph transformation as a formalism to specify model transformation, termination and confluence of the graph transformation system are often required properties. Only under ...
Leen Lambers, Hartmut Ehrig, Fernando Orejas
90
Voted
ICPR
2004
IEEE
16 years 1 months ago
Online Learning of Color Transformation for Interactive Object Recognition under Various Lighting Conditions
This paper describes an online learning method of color transformation for interactive object recognition. In order to recognize objects under various lighting conditions, the sys...
Nobutaka Shimada, Yasushi Makihara, Yoshiaki Shira...