• 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 7,519
Next 10 →

Multimodality Image Registration by Maximization of Mutual Information

by Frederik Maes, André Collignon, Dirk Vandermeulen, Guy Marchal, Paul Suetens - IEEE TRANSACTIONS ON MEDICAL IMAGING , 1997
"... A new approach to the problem of multimodality medical image registration is proposed, using a basic concept from information theory, mutual information (MI), or relative entropy, as a new matching criterion. The method presented in this paper applies MI to measure the statistical dependence or in ..."
Abstract - Cited by 791 (10 self) - Add to MetaCart
A new approach to the problem of multimodality medical image registration is proposed, using a basic concept from information theory, mutual information (MI), or relative entropy, as a new matching criterion. The method presented in this paper applies MI to measure the statistical dependence

TOPOLOGY OPTIMIZATION OF CONTINUUM STRUCTURES USING OPTIMALITY CRITERION APPROACH IN ANSYS

by Dheeraj Gunwant, Anadi Misra
"... Topology optimization is an important category of structural optimization which is employed when the design is at the conceptual stage. Generally, the topology optimization deals with finding the optimal material distribution in a design domain while minimizing the compliance of the structure. In th ..."
Abstract - Add to MetaCart
design variables and the Optimality Criterion for updating the design variables. The results of the ANSYS based Optimality criterion are validated and compared with the results obtained by Element Exchange Method.

A Global Optimality Criterion for Nonconvex Quadratic Programming over a Simplex

by Ivo Nowak
"... In this paper we propose a global optimality criterion for globally minimizing a quadratic form over the standard simplex, which in addition provides a sharp lower bound for the optimal value. The approach isbased on the solution of a semide nite program (SDP) and a convex quadratic program (QP). Si ..."
Abstract - Cited by 3 (2 self) - Add to MetaCart
In this paper we propose a global optimality criterion for globally minimizing a quadratic form over the standard simplex, which in addition provides a sharp lower bound for the optimal value. The approach isbased on the solution of a semide nite program (SDP) and a convex quadratic program (QP

Good features to track

by Jianbo Shi, Carlo Tomasi , 1994
"... No feature-based vision system can work unless good features can be identified and tracked from frame to frame. Although tracking itself is by and large a solved problem, selecting features that can be tracked well and correspond to physical points in the world is still hard. We propose a feature se ..."
Abstract - Cited by 2050 (14 self) - Add to MetaCart
selection criterion that is optimal by construction because it is based on how the tracker works, and a feature monitoring method that can detect occlusions, disocclusions, and features that do not correspond to points in the world. These methods are based on a new tracking algorithm that extends previous

Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks

by Ros Tassiulas, Anthony Ephremides - IEEE Transactions on Automatic Control , 1992
"... Abstruct-The stability of a queueing network with interdependent servers is considered. The dependency of servers is described by the definition of their subsets that can be activated simultaneously. Multihop packet radio networks (PRN’s) provide a motivation for the consideration of this system. We ..."
Abstract - Cited by 949 (19 self) - Add to MetaCart
. We study the problem of scheduling the server activation under the constraints imposed by the dependency among them. The performance criterion of a scheduling policy m is its throughput that is characterized by its stability region C,, that is, the set of vectors of arrival rates for which the system

Greedy Function Approximation: A Gradient Boosting Machine

by Jerome H. Friedman - Annals of Statistics , 2000
"... Function approximation is viewed from the perspective of numerical optimization in function space, rather than parameter space. A connection is made between stagewise additive expansions and steepest{descent minimization. A general gradient{descent \boosting" paradigm is developed for additi ..."
Abstract - Cited by 1000 (13 self) - Add to MetaCart
Function approximation is viewed from the perspective of numerical optimization in function space, rather than parameter space. A connection is made between stagewise additive expansions and steepest{descent minimization. A general gradient{descent \boosting" paradigm is developed

SPPED AS A VESSEL TRAFFIC OPTIMIZATION CRITERION

by Waldemar Uchacz
"... ABSTRACT Problems of vessel traffic organization in approach channels are solved by Vessel Traffic Management Services (VTMS). One essential task for VTMS is to ensure a required level of traffic safety. As often vessel traffic is intensive, attempts are made to optimize it. This author aims to find ..."
Abstract - Add to MetaCart
ABSTRACT Problems of vessel traffic organization in approach channels are solved by Vessel Traffic Management Services (VTMS). One essential task for VTMS is to ensure a required level of traffic safety. As often vessel traffic is intensive, attempts are made to optimize it. This author aims

Optimality Criterions in Experiment Design for Local Regression Fitting

by Ewaryst Rafajlowicz
"... this paper, please contact the author for details: raf@ldhpux.immt.pwr.pl 1 Introduction ..."
Abstract - Add to MetaCart
this paper, please contact the author for details: raf@ldhpux.immt.pwr.pl 1 Introduction

A computational approach to edge detection

by John Canny - IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE , 1986
"... This paper describes a computational approach to edge detection. The success of the approach depends on the definition of a comprehensive set of goals for the computation of edge points. These goals must be precise enough to delimit the desired behavior of the detector while making minimal assumpti ..."
Abstract - Cited by 4675 (0 self) - Add to MetaCart
assumptions about the form of the solution. We define detection and localization criteria for a class of edges, and present mathematical forms for these criteria as functionals on the operator impulse response. A third criterion is then added to ensure that the detector has only one response to- a single edge

Iterative decoding of binary block and convolutional codes

by Joachim Hagenauer, Elke Offer, Lutz Papke - IEEE TRANS. INFORM. THEORY , 1996
"... Iterative decoding of two-dimensional systematic convolutional codes has been termed “turbo” (de)coding. Using log-likelihood algebra, we show that any decoder can he used which accepts soft inputs-including a priori values-and delivers soft outputs that can he split into three terms: the soft chann ..."
Abstract - Cited by 610 (43 self) - Add to MetaCart
stop criterion derived from cross entropy, which results in a minimal number of iterations. Optimal and suboptimal decoders with reduced complexity are presented. Simulation results show that very simple component codes are sufficient, block codes are appropriate for high rates and convolutional codes
Next 10 →
Results 11 - 20 of 7,519
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