• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 6,337
Next 10 →

A comparison of bayesian methods for haplotype reconstruction from population genotype data.

by Matthew Stephens , Peter Donnelly , Dr Matthew Stephens - Am J Hum Genet , 2003
"... In this report, we compare and contrast three previously published Bayesian methods for inferring haplotypes from genotype data in a population sample. We review the methods, emphasizing the differences between them in terms of both the models ("priors") they use and the computational str ..."
Abstract - Cited by 557 (7 self) - Add to MetaCart
operates through the transmission of chromosomal segments. Experimental methods for haplotype determination exist, but they are currently timeconsuming and expensive. Statistical methods for inferring haplotypes are therefore of considerable interest. In some studies, data may be available on related

Overview of the scalable video coding extension of the H.264/AVC standard

by Heiko Schwarz, Detlev Marpe, Thomas Wiegand - IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY IN CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY , 2007
"... With the introduction of the H.264/AVC video coding standard, significant improvements have recently been demonstrated in video compression capability. The Joint Video Team of the ITU-T VCEG and the ISO/IEC MPEG has now also standardized a Scalable Video Coding (SVC) extension of the H.264/AVC stand ..."
Abstract - Cited by 522 (6 self) - Add to MetaCart
standard. SVC enables the transmission and decoding of partial bit streams to provide video services with lower temporal or spatial resolutions or reduced fidelity while retaining a reconstruction quality that is high relative to the rate of the partial bit streams. Hence, SVC provides functionalities

On the design of clone-based haplotyping

by Christine Lo , Rui Liu , Jehyuk Lee , Kimberly Robasky , Susan Byrne , Carolina Lucchesi , John Aach , George Church , Vineet Bafna , Kun Zhang - Genome Biol , 2013
"... Abstract Background: Haplotypes are important for assessing genealogy and disease susceptibility of individual genomes, but are difficult to obtain with routine sequencing approaches. Experimental haplotype reconstruction based on assembling fragments of individual chromosomes is promising, but wit ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
Abstract Background: Haplotypes are important for assessing genealogy and disease susceptibility of individual genomes, but are difficult to obtain with routine sequencing approaches. Experimental haplotype reconstruction based on assembling fragments of individual chromosomes is promising

Sampling signals with finite rate of innovation

by Martin Vetterli, Pina Marziliano, Thierry Blu - IEEE Transactions on Signal Processing , 2002
"... Abstract—Consider classes of signals that have a finite number of degrees of freedom per unit of time and call this number the rate of innovation. Examples of signals with a finite rate of innovation include streams of Diracs (e.g., the Poisson process), nonuniform splines, and piecewise polynomials ..."
Abstract - Cited by 350 (67 self) - Add to MetaCart
polynomials. Even though these signals are not bandlimited, we show that they can be sampled uniformly at (or above) the rate of innovation using an appropriate kernel and then be perfectly reconstructed. Thus, we prove sampling theorems for classes of signals and kernels that generalize the classic

Deterministic edge-preserving regularization in computed imaging

by Pierre Charbonnier, Laure Blanc-féraud, Gilles Aubert, Michel Barlaud - IEEE Trans. Image Processing , 1997
"... Abstract—Many image processing problems are ill posed and must be regularized. Usually, a roughness penalty is imposed on the solution. The difficulty is to avoid the smoothing of edges, which are very important attributes of the image. In this paper, we first give conditions for the design of such ..."
Abstract - Cited by 311 (27 self) - Add to MetaCart
. We propose a deterministic strategy, based on alternate minimizations on the image and the auxiliary variable. This leads to the definition of an original reconstruction algorithm, called ARTUR. Some theoretical properties of ARTUR are discussed. Experimental results illustrate the behavior

Building rome in a day.

by Sameer Agarwal , Yasutaka Furukawa , Noah Snavely , Ian Simon , Brian Curless , Steven M Seitz , Richard Szeliski - In Proc. Int. Conf. on Computer Vision. , 2009
"... We present a system that can reconstruct 3D geometry from large, unorganized collections of photographs such as those found by searching for a given city (e.g., Rome) on Internet photo-sharing sites. Our system is built on a set of new, distributed computer vision algorithms for image matching and ..."
Abstract - Cited by 285 (30 self) - Add to MetaCart
and 3D reconstruction, designed to maximize parallelism at each stage of the pipeline and to scale gracefully with both the size of the problem and the amount of available computation. Our experimental results demonstrate that it is now possible to reconstruct city-scale image collections with more than

A Method for enforcing integrability in shape from shading algorithms

by Robert T. Frankot, Rama Chellappa - IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE , 1988
"... Several recently developed techniques for reconstructing surface shape from shading information estimate surface slopes with-out ensuring that they are integrable. This paper presents an approach for enforcing integrability, a particular implementation of the approach, an example of its application ..."
Abstract - Cited by 284 (6 self) - Add to MetaCart
Several recently developed techniques for reconstructing surface shape from shading information estimate surface slopes with-out ensuring that they are integrable. This paper presents an approach for enforcing integrability, a particular implementation of the approach, an example of its

Efficient reconstruction of haplotype structure via perfect phylogeny

by Eleazar Eskin, Eran Halperin, Richard M. Karp - Journal of Bioinformatics and Computational Biology , 2003
"... Each person’s genome contains two copies of each chromosome, one inherited from the father and the other from the mother. A person’s genotype specifies the pair of bases at each site, but does not specify which base occurs on which chromosome. The sequence of each chromosome separately is called a h ..."
Abstract - Cited by 75 (12 self) - Add to MetaCart
experimental determination of a person’s genotype is less expensive than determining its component haplotypes, algorithms are required for computing haplotypes from genotypes. Two observations aid in this process: first, the human genome contains short blocks within which only a few different haplotypes occur

Feature Extraction Methods For Character Recognition - A Survey

by Øivind Due Trier, Anil K Jain, Torfinn Taxt , 1995
"... This paper presents an overview of feature extraction methods for off-line recognition of segmented (isolated) characters. Selection of a feature extraction method is probably the single most important factor in achieving high recognition performance in character recognition systems. Different featu ..."
Abstract - Cited by 268 (3 self) - Add to MetaCart
, reconstructability, and expected distortions and variability of the characters. The problem of choosing the appropriate feature extraction method for a given application is also discussed. When a few promising feature extraction methods have been identified, they need to be evaluated experimentally to find the best

Plenoptic sampling

by Jin-xiang Chai, Xin Tong, Shing-chow Chan, Heung-yeung Shum - In SIGGRAPH , 2000
"... This paper studies the problem of plenoptic sampling in imagebased rendering (IBR). From a spectral analysis of light field signals and using the sampling theorem, we mathematically derive the analytical functions to determine the minimum sampling rate for light field rendering. The spectral support ..."
Abstract - Cited by 249 (15 self) - Add to MetaCart
of the sampled light field within the smallest interval. Given the minimum and maximum depths, a reconstruction filter with an optimal and constant depth can be designed to achieve anti-aliased light field rendering. Plenoptic sampling goes beyond the minimum number of images needed for anti-aliased light field
Next 10 →
Results 1 - 10 of 6,337
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University