Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
6,826
Good features to track
, 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
Newton-Raphson style search methods to work under affine image transformations. We test performance with several simulations and experiments.
Detection and Tracking of Point Features
- International Journal of Computer Vision
, 1991
"... The factorization method described in this series of reports requires an algorithm to track the motion of features in an image stream. Given the small inter-frame displacement made possible by the factorization approach, the best tracking method turns out to be the one proposed by Lucas and Kanade i ..."
Abstract
-
Cited by 629 (2 self)
- Add to MetaCart
leads to a Newton-Raphson style minimization. In this report, after rederiving the method in a physically intuitive way, we answer the crucial question of how to choose the feature windows that are best suited for tracking. Our selection criterion is based directly on the definition of the tracking
Optimizing Search Engines using Clickthrough Data
, 2002
"... This paper presents an approach to automatically optimizing the retrieval quality of search engines using clickthrough data. Intuitively, a good information retrieval system should present relevant documents high in the ranking, with less relevant documents following below. While previous approaches ..."
Abstract
-
Cited by 1314 (23 self)
- Add to MetaCart
This paper presents an approach to automatically optimizing the retrieval quality of search engines using clickthrough data. Intuitively, a good information retrieval system should present relevant documents high in the ranking, with less relevant documents following below. While previous
Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach
- DATA MINING AND KNOWLEDGE DISCOVERY
, 2004
"... Mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous studies adopt an Apriori-like candidate set generation-and-test approach. However, candidate set generation is still co ..."
Abstract
-
Cited by 1752 (64 self)
- Add to MetaCart
databases, which dramatically reduces the search space. Our performance
study shows that the FP-growth method is efficient and scalable for mining both long and short frequent patterns,
and is about an order of magnitude faster than the Apriori algorithm and also faster than some recently reported
new
The use of MMR, diversity-based reranking for reordering documents and producing summaries
- In SIGIR
, 1998
"... jadeQcs.cmu.edu Abstract This paper presents a method for combining query-relevance with information-novelty in the context of text retrieval and summarization. The Maximal Marginal Relevance (MMR) criterion strives to reduce redundancy while maintaining query relevance in re-ranking retrieved docum ..."
Abstract
-
Cited by 768 (14 self)
- Add to MetaCart
“marginal relevance ”- i.e. a document has high marginal relevance if it is both relevant to the query and contains minimal similarity to previously selected documents. We strive to maximize-marginal relevance in retrieval and summarization, hence we label our method “maximal marginal relevanci ” (MMR).
Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach
- IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
, 1999
"... Evolutionary algorithms (EA’s) are often well-suited for optimization problems involving several, often conflicting objectives. Since 1985, various evolutionary approaches to multiobjective optimization have been developed that are capable of searching for multiple solutions concurrently in a singl ..."
Abstract
-
Cited by 813 (22 self)
- Add to MetaCart
Evolutionary algorithms (EA’s) are often well-suited for optimization problems involving several, often conflicting objectives. Since 1985, various evolutionary approaches to multiobjective optimization have been developed that are capable of searching for multiple solutions concurrently in a
Tabu Search -- Part II
, 1990
"... This is the second half of a two part series devoted to the tabu search metastrategy for optimization problems. Part I introduced the fundamental ideas of tabu search as an approach for guiding other heuristics to overcome the limitations of local optimality, both in a deterministic and a probabilis ..."
Abstract
-
Cited by 387 (5 self)
- Add to MetaCart
probabilistic framework. Part I also reported successful applications from a wide range of settings, in which tabu search frequently made it possible to obtain higher quality solutions than previously obtained with competing strategies, generally with less computational effort. Part 11, in this issue, examines
O-Plan: the Open Planning Architecture
, 1990
"... O-Plan is an AI planner based on previous experience with the Nonlin planner and its derivatives. Nonlin and other similar planning systems had limited control architectures and were only partially successful at limiting their search spaces. O-Plan is a design and implementation of a more flexible s ..."
Abstract
-
Cited by 379 (41 self)
- Add to MetaCart
O-Plan is an AI planner based on previous experience with the Nonlin planner and its derivatives. Nonlin and other similar planning systems had limited control architectures and were only partially successful at limiting their search spaces. O-Plan is a design and implementation of a more flexible
A Newton–Raphson based code for seawater intrusion modelling and parameter estimation
- In Groundwater and Saline Intrusion: Selected Papers from the 18th Salt Water Intrusion Meeting, 18th SWIM
, 2005
"... Abstract A new code called TRANSDENS for simulation and parameter estimation in density-dependent flow and solute transport is presented. Flow and transport are solved in terms of fresh water head and solute mass fraction respectively. The code allows solving the coupled problem using Picard iterat ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
. It takes advantage of the previously calculated Jacobian matrix in Newton-Raphson method during the direct problem solution as described by
Blind Separation of Nonstationary Markovian Sources Using an Equivariant Newton–Raphson Algorithm
- IEEE Signal Processing Letters
, 2009
"... Abstract—This letter presents a new maximum likelihood method for blindly separating linear instantaneous source mixtures, where source signals are assumed to be mutually inde-pendent, Markovian and possibly nonstationary. The proposed approach first extends previous works, by Hosseini et al. to pos ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
functions used in our method. Experimental results, both for artificial and real (speech) signals, prove the better performance of our method as compared to various classical blind separation algorithms. Index Terms—Blind source separation (BSS), Markovian model, Newton–Raphson algorithm, nonstationary
Results 1 - 10
of
6,826
