Sciweavers

479 search results - page 35 / 96
» From a Set of Shapes to Object Discovery
Sort
View
ASUNAM
2010
IEEE
13 years 9 months ago
Fast Discovery of Reliable Subnetworks
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...
Petteri Hintsanen, Hannu Toivonen, Petteri Sevon
JCIT
2007
107views more  JCIT 2007»
13 years 7 months ago
A New Approach to Computing Weighted Attributes Values in Incomplete Information Systems
The Rough Sets theory has been conceived to deal with inexact, uncertain or vague knowledge in Information systems. The article is devoted to propose notions including the general...
Tian Hong, Wang Xiukun, Henryk Rybinski
DPHOTO
2010
208views Hardware» more  DPHOTO 2010»
13 years 9 months ago
A signature analysis based method for elliptical shape
The high level context image analysis regards many fields as face recognition, smile detection, automatic red eye removal, iris recognition, fingerprint verification, etc. Techniq...
Ivana Guarneri, Mirko Guarnera, Giuseppe Messina, ...
ICML
2007
IEEE
14 years 8 months ago
Linear and nonlinear generative probabilistic class models for shape contours
We introduce a robust probabilistic approach to modeling shape contours based on a lowdimensional, nonlinear latent variable model. In contrast to existing techniques that use obj...
Graham McNeill, Sethu Vijayakumar
IPMI
2007
Springer
14 years 8 months ago
Shape Modeling and Analysis with Entropy-Based Particle Systems
This paper presents a new method for constructing compact statistical point-based models of ensembles of similar shapes that does not rely on any specific surface parameterization....
Joshua E. Cates, P. Thomas Fletcher, Martin Andrea...