This contribution describes an efficient and simple preprocessing algorithm for finding a convex hull, maximum distance of points or convex hull diameter, and the smallest enclosing circle in $E^2$. The proposed algorithm is convenient for large data ...

This paper proposes a novel method to efficiently solve infeasible low-dimensional linear programs (LDLPs) with billions of constraints and a small number of unknown variables, where all the constraints cannot be satisfied simultaneously. We focus on ...

We study the natural extended-variable formulation for the disjunction of $n+1$ polytopes in ${\mathbb{R}}^d$. We demonstrate that the convex hull $\mathcal{D}$ in the natural extended-variable space ${\mathbb{R}}^{d+n}$ is given by full optimal big-M lifting (i) when $d\le 2$ (and that it is ...$\mathrm{}$$\mathcal{}$

Most diseases are diagnosed from image data like CT scans, MRIs, and X-rays. Gene data carries vital information related to the diseases that needs to be analysed for diagnosis. Both the logics are combined and a flexible deep ensemble learning-based ...

Spectral rendering is a crucial solution for photorealistic rendering. However, most available texture assets are RGB-only, and access to spectral content is limited. Uplifting methods that recover full spectral representations from RGB inputs have ...

Efficient bitrate ladders can enhance on-demand streaming services when bandwidth is constrained. Moreover, content-agnostic bitrate-resolution pairs in fixed bitrate ladders can lead to inefficient compression of video contents. Convex hull, which ...

Achieving a reliable obstacle detection system for small unmanned aerial vehicle (UAV) is very challenging due to its size and weight constraints. Prior works tend to employ the vision sensor as main detection sensor but resulting to high dependency on ...

The electricity production of a thermal generator is often constrained by the available fuel supply. These fuel constraints impose a maximum bound on the energy output over multiple time periods. Fuel constraints are increasingly important in electricity ...

The convex hull is the minimum convex set which encloses a given point set. A problem to find convex hulls is not only one of the most fundamental algorithms in computer geometry, but also has a wide variety of practical applications such as robotics ...

The smallest enclosing circle is a well-known problem. In this paper, we propose modifications to speed-up the existing Weltzl’s algorithm. We perform the preprocessing to reduce as many input points as possible. The reduction step has lower computational ...

Minutiae extraction-based fingerprint recognition is important for person authentication. However, missing and spurious minutiae were leads to inaccuracy. Herein an attempt has been made to overcome this challenge and achieve a higher degree of accuracy ...

Coresets are succinct summaries of large datasets such that, for a given problem, the solution obtained from a coreset is provably competitive with the solution obtained from the full dataset. As such, coreset-based data summarization techniques have ...

We consider space-bounded computations on a random-access machine, where the input is given on a read-only random-access medium, the output is to be produced to a write-only sequential-access medium, and the available workspace allows random reads and ...

A finite-time consensus protocol is developed for a connected network of agents, where communication between agents occurs locally, some of the agents are malicious, and the non-malicious or cooperative agents do not know the identities of the malicious ...

The graph-based manifold ranking saliency detection only relies on the boundary background to extract foreground seeds, resulting in a poor saliency detection result, so a method that obtains robust foreground for manifold ranking is proposed in ...

A communication network is a graph in which each node has only local information about the graph and nodes communicate by passing messages along its edges. Here, we consider the geometric communication network where the nodes also occupy points in ...

With the increasing penetration of intermittent renewable energy and fluctuating electricity loads, power system operators are facing significant challenges in maintaining system load balance and reliability. In addition to traditional energy markets that ...

Automated classification of three-dimensional geometric models is significant for three-dimensional shape retrieval as well as artificial intelligence application in areas such as civil engineering and mechanical engineering. In this paper, we proposed ...

Optic disk (OD) localization is a significant step when processing the retinal images in computer-aided diagnosis. In order to determine the location of OD precisely and robustly, an OD localization algorithm based on support vector machine (SVM) is ...

The randomized incremental convex hull algorithm is one of the most practical and important geometric algorithms in the literature. Due to its simplicity, and the fact that many points or facets can be added independently, it is also widely used in ...