Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons™

Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences

Utah State University

Series

2016

Articles 1 - 6 of 6

Full-Text Articles in Physical Sciences and Mathematics

Computer Vision–Based Orthorectification And Georeferencing Of Aerial Image Sets, Mohammadreza Faraji, Xiaojun Qi, Austin Jensen Sep 2016

Computer Vision–Based Orthorectification And Georeferencing Of Aerial Image Sets, Mohammadreza Faraji, Xiaojun Qi, Austin Jensen

Computer Science Faculty and Staff Publications

Generating a georeferenced mosaic map from unmanned aerial vehicle (UAV)imagery is a challenging task. Direct and indirect georeferencing methods may fail to generate an accurate mosaic map due to the erroneous exterior orientation parameters stored in the inertial measurement unit (IMU), erroneous global positioning system (GPS) data, and difficulty inlocating ground control points (GCPs) or having a sufficient number of GCPs. This paperpresents a practical framework to orthorectify and georeference aerial images using the robustfeatures-based matching method. The proposed georeferencing process is fully automatic and does not require any GCPs. It is also a near real-time process which can be …

Go to article

On The Geodesic Centers Of Polygonal Domains, Haitao Wang Aug 2016

On The Geodesic Centers Of Polygonal Domains, Haitao Wang

Computer Science Faculty and Staff Publications

In this paper, we study the problem of computing Euclidean geodesic centers of a polygonal domain P of n vertices. We give a necessary condition for a point being a geodesic center. We show that there is at most one geodesic center among all points of P that have topologically-equivalent shortest path maps. This implies that the total number of geodesic centers is bounded by the size of the shortest path map equivalence decomposition of P, which is known to be O(n^{10}). One key observation is a pi-range property on shortest path lengths when points are moving. With these observations, …

Go to article

Ε-Kernel Coresets For Stochastic Points, Haitao Wang, Lingxiao Huang, Jian Li, Jeff Mark Phillips Aug 2016

Ε-Kernel Coresets For Stochastic Points, Haitao Wang, Lingxiao Huang, Jian Li, Jeff Mark Phillips

Computer Science Faculty and Staff Publications

With the dramatic growth in the number of application domains that generate probabilistic, noisy and uncertain data, there has been an increasing interest in designing algorithms for geometric or combinatorial optimization problems over such data. In this paper, we initiate the study of constructing epsilon-kernel coresets for uncertain points. We consider uncertainty in the existential model where each point's location is fixed but only occurs with a certain probability, and the locational model where each point has a probability distribution describing its location. An epsilon-kernel coreset approximates the width of a point set in any direction. We consider approximating the …

Go to article

Quantum Computing Vs. Conventional Computing: Near-Term Solution Is Smart Distributed Systems, Seyed M.H. Mansourbeigi, Stephen W. Clyde Apr 2016

Quantum Computing Vs. Conventional Computing: Near-Term Solution Is Smart Distributed Systems, Seyed M.H. Mansourbeigi, Stephen W. Clyde

Computer Science Student Research

Are we getting to the end of Moore's law????? Moore's law which is held for 50 years tells computer power doubling every 18 months may begin to expire in the next 10 or so years. Imagine you buy a computer having the same power as the last year and the year before last year. Would you buy a new computer? Or upgrade? The present computer model is CPU with I/O's and combination of logical gates, and software which controls these I/O's based on finite automata and Turing machine. Basically the above hard-ware software model manipulates the 0 and 1 bits.

Go to article

Unsupervised Saliency Estimation Based On Robust Hypotheses, Fei Xu, Min Xian, H. D. Cheng, Jianrui Ding, Yingtao Zhang Mar 2016

Unsupervised Saliency Estimation Based On Robust Hypotheses, Fei Xu, Min Xian, H. D. Cheng, Jianrui Ding, Yingtao Zhang

Computer Science Faculty and Staff Publications

Visual saliency estimation based on optimization models is gaining increasing popularity recently. In this paper, we formulate saliency estimation as a quadratic program (QP) problem based on robust hypotheses. First, we propose an adaptive center-based bias hypothesis to replace the most common image center-based center-bias. It calculates the weighted center by utilizing local contrast which is much more robust when the objects are far away from the image center. Second, we model smoothness term on saliency statistics of each color. It forces the pixels with similar colors to have similar saliency statistics. The proposed smoothness term is more robust than …

Go to article

Cofibrations In The Category Of Noncommutative Cw Complexes, Vida Milani, Ali Asghar Rezaei, Seyed M.H. Mansourbeigi Jan 2016

Cofibrations In The Category Of Noncommutative Cw Complexes, Vida Milani, Ali Asghar Rezaei, Seyed M.H. Mansourbeigi

Computer Science Student Research

Cofibration in the category of noncommutative CW complexes is defined. The C*-algebraic counterparts of topological mapping Cylinder and mapping cone are presented as examples of noncommutative CW complex cofibres. As a generalization, the concepts of noncommutative mapping cylindrical and conical telescope are introduced to provide more examples of NCCW complex cofibres. Their properties and K-theoretic behavior are also studied in detail. We will see that they carry the properties similar to the topological properties of their CW complex counterparts.

Go to article