Rule-based Classification of Airborne Laser Scanner Data for Automatic Extraction of 3D Objects in the Urban Area

LiDAR technology has been widely adopted as a proper method for land cover classification.Recently with the development of technology, LiDAR systems can now capture high-resolutionmultispectral bands images with high-density LiDAR point cloud simultaneously. Therefore, it opens newopportunities for more precise automatic land-use classification methods by utilizing LiDAR data. Thisarticle introduces a combining technique of point cloud classification algorithms. The algorithms includeground detection, building detection, and close point classification - the classification is based on pointclouds’ attributes. The main attributes are heigh, intensity, and NDVI index calculated from 4 bands ofcolors extracted from multispectral images for each point. Data of the Leica City Mapper LiDAR systemin an area of 80 ha in Quang Xuong town, Thanh Hoa province, Vietnam was used to deploy theclassification. The data is classified into eight different types of land use consist of asphalt road, otherground, low vegetation, medium vegetation, high vegetation, building, water, and other objects. Theclassification workflow was implemented in the TerraSolid suite, with the result of the automation processcame out with 97% overall accuracy of classification points. The

3D Helmholtz resonator with two close point-like windows: Regularisation for Dirichlet case

In this paper, a model of 3D Helmholtz resonator with two close point-like windows is considered. The Dirichlet condition is assumed at the boundary. The model is based on the theory of self-adjoint extensions of symmetric operators in Pontryagin space. The model is explicitly solvable and allows one to obtain the equation for resonances (quasi-eigenvalues) in an explicit form. A proper choice of the model parameter leads to the coincidence of the model solution with the main term of the asymptotics (in the window width) of the realistic solution, corresponding to small windows. A regularization is suggested to obtain a realistic limiting result for two merging windows.

FOOD PHOTOGRAPHY PADA IKLAN DI INSTAGRAM

<div class="page" title="Page 1"><div class="layoutArea"><div class="column"><p><span>In an advertisement, sometimes there is a meaning that is not straightforwardly presented. Every product advertisement that uses the product is inseparable from the camera point of view. FOOD PHOTOGRAPHY ON ADVERTISING IN INSTAGRAM examines the relationship between camera placement (angle) in influencing the message conveyed by a product advertisement and how photography is used as visual rhetoric. The study was conducted qualitatively with a film semiotic analysis approach. Data on FOOD PHOTOGRAPHY ON ADVERTISING IN INSTAGRAM is grouped with only 1 structure, namely Visual Structure. It was analyzed diachronic using the signifier and signified views. </span></p><p><span>The purpose of this research is to find out and describe the meanings contained in food product advertisements on social media, where Instagram is the media chosen as the sample.<br /> This study uses several points of view in its study, namely a close point of view (Close Up), a Medium Viewpoint (Medium Close Up), and a flat point of view (flat lay). </span></p></div></div></div>

Multipolar Intuitionistic Fuzzy Set with Finite Degree and Its Application in BCK/BCI-Algebras

When events occur in everyday life, it is sometimes advantageous to approach them in two directions to find a solution for them. As a mathematical tool to handle these things, we can consider the intuitionistic fuzzy set. However, when events are complex and the key to a solution cannot be easily found, we feel the need to approach them for hours and from various directions. As mathematicians, we wish we had the mathematical tools that apply to these processes. If these mathematical tools were developed, we would be able to apply them to algebra, topology, graph theory, etc., from a close point of view, and we would be able to apply these research results to decision-making and/or coding theory, etc., from a distant point of view. In light of this view, the purpose of this study is to introduce the notion of a multipolar intuitionistic fuzzy set with finite degree (briefly, k-polar intuitionistic fuzzy set), and to apply it to algebraic structure, in particular, a BCK/BCI-algebra. The notions of a k-polar intuitionistic fuzzy subalgebra and a (closed) k-polar intuitionistic fuzzy ideal in a BCK/BCI-algebra are introduced, and related properties are investigated. Relations between a k-polar intuitionistic fuzzy subalgebra and a k-polar intuitionistic fuzzy ideal are discussed. Characterizations of a k-polar intuitionistic fuzzy subalgebra/ideal are provided, and conditions for a k-polar intuitionistic fuzzy subalgebra to be a k-polar intuitionistic fuzzy ideal are provided. In a BCI-algebra, relations between a k-polar intuitionistic fuzzy ideal and a closed k-polar intuitionistic fuzzy ideal are discussed. A characterization of a closed k-polar intuitionistic fuzzy ideal is considered, and conditions for a k-polar intuitionistic fuzzy ideal to be closed are provided.

Optimal Strategy for Multiple Evaders Against an Agile Pursuer

This paper focuses on the problem of multiple slow moving and less maneuverable evaders against an agile pursuer, addressing the optimal strategy for multiple evaders. This is the so-called wolf-sheep game. Two scenarios are examined: 1) both pursuer and evaders have perfect knowledge about opponents, and 2) the pursuer has limited detection capability. Since the wolf-sheep game involves the Boolean value state, the game is hard to solve using traditional methods. This paper adopts a hierarchical approach. The two player game is solved first. Then the solution of the multiplayer game is based on the two-player game and the pursuer chasing order. The optimal strategy is calculated based on Nash equilibrium. The game with limited detection capability is solved by maximizing the Close Point of Approach (CPA). The optimal solution will be found theoretically and numerically.

Superresolution without separation

This article provides a theoretical analysis of diffraction-limited superresolution, demonstrating that arbitrarily close point sources can be resolved in ideal situations. Precisely, we assume that the incoming signal is a linear combination of $M$ shifted copies of a known waveform with unknown shifts and amplitudes, and one only observes a finite collection of evaluations of this signal. We characterize properties of the base waveform such that the exact translations and amplitudes can be recovered from $2M+1$ observations. This recovery can be achieved by solving a weighted version of basis pursuit over a continuous dictionary. Our analysis shows that $\ell_1$-based methods enjoy the same separation-free recovery guarantees as polynomial root finding techniques, such as de Prony’s method or Vetterli’s method for signals of finite rate of innovation. Our proof techniques combine classical polynomial interpolation techniques with contemporary tools from compressed sensing.

High Resolution through Graded-Index Microoptics

By solving Helmholtz equations, relationships to describe propagating modes in an arbitrary graded-index planar waveguide are derived. We show that in the quadratic- and secant-index waveguides a minimal mode width is 0.4λ/n, where λ is the wavelength in free space and n is the refractive index on the fiber axis. By modeling in FullWAVE, we show that the high-resolution imaging can be achieved with half-pitch graded-index Mikaelian microlenses (ML) and Maxwell’s “fisheye” lenses. It is shown that using a 2D ML, the point source can be imaged near the lens surface as a light spot with the full width at half maximum (FWHM) of 0.12λ. This value is close to the diffraction limit for silicon (n=3.47) in 2D media FWHM=0.44λ/n=0.127λ. We also show that half-pitch ML is able to resolve at half-maximum two close point sources separated by a 0.3λ distance.