Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userAutomatic Data Registration of Geostationary Payloads for Meteorological Applications at ISRO
84
0
0.0
(
0
)
Added by
Jignesh Bhatt Shashikant
Publication date
2018
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
The launch of KALPANA-1 satellite in the year 2002 heralded the establishment of an indigenous operational payload for meteorological predictions. This was further enhanced in the year 2003 with the launching of INSAT-3A satellite. The software for generating products from the data of these two satellites was taken up subsequently in the year 2004 and the same was installed at the Indian Meteorological Department, New Delhi in January 2006. Registration has been one of the most fundamental operations to generate almost all the data products from the remotely sensed data. Registration is a challenging task due to inevitable radiometric and geometric distortions during the acquisition process. Besides the presence of clouds makes the problem more complicated. In this paper, we present an algorithm for multitemporal and multiband registration. In addition, India facing reference boundaries for the CCD data of INSAT-3A have also been generated. The complete implementation is made up of the following steps: 1) automatic identification of the ground control points (GCPs) in the sensed data, 2) finding the optimal transformation model based on the match-points, and 3) resampling the transformed imagery to the reference coordinates. The proposed algorithm is demonstrated using the real datasets from KALPANA-1 and INSAT-3A. Both KALAPANA-1 and INSAT-3A have recently been decommissioned due to lack of fuel, however, the experience gained from them have given rise to a series of meteorological satellites and associated software; like INSAT-3D series which give continuous weather forecasting for the country. This paper is not so much focused on the theory (widely available in the literature) but concentrates on the implementation of operational software.
rate research
Read More
Knowledge of appropriate local fiber architecture is necessary to simulate patient-specific electromechanics in the human heart. However, it is not yet possible to reliably measure in-vivo fiber directions, especially in human atria. Thus, we present a method which defines the fiber architecture in arbitrarily shaped atria using image registration and reorientation methods based on atlas atria with fibers predefined from detailed histological observations. Thereby, it is possible to generate detailed fiber families in every new patient-specific geometry in an automated, time-efficient process. We demonstrate the good performance of the image registration and fiber definition on ten differently shaped human atria. Additionally, we show that characteristics of the electrophysiological activation pattern which appear in the atlas atria also appear in the patients atria. We arrive at analogous conclusions for coupled electro-mechano-hemodynamical computations.
Fluoroscopy is the standard imaging modality used to guide hip surgery and is therefore a natural sensor for computer-assisted navigation. In order to efficiently solve the complex registration problems presented during navigation, human-assisted annotations of the intraoperative image are typically required. This manual initialization interferes with the surgical workflow and diminishes any advantages gained from navigation. We propose a method for fully automatic registration using annotations produced by a neural network. Neural networks are trained to simultaneously segment anatomy and identify landmarks in fluoroscopy. Training data is obtained using an intraoperatively incompatible 2D/3D registration of hip anatomy. Ground truth 2D labels are established using projected 3D annotations. Intraoperative registration couples an intensity-based strategy with annotations inferred by the network and requires no human assistance. Ground truth labels were obtained in 366 fluoroscopic images across 6 cadaveric specimens. In a leave-one-subject-out experiment, networks obtained mean dice coefficients for left and right hemipelves, left and right femurs of 0.86, 0.87, 0.90, and 0.84. The mean 2D landmark error was 5.0 mm. The pelvis was registered within 1 degree for 86% of the images when using the proposed intraoperative approach with an average runtime of 7 seconds. In comparison, an intensity-only approach without manual initialization, registered the pelvis to 1 degree in 18% of images. We have created the first accurately annotated, non-synthetic, dataset of hip fluoroscopy. By using these annotations as training data for neural networks, state of the art performance in fluoroscopic segmentation and landmark localization was achieved. Integrating these annotations allows for a robust, fully automatic, and efficient intraoperative registration during fluoroscopic navigation of the hip.
Conducting surveillance of the Earths orbit is a key task towards achieving space situational awareness (SSA). Our work focuses on the optical detection of man-made objects (e.g., satellites, space debris) in Geostationary orbit (GEO), which is home to major space assets such as telecommunications and navigational satellites. GEO object detection is challenging due to the distance of the targets, which appear as small dim points among a clutter of bright stars. In this paper, we propose a novel multi-target detection technique based on topological sweep, to find GEO objects from a short sequence of optical images. Our topological sweep technique exploits the geometric duality that underpins the approximately linear trajectory of target objects across the input sequence, to extract the targets from significant clutter and noise. Unlike standard multi-target methods, our algorithm deterministically solves a combinatorial problem to ensure high-recall rates without requiring accurate initializations. The usage of geometric duality also yields an algorithm that is computationally efficient and suitable for online processing.
Feature crossing captures interactions among categorical features and is useful to enhance learning from tabular data in real-world businesses. In this paper, we present AutoCross, an automatic feature crossing tool provided by 4Paradigm to its customers, ranging from banks, hospitals, to Internet corporations. By performing beam search in a tree-structured space, AutoCross enables efficient generation of high-order cross features, which is not yet visited by existing works. Additionally, we propose successive mini-batch gradient descent and multi-granularity discretization to further improve efficiency and effectiveness, while ensuring simplicity so that no machine learning expertise or tedious hyper-parameter tuning is required. Furthermore, the algorithms are designed to reduce the computational, transmitting, and storage costs involved in distributed computing. Experimental results on both benchmark and real-world business datasets demonstrate the effectiveness and efficiency of AutoCross. It is shown that AutoCross can significantly enhance the performance of both linear and deep models.
Differentiable rendering is a technique to connect 3D scenes with corresponding 2D images. Since it is differentiable, processes during image formation can be learned. Previous approaches to differentiable rendering focus on mesh-based representations of 3D scenes, which is inappropriate for medical applications where volumetric, voxelized models are used to represent anatomy. We propose a novel Projective Spatial Transformer module that generalizes spatial transformers to projective geometry, thus enabling differentiable volume rendering. We demonstrate the usefulness of this architecture on the example of 2D/3D registration between radiographs and CT scans. Specifically, we show that our transformer enables end-to-end learning of an image processing and projection model that approximates an image similarity function that is convex with respect to the pose parameters, and can thus be optimized effectively using conventional gradient descent. To the best of our knowledge, this is the first time that spatial transformers have been described for projective geometry. The source code will be made public upon publication of this manuscript and we hope that our developments will benefit related 3D research applications.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
