Margin-infused relaxed algorithm (MIRA) is a machine learning and online algorithm for multiclass classification problems. It is designed to learn a set of parameters (vector or matrix) by processing all the given training examples one-by-one and updating the parameters according to each training example, so that the current training example is classified correctly with a margin against incorrect classifications at least as large as their loss. The change of the parameters is kept as small as possible. A two-class version called binary MIRA simplifies the algorithm by not requiring the solution of a quadratic programming problem (see below). When used in a one-vs-all configuration, binary MIRA can be extended to a multiclass learner that approximates full MIRA, but may be faster to train. The flow of the algorithm looks as follows: The update step is then formalized as a quadratic programming problem: Find m i n ‖ w ( i + 1 ) − w ( i ) ‖ {\displaystyle min\|w^{(i+1)}-w^{(i)}\|} , so that s c o r e ( x t , y t ) − s c o r e ( x t , y ′ ) ≥ L ( y t , y ′ ) ∀ y ′ {\displaystyle score(x_{t},y_{t})-score(x_{t},y')\geq L(y_{t},y')\ \forall y'} , i.e. the score of the current correct training y {\displaystyle y} must be greater than the score of any other possible y ′ {\displaystyle y'} by at least the loss (number of errors) of that y ′ {\displaystyle y'} in comparison to y {\displaystyle y} .
Logic form
Logic forms are simple, first-order logic knowledge representations of natural language sentences formed by the conjunction of concept predicates related through shared arguments. Each noun, verb, adjective, adverb, pronoun, preposition and conjunction generates a predicate. Logic forms can be decorated with word senses to disambiguate the semantics of the word. There are two types of predicates: events are marked with e, and entities are marked with x. The shared arguments connect the subjects and objects of verbs and prepositions together. Example input/output might look like this: Input: The Earth provides the food we eat every day. Output: Earth:n_#1(x1) provide:v_#2(e1, x1, x2) food:n_#1(x2) we(x3) eat:v_#1(e2, x3, x2; x4) day:n_#1(x4) Logic forms are used in some natural language processing techniques, such as question answering, as well as in inference both for database systems and QA systems.
Web series
A web series, also known as a short-form series or web show, is a collection of short scripted or unscripted online videos released on the Internet (i.e., World Wide Web), generally in episodic form. A single installment of a web series can be called a webisode or an episode. The scale of a web series is small, and a typical episode can be anywhere from 3 to 15 minutes long (though some may run up to 20 minutes). Web series first emerged in the mid-1990s and became more prominent in the early 2000s. Web series are distributed online on video-sharing websites and apps, such as YouTube, Vimeo, and TikTok, and can be watched on devices such as smartphones, tablets, desktops, laptops, and Smart TVs (or television sets connected to the Internet with a media streaming device). They can also be released on social media platforms. Because of the nature of the Internet, a web series may be interactive and immersive. Web series are classified as new media. Web series are different from streaming television series, as the latter are designed to be watched on streaming platforms such as Netflix, Amazon Prime Video, or Hotstar, with the streaming services offering original productions made for and by them, as well as acquiring the rights to distribute licensed content. The length of a streaming television series episode is 30 to 60 minutes (runtimes can also be longer). Although the design of a web series can be similar to that of a television series, its development and production do not entail the same financial investment required for a television series. The popularity of some web series, however, has led to them being optioned for television. Web series differ from short-form content in that the latter are vertical videos specifically designed for smartphone viewing and intended for fast-paced consumption, with runtimes typically ranging from less than one minute to three minutes. There are film festivals for web series, like Webfest Berlin, NYC Web Fest, LA Web Fest, and Vancouver Web Fest. Awards organizations have also been established to celebrate excellence in web series, such as the Streamys, Webbys, IAWTV Awards, and Indie Series Awards. Most major award ceremonies have also created web series and digital media award categories, including the Emmy Awards and the Canadian Screen Awards. == History == === 1990s === In April 1995, "Global Village Idiots", an episode of the reality-based program Rox on public access cable television in Bloomington, Indiana, was uploaded to the Internet, making Rox the first show distributed via the web. The same year, Scott Zakarin created The Spot, an episodic online story that integrated photos, videos, and blogs into the storyline. Likened to Melrose Place-on-the-Web, The Spot featured a rotating cast of characters playing trendy twenty-somethings who rented rooms in a fabled Santa Monica, California beach house called "The Spot". The Spot earned Infoseek's "Cool Site of the Year," an award which later became the Webby. In January 1999, Showtime licensed the animated sci-fi web series WhirlGirl, making it the first independently produced web series licensed by a national television network. In February 1999, the show premiered simultaneously on Showtime and online. The character occasionally appeared on Showtime, for example, hosting a "Lethal Ladies" programming block, but spent most of her time online, appearing in 100 webisodes. === 2000s === As broadband bandwidth increased in speed and availability, delivering high-quality video over the Internet became a reality. In the early 2000s, the Japanese anime industry began broadcasting original net animation (ONA), a type of original video animation (OVA) series, on the Internet. Early examples of the ONA series include Infinite Ryvius: Illusion (2000), Ajimu (2001), and Mahou Yuugi (2001). In 2000, The Brothers Chaps launched the Adobe Flash-created web series Homestar Runner. After being put on hiatus in 2010, it returned in 2014. In 2002, Matt Jolly (better known as "Krinkels") released the first episode of Madness Combat to Newgrounds. The show is still ongoing, with the latest episode "Madness Combat 12: Contravention" released on Twitch in September 2024. In 2003, Microsoft launched MSN Video, offering NBC-related content. Its web series, Weird TV 2000, a spin-off of the syndicated television series Weird TV, featured dozens of shorts, comedy sketches, and mini-documentaries produced exclusively for MSN Video. The video-sharing site YouTube was launched in early 2005, allowing users to share television programs. YouTube co-founder Jawed Karim said the inspiration for YouTube first came from Janet Jackson's role in the 2004 Super Bowl incident, when her breast was exposed during her performance, and later from the 2004 Indian Ocean tsunami. Karim could not easily find video clips of either event online, which led to the idea of a video-sharing site. From 2003 to 2006, many independent web series gained significant popularity, most notably the science fiction series Red vs. Blue by Rooster Teeth. The series was distributed independently via online portals YouTube and Revver, as well as the Rooster Teeth website, acquiring over 100 million social media views during its run. (Rooster Teeth would eventually create the computer-animated web series RWBY in 2013.) In 2004, the adult-animated series Salad Fingers was created, which amassed a cult following. The comedy show The Burg, hailed as the internet's first sitcom and starring Kelli Giddish and Lindsey Broad, rapidly gained an audience and press attention before its creators signed a creation deal with Michael Eisner. The drama Sam Has 7 Friends, which ran in the summer and fall of 2006, was nominated for a Daytime Emmy Award and was temporarily removed from the Internet when it was also acquired by Eisner. In 2004–2005, Spanish producer Pedro Alonso Pablos recorded a series of video interviews featuring actors and directors such as Guillermo del Toro, Santiago Segura, Álex de la Iglesia, and Keanu Reeves, which were distributed through his own website. lonelygirl15, California Heaven, "The Burg", and SamHas7Friends also gained popularity during this time, acquiring audiences in the millions. (Science fiction thriller lonelygirl15 was so successful that it secured a sponsorship deal with Neutrogena in 2007.) In 2004, Stewart St. John, executive producer and head writer of 1990s webisodies The Spot, revived the brand for online audiences as The Spot (2.0), with a new cast, and as a separate soap opera on Sprint PCS Vision-enabled cell phones, creating the first American mobile phone series. St. John and partner Todd Fisher produced over 2,500 daily videos of the mobile soap, driving story lines across platforms to its web counterpart. In 2007, the creators of lonelygirl15 followed up on the show's success with KateModern, a comedy-drama series that debuted on social network Bebo, and took place in the same fictional universe as their previous show. Big Fantastic created and produced the soap opera Prom Queen, financed and distributed by Michael Eisner's production firm Vuguru, and debuted the series on MySpace. Vuguru partnered with Mark Cuban's channel HDNet to release All-for-nots, a mockumentary series by The Burg creators Kathleen Grace and Thom Woodley, which debuted at the SXSW Festival in 2008. These web series highlighted interactivity with the audience in addition to the narrative on relatively low budgets. In contrast, the eight-episode show Sanctuary, starring actor/producer Amanda Tapping, cost $4.3 million to produce. Both Sanctuary and Prom Queen were nominated for a Daytime Emmy Award. Award-winning producer/director Marshall Herskovitz created the drama Quarterlife, which debuted on MySpace and was later distributed on NBC. In 2008, major television studios began releasing web series, such as the ABC comedy show Squeegies, the NBC sci-fi show Gemini Division, and the Bravo reality series The Malan Show. Warner Bros. relaunched The WB as an online network beginning with original mystery web series, Sorority Forever, created and produced by Big Fantastic and executive produced by McG. Meanwhile, MTV announced a new original web series created by Craig Brewer, $5 Cover, that brought together the indie music world and new media expansion. Joss Whedon created, produced, and self-financed musical comedy-drama Dr. Horrible's Sing-Along Blog starring Neil Patrick Harris and Felicia Day. Big Fantastic wrote and produced Foreign Body, a mystery web series that served as a prequel to Robin Cook's novel of the same name. Beckett and Goodfried founded a new Internet studio, EQAL, and produced a spin-off of lonelygirl15 titled LG15: The Resistance. The mainstream press began to provide coverage. In the United Kingdom, KateModern ended its run on Bebo. Bebo also hosted a six-month-long reality travel show, The Gap Year, produced by Endemol UK, and produced an interactive sci-fi drama Kirill for
Haul video
A haul video is a video recording posted to the Internet in which a person discusses items that they recently purchased, sometimes going into detail about their experiences during the purchase and the cost of the items they bought. The posting of haul videos (or hauls) was a growing trend between 2008 and 2016. Often the items bought are books, clothing, groceries, household goods, makeup, or jewellery. == Details == The posting of haul videos grew as a trend between 2008 and 2016. By late 2010, nearly a quarter of a million haul videos had been shared on the website YouTube alone. Certain videos have each received tens of millions of views. Many young adults (mostly women) have displayed their shopping hauls, while including their beauty and design commentary in the narration. The videos are often grouped by store name or by the type of product (cosmetics, accessories, shoes, postage stamps, etc.). Before haul videos became an online trend, millions of people spent time watching other people, in technical product videos unbox their latest new gadgets and technology. The trend of "unboxing videos" had emerged during 2006. Haul videos have led to celebrity status for some people. Other haul video bloggers have entered sponsorship deals and advertising programs from major brands. The videos are rarely negative about the products being reviewed. This aspect of the genre of haul videos makes sponsorship by brand advertisers particularly appealing. Brands including J.C. Penney contacted haulers as part of their marketing efforts for Back to School 2010. Haul videos also convinced three San Francisco Bay Area area natives to launch HaulBlog–a parody site that creates fake haul videos which poke fun at the phenomenon. The site is also home to the original monthly web series "The Haul Monitor" a humorous commentary show that features haul videos from around the community. == Fashion media == Sarah Sykes and John Zimmerman of Carnegie Mellon University, HCII and School of Design wrote an article "Making Sense of Haul Videos: Self-created Celebrities Fill a Fashion Media Gap". They discuss their analysis and research project examining what makes video bloggers so popular on YouTube, as well as how it affects fashion media through the production of haul videos. == Federal Trade Commission == The United States Federal Trade Commission recently enacted laws to regulate many types of online publishers and content creators. The posted information includes blogging and podcasting in text, images, audio, and video. While any publishers (including the haul-video creators) are allowed to accept free merchandise and advertising, the gifts or payments must be fully (and clearly) disclosed to reveal being paid by a brand name, as a sponsor, to review a product. The Canadian Radio-television and Telecommunications Commission is also closely monitoring such Internet activities.
Dynamic web page
A dynamic web page is a web page constructed at runtime (during software execution), as opposed to a static web page, delivered as it is stored. A server-side dynamic web page is a web page whose construction is controlled by an application server processing server-side scripts. In server-side scripting, parameters determine how the assembly of every new web page proceeds, and including the setting up of more client-side processing. A client-side dynamic web page processes the web page using JavaScript running in the browser as it loads. JavaScript can interact with the page via Document Object Model (DOM), to query page state and modify it. Even though a web page can be dynamic on the client-side, it can still be hosted on a static hosting service such as GitHub Pages or Amazon S3 as long as there is not any server-side code included. A dynamic web page is then reloaded by the user or by a computer program to change some variable content. The updating information could come from the server, or from changes made to that page's DOM. This may or may not truncate the browsing history or create a saved version to go back to, but a dynamic web page update using AJAX technologies will neither create a page to go back to, nor truncate the web browsing history forward of the displayed page. Using AJAX, the end user gets one dynamic page managed as a single page in the web browser while the actual web content rendered on that page can vary. The AJAX engine sits only on the browser requesting parts of its DOM, the DOM, for its client, from an application server. A particular application server could offer a standardized REST style interface to offer services to the web application. DHTML is the umbrella term for technologies and methods used to create web pages that are not static web pages, though it has fallen out of common use since the popularization of AJAX, a term which is now itself rarely used. Client-side-scripting, server-side scripting, or a combination of these make for the dynamic web experience in a browser. == Basic concepts == Classical hypertext navigation, with HTML or XHTML alone, provides "static" content, meaning that the user requests a web page and simply views the page and the information on that page. However, a web page can also provide a "live", "dynamic", or "interactive" user experience. Content (text, images, form fields, etc.) on a web page can change, in response to different contexts or conditions. There are two ways to create this kind of effect: Using client-side scripting to change interface behaviors within a specific web page, in response to mouse or keyboard actions, data received from a web API, websocket or at specified timing events. In this case the dynamic behavior occurs within the presentation. Using server-side scripting to change the supplied page source code between pages, adjusting the sequence or reload of the web pages or web content supplied to the browser. Server responses may be determined by such conditions as data in a posted HTML form, parameters in the URL, the type of browser being used, the passage of time, or a database or server state. Web pages that use client-side scripting must use presentation technology broadly called rich interfaced pages. Client-side scripting languages like JavaScript or ActionScript, used for Dynamic HTML (DHTML) and Flash technologies respectively, are frequently used to orchestrate media types (sound, animations, changing text, etc.) of the presentation. The scripting also allows use of remote scripting, a technique by which the DHTML page requests additional information from a server, using a hidden Frame, XMLHttpRequests, or a web service. It is also possible to use a web framework to create a web API, which the client, via the use of JavaScript, uses to obtain data and alter its appearance or behavior dynamically depending on the data. Web pages that use server-side scripting are often created with the help of server-side languages such as PHP, Perl, ASP, JSP, ColdFusion and other languages. These server-side languages typically use the Common Gateway Interface (CGI) to produce dynamic web pages. These kinds of pages can also use, on the client-side, the first kind (DHTML, etc.). == History == It is difficult to be precise about "dynamic web page beginnings" or chronology because the precise concept makes sense only after the "widespread development of web pages". HTTP has existed since 1989, HTML, publicly standardized since 1996. The web browser's rise in popularity started with Mosaic in 1993. Between 1995 and 1996, multiple dynamic web products were introduced to the market, including Coldfusion, WebObjects, PHP, and Active Server Pages. The introduction of JavaScript (then known as LiveScript) enabled the production of client-side dynamic web pages, with JavaScript code executed in the client's browser. The letter "J" in the term AJAX originally indicated the use of JavaScript, as well as XML. With the rise of server side JavaScript processing, for example, Node.js, originally developed in 2009, JavaScript is also used to dynamically create pages on the server that are sent fully formed to clients. MediaWiki, the content management system that powers Wikipedia, is an example for an originally server-side dynamic web page, interacted with through form submissions and URL parameters. Throughout time, progressively enhancing extensions such as the visual editor have also added elements that are dynamic on the client side, while the original dynamic server-side elements such as the classic edit form remain available to be fallen back on (graceful degradation) in case of error or incompatibility. == Server-side scripting == A program running on a web server is used to generate the web content on various web pages, manage user sessions, and control workflow. Server responses may be determined by such conditions as data in a posted HTML form, parameters in the URL, the type of browser being used, the passage of time, or a database or server state. Such web pages are often created with the help of server-side languages such as ASP, ColdFusion, Java, JavaScript, Perl, PHP, Ruby, Python, and other languages, by a support server that can run on the same hardware as the web server. These server-side languages often use the Common Gateway Interface (CGI) to produce dynamic web pages. Two notable exceptions are ASP.NET, and JSP, which reuse CGI concepts in their APIs but actually dispatch all web requests into a shared virtual machine. The server-side languages are used to embed tags or markers within the source file of the web page on the web server. When a user on a client computer requests that web page, the web server interprets these tags or markers to perform actions on the server. For example, the server may be instructed to insert information from a database or information such as the current date. Dynamic web pages are often cached when there are few or no changes expected and the page is anticipated to receive considerable amount of web traffic that would wastefully strain the server and slow down page loading if it had to generate the pages on the fly for each request. == Client-side scripting == Client-side scripting is changing interface behaviors within a specific web page in response to input device actions, or at specified timing events. In this case, the dynamic behavior occurs within the presentation. The client-side content is generated on the user's local computer system. Such web pages use presentation technology called rich interfaced pages. Client-side scripting languages like JavaScript or ActionScript, used for Dynamic HTML (DHTML) and Flash technologies respectively, are frequently used to orchestrate media types (sound, animations, changing text, etc.) of the presentation. Client-side scripting also allows the use of remote scripting, a technique by which the DHTML page requests additional information from a server, using a hidden frame, XMLHttpRequests, or a Web service. The first public use of JavaScript was in 1995, when the language was implemented in Netscape Navigator 2, standardized as ECMAScript two years later. Example The client-side content is generated on the client's computer. The web browser retrieves a page from the server, then processes the code embedded in the page (typically written in JavaScript) and displays the retrieved page's content to the user. The innerHTML property (or write command) can illustrate the client-side dynamic page generation: two distinct pages, A and B, can be regenerated (by an "event response dynamic") as document.innerHTML = A and document.innerHTML = B; or "on load dynamic" by document.write(A) and document.write(B). == Combination technologies == All of the client and server components that collectively build a dynamic web page are called a web application. Web applications manage user interactions, state, security, and performance. Ajax uses a combination of both client-side script
Graph cuts in computer vision and artificial intelligence
As applied in the field of computer vision, graph cut optimization can be employed to efficiently solve a wide variety of low-level computer vision problems (early vision), such as image smoothing, the stereo correspondence problem, image segmentation, object co-segmentation, numerous military applications (eg Automatic target recognition) and many other problems that can be formulated in terms of energy minimization (eg Climate Science and Environmental modelling). Graph cut techniques are now increasingly being used in combination with more general spatial Artificial intelligence techniques (eg to enforce structure in Large language model output to sharpen tumour boundaries and similarly for various Augmented reality, Self-driving car, Robotics, Google Maps applications etc). Many of these energy minimization problems can be approximated by solving a maximum flow problem in a graph (and thus, by the max-flow min-cut theorem, define a minimal cut of the graph). Under most formulations of such problems in computer vision, the minimum energy solution corresponds to the maximum a posteriori estimate of a solution. Although many computer vision algorithms involve cutting a graph (e.g. normalized cuts), the term "graph cuts" is applied specifically to those models which employ a max-flow/min-cut optimization (other graph cutting algorithms may be considered as graph partitioning algorithms). "Binary" problems (such as denoising a binary image) can be solved exactly using this approach; problems where pixels can be labeled with more than two different labels (such as stereo correspondence, or denoising of a grayscale image) cannot be solved exactly, but solutions produced are usually near the global optimum. == History == The foundational theory of graph cuts in computer vision was first developed by Margaret Greig, Bruce Porteous and Allan Seheult (GPS) of Durham University in a now legendary discussion contribution to Julian Besag's 1986 paper and a more detailed follow on paper in 1989. In the Bayesian statistical context of smoothing noisy images, using a Markov random field as the image prior distribution, they showed with a mathematically beautiful proof how the maximum a posteriori estimate of a binary image can be obtained exactly by maximizing the flow through an associated image network, or graph, involving the introduction of a source and sink and Log-likelihood ratios. The problem was shown to be efficiently solvable exactly, an unexpected result as the problem was believed to be computationally intractable (NP hard). GPS also addressed the computational cost of the max-flow algorithm on large graphs, a significant concern at the time. They proposed a partitioning algorithm (see Section 4 of GPS) involving the recursive amalgamation of non-overlapping blocks, or tiles, which gave a 12X increase in speed. This approach recursively solved and amalgamated independent sub-graphs until the whole graph was solved. While contemporaries like Geman and Geman had advocated Parallel computing in the context of Simulated annealing, the GPS blocking strategy offered a deterministic structure amenable to parallelisation and anticipated modern artificial intelligence design across multiple GPUs. However, until recently, this aspect of the paper was largely ignored and subsequent research focused on Serial computer global search trees, such as the Boykov-Kolmogorov algorithm. Although the general k {\displaystyle k} -colour problem is NP hard for k > 2 , {\displaystyle k>2,} the GPS approach has turned out to have very wide applicability in general computer vision problems. This was first demonstrated by Boykov, Veksler and Zabih who, in a seminal paper published more than 10 years after the original GPS paper, and in other important works, lit the blue touch paper for the general adoption of graph cut techniques in computer vision. They showed that, for general problems, the GPS approach can be applied iteratively to sequences of binary problems, using their now ubiquitous alpha-expansion algorithm, yielding near optimal solutions. Prior to these results, approximate local optimisation techniques such as simulated annealing (as proposed by the Geman brothers) or iterated conditional modes (a type of greedy algorithm suggested by Julian Besag) were used to solve such image smoothing problems. Building on these advancements, GPS graph cut optimization was subsequently adapted for interactive image segmentation, most notably through the "GrabCut" algorithm introduced by Carsten Rother, Vladimir Kolmogorov, and Andrew Blake of Microsoft Research, Cambridge. GrabCut extended earlier interactive graph cut methods by replacing monochrome image histograms with Gaussian mixture models to estimate colour distributions, and by employing an iterative GPS energy minimisation scheme. This approach significantly simplified user interaction, requiring only a rough bounding box around the target object rather than detailed user-drawn strokes, and it quickly became a standard tool in both academic research and commercial image editing software. The GPS paper connected and bridged profound ideas from Mathematical statistics (Bayes' theorem, Markov random field), Physics (Ising model), Optimisation (Energy function) and Computer science (Network flow problem) and led the move away from approximate local and slow optimisation approaches (eg simulated annealing) to more powerful exact, or near exact, faster global optimisation techniques. It is now recognised as seminal as it was well ahead of its time and, in particular, was published years before the computing power revolution of Moore's law and GPUs. Significantly, GPS was published in a mathematical statistics (rather than a computer vision) journal, and this led to it being overlooked by the computer vision community for many years. It is unofficially known as "The Velvet Underground" paper of computer vision (ie although very few computer vision people read the paper [bought the record], those that did, most importantly Boykov, Veksler and Zabih, started new and important research [formed a band]). This is confirmed by GPS' very large amplification ratio (2nd order citations/first order citations), estimated at well in excess of 100. Despite the foundational nature of the GPS work, formal recognition from the computer vision community has predominantly gone to the researchers who followed to extend and popularise the graph cut method. For example, Boykov, Veksler and Zabih deservedly received a Helmholtz Prize from the ICCV in 2011. This prize recognises ICCV papers from 10 or more years earlier that have had a significant impact on computer vision research. In 2011, Couprie et al. proposed a general image segmentation framework, called the "Power Watershed", that minimized a real-valued indicator function from [0,1] over a graph, constrained by user seeds (or unary terms) set to 0 or 1, in which the minimization of the indicator function over the graph is optimized with respect to an exponent p {\displaystyle p} . When p = 1 {\displaystyle p=1} , the Power Watershed is optimized by graph cuts, when p = 0 {\displaystyle p=0} the Power Watershed is optimized by shortest paths, p = 2 {\displaystyle p=2} is optimized by the random walker algorithm and p = ∞ {\displaystyle p=\infty } is optimized by the watershed algorithm. In this way, the Power Watershed may be viewed as a generalization of graph cuts that provides a straightforward connection with other energy optimization segmentation/clustering algorithms. == Binary segmentation of images == === Notation === Image: x ∈ { R , G , B } N {\displaystyle x\in \{R,G,B\}^{N}} Output: Segmentation (also called opacity) S ∈ R N {\displaystyle S\in R^{N}} (soft segmentation). For hard segmentation S ∈ { 0 for background , 1 for foreground/object to be detected } N {\displaystyle S\in \{0{\text{ for background}},1{\text{ for foreground/object to be detected}}\}^{N}} Energy function: E ( x , S , C , λ ) {\displaystyle E(x,S,C,\lambda )} where C is the color parameter and λ is the coherence parameter. E ( x , S , C , λ ) = E c o l o r + E c o h e r e n c e {\displaystyle E(x,S,C,\lambda )=E_{\rm {color}}+E_{\rm {coherence}}} Optimization: The segmentation can be estimated as a global minimum over S: arg min S E ( x , S , C , λ ) {\displaystyle {\arg \min }_{S}E(x,S,C,\lambda )} === Existing methods === Standard Graph cuts: optimize energy function over the segmentation (unknown S value). Iterated Graph cuts: First step optimizes over the color parameters using K-means. Second step performs the usual graph cuts algorithm. These 2 steps are repeated recursively until convergence Dynamic graph cuts:Allows to re-run the algorithm much faster after modifying the problem (e.g. after new seeds have been added by a user). === Energy function === Pr ( x ∣ S ) = K − E {\displaystyle \Pr(x\mid S)=K^{-E}} where the energy E {\displaystyle E} is composed of two different mod
Magnetoquasistatic field
A magnetoquasistatic field is a class of electromagnetic field in which a slowly oscillating magnetic field is dominant. A magnetoquasistatic field is typically generated by low-frequency induction from a magnetic dipole or a current loop. The magnetic near-field of such an emitter behaves differently from the more commonly used far-field electromagnetic radiation. At low frequencies the rate of change of the instantaneous field strength with each cycle is relatively slow, giving rise to the name "magneto-quasistatic". The near field or quasistatic region typically extends no more than a wavelength from the antenna, and within this region the electric and magnetic fields are approximately decoupled. Weakly conducting non-magnetic bodies, including the human body and many mineral rocks, are effectively transparent to magnetoquasistatic fields, allowing for the transmission and reception of signals through such obstacles. Also, long-wavelength (i.e. low-frequency) signals are better able to propagate round corners than shorter-wave signals. Communication therefore need not be line-of-sight. The communication range of such signals depends on both the wavelength and the electromagnetic properties of the intervening medium at the chosen frequency, and is typically limited to a few tens of meters. == Physical principles == The laws of primary interest are Ampère's circuital law (with the displacement current density neglected) and the magnetic flux continuity law. These laws have associated with them continuity conditions at interfaces. In the absence of magnetizable materials, these laws determine the magnetic field intensity H given its source, the current density J. H is not everywhere irrotational. However, it is solenoidal everywhere. == Equipment design == A typical antenna comprises a 50-turn coil around a polyoxymethylene tube with diameter 16.5 cm, driven by a class E oscillator circuit. Such a device is readily portable when powered by batteries. Similarly, a typical receiver consist of an active receiving loop with diameter of one meter, an ultra-low-noise amplifier, and a band-pass filter. In operation the oscillator drives current through the transmitting loop to create an oscillating magnetic field. This field induces a voltage in the receiving loop, which is then amplified. Because the quasistatic region is defined within one wavelength of the electromagnetic source, emitters are limited to a frequency range between about 1 kHz and 1 MHz. Reducing the oscillating frequency increases the wavelength and hence the range of the quasistatic region, but reduces the induced voltage in the receiving loops which worsens the signal-to-noise ratio. In experiments carried out by the Carnegie Institute of Technology, the maximum range reported by was 50 meters. == Applications == === Resonant inductive coupling === In resonant coupling, the source and receiver are tuned to resonate at the same frequency and are given similar impedances. This allows power as well as information to flow from the source to the receiver. Such coupling via the magnetoquasistatic field is called resonant inductive coupling and can be used for wireless energy transfer. Applications include induction cooking, induction charging of batteries and some kinds of RFID tag. === Communications === Conventional electromagnetic communication signals cannot pass through the ground. Most mineral rock is neither electrically conducting nor magnetic, allowing magnetic fields to penetrate. Magnetoquasistatic systems have been successfully used for underground wireless communication, both surface-to-underground and between underground parties. At extremely low frequencies, below about 1 kHz, the wavelength is long enough for long-distance communication, although at a slow data rate. Such systems have been installed in submarines, with the local antenna comprising a wire up to several kilometers in length and trailed behind the vessel when at or near the surface. === Position and orientation tracking === Wireless position tracking is being increasingly used in applications such as navigation, security, and asset tracking. Conventional position tracking devices use high frequencies or microwaves, including global positioning systems (GPS), ultra-wide band (UWB) systems, and radio frequency identification systems (RFID), but these systems can easily be blocked by obstacles in their path. Magnetoquasistatic positioning takes advantage of the fact that the fields are largely undisturbed when in the presence of human beings and physical structures, and can be used for both position and orientation tracking for ranges up to 50 meters. To accurately determine the orientation and position of a dipole/emitter, allowance must be made not only for the field pattern generated by the emitter, but also for the eddy-currents they induce in the earth, which create secondary fields detectable by the receivers. By using complex image theory to correct this field generation from earth, and by using frequencies on the order of a few hundred kilohertz to obtain the required signal-to-noise ratio (SNR), it is possible to analyze the position of the dipole through azimuthal orientation, θ {\displaystyle \theta } , and inclination orientation, ϕ {\displaystyle \phi } . A Disney research team has used this technology to effectively determine the position and orientation of an American football, something not traceable through conventional wave propagation techniques due to human body obstruction. They inserted an oscillator-driven coil, around the diameter of the center of the ball, to generate the magnetoquasistatic field. The signal was able to pass undisturbed through multiple players.