Bilgisayar Mühendisliği Bölümü Koleksiyonu
Permanent URI for this collectionhttps://hdl.handle.net/20.500.11779/1940
Browse
5 results
Search Results
Article What Is the Effective Resolution of the Retinal Image of a Distant Face?(Vision Sciences Society Annual Meeting Abstract, 2023-08-01) Arslan , Şuayb Şefik; Fux, Michal; Sinha, PawanWe consider the following question: What is the effective resolution of a face image projected on the retina, when the face is at a specified distance from the eye? Though simple to state, this is a surprisingly challenging issue to resolve. The mapping between viewing distance and effective resolution cannot be readily derived based on the contrast sensitivity, Snellen acuity, or even the packing density of photoreceptors in the fovea. With initial guidelines derived from theoretical considerations, images of varying resolution were presented across a range of viewing distances. For each distance, participants were required to perform an ‘odd one out’ task. This involved detecting the one that was different from the rest in a 2x2 grid, with image resolution being the only dimension of variation. As the experiment progressed, the viewing distance decreased monotonically, and participants were able to detect increasingly subtle resolution differences between the three standard images and the outlier. The collected data have allowed us to establish the upper/lower bounds on the effective available resolution for typical human vision as a function of viewing distance. Interestingly, we find that humans perform significantly better, particularly at short ranges, than what a theoretical model predicts based on projected image size, cone density, and foveal extent. Accordingly, we suggest that the non-uniform in-fovea density, as well as less sharp fall-off in the acuity density function outside the fovea, need to be integrated into future theoretical models to translate viewing distance to perceived image characteristics. A pragmatic benefit of the <distance : effective-resolution> mapping is that it enables a direct comparison of human face recognition performance as assessed across blur and viewing distance. Additionally, it allows us to systematically compare human performance on face recognition at varying distances with that of machine vision systems using the common axis of resolution.Article Comparing Humans and Deep Neural Networks on Face Recognition Under Various Distance and Rotation Viewing Conditions(Journal of Vision, 2023-08-01) Fux, Michal; Arslan , Şuayb Şefik; Jang, Hojin; Boix, Xavier; Cooper, Avi; Groth, Matt J; Sinha, PawanHumans possess impressive skills for recognizing faces even when the viewing conditions are challenging, such as long ranges, non-frontal regard, variable lighting, and atmospheric turbulence. We sought to characterize the effects of such viewing conditions on the face recognition performance of humans, and compared the results to those of DNNs. In an online verification task study, we used a 100 identity face database, with images captured at five different distances (2m, 5m, 300m, 650m and 1000m) three pitch values (00 - straight ahead, +/- 30 degrees) and three levels of yaw (00, 45, and 90 degrees). Participants were presented with 175 trials (5 distances x 7 yaw and pitch combinations, with 5 repetitions). Each trial included a query image, from a certain combination of range x yaw x pitch, and five options, all frontal short range (2m) faces. One was of the same identity as the query, and the rest were the most similar identities, chosen according to a DNN-derived similarity matrix. Participants ranked the top three most similar target images to the query image. The collected data reveal the functional relationship between human performance and multiple viewing parameters. Nine state-of-the-art pre-trained DNNs were tested for their face recognition performance on precisely the same stimulus set. Strikingly, DNN performance was significantly diminished by variations in ranges and rotated viewpoints. Even the best-performing network reported below 65% accuracy at the closest distance with a profile view of faces, with results dropping to near chance for longer ranges. The confusion matrices of DNNs were generally consistent across the networks, indicating systematic errors induced by viewing parameters. Taken together, these data not only help characterize human performance as a function of key ecologically important viewing parameters, but also enable a direct comparison of humans and DNNs in this parameter regimeConference Object Citation - Scopus: 1Improved Bounds on the Moments of Guessing Cost(IEEE, 2022-06-26) Arslan, Suayb S.; Haytaoglu, ElifGuessing a random variable with finite or countably infinite support in which each selection leads to a positive cost value has recently been studied within the context of "guessing cost". In those studies, similar to standard guesswork, upper and lower bounds for the rho-th moment of guessing cost are described in terms of the known measure Renyi's entropy. In this study, we non-trivially improve the known bounds using previous techniques along with new notions such as balancing cost. We have demonstrated that the novel lower bound proposed in this work, achieves 5.84%, 18.47% higher values than that of the known lower bound for rho = 1 and rho = 5, respectively. As for the upper bound, the novel expression provides 10.93%, 5.54% lower values than that of the previously presented bounds for rho = 1 and rho = 5, respectively.Conference Object Citation - WoS: 2Citation - Scopus: 2Base Station-Assisted Cooperative Network Coding for Cellular Systems With Link Constraints(IEEE, 2022-06-26) Arslan, Suayb S.; Pourmandi, Massoud; Haytaoglu, ElifWe consider a novel distributed data storage/caching scenario in a cellular network, where multiple nodes may fail/depart simultaneously To meet reliability, we allow cooperative regeneration of lost nodes with the help of base stations allocated in a set of hierarchical layers1. Due to this layered structure, a symbol download from each base station has a different cost, while the link capacities between the nodes of the cellular system and the base stations are also constrained. Under such a setting, we formulate the fundamental trade-off with closed form expressions between repair bandwidth cost and the storage space per node. Particularly, the minimum storage as well as bandwidth cost points are formulated. Finally, we provide an explicit optimal code construction for the minimum storage regeneration point for a special set of system parameters.Conference Object Citation - WoS: 4Citation - Scopus: 4Cost of Guessing: Applications To Data Repair(Institute of Electrical and Electronics Engineers Inc., 2020-06-01) Arslan, Şuayb Şefik; Haytaoğlu, ElifIn this paper, we introduce the notion of cost of guessing and provide an optimal strategy for guessing a random variable taking values on a finite set whereby each choice may be associated with a positive finite cost value. Moreover, we drive asymptotically tight upper and lower bounds on the moments of cost of guessing problem. Similar to previous studies on the standard guesswork, established bounds on moments quantify the accumulated cost of guesses required for correctly identifying the unknown choice and are expressed in terms of the Rényi's entropy. A new random variable is introduced to bridge between cost of guessing and the standard guesswork and establish the guessing cost exponent on the moments of the optimal guessing. Furthermore, these bounds are shown to serve quite useful for finding repair latency cost for distributed data storage in which sparse graph codes may be utilized.