SlideShare a Scribd company logo
Click Prediction for Web Image Reranking Using Multimodal Sparse Coding 
Click Prediction for Web Image Reranking Using Multimodal Sparse Coding 
ABSTRACT: 
Image reranking is effective for improving the performance of a text based image search. 
However, existing reranking algorithms are limited for two main reasons: 1) the textual meta-data 
associated with images is often mismatched with their actual visual content and 2) the 
extracted visual features do not accurately describe the semantic similarities between images. 
Recently, user click information has been used in image reranking, because clicks have been 
shown to more accurately describe the relevance of retrieved images to search queries. However, 
a critical problem for click-based methods is the lack of click data, since only a small number of 
web images have actually been clicked on by users. Therefore, we aim to solve this problem by 
predicting image clicks. We propose a multimodal hyper graph learning-based sparse coding 
method for image click prediction, and apply the obtained click data to the reranking of images. 
We adopt a hyper graph to build a group of manifolds, which explore the complementarily of 
different features through a group of weights. Unlike a graph that has an edge between two 
vertices, a hyper edge in a hyper graph connects a set of vertices, and helps preserve the local 
smoothness of the constructed sparse codes. An alternating optimization procedure is then 
performed, and the weights of different modalities and the sparse codes are simultaneously 
obtained. Finally, a voting strategy is used to describe the predicted click as a binary event (click 
or no click), from the images’ corresponding sparse codes. Thorough empirical studies on a 
large-scale database including nearly 330K images demonstrate the effectiveness of our 
approach for click prediction when compared with several other methods. Additional image re-ranking 
experiments on real world data show the use of click prediction is beneficial to 
improving the performance of prominent graph-based image re-ranking algorithms. 
EXISTING SYSTEM: 
Most existing re-ranking methods use a tool known as pseudo-relevance feedback (PRF), where 
a proportion of the top-ranked images are assumed to be relevant, and subsequently used to build 
a model for re-ranking. This is in contrast to relevance feedback, where users explicitly provide 
feedback by labeling the top results as positive or negative. In the classification-based PRF 
method, the top-ranked images are regarded as pseudopositive, and low-ranked images regarded 
Contact: 9703109334, 9533694296 
Email id: academicliveprojects@gmail.com, www.logicsystems.org.in
Click Prediction for Web Image Reranking Using Multimodal Sparse Coding 
as pseudo-negative examples to train a classifier, and then re-rank. Hsu et al. also adopt this 
pseudo-positive and pseudo-negative image method to develop a clustering-based re-ranking 
algorithm. 
DISADVANTAGES OF EXISTING SYSTEM: 
· One major problem impacting performance is the mismatches between the actual content 
of image and the textual data on the web page. 
· The problem with these methods is the reliability of the obtained pseudo-positive and 
pseudo-negative images is not guaranteed. 
PROPOSED SYSTEM: 
In this paper we propose a novel method named multimodal hyper graph learning-based sparse 
coding for click prediction, and apply the predicted clicks to re-rank web images. Both 
strategies of early and late fusion of multiple features are used in this method through three 
main steps. 
· We construct a web image base with associated click annotation, collected from a 
commercial search engine. The search engine has recorded clicks for each image. 
Indicate that the images with high clicks are strongly relevant to the queries, while 
present non-relevant images with zero clicks. These two components form the image 
bases. 
· We consider both early and late fusion in the proposed objective function. The early 
fusion is realized by directly concatenating multiple visual features, and is applied in the 
sparse coding term. Late fusion is accomplished in the manifold learning term. For web 
images without clicks, we implement hyper graph learning to construct a group of 
manifolds, which preserves local smoothness using hyper edges. Unlike a graph that has 
an edge between two vertices, a set of vertices are connected by the hyper edge in a hyper 
graph. Common graph-based learning methods usually only consider the pair wise 
relationship between two vertices, ignoring the higher-order relationship among three or 
Contact: 9703109334, 9533694296 
Email id: academicliveprojects@gmail.com, www.logicsystems.org.in
Click Prediction for Web Image Reranking Using Multimodal Sparse Coding 
more vertices. Using this term can help the proposed method preserve the local 
smoothness of the constructed sparse codes. 
· Finally, an alternating optimization procedure is conducted to explore the complementary 
nature of different modalities. The weights of different modalities and the sparse codes 
are simultaneously obtained using this optimization strategy. A voting strategy is then 
adopted to predict if an input image will be clicked or not, based on its sparse code. 
ADVANTAGES OF PROPOSED SYSTEM: 
· We effectively utilize search engine derived images annotated with clicks, and 
successfully predict the clicks for new input images without clicks. Based on the obtained 
clicks, we re-rank the images, a strategy which could be beneficial for improving 
commercial image searching. 
· Second, we propose a novel method named multimodal hyper graph learning-based 
sparse coding. This method uses both early and late fusion in multimodal learning. By 
simultaneously learning the sparse codes and the weights of different hyper graphs, the 
performance of sparse coding performs significantly. 
SYSTEM ARCHITECTURE: 
Contact: 9703109334, 9533694296 
Email id: academicliveprojects@gmail.com, www.logicsystems.org.in
Click Prediction for Web Image Reranking Using Multimodal Sparse Coding 
SYSTEM REQUIREMENTS: 
HARDWARE REQUIREMENTS: 
 System : Pentium IV 2.4 GHz. 
 Hard Disk : 40 GB. 
 Floppy Drive : 1.44 Mb. 
 Monitor : 15 VGA Colour. 
 Mouse : Logitech. 
 Ram : 512 Mb. 
