Morphological study of thin films: Simulation and experimental insights using horizontal visibility graph

We studied the morphological nature of various thin films such as silicon carbide (SiC), diamond (C), germanium (Ge), and gallium nitride (GaN) on silicon substrate Si(100) using the pulsed laser deposition (PLD) method and Monte Carlo simulation. We, for the first time, systematically employed the visibility algorithm graph to meticulously study the morphological features of various PLD grown thin films. These thin-film morphologies are investigated using random distribution, Gaussian distribution, patterned heights, etc. The nature of the interfacial height of individual surfaces is examined by a horizontal visibility graph (HVG). It demonstrates that the continuous interfacial height of the silicon carbide, diamond, germanium, and gallium nitride films are attributed to random distribution and Gaussian distribution in thin films. However, discrete peaks are obtained in the brush and step-like morphology of germanium thin films. Further, we have experimentally verified the morphological nature of simulated silicon carbide, diamond, germanium, and gallium nitride thin films were grown on Si(100) substrate by pulsed laser deposition (PLD) at elevated temperature. Various characterization techniques have been used to study the morphological, and electrical properties which confirmed the different nature of the deposited films on the Silicon substrate. Decent hysteresis behavior has been confirmed by current-voltage (IV) measurement in all the four deposited films. The highest current has been measured for GaN at ～60 nA and the lowest current in SiC at ～30 nA level which is quite low comparing with the expected signal level (μA). The HVG technique is suitable to understand surface features of thin films which are substantially advantageous for the energy devices, detectors, optoelectronic devices operating at high temperatures.     

An adaptive image steganographic scheme based on Noise Visibility Function and an optimal chaotic based encryption method

Steganography is the science of hiding secret message in an appropriate digital multimedia in such a way that the existence of the embedded message should be invisible to anyone apart from the sender or the intended recipient. This paper presents an irreversible scheme for hiding a secret image in the cover image that is able to improve both the visual quality and the security of the stego-image while still providing a large embedding capacity. This is achieved by a hybrid steganography scheme incorporates Noise Visibility Function (NVF) and an optimal chaotic based encryption scheme. In the embedding process, first to reduce the image distortion and to increase the embedding capacity, the payload of each region of the cover image is determined dynamically according to NVF. NVF analyzes the local image properties to identify the complex areas where more secret bits should be embedded. This ensures to maintain a high visual quality of the stego-image as well as a large embedding capacity. Second, the security of the secret image is brought about by an optimal chaotic based encryption scheme to transform the secret image into an encrypted image. Third, the optimal chaotic based encryption scheme is achieved by using a hybrid optimization of Particle Swarm Optimization (PSO) and Genetic Algorithm (GA) which is allowing us to find an optimal secret key. The optimal secret key is able to encrypt the secret image so as the rate of changes after embedding process be decreased which results in increasing the quality of the stego-image. In the extracting process, the secret image can be extracted from the stego-image losslessly without referring to the original cover image. The experimental results confirm that the proposed scheme not only has the ability to achieve a good trade-off between the payload and the stego-image quality, but also can resist against the statistics and image processing attacks.     

Automatic fog detection and estimation of visibility distance through use of an onboard camera

In this paper, we will present a technique for measuring visibility distances under foggy weather conditions using a camera mounted onboard a moving vehicle. Our research has focused in particular on the problem of detecting daytime fog and estimating visibility distances; thanks to these efforts, an original method has been developed, tested and patented. The approach consists of dynamically implementing Koschmieder's law. Our method enables computing the meteorological visibility distance, a measure defined by the International Commission on Illumination (CIE) as the distance beyond which a black object of an appropriate dimension is perceived with a contrast of less than 5%. Our proposed solution is an original one, featuring the advantage of utilizing a single camera and necessitating the presence of just the road and sky in the scene. As opposed to other methods that require the explicit extraction of the road, this method offers fewer constraints by virtue of being applicable with no more than the extraction of a homogeneous surface containing a portion of the road and sky within the image. This image preprocessing also serves to identify the level of compatibility of the processed image with the set of Koschmieder's model hypotheses. Nicolas Hautiére graduated from the École Nationale des Travaux Publics de l'État, France (2002). He received his M.S. and Ph.D. degree in computer vision, respectively, in 2002 and 2005 from Saint-Étienne University (France). From 2002, he is a researcher in the Laboratoire Central des Ponts et Chaussées (LCPC), Paris, France. His research interests include trafic engineering, computer vision, and pattern recognition. Jean-Philippe Tarel graduated from the École Nationale des Ponts et Chaussées, Paris, France (1991). He received his Ph.D. degree in Applied Mathematics from Paris IX-Dauphine University in 1996 and he was with the Institut National de Recherche en Informatique et Automatique (INRIA) from 1991 to 1996. From 1997 to 1998, he was a research associate at Brown University, USA. From 1999, he is a researcher in the Laboratoire Central des Ponts et Chaussées (LCPC), Paris, France, and from 2001 to 2003 in the INRIA. His research interests include computer vision, pattern recognition, and shape modeling. Jean Lavenant graduated from the École Nationale des Travaux Publics de l'État, Lyon, France (2001). He received the M.S. degree in Computer Vision from Jean Monnet university of Saint-Étienne in 2001. In 2001, he was a researcher in the Laboratoire Central des Ponts et Chaussées (LCPC). In 2002, he was a system engineer in Chicago (USA). He is currently an engineer for the french ministry of transports. Didier Aubert received the M.S. and Ph.D. degree, respectively, in 1985 and 1989 from the National Polytechnical Institut of Grenoble (INPG). From 1989--1990, he worked as a research scientist on the development of an automatic road following system for the NAVLAB at Carnegie Mellon University. From 1990–1994, he worked in the research department of a private company (ITMI). During this period he was the project leader of several projects dealing with computer vision. He is currently a researcher at INRETS since 1995 and works on Road traffic measurements, crowd monitoring, automated highway systems, and driving assistance systems for vehicles. He is an image processing expert for several companies, teaches at Universities (Paris VI, Paris XI, ENPC, ENST) and is at the editorial board of RTS (Research - Transport - Safety).     

