NIPS 2004 - PDF Preprint Papers

NIPS 2004

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed NIPS-2004 Paper

click to vote

NIPS
2004

316views Information Technology» more NIPS 2004»

Discriminant Saliency for Visual Recognition from Cluttered Scenes

14 years 24 days ago

Download books.nips.cc

Saliency mechanisms play an important role when visual recognition must be performed in cluttered scenes. We propose a computational definition of saliency that deviates from exis...

Dashan Gao, Nuno Vasconcelos

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Related Conferences

Id	Views	Title	Status

1	316	Discriminant Saliency for Visual Recognition from Cluttered Scenes	claim
2	292	Nonparametric Transforms of Graph Kernels for Semi-Supervised Learning	claim
3	267	Face Detection - Efficient and Rank Deficient	claim
4	253	Exponential Family Harmoniums with an Application to Information Retrieval	claim
5	247	Contextual Models for Object Detection Using Boosted Random Fields	claim
6	241	The Correlated Correspondence Algorithm for Unsupervised Registration of Nonrigid Surfaces	claim
7	240	An Auditory Paradigm for Brain-Computer Interfaces	claim
8	239	Adaptive Discriminative Generative Model and Its Applications	claim
9	238	Incremental Learning for Visual Tracking	claim
10	228	Sparse Coding of Natural Images Using an Overcomplete Set of Limited Capacity Units	claim
11	224	Approximately Efficient Online Mechanism Design	claim
12	220	The power of feature clustering: An application to object detection	claim
13	217	Joint Tracking of Pose, Expression, and Texture using Conditionally Gaussian Filters	claim
14	216	Using Machine Learning to Break Visual Human Interaction Proofs (HIPs)	claim
15	215	Hierarchical Eigensolver for Transition Matrices in Spectral Methods	claim
16	209	Synchronization of neural networks by mutual learning and its application to cryptography	claim
17	207	Efficient Kernel Discriminant Analysis via QR Decomposition	claim
18	204	Adaptive Manifold Learning	claim
19	201	Co-Training and Expansion: Towards Bridging Theory and Practice	claim
20	199	Computing regularization paths for learning multiple kernels	claim
21	196	Blind One-microphone Speech Separation: A Spectral Learning Approach	claim
22	196	Conditional Random Fields for Object Recognition	claim
23	190	Probabilistic Computation in Spiking Populations	claim
24	186	Hierarchical Bayesian Inference in Networks of Spiking Neurons	claim
25	185	Hierarchical Clustering of a Mixture Model	claim
26	175	On-Chip Compensation of Device-Mismatch Effects in Analog VLSI Neural Networks	claim
27	175	An Investigation of Practical Approximate Nearest Neighbor Algorithms	claim
28	174	Modeling Nonlinear Dependencies in Natural Images using Mixture of Laplacian Distribution	claim
29	174	Dynamic Bayesian Networks for Brain-Computer Interfaces	claim
30	172	Proximity Graphs for Clustering and Manifold Learning	claim
31	172	Similarity and Discrimination in Classical Conditioning: A Latent Variable Account	claim
32	170	Seeing through water	claim
33	170	A Harmonic Excitation State-Space Approach to Blind Separation of Speech	claim
34	170	Chemosensory Processing in a Spiking Model of the Olfactory Bulb: Chemotopic Convergence and Center Surround Inhibition	claim
35	170	Edge of Chaos Computation in Mixed-Mode VLSI - A Hard Liquid	claim
36	169	A Three Tiered Approach for Articulated Object Action Modeling and Recognition	claim
37	169	Maximum Margin Clustering	claim
38	167	Result Analysis of the NIPS 2003 Feature Selection Challenge	claim
39	167	Surface Reconstruction using Learned Shape Models	claim
40	167	Constraining a Bayesian Model of Human Visual Speed Perception	claim
41	167	Self-Tuning Spectral Clustering	claim
42	165	Using Random Forests in the Structured Language Model	claim
43	164	Integrating Topics and Syntax	claim
44	164	Joint MRI Bias Removal Using Entropy Minimization Across Images	claim
45	162	Support Vector Classification with Input Data Uncertainty	claim
46	162	Bayesian inference in spiking neurons	claim
47	162	Online Bounds for Bayesian Algorithms	claim
48	162	An Application of Boosting to Graph Classification	claim
49	158	Multiple Alignment of Continuous Time Series	claim
50	158	Learning Syntactic Patterns for Automatic Hypernym Discovery	claim
51	157	Limits of Spectral Clustering	claim
52	155	Semi-supervised Learning by Entropy Minimization	claim
53	152	Breaking SVM Complexity with Cross-Training	claim
54	152	Active Learning for Anomaly and Rare-Category Detection	claim
55	152	Assignment of Multiplicative Mixtures in Natural Images	claim
56	149	Co-Validation: Using Model Disagreement on Unlabeled Data to Validate Classification Algorithms	claim
57	149	Conditional Models of Identity Uncertainty with Application to Noun Coreference	claim
58	147	Two-Dimensional Linear Discriminant Analysis	claim
59	146	Confidence Intervals for the Area Under the ROC Curve	claim
60	146	Parallel Support Vector Machines: The Cascade SVM	claim
61	146	Efficient Kernel Machines Using the Improved Fast Gauss Transform	claim
62	145	Log-concavity Results on Gaussian Process Methods for Supervised and Unsupervised Learning	claim
63	145	Learning Gaussian Process Kernels via Hierarchical Bayes	claim
64	145	Instance-Specific Bayesian Model Averaging for Classification	claim
65	143	Nonlinear Blind Source Separation by Integrating Independent Component Analysis and Slow Feature Analysis	claim
66	143	Common-Frame Model for Object Recognition	claim
67	143	Identifying Protein-Protein Interaction Sites on a Genome-Wide Scale	claim
68	142	Analysis of a greedy active learning strategy	claim
69	142	Pictorial Structures for Molecular Modeling: Interpreting Density Maps	claim
70	142	The Entire Regularization Path for the Support Vector Machine	claim
71	141	Worst-Case Analysis of Selective Sampling for Linear-Threshold Algorithms	claim
72	141	Efficient Out-of-Sample Extension of Dominant-Set Clusters	claim
73	141	An Information Maximization Model of Eye Movements	claim
74	141	Semi-Markov Conditional Random Fields for Information Extraction	claim
75	138	Exponentiated Gradient Algorithms for Large-margin Structured Classification	claim
76	138	Instance-Based Relevance Feedback for Image Retrieval	claim
77	138	New Criteria and a New Algorithm for Learning in Multi-Agent Systems	claim
78	137	Modeling Conversational Dynamics as a Mixed-Memory Markov Process	claim
79	137	Object Classification from a Single Example Utilizing Class Relevance Metrics	claim
80	137	Brain Inspired Reinforcement Learning	claim
81	137	Semi-parametric Exponential Family PCA	claim
82	136	The Laplacian PDF Distance: A Cost Function for Clustering in a Kernel Feature Space	claim
83	136	Boosting on Manifolds: Adaptive Regularization of Base Classifiers	claim
84	136	Nearly Tight Bounds for the Continuum-Armed Bandit Problem	claim
85	136	Heuristics for Ordering Cue Search in Decision Making	claim
86	135	Probabilistic Inference of Alternative Splicing Events in Microarray Data	claim
87	134	Bayesian Regularization and Nonnegative Deconvolution for Time Delay Estimation	claim
88	134	Kernel Projection Machine: a New Tool for Pattern Recognition	claim
89	133	Comparing Beliefs, Surveys, and Random Walks	claim
90	133	On Semi-Supervised Classification	claim
91	133	Following Curved Regularized Optimization Solution Paths	claim
92	133	Machine Learning Applied to Perception: Decision Images for Gender Classification	claim
93	132	Mistake Bounds for Maximum Entropy Discrimination	claim
94	131	Generative Affine Localisation and Tracking	claim
95	128	Learning Preferences for Multiclass Problems	claim
96	128	A Cost-Shaping LP for Bellman Error Minimization with Performance Guarantees	claim
97	128	Detecting Significant Multidimensional Spatial Clusters	claim
98	128	Spike-timing Dependent Plasticity and Mutual Information Maximization for a Spiking Neuron Model	claim
99	127	Maximising Sensitivity in a Spiking Network	claim
100	127	Beat Tracking the Graphical Model Way	claim
101	127	A Topographic Support Vector Machine: Classification Using Local Label Configurations	claim
102	127	Semi-supervised Learning on Directed Graphs	claim
103	125	VDCBPI: an Approximate Scalable Algorithm for Large POMDPs	claim
104	125	Using the Equivalent Kernel to Understand Gaussian Process Regression	claim
105	124	Optimal Aggregation of Classifiers and Boosting Maps in Functional Magnetic Resonance Imaging	claim
106	124	A Temporal Kernel-Based Model for Tracking Hand Movements from Neural Activities	claim
107	123	A Generalized Bradley-Terry Model: From Group Competition to Individual Skill	claim
108	123	Message Errors in Belief Propagation	claim
109	123	Algebraic Set Kernels with Application to Inference Over Local Image Representations	claim
110	122	Reducing Spike Train Variability: A Computational Theory Of Spike-Timing Dependent Plasticity	claim
111	122	Maximum-Margin Matrix Factorization	claim
112	120	Methods Towards Invasive Human Brain Computer Interfaces	claim
113	120	Multi-agent Cooperation in Diverse Population Games	claim
114	120	A Direct Formulation for Sparse PCA Using Semidefinite Programming	claim
115	119	Triangle Fixing Algorithms for the Metric Nearness Problem	claim
116	119	Outlier Detection with One-class Kernel Fisher Discriminants	claim
117	119	Synergies between Intrinsic and Synaptic Plasticity in Individual Model Neurons	claim
118	118	Dependent Gaussian Processes	claim
119	118	Methods for Estimating the Computational Power and Generalization Capability of Neural Microcircuits	claim
120	118	Semi-supervised Learning with Penalized Probabilistic Clustering	claim
121	117	Hierarchical Distributed Representations for Statistical Language Modeling	claim
122	117	Class-size Independent Generalization Analsysis of Some Discriminative Multi-Category Classification	claim
123	116	A Machine Learning Approach to Conjoint Analysis	claim
124	116	Rate- and Phase-coded Autoassociative Memory	claim
125	116	Maximum Likelihood Estimation of Intrinsic Dimension	claim
126	116	Resolving Perceptual Aliasing In The Presence Of Noisy Sensors	claim
127	115	Euclidean Embedding of Co-Occurrence Data	claim
128	115	Modelling Uncertainty in the Game of Go	claim
129	115	The Rescorla-Wagner Algorithm and Maximum Likelihood Estimation of Causal Parameters	claim
130	114	Incremental Algorithms for Hierarchical Classification	claim
131	113	Distributed Information Regularization on Graphs	claim
132	113	Coarticulation in Markov Decision Processes	claim
133	113	The Convergence of Contrastive Divergences	claim
134	112	Learning first-order Markov models for control	claim
135	112	Generalization Error Bounds for Collaborative Prediction with Low-Rank Matrices	claim
136	111	The Power of Selective Memory: Self-Bounded Learning of Prediction Suffix Trees	claim
137	110	Learning Hyper-Features for Visual Identification	claim
138	110	Sampling Methods for Unsupervised Learning	claim
139	109	A Large Deviation Bound for the Area Under the ROC Curve	claim
140	109	Learning, Regularization and Ill-Posed Inverse Problems	claim
141	109	Real-Time Pitch Determination of One or More Voices by Nonnegative Matrix Factorization	claim
142	109	A Probabilistic Model for Online Document Clustering with Application to Novelty Detection	claim
143	108	A Method for Inferring Label Sampling Mechanisms in Semi-Supervised Learning	claim
144	108	Sharing Clusters among Related Groups: Hierarchical Dirichlet Processes	claim
145	107	Non-Local Manifold Tangent Learning	claim
146	107	Economic Properties of Social Networks	claim
147	107	Validity Estimates for Loopy Belief Propagation on Binary Real-world Networks	claim
148	106	Mass Meta-analysis in Talairach Space	claim
149	106	Density Level Detection is Classification	claim
150	105	Harmonising Chorales by Probabilistic Inference	claim
151	104	Neighbourhood Components Analysis	claim
152	104	Parametric Embedding for Class Visualization	claim
153	103	Experts in a Markov Decision Process	claim
154	103	Multiple Relational Embedding	claim
155	103	Expectation Consistent Free Energies for Approximate Inference	claim
156	102	Solitaire: Man Versus Machine	claim
157	101	Convergence and No-Regret in Multiagent Learning	claim
158	101	Trait Selection for Assessing Beef Meat Quality Using Non-linear SVM	claim
159	101	Variational Minimax Estimation of Discrete Distributions under KL Loss	claim
160	100	Large-Scale Prediction of Disulphide Bond Connectivity	claim
161	100	Implicit Wiener Series for Higher-Order Image Analysis	claim
162	99	Inference, Attention, and Decision in a Bayesian Neural Architecture	claim
163	99	Temporal-Difference Networks	claim
164	98	Learning Efficient Auditory Codes Using Spikes Predicts Cochlear Filters	claim
165	98	Distributed Occlusion Reasoning for Tracking with Nonparametric Belief Propagation	claim
166	97	Sub-Microwatt Analog VLSI Support Vector Machine for Pattern Classification and Sequence Estimation	claim
167	96	Linear Multilayer Independent Component Analysis for Large Natural Scenes	claim
168	96	Kernel Methods for Implicit Surface Modeling	claim
169	95	Newscast EM	claim
170	95	PAC-Bayes Learning of Conjunctions and Classification of Gene-Expression Data	claim
171	94	Schema Learning: Experience-Based Construction of Predictive Action Models	claim
172	94	Stable adaptive control with online learning	claim
173	94	Discrete profile alignment via constrained information bottleneck	claim
174	93	Theories of Access Consciousness	claim
175	93	Intrinsically Motivated Reinforcement Learning	claim
176	92	Responding to Modalities with Different Latencies	claim
177	92	Unsupervised Variational Bayesian Learning of Nonlinear Models	claim
178	91	Planning for Markov Decision Processes with Sparse Stochasticity	claim
179	90	Maximal Margin Labeling for Multi-Topic Text Categorization	claim
180	90	Semi-supervised Learning via Gaussian Processes	claim
181	88	Spike Sorting: Bayesian Clustering of Non-Stationary Data	claim
182	88	Kernels for Multi--task Learning	claim
183	87	Binet-Cauchy Kernels	claim
184	85	A Second Order Cone programming Formulation for Classifying Missing Data	claim
185	85	Joint Probabilistic Curve Clustering and Alignment	claim
186	85	Optimal Information Decoding from Neuronal Populations with Specific Stimulus Selectivity	claim
187	84	Whos In the Picture	claim
188	84	Supervised Graph Inference	claim
189	82	The Variational Ising Classifier (VIC) Algorithm for Coherently Contaminated Data	claim
190	77	A Hidden Markov Model for de Novo Peptide Sequencing	claim
191	77	Generalization Error and Algorithmic Convergence of Median Boosting	claim
192	74	Semigroup Kernels on Finite Sets	claim
193	70	Optimal sub-graphical models	claim
194	66	Exploration-Exploitation Tradeoffs for Experts Algorithms in Reactive Environments	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers