Search

In this paper, we propose a deeply parallel architecture called Fragment-based Interleaving Dual Pipelines(FIDP) which can exploit all parallelisms in Lifting-based 2D DWT algorithm. FIDP adopts a fragment-based samples consumption policy and consists of two row processors and two column processors. These processors are organized as interleaving dual pipelines to operate effectively. FIDP takes N2/4+N/2+1 cycles to finish a N×N 2D DWT while requires only 5N+2 buffer. [ABSTRACT FROM AUTHOR]

‘Coopetitive' interaction strategy has been shown to give better results than similar strategies like ‘only cooperation', ‘only competition' etc [7]. However, this has been studied only in the context of visual sensors and for handling non-simultaneous events. In this paper, we study this ‘coopetitive' strategy from a multimedia surveillance system perspective, wherein the system needs to utilize multiple heterogeneous sensors and also handle multiple simultaneous events. Applying such an interaction strategy to multimedia surveillance systems is challenging because heterogeneous sensors have different capabilities for performing different sub-tasks as well as dissimilar response times. We adopt a merit-cum-availability based approach to allocate various sub-tasks to the competing sensors which eventually cooperate to achieve the specified system goal. Also, a ‘coopetition' based strategy is adopted for effectively utilizing the information coming asynchronously from different data sources. Multiple simultaneous events (e.g. multiple intrusions) are handled by adopting a predictive strategy which estimates the exit time for each intruder and then uses this information for enhanced scheduling. The results obtained for two sets of surveillance experiments conducted with two active cameras and a motion sensor grid are promising. [ABSTRACT FROM AUTHOR]

In this paper, we propose fast color interpolation methods for color filter array (CFA). The proposed methods exploit correlations among the three color components. It has been reported that the quality of color interpolation can be significantly improved by utilizing correlation among color components. However, the complexity of such methods may increase significantly compared to those methods which separately interpolate each color component. On the other hand, the major application of CFA is portable imaging devices such as digital cameras or mobile phones. For portable devices, power consumption is an important issue. In this paper, we propose high quality color interpolation methods with reduced complexity. Experimental results show that the proposed methods provide noticeable improvements without significantly increasing the system complexity. [ABSTRACT FROM AUTHOR]

Most graphics used in web pages are very attractive for the eye and useful for a lot of people. However, with the extensive use of pixel graphics such as charts without additional textual description or image maps, handicapped users of web pages are encountering an ever increasing amount of barriers. Therefore, it is essential that future development on web content focuses on accommodating all kinds of disabilities. The use of Scalable Vector Graphics (SVG) provides new possibilities as well as new challenges for the accessibility of web sites. Consequently, the Access2Graphics implementation is embedded in a peer-to-peer (P2P) network with reusable SVG patterns for enhanced barrier-free web applications. The aim of the new architecture is to support graphic designers and web developers in making graphics accessible for as many user groups as possible. [ABSTRACT FROM AUTHOR]

In the recent years a growing interest in Collaborative Virtual Environments (CVE) can be observed. Most of these systems use event-object driven architectures for consistent and clear communication inside these systems and in between them. Networked Virtual Reality (VR) applications make heavy use of position tracking data and process a vast amount of transformation matrices during their simulation steps. This observation leads to a novel approach on how communication in Networked Virtual Environments (NVEs) could take place by considering events as well as transformation data to allow for higher responsiveness within Virtual Worlds. [ABSTRACT FROM AUTHOR]

Ever since man invented writing he has used text to store and distribute his thoughts. With the advent of computers and the Internet the delivery of these messages has become almost instant. Textual conversations can now be had regardless of location or distance. Advances in computational power for 3D graphics are enabling Virtual Environments(VE) within which users can become increasingly more immersed. By opening these environments to other users such as initially through sharing these text conversations channels, we aim to extend the immersed experience into an online virtual community. This paper examines work that brings textual communications into the VE, enabling interaction between the real and virtual worlds. [ABSTRACT FROM AUTHOR]

