Results 1 - 10
of
2,857,796
Performance evaluation of document image algorithms
- In: Workshop on Graphics Recognition (GREC
, 2000
"... Performance evaluation for document image processing has a differ-ent emphasis than performance evaluation in other areas of image processing. Other areas of image processing can tolerate some error. Because it is so easily done nearly perfectly by humans, document ..."
Abstract
-
Cited by 5 (0 self)
- Add to MetaCart
Performance evaluation for document image processing has a differ-ent emphasis than performance evaluation in other areas of image processing. Other areas of image processing can tolerate some error. Because it is so easily done nearly perfectly by humans, document
On the Resemblance and Containment of Documents
- In Compression and Complexity of Sequences (SEQUENCES’97
, 1997
"... Given two documents A and B we define two mathematical notions: their resemblance r(A, B)andtheircontainment c(A, B) that seem to capture well the informal notions of "roughly the same" and "roughly contained." The basic idea is to reduce these issues to set intersection probl ..."
Abstract
-
Cited by 499 (7 self)
- Add to MetaCart
problems that can be easily evaluated by a process of random sampling that can be done independently for each document. Furthermore, the resemblance can be evaluated using a fixed size sample for each document.
Managing Gigabytes: Compressing and Indexing Documents and Images - Errata
, 1996
"... > ! "GZip" page 64, Table 2.5, line "progp": "43,379" ! "49,379" page 68, Table 2.6: "Mbyte/sec" ! "Mbyte/min" twice in the body of the table, and in the caption "Mbyte/second" ! "Mbyte/minute" page 70, para 4, line ..."
Abstract
-
Cited by 985 (48 self)
- Add to MetaCart
;a such a" ! "such a" page 98, line 6: "shows that in fact none is an answer to this query" ! "shows that only document 2 is an answer to this query" page 106, para 3, line 9: "the bitstring in Figure 3.7b" ! "the bitstring in Figure 3.7c" page 107
The FERET evaluation methodology for face recognition algorithms
- In (a) Example 1 (b) Example 1 (c) Right ear) (d) Mirroed Left ear
"... AbstractÐTwo of the most critical requirements in support of producing reliable face-recognition systems are a large database of facial images and a testing procedure to evaluate systems. The Face Recognition Technology (FERET) program has addressed both issues through the FERET database of facial i ..."
Abstract
-
Cited by 1096 (27 self)
- Add to MetaCart
-recognition tests. The primary objectives of the third test were to 1) assess the state of the art, 2) identify future areas of research, and 3) measure algorithm performance. Index TermsÐFace recognition, algorithm evaluation, FERET database. 1
A PERFORMANCE EVALUATION OF LOCAL DESCRIPTORS
, 2005
"... In this paper we compare the performance of descriptors computed for local interest regions, as for example extracted by the Harris-Affine detector [32]. Many different descriptors have been proposed in the literature. However, it is unclear which descriptors are more appropriate and how their perfo ..."
Abstract
-
Cited by 1752 (53 self)
- Add to MetaCart
their performance depends on the interest region detector. The descriptors should be distinctive and at the same time robust to changes in viewing conditions as well as to errors of the detector. Our evaluation uses as criterion recall with respect to precision and is carried out for different image transformations
A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics
- in Proc. 8th Int’l Conf. Computer Vision
, 2001
"... This paper presents a database containing ‘ground truth ’ segmentations produced by humans for images of a wide variety of natural scenes. We define an error measure which quantifies the consistency between segmentations of differing granularities and find that different human segmentations of the s ..."
Abstract
-
Cited by 944 (15 self)
- Add to MetaCart
of the same image are highly consistent. Use of this dataset is demonstrated in two applications: (1) evaluating the performance of segmentation algorithms and (2) measuring probability distributions associated with Gestalt grouping factors as well as statistics of image region properties. 1.
A review of image denoising algorithms, with a new one
- Simul
, 2005
"... Abstract. The search for efficient image denoising methods is still a valid challenge at the crossing of functional analysis and statistics. In spite of the sophistication of the recently proposed methods, most algorithms have not yet attained a desirable level of applicability. All show an outstand ..."
Abstract
-
Cited by 509 (6 self)
- Add to MetaCart
an outstanding performance when the image model corresponds to the algorithm assumptions but fail in general and create artifacts or remove image fine structures. The main focus of this paper is, first, to define a general mathematical and experimental methodology to compare and classify classical image
Randomized Algorithms
, 1995
"... Randomized algorithms, once viewed as a tool in computational number theory, have by now found widespread application. Growth has been fueled by the two major benefits of randomization: simplicity and speed. For many applications a randomized algorithm is the fastest algorithm available, or the simp ..."
Abstract
-
Cited by 2210 (37 self)
- Add to MetaCart
Randomized algorithms, once viewed as a tool in computational number theory, have by now found widespread application. Growth has been fueled by the two major benefits of randomization: simplicity and speed. For many applications a randomized algorithm is the fastest algorithm available
A comparison and evaluation of multi-view stereo reconstruction algorithms
- In IEEE CVPR
, 2006
"... This paper presents a quantitative comparison of several multi-view stereo reconstruction algorithms. Until now, the lack of suitable calibrated multi-view image datasets with known ground truth (3D shape models) has prevented such direct comparisons. In this paper, we rst survey multi-view stereo a ..."
Abstract
-
Cited by 533 (15 self)
- Add to MetaCart
algorithms and compare them qualitatively using a taxonomy that differentiates their key properties. We then describe our process for acquiring and calibrating multi-view image datasets with high-accuracy ground truth and introduce our evaluation methodology. Finally, we present the results of our
Cost-Aware WWW Proxy Caching Algorithms
- IN PROCEEDINGS OF THE 1997 USENIX SYMPOSIUM ON INTERNET TECHNOLOGY AND SYSTEMS
, 1997
"... Web caches can not only reduce network traffic and downloading latency, but can also affect the distribution of web traffic over the network through costaware caching. This paper introduces GreedyDualSize, which incorporates locality with cost and size concerns in a simple and non-parameterized fash ..."
Abstract
-
Cited by 544 (6 self)
- Add to MetaCart
-parameterized fashion for high performance. Trace-driven simulations show that with the appropriate cost definition, GreedyDual-Size outperforms existing web cache replacement algorithms in many aspects, including hit ratios, latency reduction and network cost reduction. In addition, GreedyDual-Size can potentially
Results 1 - 10
of
2,857,796