View allAll Photos Tagged Algorithms
Do Algorithms Care? is a collaboration between artist Amanda Bennetts and data scientist Johanna Einsiedler. The project, realized in an interactive installation that resembles a pristine tech store, offers a critical perspective on the commercialization of personal bio data harvested by devices such as smartwatches and in healthcare industries.
Photo: tom mesic
This is another atempt of creating my own dynamic range increasing algorithm using Python and PIL.
This time I tried to generate some kind of a map out of the 3 input images to mark which region and how much of this I want to have in my final image.
My script needs 3 parameters a Limit for black, a limit for white and a region of middletones.
With these values it creates such a map. Then the map gets blurred and the 3 input images get merged together exactly the way the map specifies.
I think there is still a lot to do, but this is probably the best idea I had so far and I think the results aren't that bad!
The script will be realesed under GNU/GPL on the-engine.at
I’m elated to share that a piece I wrote, commissioned by Dr. Chris Van Hof, will be premiered today at the 2018 International Trombone Festival in Iowa City, Iowa this afternoon at 2pm!
The piece, called “Make More Noise with this One Weird Trick”, features trombone and bass trombone playing a variety of extended techniques, virtuosic jazz-influenced lines, and repetitive techno-style complex rhythms. The piece is written in an electro style (remember Afrika Bambaataa’s “Planet Rock”? That’s electro). I used a variety of techniques to write the piece, everything from piano with pencil and paper, algorithmic coding using Tidal Cycles, and iPad apps run through heavy tube distortion. “Make More Noise…” also heavily features my homemade modular synthesizer; practically all the sounds aside from the trombones come from my synth. Read more details about the piece here: chrisbeckstrom.com/music/musical-projects/make-more-noise...
I’m grateful to Chris for thinking of me for this project, and wish Chris and Evan the best of luck today! If you happen to be in Iowa City today, check this out. It will be noisy, funky, and knowing these guys, expertly performed.
---
(original: cbfish.es/b/3AD)
Do Algorithms Care? is a collaboration between artist Amanda Bennetts and data scientist Johanna Einsiedler. The project, realized in an interactive installation that resembles a pristine tech store, offers a critical perspective on the commercialization of personal bio data harvested by devices such as smartwatches and in healthcare industries.
Photo: tom mesic
FFT used as a band-pass filter, signal written to a Hilbert Curve, quantized, normalized, colored by algorithms.
File: waiting_768,2560hz_08231655_0012d
Homage to the Square.A pattern generated by an audio signal mapped to a Hilbert curve, reduced to 1-bit and colored using a flood fill algorithm in selections derived from Josef Albers’ Homage to the Square.
Swirl from light to dark, from red to green...
This function
srcirot90=: 13 : '(|.|:y)+(1 o. 9 o. y) j. 2 o. 11 o. y'
applied to the following matrix "mm" as different color planes:
mm=. (1 o. ang-%:dis) j. 2 o. dis+2p1|1.25*ang^1.25
where
'dis ang'=. |:c2pj&>1000 1000{.j.&>/~i:500
dis=. 0 4 scaleNums dis
Remix/glitch from an original image in the public domain: commons.wikimedia.org/wiki/File:Throng_of_women_charge_on...
Homage to the Square.A pattern generated by an audio signal mapped to a Hilbert curve, reduced to 1-bit and colored using a flood fill algorithm in selections derived from Josef Albers’ Homage to the Square.
Hemina / The Algorithm / Voyager.Voyager - Ghost Mile album launch.Oxford Art Factory, Sydney.2017.05.21
The shortest distance
between two points
is a nap.
[General Shortest-Distance Problems: Traditional single-source or all-pair shortest-distance problems were introduced in the tropical semiring ((min,+)-semiring). These problems can be generalized to the case of an arbitrary semiring. There exists a simple and generic single-source shortest-distance algorithm that works with any k-closed semiring and that is correct regardless of the queue discipline chosen for its implementation. Classical algorithms such as those of Bellman-Ford, Dijkstra, or Lawler, are all specific instances of that generic algorithm. The classical all-pairs shortest-distance algorithm of Floyd-Warshall can also be straight-forwardedly generalized to the case of closed semirings, non-necessarily idempotent.]