In this paper, the performance of a wireless communication system based on the TD-CDMA transmission technique is analyzed. In this paper, we present simulation results for the performance of a turbo coded TD-CDMA system with QPSK over Rayleigh fading channel model. And the system performance employing the simple averaging channel estimation is compared to the ideal case with the perfect channel estimation. [ABSTRACT FROM AUTHOR]

In this paper, we consider the problem of finding the k most similar objects given a query object, in large multimedia datasets. We focus on scenarios where the similarity measure itself is not fixed, but is continuously being refined with user feedback. Conventional database techniques for efficient similarity search are not effective in this environment as they take a specific similarity/distance measure as input and build index structures tuned for that measure. Our approach works effectively in this environment as validated by the experimental study where we evaluate it over a wide range of datasets. The experiments show it to be efficient and scalable. In fact, on all our datasets, the response times were within a few seconds, making our approach suitable for interactive applications. [ABSTRACT FROM AUTHOR]

More and more applications require peer-to-peer (P2P) systems to support complex queries over multi-dimensional data. The retrieval facilities of most P2P systems are limited to queries based on a unique identifier or a small set of keywords. The techniques used for this purpose are hardly applicable for content-based video retrieval in a P2P network (CBP2PVR). In this paper, we present the design of a distributed P2P video sharing system that supports content-based video retrieval. First we will propose the compact signature generation of video shot which can be distributed in a P2P network and used as the basis for a source selection. Second, a Global Indexing structure based on proposed novel PVR-tree index schema allows communicating only with a small fraction of all peers during query processing without deteriorating the result quality significantly. We will also present experimental results confirming our approach. [ABSTRACT FROM AUTHOR]

When building some kinds of IT systems, security-related requirements must be considered. It is essential that not only the customer's requirements for software or systems functionality should be satisfied but also the security requirements imposed on the software or systems development should be effectively analyzed and implemented in contributing to the security objectives of customer's requirements. Though the customer's requirements must be implemented to software or systems perfectly, but these are not sufficient. The secure software or systems may be implemented by not only applying security products but also considering security requirement appended to customer's requirement. In this paper, we propose a security engineering based approach considering security when developing software or systems based on System Block Model. [ABSTRACT FROM AUTHOR]

Until now, various web caching replacement algorithms related to this were researched. An aggravation of web object heterogeneity more frequently generates a replacement of a web object, but cannot reflect enough all kinds of characteristics of web object in these traditional replacement techniques. Especially size heterogeneity of an object has an influence on performance of a web caching seriously. Therefore, a study on web caching algorithm with size heterogeneity of an object is required. In this study, we proposed a web object replacement algorithm with heterogeneity of a web object for performance improvement of the response speed. The algorithm is designed with a divided scope that considered size reference characteristic and reduced size heterogeneity on web object. The performance of the algorithm is analyzed with an experiment. With the experiments results, the algorithm is compared with previous replacement algorithms, and its performance is confirmed with 10%-20% elevation of object-hit ratio and an improvement of response speed. [ABSTRACT FROM AUTHOR]

A web caching technology is one of the major factors, which affects the performance of a web system. The existing studies related to web caching technology have been focused on an increase in object-hit ratio and a decrease in caching costs. However, a web caching technology, which analyzes and reflects the reference characteristics of the web object, is required to effectively operate a web system, because the reference characteristics of web object becomes a major factor in decreasing the performance of a web system. In this paper, we analyze the reference characteristics of web object. [ABSTRACT FROM AUTHOR]

What is most important issue in web services using Multimedia Content is acceleration technique for efficient distribution of the multimedia content. Web services are based on a web-based system in which the performance of this system becomes a major factor in determining the quality of services. Thus, studies on the acceleration of the acceleration of the multimedia content are directly linked with the improvement of a web system. An improvement in the system performance can be achieved using a type of load uniformity (hereinafter called load balancing) by producing a cluster system using several server systems from a web service provider's point of view. This study investigates a method that improves the acceleration performance in a web-based service. A method that distributes loads applied to a web system itself using a dynamic load balancing method, which uses various types of information between nearby servers, was investigated from a web service provider's point of view. [ABSTRACT FROM AUTHOR]

