Geometric distortion measurement for shape coding: a contemporary review

Geometric distortion measurement and the associated metrics involved are integral to the rate-distortion (RD) shape coding framework, with importantly the efficacy of the metrics being strongly influenced by the underlying measurement strategy. This has been the catalyst for many different techniques with this paper presenting a comprehensive review of geometric distortion measurement, the diverse metrics applied and their impact on shape coding. The respective performance of these measuring strategies is analysed from both a RD and complexity perspective, with a recent distortion measurement technique based on arc-length-parameterisation being comparatively evaluated. Some contemporary research challenges are also investigated, including schemes to effectively quantify shape deformation

On the Practice and Application of Context-Free Language Reachability

The Context-Free Language Reachability (CFL-R) formalism relates to some of the most important computational problems facing researchers and industry practitioners. CFL-R is a generalisation of graph reachability and language recognition, such that pairs in a labelled graph are reachable if and only if there is a path between them whose labels, joined together in the order they were encountered, spell a word in a given context-free language. The formalism finds particular use as a vehicle for phrasing and reasoning about program analysis, since complex relationships within the data, logic or structure of computer programs are easily expressed and discovered in CFL-R. Unfortunately, The potential of CFL-R can not be met by state of the art solvers. Current algorithms have scalability and expressibility issues that prevent them from being used on large graph instances or complex grammars. This work outlines our efforts in understanding the practical concerns surrounding CFL-R, and applying this knowledge to improve the performance of CFL-R applications. We examine the major difficulties with solving CFL-R-based analyses at-scale, via a case-study of points-to analysis as a CFL-R problem. Points-to analysis is fundamentally important to many modern research and industry efforts, and is relevant to optimisation, bug-checking and security technologies. Our understanding of the scalability challenge motivates work in developing practical CFL-R techniques. We present improved evaluation algorithms and declarative optimisation techniques for CFL-R, capitalising on the simplicity of CFL-R to creating fully automatic methodologies. The culmination of our work is a general-purpose and high-performance tool called Cauliflower, a solver-generator for CFL-R problems. We describe Cauliflower and evaluate its performance experimentally, showing significant improvement over alternative general techniques

LIPIcs, Volume 261, ICALP 2023, Complete Volume

LIPIcs, Volume 261, ICALP 2023, Complete Volum

Practical interference management strategies in Gaussian networks

Increasing demand for bandwidth intensive activities on high-penetration wireless hand-held personal devices, combined with their processing power and advanced radio features, has necessitated a new look at the problems of resource provisioning and distributed management of coexistence in wireless networks. Information theory, as the science of studying the ultimate limits of communication e ciency, plays an important role in outlining guiding principles in the design and analysis of such communication schemes. Network information theory, the branch of information theory that investigates problems of multiuser and distributed nature in information transmission is ideally poised to answer questions about the design and analysis of multiuser communication systems. In the past few years, there have been major advances in network information theory, in particular in the generalized degrees of freedom framework for asymptotic analysis and interference alignment which have led to constant gap to capacity results for Gaussian interference channels. Unfortunately, practical adoption of these results has been slowed by their reliance on unrealistic assumptions like perfect channel state information at the transmitter and intricate constructions based on alignment over transcendental dimensions of real numbers. It is therefore necessary to devise transmission methods and coexistence schemes that fall under the umbrella of existing interference management and cognitive radio toolbox and deliver close to optimal performance. In this thesis we work on the theme of designing and characterizing the performance of conceptually simple transmission schemes that are robust and achieve performance that is close to optimal. In particular, our work is broadly divided into two parts. In the rst part, looking at cognitive radio networks, we seek to relax the assumption of non-causal knowledge of primary user's message at the secondary user's transmitter. We study a cognitive channel model based on Gaussian interference channel that does not assume anything about users other than primary user's priority over secondary user in reaching its desired quality of service. We characterize this quality of service requirement as a minimum rate that the primary user should be able to achieve. Studying the achievable performance of simple encoding and decoding schemes in this scenario, we propose a few di erent simple encoding schemes and explore di erent decoder designs. We show that surprisingly, all these schemes achieve the same rate region. Next, we study the problem of rate maximization faced by the secondary user subject to primary's QoS constraint. We show that this problem is not convex or smooth in general. We then use the symmetry properties of the problem to reduce its solution to a feasibly implementable line search. We also provide numerical results to demonstrate the performance of the scheme. Continuing on the theme of simple yet well-performing schemes for wireless networks, in the second part of the thesis, we direct our attention from two-user cognitive networks to the problem of smart interference management in large wireless networks. Here, we study the problem of interference-aware wireless link scheduling. Link scheduling is the problem of allocating a set of transmission requests into as small a set of time slots as possible such that all transmissions satisfy some condition of feasibility. The feasibility criterion has traditionally been lack of pair of links that interfere too much. This makes the problem amenable to solution using graph theoretical tools. Inspired by the recent results that the simple approach of treating interference as noise achieves maximal Generalized Degrees of Freedom (which is a measure that roughly captures how many equivalent single-user channels are contained in a given multi-user channel) and the generalization that it can attain rates within a constant gap of the capacity for a large class of Gaussian interference networks, we study the problem of scheduling links under a set Signal to Interference plus Noise Ratio (SINR) constraint. We show that for nodes distributed in a metric space and obeying path loss channel model, a re ned framework based on combining geometric and graph theoretic results can be devised to analyze the problem of nding the feasible sets of transmissions for a given level of desired SINR. We use this general framework to give a link scheduling algorithm that is provably within a logarithmic factor of the best possible schedule. Numerical simulations con rm that this approach outperforms other recently proposed SINR-based approaches. Finally, we conclude by identifying open problems and possible directions for extending these results

