2272 search results - page 53 / 455 » Capture Complexity by Partition |
ICIP
2006
IEEE
15 years 11 months ago
2006
IEEE
We address unsupervised variational segmentation ofmulti-look complex polarimetric images using a Wishart observation model via level sets. The methods consists of minimizing a fu...
DCC
2005
IEEE
15 years 9 months ago
2005
IEEE
ct A very fast, low complexity algorithm for resolution scalable and random access decoding is presented. The algorithm is based on AGP (Alphabet and Group Partitioning) [1], where...
104
click to vote
DCC
2004
IEEE
15 years 9 months ago
2004
IEEE
We present an algorithm for lossy compression of hyperspectral images for implementation on field programmable gate arrays (FPGA). To greatly reduce the bit rate required to code ...
ICTCS
2005
Springer
15 years 3 months ago
2005
Springer
Given a vertex-weighted graph G = (V, E; w), w(v) ≥ 0 for any v ∈ V , we consider a weighted version of the coloring problem which consists in finding a partition S = (S1, . ...
105
click to vote
EC
2008
14 years 9 months ago
2008
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...