Korean script Hunminjeongeum (correct sounds to teach the people), called Hangul, that was distributed in 1446 can generate 39.9 billion syllabic characters by 28 basic alphabets and 5 rules. Current Hangul on computer lost scientific properties and then cannot generate all of 39.9 billion syllables because choosing syllable as a target among encoding objects of syllable, syllabic primitive, and alphabet. In this paper, we propose a coding scheme and a method of generating fonts so as to represent all syllabic characters defined in Hunminjeongeum. [ABSTRACT FROM AUTHOR]

Various intelligence styles ITS systems are developed by wireless network and development of GPS (Global Positioning System). Vehicles position track system that grasps position of vehicles by real time at control and monitoring center is a core of public transportation information system and it supplies various information that are related to the vehicles position information to user and administrator. Most existing Vehicle location tracking systems use a GPS system that is a high cost device then other things. Therefore, we designed vehicle location track system that using sensor node in which node has an inexpensive and miniaturized RF transceiver. Proposed vehicles position track system collects message that wireless ad-hoc network that is consisted of fixing sensor node that is installed along bus route and mobile sensor node that is installed to bus are happened contacting in server and manage transfer information of vehicles. Also, take advantage of bidirectional of wireless ad-hoc network it can supply bus surrounding information connected with bus position information to passenger. [ABSTRACT FROM AUTHOR]

The proposed hybrid MAC (H-MAC) protocol characterizes distributed and asynchronous operation. It uses an implicit token for a real-time traffic and the CSMA/CA for a non-real time traffic, guaranteeing QoS. The proposed hybrid MAC protocol allocates the assured bandwidth to real time traffic and dynamically reallocates the remaining bandwidth to a non-real time data traffic. [ABSTRACT FROM AUTHOR]

With the rapid development of Mobile Ad-hoc Networks (MANET) and Peer-to-Peer (P2P) computing, it is envisioned that building P2P multimedia sharing system over MANETs is promising. In this paper, we propose a geographic-information based distributed index structure, Geographically Hierarchical Index (GHI), based on which, we could design improved p2p algorithms especially for the multimedia sharing over MANET. [ABSTRACT FROM AUTHOR]

This paper is on the design and development of a conversion mechanism for MPEG-4 contents services on Web environment. The service was provided on Web environment first by parsing the MPEG-4 contents, then converting them to SMIL. After the two-dimensional profile of the MPEG-4 XMT and SMIL schemes was analyzed, the correlation among the nodes with the same or similar meanings was set as a rule. With the defined rule, an XSL document was created, and XMT was converted to SMIL using the converted XSL document and XSLT, which was derived from MSXML. Moreover, the two-dimensional geometric object that cannot be expressed in SMIL was authored in SVG to add SMIL media characters. Its advantage is that it services current MPEG-4 contents in various environments such as the Web or mobile environments, and it can be converted to service more playable environments if one knows the syntax definition of other scene description languages. [ABSTRACT FROM AUTHOR]

This paper is to develop a model for evaluation of highway alignment design considering the drivers' behavior in order to enhance the highway safety. The vehicle spacing is suggested as a new evaluation index. The suggested model is based on the artificial neural network, which can explain the non-linear relationship on the highway geometric elements. The model shows better fitting comparing with the current regression models explaining only the linear relationship. It may be helpful to evaluate the safety of newly designed highway and safety improvement program for highways in-service. [ABSTRACT FROM AUTHOR]

Various traffic simulation programs have been developed, and the role of micro simulation increases recently, and the car following theory provides the theoretical background. However, current car following models apply the uniform driver factors regardless the characteristics of driver, vehicle and highway, then there exists a gap between the simulation result and real situation. This study is performed to derive the driver's sensitivity parameters which are even closer to the real. The fuzzy approximate reasoning can find the driver's sensitivity which varies by the traffic situation. Result shows better performance than the GM model. It means that the proposed driver's sensitivity parameters can represent the real situation better. [ABSTRACT FROM AUTHOR]

