Selective sampling for nearest neighbor classifiers
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Selective Sampling for Nearest Neighbor Classifiers
Machine Learning
Geodesic Remeshing Using Front Propagation
International Journal of Computer Vision
Image compression by linear splines over adaptive triangulations
Signal Processing
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Design of farthest-point masks for image halftoning
EURASIP Journal on Applied Signal Processing
Analysis of Two-Dimensional Non-Rigid Shapes
International Journal of Computer Vision
Nonlinear Dimensionality Reduction by Topologically Constrained Isometric Embedding
International Journal of Computer Vision
Invariant image reconstruction from irregular samples and hexagonal grid splines
Image and Vision Computing
Spectral-Driven Isometry-Invariant Matching of 3D Shapes
International Journal of Computer Vision
Consistent estimation of non-bandlimited spectral density from uniformly spaced samples
IEEE Transactions on Information Theory
NF-features - no-feature-features for representing non-textured regions
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part II
Geodesic Methods in Computer Vision and Graphics
Foundations and Trends® in Computer Graphics and Vision
SMI 2011: Full Paper: Geometric models with weigthed topology
Computers and Graphics
FIMH'11 Proceedings of the 6th international conference on Functional imaging and modeling of the heart
Farthest-point optimized point sets with maximized minimum distance
Proceedings of the ACM SIGGRAPH Symposium on High Performance Graphics
ASOD: Arbitrary shape object detection
Engineering Applications of Artificial Intelligence
Shape- and pose-invariant correspondences using probabilistic geodesic surface embedding
DAGM'11 Proceedings of the 33rd international conference on Pattern recognition
Fast marching for robust surface segmentation
PIA'11 Proceedings of the 2011 ISPRS conference on Photogrammetric image analysis
Robust expression-invariant face recognition from partially missing data
ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part III
ISSADS'05 Proceedings of the 5th international conference on Advanced Distributed Systems
Isometry-invariant matching of point set surfaces
EG 3DOR'08 Proceedings of the 1st Eurographics conference on 3D Object Retrieval
Proceedings of the Second International Conference on Computational Science, Engineering and Information Technology
Recoverable tamper proofing technique for image authentication using irregular sampling coding
ATC'07 Proceedings of the 4th international conference on Autonomic and Trusted Computing
Scale Normalization for Isometric Shape Matching
Computer Graphics Forum
| Hi-index | 0.07 |
A new method of farthest point strategy (FPS) for progressive image acquisition-an acquisition process that enables an approximation of the whole image at each sampling stage-is presented. Its main advantage is in retaining its uniformity with the increased density, providing efficient means for sparse image sampling and display. In contrast to previously presented stochastic approaches, the FPS guarantees the uniformity in a deterministic min-max sense. Within this uniformity criterion, the sampling points are irregularly spaced, exhibiting anti-aliasing properties comparable to those characteristic of the best available method (Poisson disk). A straightforward modification of the FPS yields an image-dependent adaptive sampling scheme. An efficient O(N log N) algorithm for both versions is introduced, and several applications of the FPS are discussed