On sorting triangles in a delaunay tessellation

In a two-dimensional Delaunay-triangulated domain, there exists a partial ordering of the triangles (with respect to a vertex) that is consistent with the two-dimensional visibility of the triangles from that vertex. An equivalent statement is that a polygon that is star-shaped with respect to a given vertex can be extended, one triangle at a time, until it includes the entire domain. Arbitrary planar triangulations do not possess this useful property which allows incremental processing of the triangles.This work was partially supported by the National Science Foundation's US-Italy Collaborative Research Program under Grant INT-8714578 and Information, Robotics, and Intelligent Research Grant IRI-8704781.     

Simple algorithms for searching a polygon with flashlights

The k-searcher is a mobile guard whose visibility is limited to k rays emanating from her position, where the direction of each ray can be changed continuously with bounded angular rotation speed. Given a polygonal region P, is it possible for the k-searcher to eventually see a mobile intruder that is arbitrarily faster than the searcher within P? We present O(n²)-time algorithms for constructing a search schedule of the 1-searcher and the 2-searcher, respectively. Our framework for the 1-searcher can be viewed as a modification of that of LaValle et al. [Proc. 16th ACM Symp. on Computational Geometry, 2000, pp. 260-269] and is naturally extended for the 2-searcher.     

External watchman routes

We consider the problem of finding a shortest watchman route from which the exterior of a polygon is visible (external watchman route). We present an O (n ⁴ log logn) algorithm to find shortest external watchman routes for simple polygons by transforming the external watchman route problem to a set of internal watchman route problems. Also, we present faster external watchman route algorithms for special cases. These include optimal O (n) algorithms for convex, monotone, star and spiral polygons and an O (n log logn) algorithm for rectilinear polygons.This work was supported in part by a grant from Texas Instruments, Inc. to S. Ntafos     

Optimum sweeps of simple polygons with two guards

A polygon P admits a sweep if two mobile guards can detect an unpredictable, moving target inside P  , no matter how fast the target moves. Two guards move on the polygon boundary and are required to always be mutually visible. The objective of this study is to find an optimum sweep such that the sum of the distances travelled by the two guards in the sweep is minimized. We present an O(n²)$O(n^2)$ time and O(n)$O(n)$ space algorithm for optimizing this metric, where n   is the number of vertices of the given polygon. Our result is obtained by reducing this problem to finding a shortest path between two nodes in a graph of size O(n)$O(n)$.     

基于实时拓扑图的发射台站网络监控管理系统

只要存在网络就必然会进行网络拓扑的管理,就一个短波发射台而言,网络设备的种类和类型繁多,路由器、交换机、服务器和防火墙等等.如果某个网络设备出了问题,有可能会导致整个网络都不能正常访问,通过实现网络拓扑图与实时状态关联,不仅将这个网络拓扑图展现出来后,同时也将各网络节点的运行状态实时展现,从而达到网络运行监控的可视性和预判性对网络运行全面监控.在设备或应用发生问题时,主动进行规划、防御和告警.     

An algorithm for recognizing palm polygons

A polygonP is said to be apalm polygon if there exists a pointxP such that the Euclidean shortest path fromx to any pointyP makes only left turns or only right turns. The set of all such pointsx is called thepalm kernel. In this paper we propose an O(E) time algorithm for recognizing a palm polygonP, whereE is the size of the visibility graph ofP. The algorithm recognizes the given polygonP as a palm polygon by computing the palm kernel ofP. If the palm kernel is not empty,P is a palm polygon.The extended abstract of this paper was reported at the Second Canadian Conference in Computational Geometry, pp. 246–251, 1990     

基于马尔算法的高速公路视频监控图像能见度研究

根据高速公路沿线的监控摄像机,对监控视频画面中的图像进行采集,通过对视频图像特征的分析处理,建立图像与真实场景之间的关系,根据图像特征随着真实场景的变化,运用图像处理的方法如：灰度变换、图像分割和特征提取等对图像进行图像处理,提出运用马尔算法,分别提取出目标物与背景,并将其逐一进行背景差计算,能够准确的监控图像中汽车的位置变化,确定目标物的位置,进而判别出能见度的大小。