• 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 11 - 20 of 10,969
Next 10 →

Scale-space and edge detection using anisotropic diffusion

by Pietro Perona, Jitendra Malik - IEEE Transactions on Pattern Analysis and Machine Intelligence , 1990
"... Abstract-The scale-space technique introduced by Witkin involves generating coarser resolution images by convolving the original image with a Gaussian kernel. This approach has a major drawback: it is difficult to obtain accurately the locations of the “semantically mean-ingful ” edges at coarse sca ..."
Abstract - Cited by 1887 (1 self) - Add to MetaCart
Abstract-The scale-space technique introduced by Witkin involves generating coarser resolution images by convolving the original image with a Gaussian kernel. This approach has a major drawback: it is difficult to obtain accurately the locations of the “semantically mean-ingful ” edges at coarse

Lambertian Reflectance and Linear Subspaces

by Ronen Basri, David Jacobs , 2000
"... We prove that the set of all reflectance functions (the mapping from surface normals to intensities) produced by Lambertian objects under distant, isotropic lighting lies close to a 9D linear subspace. This implies that, in general, the set of images of a convex Lambertian object obtained under a wi ..."
Abstract - Cited by 526 (20 self) - Add to MetaCart
wide variety of lighting conditions can be approximated accurately by a low-dimensional linear subspace, explaining prior empirical results. We also provide a simple analytic characterization of this linear space. We obtain these results by representing lighting using spherical harmonics and describing

Segmentation of brain MR images through a hidden Markov random field model and the expectation-maximization algorithm

by Yongyue Zhang, Michael Brady, Stephen Smith - IEEE TRANSACTIONS ON MEDICAL. IMAGING , 2001
"... The finite mixture (FM) model is the most commonly used model for statistical segmentation of brain magnetic resonance (MR) images because of its simple mathematical form and the piecewise constant nature of ideal brain MR images. However, being a histogram-based model, the FM has an intrinsic limi ..."
Abstract - Cited by 639 (15 self) - Add to MetaCart
that the FM model is a degenerate version of the HMRF model. The advantage of the HMRF model derives from the way in which the spatial information is encoded through the mutual influences of neighboring sites. Although MRF modeling has been employed in MR image segmentation by other researchers, most reported

Illusion and well-being: A social psychological perspective on mental health.

by Shelley E Taylor , Jonathon D Brown , Nancy Cantor , Edward Emery , Susan Fiske , Tony Green-Wald , Connie Hammen , Darrin Lehman , Chuck Mcclintock , Dick Nisbett , Lee Ross , Bill Swann , Joanne - Psychological Bulletin, , 1988
"... Many prominent theorists have argued that accurate perceptions of the self, the world, and the future are essential for mental health. Yet considerable research evidence suggests that overly positive selfevaluations, exaggerated perceptions of control or mastery, and unrealistic optimism are charac ..."
Abstract - Cited by 988 (20 self) - Add to MetaCart
Many prominent theorists have argued that accurate perceptions of the self, the world, and the future are essential for mental health. Yet considerable research evidence suggests that overly positive selfevaluations, exaggerated perceptions of control or mastery, and unrealistic optimism

Loopy belief propagation for approximate inference: An empirical study. In:

by Kevin P Murphy , Yair Weiss , Michael I Jordan - Proceedings of Uncertainty in AI, , 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" -the use of Pearl's polytree algorithm in a Bayesian network with loops -can perform well in the context of error-correcting codes. The most dramatic instance of this is the near Shannon-limit performanc ..."
Abstract - Cited by 676 (15 self) - Add to MetaCart
steady states it seems reasonable to try to find a way to com bine the two values. The simplest thing to do is to average them. Unfortunately, this gave very poor re sults, since the correct posteriors do not usually lie in the midpoint of the interval ( cf. 2More precisely, we found that with a

tration during dialysis estimates Kt/V in a simple and accurate way.

by Ansell D, Feehally J, Basile C, Casino F, Couchoud C, Lassalle M, Henning Steen, Evangelos Giannitsis, Claudia Sommerer, Udo Bahner, Margit Br, Constanze Merten, Eberhard Ritz, Hugo A. Katus, Martin Zeier, Vedat Schwenger , 2007
"... 19. Plantinga LC, Fink NE, Jaar BG et al. Attainment of clinical perfor-mance targets and improvement in clinical outcomes and resource use in hemodialysis care: a prospective cohort study. BMC Health Serv ..."
Abstract - Add to MetaCart
19. Plantinga LC, Fink NE, Jaar BG et al. Attainment of clinical perfor-mance targets and improvement in clinical outcomes and resource use in hemodialysis care: a prospective cohort study. BMC Health Serv

BRITE: An approach to universal topology generation,”

by Alberto Medina , Anukool Lakhina , Ibrahim Matta , John Byers - in Proceedings of the IEEE Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, , 2001
"... Abstract Effective engineering of the Internet is predicated upon a detailed understanding of issues such as the large-scale structure of its underlying physical topology, the manner in which it evolves over time, and the way in which its constituent components contribute to its overall function. U ..."
Abstract - Cited by 448 (12 self) - Add to MetaCart
Abstract Effective engineering of the Internet is predicated upon a detailed understanding of issues such as the large-scale structure of its underlying physical topology, the manner in which it evolves over time, and the way in which its constituent components contribute to its overall function

Efficient Implementation of Weighted ENO Schemes

by Guang-shan Jiang, Chi-wang Shu , 1995
"... In this paper, we further analyze, test, modify and improve the high order WENO (weighted essentially non-oscillatory) finite difference schemes of Liu, Osher and Chan [9]. It was shown by Liu et al. that WENO schemes constructed from the r th order (in L¹ norm) ENO schemes are (r +1) th order accur ..."
Abstract - Cited by 412 (38 self) - Add to MetaCart
accurate. We propose a new way of measuring the smoothness of a numerical solution, emulating the idea of minimizing the total variation of the approximation, which results in a 5th order WENO scheme for the case r = 3, instead of the 4th order with the original smoothness measurement by Liu et al. This 5

An NEA policy brief Growth Models—A More Accurate Way To Determine Student Progress

by unknown authors
"... One of the most promising developments in holding schools accountable is the use of growth models, which are systems that measure student progress from one point in time to another. NEA is working with state affiliates to redesign accountability systems that assess student learning in a fair and rel ..."
Abstract - Add to MetaCart
One of the most promising developments in holding schools accountable is the use of growth models, which are systems that measure student progress from one point in time to another. NEA is working with state affiliates to redesign accountability systems that assess student learning in a fair and reliable manner. Our goal is improved teaching and learning for every student. —NEA President Dennis Van Roekel Growth models, used in education accountability systems, assess student performance by comparing their growth on a concept, knowledge, or skill between two or more points in time. Teachers commonly use a form of this model when they administer pre-tests and post-tests in their classrooms. Growth

Rao-Blackwellised Particle Filtering for Dynamic Bayesian Networks

by Arnaud Doucet , Nando de Freitas , Kevin Murphy , Stuart Russell
"... Particle filters (PFs) are powerful sampling-based inference/learning algorithms for dynamic Bayesian networks (DBNs). They allow us to treat, in a principled way, any type of probability distribution, nonlinearity and non-stationarity. They have appeared in several fields under such names as “conde ..."
Abstract - Cited by 348 (11 self) - Add to MetaCart
Particle filters (PFs) are powerful sampling-based inference/learning algorithms for dynamic Bayesian networks (DBNs). They allow us to treat, in a principled way, any type of probability distribution, nonlinearity and non-stationarity. They have appeared in several fields under such names
Next 10 →
Results 11 - 20 of 10,969
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