Sciweavers

3630 search results - page 114 / 726
» Fast Marching Methods
Sort
View
IDA
1998
Springer
15 years 6 months ago
Fast Dimensionality Reduction and Simple PCA
A fast and simple algorithm for approximately calculating the principal components (PCs) of a data set and so reducing its dimensionality is described. This Simple Principal Compo...
Matthew Partridge, Rafael A. Calvo
ICIP
2003
IEEE
16 years 8 months ago
Smoothing B-spline active contour for fast and robust image and video segmentation
This paper deals with fast image and video segmentation using active contours. Region based active contours using level-sets are powerful techniques for video segmentation but the...
Frédéric Precioso, Michel Barlaud, T...
ICIP
1998
IEEE
16 years 7 months ago
Fast Blind Inverse Halftoning
We present a fast, non-iterative technique for producing grayscale images from error diffused and dithered halftones. The first stage of the algorithm consists of a Gaussian filte...
Niranjan Damera-Venkata, Thomas D. Kite, Mahalaksh...
CSE
2009
IEEE
16 years 1 months ago
Fast Fusion of Medical Images Based on Bayesian Risk Minimization and Pixon Map
Fast fusion of multiple registered out-of-focus images is of great interest in medical imaging; for example, the thoracic cavity is always too bumpy to be focused on all parts at ...
Hongbo Zhou, Qiang Cheng, Mehdi Zargham
ARITH
2005
IEEE
15 years 12 months ago
Fast Modular Reduction for Large Wordlengths via One Linear and One Cyclic Convolution
Abstract— Modular reduction is a fundamental operation in cryptographic systems. Most well known modular reduction methods including Barrett’s and Montgomery’s algorithms lev...
Dhananjay S. Phatak, Tom Goff