Talk:Seam carving

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia

Importance function[edit]

> The importance function values a pixel by measuring its contrast with its neighbor pixels.

The importance function does not have to measure the contrast of a pixel with its neighbours. It could be anything - a saliency function, an edge detector, a simple mean subtractor... Maybe the sentence should be rephrased to state that the contrast with neighbours was used in the original article, but the dynamic programming framework allows for any kind of function? 128.178.244.62 (talk) —Preceding undated comment added 12:57, 21 December 2009 (UTC).[reply]

Implementations?[edit]

Why has someone removed almost all the links to the different (freely available) implementations of this method? I would think such information would be useful and relevant to an article that discusses relatively new technology.128.101.72.149 (talk) 14:10, 14 March 2008 (UTC)[reply]

Wikipedia isn't a web directory. See WP:EL and WP:NOT. Those links should be added to a web directory such as the Open Directory Project, and a link from this article to the relevant sub-page in the directory would be appropriate. Mindmatrix 15:58, 14 March 2008 (UTC)[reply]
That's a bit weird. Why include any links then? Why have articles which purely contains lists of software (links List_of_UML_tools or [Category])? Wikipedia is where people come to look up stuff. DMOZ seems like the worst place to send them when you already have an entry in Wikipedia. --129.27.201.20 (talk) 07:36, 13 June 2008 (UTC)[reply]
Regarding your first question, links should be included if they elaborate on the topic in a meaningful way, for instance describing the history of the subject, or describing methodology for algorithmic development. Web pages for products (software or other) rarely do this. With respect to the articles on WP about lists of software etc., there's been debate about those. Essentially, the list is deemed reasonable if listed items are significant enough to warrant their own article. Unfortunately, these also attract linkspam.
I've inspected the four links listed below; none satisfy the criteria of elaborating on the subject - they only list the product, download page, howto's etc. The link for rsizr has the additional problem of being Flash-only - links to such sites are strongly discouraged (though not prohibited) by current external links policy. Mindmatrix 13:43, 13 June 2008 (UTC)[reply]
I am about to try to de-stub this article. In doing so, I would like to add back the implementations - not as a list of links but as references in the context of a licensing section. Is that cool? Mergatroid 16:24, 10 June 2009 (UTC)

This is a good implementation for GIMP: http://liquidrescale.wikidot.com/ It's free, and easy to use, but it isn't interactive. --157.88.65.94 (talk) 08:58, 2 May 2008 (UTC)[reply]

Biggest issue with removing these links is that the disambiguation for "Seamstress" leads to this page. 81.86.132.233 (talk) 16:37, 5 July 2008 (UTC)[reply]

More implementations and links:

Seam definition[edit]

A vertical seam is defined in the article as "A vertical seam is a path of eight single pixels connected from top to bottom in an image with one pixel in each row".

Maybe this makes sense to some folks, but it makes no sense to me. Where are the eight single pixels? Is the one pixel in each row simply a vertical line one pixel wide?

Could someone who really knows what seams are please create a really precise definition? Thanks. David spector (talk) 20:44, 3 October 2009 (UTC)[reply]


Computing Seams[edit]

In the sentence "Computing the seam consists of finding the path of minimum cost from one end of the image to another," what "minimum cost" is being talked about? CPU cycles? Difference in color? It's super unclear. Thanks. Damienivan (talk) 02:29, 2 July 2014 (UTC)[reply]

Ok, I get it now, although it's not well phrased. I guess I'll fix it.Damienivan (talk) 05:00, 2 July 2014 (UTC)[reply]

No mention of "Seam Carving with Forward Gradient Difference Maps"?[edit]

It seems there has been some recent developments to the algorithm that greatly improves the visual fidelity in many situations, but I'm not technically savvy enough to do a proper write up of it: "Seam Carving with Forward Gradient Difference Maps". Would probably make a worthwhile addition to the article here though. 195.178.248.6 (talk) 13:49, 18 September 2014 (UTC)[reply]

Text reading?[edit]

Almost any image viewing application could be listed; why "text reading"? — Arthur Rubin (talk) 21:14, 15 April 2015 (UTC)[reply]

External links modified[edit]

Hello fellow Wikipedians,

I have just added archive links to one external link on Seam carving. Please take a moment to review my edit. If necessary, add {{cbignore}} after the link to keep me from modifying it. Alternatively, you can add {{nobots|deny=InternetArchiveBot}} to keep me off the page altogether. I made the following changes:

When you have finished reviewing my changes, please set the checked parameter below to true to let others know.

This message was posted before February 2018. After February 2018, "External links modified" talk page sections are no longer generated or monitored by InternetArchiveBot. No special action is required regarding these talk page notices, other than regular verification using the archive tool instructions below. Editors have permission to delete these "External links modified" talk page sections if they want to de-clutter talk pages, but see the RfC before doing mass systematic removals. This message is updated dynamically through the template {{source check}} (last update: 18 January 2022).

  • If you have discovered URLs which were erroneously considered dead by the bot, you can report them with this tool.
  • If you found an error with any archives or the URLs themselves, you can fix them with this tool.

Cheers.—cyberbot IITalk to my owner:Online 19:30, 21 January 2016 (UTC)[reply]

Non-exemplary links?[edit]

Perhaps there's a citation for them? 2A02:2028:80F:AC01:21F:D0FF:FE8E:AC27 (talk) 19:08, 21 January 2018 (UTC)[reply]

Why would you use Dijkstra’s for this, though?[edit]

The article mentions Dijkstra’s algorithm. But why would you use that if it’s a DAG? Theanswertolifetheuniverseandeverything (talk) 20:12, 24 June 2023 (UTC)[reply]