RWRik Van de Walle

Rik Van de Walle

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Rik Van de Walle has a total of 190 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Hybrid e-TextBooks as comprehensive interactive learning environments

    by Hajar Ghaem Sigarchian, Sara Logghe, Ruben Verborgh, Wesley de Neve, Frank Salliau, Erik Mannens, Rik Van de Walle, Dimitri Schuurman

    An e-TextBook can serve as an interactive learning environment (ILE), facilitating more effective teaching and learning processes. In this paper, we propose the novel concept of an EPUB 3-based Hybrid e-TextBook, which allows for interaction between the digital and the physical world. In that regard, we first investigated the gap between the expectations of teachers with respect to e-TextBook functionalities, on the one hand, and the ILE functionalities offered by e-TextBooks, on the other hand. Next, together with teachers, we co-designed and developed prototype EPUB 3-based Hybrid e-TextBooks that make it possible to connect their learning content to smart devices in classrooms, leveraging both digital publishing and Semantic Web tools. Based on experimentation with our prototype Hybrid e-TextBooks, we can argue that a semantically enriched EPUB 3-based Hybrid e-TextBook is able to act as a comprehensive ILE, providing the tools needed by teachers in smart classrooms. Furthermore, expert observations and Smiley o’meter results demonstrate an effective impact on student cognition and motivation.


  • Scalable Feature‐Preserving Irregular Mesh Coding

    by J. El Sayeh Khalil, A. Munteanu, L. Denis, P. Lambert, R. Van de Walle

    This paper presents a novel wavelet‐based transform and coding scheme for irregular meshes. The transform preserves geometric features at lower resolutions by adaptive vertex sampling and retriangulation, resulting in more accurate subsampling and better avoidance of smoothing and aliasing artefacts. By employing octree‐based coding techniques, the encoding of both connectivity and geometry information is decoupled from any mesh traversal order, and allows for exploiting the intra‐band statistical dependencies between wavelet coefficients. Improvements over the state of the art obtained by our approach are three‐fold: (1) improved rate–distortion performance over Wavemesh and IPR for both the Hausdorff and root mean square distances at low‐to‐mid‐range bitrates, most obvious when clear geometric features are present while remaining competitive for smooth, feature‐poor models; (2) improved rendering performance at any triangle budget, translating to a better quality for the same runtime memory footprint; (3) improved visual quality when applying similar limits to the bitrate or triangle budget, showing more pronounced improvements than rate–distortion curves.


  • Crowdsourcing a cyclist perspective on suggested recreational paths in real-world networks

    by Kevin Baker, Kristien Ooms, Steven Verstockt, Pascal Brackman, Philippe De Maeyer, Rik Van de Walle

    Routing and navigation services for leisure activities are conditioned by special needs and trade-offs. The advent of online communities and large crowdsourced datasets offers opportunities to improve the adoption of a user’s perspective in these suggested paths. This paper focuses on achieving two goals. First, the presented methodology analyses a dataset of 190,610 historical GPS traces to gain insights into the appreciation or attractiveness of each edge in a real-world network for a specific leisure activity (i.e. road cycling). Second, as literature on these leisure activities is still sparse, we want to create a thorough understanding of the activities at hand for future work. An appreciation model is proposed and the spread of this score is analyzed in shortest-path alternatives of popular routing engines for this activity. This analysis successfully discriminates these shortest paths based on the scoring value and three morphological parameters of the path. However, the robustness of the model should be improved to ensure the viability of the proposed approach in future work. More specifically, further research on the local optimality of the route choices will be imperative.


  • Gamified music improvisation with BilliArT: a multimodal installation with balls

    by T. Vets, L. Nijs, M. Lesaffre, B. Moens, F. Bressan, P. Colpaert, P. Lambert, R. Van de Walle, M. Leman


  • Efficient Bit Rate Transcoding for High Efficiency Video Coding

    by Luong Pham Van, Johan De Praeter, Glenn Van Wallendael, Sebastiaan Van Leuven, Jan De Cock, Rik Van de Walle

    High efficiency video coding (HEVC) shows a significant advance in compression efficiency and is considered to be the successor of H.264/AVC. To incorporate the HEVC standard into real-life network applications and a diversity of other applications, efficient bit rate adaptation (transrating) algorithms are required. A current problem of transrating for HEVC is the high computational complexity associated with the encoder part of such a cascaded pixel domain transcoder. This paper focuses on deriving an optimal strategy for reducing the transcoding complexity with a complexity-scalable scheme. We propose different transcoding techniques which are able to reduce the transcoding complexity in both CU and PU optimization levels. At the CU level, CUs can be evaluated in top-to-bottom or bottom-to-top flows, in which the coding information of the input video stream is utilized to reduce the number of evaluations or to early terminate certain evaluations. At the PU level, the PU candidates are adaptively selected based on the probability of PU sizes and the co-located input PU partitioning. Moreover, with the use of different proposed methods, a complexity-scalable transrating scheme can be achieved. Furthermore, the transcoding complexity can be effectively controlled by the machine learning based approach. Simulations show that the proposed techniques provide a superior transcoding performance compared to the state-of-the-art related works. Additionally, the proposed methods can achieve a range of trade-offs between transrating complexity and coding performance. From the proposed schemes, the fastest approach is able to reduce the complexity by 82% while keeping the bitrate loss below 3%.


  • Hybrid Books for Interactive Digital Storytelling: Connecting Story Entities and Emotions to Smart Environments

    by Hajar Ghaem Sigarchian, Ben De Meester, Frank Salliau, Wesley De Neve, Sara Logghe, Ruben Verborgh, Erik Mannens, Rik Van de Walle, Dimitri Schuurman


  • Open Access

    Performance analysis of machine learning for arbitrary downsizing of pre-encoded HEVC video

    by Luong Pham Van, Johan De Praeter, Glenn Van Wallendael, Jan De Cock, Rik Van de Walle

    Nowadays, broadcasters deliver ultra-high resolution video to their consumers. This live video is sent to a set-top box for display on a television. However, if one or more users in the home want to view the same video on their personal mobile devices with a lower display resolution and limited processing power, decoding the original ultra-high resolution video would result in stuttering and quickly drain the battery life on these devices. To enable a satisfactory consumer experience, the resolution of the video stream should be adapted to the target mobile device at the set-top box. The aim of this paper is to investigate the performance of different machine learning strategies to arbitrary downsize video pre-encoded with the high efficiency video coding standard (HEVC). These machine learning techniques exploit correlation between input and output coding information to predict the splitting behavior of HEVC coding units. Several machine learning algorithms are optimized. Additionally, both online and offline training strategies are tested. Of the tested algorithms, online-trained random forests achieve the best compression-efficiency with a bit rate increase of 5.4% and an average complexity reduction of 70%1.


  • Opportunistic Linked Data Querying Through Approximate Membership Metadata

    by Miel Vander Sande, Ruben Verborgh, Joachim Van Herwegen, Erik Mannens, Rik Van de Walle


  • Assessing and Refining Mappingsto RDF to Improve Dataset Quality

    by Anastasia Dimou, Dimitris Kontokostas, Markus Freudenberg, Ruben Verborgh, Jens Lehmann, Erik Mannens, Sebastian Hellmann, Rik Van de Walle


  • Mining and Visualizing Usage of Educational Systems Using Linked Data

    by Selver Softic, Behnam Taraghi, Martin Ebner, Laurens De Vocht, Erik Mannens, Rik Van de Walle