There are about 800,000 map sheets for 36,500,000 parcels of land of Korea. They have been used for almost 100 years with the known problems of the shrinkage-expansion of the paper cadastral maps. The area of a parcel is recorded in a cadastre, and the maps are used just as a reference drawing for the location and the shape of the land. However, digitization of the maps began to reveal the problem of distortion of the map as the conflict between the areas on the cadastre and the digital maps was shown in numerical form. The distortion problem is tried to be resolved in this paper. Using the fact that original maps drawn on the plane tables in the years of 1910 to 1918 have grid lines and have been preserved well, a strategic flow was developed, which applies the refinement techniques to the digital maps with the original maps as controls. Several types of distortions and corrections were simulated, and errors between an error-free map and the distortion corrected map were evaluated. The RMS errors in the corrected digital maps were allowable, thus, the method developed in this study was applicable for the digital cadastral maps. [ABSTRACT FROM AUTHOR]

In this study, the surveyed Trip Length Frequency Distribution (TLFD)is determined as a criterion for the reliability of evaluating the true O/D matrix. The surveyed TLFD can be used to check the similarity between the surveyed (true) Trip Length Distribution and the Trip Length Distribution of the estimated O/D matrix by the traffic counted models. When the surveyed TLFD is similar to the estimated TLFD, the reliability and correctness of the estimated O/D are high. Therefore, the objective of this paper is the development of the travel demand (O/D matrix) estimation using traffic counts on the large-scaled network. The Gradient Method is used for the model and the multi-class assignment technique is used for the equilibrium loading procedure in the model. This leads to the good guideline to the usage of the traffic count based O/D estimation in practice and gives a confidence to the transport planner. It is because the traffic counted O/D estimation models gives multiple solutions by its characteristics. In this paper we analyze the merits and demerits in each of a single-class based model and a multi-class based model in a large scale network. As a result, we have concluded that the multi-class based model has a closer value to the surveyed (true) TLFD than the TLFD of the estimated O/D matrix by the single-class based gradient method. [ABSTRACT FROM AUTHOR]

This paper proposes an educational information system based on u-learning that supports two phase feature extract. A key frame selected by user in annotation-based retrieval takes query image of feature-based retrieval and by agent searches and displays the most similar key frame image after comparing query image with key frames in the DB through full image and center image, binary image histogram techniques which we proposed. Therefore, user can get more correct retrieval result by agent's learning through repeated retrievals about video data for the environment education of infants. From experiment, the designed and implemented system shows increase of recall rate of about 1.5% and 2.0% as precision rate 94.2% for video data scene retrieval in performance assessment. [ABSTRACT FROM AUTHOR]

This paper presents an adaptive synchronization scheme for compensating for the variable transmission delay and synchronizing media data through the use of terminal buffering in mobile multimedia network. The proposed scheme can meet the requirement for synchronization of media data by adjusting synchronization intervals using the maximum time delay jitter and by flexibly handling the variable queue time according to variations in delay time, and reduce media data loss time due to increase in traffic as well as data loss due to variations in delay time by using delay jitters in adjusting synchronization intervals. [ABSTRACT FROM AUTHOR]

With a tremendous increase of Internet users, the Internet computing environments are getting more complicated along with the network management structure in order to support diverse traffic characteristics. A successful end-to-end realization of Grid services presumes well-defined QoS measuring framework in the service provider's and customer's networks. Most traditional network performance management systems utilize a passive measuring method based on SNMP, allowing an administrator to understand only network conditions. However, it is difficult for network managing systems that are based on a passive measuring method to accurately understand the situations surrounding time-varying networks. Our objective in this paper is to describes a Grid monitoring architecture based practical measuring framework for network performance measurement. It includes concepts as well as step-by-step procedures of an active measuring method for measuring performance of any section at any time. [ABSTRACT FROM AUTHOR]

