Sciweavers

155 search results - page 14 / 31
» Fast matrix rank algorithms and applications
Sort
View
BMCBI
2007
138views more  BMCBI 2007»
14 years 9 months ago
Fast computation of distance estimators
Background: Some distance methods are among the most commonly used methods for reconstructing phylogenetic trees from sequence data. The input to a distance method is a distance m...
Isaac Elias, Jens Lagergren
ECCV
2004
Springer
15 years 11 months ago
Characterization of Human Faces under Illumination Variations Using Rank, Integrability, and Symmetry Constraints
Photometric stereo algorithms use a Lambertian reflectance model with a varying albedo field and involve the appearances of only one object. This paper extends photometric stereo a...
Shaohua Kevin Zhou, Rama Chellappa, David W. Jacob...
CIMAGING
2009
184views Hardware» more  CIMAGING 2009»
14 years 10 months ago
Fast space-varying convolution and its application in stray light reduction
Space-varying convolution often arises in the modeling or restoration of images captured by optical imaging systems. For example, in applications such as microscopy or photography...
Jianing Wei, Guangzhi Cao, Charles A. Bouman, Jan ...
CORR
2007
Springer
132views Education» more  CORR 2007»
14 years 9 months ago
Fast Algorithm and Implementation of Dissimilarity Self-Organizing Maps
In many real-world applications, data cannot be accurately represented by vectors. In those situations, one possible solution is to rely on dissimilarity measures that enable a se...
Brieuc Conan-Guez, Fabrice Rossi, Aïcha El Go...
117
Voted
DAGSTUHL
2007
14 years 11 months ago
Convergence of iterative aggregation/disaggregation methods based on splittings with cyclic iteration matrices
Iterative aggregation/disaggregation methods (IAD) belong to competitive tools for computation the characteristics of Markov chains as shown in some publications devoted to testing...
Ivo Marek, Ivana Pultarová, Petr Mayer