This study presents a refined, automated in near-real time methodology to obtain cloud height maps using a network of 20 all-sky cameras. This low-cost and easily manipulated instruments are distributed in the city of Valladolid, Spain, trying to cover uniformly an estimated area up to 200 km 2 , with the actual spatial coverage depending on cloud height. Camera distances vary from more than 50 km to less than 200 m, in order to have different viewing angles of the clouds above them. All these cameras are geometrically calibrated and maintained within GOA-SCAN (Group of Atmospheric Optics all-Sky CAmeras Network). The methodology utilizes a stereoscopic approach, pairing simultaneous images from all the cameras. Correlation between the image pixels is computed in order to find the same sky point in both images. Then knowing the baseline distance and the orientation of the cameras, the height of every pixel identified as cloudy is computed. This is repeated for all the camera pairs that have a significant overlapping field of view. Filtering criteria are applied to retain only the significant values. With this methodology, cloud base and top heights (CBH and CTH) maps with a 50 m spatial resolution are obtained every five minutes during daytime and every two minutes for nighttime. These maps are compared with the scene classification product from Sentinel-2 satellite images, finding significant agreement. Some discrepancies were found for high transparent clouds and cloud edges. In addition, all CBH and CTH data available during two and a half years are compared against the independent values measured by a ceilometer collocated with one of the cameras. The determination coefficient for the median CBH values within a circular 150 m distance is 0.93. The obtained CTH values tend to overestimate the ceilometer ones and have wider dispersion, with lower determination coefficient of 0.72. Illuminating conditions are crucial for the correct segmentation of cloudy pixels, limiting the performance of the algorithm at nighttime. Overall, the proposed methodology is promising for obtaining cloud spatial masks and cloud height maps, over different cloud types, layering and conditions.
This publication proposes a definition and a classification of agile software development approaches and analyses ten software development methods that can be characterized as being "agile" against the defined criterion.
P. Abrahamsson, O. Salo, Jussi Ronkainen et al.· arXiv.org· 727 citations· ⚡54
The study shows that agile practices improve both informal and formal communication, but indicates that, in larger development situations involving multiple external stakeholders, a mismatch of adequate communication mechanisms can sometimes even hinder the communication.
M. Pikkarainen, Jukka Haikara, O. Salo et al.· Empirical Software Engineeri...· 401 citations· ⚡48
The results indicate that software engineering work practices are chosen opportunistically, adapted and configured to provide value under the constrains imposed by the startup context.
Nicolò Paternoster, Carmine Giardino, M. Unterkalmsteiner et al.· Information and Software Tec...· 394 citations· ⚡54
The perception of the impact of agile methods is predominantly positive, and several challenge areas were discovered, but based on this study, agile methods are here to stay.
M. Laanti, O. Salo, P. Abrahamsson· Information and Software Tec...· 260 citations· ⚡20
Related blog posts
Microsoft Research Blog· microsoft.comOct 29, 2026
Host Sowbhagya Suresh shares some of the latest news and cutting-edge research from across Microsoft—from understanding the challenges facing coding agents to uncovering how people use AI at work and improving extended-range weather forecasting. The post Microsoft Research Focus – Edition #97 appeared first on Microsoft Research.
MIT News · Artificial Intelligence· news.mit.eduOct 28, 2026
Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.
For decades, a fundamental question about the difficulty of computing in high-dimensional spaces has resisted proof. New research resolves this question, removing a major theoretical obstacle to understanding the efficiency of randomized algorithms used across science and computing. The Kannan–Lovász–Simonovits (KLS) conjecture was proposed in 1995. It asks whether, for a broad class of high-dimensional […] The post Solving a 31-year-old grand challenge in mathematics – the KLS conjecture appear…
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.