Results 1 - 10
of
12,082
Rapid object detection using a boosted cascade of simple features
- ACCEPTED CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION 2001
, 2001
"... This paper describes a machine learning approach for visual object detection which is capable of processing images extremely rapidly and achieving high detection rates. This work is distinguished by three key contributions. The first is the introduction of a new image representation called the " ..."
Abstract
-
Cited by 3283 (9 self)
- Add to MetaCart
the "Integral Image" which allows the features used by our detector to be computed very quickly. The second is a learning algorithm, based on AdaBoost, which selects a small number of critical visual features from a larger set and yields extremely efficient classifiers[6]. The third contribution
Robust Real-time Object Detection
- International Journal of Computer Vision
, 2001
"... This paper describes a visual object detection framework that is capable of processing images extremely rapidly while achieving high detection rates. There are three key contributions. The first is the introduction of a new image representation called the “Integral Image ” which allows the features ..."
Abstract
-
Cited by 1184 (4 self)
- Add to MetaCart
used by our detector to be computed very quickly. The second is a learning algorithm, based on AdaBoost, which selects a small number of critical visual features and yields extremely efficient classifiers [6]. The third contribution is a method for combining classifiers in a “cascade ” which allows
Similarity estimation techniques from rounding algorithms
- In Proc. of 34th STOC
, 2002
"... A locality sensitive hashing scheme is a distribution on a family F of hash functions operating on a collection of objects, such that for two objects x, y, Prh∈F[h(x) = h(y)] = sim(x,y), where sim(x,y) ∈ [0, 1] is some similarity function defined on the collection of objects. Such a scheme leads ..."
Abstract
-
Cited by 449 (6 self)
- Add to MetaCart
A locality sensitive hashing scheme is a distribution on a family F of hash functions operating on a collection of objects, such that for two objects x, y, Prh∈F[h(x) = h(y)] = sim(x,y), where sim(x,y) ∈ [0, 1] is some similarity function defined on the collection of objects. Such a scheme leads
Human DNA methylomes at base resolution show widespread epigenomic differences.
- Nature,
, 2009
"... DNA cytosine methylation is a central epigenetic modification that has essential roles in cellular processes including genome regulation, development and disease. Here we present the first genome-wide, single-base-resolution maps of methylated cytosines in a mammalian genome, from both human embryo ..."
Abstract
-
Cited by 401 (6 self)
- Add to MetaCart
Arabidopsis thaliana were previously achieved using MethylC-Seq 15 or BS-Seq 16 . In this method, genomic DNA is treated with sodium bisulphite (BS) to convert cytosine, but not methylcytosine, to uracil, and subsequent high-throughput sequencing. We performed MethylC-Seq for two human cell lines, H1 human
Machine learning for high-speed corner detection
- In European Conference on Computer Vision
, 2006
"... Where feature points are used in real-time frame-rate applications, a high-speed feature detector is necessary. Feature detectors such as SIFT (DoG), Harris and SUSAN are good methods which yield high quality features, however they are too computationally intensive for use in real-time applicati ..."
Abstract
-
Cited by 353 (4 self)
- Add to MetaCart
Where feature points are used in real-time frame-rate applications, a high-speed feature detector is necessary. Feature detectors such as SIFT (DoG), Harris and SUSAN are good methods which yield high quality features, however they are too computationally intensive for use in real
Example-based super-resolution
- IEEE COMPUT. GRAPH. APPL
, 2001
"... The Problem: Pixel representations for images do not have resolution independence. When we zoom into a bitmapped image, we get a blurred image. Figure 1 shows the problem for a teapot image, rich with real-world detail. We know the teapot’s features should remain sharp as we zoom in on them, yet sta ..."
Abstract
-
Cited by 349 (5 self)
- Add to MetaCart
of pixel-based representations is an important task for image-based rendering. Our example-based super-resolution algorithm yields Fig. 1 (h, i). Previous Work: Researchers have long studied image interpolation, although only recently using machine learning or sampling approaches, which offer much power
"Turbo equalization": principles and new results
, 2000
"... Since the invention of \turbo codes" by Berrou et al. in 1993, the \turbo principle" has been adapted to several communication problems such as \turbo equalization", \turbo trellis coded modulation", and iterative multi user detection. In this paper we study the \turbo equalizati ..."
Abstract
-
Cited by 274 (25 self)
- Add to MetaCart
equalization" approach, which can be applied to coded data transmission over channels with intersymbol interference (ISI). In the original system invented by Douillard et al., the data is protected by a convolutional code and a receiver consisting of two trellis-based detectors are used, one
How does a brain build a cognitive code
- Psychological Review
, 1980
"... This article indicates how competition between afferent data and learned feedback expectancies can stabilize a developing code by buffering committed populations of detectors against continual erosion by new environmental demands. Tille gating phenomena that result lead to dynamically maintained cri ..."
Abstract
-
Cited by 253 (94 self)
- Add to MetaCart
This article indicates how competition between afferent data and learned feedback expectancies can stabilize a developing code by buffering committed populations of detectors against continual erosion by new environmental demands. Tille gating phenomena that result lead to dynamically maintained
Elaborated Reichardt detectors.
- Journal of the Optical Society of America A: Optics and Image Science,
, 1985
"... The elaborated Reichardt detector (ERD) proposed by van Santen and Sperling [J. Opt. Soc. Am. A 1, 451 (1984)], based on Reichardt's motion detector [Z. Naturforsch. Teil B 12, 447 (1957)], is an opponent system of two mirrorimage subunits. Each subunit receives inputs from two spatiotemporal ..."
Abstract
-
Cited by 161 (6 self)
- Add to MetaCart
The elaborated Reichardt detector (ERD) proposed by van Santen and Sperling [J. Opt. Soc. Am. A 1, 451 (1984)], based on Reichardt's motion detector [Z. Naturforsch. Teil B 12, 447 (1957)], is an opponent system of two mirrorimage subunits. Each subunit receives inputs from two spatiotemporal
Megabase chromatin domains involved in DNA double-strand breaks in vivo
- J. Cell
, 1999
"... Abstract. The loss of chromosomal integrity from DNA double-strand breaks introduced into mammalian cells by ionizing radiation results in the specific phosphorylation of histone H2AX on serine residue 139, yielding a specific modified form named �-H2AX. An antibody prepared to the unique region of ..."
Abstract
-
Cited by 203 (2 self)
- Add to MetaCart
Abstract. The loss of chromosomal integrity from DNA double-strand breaks introduced into mammalian cells by ionizing radiation results in the specific phosphorylation of histone H2AX on serine residue 139, yielding a specific modified form named �-H2AX. An antibody prepared to the unique region
Results 1 - 10
of
12,082