SOFTWARE REQUIREMENTS: 
 Operating system : Windows XP/7. 
 Coding Language : ASP.net, C#.net 
 Tool : Visual Studio 2010 
 Database : SQL SERVER 2008 
REFERENCE: 
Jun Yu, Member, IEEE, Yong Rui, Fellow, IEEE, and Dacheng Tao, Senior Member, IEEE 
“Click Prediction for Web Image Reranking Using Multimodal Sparse Coding” IEEE 
TRANSACTIONS ON IMAGE PROCESSING, VOL. 23, NO. 5, MAY 2014 
Contact: 9703109334, 9533694296 
Email id: academicliveprojects@gmail.com, www.logicsystems.org.in

More Related Content

DOCX
IEEE 2014 DOTNET IMAGE PROCESSING PROJECTS Click prediction-for-web-image-rer...
DOCX
IEEE 2014 JAVA IMAGE PROCESSING PROJECTS Click prediction-for-web-image-reran...
PDF
An attribute
PDF
A NOVEL WEB IMAGE RE-RANKING APPROACH BASED ON QUERY SPECIFIC SEMANTIC SIGNAT...
PPTX
HABIB FIGA GUYE {BULE HORA UNIVERSITY}(habibifiga@gmail.com
DOCX
A probabilistic approach for color correction
DOCX
JPD1437 Click Prediction for Web Image Reranking Using Multimodal Sparse Coding
IEEE 2014 DOTNET IMAGE PROCESSING PROJECTS Click prediction-for-web-image-rer...
IEEE 2014 JAVA IMAGE PROCESSING PROJECTS Click prediction-for-web-image-reran...
An attribute
A NOVEL WEB IMAGE RE-RANKING APPROACH BASED ON QUERY SPECIFIC SEMANTIC SIGNAT...
HABIB FIGA GUYE {BULE HORA UNIVERSITY}(habibifiga@gmail.com
A probabilistic approach for color correction
JPD1437 Click Prediction for Web Image Reranking Using Multimodal Sparse Coding

Similar to click prediction for web image reranking using multimodal sparse coding (20)

DOCX
2014 IEEE DOTNET IMAGE PROCESSING PROJECT Click prediction-for-web-image-rera...
DOCX
2014 IEEE JAVA IMAGE PROCESSING PROJECT Click prediction-for-web-image-rerank...
DOCX
2014 IEEE JAVA IMAGE PROCESSING PROJECT Click prediction for web image rerank...
DOCX
2014 IEEE JAVA IMAGE PROCESSING PROJECT Click prediction-for-web-image-rerank...
DOCX
An attribute assisted reranking model
DOCX
Learning to rank using user clicks and visual features for image retrieval
PDF
M phil-computer-science-pattern-recognition-projects
DOC
An attribute assisted reranking
PDF
Ko3419161921
PDF
Comparison of Various Web Image Re - Ranking Techniques
PDF
Ijcet 06 06_006
PDF
Sketch Based Image Retrieval Using BMMA and SEMI-BMMA
PDF
Ijcet 06 10_004
PDF
International Journal of Engineering Research and Development (IJERD)
PDF
Image based Search Engine for Online Shopping
PDF
Adaptive Search Based On User Tags in Social Networking
PDF
11. Efficient Image Based Searching for Improving User Search Image Goals
PDF
A Review on Matching For Sketch Technique
2014 IEEE DOTNET IMAGE PROCESSING PROJECT Click prediction-for-web-image-rera...
2014 IEEE JAVA IMAGE PROCESSING PROJECT Click prediction-for-web-image-rerank...
2014 IEEE JAVA IMAGE PROCESSING PROJECT Click prediction for web image rerank...
2014 IEEE JAVA IMAGE PROCESSING PROJECT Click prediction-for-web-image-rerank...
An attribute assisted reranking model
Learning to rank using user clicks and visual features for image retrieval
M phil-computer-science-pattern-recognition-projects
An attribute assisted reranking
Ko3419161921
Comparison of Various Web Image Re - Ranking Techniques
Ijcet 06 06_006
Sketch Based Image Retrieval Using BMMA and SEMI-BMMA
Ijcet 06 10_004
International Journal of Engineering Research and Development (IJERD)
Image based Search Engine for Online Shopping
Adaptive Search Based On User Tags in Social Networking
11. Efficient Image Based Searching for Improving User Search Image Goals
A Review on Matching For Sketch Technique
Ad

More from swathi78 (20)

DOC
secure mining of association rules in horizontally distributed databases
DOCX
a system for denial-of-service attack detection based on multivariate correla...
DOCX
web service recommendation via exploiting location and qo s information
DOCX
privacy-enhanced web service composition
DOCX
optimal distributed malware defense in mobile networks with heterogeneous dev...
DOCX
friend book a semantic-based friend recommendation system for social networks
DOCX
efficient authentication for mobile and pervasive computing
DOCX
cooperative caching for efficient data access in disruption tolerant networks
DOCX
an incentive framework for cellular traffic offloading
DOCX
secure outsourced attribute-based signatures
DOCX
traffic pattern-based content leakage detection for trusted content delivery ...
DOCX
the design and evaluation of an information sharing system for human networks
DOCX
the client assignment problem for continuous distributed interactive applicat...
DOCX
sos a distributed mobile q&a system based on social networks
DOCX
securing broker-less publish subscribe systems using identity-based encryption
DOCX
rre a game-theoretic intrusion response and recovery engine
DOCX
on false data-injection attacks against power system state estimation modelin...
DOCX
loca ward a security and privacy aware location-based rewarding system
DOCX
exploiting service similarity for privacy in location-based search queries
DOCX
enabling trustworthy service evaluation in service-oriented mobile social net...
secure mining of association rules in horizontally distributed databases
a system for denial-of-service attack detection based on multivariate correla...
web service recommendation via exploiting location and qo s information
privacy-enhanced web service composition
optimal distributed malware defense in mobile networks with heterogeneous dev...
friend book a semantic-based friend recommendation system for social networks
efficient authentication for mobile and pervasive computing
cooperative caching for efficient data access in disruption tolerant networks
an incentive framework for cellular traffic offloading
secure outsourced attribute-based signatures
traffic pattern-based content leakage detection for trusted content delivery ...
the design and evaluation of an information sharing system for human networks
the client assignment problem for continuous distributed interactive applicat...
sos a distributed mobile q&a system based on social networks
securing broker-less publish subscribe systems using identity-based encryption
rre a game-theoretic intrusion response and recovery engine
on false data-injection attacks against power system state estimation modelin...
loca ward a security and privacy aware location-based rewarding system
exploiting service similarity for privacy in location-based search queries
enabling trustworthy service evaluation in service-oriented mobile social net...
Ad

Recently uploaded (20)

PDF
TFEC-4-2020-Design-Guide-for-Timber-Roof-Trusses.pdf
PPTX
Construction Project Organization Group 2.pptx
PPT
introduction to datamining and warehousing
PDF
PRIZ Academy - 9 Windows Thinking Where to Invest Today to Win Tomorrow.pdf
PPTX
Lecture Notes Electrical Wiring System Components
PDF
Embodied AI: Ushering in the Next Era of Intelligent Systems
PPTX
Infosys Presentation by1.Riyan Bagwan 2.Samadhan Naiknavare 3.Gaurav Shinde 4...
PPTX
Sustainable Sites - Green Building Construction
PDF
Mohammad Mahdi Farshadian CV - Prospective PhD Student 2026
PDF
Well-logging-methods_new................
PDF
July 2025 - Top 10 Read Articles in International Journal of Software Enginee...
PDF
Mitigating Risks through Effective Management for Enhancing Organizational Pe...
PPT
Project quality management in manufacturing
DOCX
573137875-Attendance-Management-System-original
PDF
Digital Logic Computer Design lecture notes
PDF
Operating System & Kernel Study Guide-1 - converted.pdf
PDF
composite construction of structures.pdf
PPTX
Current and future trends in Computer Vision.pptx
PDF
SM_6th-Sem__Cse_Internet-of-Things.pdf IOT
PPTX
Internet of Things (IOT) - A guide to understanding
TFEC-4-2020-Design-Guide-for-Timber-Roof-Trusses.pdf
Construction Project Organization Group 2.pptx
introduction to datamining and warehousing
PRIZ Academy - 9 Windows Thinking Where to Invest Today to Win Tomorrow.pdf
Lecture Notes Electrical Wiring System Components
Embodied AI: Ushering in the Next Era of Intelligent Systems
Infosys Presentation by1.Riyan Bagwan 2.Samadhan Naiknavare 3.Gaurav Shinde 4...
Sustainable Sites - Green Building Construction
Mohammad Mahdi Farshadian CV - Prospective PhD Student 2026
Well-logging-methods_new................
July 2025 - Top 10 Read Articles in International Journal of Software Enginee...
Mitigating Risks through Effective Management for Enhancing Organizational Pe...
Project quality management in manufacturing
573137875-Attendance-Management-System-original
Digital Logic Computer Design lecture notes
Operating System & Kernel Study Guide-1 - converted.pdf
composite construction of structures.pdf
Current and future trends in Computer Vision.pptx
SM_6th-Sem__Cse_Internet-of-Things.pdf IOT
Internet of Things (IOT) - A guide to understanding

click prediction for web image reranking using multimodal sparse coding

  • 1. Click Prediction for Web Image Reranking Using Multimodal Sparse Coding Click Prediction for Web Image Reranking Using Multimodal Sparse Coding ABSTRACT: Image reranking is effective for improving the performance of a text based image search. However, existing reranking algorithms are limited for two main reasons: 1) the textual meta-data associated with images is often mismatched with their actual visual content and 2) the extracted visual features do not accurately describe the semantic similarities between images. Recently, user click information has been used in image reranking, because clicks have been shown to more accurately describe the relevance of retrieved images to search queries. However, a critical problem for click-based methods is the lack of click data, since only a small number of web images have actually been clicked on by users. Therefore, we aim to solve this problem by predicting image clicks. We propose a multimodal hyper graph learning-based sparse coding method for image click prediction, and apply the obtained click data to the reranking of images. We adopt a hyper graph to build a group of manifolds, which explore the complementarily of different features through a group of weights. Unlike a graph that has an edge between two vertices, a hyper edge in a hyper graph connects a set of vertices, and helps preserve the local smoothness of the constructed sparse codes. An alternating optimization procedure is then performed, and the weights of different modalities and the sparse codes are simultaneously obtained. Finally, a voting strategy is used to describe the predicted click as a binary event (click or no click), from the images’ corresponding sparse codes. Thorough empirical studies on a large-scale database including nearly 330K images demonstrate the effectiveness of our approach for click prediction when compared with several other methods. Additional image re-ranking experiments on real world data show the use of click prediction is beneficial to improving the performance of prominent graph-based image re-ranking algorithms. EXISTING SYSTEM: Most existing re-ranking methods use a tool known as pseudo-relevance feedback (PRF), where a proportion of the top-ranked images are assumed to be relevant, and subsequently used to build a model for re-ranking. This is in contrast to relevance feedback, where users explicitly provide feedback by labeling the top results as positive or negative. In the classification-based PRF method, the top-ranked images are regarded as pseudopositive, and low-ranked images regarded Contact: 9703109334, 9533694296 Email id: academicliveprojects@gmail.com, www.logicsystems.org.in
  • 2. Click Prediction for Web Image Reranking Using Multimodal Sparse Coding as pseudo-negative examples to train a classifier, and then re-rank. Hsu et al. also adopt this pseudo-positive and pseudo-negative image method to develop a clustering-based re-ranking algorithm. DISADVANTAGES OF EXISTING SYSTEM: · One major problem impacting performance is the mismatches between the actual content of image and the textual data on the web page. · The problem with these methods is the reliability of the obtained pseudo-positive and pseudo-negative images is not guaranteed. PROPOSED SYSTEM: In this paper we propose a novel method named multimodal hyper graph learning-based sparse coding for click prediction, and apply the predicted clicks to re-rank web images. Both strategies of early and late fusion of multiple features are used in this method through three main steps. · We construct a web image base with associated click annotation, collected from a commercial search engine. The search engine has recorded clicks for each image. Indicate that the images with high clicks are strongly relevant to the queries, while present non-relevant images with zero clicks. These two components form the image bases. · We consider both early and late fusion in the proposed objective function. The early fusion is realized by directly concatenating multiple visual features, and is applied in the sparse coding term. Late fusion is accomplished in the manifold learning term. For web images without clicks, we implement hyper graph learning to construct a group of manifolds, which preserves local smoothness using hyper edges. Unlike a graph that has an edge between two vertices, a set of vertices are connected by the hyper edge in a hyper graph. Common graph-based learning methods usually only consider the pair wise relationship between two vertices, ignoring the higher-order relationship among three or Contact: 9703109334, 9533694296 Email id: academicliveprojects@gmail.com, www.logicsystems.org.in
  • 3. Click Prediction for Web Image Reranking Using Multimodal Sparse Coding more vertices. Using this term can help the proposed method preserve the local smoothness of the constructed sparse codes. · Finally, an alternating optimization procedure is conducted to explore the complementary nature of different modalities. The weights of different modalities and the sparse codes are simultaneously obtained using this optimization strategy. A voting strategy is then adopted to predict if an input image will be clicked or not, based on its sparse code. ADVANTAGES OF PROPOSED SYSTEM: · We effectively utilize search engine derived images annotated with clicks, and successfully predict the clicks for new input images without clicks. Based on the obtained clicks, we re-rank the images, a strategy which could be beneficial for improving commercial image searching. · Second, we propose a novel method named multimodal hyper graph learning-based sparse coding. This method uses both early and late fusion in multimodal learning. By simultaneously learning the sparse codes and the weights of different hyper graphs, the performance of sparse coding performs significantly. SYSTEM ARCHITECTURE: Contact: 9703109334, 9533694296 Email id: academicliveprojects@gmail.com, www.logicsystems.org.in
  • 4. Click Prediction for Web Image Reranking Using Multimodal Sparse Coding SYSTEM REQUIREMENTS: HARDWARE REQUIREMENTS:  System : Pentium IV 2.4 GHz.  Hard Disk : 40 GB.  Floppy Drive : 1.44 Mb.  Monitor : 15 VGA Colour.  Mouse : Logitech.  Ram : 512 Mb. SOFTWARE REQUIREMENTS:  Operating system : Windows XP/7.  Coding Language : ASP.net, C#.net  Tool : Visual Studio 2010  Database : SQL SERVER 2008 REFERENCE: Jun Yu, Member, IEEE, Yong Rui, Fellow, IEEE, and Dacheng Tao, Senior Member, IEEE “Click Prediction for Web Image Reranking Using Multimodal Sparse Coding” IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 23, NO. 5, MAY 2014 Contact: 9703109334, 9533694296 Email id: academicliveprojects@gmail.com, www.logicsystems.org.in