This paper develop the complexity reduction schemes of real root method that is mainly used in the CELP (Code Excited Linear Prediction) vocoder. The real root method is that if polynomial equations have the real roots, it is able to find those and transform them into LSP (Line Spectrum Pairs). Proposed algorithm is developed by using Mel scale and is to reduce the LSP complexity That is, the searching interval is arranged by using Mel scale but not it is uniform. In experimental results, complexity of the developed algorithm is reduced about 46% in average, but the transformed LSP parameters of the proposed method were the same as those of real root method. Hence, in case of applying proposed algorithm in G.723.1 (6.3kbps MP-MLQ), the speech quality is no distortion compared to original speech quality. [ABSTRACT FROM AUTHOR]

IEEE 802.16e standard specifies sleep mode to achieve low power consumption of a mobile station (MS). Since sleep mode is defined only for the current serving base station (BS), a sleeping MS in motion performs handover even if it has no active connection. Accordingly, the power saving efficiency of sleep mode may be severely degraded in a mobile environment. In order to cover the problem, the IEEE 802.16e standard specifies a method that optimizes the sleep mode initiation process specific to handover. With the optimization, a MS that has been in sleep mode and currently performs handover is able to resume sleep mode as soon as it completes the handover process with no additional request. This paper justifies the use of the optimization by showing the simulation results that evaluate the performance gain obtained from the optimization. [ABSTRACT FROM AUTHOR]

In this paper, we propose local authentication scheme to locally authorize intra-domain mobile nodes (MNs) for efficient authentication in Mobile IPv6 networks, which are based on authentication, authorization, accounting (AAA) architecture. Frequent authentication requests in standard AAA mechanism impose a great burden to deliver the authentication messages between a MN and its AAA server. To solve this problem, we propose this scheme to establish local security associations (SAs) for authentication, so the proposed scheme reduces delay and the risk during MNs roam around a local domain. The performance evaluation results show that the proposed scheme reduces the latency up to 60.7% while maintaining the similar level of security to the previous researches. [ABSTRACT FROM AUTHOR]

In this paper, we propose a building detection algorithm for video based navigation system which overlays driving directions on the captured video from in-vehicle camera. We used edge segments of small size blocks within an image frame to remove background objects, trees, etc. Search range determination and edge tracing technique were also developed to determine the building area as the final step. The experiments show 88.9 % detection rate on the average and 95.9% for navigation video without trees and signs. The proposed algorithm can be also applied to point-of-interest (POI) detection for location based services (LBS) in ubiquitous computing environment. [ABSTRACT FROM AUTHOR]

In this paper, we propose an asymmetric link dynamic routing algorithm for ubiquitous multimedia services named DRAMA (Dynamic Routing Algorithm for asymmetric link in Mobile Ad hoc networks). The proposed algorithm allows a first sink node of the unidirectional link to detect the unidirectional link and its reverse route and provide information regarding the reverse route to other sink nodes, thereby minimizing unnecessary flows and effectively using the unidirectional link. DRAMA also incooperates redirection process that actively supports a unidirectional link generated during data transmission to deal with a topology change due to the movement of node. Further, we shows the superiority of DRAMA to the existing algorithms in terms of a delay in data transmission, throughput, and transmission overhead through simulation study. [ABSTRACT FROM AUTHOR]

The roles of application program sharing are divided into two main parts; abstraction and sharing of view generation. Application program sharing must take different from each other according to number of replicated application program and an event command. There are two different structures. Those include CACV (Centralized-Abstraction and Centralized-View) and RARV (Replicated-Abstraction and Replicated-View).In this paper, we discuss a hybrid software architecture CARV(Centralized-Abstraction and Replicated-View) which is running on ubiquitous networks for collaborative multimedia distance education services and adopting the advantage of CACV and RARV. [ABSTRACT FROM AUTHOR]

With the rapid development of wireless multimedia communication and Peer-to-Peer overlay network, it is envisioned that building a content and location addressable overlay network for wireless multimedia communication is promising. In this paper, based on a special structure, Geographically Hierarchical Index (GHI), we propose an efficient algorithm, Content and Location Addressable overlay Network (CLAN) algorithm, which makes p2p multimedia communication over MANETs applicable and efficient, satisfying three goals: efficiency, scalability and adaptability to node movement. [ABSTRACT FROM AUTHOR]

