8669 search results - page 1586 / 1734 » Computing matrix representations |
138
Voted
PAMI
2006
15 years 1 months ago
2006
The k-means algorithm is widely used for clustering because of its computational efficiency. Given n points in d-dimensional space and the number of desired clusters k, k-means see...
111
click to vote
TFS
2008
2008
Type-2 Fuzzy Markov Random Fields and Their Application to Handwritten Chinese Character Recognition
15 years 1 months ago
In this paper, we integrate type-2 (T2) fuzzy sets with Markov random fields (MRFs) referred to as T2 FMRFs, which may handle both fuzziness and randomness in the structural patter...
122
click to vote
TIP
2008
15 years 1 months ago
2008
Changes in motion properties of trajectories provide useful cues for modeling and recognizing human activities. We associate an event with significant changes that are localized in...
153
click to vote
TIP
2008
15 years 1 months ago
2008
This paper discusses the use of Binary Partition Trees (BPTs) for object detection. BPTs are hierarchical region-based representations of images. They define a reduced set of regio...
108
click to vote
JALC
2007
15 years 1 months ago
2007
Merging states in finite automata is a main method of reducing the size of the representation of regular languages. The process has been extensively studied for deterministic fi...