The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Silhouettes are common features used by many applications in computer vision. For many of these algorithms to perform optimally, accurately segmenting the objects of interest from the background to extract the silhouettes is essential. Motion segmentation is a popular technique to segment moving objects from the background, however such algorithms can be prone to poor segmentation, particularly in...
Osteoporosis is a bone disease characterized by a reduction in bone mass, resulting in an increased risk of fractures. To diagnose the osteoporosis accurately, bone mineral density (BMD) measurements and fracture analysis (FA) of the Vertebral bodies (VBs) are required. In this paper, we propose a robust and 3D shape based method to segment VBs in clinical computed tomography (CT) images in order...
Acquiring accurate silhouettes has many applications in computer vision. This is usually done through motion detection, or a simple background subtraction under highly controlled environments (i.e. chroma-key backgrounds). Lighting and contrast issues in typical outdoor or office environments make accurate segmentation very difficult in these scenes. In this paper, gradients are used in conjunction...
We propose a set of distributed algorithms for in-network path planning that enables a distributed sensor network navigation service in dynamic environments. Different from existing algorithms that use frequent or periodic flooding, our algorithms exploit geographic information of sensors to construct and maintain navigation links. Based on a partial reversal method of directed acyclic graphs, our...
We introduce the minimum energy path planning (MEPP) problem of finding a path for a mobile node traveling from a source to a destination while communicating with at least one node from a set of stationary nodes in such a way that minimizes the transmission energy used in communication. We characterize this problem and introduce the discretized graph algorithm that finds an approximate path by discretizing...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.