Multimedia, Security and Privacy Research Group
- led by Prof. Pradeep K. Atrey
"Multimedia systems and applications such as surveillance, social media and networks, and cloud computing have conflicting goals. How do you balance increasing system capabilities and preserve privacy of users? We seek to achieve this balance by building models and algorithms in the area of multimedia analysis."
"The solution of a problem lies in understanding it."
Current Research Projects [Past Research Projects]
These days resource intensive tasks such as storage and processing of huge amount of data (in applications like video surveillance, social networks and e-health) are being delegated to Cloud Data Centers (CDCs). However, since CDCs are generally third party entities, there is always a risk of data security and privacy. We propose to encrypt the data before sending to the cloud. To overcome the problem of processing the encrypted data over cloud, we employ cryptographic secret sharing technique which possesses homomorphism property and allows encrypted domain processing of data over cloud. We are examining the suitability of the proposed framework for encrypted domain processing to surveillance videos quality improvement for forensics investigation and to 3D medical images for remote visualization via cloud. We believe that this framework can be used in many other applications which require processing/storing the data over cloud in a secure and private manner. For more details, please see:
Image enhancement in encrypted domain over cloud (Collaborators: Ankita Lathey and Nishant Joshi)
Cloud-based multimedia systems are becoming increasingly common. These systems offer not only storage facility, but also high-end computing infrastructure which can be used to process data for various analysis tasks ranging from low-level data quality enhancement to high-level activity and behavior identification operations. However, cloud data centers, being third party servers, are often prone to information leakage, raising security and privacy concerns. In this research, we present a Shamir's secret sharing based method to enhance the quality of encrypted image data over cloud. Using the proposed method we show that several image enhancement operations such as noise removal, anti-aliasing, edge and contrast enhancement, and dehazing can be performed in encrypted domain with near-zero loss in accuracy and minimal computation and data overhead. Moreover, the proposed method is proven to be information theoretically secure. Further details and demos can be found here.
Supporting scaling and cropping on large encrypted images over cloud, (Collaborators: Manoranjan Mohanty and Wei-Tsang Ooi)
A secure and privacy-aware cloud-based architecture for online social networks (Collaborator: Kasun Senevirathna).
Using social networks??? Your privacy could be at stake... Here is the solution....
The use of social networks has grown exponentially in recent years, and these social networks continue to have an ever-increasing impact on human lives. There are many concerns regarding the privacy of users in these environments, such as how trustworthy the social network operators are, in addition to the external adversaries. We propose a new architecture for online social networking, based on distributed cloud-based datacenters and using Shamir's secret sharing as the method of encrypting user profile data, for enhanced privacy and availability.
This research focuses on using social network analysis and content textual features to detect the cyber bullying cases.
First, based on related literature from social science and psychology, we built three hypotheses for the differences between cyber bullying and non-bullying cases.
Then, by adding 1.5 ego-network graphs from two users in a conversation, we can build and learn the relationship graph of these two users.
After gathering the social network data, such as relationship tie, number of friends, and social network centrality, we find that multiple social characteristics are statistically different between the cyber bullying and non-bullying groups, thus supporting the results found in previous psychological studies.
Finally, the cyber bullying detection models have been significant improved by adding social network features compared with only using textual features.
Scalable secret sharing of compressed multimedia (Collaborators: Shreelatha Bhadravati and Majid Khabbazian).
The higher the number of share (hidden image/video) holders, the higher the chances of the secret image/video being seen...
Collective control over secrecy of sensitive video evidences(Collaborators: Saeed Alharthi, Abed El Saddik and Md. Anwar Hossain).
Today digital video is used extensively in many applications. Sometimes a video could be treated as a top secret for an organization, for example military secrets,
surveillance footage and corporate product designs, and may need to be shared among a group of people in a secure manner. Traditional data security methods such as
encryption techniques are prone to single-point attack, i.e. the secret can be revealed by obtaining the decryption key from any single person. Alternatively, the secret
sharing scheme provides collective control over the secrecy of information and is considered information theoretically secure. In this research, we propose to adopt a
secret sharing based approach to provide collective control over a given sensitive video. We present three methods that utilize the spatial and temporal redundancy in
videos in different ways. We analyze the security of these methods and compare them for efficiency in terms of computation time and space using extensive experimentation.
Novel methods for digital image watermarking (Collaborators: Gaurav Bhatnagar, Jonathan Wu, Himanshu Agarwal and Balasubramanian Raman).
Past Research Projects [Current Research Projects]
Multimedia Surveillance and Monitoring
Be alert, somebody is running and shouting in the corridor..., hmmm... How to assimilate the information from
multiple heterogeneous sensors in order to detect such events?
Where to place the sensors for effective surveillance...?
Who has left this item in the hallway...? This might be dangerous... How can sensors actively compete and cooperate with each other to detect the abandoned object, identify the person and his/her movement?
Be careful... a sleepwalker is walking out of the house during sleep... system should alert the caretaker.
Multimedia Data Mining
A reward and punishment based approach for concept detection using adaptive ontology rules
Concept based near duplicate video clip detection for novelty re-ranking of web video search results
Can you believe...? This is
'Pradeep' addressing United States from Washington DC... OR Is it media
Trust and Reputation Issues in Web Technology
This research advocates for the web sites to have trust levels for various domains. It would allow the web users to see web information along with its trust level. Determining the trust level of the web information will also significantly help in performing trust-based search. We aim to design and develop algorithms to dynamically compute the trust level of a web site for a particular domain based on the past history of semantic agreement/disagreement between this web site and a trusted web site in that domain. (Collaborators: Abed El Saddik, Sheela Ramanna, Hicham Ibrahim and Md. Anwar Hossain).
Web services are usually selected and composed based on their reputation. In general, the reputation of a web service is computed using the feedback provided by the user. However, the users' feedback bears many problems including a low incentive for providing ratings and a bias towards positive or negative ratings. In this research, we proposed a method that overcomes the dependency on users' feedback for computing the reputation of web services. The proposed method dynamically computes the reputation of a web service based on its association with the other web services. The association coefficient between any two web services is computed by utilizing the statistics of how often they have been composed together. This factor is considered in our method to show the evolution of reputation over a period of time. The experimental results demonstrate the utility of the proposed method. (Collaborators: Abed El Saddik and Md. Anwar Hossain).
Last updated: September 1, 2014.