Digital fingerprinting is a technology for enforcing digital rights policies where by unique labels, known as digital fingerprints, are inserted into content prior to distribution. As we use it, we can trace illegal users. These fingerprints are typically embedded into the content using watermarking techniques that are designed to be robust to a variety of attacks. Also, it must secure against collusion attack that some colluders remove and alter their fingerprints. In this paper, we propose easily fingerprint generation technique by using trace of primitive polynomial. The proposed scheme can generate codes more easily and have more buyers than existing schemes. Our scheme is secure against collusion attack with two colluders. And we proposed a new watermarking algorithm that embeds and extracts securely by using MPSK(M-ary Phase Shift Keying) technology. The proposed watermarking algorithm has semi-robustness. Therefore it is effective in conspirator detection. [ABSTRACT FROM AUTHOR]

In hierarchical mobile IPv6 networks, when an inter-domain handover occurs, mobile nodes suffer from excessive signaling traffic and long handover latency. Further, the selection of MAP and its load status critically affect the overall system performance. Therefore, we propose a dynamic MAP selection scheme that seeks to distribute load among MAPs as well as reduces inter-domain handovers. Performance is evaluated from not only an analytic model of average signaling cost but also a simulation. The analytical and simulation results show that our proposed scheme improves load distributedness and reduces inter-domain handovers and signaling cost compared to another existing approach. [ABSTRACT FROM AUTHOR]

In Wireless mobile ad hoc networks, many unicast and multicast protocols depend on broadcast mechanism to finish control and route establishment functionality. In a straightforward broadcast by flooding, each node will retransmit a message to all it neighbors until the message has been propagated to the entire network. So it will become very inefficient and will be easy to result the broadcast storm problem. Thus an efficient broadcast algorithm should be used to less the broadcast storm caused by broadcast. Due to the dynamic nature of ad hoc networks, global information of the network is difficult to obtain, so the algorithm should be distributed. In this paper, a distributed heuristic-based algorithm is presented. The algorithm is based on joint distance-counter threshold scheme. It runs in a distributed manner by each node in the network without needing any global information. Each node in an ad hoc network hears the message from its neighbors and decides whether to retransmit or not according to the signal strength and the number of the receiving messages. By using the JDCT algorithm, it's easy to find the nodes that consist of the vertices of the hexagonal lattice to cover the whole networks. The algorithm is very simple and it is easy to operate and has a good performance in mobile wireless communication environments. A comparison among several existing algorithms is conducted. Simulation results show that the new algorithm is efficient and robust. [ABSTRACT FROM AUTHOR]

Media environment has been rapidly changed these days. Internet provides multimedia environment and has become a part of our everyday life as a new advertisement media. Authentication methods typically involve an authentication server in the home network from the authentication server of the external network, and then the external network is notified with the authentication result in the home authentication server. This paper discusses and proposes a key distribution protocol that ca be used when the user moves the external network and to ensure secure communication with the external authentication server. As the proposed technology does not receive the reissue of authentication from the home authentication server in case moving between the external authentications servers, authentication server overload can be reduced and the home network can be made to issue the key using the registered password. [ABSTRACT FROM AUTHOR]

The appreciation of various mobile multimedia services causes a paradigm shift in the Internet. Since the introduction of the route optimization in the Mobile IPv6, various approaches are proposed to solve the problem such as the handover latency and the excessive signaling message exchanges and enhance security. In spite of this improvement they are not enough for the low-battery mobile devices to service the audio and video streaming seamlessly because of the handover time and the computation of the mobile node. We propose an advanced agent-delegated route optimization protocol for seamless multimedia services at low-battery mobile devices. [ABSTRACT FROM AUTHOR]