Advances in Stereo Vision

Stereopsis is a vision process whose geometrical foundation has been known for a long time, ever since the experiments by Wheatstone, in the 19th century. Nevertheless, its inner workings in biological organisms, as well as its emulation by computer systems, have proven elusive, and stereo vision remains a very active and challenging area of research nowadays. In this volume we have attempted to present a limited but relevant sample of the work being carried out in stereo vision, covering significant aspects both from the applied and from the theoretical standpoints

SENSORY AND PERCEPTUAL CODES IN CORTICAL AUDITORY PROCESSING

A key aspect of human auditory cognition is establishing efficient and reliable representations about the acoustic environment, especially at the level of auditory cortex. Since the inception of encoding models that relate sound to neural response, three longstanding questions remain open. First, on the apparently insurmountable problem of fundamental changes to cortical responses depending on certain categories of sound (e.g. simple tones versus environmental sound). Second, on how to integrate inner or subjective perceptual experiences into sound encoding models, given that they presuppose existing, direct physical stimulation which is sometimes missed. And third, on how does context and learning fine-tune these encoding rules, as adaptive changes to improve impoverished conditions particularly important for communication sounds. In this series, each question is addressed by analysis of mappings from sound stimuli delivered-to and/or perceived-by a listener, to large-scale cortically-sourced response time series from magnetoencephalography. It is first shown that the divergent, categorical modes of sensory coding may unify by exploring alternative acoustic representations other than the traditional spectrogram, such as temporal transient maps. Encoding models of either of artificial random tones, music, or speech stimulus classes, were substantially matched in their structure when represented from acoustic energy increases –consistent with the existence of a domain-general common baseline processing stage. Separately, the matter of the perceptual experience of sound via cortical responses is addressed via stereotyped rhythmic patterns normally entraining cortical responses with equal periodicity. Here, it is shown that under conditions of perceptual restoration, namely cases where a listener reports hearing a specific sound pattern in the midst of noise nonetheless, one may access such endogenous representations in the form of evoked cortical oscillations at the same rhythmic rate. Finally, with regards to natural speech, it is shown that extensive prior experience over repeated listening of the same sentence materials may facilitate the ability to reconstruct the original stimulus even where noise replaces it, and to also expedite normal cortical processing times in listeners. Overall, the findings demonstrate cases by which sensory and perceptual coding approaches jointly continue to expand the enquiry about listeners’ personal experience of the communication-rich soundscape

Engineering planetary lasers for interstellar communication

Transmitting large amounts of data efficiently among neighboring stars will vitally support any eventual contact with extrasolar intelligence, whether alien or human. Laser carriers are particularly suitable for high-quality, targeted links. Space laser transmitter systems designed by this work, based on both demonstrated and imminent advanced space technology, could achieve reliable data transfer rates as high as 1 kb/s to matched receivers as far away as 25 pc, a distance including over 700 approximately solar-type stars. The centerpiece of this demonstration study is a fleet of automated spacecraft incorporating adaptive neural-net optical processing active structures, nuclear electric power plants, annular momentum control devices, and ion propulsion. Together the craft sustain, condition, modulate, and direct to stellar targets an infrared laser beam extracted from the natural mesospheric, solar-pumped, stimulated CO2 emission recently discovered at Venus. For a culture already supported by mature interplanetary industry, the cost of building planetary or high-power space laser systems for interstellar communication would be marginal, making such projects relevant for the next human century. Links using high-power lasers might support data transfer rates as high as optical frequencies could ever allow. A nanotechnological society such as we might become would inevitably use 10 to the 20th power b/yr transmission to promote its own evolutionary expansion out of the galaxy