Sciweavers

1914 search results - page 374 / 383
» A Segmentation Algorithm for Contrast-Enhanced Images
Sort
View
PR
2007
189views more  PR 2007»
13 years 7 months ago
Information cut for clustering using a gradient descent approach
We introduce a new graph cut for clustering which we call the Information Cut. It is derived using Parzen windowing to estimate an information theoretic distance measure between p...
Robert Jenssen, Deniz Erdogmus, Kenneth E. Hild II...
PR
2008
170views more  PR 2008»
13 years 7 months ago
Annealing and the normalized N-cut
We describe an annealing procedure that computes the normalized N-cut of a weighted graph G. The first phase transition computes the solution of the approximate normalized 2-cut p...
Tomás Gedeon, Albert E. Parker, Collette Ca...
TAP
2010
Springer
191views Hardware» more  TAP 2010»
13 years 6 months ago
Mesh saliency and human eye fixations
raction, simplification, segmentation, illumination, rendering, and illustration. Even though this technique is inspired by models of low-level human vision, it has not yet been v...
Youngmin Kim, Amitabh Varshney, David W. Jacobs, F...
TMM
2011
177views more  TMM 2011»
13 years 2 months ago
MIMiC: Multimodal Interactive Motion Controller
Abstract—We introduce a new algorithm for real-time interactive motion control and demonstrate its application to motion captured data, pre-recorded videos and HCI. Firstly, a da...
Dumebi Okwechime, Eng-Jon Ong, Richard Bowden
PAMI
2010
207views more  PAMI 2010»
13 years 2 months ago
Document Ink Bleed-Through Removal with Two Hidden Markov Random Fields and a Single Observation Field
We present a new method for blind document bleed through removal based on separate Markov Random Field (MRF) regularization for the recto and for the verso side, where separate pri...
Christian Wolf