Sciweavers

1539 search results - page 52 / 308
» Fast and Simple Methods For Computing Control Points
Sort
View
114
Voted
CHI
2004
ACM
16 years 2 months ago
Pointing without a pointer
We present a method for performing selection tasks based on continuous control of multiple, competing agents who try to determine the user's intentions from their control beh...
John Williamson, Roderick Murray-Smith
106
Voted
ICIP
2005
IEEE
16 years 4 months ago
Color signal decomposition method using 3-D Gamut boundary of multi-primary display
Color signal decomposition method is to decompose the conventional three-primary colors(RGB) into the multiprimary control values of multi-primary display(MPD) under the constraint...
Dong-Woo Kang, Yang-Ho Cho, Myong-Young Lee, Tae-Y...
ICCV
2009
IEEE
15 years 3 days ago
An algebraic model for fast corner detection
This paper revisits the classical problem of detecting interest points, popularly known as "corners," in 2D images by proposing a technique based on fitting algebraic sh...
Andrew Willis, Yunfeng Sui
139
Voted
SI3D
2009
ACM
15 years 9 months ago
Soft irregular shadow mapping: fast, high-quality, and robust soft shadows
We introduce a straightforward, robust, and efficient algorithm for rendering high-quality soft shadows in dynamic scenes. Each frame, points in the scene visible from the eye ar...
Gregory S. Johnson, Warren A. Hunt, Allen Hux, Wil...
COMSIS
2010
14 years 11 months ago
3D point pattern matching based on spatial geometric flexibility
We propose a new method for matching two 3D point sets of identical cardinality with global similarity but local non-rigid deformations and distribution errors. This problem arises...
Xiaopeng Wei, Xiaoyong Fang, Qiang Zhang, Dongshen...