644 search results - page 20 / 129 » Decomposition Complexity |
129
click to vote
GC
2007
Springer
15 years 14 days ago
2007
Springer
We propose a novel subdivision of the plane that consists of both convex polygons and pseudotriangles. This pseudo-convex decomposition is significantly sparser than either conve...
122
click to vote
ICIP
2003
IEEE
16 years 2 months ago
2003
IEEE
Image Processing and Computer Vision applications often require finding a particular pattern in a set of images. The task involves finding appearances of a given pattern in an ima...
RECOMB
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Hierarchical clustering is a popular method for grouping together similar elements based on a distance measure between them. In many cases, annotation information for som...
99
Voted
ICIP
2003
IEEE
16 years 2 months ago
2003
IEEE
In this paper, we first discuss the singular value decomposition (SVD) of a quaternion matrix and propose an algorithm to calculate the SVD of a quaternion matrix using its equiva...
125
click to vote
CODES
2006
IEEE
15 years 6 months ago
2006
IEEE
Modern embedded systems for image processing involve increasingly complex levels of functionality under real-time and resourcerelated constraints. As this complexity increases, th...