A new optimisation strategy for surface mesh registration is proposed based on energy minimisation of an elastic surface membrane. The energy term is evaluated in three-dimensional space, optimisation however is perfo...
详细信息
Evaluating new approaches, be it new interaction techniques, new applications or even new hardware, is an important task, which has to be done to ensure both usability and user satisfaction. The drawback of evaluating...
详细信息
Emerging and established methods, such as optical imaging and MR spectroscopy (MRS), offer new opportunities for in situ biosensing. The limited tissue penetration of these modalities can be addressed by locally placi...
详细信息
The objective of semantic segmentation in microscopic images is to extract the cellular, nuclear or tissue components. This problem is challenging due to the large variations of these components features (size, shape,...
详细信息
Projector phones, handheld game consoles and many other mobile devices increasingly include more than one display, and therefore present a new breed of mobile Multi-Display Environments (MDEs) to users. Existing studi...
详细信息
This paper deals with the effects of integrated vibrotactile feedback on the "feel" of a digital musical instrument (DMI). Building on previous work developing a DMI with integrated vibrotactile feedback act...
详细信息
作者:
Alzahir, SaifImage Processing
Graphics and Multimedia Lab Computer Science Department UNBC Prince George BC V2N 4Z9 Canada
In this paper we propose a model-based binary image compression scheme. In this scheme, we merge one-dimensional (1-D) blocks of black pixels of the input binary image with those in consecutive rows into larger blocks...
详细信息
Curvilinear structures are useful features, particularly in medical image analysis. Typically, a pixel-wise comparison with manually specified ground truth is used for performance evaluation. In this paper we propose ...
详细信息
We investigate the complexity of shortest paths in time-dependent graphs, in which the costs of edges vary as a function of time, and as a result the shortest path between two nodes s and d can change over time. Our m...
ISBN:
(纸本)9780898719932
We investigate the complexity of shortest paths in time-dependent graphs, in which the costs of edges vary as a function of time, and as a result the shortest path between two nodes s and d can change over time. Our main result is that when the edge cost functions are (polynomial-size) piecewise linear, the shortest path from s to d can change n~(Θ(log n)) times, settling a several-year-old conjecture of Dean [Technical Reports, 1999, 2004]. We also show that the complexity is polynomial if the slopes of the linear function come from a restricted class, present an output-sensitive algorithm for the general case, and describe a scheme for a (1 +ε)-approximation of the travel time function in near-quadratic space. Finally, despite the fact that the arrival time function may have superpolynomial complexity, we show that a minimum delay path for any departure time interval can be computed in polynomial time.
The treatment of patients with head and neck cancers is a demanding medical field, due to the compact anatomy and complex functionality of the affected region. The planning process comprises issues regarding risk and ...
详细信息
暂无评论