Capturing contextual relationship for effective media search

One of the central problems regarding media search is the semantic gap between the low-level features computed automatically from media data and the human interpretation of them. This is because the notion of similarity is usually based on high-level abstraction but the low-level features do not sometimes reflect the human perception. In this paper, we assume the semantics of media is determined by the contextual relationship in a dataset, and introduce the method to capture the contextual information from a large media (especially image) dataset for effective search. Similarity search in an image database based on this contextual information shows encouraging experimental results.     

An intrinsic semantic framework for recognizing image objects

The paper proposes a new approach to find semantic meanings in visual object class structure, in line with the Gestalt laws of proximity. Micro level semantic structures are formed by line segments (arcs also approximated into line segments based on pixel deviation threshold) which are in close proximity. These structures are hierarchically combined till a semantic label can be assigned. The algorithm extracts semantic groups, their inter-relations and represents these using a graph. Invariant geometrical properties of the groups and relations are used as vertex and edge labels. A graph model captures the inter class variability by analyzing the repetitiveness of structures and relations and uses it as a weighting factor for classification. The algorithm has been tested on a standard benchmark database and compared with existing approaches.     

PhotoGeo: a photo digital library with spatial-temporal support and self-annotation

The recent popularity of digital cameras has posed a new problem: how to efficiently store and retrieve the very large number of digital photos captured and chaotically stored in multiple locations without any annotation. This paper proposes an infrastructure, called PhotoGeo, which aims at helping users with the people photo annotation, event photo annotation, storage and retrieval of personal digital photos. To achieve the desired objective, PhotoGeo uses new algorithms that make it possible to annotate photos with the key metadata to facilitate their retrieval, such as: the people who were shown in the photo (who); where it was captured (where); the date and time of capture (when); and the event that was captured. The paper concludes with a detailed evaluation of these algorithms.     

Mining diversity on social media networks

The fast development of multimedia technology and increasing availability of network bandwidth has given rise to an abundance of network data as a result of all the ever-booming social media and social websites in recent years, e.g., Flickr, Youtube, MySpace, Facebook, etc. Social network analysis has therefore become a critical problem attracting enthusiasm from both academia and industry. However, an important measure that captures a participant’s diversity in the network has been largely neglected in previous studies. Namely, diversity characterizes how diverse a given node connects with its peers. In this paper, we give a comprehensive study of this concept. We first lay out two criteria that capture the semantic meaning of diversity, and then propose a compliant definition which is simple enough to embed the idea. Based on the approach, we can measure not only a user’s sociality and interest diversity but also a social media’s user diversity. An efficient top-k diversity ranking algorithm is developed for computation on dynamic networks. Experiments on both synthetic and real social media datasets give interesting results, where individual nodes identified with high diversities are intuitive.     

Performance of TZCD-MBOK watermarking scheme in T-DMB systems

Recently, watermarking based data transmission techniques using terrestrial digital TV signal have been proposed since they are also cost-free and can overcome the limitations of GPS. However, in the previous watermarking based methods, the detection accuracy is low and additional data rate is too low. Thus, we propose the throughput enhancement method by employing the TZCD-MBOK watermarking technique in T-DMB system. By applying the proposed scheme to T-DMB, it allows additional data transmission for disaster broadcasting and improves efficiency of data transmission in shadow region and indoor to mobile environment through watermarking spread code. From the simulation results, we confirm the proposed watermarking scheme affected on the existing T-DMB signal. Moreover, it was also confirmed that the system capacity increases as the power of additional watermarking signal rose. The results of the paper can be applied to wireless multimedia digital broadcasting systems.     

Intelligent copyright protection system using a matching video retrieval algorithm

Many video service sites headed by YouTube know what content requires copyright protection. However, they lack a copyright protection system that automatically distinguishes whether uploaded videos contain legal or illegal content. Existing protection techniques use content-based retrieval methods that compare the features of video. However, if the video encoding has changed in resolution, bit-rate or codec, these techniques do not perform well. Thus, this paper proposes a novel video matching algorithm even if the type of encoding has changed. We also suggest an intelligent copyright protection system using the proposed algorithm. This can serve to automatically prevent the uploading of illegal content. The proposed method has represented the accuracy of 97% with searching algorithm in video-matching experiments and 98.62% with automation algorithm in copyright-protection experiments. Therefore, this system could form a core technology that identifies illegal content and automatically excludes access to illegal content by many video service sites.     

A novel dynamic pricing scheme for contributing peers in the VoD system

In this paper we have proposed a dynamic pricing scheme for the contributing peers in the Video on Demand (VoD) system. The scheme provides an effective mechanism to maximize the profit through the residual resources of the contributing peers. A utilization function is executed for each contributing peer to estimate the utility factor based on the parameters such as initial setup cost, holding cost, chaining cost and salvage cost. In this paper, we urge an effective dynamic pricing algorithm that efficiently utilizes a range of parameters with a varying degree of complexity. The key findings of the algorithm are (i) each contributing peers are benefitted by the monetary based on its resource contributions to the VoD system and (ii) a high degree of social optimum is established by proficiently aggregating the contributing peer’s resources with the overall resources of the VoD system. We validate our claim by simulating the proposed dynamic pricing scheme with other standard pricing schemes such as altruism, cost model and game theory perspective. The result of our dynamic pricing scheme shows the best utility factor than other standard pricing schemes.     

Rate-smoothed schedule with tolerable data dropping for video coding stream

Most algorithms of smoothing schedule compute the required bit rate of video transmission to satisfy all the transmitted data. In this paper, our proposed tolerable data dropping algorithm can adjust transmitting data to fit available bit rate. MPEG-4 with fine grained scalability (FGS) can support partial data dropping to adapt to available bandwidth network. The algorithm is based on the minimum variance bandwidth allocation (MVBA) algorithm proposed by Salehi et al. to compute the bit rate such that still ensuring that the buffer never underflows and overflows for MPEG-4 FGS streams under the limited bandwidth resource. We prove that our proposed algorithm, named MVBADP, is smoother than the MVBA algorithm. The experimental results show the peak rate, the number of rate changes, and the ratio of total dropping data, and the PSNR for four test sequences with different content characteristics. They are varied by buffer sizes and tolerable dropping ratios. We found that the MVBADP algorithm can reduce the peak rate and the number of changes when the transmitted data are dropped by tolerable dropping ratio, especially on the video sequences with the high motion and complex texture characteristic and larger size change of the consecutive frame.