In this paper we describe a medical application where we exploit surface properties (measured in form of 3D-Range scans of the human back) to derive a-priori unknown additional properties of the proband, that otherwis...
详细信息
ISBN:
(纸本)8090310079
In this paper we describe a medical application where we exploit surface properties (measured in form of 3D-Range scans of the human back) to derive a-priori unknown additional properties of the proband, that otherwise can only be acquired using multiple x-ray recordings or volumetric scans as CT or MRI. On the basis of 274 data sets, we perform classification using statistical shape analysis methods. Consistent parameterization and alignment is achieved on the basis of only few anatomic landmarks. As our choice of landmarks is easy to detect on the human body, our approach is feasible for screening applications that can be expected to have much impact on the early detection and later treatment of spine deformities, in particular scoliosis. Copyright UNION Agency - science Press.
In this paper we describe a rate-based OBS network architecture in which core switch nodes send explicit messages to edge nodes requesting them to reduce their transmission rate on congested links. Within this framewo...
详细信息
ISBN:
(纸本)0780394143
In this paper we describe a rate-based OBS network architecture in which core switch nodes send explicit messages to edge nodes requesting them to reduce their transmission rate on congested links. Within this framework, we introduce a new contention avoidance mechanism called proportional control algorithm with explicit reduction request (PCwER). Through source rate control, PCwER proactively attempts to prevent the network from entering the congestion state. Basic building blocks and performance trade-offs of PCwER are the main focus of this paper. In addition, through a simple fluid model we analyze the characteristics of the algorithm. Our simulation results show that the proposed contention avoidance techniques improve the network utilization and reduce the packet loss probability.
This paper introduces a new kind of mosaic, called the Decorative PixMosaic, where photo tiles of square shapes are used to compose the final image. We can express the resulting image with a similar color distribution...
This paper introduces a new kind of mosaic, called the Decorative PixMosaic, where photo tiles of square shapes are used to compose the final image. We can express the resulting image with a similar color distribution of input images from small photo tiles. Based on an input image, user-selected edge features and a wide range of photo tiles, the method can both reproduce the image’s textures and emphasize the selected edges by placing tiles that follow the edges. The voronoi site is situated in the center point of the tile using the Centroidal Voronoi Diagram for equally maintaining the distance among the tiles. To express the edges using tiles on the voronoi site as the center point, tiles do not cross image edges and are drawn up as following edge’s direction. We use a distribution photo with similar color selected from the photo database. It is important to search for a visually similar photo. Hence we must have a large number of photo tiles.
In this paper, we propose a lossless binary image compression scheme that can achieve high compression ratio via partitioning the black regions (one's) of the input image into rectangles. After partitioning, the t...
详细信息
In this paper, we propose a lossless binary image compression scheme that can achieve high compression ratio via partitioning the black regions (one's) of the input image into rectangles. After partitioning, the t...
详细信息
In this paper, we propose a lossless binary image compression scheme that can achieve high compression ratio via partitioning the black regions (one's) of the input image into rectangles. After partitioning, the top-left and the bottom-right vertices of each rectangle are identified and the coordinates of which are efficiently coded. Three different routines are used in this research. The proposed scheme is targeting images, which contain graphs and tables with solid gridlines in the background on the one hand. While on the other hand it is suitable for text images of languages where many characters have dots "nuqta " on them such as Urdu, Persian, and Arabic with big fonts. The proposed scheme has outperformed CCITT run length coding, modified READ, and REC significantly. Also it is faster and simpler to implement than the method reported in A. Quddus et al (1999)
While speech animation fundamentally consists of a sequence of phonemes over time, sophisticated animation requires smooth interpolation and co-articulation effects, where the preceding and following phonemes influenc...
详细信息
While speech animation fundamentally consists of a sequence of phonemes over time, sophisticated animation requires smooth interpolation and co-articulation effects, where the preceding and following phonemes influence the shape of a phoneme. Co-articulation has been approached in speech animation research in several ways, most often by simply smoothing the mouth geometry motion over time. Data-driven approaches tend to generate realistic speech animation, but they need to store a large facial motion database, which is not feasible for real time gaming and interactive applications on platforms such as PDAs and cell phones. In this paper we show that accurate speech co-articulation model with compact size can be learned from facial motion capture data. An initial phoneme sequence is generated automatically from text-to-speech (TTS) systems. Then, our learned co-articulation model is applied to the resulting phoneme sequence, producing natural and detailed motion. The contribution of this work is that speech co-articulation models "learned" from real human motion data can be used to generate natural-looking speech motion while simultaneously preserving the expressiveness of the animation via keyframing control. Simultaneously, this approach can be effectively applied to interactive applications due to its compact size.
In this paper, we propose a near minimum sparse pattern coding based scheme for binary image compression. Sparse patterns such as those obtained from prediction, image differencing, and other methods can be coded effi...
详细信息
In this paper, we propose a near minimum sparse pattern coding based scheme for binary image compression. Sparse patterns such as those obtained from prediction, image differencing, and other methods can be coded efficiently using the scheme proposed in this paper. In this research we apply our scheme on coordinate representation of rectangular regions via a number of matrices. Such representations allow for efficiently coding these vertices, and hence compress the image significantly. Simulation results show that the proposed scheme outperformed previously published methods for coordinate data coding by nearly 17%. This scheme has low complexity compared with JBIG2.
Heavy hitters, which are items occurring with frequency above a given threshold, are an important aggregation and summary tool when processing data streams or data warehouses. Hierarchical heavy hitters (HHHs) have be...
详细信息
ISBN:
(纸本)9781595930620
Heavy hitters, which are items occurring with frequency above a given threshold, are an important aggregation and summary tool when processing data streams or data warehouses. Hierarchical heavy hitters (HHHs) have been introduced as a natural generalization for hierarchical data domains, including multi-dimensional data. An item x in a hierarchy is called a Φ-HHH if its frequency after discounting the frequencies of all its descendant hierarchical heavy hitters exceeds Φn, where Φ is a user-specified parameter and n is the size of the data set. Recently, single-pass schemes have been proposed for computing Φ-HHHs using space roughly O(1/Φ log(Φn)). The frequency estimates of these algorithms, however, hold only for the total frequencies of items, and not the discounted frequencies;this leads to false positives because the discounted frequency can be significantly smaller than the total frequency. This paper attempts to explain the difficulty of finding hierarchical heavy hitters with better accuracy. We show that a single-pass deterministic scheme that computes Φ-HHHs in a d-dimensional hierarchy with any approximation guarantee must use Ω(1/Φd+1) space. This bound is tight: in fact, we present a data stream algorithm that can report the Φ-HHHs without false positives in O(1/Φd+1) space. Copyright 2005 ACM.
As virtual environment technology becomes accessible and affordable, there has been an increase in constructing and connecting virtual worlds. Networked virtual environments allow us to meet and interact with people e...
As virtual environment technology becomes accessible and affordable, there has been an increase in constructing and connecting virtual worlds. Networked virtual environments allow us to meet and interact with people even though they may be located in different parts of the world. It has been employed in many simulative applications such as manufacturing, business, education, medicine and so on. Networked virtual environment can be more realistic and powerful by applying mixed reality technology merging real and virtual worlds. Focusing on the theme about building and connecting mixed worlds, technical issues are analyzed in terms of data acquisition, visualization, interaction, network communication, and so on. Exploring related work of many research laboratories, future possibilities are also discussed.
Ecce Homology, a physically interactive new-media work, visualizes genetic data as calligraphic forms. A novel computervision based user interface allows multiple participants, through their movement in the installati...
详细信息
ISBN:
(纸本)9781450378291
Ecce Homology, a physically interactive new-media work, visualizes genetic data as calligraphic forms. A novel computervision based user interface allows multiple participants, through their movement in the installation space, to select genes from the human genome for visualizing the Basic Local Alignment Search Tool (BLAST), a primary algorithm in comparative genomics.
暂无评论