In this paper, an interface using eye and mouse for the handicapped people is proposed. The eye regions are localized using neural network (NN)-based texture classifier that discriminates the facial region into eye class and non-eye class, and then are tracked using mean-shift procedure. The mouse region is detected based on edge information and then tracked using template matching. To assess the validity of the proposed system, it was applied to the interface system and was tested on a group of 25 users. The results show that our system has the accuracy of 99%. [ABSTRACT FROM AUTHOR]

In this paper, we shall propose an image-hiding scheme to embed color secret images into their compression codes. The color host image is compressed by using the CSMVQ algorithm. Meanwhile, the color secret image is embedded during the production of the compression code. To get this job done, we must have the power to partition the state palette to sub-state palettes quickly and temporarily. In our new method, we sort the different colors in the palette to gather similar colors. In addition, there is a modulo operator we use to partition the state palette dynamically. This way, the secret data can be embedded into the compression code after the state palette is partitioned. According to our experimental results, the image quality of both the color host image with the secret data embedded in and the reconstructed color secret image is good when our proposed method is used. [ABSTRACT FROM AUTHOR]

Recently, various non-photorealistic rendering (NPR) techniques have been developed for computers to generate images of different artistic styles automatically. Due to the complexity of the algorithms, however, most NPR methods are limited to the processing of still images. It is the objective of this paper to extend and improve existing NPR techniques to enable near real-time processing of video. The enhancement will be achieved by compressed domain processing. By exploiting the relationship among I, P, and B frames, different strategies can be developed to increase the efficiency of the NPR algorithm. Experimental results have demonstrated the efficacy of the proposed methods and validated the near real-time creation of NPR video effects. [ABSTRACT FROM AUTHOR]

Recently, Thien and Lin proposed a user-friendly (k, n)-threshold scheme which employs Lagrange interpolation to produce shadow images representing a shrunken version of the original image. In this paper, we introduce a new framework which uses more (k - 1)-degree polynomials with different primes to enhance the functionality of the user-friendly (k, n)- threshold framework and obtain more effective performance for large k. Since the proposed framework significantly reduces reconstruction errors compared to the previously published user-friendly schemes, it is suitable for modern visual communication applications where features, such as distributed trust, secure transmission and storage, fault tolerance, and high-quality image reconstruction are required. [ABSTRACT FROM AUTHOR]

Image collections may contain multiple copies, versions, and fragments of the same image. Storage or retrieval of such duplicates and near-duplicates may be unnecessary and, in the context of collections derived from the web, their presence may represent infringements of copyright. However, identifying image versions is a challenging problem, as they can be subject to a wide range of digital alterations, and is potentially costly as the number of image pairs to be considered is quadratic in collection size. In this paper, we propose a method for finding the pairs of near-duplicates based on manipulation of an image index. Our approach is an adaptation of a robust object recognition technique and a near-duplicate document detection algorithm to this application domain. We show that this method requires only moderate computing resources, and is highly effective at identifying pairs of near-duplicates. [ABSTRACT FROM AUTHOR]

A novel method for automatic occluded targets recognition in SAR images is proposed in this paper. Different SAR occluded targets are simulated based on actual vehicles from the MSTAR database, and are recognized using SVM classifier by grouping recognition based on the targets azimuth angles. It is shown that the proposed method outperforms the typical methods in accuracy at high occlusion, and robustness to occlusion with experiments considering accuracy and confusion matrix. [ABSTRACT FROM AUTHOR]

Feature extraction is one of the most important problems in face recognition task. In this paper, we use kernel uncorrelated discriminant analysis to extract the optimal discriminant features for face recognition. The method also solves the so-called "Small Sample Size" (SSS) problem, which exists in most Face Recognition tasks. Experimental results on the Yale face database and AT&T face database show the effectiveness of this method. [ABSTRACT FROM AUTHOR]

