Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
943
Free-form deformation of solid geometric models
- IN PROC. SIGGRAPH 86
, 1986
"... A technique is presented for deforming solid geometric models in a free-form manner. The technique can be used with any solid modeling system, such as CSG or B-rep. It can deform surface primitives of any type or degree: planes, quadrics, parametric surface patches, or implicitly defined surfaces, f ..."
Abstract
-
Cited by 701 (1 self)
- Add to MetaCart
, for example. The deformation can be applied either globally or locally. Local deformations can be imposed with any desired degree of derivative continuity. It is also possible to deform a solid model in such a way that its volume is preserved. The scheme is based on trivariate Bernstein polynomials
Bilateral Filtering for Gray and Color Images
, 1998
"... tomasi @ cs.stanford.edu Bilateral filtering smooths images while preserving edges, by means of a nonlinear combination of nearby image values. The method is noniterative, local, and sim-ple. It combines gray levels or colors based on both their geometric closeness and their photometric similariv, a ..."
Abstract
-
Cited by 1156 (2 self)
- Add to MetaCart
tomasi @ cs.stanford.edu Bilateral filtering smooths images while preserving edges, by means of a nonlinear combination of nearby image values. The method is noniterative, local, and sim-ple. It combines gray levels or colors based on both their geometric closeness and their photometric similariv
Scale-space and edge detection using anisotropic diffusion
- 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
scales. In this paper we suggest a new definition of scale-space, and introduce a class of algorithms that realize it using a diffusion process. The diffusion coefficient is chosen to vary spatially in such a way as to encourage intraregion smoothing in preference to interregion smoothing. It is shown
Face recognition using laplacianfaces
- IEEE Transactions on Pattern Analysis and Machine Intelligence
, 2005
"... Abstract—We propose an appearance-based face recognition method called the Laplacianface approach. By using Locality Preserving Projections (LPP), the face images are mapped into a face subspace for analysis. Different from Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA) wh ..."
Abstract
-
Cited by 389 (38 self)
- Add to MetaCart
Abstract—We propose an appearance-based face recognition method called the Laplacianface approach. By using Locality Preserving Projections (LPP), the face images are mapped into a face subspace for analysis. Different from Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA
Cacheminer: A Runtime Approach to Exploit Cache Locality on SMP
- IEEE Transactions on Parallel and Distributed Systems
, 2000
"... Exploiting cache locality of parallel programs at runtime is a complementary approach to a compiler optimization. This is particularly important for those applications with dynamic memory access patterns. We propose a memory-layout oriented technique to exploit cache locality of parallel loops at ..."
Abstract
-
Cited by 14 (2 self)
- Add to MetaCart
maximizes the data reuse in each partitioned data region assigned in a cache, and minimizes the data sharing among the partitioned data regions assigned to all caches. The executions of tasks in the partitions are scheduled in an adaptive and locality-preserved way to minimize the execution time
Discovering Local Structure in Gene Expression Data: The Order-Preserving Submatrix Problem
, 2002
"... This paper concerns the discovery of patterns in gene expression matrices, in which each element gives the expression level of a given gene in a given experiment. Most existing methods for pattern discovery in such matrices are based on clustering genes by comparing their expression levels in all ex ..."
Abstract
-
Cited by 187 (1 self)
- Add to MetaCart
experiments, or clustering experiments by comparing their expression levels for all genes. Our work goes beyond such global approaches by looking for local patterns that manifest themselves when we focus simultaneously on a subset G of the genes and a subset T of the experiments. Speci � cally, we look
The probability of duplicate gene preservation by subfunctionalization.
- Genetics
, 2000
"... ABSTRACT It has often been argued that gene-duplication events are most commonly followed by a mutational event that silences one member of the pair, while on rare occasions both members of the pair are preserved as one acquires a mutation with a beneficial function and the other retains the origin ..."
Abstract
-
Cited by 261 (2 self)
- Add to MetaCart
ancestral gene. We consider the ways in which the probability of duplicate-gene preservation by such complementary mutations is modified by aspects of gene structure, degree of linkage, mutation rates and effects, and population size. Even if most mutations cause complete loss
A Memory-Layout Oriented Runtime Technique for Locality Optimization
- PROC. 1998 INT'L CONF. PARALLEL PROCESSING (ICPP '98)
, 1998
"... Exploiting locality at run-time is a complementary approach to a compiler approach for those applications with dynamic memory access patterns. This paper proposes a memory-layout oriented approach to exploit cache locality for parallel loops at run-time on Symmetric Multi-Processor (SMP) systems. Gu ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
in a partition is maximized. The execution of tasks in partitions is scheduled in an adaptive and locality-preserved way to achieve balanced execution, for minimizing the execution time of applications by trading off load balance and locality. Based on simulation and measurement, we show our run
Aggregating local descriptors into a compact image representation
"... We address the problem of image search on a very large scale, where three constraints have to be considered jointly: the accuracy of the search, its efficiency, and the memory usage of the representation. We first propose a simple yet efficient way of aggregating local image descriptors into a vecto ..."
Abstract
-
Cited by 226 (19 self)
- Add to MetaCart
We address the problem of image search on a very large scale, where three constraints have to be considered jointly: the accuracy of the search, its efficiency, and the memory usage of the representation. We first propose a simple yet efficient way of aggregating local image descriptors into a
Probabilistic Frame-Based Systems
- In Proc. AAAI
, 1998
"... Two of the most important threads of work in knowledge representation today are frame-based representation systems (FRS's) and Bayesian networks (BNs). FRS's provide an excellent representation for the organizational structure of large complex domains, but their applicability is limited be ..."
Abstract
-
Cited by 212 (16 self)
- Add to MetaCart
, preserving the advantages of both. Our approach allows us to provide natural and compact definitions of probability models for a class, in a way that is local to the class frame. These models can be instantiated for any set of interconnected instances, resulting in a coherent probability distribution over
Results 1 - 10
of
943
