https://airwiki.elet.polimi.it/api.php?action=feedcontributions&user=PamelaGotti&feedformat=atomAIRWiki - User contributions [en]2022-12-02T20:42:36ZUser contributionsMediaWiki 1.25.6https://airwiki.elet.polimi.it/index.php?title=File:RelazionePaperReconstruction.pdf&diff=3947File:RelazionePaperReconstruction.pdf2008-09-08T16:15:38Z<p>PamelaGotti: uploaded a new version of "Image:RelazionePaperReconstruction.pdf"</p>
<hr />
<div></div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=File:RelazionePaperReconstruction.pdf&diff=3945File:RelazionePaperReconstruction.pdf2008-09-04T17:47:22Z<p>PamelaGotti: uploaded a new version of "Image:RelazionePaperReconstruction.pdf"</p>
<hr />
<div></div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=Template_based_paper_like_reconstruction_when_the_edges_are_straight&diff=3937Template based paper like reconstruction when the edges are straight2008-09-04T11:12:40Z<p>PamelaGotti: </p>
<hr />
<div>== '''Project profile''' ==<br />
<br />
<br />
<br />
=== Project short description and related works ===<br />
<br />
Aim of this project is to reconstruct the deformation of a paper given the images of the paper itself and of the picture on the page. The assumption made is that the paper edges are straight.<br />
<br />
A related work is [http://www.lasmea.univ-bpclermont.fr/Personnel/Adrien.Bartoli/Publications/Taddei_Bartoli_NORDIA08.pdf Template-Based Paper Reconstruction from a Single Image is Well Posed when the Rullings are Parallel], <br />
<br />
'''P. Taddei and A. Bartoli''' NORDIA'08 - ''Workshop on Non-Rigid Shape Analysis and Deformation Image Alignment at CVPR'08'', Anchorage, Alaska, June 2008<br />
(the presentation of this work is [[Media:Taddei_bartoli_nordia2008.pdf | available here in pdf]])<br />
<br />
=== Dates ===<br />
<br />
Start date: 2008/06/02<br />
<br />
End date: 2008/12/31<br />
<br />
=== People involved ===<br />
<br />
===== Project head(s) =====<br />
<br />
* [[User:PierluigiTaddei|Pierluigi Taddei]]<br />
* Vincenzo Caglioti<br />
<br />
<br />
<br />
===== Students currently working on the project =====<br />
<br />
* [[User:PamelaGotti|Pamela Gotti]]<br />
<br />
=== Laboratory work and risk analysis ===<br />
<br />
This project does not include laboratory activities.<br />
<br />
== '''Project description''' ==<br />
<br />
==='''The problem'''===<br />
<br />
Aim of the project is is the implementation of an error function whose minimization allows the reconstruction of a deformed paper like surface. <br />
<br />
While the problem is ill-posed in the general case, it is possible to demonstrate that the reconstruction problem can be simplified considering those isometries that map the template to a developable surface wih two opposite straight edges.<br />
<br />
To solve this problem the image template (2D image in real dimension of the paper), the perspective image (the 2D image of the deformed paper), a set of points correspondences between the two images and the camera calibration matrix are given.<br />
<br />
Under these constraints, the problem can be formulated as shown in the following pictures:<br />
<br />
[[Image:Img2.PNG|center|thumb|Formulation of the problem|400px]]<br />
<br />
Image <math>\theta</math> is the template image, which represents the projection on the 2D space of the same paper in the 3D space, represented by image <math>\Theta</math>. <br />
<math>\Gamma</math> is the function that transforms each point of <math>\theta</math> into a point of <math>\Theta</math>. <br />
<math>\Gamma</math> is the unknown matrix that will be iteratively modified in order to minimize an error function.<br />
S is the camera calibration matrix that maps the 3D object <math>\Theta</math> into the image I. <br />
The known points’ correspondences are the one on <math>\theta</math> and I images, while points on <math>\Theta</math> are unknown.<br />
<br />
==='''The error terms'''===<br />
<br />
The implemented error function takes into account several error terms:<br />
<ul><br />
<li> reprojection error: this is the error between the known points on I image and the projection on I of the known points on <math>\theta</math><br />
<li> smoothness error: in the construction of <math>\Theta</math> the edges not constrained to remain parallel must be the smoothest as possible<br />
<li> lower edge length preservation: in the construction of <math>\Theta</math> the lower deformable edge must maintain the same length of the same edge on <math>\theta</math><br />
<li> upper edge length preservation: in the construction of <math>\Theta</math> the upper deformable edge must maintain the same length of the same edge on <math>\theta</math><br />
<li> height preservation: in the construction of <math>\Theta</math> the paper height (the length of the non deformable edges) must be maintained on the entire surface<br />
</ul><br />
<br />
The error terms forms the error array: to improve the following minimization, the Jacobian matrix of the array has been calculated too.<br />
<br />
The function calculating the error and a testing environment for the function has been implemented in Matlab; several information about the solution can be shown:<br />
<ul><br />
<li> a 3D graphs of <math>\Gamma</math> function<br />
<li> the projection on the 2D space of <math>\Gamma</math> function<br />
<li> a histogram whose bar represents the error terms<br />
<li> the I image with the distance between the a priori known points on I image and the projection on I of the a priori known points on <math>\theta</math><br />
<li> the I image with the approximation of the paper given by the projection on <math>\Gamma</math> on I<br />
</ul><br />
<br />
An example of the displayed information is shown in the following picture:<br />
[[Image:resultsPaperReconstruction.PNG|center|thumb|An example of the information about the solution|800px]]<br />
<br />
==='''Documentation'''===<br />
<br />
The documentation about the project is available here: [[Media:RelazionePaperReconstruction.pdf|Documentation]].<br />
<br />
It contains the explanation about the calculated error and, since the code (for performance reason) has been written in a non intuitive way, the detailed documentation of the Matlab code.<br />
<br />
==='''Conclusion'''===<br />
<br />
This project puts the basis for paper reconstruction with the implementation of an error function whose minimization improves the approximation in the 3D space of the paper surface.<br />
<br />
Future works will involve the search of an initial vector for the minimization and the study of the relative importance<br />
the single error terms have, formulating feasible error weights per which the error terms will be multiplied.</div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=File:RelazionePaperReconstruction.pdf&diff=3935File:RelazionePaperReconstruction.pdf2008-09-03T10:52:14Z<p>PamelaGotti: uploaded a new version of "Image:RelazionePaperReconstruction.pdf"</p>
<hr />
<div></div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=Template_based_paper_like_reconstruction_when_the_edges_are_straight&diff=3915Template based paper like reconstruction when the edges are straight2008-08-29T12:56:10Z<p>PamelaGotti: </p>
<hr />
<div>== '''Project profile''' ==<br />
<br />
<br />
<br />
=== Project short description and related works ===<br />
<br />
Aim of this project is to reconstruct the deformation of a paper given the images of the paper itself and of the picture on the page. The assumption made is that the paper edges are straight.<br />
<br />
A related work is [http://www.lasmea.univ-bpclermont.fr/Personnel/Adrien.Bartoli/Publications/Taddei_Bartoli_NORDIA08.pdf Template-Based Paper Reconstruction from a Single Image is Well Posed when the Rullings are Parallel], <br />
<br />
'''P. Taddei and A. Bartoli''' NORDIA'08 - ''Workshop on Non-Rigid Shape Analysis and Deformation Image Alignment at CVPR'08'', Anchorage, Alaska, June 2008<br />
(the presentation of this work is [[Media:Taddei_bartoli_nordia2008.pdf | available here in pdf]])<br />
<br />
=== Dates ===<br />
<br />
Start date: 2008/06/02<br />
<br />
End date: 2008/12/31<br />
<br />
=== People involved ===<br />
<br />
===== Project head(s) =====<br />
<br />
* [[User:PierluigiTaddei|Pierluigi Taddei]]<br />
* Vincenzo Caglioti<br />
<br />
<br />
<br />
===== Students currently working on the project =====<br />
<br />
* [[User:PamelaGotti|Pamela Gotti]]<br />
<br />
=== Laboratory work and risk analysis ===<br />
<br />
This project does not include laboratory activities.<br />
<br />
== '''Project description''' ==<br />
<br />
==='''The problem'''===<br />
<br />
Aim of the project is is the implementation of an error function whose minimization allows the reconstruction of a deformed paper like surface. <br />
<br />
While the problem is ill-posed in the general case, it is possible to demonstrate that the reconstruction problem can be simplified considering those isometries that map the template to a developable surface wih two opposite straight edges.<br />
<br />
To solve this problem the image template (2D image in real dimension of the paper), the perspective image (the 2D image of the deformed paper), a set of points correspondences between the two images and the camera calibration matrix are given.<br />
<br />
Under these constraints, the problem can be formulated as shown in the following pictures:<br />
<br />
[[Image:Img2.PNG|center|thumb|Formulation of the problem|400px]]<br />
<br />
Image <math>\theta</math> is the template image, which represents the projection on the 2D space of the same paper in the 3D space, represented by image <math>\Theta</math>. <br />
<math>\Gamma</math> is the function that transforms each point of <math>\theta</math> into a point of <math>\Theta</math>. <br />
<math>\Gamma</math> is the unknown matrix that will be iteratively modified in order to minimize an error function.<br />
S is the camera calibration matrix that maps the 3D object <math>\Theta</math> into the image I. <br />
The known points’ correspondences are the one on <math>\theta</math> and I images, while points on <math>\Theta</math> are unknown.<br />
<br />
==='''The error terms'''===<br />
<br />
The implemented error function takes into account several error terms:<br />
<ul><br />
<li> reprojection error: this is the error between the known points on I image and the projection on I of the known points on <math>\theta</math><br />
<li> smoothness error: in the construction of <math>\Theta</math> the edges not constrained to remain parallel must be the smoothest as possible<br />
<li> lower edge length preservation: in the construction of <math>\Theta</math> the lower deformable edge must maintain the same length of the same edge on <math>\theta</math><br />
<li> upper edge length preservation: in the construction of <math>\Theta</math> the upper deformable edge must maintain the same length of the same edge on <math>\theta</math><br />
<li> height preservation: in the construction of <math>\Theta</math> the paper height (the length of the non deformable edges) must be maintained on the entire surface<br />
</ul><br />
<br />
The error terms forms the error array: to improve the following minimization, the Jacobian matrix of the array has been calculated too.<br />
<br />
The function calculating the error has been implemented in Matlab: source code is available here: [[Media:PaperReconstruction.zip|Paper reconstruction source code]]. <br />
The attached source code includes a testing environment for the function, which displays several information about the solution:<br />
<ul><br />
<li> a 3D graphs of <math>\Gamma</math> function<br />
<li> the projection on the 2D space of <math>\Gamma</math> function<br />
<li> a histogram whose bar represents the error terms<br />
<li> the I image with the distance between the a priori known points on I image and the projection on I of the a priori known points on <math>\theta</math><br />
<li> the I image with the approximation of the paper given by the projection on <math>\Gamma</math> on I<br />
</ul><br />
<br />
An example of the displayed information is shown in the following picture:<br />
[[Image:resultsPaperReconstruction.PNG|center|thumb|An example of the information about the solution|800px]]<br />
<br />
==='''Documentation'''===<br />
<br />
The documentation about the project is available here: [[Media:RelazionePaperReconstruction.pdf|Documentation]].<br />
<br />
It contains the explanation about the calculated error and, since the code (for performance reason) has been written in a non intuitive way, the detailed documentation of the Matlab code.<br />
<br />
==='''Conclusion'''===<br />
<br />
This project puts the basis for paper reconstruction with the implementation of an error function whose minimization improves the approximation in the 3D space of the paper surface.<br />
<br />
Future works will involve the search of an initial vector for the minimization and the study of the relative importance<br />
the single error terms have, formulating feasible error weights per which the error terms will be multiplied.</div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=File:Img2.PNG&diff=3914File:Img2.PNG2008-08-29T12:30:51Z<p>PamelaGotti: </p>
<hr />
<div></div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=File:ResultsPaperReconstruction.PNG&diff=3913File:ResultsPaperReconstruction.PNG2008-08-29T12:30:31Z<p>PamelaGotti: </p>
<hr />
<div></div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=File:PaperReconstruction.zip&diff=3912File:PaperReconstruction.zip2008-08-29T12:29:16Z<p>PamelaGotti: </p>
<hr />
<div></div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=File:RelazionePaperReconstruction.pdf&diff=3911File:RelazionePaperReconstruction.pdf2008-08-29T12:26:47Z<p>PamelaGotti: </p>
<hr />
<div></div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=Template_based_paper_like_reconstruction_when_the_edges_are_straight&diff=3293Template based paper like reconstruction when the edges are straight2008-06-02T12:19:10Z<p>PamelaGotti: </p>
<hr />
<div>== '''Part 1: project profile''' ==<br />
<br />
=== Project name ===<br />
<br />
Editing Template based paper like reconstruction when the edges are straight.<br />
<br />
=== Project short description ===<br />
<br />
Aim of this project is to reconstruct the deformation of a paper given the images of the paper itself and of the picture on the page. The assumption made is that the paper edges are straight. <br />
<br />
=== Dates ===<br />
<br />
Start date: 2008/06/02<br />
<br />
End date: 2008/1231<br />
<br />
=== People involved ===<br />
<br />
===== Project head(s) =====<br />
<br />
* V. Caglioti - Vincenzo (dot) Caglioti (at) polimi (dot) it<br />
<br />
===== Other Politecnico di Milano people =====<br />
<br />
* P. Taddei - pierluigi (dot) taddei (at) polimi (dot) it <br />
<br />
===== Students currently working on the project =====<br />
<br />
* [[User:PamelaGotti|Pamela Gotti]]<br />
<br />
=== Laboratory work and risk analysis ===<br />
<br />
This project does not include laboratory activities.<br />
<br />
== '''Part 2: project description''' ==</div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=Projects&diff=3292Projects2008-06-02T12:16:36Z<p>PamelaGotti: /* Computer Vision and Image Analysis */</p>
<hr />
<div>''This page is a repository of links to the pages describing the '''projects''' we are currently working on at AIRLab. <br />
See the list of our finished projects on the [[Finished Projects]] page.''<br />
<br />
== Ongoing projects ==<br />
''by research area (areas are defined in the [[Main Page]]); for each project a name and a link to its AIRWiki page is given''<br />
<br />
==== [[Agents, Multiagent Systems, Agencies]] ====<br />
----<br />
<br />
* [[Multiagent cooperation|Multiagent cooperating system]]<br />
<br />
* [[Planning in Ambient Intelligence scenarios| Planning in Ambient Intelligence scenarios]]<br />
<br />
==== [[BioSignal Analysis]] ====<br />
----<br />
====== [[Affective Computing]] ======<br />
<br />
* [[Relatioship between Cognition and Emotion in Rehabilitation Robotics]]<br />
* [[Driving companions]]<br />
* [[Emotion from Interaction]]<br />
* [[Affective Devices]]<br />
<br />
====== [[Brain-Computer Interface]] ======<br />
<br />
* [[Online P300 and ErrP recognition with BCI2000]]<br />
* [[BCI based on Motor Imagery]]<br />
* [[Graphical user interface for an autonomous wheelchair]]<br />
* [[Mu and beta rhythm-based BCI]]<br />
<br />
====== [[Automatic Detection Of Sleep Stages]] ======<br />
<br />
* [[Sleep Staging with HMM]]<br />
<br />
====== [[Analysis of the Olfactory Signal]] ======<br />
<br />
* [[Lung Cancer Detection by an Electronic Nose]]<br />
* [[HE-KNOWS - An electronic nose]]<br />
<br />
==== [[Computer Vision and Image Analysis]] ====<br />
----<br />
<br />
* [[Automated extraction of laser streaks and range profiles]]<br />
<br />
* [[Data collection for mutual calibration|Data collection for laser-rangefinder and camera calibration]]<br />
<br />
* [[Image retargeting by k-seam removal]]<br />
<br />
* [[Particle filter for object tracking]]<br />
<br />
* [[Template based paper like reconstruction when the edges are straight]]<br />
<br />
* [[Wii Remote headtracking and active projector]]<br />
<br />
==== [[Machine Learning]] ====<br />
----<br />
* [[Adaptive Reinforcement Learning Multiagent Coordination in Real-Time Computer Games|Adaptive Reinforcement Learning Multiagent Coordination in Real-Time Computer Games]]<br />
<br />
==== [[Ontologies and Semantic Web]] ====<br />
----<br />
* [[JOFS|JOFS, Java Owl File Storage]]<br />
* [[FolksOnt|FolksOnt]]<br />
* [[Extending a wiki with semantic templates]]<br />
* [[GeoOntology|Geographic ontology for a semantic wiki]]<br />
<br />
==== [[Philosophy of Artificial Intelligence]] ====<br />
----<br />
==== [[Robotics]] ====<br />
----<br />
* [[LURCH - The autonomous wheelchair]]<br />
<br />
* [[Rawseeds|RAWSEEDS]]<br />
<br />
* [[Balancing robots: Tilty, TiltOne]]<br />
<br />
* [[ROBOWII ]]<br />
<br />
* [[PoliManus]]<br />
<br />
* [[ZOIDBERG - An autonomous bio-inspired RoboFish]]<br />
<br />
* [[Styx The 6 Whegs Robot]]<br />
<br />
* [[PolyGlove: a body-based haptic interface]]<br />
<br />
==== [[Soft Computing]] ====<br />
----<br />
<br />
<br />
<br />
== Note for students ==<br />
<br />
If you are a student and there isn't a '''page describing your project''', this is because YOU have the task of creating it and populating it with (meaningful) content. If you are a student and there IS a page describing your project, you have the task to complete that page with (useful and comprehensive) information about your own contribution to the project. Be aware that the quality of your work (or lack of it) on the AIRWiki will be evaluated by the Teachers and will influence your grades.<br />
<br />
Instructions to add a new project or to add content to an existing project page are available at [[Projects - HOWTO]].</div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=Image_retargeting_by_k-seam_removal&diff=3257Image retargeting by k-seam removal2008-05-28T13:56:41Z<p>PamelaGotti: /* '''Part 2: project description''' */</p>
<hr />
<div>== '''Part 1: project profile''' ==<br />
<br />
=== Project name ===<br />
<br />
Image retargeting by k-seam removal.<br />
<br />
=== Project short description ===<br />
<br />
This project presents a methodology for content aware image resizing based on seam removal. In this work four different approaches were implemented in order to retarget an image:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function<br />
* removing a not connected path of pixels (k-seam) minimizing an energy function<br />
* removing a 8-connected path of pixels (1-seam) minimizing the energy variation in the image<br />
* removing a not connected path of pixels (k-seam) minimizing the energy variation in the image<br />
where k is the maximum disconnect allowed.<br />
<br />
The work ends with a comparison on several test pictures among these algorithms considering the one which gives the best results.<br />
<br />
=== Dates ===<br />
Start date: 2008/01/01<br />
<br />
End date: 2008/06/24<br />
<br />
=== People involved ===<br />
<br />
===== Project head(s) =====<br />
<br />
* V. Caglioti - Vincenzo (dot) Caglioti (at) polimi (dot) it<br />
<br />
===== Other Politecnico di Milano people =====<br />
<br />
* P. Taddei - pierluigi (dot) taddei (at) polimi (dot) it <br />
<br />
===== Students currently working on the project =====<br />
<br />
* Luigi Cardamone - luigi (dot) cardamone (at) mail (dot) polimi (dot) it<br />
<br />
* [[User:PamelaGotti|Pamela Gotti]]<br />
<br />
=== Laboratory work and risk analysis ===<br />
<br />
This project does not include laboratory activities.<br />
<br />
== '''Part 2: project description''' ==<br />
<br />
==='''State of the art'''===<br />
<br />
This project is based on the article ''Seam carving for content-aware image resizing, Avidan, S. and Shamir, A.,International Conference on Computer Graphics and Interactive Techniques, 2007'', in which the author describes content aware image resizing by removal of 8-connected path of pixels.<br />
<br />
==='''The problem'''===<br />
<br />
The normal way of resizing a picture doesn’t take in account it’s content and differs from the resizing of a web page where each object is modified on the basis of its content. So, there is the need for an image resizing that is content aware.<br />
<br />
==='''The Idea'''===<br />
<br />
The idea behind content aware resizing is to treat in a different way the important regions of the image respect to those regions with less information. To achieve this goal it’s possible to remove from the picture the seam with low energy.<br />
A seam is a path of pixel from top to bottom or from left to right, as it’s possible to see in the following picture:<br />
<br />
[[Image:Paesaggioconseam.JPG|center|thumb|An example of vertical connected seam|400px]]<br />
<br />
==='''The Algorithm'''===<br />
<br />
The implemented algorithms use different kind of seam and minimize different measure:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function <br />
* removing a not connected path of pixels (k-seam) minimizing an energy function <br />
* removing a 8-connected path of pixels (1-seam) minimizing the total energy variation in the image <br />
* removing a not connected path of pixels (k-seam) minimizing the total energy variation in the image <br />
<br />
Where k seam are those seam with a maximum disconnection of k pixel. This disconnection is important when in the picture there are many object and it’s important to don’t cut their edges.<br />
<br />
All these algorithms were implemented in Matlab and tested on several pictures (source code is available here: [[Media:Carving.zip|Carving source code]]<br />
). The project follows with a comparative analysis of strength and weakness of each method.<br />
<br />
==='''Report'''===<br />
<br />
The report about this project is available here: [[Media:Relazione.pdf|Report]]<br />
<br />
==='''Conclusion'''===<br />
<br />
From results emerge that the best algorithm is that one working with 1-seam with minimum energy.<br />
<br />
In the following pictures it is possible to see the difference between the result of the retargeting using the best algorithm and the normal resize method (stretching).<br />
<br />
[[Image:ImageContentResizeDelfino.jpg|left|thumb|Original image|325px]]<br />
<br />
[[Image:Delfino22.JPG|left|thumb|Resized image with streching|250px]]<br />
<br />
[[Image:Delfino2 original connected.JPG|left|thumb|Resized image with 1-seam with minumum energy|250px]]<br />
<br />
[[Image:Delfino2 original notconnected.JPG|left|thumb|Resized image with k-seam with minumum energy|250px]]<br />
<br />
[[Image:Delfino2 final connected.JPG|left|thumb|Resized image with 1-seam with minumum energy variation|250px]]<br />
<br />
[[Image:Delfino2 final notconnected.JPG|left|thumb|Resized image with k-seam with minumum energy variation|250px]]</div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=Image_retargeting_by_k-seam_removal&diff=3256Image retargeting by k-seam removal2008-05-28T13:55:44Z<p>PamelaGotti: /* '''Conclusion''' */</p>
<hr />
<div>== '''Part 1: project profile''' ==<br />
<br />
=== Project name ===<br />
<br />
Image retargeting by k-seam removal.<br />
<br />
=== Project short description ===<br />
<br />
This project presents a methodology for content aware image resizing based on seam removal. In this work four different approaches were implemented in order to retarget an image:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function<br />
* removing a not connected path of pixels (k-seam) minimizing an energy function<br />
* removing a 8-connected path of pixels (1-seam) minimizing the energy variation in the image<br />
* removing a not connected path of pixels (k-seam) minimizing the energy variation in the image<br />
where k is the maximum disconnect allowed.<br />
<br />
The work ends with a comparison on several test pictures among these algorithms considering the one which gives the best results.<br />
<br />
=== Dates ===<br />
Start date: 2008/01/01<br />
<br />
End date: 2008/06/24<br />
<br />
=== People involved ===<br />
<br />
===== Project head(s) =====<br />
<br />
* V. Caglioti - Vincenzo (dot) Caglioti (at) polimi (dot) it<br />
<br />
===== Other Politecnico di Milano people =====<br />
<br />
* P. Taddei - pierluigi (dot) taddei (at) polimi (dot) it <br />
<br />
===== Students currently working on the project =====<br />
<br />
* Luigi Cardamone - luigi (dot) cardamone (at) mail (dot) polimi (dot) it<br />
<br />
* [[User:PamelaGotti|Pamela Gotti]]<br />
<br />
=== Laboratory work and risk analysis ===<br />
<br />
This project does not include laboratory activities.<br />
<br />
== '''Part 2: project description''' ==<br />
<br />
==='''State of the art'''===<br />
<br />
This project is based on the article ''Seam carving for content-aware image resizing, Avidan, S. and Shamir, A.,International Conference on Computer Graphics and Interactive Techniques, 2007'', in which the author describes content aware image resizing by removal of 8-connected path of pixels.<br />
<br />
==='''The problem'''===<br />
<br />
The normal way of resizing a picture doesn’t take in account it’s content and differs from the resizing of a web page where each object is modified on the basis of its content. So, there is the need for an image resizing that is content aware.<br />
<br />
==='''The Idea'''===<br />
<br />
The idea behind content aware resizing is to treat in a different way the important regions of the image respect to those regions with less information. To achieve this goal it’s possible to remove from the picture the seam with low energy.<br />
A seam is a path of pixel from top to bottom or from left to right, as it’s possible to see in the following picture:<br />
<br />
[[Image:Paesaggioconseam.JPG|center|thumb|An example of vertical connected seam|400px]]<br />
<br />
==='''The Algorithm'''===<br />
<br />
The implemented algorithms use different kind of seam and minimize different measure:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function <br />
* removing a not connected path of pixels (k-seam) minimizing an energy function <br />
* removing a 8-connected path of pixels (1-seam) minimizing the total energy variation in the image <br />
* removing a not connected path of pixels (k-seam) minimizing the total energy variation in the image <br />
<br />
Where k seam are those seam with a maximum disconnection of k pixel. This disconnection is important when in the picture there are many object and it’s important to don’t cut their edges.<br />
<br />
All these algorithms were implemented in Matlab and tested on several pictures (source code is available here: [[Media:Carving.zip|Carving source code]]<br />
). The project follows with a comparative analysis of strength and weakness of each method.<br />
<br />
==='''Conclusion'''===<br />
<br />
From results emerge that the best algorithm is that one working with 1-seam with minimum energy.<br />
<br />
In the following pictures it is possible to see the difference between the result of the retargeting using the best algorithm and the normal resize method (stretching).<br />
<br />
[[Image:ImageContentResizeDelfino.jpg|left|thumb|Original image|325px]]<br />
<br />
[[Image:Delfino22.JPG|left|thumb|Resized image with streching|250px]]<br />
<br />
[[Image:Delfino2 original connected.JPG|left|thumb|Resized image with 1-seam with minumum energy|250px]]<br />
<br />
[[Image:Delfino2 original notconnected.JPG|left|thumb|Resized image with k-seam with minumum energy|250px]]<br />
<br />
[[Image:Delfino2 final connected.JPG|left|thumb|Resized image with 1-seam with minumum energy variation|250px]]<br />
<br />
[[Image:Delfino2 final notconnected.JPG|left|thumb|Resized image with k-seam with minumum energy variation|250px]]<br />
<br />
==='''Report'''===<br />
<br />
The report about this project is available here: [[Media:Relazione.pdf|Report]]</div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=Image_retargeting_by_k-seam_removal&diff=3255Image retargeting by k-seam removal2008-05-28T13:52:05Z<p>PamelaGotti: /* '''Conclusion''' */</p>
<hr />
<div>== '''Part 1: project profile''' ==<br />
<br />
=== Project name ===<br />
<br />
Image retargeting by k-seam removal.<br />
<br />
=== Project short description ===<br />
<br />
This project presents a methodology for content aware image resizing based on seam removal. In this work four different approaches were implemented in order to retarget an image:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function<br />
* removing a not connected path of pixels (k-seam) minimizing an energy function<br />
* removing a 8-connected path of pixels (1-seam) minimizing the energy variation in the image<br />
* removing a not connected path of pixels (k-seam) minimizing the energy variation in the image<br />
where k is the maximum disconnect allowed.<br />
<br />
The work ends with a comparison on several test pictures among these algorithms considering the one which gives the best results.<br />
<br />
=== Dates ===<br />
Start date: 2008/01/01<br />
<br />
End date: 2008/06/24<br />
<br />
=== People involved ===<br />
<br />
===== Project head(s) =====<br />
<br />
* V. Caglioti - Vincenzo (dot) Caglioti (at) polimi (dot) it<br />
<br />
===== Other Politecnico di Milano people =====<br />
<br />
* P. Taddei - pierluigi (dot) taddei (at) polimi (dot) it <br />
<br />
===== Students currently working on the project =====<br />
<br />
* Luigi Cardamone - luigi (dot) cardamone (at) mail (dot) polimi (dot) it<br />
<br />
* [[User:PamelaGotti|Pamela Gotti]]<br />
<br />
=== Laboratory work and risk analysis ===<br />
<br />
This project does not include laboratory activities.<br />
<br />
== '''Part 2: project description''' ==<br />
<br />
==='''State of the art'''===<br />
<br />
This project is based on the article ''Seam carving for content-aware image resizing, Avidan, S. and Shamir, A.,International Conference on Computer Graphics and Interactive Techniques, 2007'', in which the author describes content aware image resizing by removal of 8-connected path of pixels.<br />
<br />
==='''The problem'''===<br />
<br />
The normal way of resizing a picture doesn’t take in account it’s content and differs from the resizing of a web page where each object is modified on the basis of its content. So, there is the need for an image resizing that is content aware.<br />
<br />
==='''The Idea'''===<br />
<br />
The idea behind content aware resizing is to treat in a different way the important regions of the image respect to those regions with less information. To achieve this goal it’s possible to remove from the picture the seam with low energy.<br />
A seam is a path of pixel from top to bottom or from left to right, as it’s possible to see in the following picture:<br />
<br />
[[Image:Paesaggioconseam.JPG|center|thumb|An example of vertical connected seam|400px]]<br />
<br />
==='''The Algorithm'''===<br />
<br />
The implemented algorithms use different kind of seam and minimize different measure:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function <br />
* removing a not connected path of pixels (k-seam) minimizing an energy function <br />
* removing a 8-connected path of pixels (1-seam) minimizing the total energy variation in the image <br />
* removing a not connected path of pixels (k-seam) minimizing the total energy variation in the image <br />
<br />
Where k seam are those seam with a maximum disconnection of k pixel. This disconnection is important when in the picture there are many object and it’s important to don’t cut their edges.<br />
<br />
All these algorithms were implemented in Matlab and tested on several pictures (source code is available here: [[Media:Carving.zip|Carving source code]]<br />
). The project follows with a comparative analysis of strength and weakness of each method.<br />
<br />
==='''Conclusion'''===<br />
<br />
From results emerge that the best algorithm is that one working with 1-seam with minimum energy.<br />
<br />
In the following pictures it is possible to see the difference between the result of the retargeting using the best algorithm and the normal resize method (stretching).<br />
<br />
[[Image:ImageContentResizeDelfino.jpg|center|thumb|Original image|325px]]<br />
<br />
[[Image:Delfino22.JPG|center|thumb|Resized image with streching|250px]]<br />
<br />
[[Image:Delfino2 original connected.JPG|center|thumb|Resized image with 1-seam with minumum energy|250px]]<br />
<br />
[[Image:Delfino2 original notconnected.JPG|center|thumb|Resized image with k-seam with minumum energy|250px]]<br />
<br />
[[Image:Delfino2 final connected.JPG|center|thumb|Resized image with 1-seam with minumum energy variation|250px]]<br />
<br />
[[Image:Delfino2 final notconnected.JPG|center|thumb|Resized image with k-seam with minumum energy variation|250px]]<br />
<br />
==='''Report'''===<br />
<br />
The report about this project is available here: [[Media:Relazione.pdf|Report]]</div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=Image_retargeting_by_k-seam_removal&diff=3254Image retargeting by k-seam removal2008-05-28T13:51:33Z<p>PamelaGotti: /* '''Part 2: project description''' */</p>
<hr />
<div>== '''Part 1: project profile''' ==<br />
<br />
=== Project name ===<br />
<br />
Image retargeting by k-seam removal.<br />
<br />
=== Project short description ===<br />
<br />
This project presents a methodology for content aware image resizing based on seam removal. In this work four different approaches were implemented in order to retarget an image:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function<br />
* removing a not connected path of pixels (k-seam) minimizing an energy function<br />
* removing a 8-connected path of pixels (1-seam) minimizing the energy variation in the image<br />
* removing a not connected path of pixels (k-seam) minimizing the energy variation in the image<br />
where k is the maximum disconnect allowed.<br />
<br />
The work ends with a comparison on several test pictures among these algorithms considering the one which gives the best results.<br />
<br />
=== Dates ===<br />
Start date: 2008/01/01<br />
<br />
End date: 2008/06/24<br />
<br />
=== People involved ===<br />
<br />
===== Project head(s) =====<br />
<br />
* V. Caglioti - Vincenzo (dot) Caglioti (at) polimi (dot) it<br />
<br />
===== Other Politecnico di Milano people =====<br />
<br />
* P. Taddei - pierluigi (dot) taddei (at) polimi (dot) it <br />
<br />
===== Students currently working on the project =====<br />
<br />
* Luigi Cardamone - luigi (dot) cardamone (at) mail (dot) polimi (dot) it<br />
<br />
* [[User:PamelaGotti|Pamela Gotti]]<br />
<br />
=== Laboratory work and risk analysis ===<br />
<br />
This project does not include laboratory activities.<br />
<br />
== '''Part 2: project description''' ==<br />
<br />
==='''State of the art'''===<br />
<br />
This project is based on the article ''Seam carving for content-aware image resizing, Avidan, S. and Shamir, A.,International Conference on Computer Graphics and Interactive Techniques, 2007'', in which the author describes content aware image resizing by removal of 8-connected path of pixels.<br />
<br />
==='''The problem'''===<br />
<br />
The normal way of resizing a picture doesn’t take in account it’s content and differs from the resizing of a web page where each object is modified on the basis of its content. So, there is the need for an image resizing that is content aware.<br />
<br />
==='''The Idea'''===<br />
<br />
The idea behind content aware resizing is to treat in a different way the important regions of the image respect to those regions with less information. To achieve this goal it’s possible to remove from the picture the seam with low energy.<br />
A seam is a path of pixel from top to bottom or from left to right, as it’s possible to see in the following picture:<br />
<br />
[[Image:Paesaggioconseam.JPG|center|thumb|An example of vertical connected seam|400px]]<br />
<br />
==='''The Algorithm'''===<br />
<br />
The implemented algorithms use different kind of seam and minimize different measure:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function <br />
* removing a not connected path of pixels (k-seam) minimizing an energy function <br />
* removing a 8-connected path of pixels (1-seam) minimizing the total energy variation in the image <br />
* removing a not connected path of pixels (k-seam) minimizing the total energy variation in the image <br />
<br />
Where k seam are those seam with a maximum disconnection of k pixel. This disconnection is important when in the picture there are many object and it’s important to don’t cut their edges.<br />
<br />
All these algorithms were implemented in Matlab and tested on several pictures (source code is available here: [[Media:Carving.zip|Carving source code]]<br />
). The project follows with a comparative analysis of strength and weakness of each method.<br />
<br />
==='''Conclusion'''===<br />
<br />
From results emerge that the best algorithm is that one working with 1-seam with minimum energy.<br />
<br />
In the following pictures it is possible to see the difference between the result of the retargeting using the best algorithm and the normal resize method (stretching).<br />
<br />
[[Image:ImageContentResizeDelfino.jpg|left|thumb|Original image|325px]]<br />
<br />
[[Image:Delfino22.JPG|left|thumb|Resized image with streching|250px]]<br />
<br />
[[Image:Delfino2 original connected.JPG|left|thumb|Resized image with 1-seam with minumum energy|250px]]<br />
<br />
[[Image:Delfino2 original notconnected.JPG|left|thumb|Resized image with k-seam with minumum energy|250px]]<br />
<br />
[[Image:Delfino2 final connected.JPG|left|thumb|Resized image with 1-seam with minumum energy variation|250px]]<br />
<br />
[[Image:Delfino2 final notconnected.JPG|left|thumb|Resized image with k-seam with minumum energy variation|250px]]<br />
<br />
==='''Report'''===<br />
<br />
The report about this project is available here: [[Media:Relazione.pdf|Report]]</div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=File:Relazione.pdf&diff=3253File:Relazione.pdf2008-05-28T13:51:16Z<p>PamelaGotti: </p>
<hr />
<div></div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=Image_retargeting_by_k-seam_removal&diff=3252Image retargeting by k-seam removal2008-05-28T13:48:59Z<p>PamelaGotti: /* '''Conclusion''' */</p>
<hr />
<div>== '''Part 1: project profile''' ==<br />
<br />
=== Project name ===<br />
<br />
Image retargeting by k-seam removal.<br />
<br />
=== Project short description ===<br />
<br />
This project presents a methodology for content aware image resizing based on seam removal. In this work four different approaches were implemented in order to retarget an image:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function<br />
* removing a not connected path of pixels (k-seam) minimizing an energy function<br />
* removing a 8-connected path of pixels (1-seam) minimizing the energy variation in the image<br />
* removing a not connected path of pixels (k-seam) minimizing the energy variation in the image<br />
where k is the maximum disconnect allowed.<br />
<br />
The work ends with a comparison on several test pictures among these algorithms considering the one which gives the best results.<br />
<br />
=== Dates ===<br />
Start date: 2008/01/01<br />
<br />
End date: 2008/06/24<br />
<br />
=== People involved ===<br />
<br />
===== Project head(s) =====<br />
<br />
* V. Caglioti - Vincenzo (dot) Caglioti (at) polimi (dot) it<br />
<br />
===== Other Politecnico di Milano people =====<br />
<br />
* P. Taddei - pierluigi (dot) taddei (at) polimi (dot) it <br />
<br />
===== Students currently working on the project =====<br />
<br />
* Luigi Cardamone - luigi (dot) cardamone (at) mail (dot) polimi (dot) it<br />
<br />
* [[User:PamelaGotti|Pamela Gotti]]<br />
<br />
=== Laboratory work and risk analysis ===<br />
<br />
This project does not include laboratory activities.<br />
<br />
== '''Part 2: project description''' ==<br />
<br />
==='''State of the art'''===<br />
<br />
This project is based on the article ''Seam carving for content-aware image resizing, Avidan, S. and Shamir, A.,International Conference on Computer Graphics and Interactive Techniques, 2007'', in which the author describes content aware image resizing by removal of 8-connected path of pixels.<br />
<br />
==='''The problem'''===<br />
<br />
The normal way of resizing a picture doesn’t take in account it’s content and differs from the resizing of a web page where each object is modified on the basis of its content. So, there is the need for an image resizing that is content aware.<br />
<br />
==='''The Idea'''===<br />
<br />
The idea behind content aware resizing is to treat in a different way the important regions of the image respect to those regions with less information. To achieve this goal it’s possible to remove from the picture the seam with low energy.<br />
A seam is a path of pixel from top to bottom or from left to right, as it’s possible to see in the following picture:<br />
<br />
[[Image:Paesaggioconseam.JPG|center|thumb|An example of vertical connected seam|400px]]<br />
<br />
==='''The Algorithm'''===<br />
<br />
The implemented algorithms use different kind of seam and minimize different measure:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function <br />
* removing a not connected path of pixels (k-seam) minimizing an energy function <br />
* removing a 8-connected path of pixels (1-seam) minimizing the total energy variation in the image <br />
* removing a not connected path of pixels (k-seam) minimizing the total energy variation in the image <br />
<br />
Where k seam are those seam with a maximum disconnection of k pixel. This disconnection is important when in the picture there are many object and it’s important to don’t cut their edges.<br />
<br />
All these algorithms were implemented in Matlab and tested on several pictures (source code is available here: [[Media:Carving.zip|Carving source code]]<br />
). The project follows with a comparative analysis of strength and weakness of each method.<br />
<br />
==='''Conclusion'''===<br />
<br />
From results emerge that the best algorithm is that one working with 1-seam with minimum energy.<br />
<br />
In the following pictures it is possible to see the difference between the result of the retargeting using the best algorithm and the normal resize method (stretching).<br />
<br />
[[Image:ImageContentResizeDelfino.jpg|left|thumb|Original image|325px]]<br />
<br />
[[Image:Delfino22.JPG|left|thumb|Resized image with streching|250px]]<br />
<br />
[[Image:Delfino2 original connected.JPG|left|thumb|Resized image with 1-seam with minumum energy|250px]]<br />
<br />
[[Image:Delfino2 original notconnected.JPG|left|thumb|Resized image with k-seam with minumum energy|250px]]<br />
<br />
[[Image:Delfino2 final connected.JPG|left|thumb|Resized image with 1-seam with minumum energy variation|250px]]<br />
<br />
[[Image:Delfino2 final notconnected.JPG|left|thumb|Resized image with k-seam with minumum energy variation|250px]]</div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=File:Delfino2_final_notconnected.JPG&diff=3251File:Delfino2 final notconnected.JPG2008-05-28T13:48:28Z<p>PamelaGotti: </p>
<hr />
<div></div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=Image_retargeting_by_k-seam_removal&diff=3250Image retargeting by k-seam removal2008-05-28T13:46:11Z<p>PamelaGotti: /* '''Conclusion''' */</p>
<hr />
<div>== '''Part 1: project profile''' ==<br />
<br />
=== Project name ===<br />
<br />
Image retargeting by k-seam removal.<br />
<br />
=== Project short description ===<br />
<br />
This project presents a methodology for content aware image resizing based on seam removal. In this work four different approaches were implemented in order to retarget an image:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function<br />
* removing a not connected path of pixels (k-seam) minimizing an energy function<br />
* removing a 8-connected path of pixels (1-seam) minimizing the energy variation in the image<br />
* removing a not connected path of pixels (k-seam) minimizing the energy variation in the image<br />
where k is the maximum disconnect allowed.<br />
<br />
The work ends with a comparison on several test pictures among these algorithms considering the one which gives the best results.<br />
<br />
=== Dates ===<br />
Start date: 2008/01/01<br />
<br />
End date: 2008/06/24<br />
<br />
=== People involved ===<br />
<br />
===== Project head(s) =====<br />
<br />
* V. Caglioti - Vincenzo (dot) Caglioti (at) polimi (dot) it<br />
<br />
===== Other Politecnico di Milano people =====<br />
<br />
* P. Taddei - pierluigi (dot) taddei (at) polimi (dot) it <br />
<br />
===== Students currently working on the project =====<br />
<br />
* Luigi Cardamone - luigi (dot) cardamone (at) mail (dot) polimi (dot) it<br />
<br />
* [[User:PamelaGotti|Pamela Gotti]]<br />
<br />
=== Laboratory work and risk analysis ===<br />
<br />
This project does not include laboratory activities.<br />
<br />
== '''Part 2: project description''' ==<br />
<br />
==='''State of the art'''===<br />
<br />
This project is based on the article ''Seam carving for content-aware image resizing, Avidan, S. and Shamir, A.,International Conference on Computer Graphics and Interactive Techniques, 2007'', in which the author describes content aware image resizing by removal of 8-connected path of pixels.<br />
<br />
==='''The problem'''===<br />
<br />
The normal way of resizing a picture doesn’t take in account it’s content and differs from the resizing of a web page where each object is modified on the basis of its content. So, there is the need for an image resizing that is content aware.<br />
<br />
==='''The Idea'''===<br />
<br />
The idea behind content aware resizing is to treat in a different way the important regions of the image respect to those regions with less information. To achieve this goal it’s possible to remove from the picture the seam with low energy.<br />
A seam is a path of pixel from top to bottom or from left to right, as it’s possible to see in the following picture:<br />
<br />
[[Image:Paesaggioconseam.JPG|center|thumb|An example of vertical connected seam|400px]]<br />
<br />
==='''The Algorithm'''===<br />
<br />
The implemented algorithms use different kind of seam and minimize different measure:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function <br />
* removing a not connected path of pixels (k-seam) minimizing an energy function <br />
* removing a 8-connected path of pixels (1-seam) minimizing the total energy variation in the image <br />
* removing a not connected path of pixels (k-seam) minimizing the total energy variation in the image <br />
<br />
Where k seam are those seam with a maximum disconnection of k pixel. This disconnection is important when in the picture there are many object and it’s important to don’t cut their edges.<br />
<br />
All these algorithms were implemented in Matlab and tested on several pictures (source code is available here: [[Media:Carving.zip|Carving source code]]<br />
). The project follows with a comparative analysis of strength and weakness of each method.<br />
<br />
==='''Conclusion'''===<br />
<br />
From results emerge that the best algorithm is that one working with 1-seam with minimum energy.<br />
<br />
In the following pictures it is possible to see the difference between the result of the retargeting using the best algorithm and the normal resize method (stretching).<br />
<br />
[[Image:ImageContentResizeDelfino.jpg|left|thumb|Original image|325px]]<br />
<br />
[[Image:Delfino22.JPG|left|thumb|Resized image with streching|250px]]<br />
<br />
[[Image:Delfino2 original connected.JPG|left|thumb|Resized image with 1-seam with minumum energy|250px]]<br />
<br />
[[Image:Delfino2 original notconnected.JPG|left|thumb|Resized image with k-seam with minumum energy|250px]]<br />
<br />
[[Image:Delfino2 final connected.JPG|left|thumb|Resized image with 1-seam with minumum energy variation|250px]]</div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=File:Delfino2_final_connected.JPG&diff=3249File:Delfino2 final connected.JPG2008-05-28T13:45:37Z<p>PamelaGotti: </p>
<hr />
<div></div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=Image_retargeting_by_k-seam_removal&diff=3248Image retargeting by k-seam removal2008-05-28T13:45:17Z<p>PamelaGotti: /* '''Conclusion''' */</p>
<hr />
<div>== '''Part 1: project profile''' ==<br />
<br />
=== Project name ===<br />
<br />
Image retargeting by k-seam removal.<br />
<br />
=== Project short description ===<br />
<br />
This project presents a methodology for content aware image resizing based on seam removal. In this work four different approaches were implemented in order to retarget an image:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function<br />
* removing a not connected path of pixels (k-seam) minimizing an energy function<br />
* removing a 8-connected path of pixels (1-seam) minimizing the energy variation in the image<br />
* removing a not connected path of pixels (k-seam) minimizing the energy variation in the image<br />
where k is the maximum disconnect allowed.<br />
<br />
The work ends with a comparison on several test pictures among these algorithms considering the one which gives the best results.<br />
<br />
=== Dates ===<br />
Start date: 2008/01/01<br />
<br />
End date: 2008/06/24<br />
<br />
=== People involved ===<br />
<br />
===== Project head(s) =====<br />
<br />
* V. Caglioti - Vincenzo (dot) Caglioti (at) polimi (dot) it<br />
<br />
===== Other Politecnico di Milano people =====<br />
<br />
* P. Taddei - pierluigi (dot) taddei (at) polimi (dot) it <br />
<br />
===== Students currently working on the project =====<br />
<br />
* Luigi Cardamone - luigi (dot) cardamone (at) mail (dot) polimi (dot) it<br />
<br />
* [[User:PamelaGotti|Pamela Gotti]]<br />
<br />
=== Laboratory work and risk analysis ===<br />
<br />
This project does not include laboratory activities.<br />
<br />
== '''Part 2: project description''' ==<br />
<br />
==='''State of the art'''===<br />
<br />
This project is based on the article ''Seam carving for content-aware image resizing, Avidan, S. and Shamir, A.,International Conference on Computer Graphics and Interactive Techniques, 2007'', in which the author describes content aware image resizing by removal of 8-connected path of pixels.<br />
<br />
==='''The problem'''===<br />
<br />
The normal way of resizing a picture doesn’t take in account it’s content and differs from the resizing of a web page where each object is modified on the basis of its content. So, there is the need for an image resizing that is content aware.<br />
<br />
==='''The Idea'''===<br />
<br />
The idea behind content aware resizing is to treat in a different way the important regions of the image respect to those regions with less information. To achieve this goal it’s possible to remove from the picture the seam with low energy.<br />
A seam is a path of pixel from top to bottom or from left to right, as it’s possible to see in the following picture:<br />
<br />
[[Image:Paesaggioconseam.JPG|center|thumb|An example of vertical connected seam|400px]]<br />
<br />
==='''The Algorithm'''===<br />
<br />
The implemented algorithms use different kind of seam and minimize different measure:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function <br />
* removing a not connected path of pixels (k-seam) minimizing an energy function <br />
* removing a 8-connected path of pixels (1-seam) minimizing the total energy variation in the image <br />
* removing a not connected path of pixels (k-seam) minimizing the total energy variation in the image <br />
<br />
Where k seam are those seam with a maximum disconnection of k pixel. This disconnection is important when in the picture there are many object and it’s important to don’t cut their edges.<br />
<br />
All these algorithms were implemented in Matlab and tested on several pictures (source code is available here: [[Media:Carving.zip|Carving source code]]<br />
). The project follows with a comparative analysis of strength and weakness of each method.<br />
<br />
==='''Conclusion'''===<br />
<br />
From results emerge that the best algorithm is that one working with 1-seam with minimum energy.<br />
<br />
In the following pictures it is possible to see the difference between the result of the retargeting using the best algorithm and the normal resize method (stretching).<br />
<br />
[[Image:ImageContentResizeDelfino.jpg|left|thumb|Original image|325px]]<br />
<br />
[[Image:Delfino22.JPG|left|thumb|Resized image with streching|250px]]<br />
<br />
[[Image:Delfino2 original connected.JPG|left|thumb|Resized image with 1-seam with minumum energy|250px]]<br />
<br />
[[Image:Delfino2 original notconnected.JPG|left|thumb|Resized image with k-seam with minumum energy|250px]]</div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=Image_retargeting_by_k-seam_removal&diff=3247Image retargeting by k-seam removal2008-05-28T13:45:00Z<p>PamelaGotti: /* '''Conclusion''' */</p>
<hr />
<div>== '''Part 1: project profile''' ==<br />
<br />
=== Project name ===<br />
<br />
Image retargeting by k-seam removal.<br />
<br />
=== Project short description ===<br />
<br />
This project presents a methodology for content aware image resizing based on seam removal. In this work four different approaches were implemented in order to retarget an image:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function<br />
* removing a not connected path of pixels (k-seam) minimizing an energy function<br />
* removing a 8-connected path of pixels (1-seam) minimizing the energy variation in the image<br />
* removing a not connected path of pixels (k-seam) minimizing the energy variation in the image<br />
where k is the maximum disconnect allowed.<br />
<br />
The work ends with a comparison on several test pictures among these algorithms considering the one which gives the best results.<br />
<br />
=== Dates ===<br />
Start date: 2008/01/01<br />
<br />
End date: 2008/06/24<br />
<br />
=== People involved ===<br />
<br />
===== Project head(s) =====<br />
<br />
* V. Caglioti - Vincenzo (dot) Caglioti (at) polimi (dot) it<br />
<br />
===== Other Politecnico di Milano people =====<br />
<br />
* P. Taddei - pierluigi (dot) taddei (at) polimi (dot) it <br />
<br />
===== Students currently working on the project =====<br />
<br />
* Luigi Cardamone - luigi (dot) cardamone (at) mail (dot) polimi (dot) it<br />
<br />
* [[User:PamelaGotti|Pamela Gotti]]<br />
<br />
=== Laboratory work and risk analysis ===<br />
<br />
This project does not include laboratory activities.<br />
<br />
== '''Part 2: project description''' ==<br />
<br />
==='''State of the art'''===<br />
<br />
This project is based on the article ''Seam carving for content-aware image resizing, Avidan, S. and Shamir, A.,International Conference on Computer Graphics and Interactive Techniques, 2007'', in which the author describes content aware image resizing by removal of 8-connected path of pixels.<br />
<br />
==='''The problem'''===<br />
<br />
The normal way of resizing a picture doesn’t take in account it’s content and differs from the resizing of a web page where each object is modified on the basis of its content. So, there is the need for an image resizing that is content aware.<br />
<br />
==='''The Idea'''===<br />
<br />
The idea behind content aware resizing is to treat in a different way the important regions of the image respect to those regions with less information. To achieve this goal it’s possible to remove from the picture the seam with low energy.<br />
A seam is a path of pixel from top to bottom or from left to right, as it’s possible to see in the following picture:<br />
<br />
[[Image:Paesaggioconseam.JPG|center|thumb|An example of vertical connected seam|400px]]<br />
<br />
==='''The Algorithm'''===<br />
<br />
The implemented algorithms use different kind of seam and minimize different measure:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function <br />
* removing a not connected path of pixels (k-seam) minimizing an energy function <br />
* removing a 8-connected path of pixels (1-seam) minimizing the total energy variation in the image <br />
* removing a not connected path of pixels (k-seam) minimizing the total energy variation in the image <br />
<br />
Where k seam are those seam with a maximum disconnection of k pixel. This disconnection is important when in the picture there are many object and it’s important to don’t cut their edges.<br />
<br />
All these algorithms were implemented in Matlab and tested on several pictures (source code is available here: [[Media:Carving.zip|Carving source code]]<br />
). The project follows with a comparative analysis of strength and weakness of each method.<br />
<br />
==='''Conclusion'''===<br />
<br />
From results emerge that the best algorithm is that one working with 1-seam with minimum energy.<br />
<br />
In the following pictures it is possible to see the difference between the result of the retargeting using the best algorithm and the normal resize method (stretching).<br />
<br />
[[Image:ImageContentResizeDelfino.jpg|left|thumb|Original image|325px]]<br />
<br />
[[Image:Delfino22.JPG|left|thumb|Resized image with streching|250px]]<br />
<br />
[[Image:Delfino2 original connected.JPG|left|thumb|Resized image with 1-seam with minumum energy|250px]]<br />
<br />
[[Image:Image:Delfino2 original notconnected.JPG|left|thumb|Resized image with k-seam with minumum energy|250px]]</div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=File:Delfino2_original_notconnected.JPG&diff=3246File:Delfino2 original notconnected.JPG2008-05-28T13:43:42Z<p>PamelaGotti: </p>
<hr />
<div></div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=File:Delfino2_energy_original_notconnected.PNG&diff=3245File:Delfino2 energy original notconnected.PNG2008-05-28T13:41:08Z<p>PamelaGotti: </p>
<hr />
<div></div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=Image_retargeting_by_k-seam_removal&diff=3238Image retargeting by k-seam removal2008-05-27T13:53:18Z<p>PamelaGotti: /* '''State of the art''' */</p>
<hr />
<div>== '''Part 1: project profile''' ==<br />
<br />
=== Project name ===<br />
<br />
Image retargeting by k-seam removal.<br />
<br />
=== Project short description ===<br />
<br />
This project presents a methodology for content aware image resizing based on seam removal. In this work four different approaches were implemented in order to retarget an image:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function<br />
* removing a not connected path of pixels (k-seam) minimizing an energy function<br />
* removing a 8-connected path of pixels (1-seam) minimizing the energy variation in the image<br />
* removing a not connected path of pixels (k-seam) minimizing the energy variation in the image<br />
where k is the maximum disconnect allowed.<br />
<br />
The work ends with a comparison on several test pictures among these algorithms considering the one which gives the best results.<br />
<br />
=== Dates ===<br />
Start date: 2008/01/01<br />
<br />
End date: 2008/06/24<br />
<br />
=== People involved ===<br />
<br />
===== Project head(s) =====<br />
<br />
* V. Caglioti - Vincenzo (dot) Caglioti (at) polimi (dot) it<br />
<br />
===== Other Politecnico di Milano people =====<br />
<br />
* P. Taddei - pierluigi (dot) taddei (at) polimi (dot) it <br />
<br />
===== Students currently working on the project =====<br />
<br />
* Luigi Cardamone - luigi (dot) cardamone (at) mail (dot) polimi (dot) it<br />
<br />
* [[User:PamelaGotti|Pamela Gotti]]<br />
<br />
=== Laboratory work and risk analysis ===<br />
<br />
This project does not include laboratory activities.<br />
<br />
== '''Part 2: project description''' ==<br />
<br />
==='''State of the art'''===<br />
<br />
This project is based on the article ''Seam carving for content-aware image resizing, Avidan, S. and Shamir, A.,International Conference on Computer Graphics and Interactive Techniques, 2007'', in which the author describes content aware image resizing by removal of 8-connected path of pixels.<br />
<br />
==='''The problem'''===<br />
<br />
The normal way of resizing a picture doesn’t take in account it’s content and differs from the resizing of a web page where each object is modified on the basis of its content. So, there is the need for an image resizing that is content aware.<br />
<br />
==='''The Idea'''===<br />
<br />
The idea behind content aware resizing is to treat in a different way the important regions of the image respect to those regions with less information. To achieve this goal it’s possible to remove from the picture the seam with low energy.<br />
A seam is a path of pixel from top to bottom or from left to right, as it’s possible to see in the following picture:<br />
<br />
[[Image:Paesaggioconseam.JPG|center|thumb|An example of vertical connected seam|400px]]<br />
<br />
==='''The Algorithm'''===<br />
<br />
The implemented algorithms use different kind of seam and minimize different measure:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function <br />
* removing a not connected path of pixels (k-seam) minimizing an energy function <br />
* removing a 8-connected path of pixels (1-seam) minimizing the total energy variation in the image <br />
* removing a not connected path of pixels (k-seam) minimizing the total energy variation in the image <br />
<br />
Where k seam are those seam with a maximum disconnection of k pixel. This disconnection is important when in the picture there are many object and it’s important to don’t cut their edges.<br />
<br />
All these algorithms were implemented in Matlab and tested on several pictures (source code is available here: [[Media:Carving.zip|Carving source code]]<br />
). The project follows with a comparative analysis of strength and weakness of each method.<br />
<br />
==='''Conclusion'''===<br />
<br />
From results emerge that the best algorithm is that one working with 1-seam with minimum energy.<br />
<br />
In the following pictures it is possible to see the difference between the result of the retargeting using the best algorithm and the normal resize method (stretching).<br />
<br />
[[Image:ImageContentResizeDelfino.jpg|left|thumb|Original image|325px]]<br />
<br />
[[Image:Delfino22.JPG|left|thumb|Resized image with streching|250px]]<br />
<br />
[[Image:Delfino2 original connected.JPG|left|thumb|Resized image with 1-seam with minumum energy|250px]]</div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=Image_retargeting_by_k-seam_removal&diff=3237Image retargeting by k-seam removal2008-05-27T13:52:45Z<p>PamelaGotti: /* '''State of the art''' */</p>
<hr />
<div>== '''Part 1: project profile''' ==<br />
<br />
=== Project name ===<br />
<br />
Image retargeting by k-seam removal.<br />
<br />
=== Project short description ===<br />
<br />
This project presents a methodology for content aware image resizing based on seam removal. In this work four different approaches were implemented in order to retarget an image:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function<br />
* removing a not connected path of pixels (k-seam) minimizing an energy function<br />
* removing a 8-connected path of pixels (1-seam) minimizing the energy variation in the image<br />
* removing a not connected path of pixels (k-seam) minimizing the energy variation in the image<br />
where k is the maximum disconnect allowed.<br />
<br />
The work ends with a comparison on several test pictures among these algorithms considering the one which gives the best results.<br />
<br />
=== Dates ===<br />
Start date: 2008/01/01<br />
<br />
End date: 2008/06/24<br />
<br />
=== People involved ===<br />
<br />
===== Project head(s) =====<br />
<br />
* V. Caglioti - Vincenzo (dot) Caglioti (at) polimi (dot) it<br />
<br />
===== Other Politecnico di Milano people =====<br />
<br />
* P. Taddei - pierluigi (dot) taddei (at) polimi (dot) it <br />
<br />
===== Students currently working on the project =====<br />
<br />
* Luigi Cardamone - luigi (dot) cardamone (at) mail (dot) polimi (dot) it<br />
<br />
* [[User:PamelaGotti|Pamela Gotti]]<br />
<br />
=== Laboratory work and risk analysis ===<br />
<br />
This project does not include laboratory activities.<br />
<br />
== '''Part 2: project description''' ==<br />
<br />
==='''State of the art'''===<br />
<br />
This project is based on the article ''Seam carving for content-aware image resizing, Avidan, S. and Shamir,<br />
A., International Conference on Computer Graphics and Interactive<br />
Techniques, 2007'', in which the author describes content aware image resizing by removal of 8-connected path of pixels.<br />
<br />
==='''The problem'''===<br />
<br />
The normal way of resizing a picture doesn’t take in account it’s content and differs from the resizing of a web page where each object is modified on the basis of its content. So, there is the need for an image resizing that is content aware.<br />
<br />
==='''The Idea'''===<br />
<br />
The idea behind content aware resizing is to treat in a different way the important regions of the image respect to those regions with less information. To achieve this goal it’s possible to remove from the picture the seam with low energy.<br />
A seam is a path of pixel from top to bottom or from left to right, as it’s possible to see in the following picture:<br />
<br />
[[Image:Paesaggioconseam.JPG|center|thumb|An example of vertical connected seam|400px]]<br />
<br />
==='''The Algorithm'''===<br />
<br />
The implemented algorithms use different kind of seam and minimize different measure:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function <br />
* removing a not connected path of pixels (k-seam) minimizing an energy function <br />
* removing a 8-connected path of pixels (1-seam) minimizing the total energy variation in the image <br />
* removing a not connected path of pixels (k-seam) minimizing the total energy variation in the image <br />
<br />
Where k seam are those seam with a maximum disconnection of k pixel. This disconnection is important when in the picture there are many object and it’s important to don’t cut their edges.<br />
<br />
All these algorithms were implemented in Matlab and tested on several pictures (source code is available here: [[Media:Carving.zip|Carving source code]]<br />
). The project follows with a comparative analysis of strength and weakness of each method.<br />
<br />
==='''Conclusion'''===<br />
<br />
From results emerge that the best algorithm is that one working with 1-seam with minimum energy.<br />
<br />
In the following pictures it is possible to see the difference between the result of the retargeting using the best algorithm and the normal resize method (stretching).<br />
<br />
[[Image:ImageContentResizeDelfino.jpg|left|thumb|Original image|325px]]<br />
<br />
[[Image:Delfino22.JPG|left|thumb|Resized image with streching|250px]]<br />
<br />
[[Image:Delfino2 original connected.JPG|left|thumb|Resized image with 1-seam with minumum energy|250px]]</div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=Projects&diff=3236Projects2008-05-27T12:24:44Z<p>PamelaGotti: /* Computer Vision and Image Analysis */</p>
<hr />
<div>''This page is a repository of links to the pages describing the '''projects''' we are currently working on at AIRLab. <br />
See the list of our finished projects on the [[Finished Projects]] page.''<br />
<br />
== Ongoing projects ==<br />
''by research area (areas are defined in the [[Main Page]]); for each project a name and a link to its AIRWiki page is given''<br />
<br />
==== [[Agents, Multiagent Systems, Agencies]] ====<br />
----<br />
<br />
* [[Multiagent cooperation|Multiagent cooperating system]]<br />
<br />
* [[Planning in Ambient Intelligence scenarios| Planning in Ambient Intelligence scenarios]]<br />
<br />
==== [[BioSignal Analysis]] ====<br />
----<br />
====== [[Affective Computing]] ======<br />
<br />
* [[Relatioship between Cognition and Emotion in Rehabilitation Robotics]]<br />
* [[Driving companions]]<br />
* [[Emotion from Interaction]]<br />
* [[Affective Devices]]<br />
<br />
====== [[Brain Computer Interface]] ======<br />
<br />
* [[Command wheelchair using BCI2000]]<br />
* [[BCI based on Motor Imagery]]<br />
* [[Graphical user interface for an autonomous wheelchair]]<br />
<br />
====== [[Automatic Detection Of Sleep Stages]] ======<br />
<br />
* [[Sleep Staging with HMM]]<br />
<br />
====== [[Analysis of the Olfactory Signal]] ======<br />
<br />
* [[Lung Cancer Detection by an Electronic Nose]]<br />
* [[HE-KNOWS - An electronic nose]]<br />
<br />
==== [[Computer Vision and Image Analysis]] ====<br />
----<br />
<br />
* [[Automated extraction of laser streaks and range profiles]]<br />
<br />
* [[Data collection for mutual calibration|Data collection for laser-rangefinder and camera calibration]]<br />
<br />
* [[Image retargeting by k-seam removal]]<br />
<br />
* [[Particle filter for object tracking]]<br />
<br />
* [[Wii Remote headtracking and active projector]]<br />
<br />
==== [[Machine Learning]] ====<br />
----<br />
* [[Adaptive Reinforcement Learning Multiagent Coordination in Real-Time Computer Games|Adaptive Reinforcement Learning Multiagent Coordination in Real-Time Computer Games]]<br />
<br />
==== [[Ontologies and Semantic Web]] ====<br />
----<br />
* [[JOFS|JOFS, Java Owl File Storage]]<br />
* [[FolksOnt|FolksOnt]]<br />
* [[Extending a wiki with semantic templates]]<br />
* [[GeoOntology|Geographic ontology for a semantic wiki]]<br />
<br />
==== [[Philosophy of Artificial Intelligence]] ====<br />
----<br />
==== [[Robotics]] ====<br />
----<br />
* [[LURCH - The autonomous wheelchair]]<br />
<br />
* [[Rawseeds|RAWSEEDS]]<br />
<br />
* [[Balancing robots: Tilty, TiltOne]]<br />
<br />
* [[ROBOWII ]]<br />
<br />
* [[PoliManus]]<br />
<br />
* [[ZOIDBERG - An autonomous bio-inspired RoboFish]]<br />
<br />
* [[Styx The 6 Whegs Robot]]<br />
<br />
* [[PolyGlove: a body-based haptic interface]]<br />
<br />
==== [[Soft Computing]] ====<br />
----<br />
<br />
<br />
<br />
== Note for students ==<br />
<br />
If you are a student and there isn't a '''page describing your project''', this is because YOU have the task of creating it and populating it with (meaningful) content. If you are a student and there IS a page describing your project, you have the task to complete that page with (useful and comprehensive) information about your own contribution to the project. Be aware that the quality of your work (or lack of it) on the AIRWiki will be evaluated by the Teachers and will influence your grades.<br />
<br />
Instructions to add a new project or to add content to an existing project page are available at [[Projects - HOWTO]].</div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=Image_retargeting_by_k-seam_removal&diff=3234Image retargeting by k-seam removal2008-05-27T12:24:25Z<p>PamelaGotti: Image Retargeting by k-seam removal moved to Image retargeting by k-seam removal</p>
<hr />
<div>== '''Part 1: project profile''' ==<br />
<br />
=== Project name ===<br />
<br />
Image retargeting by k-seam removal.<br />
<br />
=== Project short description ===<br />
<br />
This project presents a methodology for content aware image resizing based on seam removal. In this work four different approaches were implemented in order to retarget an image:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function<br />
* removing a not connected path of pixels (k-seam) minimizing an energy function<br />
* removing a 8-connected path of pixels (1-seam) minimizing the energy variation in the image<br />
* removing a not connected path of pixels (k-seam) minimizing the energy variation in the image<br />
where k is the maximum disconnect allowed.<br />
<br />
The work ends with a comparison on several test pictures among these algorithms considering the one which gives the best results.<br />
<br />
=== Dates ===<br />
Start date: 2008/01/01<br />
<br />
End date: 2008/06/24<br />
<br />
=== People involved ===<br />
<br />
===== Project head(s) =====<br />
<br />
* V. Caglioti - Vincenzo (dot) Caglioti (at) polimi (dot) it<br />
<br />
===== Other Politecnico di Milano people =====<br />
<br />
* P. Taddei - pierluigi (dot) taddei (at) polimi (dot) it <br />
<br />
===== Students currently working on the project =====<br />
<br />
* Luigi Cardamone - luigi (dot) cardamone (at) mail (dot) polimi (dot) it<br />
<br />
* [[User:PamelaGotti|Pamela Gotti]]<br />
<br />
=== Laboratory work and risk analysis ===<br />
<br />
This project does not include laboratory activities.<br />
<br />
== '''Part 2: project description''' ==<br />
<br />
==='''State of the art'''===<br />
<br />
This project is based on the article ''Shai Avidan, Ariel Shamir, Seam Carving for Content-Aware Image Resizing, ACM SIGPLAN, 1994'', in which the author describes content aware image resizing by removal of 8-connected path of pixels.<br />
<br />
==='''The problem'''===<br />
<br />
The normal way of resizing a picture doesn’t take in account it’s content and differs from the resizing of a web page where each object is modified on the basis of its content. So, there is the need for an image resizing that is content aware.<br />
<br />
==='''The Idea'''===<br />
<br />
The idea behind content aware resizing is to treat in a different way the important regions of the image respect to those regions with less information. To achieve this goal it’s possible to remove from the picture the seam with low energy.<br />
A seam is a path of pixel from top to bottom or from left to right, as it’s possible to see in the following picture:<br />
<br />
[[Image:Paesaggioconseam.JPG|center|thumb|An example of vertical connected seam|400px]]<br />
<br />
==='''The Algorithm'''===<br />
<br />
The implemented algorithms use different kind of seam and minimize different measure:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function <br />
* removing a not connected path of pixels (k-seam) minimizing an energy function <br />
* removing a 8-connected path of pixels (1-seam) minimizing the total energy variation in the image <br />
* removing a not connected path of pixels (k-seam) minimizing the total energy variation in the image <br />
<br />
Where k seam are those seam with a maximum disconnection of k pixel. This disconnection is important when in the picture there are many object and it’s important to don’t cut their edges.<br />
<br />
All these algorithms were implemented in Matlab and tested on several pictures (source code is available here: [[Media:Carving.zip|Carving source code]]<br />
). The project follows with a comparative analysis of strength and weakness of each method.<br />
<br />
==='''Conclusion'''===<br />
<br />
From results emerge that the best algorithm is that one working with 1-seam with minimum energy.<br />
<br />
In the following pictures it is possible to see the difference between the result of the retargeting using the best algorithm and the normal resize method (stretching).<br />
<br />
[[Image:ImageContentResizeDelfino.jpg|left|thumb|Original image|325px]]<br />
<br />
[[Image:Delfino22.JPG|left|thumb|Resized image with streching|250px]]<br />
<br />
[[Image:Delfino2 original connected.JPG|left|thumb|Resized image with 1-seam with minumum energy|250px]]</div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=Image_Retargeting_by_k-seam_removal&diff=3235Image Retargeting by k-seam removal2008-05-27T12:24:25Z<p>PamelaGotti: Image Retargeting by k-seam removal moved to Image retargeting by k-seam removal</p>
<hr />
<div>#REDIRECT [[Image retargeting by k-seam removal]]</div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=Image_retargeting_by_k-seam_removal&diff=3233Image retargeting by k-seam removal2008-05-27T12:20:33Z<p>PamelaGotti: /* '''The Algorithm''' */</p>
<hr />
<div>== '''Part 1: project profile''' ==<br />
<br />
=== Project name ===<br />
<br />
Image retargeting by k-seam removal.<br />
<br />
=== Project short description ===<br />
<br />
This project presents a methodology for content aware image resizing based on seam removal. In this work four different approaches were implemented in order to retarget an image:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function<br />
* removing a not connected path of pixels (k-seam) minimizing an energy function<br />
* removing a 8-connected path of pixels (1-seam) minimizing the energy variation in the image<br />
* removing a not connected path of pixels (k-seam) minimizing the energy variation in the image<br />
where k is the maximum disconnect allowed.<br />
<br />
The work ends with a comparison on several test pictures among these algorithms considering the one which gives the best results.<br />
<br />
=== Dates ===<br />
Start date: 2008/01/01<br />
<br />
End date: 2008/06/24<br />
<br />
=== People involved ===<br />
<br />
===== Project head(s) =====<br />
<br />
* V. Caglioti - Vincenzo (dot) Caglioti (at) polimi (dot) it<br />
<br />
===== Other Politecnico di Milano people =====<br />
<br />
* P. Taddei - pierluigi (dot) taddei (at) polimi (dot) it <br />
<br />
===== Students currently working on the project =====<br />
<br />
* Luigi Cardamone - luigi (dot) cardamone (at) mail (dot) polimi (dot) it<br />
<br />
* [[User:PamelaGotti|Pamela Gotti]]<br />
<br />
=== Laboratory work and risk analysis ===<br />
<br />
This project does not include laboratory activities.<br />
<br />
== '''Part 2: project description''' ==<br />
<br />
==='''State of the art'''===<br />
<br />
This project is based on the article ''Shai Avidan, Ariel Shamir, Seam Carving for Content-Aware Image Resizing, ACM SIGPLAN, 1994'', in which the author describes content aware image resizing by removal of 8-connected path of pixels.<br />
<br />
==='''The problem'''===<br />
<br />
The normal way of resizing a picture doesn’t take in account it’s content and differs from the resizing of a web page where each object is modified on the basis of its content. So, there is the need for an image resizing that is content aware.<br />
<br />
==='''The Idea'''===<br />
<br />
The idea behind content aware resizing is to treat in a different way the important regions of the image respect to those regions with less information. To achieve this goal it’s possible to remove from the picture the seam with low energy.<br />
A seam is a path of pixel from top to bottom or from left to right, as it’s possible to see in the following picture:<br />
<br />
[[Image:Paesaggioconseam.JPG|center|thumb|An example of vertical connected seam|400px]]<br />
<br />
==='''The Algorithm'''===<br />
<br />
The implemented algorithms use different kind of seam and minimize different measure:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function <br />
* removing a not connected path of pixels (k-seam) minimizing an energy function <br />
* removing a 8-connected path of pixels (1-seam) minimizing the total energy variation in the image <br />
* removing a not connected path of pixels (k-seam) minimizing the total energy variation in the image <br />
<br />
Where k seam are those seam with a maximum disconnection of k pixel. This disconnection is important when in the picture there are many object and it’s important to don’t cut their edges.<br />
<br />
All these algorithms were implemented in Matlab and tested on several pictures (source code is available here: [[Media:Carving.zip|Carving source code]]<br />
). The project follows with a comparative analysis of strength and weakness of each method.<br />
<br />
==='''Conclusion'''===<br />
<br />
From results emerge that the best algorithm is that one working with 1-seam with minimum energy.<br />
<br />
In the following pictures it is possible to see the difference between the result of the retargeting using the best algorithm and the normal resize method (stretching).<br />
<br />
[[Image:ImageContentResizeDelfino.jpg|left|thumb|Original image|325px]]<br />
<br />
[[Image:Delfino22.JPG|left|thumb|Resized image with streching|250px]]<br />
<br />
[[Image:Delfino2 original connected.JPG|left|thumb|Resized image with 1-seam with minumum energy|250px]]</div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=Image_retargeting_by_k-seam_removal&diff=3232Image retargeting by k-seam removal2008-05-27T12:20:10Z<p>PamelaGotti: /* '''The problem''' */</p>
<hr />
<div>== '''Part 1: project profile''' ==<br />
<br />
=== Project name ===<br />
<br />
Image retargeting by k-seam removal.<br />
<br />
=== Project short description ===<br />
<br />
This project presents a methodology for content aware image resizing based on seam removal. In this work four different approaches were implemented in order to retarget an image:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function<br />
* removing a not connected path of pixels (k-seam) minimizing an energy function<br />
* removing a 8-connected path of pixels (1-seam) minimizing the energy variation in the image<br />
* removing a not connected path of pixels (k-seam) minimizing the energy variation in the image<br />
where k is the maximum disconnect allowed.<br />
<br />
The work ends with a comparison on several test pictures among these algorithms considering the one which gives the best results.<br />
<br />
=== Dates ===<br />
Start date: 2008/01/01<br />
<br />
End date: 2008/06/24<br />
<br />
=== People involved ===<br />
<br />
===== Project head(s) =====<br />
<br />
* V. Caglioti - Vincenzo (dot) Caglioti (at) polimi (dot) it<br />
<br />
===== Other Politecnico di Milano people =====<br />
<br />
* P. Taddei - pierluigi (dot) taddei (at) polimi (dot) it <br />
<br />
===== Students currently working on the project =====<br />
<br />
* Luigi Cardamone - luigi (dot) cardamone (at) mail (dot) polimi (dot) it<br />
<br />
* [[User:PamelaGotti|Pamela Gotti]]<br />
<br />
=== Laboratory work and risk analysis ===<br />
<br />
This project does not include laboratory activities.<br />
<br />
== '''Part 2: project description''' ==<br />
<br />
==='''State of the art'''===<br />
<br />
This project is based on the article ''Shai Avidan, Ariel Shamir, Seam Carving for Content-Aware Image Resizing, ACM SIGPLAN, 1994'', in which the author describes content aware image resizing by removal of 8-connected path of pixels.<br />
<br />
==='''The problem'''===<br />
<br />
The normal way of resizing a picture doesn’t take in account it’s content and differs from the resizing of a web page where each object is modified on the basis of its content. So, there is the need for an image resizing that is content aware.<br />
<br />
==='''The Idea'''===<br />
<br />
The idea behind content aware resizing is to treat in a different way the important regions of the image respect to those regions with less information. To achieve this goal it’s possible to remove from the picture the seam with low energy.<br />
A seam is a path of pixel from top to bottom or from left to right, as it’s possible to see in the following picture:<br />
<br />
[[Image:Paesaggioconseam.JPG|center|thumb|An example of vertical connected seam|400px]]<br />
<br />
==='''The Algorithm'''===<br />
<br />
The implemented algorithm uses different kind of seam and minimize different measure:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function <br />
* removing a not connected path of pixels (k-seam) minimizing an energy function <br />
* removing a 8-connected path of pixels (1-seam) minimizing the total energy variation in the image <br />
* removing a not connected path of pixels (k-seam) minimizing the total energy variation in the image <br />
<br />
Where k seam are those seam with a maximum disconnection of k pixel. This disconnection is important when in the picture there are many object and it’s important to don’t cut their edges.<br />
<br />
All these algorithms were implemented in Matlab and tested on several pictures (source code is available here: [[Media:Carving.zip|Carving source code]]<br />
). The project follows with a comparative analysis of strength and weakness of each method.<br />
<br />
==='''Conclusion'''===<br />
<br />
From results emerge that the best algorithm is that one working with 1-seam with minimum energy.<br />
<br />
In the following pictures it is possible to see the difference between the result of the retargeting using the best algorithm and the normal resize method (stretching).<br />
<br />
[[Image:ImageContentResizeDelfino.jpg|left|thumb|Original image|325px]]<br />
<br />
[[Image:Delfino22.JPG|left|thumb|Resized image with streching|250px]]<br />
<br />
[[Image:Delfino2 original connected.JPG|left|thumb|Resized image with 1-seam with minumum energy|250px]]</div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=Image_retargeting_by_k-seam_removal&diff=3231Image retargeting by k-seam removal2008-05-27T12:19:32Z<p>PamelaGotti: /* '''The Idea''' */</p>
<hr />
<div>== '''Part 1: project profile''' ==<br />
<br />
=== Project name ===<br />
<br />
Image retargeting by k-seam removal.<br />
<br />
=== Project short description ===<br />
<br />
This project presents a methodology for content aware image resizing based on seam removal. In this work four different approaches were implemented in order to retarget an image:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function<br />
* removing a not connected path of pixels (k-seam) minimizing an energy function<br />
* removing a 8-connected path of pixels (1-seam) minimizing the energy variation in the image<br />
* removing a not connected path of pixels (k-seam) minimizing the energy variation in the image<br />
where k is the maximum disconnect allowed.<br />
<br />
The work ends with a comparison on several test pictures among these algorithms considering the one which gives the best results.<br />
<br />
=== Dates ===<br />
Start date: 2008/01/01<br />
<br />
End date: 2008/06/24<br />
<br />
=== People involved ===<br />
<br />
===== Project head(s) =====<br />
<br />
* V. Caglioti - Vincenzo (dot) Caglioti (at) polimi (dot) it<br />
<br />
===== Other Politecnico di Milano people =====<br />
<br />
* P. Taddei - pierluigi (dot) taddei (at) polimi (dot) it <br />
<br />
===== Students currently working on the project =====<br />
<br />
* Luigi Cardamone - luigi (dot) cardamone (at) mail (dot) polimi (dot) it<br />
<br />
* [[User:PamelaGotti|Pamela Gotti]]<br />
<br />
=== Laboratory work and risk analysis ===<br />
<br />
This project does not include laboratory activities.<br />
<br />
== '''Part 2: project description''' ==<br />
<br />
==='''State of the art'''===<br />
<br />
This project is based on the article ''Shai Avidan, Ariel Shamir, Seam Carving for Content-Aware Image Resizing, ACM SIGPLAN, 1994'', in which the author describes content aware image resizing by removal of 8-connected path of pixels.<br />
<br />
==='''The problem'''===<br />
<br />
The normal way of resizing a picture doesn’t take in account it’s content and differs from the resizing of a web pages where each object is modified on the basis of its content. So, there is the need for an image resizing that is content aware.<br />
<br />
==='''The Idea'''===<br />
<br />
The idea behind content aware resizing is to treat in a different way the important regions of the image respect to those regions with less information. To achieve this goal it’s possible to remove from the picture the seam with low energy.<br />
A seam is a path of pixel from top to bottom or from left to right, as it’s possible to see in the following picture:<br />
<br />
[[Image:Paesaggioconseam.JPG|center|thumb|An example of vertical connected seam|400px]]<br />
<br />
==='''The Algorithm'''===<br />
<br />
The implemented algorithm uses different kind of seam and minimize different measure:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function <br />
* removing a not connected path of pixels (k-seam) minimizing an energy function <br />
* removing a 8-connected path of pixels (1-seam) minimizing the total energy variation in the image <br />
* removing a not connected path of pixels (k-seam) minimizing the total energy variation in the image <br />
<br />
Where k seam are those seam with a maximum disconnection of k pixel. This disconnection is important when in the picture there are many object and it’s important to don’t cut their edges.<br />
<br />
All these algorithms were implemented in Matlab and tested on several pictures (source code is available here: [[Media:Carving.zip|Carving source code]]<br />
). The project follows with a comparative analysis of strength and weakness of each method.<br />
<br />
==='''Conclusion'''===<br />
<br />
From results emerge that the best algorithm is that one working with 1-seam with minimum energy.<br />
<br />
In the following pictures it is possible to see the difference between the result of the retargeting using the best algorithm and the normal resize method (stretching).<br />
<br />
[[Image:ImageContentResizeDelfino.jpg|left|thumb|Original image|325px]]<br />
<br />
[[Image:Delfino22.JPG|left|thumb|Resized image with streching|250px]]<br />
<br />
[[Image:Delfino2 original connected.JPG|left|thumb|Resized image with 1-seam with minumum energy|250px]]</div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=Image_retargeting_by_k-seam_removal&diff=3230Image retargeting by k-seam removal2008-05-27T12:19:19Z<p>PamelaGotti: /* '''Conclusion''' */</p>
<hr />
<div>== '''Part 1: project profile''' ==<br />
<br />
=== Project name ===<br />
<br />
Image retargeting by k-seam removal.<br />
<br />
=== Project short description ===<br />
<br />
This project presents a methodology for content aware image resizing based on seam removal. In this work four different approaches were implemented in order to retarget an image:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function<br />
* removing a not connected path of pixels (k-seam) minimizing an energy function<br />
* removing a 8-connected path of pixels (1-seam) minimizing the energy variation in the image<br />
* removing a not connected path of pixels (k-seam) minimizing the energy variation in the image<br />
where k is the maximum disconnect allowed.<br />
<br />
The work ends with a comparison on several test pictures among these algorithms considering the one which gives the best results.<br />
<br />
=== Dates ===<br />
Start date: 2008/01/01<br />
<br />
End date: 2008/06/24<br />
<br />
=== People involved ===<br />
<br />
===== Project head(s) =====<br />
<br />
* V. Caglioti - Vincenzo (dot) Caglioti (at) polimi (dot) it<br />
<br />
===== Other Politecnico di Milano people =====<br />
<br />
* P. Taddei - pierluigi (dot) taddei (at) polimi (dot) it <br />
<br />
===== Students currently working on the project =====<br />
<br />
* Luigi Cardamone - luigi (dot) cardamone (at) mail (dot) polimi (dot) it<br />
<br />
* [[User:PamelaGotti|Pamela Gotti]]<br />
<br />
=== Laboratory work and risk analysis ===<br />
<br />
This project does not include laboratory activities.<br />
<br />
== '''Part 2: project description''' ==<br />
<br />
==='''State of the art'''===<br />
<br />
This project is based on the article ''Shai Avidan, Ariel Shamir, Seam Carving for Content-Aware Image Resizing, ACM SIGPLAN, 1994'', in which the author describes content aware image resizing by removal of 8-connected path of pixels.<br />
<br />
==='''The problem'''===<br />
<br />
The normal way of resizing a picture doesn’t take in account it’s content and differs from the resizing of a web pages where each object is modified on the basis of its content. So, there is the need for an image resizing that is content aware.<br />
<br />
==='''The Idea'''===<br />
<br />
The idea behind content aware resizing is to treat in a different way the important region of the image respect to those regions with less information. To achieve this goal it’s possible to remove from the picture the seam with low energy.<br />
A seam is a path of pixel from top to bottom or from left to right, as it’s possible to see in the following picture:<br />
<br />
[[Image:Paesaggioconseam.JPG|center|thumb|An example of vertical connected seam|400px]]<br />
<br />
==='''The Algorithm'''===<br />
<br />
The implemented algorithm uses different kind of seam and minimize different measure:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function <br />
* removing a not connected path of pixels (k-seam) minimizing an energy function <br />
* removing a 8-connected path of pixels (1-seam) minimizing the total energy variation in the image <br />
* removing a not connected path of pixels (k-seam) minimizing the total energy variation in the image <br />
<br />
Where k seam are those seam with a maximum disconnection of k pixel. This disconnection is important when in the picture there are many object and it’s important to don’t cut their edges.<br />
<br />
All these algorithms were implemented in Matlab and tested on several pictures (source code is available here: [[Media:Carving.zip|Carving source code]]<br />
). The project follows with a comparative analysis of strength and weakness of each method.<br />
<br />
==='''Conclusion'''===<br />
<br />
From results emerge that the best algorithm is that one working with 1-seam with minimum energy.<br />
<br />
In the following pictures it is possible to see the difference between the result of the retargeting using the best algorithm and the normal resize method (stretching).<br />
<br />
[[Image:ImageContentResizeDelfino.jpg|left|thumb|Original image|325px]]<br />
<br />
[[Image:Delfino22.JPG|left|thumb|Resized image with streching|250px]]<br />
<br />
[[Image:Delfino2 original connected.JPG|left|thumb|Resized image with 1-seam with minumum energy|250px]]</div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=Projects&diff=3229Projects2008-05-27T12:18:48Z<p>PamelaGotti: /* Computer Vision and Image Analysis */</p>
<hr />
<div>''This page is a repository of links to the pages describing the '''projects''' we are currently working on at AIRLab. <br />
See the list of our finished projects on the [[Finished Projects]] page.''<br />
<br />
== Ongoing projects ==<br />
''by research area (areas are defined in the [[Main Page]]); for each project a name and a link to its AIRWiki page is given''<br />
<br />
==== [[Agents, Multiagent Systems, Agencies]] ====<br />
----<br />
<br />
* [[Multiagent cooperation|Multiagent cooperating system]]<br />
<br />
* [[Planning in Ambient Intelligence scenarios| Planning in Ambient Intelligence scenarios]]<br />
<br />
==== [[BioSignal Analysis]] ====<br />
----<br />
====== [[Affective Computing]] ======<br />
<br />
* [[Relatioship between Cognition and Emotion in Rehabilitation Robotics]]<br />
* [[Driving companions]]<br />
* [[Emotion from Interaction]]<br />
* [[Affective Devices]]<br />
<br />
====== [[Brain Computer Interface]] ======<br />
<br />
* [[Command wheelchair using BCI2000]]<br />
* [[BCI based on Motor Imagery]]<br />
* [[Graphical user interface for an autonomous wheelchair]]<br />
<br />
====== [[Automatic Detection Of Sleep Stages]] ======<br />
<br />
* [[Sleep Staging with HMM]]<br />
<br />
====== [[Analysis of the Olfactory Signal]] ======<br />
<br />
* [[Lung Cancer Detection by an Electronic Nose]]<br />
* [[HE-KNOWS - An electronic nose]]<br />
<br />
==== [[Computer Vision and Image Analysis]] ====<br />
----<br />
<br />
* [[Automated extraction of laser streaks and range profiles]]<br />
<br />
* [[Data collection for mutual calibration|Data collection for laser-rangefinder and camera calibration]]<br />
<br />
* [[Image Retargeting by k-seam removal]]<br />
<br />
* [[Particle filter for object tracking]]<br />
<br />
* [[Wii Remote headtracking and active projector]]<br />
<br />
==== [[Machine Learning]] ====<br />
----<br />
* [[Adaptive Reinforcement Learning Multiagent Coordination in Real-Time Computer Games|Adaptive Reinforcement Learning Multiagent Coordination in Real-Time Computer Games]]<br />
<br />
==== [[Ontologies and Semantic Web]] ====<br />
----<br />
* [[JOFS|JOFS, Java Owl File Storage]]<br />
* [[FolksOnt|FolksOnt]]<br />
* [[Extending a wiki with semantic templates]]<br />
* [[GeoOntology|Geographic ontology for a semantic wiki]]<br />
<br />
==== [[Philosophy of Artificial Intelligence]] ====<br />
----<br />
==== [[Robotics]] ====<br />
----<br />
* [[LURCH - The autonomous wheelchair]]<br />
<br />
* [[Rawseeds|RAWSEEDS]]<br />
<br />
* [[Balancing robots: Tilty, TiltOne]]<br />
<br />
* [[ROBOWII ]]<br />
<br />
* [[PoliManus]]<br />
<br />
* [[ZOIDBERG - An autonomous bio-inspired RoboFish]]<br />
<br />
* [[Styx The 6 Whegs Robot]]<br />
<br />
* [[PolyGlove: a body-based haptic interface]]<br />
<br />
==== [[Soft Computing]] ====<br />
----<br />
<br />
<br />
<br />
== Note for students ==<br />
<br />
If you are a student and there isn't a '''page describing your project''', this is because YOU have the task of creating it and populating it with (meaningful) content. If you are a student and there IS a page describing your project, you have the task to complete that page with (useful and comprehensive) information about your own contribution to the project. Be aware that the quality of your work (or lack of it) on the AIRWiki will be evaluated by the Teachers and will influence your grades.<br />
<br />
Instructions to add a new project or to add content to an existing project page are available at [[Projects - HOWTO]].</div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=Projects&diff=3228Projects2008-05-27T12:18:29Z<p>PamelaGotti: /* Computer Vision and Image Analysis */</p>
<hr />
<div>''This page is a repository of links to the pages describing the '''projects''' we are currently working on at AIRLab. <br />
See the list of our finished projects on the [[Finished Projects]] page.''<br />
<br />
== Ongoing projects ==<br />
''by research area (areas are defined in the [[Main Page]]); for each project a name and a link to its AIRWiki page is given''<br />
<br />
==== [[Agents, Multiagent Systems, Agencies]] ====<br />
----<br />
<br />
* [[Multiagent cooperation|Multiagent cooperating system]]<br />
<br />
* [[Planning in Ambient Intelligence scenarios| Planning in Ambient Intelligence scenarios]]<br />
<br />
==== [[BioSignal Analysis]] ====<br />
----<br />
====== [[Affective Computing]] ======<br />
<br />
* [[Relatioship between Cognition and Emotion in Rehabilitation Robotics]]<br />
* [[Driving companions]]<br />
* [[Emotion from Interaction]]<br />
* [[Affective Devices]]<br />
<br />
====== [[Brain Computer Interface]] ======<br />
<br />
* [[Command wheelchair using BCI2000]]<br />
* [[BCI based on Motor Imagery]]<br />
* [[Graphical user interface for an autonomous wheelchair]]<br />
<br />
====== [[Automatic Detection Of Sleep Stages]] ======<br />
<br />
* [[Sleep Staging with HMM]]<br />
<br />
====== [[Analysis of the Olfactory Signal]] ======<br />
<br />
* [[Lung Cancer Detection by an Electronic Nose]]<br />
* [[HE-KNOWS - An electronic nose]]<br />
<br />
==== [[Computer Vision and Image Analysis]] ====<br />
----<br />
<br />
* [[Automated extraction of laser streaks and range profiles]]<br />
<br />
* [[Data collection for mutual calibration|Data collection for laser-rangefinder and camera calibration]]<br />
<br />
* [[Image retargeting by k-seam removal]]<br />
<br />
* [[Particle filter for object tracking]]<br />
<br />
* [[Wii Remote headtracking and active projector]]<br />
<br />
==== [[Machine Learning]] ====<br />
----<br />
* [[Adaptive Reinforcement Learning Multiagent Coordination in Real-Time Computer Games|Adaptive Reinforcement Learning Multiagent Coordination in Real-Time Computer Games]]<br />
<br />
==== [[Ontologies and Semantic Web]] ====<br />
----<br />
* [[JOFS|JOFS, Java Owl File Storage]]<br />
* [[FolksOnt|FolksOnt]]<br />
* [[Extending a wiki with semantic templates]]<br />
* [[GeoOntology|Geographic ontology for a semantic wiki]]<br />
<br />
==== [[Philosophy of Artificial Intelligence]] ====<br />
----<br />
==== [[Robotics]] ====<br />
----<br />
* [[LURCH - The autonomous wheelchair]]<br />
<br />
* [[Rawseeds|RAWSEEDS]]<br />
<br />
* [[Balancing robots: Tilty, TiltOne]]<br />
<br />
* [[ROBOWII ]]<br />
<br />
* [[PoliManus]]<br />
<br />
* [[ZOIDBERG - An autonomous bio-inspired RoboFish]]<br />
<br />
* [[Styx The 6 Whegs Robot]]<br />
<br />
* [[PolyGlove: a body-based haptic interface]]<br />
<br />
==== [[Soft Computing]] ====<br />
----<br />
<br />
<br />
<br />
== Note for students ==<br />
<br />
If you are a student and there isn't a '''page describing your project''', this is because YOU have the task of creating it and populating it with (meaningful) content. If you are a student and there IS a page describing your project, you have the task to complete that page with (useful and comprehensive) information about your own contribution to the project. Be aware that the quality of your work (or lack of it) on the AIRWiki will be evaluated by the Teachers and will influence your grades.<br />
<br />
Instructions to add a new project or to add content to an existing project page are available at [[Projects - HOWTO]].</div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=Image_retargeting_by_k-seam_removal&diff=3227Image retargeting by k-seam removal2008-05-27T11:57:34Z<p>PamelaGotti: /* '''The Idea''' */</p>
<hr />
<div>== '''Part 1: project profile''' ==<br />
<br />
=== Project name ===<br />
<br />
Image retargeting by k-seam removal.<br />
<br />
=== Project short description ===<br />
<br />
This project presents a methodology for content aware image resizing based on seam removal. In this work four different approaches were implemented in order to retarget an image:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function<br />
* removing a not connected path of pixels (k-seam) minimizing an energy function<br />
* removing a 8-connected path of pixels (1-seam) minimizing the energy variation in the image<br />
* removing a not connected path of pixels (k-seam) minimizing the energy variation in the image<br />
where k is the maximum disconnect allowed.<br />
<br />
The work ends with a comparison on several test pictures among these algorithms considering the one which gives the best results.<br />
<br />
=== Dates ===<br />
Start date: 2008/01/01<br />
<br />
End date: 2008/06/24<br />
<br />
=== People involved ===<br />
<br />
===== Project head(s) =====<br />
<br />
* V. Caglioti - Vincenzo (dot) Caglioti (at) polimi (dot) it<br />
<br />
===== Other Politecnico di Milano people =====<br />
<br />
* P. Taddei - pierluigi (dot) taddei (at) polimi (dot) it <br />
<br />
===== Students currently working on the project =====<br />
<br />
* Luigi Cardamone - luigi (dot) cardamone (at) mail (dot) polimi (dot) it<br />
<br />
* [[User:PamelaGotti|Pamela Gotti]]<br />
<br />
=== Laboratory work and risk analysis ===<br />
<br />
This project does not include laboratory activities.<br />
<br />
== '''Part 2: project description''' ==<br />
<br />
==='''State of the art'''===<br />
<br />
This project is based on the article ''Shai Avidan, Ariel Shamir, Seam Carving for Content-Aware Image Resizing, ACM SIGPLAN, 1994'', in which the author describes content aware image resizing by removal of 8-connected path of pixels.<br />
<br />
==='''The problem'''===<br />
<br />
The normal way of resizing a picture doesn’t take in account it’s content and differs from the resizing of a web pages where each object is modified on the basis of its content. So, there is the need for an image resizing that is content aware.<br />
<br />
==='''The Idea'''===<br />
<br />
The idea behind content aware resizing is to treat in a different way the important region of the image respect to those regions with less information. To achieve this goal it’s possible to remove from the picture the seam with low energy.<br />
A seam is a path of pixel from top to bottom or from left to right, as it’s possible to see in the following picture:<br />
<br />
[[Image:Paesaggioconseam.JPG|center|thumb|An example of vertical connected seam|400px]]<br />
<br />
==='''The Algorithm'''===<br />
<br />
The implemented algorithm uses different kind of seam and minimize different measure:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function <br />
* removing a not connected path of pixels (k-seam) minimizing an energy function <br />
* removing a 8-connected path of pixels (1-seam) minimizing the total energy variation in the image <br />
* removing a not connected path of pixels (k-seam) minimizing the total energy variation in the image <br />
<br />
Where k seam are those seam with a maximum disconnection of k pixel. This disconnection is important when in the picture there are many object and it’s important to don’t cut their edges.<br />
<br />
All these algorithms were implemented in Matlab and tested on several pictures (source code is available here: [[Media:Carving.zip|Carving source code]]<br />
). The project follows with a comparative analysis of strength and weakness of each method.<br />
<br />
==='''Conclusion'''===<br />
<br />
From results emerge that the best algorithm is that one working with 1-seam with minimum energy.<br />
<br />
In the following pictures it is possible to see the result of a retargeting using the best algorithm and the difference respect to the normal resize method (stretching ).<br />
<br />
[[Image:ImageContentResizeDelfino.jpg|left|thumb|Original image|325px]]<br />
<br />
[[Image:Delfino22.JPG|left|thumb|Resized image with streching|250px]]<br />
<br />
[[Image:Delfino2 original connected.JPG|left|thumb|Resized image with 1-seam with minumum energy|250px]]</div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=Image_retargeting_by_k-seam_removal&diff=3226Image retargeting by k-seam removal2008-05-27T11:57:11Z<p>PamelaGotti: /* '''The Idea''' */</p>
<hr />
<div>== '''Part 1: project profile''' ==<br />
<br />
=== Project name ===<br />
<br />
Image retargeting by k-seam removal.<br />
<br />
=== Project short description ===<br />
<br />
This project presents a methodology for content aware image resizing based on seam removal. In this work four different approaches were implemented in order to retarget an image:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function<br />
* removing a not connected path of pixels (k-seam) minimizing an energy function<br />
* removing a 8-connected path of pixels (1-seam) minimizing the energy variation in the image<br />
* removing a not connected path of pixels (k-seam) minimizing the energy variation in the image<br />
where k is the maximum disconnect allowed.<br />
<br />
The work ends with a comparison on several test pictures among these algorithms considering the one which gives the best results.<br />
<br />
=== Dates ===<br />
Start date: 2008/01/01<br />
<br />
End date: 2008/06/24<br />
<br />
=== People involved ===<br />
<br />
===== Project head(s) =====<br />
<br />
* V. Caglioti - Vincenzo (dot) Caglioti (at) polimi (dot) it<br />
<br />
===== Other Politecnico di Milano people =====<br />
<br />
* P. Taddei - pierluigi (dot) taddei (at) polimi (dot) it <br />
<br />
===== Students currently working on the project =====<br />
<br />
* Luigi Cardamone - luigi (dot) cardamone (at) mail (dot) polimi (dot) it<br />
<br />
* [[User:PamelaGotti|Pamela Gotti]]<br />
<br />
=== Laboratory work and risk analysis ===<br />
<br />
This project does not include laboratory activities.<br />
<br />
== '''Part 2: project description''' ==<br />
<br />
==='''State of the art'''===<br />
<br />
This project is based on the article ''Shai Avidan, Ariel Shamir, Seam Carving for Content-Aware Image Resizing, ACM SIGPLAN, 1994'', in which the author describes content aware image resizing by removal of 8-connected path of pixels.<br />
<br />
==='''The problem'''===<br />
<br />
The normal way of resizing a picture doesn’t take in account it’s content and differs from the resizing of a web pages where each object is modified on the basis of its content. So, there is the need for an image resizing that is content aware.<br />
<br />
==='''The Idea'''===<br />
<br />
The idea behind content aware resizing is to treat in a different way the important region of the image respect to those regions with less information. To achieve this goal it’s possible to remove from the picture the seam with low energy.<br />
A seam is a path of pixel from top to bottom or from left to right, as it’s possible to see in the following picture:<br />
<br />
[[Image:Paesaggioconseam.JPG|center|thumb|An example of connected seam|300px]]<br />
<br />
==='''The Algorithm'''===<br />
<br />
The implemented algorithm uses different kind of seam and minimize different measure:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function <br />
* removing a not connected path of pixels (k-seam) minimizing an energy function <br />
* removing a 8-connected path of pixels (1-seam) minimizing the total energy variation in the image <br />
* removing a not connected path of pixels (k-seam) minimizing the total energy variation in the image <br />
<br />
Where k seam are those seam with a maximum disconnection of k pixel. This disconnection is important when in the picture there are many object and it’s important to don’t cut their edges.<br />
<br />
All these algorithms were implemented in Matlab and tested on several pictures (source code is available here: [[Media:Carving.zip|Carving source code]]<br />
). The project follows with a comparative analysis of strength and weakness of each method.<br />
<br />
==='''Conclusion'''===<br />
<br />
From results emerge that the best algorithm is that one working with 1-seam with minimum energy.<br />
<br />
In the following pictures it is possible to see the result of a retargeting using the best algorithm and the difference respect to the normal resize method (stretching ).<br />
<br />
[[Image:ImageContentResizeDelfino.jpg|left|thumb|Original image|325px]]<br />
<br />
[[Image:Delfino22.JPG|left|thumb|Resized image with streching|250px]]<br />
<br />
[[Image:Delfino2 original connected.JPG|left|thumb|Resized image with 1-seam with minumum energy|250px]]</div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=Image_retargeting_by_k-seam_removal&diff=3225Image retargeting by k-seam removal2008-05-27T11:56:57Z<p>PamelaGotti: /* '''The Idea''' */</p>
<hr />
<div>== '''Part 1: project profile''' ==<br />
<br />
=== Project name ===<br />
<br />
Image retargeting by k-seam removal.<br />
<br />
=== Project short description ===<br />
<br />
This project presents a methodology for content aware image resizing based on seam removal. In this work four different approaches were implemented in order to retarget an image:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function<br />
* removing a not connected path of pixels (k-seam) minimizing an energy function<br />
* removing a 8-connected path of pixels (1-seam) minimizing the energy variation in the image<br />
* removing a not connected path of pixels (k-seam) minimizing the energy variation in the image<br />
where k is the maximum disconnect allowed.<br />
<br />
The work ends with a comparison on several test pictures among these algorithms considering the one which gives the best results.<br />
<br />
=== Dates ===<br />
Start date: 2008/01/01<br />
<br />
End date: 2008/06/24<br />
<br />
=== People involved ===<br />
<br />
===== Project head(s) =====<br />
<br />
* V. Caglioti - Vincenzo (dot) Caglioti (at) polimi (dot) it<br />
<br />
===== Other Politecnico di Milano people =====<br />
<br />
* P. Taddei - pierluigi (dot) taddei (at) polimi (dot) it <br />
<br />
===== Students currently working on the project =====<br />
<br />
* Luigi Cardamone - luigi (dot) cardamone (at) mail (dot) polimi (dot) it<br />
<br />
* [[User:PamelaGotti|Pamela Gotti]]<br />
<br />
=== Laboratory work and risk analysis ===<br />
<br />
This project does not include laboratory activities.<br />
<br />
== '''Part 2: project description''' ==<br />
<br />
==='''State of the art'''===<br />
<br />
This project is based on the article ''Shai Avidan, Ariel Shamir, Seam Carving for Content-Aware Image Resizing, ACM SIGPLAN, 1994'', in which the author describes content aware image resizing by removal of 8-connected path of pixels.<br />
<br />
==='''The problem'''===<br />
<br />
The normal way of resizing a picture doesn’t take in account it’s content and differs from the resizing of a web pages where each object is modified on the basis of its content. So, there is the need for an image resizing that is content aware.<br />
<br />
==='''The Idea'''===<br />
<br />
The idea behind content aware resizing is to treat in a different way the important region of the image respect to those regions with less information. To achieve this goal it’s possible to remove from the picture the seam with low energy.<br />
A seam is a path of pixel from top to bottom or from left to right, as it’s possible to see in the following picture:<br />
<br />
[[Image:Paesaggioconseam.JPG|center|thumb|An example of connected seam]]<br />
<br />
==='''The Algorithm'''===<br />
<br />
The implemented algorithm uses different kind of seam and minimize different measure:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function <br />
* removing a not connected path of pixels (k-seam) minimizing an energy function <br />
* removing a 8-connected path of pixels (1-seam) minimizing the total energy variation in the image <br />
* removing a not connected path of pixels (k-seam) minimizing the total energy variation in the image <br />
<br />
Where k seam are those seam with a maximum disconnection of k pixel. This disconnection is important when in the picture there are many object and it’s important to don’t cut their edges.<br />
<br />
All these algorithms were implemented in Matlab and tested on several pictures (source code is available here: [[Media:Carving.zip|Carving source code]]<br />
). The project follows with a comparative analysis of strength and weakness of each method.<br />
<br />
==='''Conclusion'''===<br />
<br />
From results emerge that the best algorithm is that one working with 1-seam with minimum energy.<br />
<br />
In the following pictures it is possible to see the result of a retargeting using the best algorithm and the difference respect to the normal resize method (stretching ).<br />
<br />
[[Image:ImageContentResizeDelfino.jpg|left|thumb|Original image|325px]]<br />
<br />
[[Image:Delfino22.JPG|left|thumb|Resized image with streching|250px]]<br />
<br />
[[Image:Delfino2 original connected.JPG|left|thumb|Resized image with 1-seam with minumum energy|250px]]</div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=Image_retargeting_by_k-seam_removal&diff=3224Image retargeting by k-seam removal2008-05-27T11:56:39Z<p>PamelaGotti: /* '''The Idea''' */</p>
<hr />
<div>== '''Part 1: project profile''' ==<br />
<br />
=== Project name ===<br />
<br />
Image retargeting by k-seam removal.<br />
<br />
=== Project short description ===<br />
<br />
This project presents a methodology for content aware image resizing based on seam removal. In this work four different approaches were implemented in order to retarget an image:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function<br />
* removing a not connected path of pixels (k-seam) minimizing an energy function<br />
* removing a 8-connected path of pixels (1-seam) minimizing the energy variation in the image<br />
* removing a not connected path of pixels (k-seam) minimizing the energy variation in the image<br />
where k is the maximum disconnect allowed.<br />
<br />
The work ends with a comparison on several test pictures among these algorithms considering the one which gives the best results.<br />
<br />
=== Dates ===<br />
Start date: 2008/01/01<br />
<br />
End date: 2008/06/24<br />
<br />
=== People involved ===<br />
<br />
===== Project head(s) =====<br />
<br />
* V. Caglioti - Vincenzo (dot) Caglioti (at) polimi (dot) it<br />
<br />
===== Other Politecnico di Milano people =====<br />
<br />
* P. Taddei - pierluigi (dot) taddei (at) polimi (dot) it <br />
<br />
===== Students currently working on the project =====<br />
<br />
* Luigi Cardamone - luigi (dot) cardamone (at) mail (dot) polimi (dot) it<br />
<br />
* [[User:PamelaGotti|Pamela Gotti]]<br />
<br />
=== Laboratory work and risk analysis ===<br />
<br />
This project does not include laboratory activities.<br />
<br />
== '''Part 2: project description''' ==<br />
<br />
==='''State of the art'''===<br />
<br />
This project is based on the article ''Shai Avidan, Ariel Shamir, Seam Carving for Content-Aware Image Resizing, ACM SIGPLAN, 1994'', in which the author describes content aware image resizing by removal of 8-connected path of pixels.<br />
<br />
==='''The problem'''===<br />
<br />
The normal way of resizing a picture doesn’t take in account it’s content and differs from the resizing of a web pages where each object is modified on the basis of its content. So, there is the need for an image resizing that is content aware.<br />
<br />
==='''The Idea'''===<br />
<br />
The idea behind content aware resizing is to treat in a different way the important region of the image respect to those regions with less information. To achieve this goal it’s possible to remove from the picture the seam with low energy.<br />
A seam is a path of pixel from top to bottom or from left to right, as it’s possible to see in the following picture:<br />
<br />
[[Image:Paesaggioconseam.JPG|left|frameless|An example of connected seam]]<br />
<br />
==='''The Algorithm'''===<br />
<br />
The implemented algorithm uses different kind of seam and minimize different measure:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function <br />
* removing a not connected path of pixels (k-seam) minimizing an energy function <br />
* removing a 8-connected path of pixels (1-seam) minimizing the total energy variation in the image <br />
* removing a not connected path of pixels (k-seam) minimizing the total energy variation in the image <br />
<br />
Where k seam are those seam with a maximum disconnection of k pixel. This disconnection is important when in the picture there are many object and it’s important to don’t cut their edges.<br />
<br />
All these algorithms were implemented in Matlab and tested on several pictures (source code is available here: [[Media:Carving.zip|Carving source code]]<br />
). The project follows with a comparative analysis of strength and weakness of each method.<br />
<br />
==='''Conclusion'''===<br />
<br />
From results emerge that the best algorithm is that one working with 1-seam with minimum energy.<br />
<br />
In the following pictures it is possible to see the result of a retargeting using the best algorithm and the difference respect to the normal resize method (stretching ).<br />
<br />
[[Image:ImageContentResizeDelfino.jpg|left|thumb|Original image|325px]]<br />
<br />
[[Image:Delfino22.JPG|left|thumb|Resized image with streching|250px]]<br />
<br />
[[Image:Delfino2 original connected.JPG|left|thumb|Resized image with 1-seam with minumum energy|250px]]</div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=Image_retargeting_by_k-seam_removal&diff=3223Image retargeting by k-seam removal2008-05-27T11:55:46Z<p>PamelaGotti: /* '''The Idea''' */</p>
<hr />
<div>== '''Part 1: project profile''' ==<br />
<br />
=== Project name ===<br />
<br />
Image retargeting by k-seam removal.<br />
<br />
=== Project short description ===<br />
<br />
This project presents a methodology for content aware image resizing based on seam removal. In this work four different approaches were implemented in order to retarget an image:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function<br />
* removing a not connected path of pixels (k-seam) minimizing an energy function<br />
* removing a 8-connected path of pixels (1-seam) minimizing the energy variation in the image<br />
* removing a not connected path of pixels (k-seam) minimizing the energy variation in the image<br />
where k is the maximum disconnect allowed.<br />
<br />
The work ends with a comparison on several test pictures among these algorithms considering the one which gives the best results.<br />
<br />
=== Dates ===<br />
Start date: 2008/01/01<br />
<br />
End date: 2008/06/24<br />
<br />
=== People involved ===<br />
<br />
===== Project head(s) =====<br />
<br />
* V. Caglioti - Vincenzo (dot) Caglioti (at) polimi (dot) it<br />
<br />
===== Other Politecnico di Milano people =====<br />
<br />
* P. Taddei - pierluigi (dot) taddei (at) polimi (dot) it <br />
<br />
===== Students currently working on the project =====<br />
<br />
* Luigi Cardamone - luigi (dot) cardamone (at) mail (dot) polimi (dot) it<br />
<br />
* [[User:PamelaGotti|Pamela Gotti]]<br />
<br />
=== Laboratory work and risk analysis ===<br />
<br />
This project does not include laboratory activities.<br />
<br />
== '''Part 2: project description''' ==<br />
<br />
==='''State of the art'''===<br />
<br />
This project is based on the article ''Shai Avidan, Ariel Shamir, Seam Carving for Content-Aware Image Resizing, ACM SIGPLAN, 1994'', in which the author describes content aware image resizing by removal of 8-connected path of pixels.<br />
<br />
==='''The problem'''===<br />
<br />
The normal way of resizing a picture doesn’t take in account it’s content and differs from the resizing of a web pages where each object is modified on the basis of its content. So, there is the need for an image resizing that is content aware.<br />
<br />
==='''The Idea'''===<br />
<br />
The idea behind content aware resizing is to treat in a different way the important region of the image respect to those regions with less information. To achieve this goal it’s possible to remove from the picture the seam with low energy.<br />
A seam is a path of pixel from top to bottom or from left to right, as it’s possible to see in the following picture:<br />
<br />
[[Image:Paesaggioconseam.JPG|left|thumb|An example of connected seam]]<br />
<br />
==='''The Algorithm'''===<br />
<br />
The implemented algorithm uses different kind of seam and minimize different measure:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function <br />
* removing a not connected path of pixels (k-seam) minimizing an energy function <br />
* removing a 8-connected path of pixels (1-seam) minimizing the total energy variation in the image <br />
* removing a not connected path of pixels (k-seam) minimizing the total energy variation in the image <br />
<br />
Where k seam are those seam with a maximum disconnection of k pixel. This disconnection is important when in the picture there are many object and it’s important to don’t cut their edges.<br />
<br />
All these algorithms were implemented in Matlab and tested on several pictures (source code is available here: [[Media:Carving.zip|Carving source code]]<br />
). The project follows with a comparative analysis of strength and weakness of each method.<br />
<br />
==='''Conclusion'''===<br />
<br />
From results emerge that the best algorithm is that one working with 1-seam with minimum energy.<br />
<br />
In the following pictures it is possible to see the result of a retargeting using the best algorithm and the difference respect to the normal resize method (stretching ).<br />
<br />
[[Image:ImageContentResizeDelfino.jpg|left|thumb|Original image|325px]]<br />
<br />
[[Image:Delfino22.JPG|left|thumb|Resized image with streching|250px]]<br />
<br />
[[Image:Delfino2 original connected.JPG|left|thumb|Resized image with 1-seam with minumum energy|250px]]</div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=Image_retargeting_by_k-seam_removal&diff=3222Image retargeting by k-seam removal2008-05-27T11:55:08Z<p>PamelaGotti: /* '''Conclusion''' */</p>
<hr />
<div>== '''Part 1: project profile''' ==<br />
<br />
=== Project name ===<br />
<br />
Image retargeting by k-seam removal.<br />
<br />
=== Project short description ===<br />
<br />
This project presents a methodology for content aware image resizing based on seam removal. In this work four different approaches were implemented in order to retarget an image:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function<br />
* removing a not connected path of pixels (k-seam) minimizing an energy function<br />
* removing a 8-connected path of pixels (1-seam) minimizing the energy variation in the image<br />
* removing a not connected path of pixels (k-seam) minimizing the energy variation in the image<br />
where k is the maximum disconnect allowed.<br />
<br />
The work ends with a comparison on several test pictures among these algorithms considering the one which gives the best results.<br />
<br />
=== Dates ===<br />
Start date: 2008/01/01<br />
<br />
End date: 2008/06/24<br />
<br />
=== People involved ===<br />
<br />
===== Project head(s) =====<br />
<br />
* V. Caglioti - Vincenzo (dot) Caglioti (at) polimi (dot) it<br />
<br />
===== Other Politecnico di Milano people =====<br />
<br />
* P. Taddei - pierluigi (dot) taddei (at) polimi (dot) it <br />
<br />
===== Students currently working on the project =====<br />
<br />
* Luigi Cardamone - luigi (dot) cardamone (at) mail (dot) polimi (dot) it<br />
<br />
* [[User:PamelaGotti|Pamela Gotti]]<br />
<br />
=== Laboratory work and risk analysis ===<br />
<br />
This project does not include laboratory activities.<br />
<br />
== '''Part 2: project description''' ==<br />
<br />
==='''State of the art'''===<br />
<br />
This project is based on the article ''Shai Avidan, Ariel Shamir, Seam Carving for Content-Aware Image Resizing, ACM SIGPLAN, 1994'', in which the author describes content aware image resizing by removal of 8-connected path of pixels.<br />
<br />
==='''The problem'''===<br />
<br />
The normal way of resizing a picture doesn’t take in account it’s content and differs from the resizing of a web pages where each object is modified on the basis of its content. So, there is the need for an image resizing that is content aware.<br />
<br />
==='''The Idea'''===<br />
<br />
The idea behind content aware resizing is to treat in a different way the important region of the image respect to those regions with less information. To achieve this goal it’s possible to remove from the picture the seam with low energy.<br />
A seam is a path of pixel from top to bottom or from left to right, as it’s possible to see in the following picture:<br />
<br />
[[Image:Paesaggioconseam.JPG]]<br />
<br />
==='''The Algorithm'''===<br />
<br />
The implemented algorithm uses different kind of seam and minimize different measure:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function <br />
* removing a not connected path of pixels (k-seam) minimizing an energy function <br />
* removing a 8-connected path of pixels (1-seam) minimizing the total energy variation in the image <br />
* removing a not connected path of pixels (k-seam) minimizing the total energy variation in the image <br />
<br />
Where k seam are those seam with a maximum disconnection of k pixel. This disconnection is important when in the picture there are many object and it’s important to don’t cut their edges.<br />
<br />
All these algorithms were implemented in Matlab and tested on several pictures (source code is available here: [[Media:Carving.zip|Carving source code]]<br />
). The project follows with a comparative analysis of strength and weakness of each method.<br />
<br />
==='''Conclusion'''===<br />
<br />
From results emerge that the best algorithm is that one working with 1-seam with minimum energy.<br />
<br />
In the following pictures it is possible to see the result of a retargeting using the best algorithm and the difference respect to the normal resize method (stretching ).<br />
<br />
[[Image:ImageContentResizeDelfino.jpg|left|thumb|Original image|325px]]<br />
<br />
[[Image:Delfino22.JPG|left|thumb|Resized image with streching|250px]]<br />
<br />
[[Image:Delfino2 original connected.JPG|left|thumb|Resized image with 1-seam with minumum energy|250px]]</div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=Image_retargeting_by_k-seam_removal&diff=3221Image retargeting by k-seam removal2008-05-27T11:54:47Z<p>PamelaGotti: /* '''Conclusion''' */</p>
<hr />
<div>== '''Part 1: project profile''' ==<br />
<br />
=== Project name ===<br />
<br />
Image retargeting by k-seam removal.<br />
<br />
=== Project short description ===<br />
<br />
This project presents a methodology for content aware image resizing based on seam removal. In this work four different approaches were implemented in order to retarget an image:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function<br />
* removing a not connected path of pixels (k-seam) minimizing an energy function<br />
* removing a 8-connected path of pixels (1-seam) minimizing the energy variation in the image<br />
* removing a not connected path of pixels (k-seam) minimizing the energy variation in the image<br />
where k is the maximum disconnect allowed.<br />
<br />
The work ends with a comparison on several test pictures among these algorithms considering the one which gives the best results.<br />
<br />
=== Dates ===<br />
Start date: 2008/01/01<br />
<br />
End date: 2008/06/24<br />
<br />
=== People involved ===<br />
<br />
===== Project head(s) =====<br />
<br />
* V. Caglioti - Vincenzo (dot) Caglioti (at) polimi (dot) it<br />
<br />
===== Other Politecnico di Milano people =====<br />
<br />
* P. Taddei - pierluigi (dot) taddei (at) polimi (dot) it <br />
<br />
===== Students currently working on the project =====<br />
<br />
* Luigi Cardamone - luigi (dot) cardamone (at) mail (dot) polimi (dot) it<br />
<br />
* [[User:PamelaGotti|Pamela Gotti]]<br />
<br />
=== Laboratory work and risk analysis ===<br />
<br />
This project does not include laboratory activities.<br />
<br />
== '''Part 2: project description''' ==<br />
<br />
==='''State of the art'''===<br />
<br />
This project is based on the article ''Shai Avidan, Ariel Shamir, Seam Carving for Content-Aware Image Resizing, ACM SIGPLAN, 1994'', in which the author describes content aware image resizing by removal of 8-connected path of pixels.<br />
<br />
==='''The problem'''===<br />
<br />
The normal way of resizing a picture doesn’t take in account it’s content and differs from the resizing of a web pages where each object is modified on the basis of its content. So, there is the need for an image resizing that is content aware.<br />
<br />
==='''The Idea'''===<br />
<br />
The idea behind content aware resizing is to treat in a different way the important region of the image respect to those regions with less information. To achieve this goal it’s possible to remove from the picture the seam with low energy.<br />
A seam is a path of pixel from top to bottom or from left to right, as it’s possible to see in the following picture:<br />
<br />
[[Image:Paesaggioconseam.JPG]]<br />
<br />
==='''The Algorithm'''===<br />
<br />
The implemented algorithm uses different kind of seam and minimize different measure:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function <br />
* removing a not connected path of pixels (k-seam) minimizing an energy function <br />
* removing a 8-connected path of pixels (1-seam) minimizing the total energy variation in the image <br />
* removing a not connected path of pixels (k-seam) minimizing the total energy variation in the image <br />
<br />
Where k seam are those seam with a maximum disconnection of k pixel. This disconnection is important when in the picture there are many object and it’s important to don’t cut their edges.<br />
<br />
All these algorithms were implemented in Matlab and tested on several pictures (source code is available here: [[Media:Carving.zip|Carving source code]]<br />
). The project follows with a comparative analysis of strength and weakness of each method.<br />
<br />
==='''Conclusion'''===<br />
<br />
From results emerge that the best algorithm is that one working with 1-seam with minimum energy.<br />
<br />
In the following pictures it is possible to see the result of a retargeting using the best algorithm and the difference respect to the normal resize method (stretching ).<br />
<br />
[[Image:ImageContentResizeDelfino.jpg|left|thumb|Original image|320px]]<br />
<br />
[[Image:Delfino22.JPG|left|thumb|Resized image with streching|250px]]<br />
<br />
[[Image:Delfino2 original connected.JPG|left|thumb|Resized image with 1-seam with minumum energy|250px]]</div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=Image_retargeting_by_k-seam_removal&diff=3220Image retargeting by k-seam removal2008-05-27T11:52:19Z<p>PamelaGotti: /* '''Conclusion''' */</p>
<hr />
<div>== '''Part 1: project profile''' ==<br />
<br />
=== Project name ===<br />
<br />
Image retargeting by k-seam removal.<br />
<br />
=== Project short description ===<br />
<br />
This project presents a methodology for content aware image resizing based on seam removal. In this work four different approaches were implemented in order to retarget an image:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function<br />
* removing a not connected path of pixels (k-seam) minimizing an energy function<br />
* removing a 8-connected path of pixels (1-seam) minimizing the energy variation in the image<br />
* removing a not connected path of pixels (k-seam) minimizing the energy variation in the image<br />
where k is the maximum disconnect allowed.<br />
<br />
The work ends with a comparison on several test pictures among these algorithms considering the one which gives the best results.<br />
<br />
=== Dates ===<br />
Start date: 2008/01/01<br />
<br />
End date: 2008/06/24<br />
<br />
=== People involved ===<br />
<br />
===== Project head(s) =====<br />
<br />
* V. Caglioti - Vincenzo (dot) Caglioti (at) polimi (dot) it<br />
<br />
===== Other Politecnico di Milano people =====<br />
<br />
* P. Taddei - pierluigi (dot) taddei (at) polimi (dot) it <br />
<br />
===== Students currently working on the project =====<br />
<br />
* Luigi Cardamone - luigi (dot) cardamone (at) mail (dot) polimi (dot) it<br />
<br />
* [[User:PamelaGotti|Pamela Gotti]]<br />
<br />
=== Laboratory work and risk analysis ===<br />
<br />
This project does not include laboratory activities.<br />
<br />
== '''Part 2: project description''' ==<br />
<br />
==='''State of the art'''===<br />
<br />
This project is based on the article ''Shai Avidan, Ariel Shamir, Seam Carving for Content-Aware Image Resizing, ACM SIGPLAN, 1994'', in which the author describes content aware image resizing by removal of 8-connected path of pixels.<br />
<br />
==='''The problem'''===<br />
<br />
The normal way of resizing a picture doesn’t take in account it’s content and differs from the resizing of a web pages where each object is modified on the basis of its content. So, there is the need for an image resizing that is content aware.<br />
<br />
==='''The Idea'''===<br />
<br />
The idea behind content aware resizing is to treat in a different way the important region of the image respect to those regions with less information. To achieve this goal it’s possible to remove from the picture the seam with low energy.<br />
A seam is a path of pixel from top to bottom or from left to right, as it’s possible to see in the following picture:<br />
<br />
[[Image:Paesaggioconseam.JPG]]<br />
<br />
==='''The Algorithm'''===<br />
<br />
The implemented algorithm uses different kind of seam and minimize different measure:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function <br />
* removing a not connected path of pixels (k-seam) minimizing an energy function <br />
* removing a 8-connected path of pixels (1-seam) minimizing the total energy variation in the image <br />
* removing a not connected path of pixels (k-seam) minimizing the total energy variation in the image <br />
<br />
Where k seam are those seam with a maximum disconnection of k pixel. This disconnection is important when in the picture there are many object and it’s important to don’t cut their edges.<br />
<br />
All these algorithms were implemented in Matlab and tested on several pictures (source code is available here: [[Media:Carving.zip|Carving source code]]<br />
). The project follows with a comparative analysis of strength and weakness of each method.<br />
<br />
==='''Conclusion'''===<br />
<br />
From results emerge that the best algorithm is that one working with 1-seam with minimum energy.<br />
<br />
In the following pictures it is possible to see the result of a retargeting using the best algorithm and the difference respect to the normal resize method (stretching ).<br />
<br />
[[Image:ImageContentResizeDelfino.jpg|left|thumb|Original image|300px]]<br />
<br />
[[Image:Delfino22.JPG|left|thumb|Resized image with streching|250px]]<br />
<br />
[[Image:Delfino2 original connected.JPG|left|thumb|Resized image with 1-seam with minumum energy|250px]]</div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=Image_retargeting_by_k-seam_removal&diff=3219Image retargeting by k-seam removal2008-05-27T11:52:00Z<p>PamelaGotti: /* '''Conclusion''' */</p>
<hr />
<div>== '''Part 1: project profile''' ==<br />
<br />
=== Project name ===<br />
<br />
Image retargeting by k-seam removal.<br />
<br />
=== Project short description ===<br />
<br />
This project presents a methodology for content aware image resizing based on seam removal. In this work four different approaches were implemented in order to retarget an image:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function<br />
* removing a not connected path of pixels (k-seam) minimizing an energy function<br />
* removing a 8-connected path of pixels (1-seam) minimizing the energy variation in the image<br />
* removing a not connected path of pixels (k-seam) minimizing the energy variation in the image<br />
where k is the maximum disconnect allowed.<br />
<br />
The work ends with a comparison on several test pictures among these algorithms considering the one which gives the best results.<br />
<br />
=== Dates ===<br />
Start date: 2008/01/01<br />
<br />
End date: 2008/06/24<br />
<br />
=== People involved ===<br />
<br />
===== Project head(s) =====<br />
<br />
* V. Caglioti - Vincenzo (dot) Caglioti (at) polimi (dot) it<br />
<br />
===== Other Politecnico di Milano people =====<br />
<br />
* P. Taddei - pierluigi (dot) taddei (at) polimi (dot) it <br />
<br />
===== Students currently working on the project =====<br />
<br />
* Luigi Cardamone - luigi (dot) cardamone (at) mail (dot) polimi (dot) it<br />
<br />
* [[User:PamelaGotti|Pamela Gotti]]<br />
<br />
=== Laboratory work and risk analysis ===<br />
<br />
This project does not include laboratory activities.<br />
<br />
== '''Part 2: project description''' ==<br />
<br />
==='''State of the art'''===<br />
<br />
This project is based on the article ''Shai Avidan, Ariel Shamir, Seam Carving for Content-Aware Image Resizing, ACM SIGPLAN, 1994'', in which the author describes content aware image resizing by removal of 8-connected path of pixels.<br />
<br />
==='''The problem'''===<br />
<br />
The normal way of resizing a picture doesn’t take in account it’s content and differs from the resizing of a web pages where each object is modified on the basis of its content. So, there is the need for an image resizing that is content aware.<br />
<br />
==='''The Idea'''===<br />
<br />
The idea behind content aware resizing is to treat in a different way the important region of the image respect to those regions with less information. To achieve this goal it’s possible to remove from the picture the seam with low energy.<br />
A seam is a path of pixel from top to bottom or from left to right, as it’s possible to see in the following picture:<br />
<br />
[[Image:Paesaggioconseam.JPG]]<br />
<br />
==='''The Algorithm'''===<br />
<br />
The implemented algorithm uses different kind of seam and minimize different measure:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function <br />
* removing a not connected path of pixels (k-seam) minimizing an energy function <br />
* removing a 8-connected path of pixels (1-seam) minimizing the total energy variation in the image <br />
* removing a not connected path of pixels (k-seam) minimizing the total energy variation in the image <br />
<br />
Where k seam are those seam with a maximum disconnection of k pixel. This disconnection is important when in the picture there are many object and it’s important to don’t cut their edges.<br />
<br />
All these algorithms were implemented in Matlab and tested on several pictures (source code is available here: [[Media:Carving.zip|Carving source code]]<br />
). The project follows with a comparative analysis of strength and weakness of each method.<br />
<br />
==='''Conclusion'''===<br />
<br />
From results emerge that the best algorithm is that one working with 1-seam with minimum energy.<br />
<br />
In the following pictures it is possible to see the result of a retargeting using the best algorithm and the difference respect to the normal resize method (stretching ).<br />
<br />
[[Image:ImageContentResizeDelfino.jpg|left|thumb|Original image|250px]]<br />
<br />
[[Image:Delfino22.JPG|left|thumb|Resized image with streching|250px]]<br />
<br />
[[Image:Delfino2 original connected.JPG|left|thumb|Resized image with 1-seam with minumum energy|250px]]</div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=Image_retargeting_by_k-seam_removal&diff=3218Image retargeting by k-seam removal2008-05-27T11:51:40Z<p>PamelaGotti: /* '''Conclusion''' */</p>
<hr />
<div>== '''Part 1: project profile''' ==<br />
<br />
=== Project name ===<br />
<br />
Image retargeting by k-seam removal.<br />
<br />
=== Project short description ===<br />
<br />
This project presents a methodology for content aware image resizing based on seam removal. In this work four different approaches were implemented in order to retarget an image:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function<br />
* removing a not connected path of pixels (k-seam) minimizing an energy function<br />
* removing a 8-connected path of pixels (1-seam) minimizing the energy variation in the image<br />
* removing a not connected path of pixels (k-seam) minimizing the energy variation in the image<br />
where k is the maximum disconnect allowed.<br />
<br />
The work ends with a comparison on several test pictures among these algorithms considering the one which gives the best results.<br />
<br />
=== Dates ===<br />
Start date: 2008/01/01<br />
<br />
End date: 2008/06/24<br />
<br />
=== People involved ===<br />
<br />
===== Project head(s) =====<br />
<br />
* V. Caglioti - Vincenzo (dot) Caglioti (at) polimi (dot) it<br />
<br />
===== Other Politecnico di Milano people =====<br />
<br />
* P. Taddei - pierluigi (dot) taddei (at) polimi (dot) it <br />
<br />
===== Students currently working on the project =====<br />
<br />
* Luigi Cardamone - luigi (dot) cardamone (at) mail (dot) polimi (dot) it<br />
<br />
* [[User:PamelaGotti|Pamela Gotti]]<br />
<br />
=== Laboratory work and risk analysis ===<br />
<br />
This project does not include laboratory activities.<br />
<br />
== '''Part 2: project description''' ==<br />
<br />
==='''State of the art'''===<br />
<br />
This project is based on the article ''Shai Avidan, Ariel Shamir, Seam Carving for Content-Aware Image Resizing, ACM SIGPLAN, 1994'', in which the author describes content aware image resizing by removal of 8-connected path of pixels.<br />
<br />
==='''The problem'''===<br />
<br />
The normal way of resizing a picture doesn’t take in account it’s content and differs from the resizing of a web pages where each object is modified on the basis of its content. So, there is the need for an image resizing that is content aware.<br />
<br />
==='''The Idea'''===<br />
<br />
The idea behind content aware resizing is to treat in a different way the important region of the image respect to those regions with less information. To achieve this goal it’s possible to remove from the picture the seam with low energy.<br />
A seam is a path of pixel from top to bottom or from left to right, as it’s possible to see in the following picture:<br />
<br />
[[Image:Paesaggioconseam.JPG]]<br />
<br />
==='''The Algorithm'''===<br />
<br />
The implemented algorithm uses different kind of seam and minimize different measure:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function <br />
* removing a not connected path of pixels (k-seam) minimizing an energy function <br />
* removing a 8-connected path of pixels (1-seam) minimizing the total energy variation in the image <br />
* removing a not connected path of pixels (k-seam) minimizing the total energy variation in the image <br />
<br />
Where k seam are those seam with a maximum disconnection of k pixel. This disconnection is important when in the picture there are many object and it’s important to don’t cut their edges.<br />
<br />
All these algorithms were implemented in Matlab and tested on several pictures (source code is available here: [[Media:Carving.zip|Carving source code]]<br />
). The project follows with a comparative analysis of strength and weakness of each method.<br />
<br />
==='''Conclusion'''===<br />
<br />
From results emerge that the best algorithm is that one working with 1-seam with minimum energy.<br />
<br />
In the following pictures it is possible to see the result of a retargeting using the best algorithm and the difference respect to the normal resize method (stretching ).<br />
<br />
[[Image:ImageContentResizeDelfino.jpg|left|thumb|Original image|200px]]<br />
<br />
[[Image:Delfino22.JPG|left|thumb|Resized image with streching]]<br />
<br />
[[Image:Delfino2 original connected.JPG|left|thumb|Resized image with 1-seam with minumum energy]]</div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=Image_retargeting_by_k-seam_removal&diff=3217Image retargeting by k-seam removal2008-05-27T11:51:29Z<p>PamelaGotti: /* '''Conclusion''' */</p>
<hr />
<div>== '''Part 1: project profile''' ==<br />
<br />
=== Project name ===<br />
<br />
Image retargeting by k-seam removal.<br />
<br />
=== Project short description ===<br />
<br />
This project presents a methodology for content aware image resizing based on seam removal. In this work four different approaches were implemented in order to retarget an image:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function<br />
* removing a not connected path of pixels (k-seam) minimizing an energy function<br />
* removing a 8-connected path of pixels (1-seam) minimizing the energy variation in the image<br />
* removing a not connected path of pixels (k-seam) minimizing the energy variation in the image<br />
where k is the maximum disconnect allowed.<br />
<br />
The work ends with a comparison on several test pictures among these algorithms considering the one which gives the best results.<br />
<br />
=== Dates ===<br />
Start date: 2008/01/01<br />
<br />
End date: 2008/06/24<br />
<br />
=== People involved ===<br />
<br />
===== Project head(s) =====<br />
<br />
* V. Caglioti - Vincenzo (dot) Caglioti (at) polimi (dot) it<br />
<br />
===== Other Politecnico di Milano people =====<br />
<br />
* P. Taddei - pierluigi (dot) taddei (at) polimi (dot) it <br />
<br />
===== Students currently working on the project =====<br />
<br />
* Luigi Cardamone - luigi (dot) cardamone (at) mail (dot) polimi (dot) it<br />
<br />
* [[User:PamelaGotti|Pamela Gotti]]<br />
<br />
=== Laboratory work and risk analysis ===<br />
<br />
This project does not include laboratory activities.<br />
<br />
== '''Part 2: project description''' ==<br />
<br />
==='''State of the art'''===<br />
<br />
This project is based on the article ''Shai Avidan, Ariel Shamir, Seam Carving for Content-Aware Image Resizing, ACM SIGPLAN, 1994'', in which the author describes content aware image resizing by removal of 8-connected path of pixels.<br />
<br />
==='''The problem'''===<br />
<br />
The normal way of resizing a picture doesn’t take in account it’s content and differs from the resizing of a web pages where each object is modified on the basis of its content. So, there is the need for an image resizing that is content aware.<br />
<br />
==='''The Idea'''===<br />
<br />
The idea behind content aware resizing is to treat in a different way the important region of the image respect to those regions with less information. To achieve this goal it’s possible to remove from the picture the seam with low energy.<br />
A seam is a path of pixel from top to bottom or from left to right, as it’s possible to see in the following picture:<br />
<br />
[[Image:Paesaggioconseam.JPG]]<br />
<br />
==='''The Algorithm'''===<br />
<br />
The implemented algorithm uses different kind of seam and minimize different measure:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function <br />
* removing a not connected path of pixels (k-seam) minimizing an energy function <br />
* removing a 8-connected path of pixels (1-seam) minimizing the total energy variation in the image <br />
* removing a not connected path of pixels (k-seam) minimizing the total energy variation in the image <br />
<br />
Where k seam are those seam with a maximum disconnection of k pixel. This disconnection is important when in the picture there are many object and it’s important to don’t cut their edges.<br />
<br />
All these algorithms were implemented in Matlab and tested on several pictures (source code is available here: [[Media:Carving.zip|Carving source code]]<br />
). The project follows with a comparative analysis of strength and weakness of each method.<br />
<br />
==='''Conclusion'''===<br />
<br />
From results emerge that the best algorithm is that one working with 1-seam with minimum energy.<br />
<br />
In the following pictures it is possible to see the result of a retargeting using the best algorithm and the difference respect to the normal resize method (stretching ).<br />
<br />
[[Image:ImageContentResizeDelfino.jpg|left|thumb|Original image|100px]]<br />
<br />
[[Image:Delfino22.JPG|left|thumb|Resized image with streching]]<br />
<br />
[[Image:Delfino2 original connected.JPG|left|thumb|Resized image with 1-seam with minumum energy]]</div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=Image_retargeting_by_k-seam_removal&diff=3216Image retargeting by k-seam removal2008-05-27T11:51:00Z<p>PamelaGotti: /* '''Conclusion''' */</p>
<hr />
<div>== '''Part 1: project profile''' ==<br />
<br />
=== Project name ===<br />
<br />
Image retargeting by k-seam removal.<br />
<br />
=== Project short description ===<br />
<br />
This project presents a methodology for content aware image resizing based on seam removal. In this work four different approaches were implemented in order to retarget an image:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function<br />
* removing a not connected path of pixels (k-seam) minimizing an energy function<br />
* removing a 8-connected path of pixels (1-seam) minimizing the energy variation in the image<br />
* removing a not connected path of pixels (k-seam) minimizing the energy variation in the image<br />
where k is the maximum disconnect allowed.<br />
<br />
The work ends with a comparison on several test pictures among these algorithms considering the one which gives the best results.<br />
<br />
=== Dates ===<br />
Start date: 2008/01/01<br />
<br />
End date: 2008/06/24<br />
<br />
=== People involved ===<br />
<br />
===== Project head(s) =====<br />
<br />
* V. Caglioti - Vincenzo (dot) Caglioti (at) polimi (dot) it<br />
<br />
===== Other Politecnico di Milano people =====<br />
<br />
* P. Taddei - pierluigi (dot) taddei (at) polimi (dot) it <br />
<br />
===== Students currently working on the project =====<br />
<br />
* Luigi Cardamone - luigi (dot) cardamone (at) mail (dot) polimi (dot) it<br />
<br />
* [[User:PamelaGotti|Pamela Gotti]]<br />
<br />
=== Laboratory work and risk analysis ===<br />
<br />
This project does not include laboratory activities.<br />
<br />
== '''Part 2: project description''' ==<br />
<br />
==='''State of the art'''===<br />
<br />
This project is based on the article ''Shai Avidan, Ariel Shamir, Seam Carving for Content-Aware Image Resizing, ACM SIGPLAN, 1994'', in which the author describes content aware image resizing by removal of 8-connected path of pixels.<br />
<br />
==='''The problem'''===<br />
<br />
The normal way of resizing a picture doesn’t take in account it’s content and differs from the resizing of a web pages where each object is modified on the basis of its content. So, there is the need for an image resizing that is content aware.<br />
<br />
==='''The Idea'''===<br />
<br />
The idea behind content aware resizing is to treat in a different way the important region of the image respect to those regions with less information. To achieve this goal it’s possible to remove from the picture the seam with low energy.<br />
A seam is a path of pixel from top to bottom or from left to right, as it’s possible to see in the following picture:<br />
<br />
[[Image:Paesaggioconseam.JPG]]<br />
<br />
==='''The Algorithm'''===<br />
<br />
The implemented algorithm uses different kind of seam and minimize different measure:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function <br />
* removing a not connected path of pixels (k-seam) minimizing an energy function <br />
* removing a 8-connected path of pixels (1-seam) minimizing the total energy variation in the image <br />
* removing a not connected path of pixels (k-seam) minimizing the total energy variation in the image <br />
<br />
Where k seam are those seam with a maximum disconnection of k pixel. This disconnection is important when in the picture there are many object and it’s important to don’t cut their edges.<br />
<br />
All these algorithms were implemented in Matlab and tested on several pictures (source code is available here: [[Media:Carving.zip|Carving source code]]<br />
). The project follows with a comparative analysis of strength and weakness of each method.<br />
<br />
==='''Conclusion'''===<br />
<br />
From results emerge that the best algorithm is that one working with 1-seam with minimum energy.<br />
<br />
In the following pictures it is possible to see the result of a retargeting using the best algorithm and the difference respect to the normal resize method (stretching ).<br />
<br />
[[Image:ImageContentResizeDelfino.jpg|left|thumb|Original image]]<br />
<br />
[[Image:Delfino22.JPG|left|thumb|Resized image with streching]]<br />
<br />
[[Image:Delfino2 original connected.JPG|left|thumb|Resized image with 1-seam with minumum energy]]</div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=Image_retargeting_by_k-seam_removal&diff=3215Image retargeting by k-seam removal2008-05-27T11:49:58Z<p>PamelaGotti: /* '''The Algorithm''' */</p>
<hr />
<div>== '''Part 1: project profile''' ==<br />
<br />
=== Project name ===<br />
<br />
Image retargeting by k-seam removal.<br />
<br />
=== Project short description ===<br />
<br />
This project presents a methodology for content aware image resizing based on seam removal. In this work four different approaches were implemented in order to retarget an image:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function<br />
* removing a not connected path of pixels (k-seam) minimizing an energy function<br />
* removing a 8-connected path of pixels (1-seam) minimizing the energy variation in the image<br />
* removing a not connected path of pixels (k-seam) minimizing the energy variation in the image<br />
where k is the maximum disconnect allowed.<br />
<br />
The work ends with a comparison on several test pictures among these algorithms considering the one which gives the best results.<br />
<br />
=== Dates ===<br />
Start date: 2008/01/01<br />
<br />
End date: 2008/06/24<br />
<br />
=== People involved ===<br />
<br />
===== Project head(s) =====<br />
<br />
* V. Caglioti - Vincenzo (dot) Caglioti (at) polimi (dot) it<br />
<br />
===== Other Politecnico di Milano people =====<br />
<br />
* P. Taddei - pierluigi (dot) taddei (at) polimi (dot) it <br />
<br />
===== Students currently working on the project =====<br />
<br />
* Luigi Cardamone - luigi (dot) cardamone (at) mail (dot) polimi (dot) it<br />
<br />
* [[User:PamelaGotti|Pamela Gotti]]<br />
<br />
=== Laboratory work and risk analysis ===<br />
<br />
This project does not include laboratory activities.<br />
<br />
== '''Part 2: project description''' ==<br />
<br />
==='''State of the art'''===<br />
<br />
This project is based on the article ''Shai Avidan, Ariel Shamir, Seam Carving for Content-Aware Image Resizing, ACM SIGPLAN, 1994'', in which the author describes content aware image resizing by removal of 8-connected path of pixels.<br />
<br />
==='''The problem'''===<br />
<br />
The normal way of resizing a picture doesn’t take in account it’s content and differs from the resizing of a web pages where each object is modified on the basis of its content. So, there is the need for an image resizing that is content aware.<br />
<br />
==='''The Idea'''===<br />
<br />
The idea behind content aware resizing is to treat in a different way the important region of the image respect to those regions with less information. To achieve this goal it’s possible to remove from the picture the seam with low energy.<br />
A seam is a path of pixel from top to bottom or from left to right, as it’s possible to see in the following picture:<br />
<br />
[[Image:Paesaggioconseam.JPG]]<br />
<br />
==='''The Algorithm'''===<br />
<br />
The implemented algorithm uses different kind of seam and minimize different measure:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function <br />
* removing a not connected path of pixels (k-seam) minimizing an energy function <br />
* removing a 8-connected path of pixels (1-seam) minimizing the total energy variation in the image <br />
* removing a not connected path of pixels (k-seam) minimizing the total energy variation in the image <br />
<br />
Where k seam are those seam with a maximum disconnection of k pixel. This disconnection is important when in the picture there are many object and it’s important to don’t cut their edges.<br />
<br />
All these algorithms were implemented in Matlab and tested on several pictures (source code is available here: [[Media:Carving.zip|Carving source code]]<br />
). The project follows with a comparative analysis of strength and weakness of each method.<br />
<br />
==='''Conclusion'''===<br />
<br />
From results emerge that the best algorithm is that one working with 1-seam with minimum energy.<br />
<br />
In the following pictures it is possible to see the result of a retargeting using the best algorithm and the difference respect to the normal resize method (stretching ).<br />
<br />
[[Image:ImageContentResizeDelfino.jpg|thumb|Original image]]<br />
<br />
[[Image:Delfino22.JPG|thumb|Resized image with streching]]<br />
<br />
[[Image:Delfino2 original connected.JPG|thumb|Resized image with 1-seam with minumum energy]]</div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=Image_retargeting_by_k-seam_removal&diff=3214Image retargeting by k-seam removal2008-05-27T11:30:27Z<p>PamelaGotti: /* '''The problem''' */</p>
<hr />
<div>== '''Part 1: project profile''' ==<br />
<br />
=== Project name ===<br />
<br />
Image retargeting by k-seam removal.<br />
<br />
=== Project short description ===<br />
<br />
This project presents a methodology for content aware image resizing based on seam removal. In this work four different approaches were implemented in order to retarget an image:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function<br />
* removing a not connected path of pixels (k-seam) minimizing an energy function<br />
* removing a 8-connected path of pixels (1-seam) minimizing the energy variation in the image<br />
* removing a not connected path of pixels (k-seam) minimizing the energy variation in the image<br />
where k is the maximum disconnect allowed.<br />
<br />
The work ends with a comparison on several test pictures among these algorithms considering the one which gives the best results.<br />
<br />
=== Dates ===<br />
Start date: 2008/01/01<br />
<br />
End date: 2008/06/24<br />
<br />
=== People involved ===<br />
<br />
===== Project head(s) =====<br />
<br />
* V. Caglioti - Vincenzo (dot) Caglioti (at) polimi (dot) it<br />
<br />
===== Other Politecnico di Milano people =====<br />
<br />
* P. Taddei - pierluigi (dot) taddei (at) polimi (dot) it <br />
<br />
===== Students currently working on the project =====<br />
<br />
* Luigi Cardamone - luigi (dot) cardamone (at) mail (dot) polimi (dot) it<br />
<br />
* [[User:PamelaGotti|Pamela Gotti]]<br />
<br />
=== Laboratory work and risk analysis ===<br />
<br />
This project does not include laboratory activities.<br />
<br />
== '''Part 2: project description''' ==<br />
<br />
==='''State of the art'''===<br />
<br />
This project is based on the article ''Shai Avidan, Ariel Shamir, Seam Carving for Content-Aware Image Resizing, ACM SIGPLAN, 1994'', in which the author describes content aware image resizing by removal of 8-connected path of pixels.<br />
<br />
==='''The problem'''===<br />
<br />
The normal way of resizing a picture doesn’t take in account it’s content and differs from the resizing of a web pages where each object is modified on the basis of its content. So, there is the need for an image resizing that is content aware.<br />
<br />
==='''The Idea'''===<br />
<br />
The idea behind content aware resizing is to treat in a different way the important region of the image respect to those regions with less information. To achieve this goal it’s possible to remove from the picture the seam with low energy.<br />
A seam is a path of pixel from top to bottom or from left to right, as it’s possible to see in the following picture:<br />
<br />
[[Image:Paesaggioconseam.JPG]]<br />
<br />
==='''The Algorithm'''===<br />
<br />
The implemented algorithm uses different kind of seam and minimize different measure:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function <br />
* removing a not connected path of pixels (k-seam) minimizing an energy function <br />
* removing a 8-connected path of pixels (1-seam) minimizing the total energy variation in the image <br />
* removing a not connected path of pixels (k-seam) minimizing the total energy variation in the image <br />
<br />
Where k seam are those seam with a maximum disconnection of k pixel. This disconnection is important when in the picture there are many object and it’s important to don’t cut their edges.<br />
<br />
All these algorithms were implemented in Matlab and tested on several pictures (source code is available here: [[Image:Carving.zip]]<br />
). The project follows with a comparative analysis of strength and weakness of each method.<br />
<br />
==='''Conclusion'''===<br />
<br />
From results emerge that the best algorithm is that one working with 1-seam with minimum energy.<br />
<br />
In the following pictures it is possible to see the result of a retargeting using the best algorithm and the difference respect to the normal resize method (stretching ).<br />
<br />
[[Image:ImageContentResizeDelfino.jpg|thumb|Original image]]<br />
<br />
[[Image:Delfino22.JPG|thumb|Resized image with streching]]<br />
<br />
[[Image:Delfino2 original connected.JPG|thumb|Resized image with 1-seam with minumum energy]]</div>PamelaGottihttps://airwiki.elet.polimi.it/index.php?title=Image_retargeting_by_k-seam_removal&diff=3213Image retargeting by k-seam removal2008-05-27T11:29:38Z<p>PamelaGotti: /* '''Conclusion''' */</p>
<hr />
<div>== '''Part 1: project profile''' ==<br />
<br />
=== Project name ===<br />
<br />
Image retargeting by k-seam removal.<br />
<br />
=== Project short description ===<br />
<br />
This project presents a methodology for content aware image resizing based on seam removal. In this work four different approaches were implemented in order to retarget an image:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function<br />
* removing a not connected path of pixels (k-seam) minimizing an energy function<br />
* removing a 8-connected path of pixels (1-seam) minimizing the energy variation in the image<br />
* removing a not connected path of pixels (k-seam) minimizing the energy variation in the image<br />
where k is the maximum disconnect allowed.<br />
<br />
The work ends with a comparison on several test pictures among these algorithms considering the one which gives the best results.<br />
<br />
=== Dates ===<br />
Start date: 2008/01/01<br />
<br />
End date: 2008/06/24<br />
<br />
=== People involved ===<br />
<br />
===== Project head(s) =====<br />
<br />
* V. Caglioti - Vincenzo (dot) Caglioti (at) polimi (dot) it<br />
<br />
===== Other Politecnico di Milano people =====<br />
<br />
* P. Taddei - pierluigi (dot) taddei (at) polimi (dot) it <br />
<br />
===== Students currently working on the project =====<br />
<br />
* Luigi Cardamone - luigi (dot) cardamone (at) mail (dot) polimi (dot) it<br />
<br />
* [[User:PamelaGotti|Pamela Gotti]]<br />
<br />
=== Laboratory work and risk analysis ===<br />
<br />
This project does not include laboratory activities.<br />
<br />
== '''Part 2: project description''' ==<br />
<br />
==='''State of the art'''===<br />
<br />
This project is based on the article ''Shai Avidan, Ariel Shamir, Seam Carving for Content-Aware Image Resizing, ACM SIGPLAN, 1994'', in which the author describes content aware image resizing by removal of 8-connected path of pixels.<br />
<br />
==='''The problem'''===<br />
<br />
The normal way of resizing a picture doesn’t take in account it’s content and differs from the resizing of a web pages where each object is modified on the basis of this content. So, there is the need for an image resizing that is content aware.<br />
<br />
==='''The Idea'''===<br />
<br />
The idea behind content aware resizing is to treat in a different way the important region of the image respect to those regions with less information. To achieve this goal it’s possible to remove from the picture the seam with low energy.<br />
A seam is a path of pixel from top to bottom or from left to right, as it’s possible to see in the following picture:<br />
<br />
[[Image:Paesaggioconseam.JPG]]<br />
<br />
==='''The Algorithm'''===<br />
<br />
The implemented algorithm uses different kind of seam and minimize different measure:<br />
* removing a 8-connected path of pixels (1-seam) minimizing an energy function <br />
* removing a not connected path of pixels (k-seam) minimizing an energy function <br />
* removing a 8-connected path of pixels (1-seam) minimizing the total energy variation in the image <br />
* removing a not connected path of pixels (k-seam) minimizing the total energy variation in the image <br />
<br />
Where k seam are those seam with a maximum disconnection of k pixel. This disconnection is important when in the picture there are many object and it’s important to don’t cut their edges.<br />
<br />
All these algorithms were implemented in Matlab and tested on several pictures (source code is available here: [[Image:Carving.zip]]<br />
). The project follows with a comparative analysis of strength and weakness of each method.<br />
<br />
==='''Conclusion'''===<br />
<br />
From results emerge that the best algorithm is that one working with 1-seam with minimum energy.<br />
<br />
In the following pictures it is possible to see the result of a retargeting using the best algorithm and the difference respect to the normal resize method (stretching ).<br />
<br />
[[Image:ImageContentResizeDelfino.jpg|thumb|Original image]]<br />
<br />
[[Image:Delfino22.JPG|thumb|Resized image with streching]]<br />
<br />
[[Image:Delfino2 original connected.JPG|thumb|Resized image with 1-seam with minumum energy]]</div>PamelaGotti