This paper presents a novel approach to implement estimation and recognition of human motion from uncalibrated monocular video sequences. As it is difficult to find a good motion description for humans, we propose a matching scheme based on a local descriptor and a global descriptor, to detect individual body parts and analyze the shape of the whole body as well. In a frame-by-frame process, both descriptors are combined to implement the matching of the motion pattern and the body orientation. Moreover, we have added a novel spatial-temporal cost factor in the matching scheme which aims at increasing the temporal consistency and reliability of the description. We tested the algorithms on the CMU MoBo database with promising results. The method achieves the motion-type recognition and body-orientation classification at the accuracy of 95% and 98%, respectively. The system can be utilized for an effective human-motion analysis from a monocular video. [ABSTRACT FROM AUTHOR]

This paper deals with the problem of estimating the effort required to maintain a static pose by human beings. The problem is important in developing dance summarization and rehabilitation applications. We estimate the human pose effort using two kinds of body constraints - skeletal constraints and gravitational constraints. The extracted features are combined together using SVM regression to estimate the pose effort. We tested our algorithm on 55 dance poses with different annotated efforts with excellent results. Our user studies additionally validate our approach. [ABSTRACT FROM AUTHOR]

The convergence of response functions of memoryless window-based congestion control protocols is analyzed in this paper. All the control schemes (or response functions) is classified into 4 types according to the monotony of their response functions. Sufficient conditions are established for the convergence of Type 1 scheme, which includes most of the existing protocols such as additive-increase multiplicative-decrease (AIMD), generalized AIMD, binomial congestion control (BCC), Choose Your Response Function (CYRF) and so on. Type 4 scheme is not convergent while Type 2 and Type 3 schemes are conditional convergent, and their convergent conditions are derived. Furthermore, the proposed scheme can be made TCP-friendly and TCP-compatible. The proposed scheme can also be used to design multimedia friendly congestion control protocols. Thus the proposed result is very useful for extending the network service to different applications. [ABSTRACT FROM AUTHOR]

Standard image and video techniques designed to provide the bitstream with some level of protection against channel errors usually add a controlled amount of redundancy. This redundancy may take the form of resynchronization makers which enable the decoder to restart the decoding process from a known state in the event of transmission errors. The Error Resilient Entropy Code(EREC) is a well known algorithm designed to reduce the added redundant information. Wavelet tree coding provides the most efficient of image compression currently available with respect to rate-distortion. This paper presents a performance enhancement of EREC on the bitstream of SPIHT, which greatly improves its ability to maintain the compressed image quality in the event of random errors. This paper demonstrates that Efficient and Robust EREC(EREREC) improves the image quality of SPIHT in the presence of channel errors. The simulation result shows that the quality of transmitted image is improved when compared to the existing EREC on SPIHT. [ABSTRACT FROM AUTHOR]

Pattern-based video coding representing moving regions in macroblock has very good potential for improved coding efficiency over existing standard H.264/AVC in the very low bit-rate range. However, the coding efficiency diminishes compared to H.264 with the bit rates because variable block sizes of H.264 for motion estimation and compensation are successfully selected for any bit rates using weighting between bit rate and image quality. The existing pattern-based video coding scheme could not handle this flexibility with bit rates due to its fixed size and lack of verification with other modes of H.264. In this paper we propose two large and one small pre-defined pattern sets and treat them as extra modes of H.264. We also investigate the weighting factor between bit rate and image quality compared to the existing one. The experimental results confirm the superiority of our approach compared to H.264 and other existing pattern-based video coding for not only the very low bit rate range but also wide range of bit rates. [ABSTRACT FROM AUTHOR]

In this paper, we mainly investigate how to improve the streaming quality of service over Peer-to-Peer (P2P) networks with the benefit of practical service traces. Considering that the QoS of P2P live streaming is generally affected by high dynamics in peer community, we abstract the online duration model of end users and then exploit this characteristic to improve the stability and encourage contribution in P2P networks, which in turn facilitates the quality of streaming. The first effort involves the online information when constructing video delivery tree and hence achieves less playback disruption. The other algorithm takes the online duration into account when selecting neighbor peers for data exchange and advocates more mutual cooperation between peers. The experiment results show that the proposed schemes could respectively achieve higher stability and better delivery quality. [ABSTRACT FROM AUTHOR]