Computational Micrograph Registration with Sieve Processes

1996 ◽  
Vol 54 ◽  
pp. 440-441
Author(s):  
P.J. Phillips ◽  
J. Huang ◽  
S. M. Dunn
Keyword(s):  
Planar Graph ◽  
Efficient Algorithm ◽  
Spatial Organization ◽  
Spatial Arrangement ◽  
Stereo Image ◽  
Image Model ◽  
Geometric Invariants ◽  
Point Set

In this paper we present an efficient algorithm for automatically finding the correspondence between pairs of stereo micrographs, the key step in forming a stereo image. The computation burden in this problem is solving for the optimal mapping and transformation between the two micrographs. In this paper, we present a sieve algorithm for efficiently estimating the transformation and correspondence.In a sieve algorithm, a sequence of stages gradually reduce the number of transformations and correspondences that need to be examined, i.e., the analogy of sieving through the set of mappings with gradually finer meshes until the answer is found. The set of sieves is derived from an image model, here a planar graph that encodes the spatial organization of the features. In the sieve algorithm, the graph represents the spatial arrangement of objects in the image. The algorithm for finding the correspondence restricts its attention to the graph, with the correspondence being found by a combination of graph matchings, point set matching and geometric invariants.

Explanation of Color Lines Based on a Simple Color Image Model

2018 ◽  
Vol 2018 (16) ◽  
pp. 296-1-296-5
Author(s):  
Megan M. Fuller ◽  
Jae S. Lim
Keyword(s):  
Color Image ◽  
Image Model

scholarly journals Blind Deblurring Based on Sigmoid Function

Sensors ◽  
2021 ◽  
Vol 21 (10) ◽  
pp. 3484
Author(s):  
Shuhan Sun ◽  
Lizhen Duan ◽  
Zhiyong Xu ◽  
Jianlin Zhang
Keyword(s):  
Performance Optimization ◽  
Degradation Process ◽  
Image Deconvolution ◽  
Sigmoid Function ◽  
Blind Image Deblurring ◽  
Linear Estimators ◽  
Blind Deblurring ◽  
Degraded Image ◽  
Excellent Property ◽  
Blind Image

Blind image deblurring, also known as blind image deconvolution, is a long-standing challenge in the field of image processing and low-level vision. To restore a clear version of a severely degraded image, this paper proposes a blind deblurring algorithm based on the sigmoid function, which constructs novel blind deblurring estimators for both the original image and the degradation process by exploring the excellent property of sigmoid function and considering image derivative constraints. Owing to these symmetric and non-linear estimators of low computation complexity, high-quality images can be obtained by the algorithm. The algorithm is also extended to image sequences. The sigmoid function enables the proposed algorithm to achieve state-of-the-art performance in various scenarios, including natural, text, face, and low-illumination images. Furthermore, the method can be extended naturally to non-uniform deblurring. Quantitative and qualitative experimental evaluations indicate that the algorithm can remove the blur effect and improve the image quality of actual and simulated images. Finally, the use of sigmoid function provides a new approach to algorithm performance optimization in the field of image restoration.

scholarly journals Tracking by Deblatting

2021 ◽  
Author(s):  
Denys Rozumnyi ◽  
Jan Kotera ◽  
Filip Šroubek ◽  
Jiří Matas
Keyword(s):  
High Speed ◽  
High Performance ◽  
Motion Blur ◽  
Velocity Estimation ◽  
High Speed Camera ◽  
Trajectory Function ◽  
Novel Approach ◽  
Blind Deblurring ◽  
Object Trajectories ◽  
Complex Trajectories

AbstractObjects moving at high speed along complex trajectories often appear in videos, especially videos of sports. Such objects travel a considerable distance during exposure time of a single frame, and therefore, their position in the frame is not well defined. They appear as semi-transparent streaks due to the motion blur and cannot be reliably tracked by general trackers. We propose a novel approach called Tracking by Deblatting based on the observation that motion blur is directly related to the intra-frame trajectory of an object. Blur is estimated by solving two intertwined inverse problems, blind deblurring and image matting, which we call deblatting. By postprocessing, non-causal Tracking by Deblatting estimates continuous, complete, and accurate object trajectories for the whole sequence. Tracked objects are precisely localized with higher temporal resolution than by conventional trackers. Energy minimization by dynamic programming is used to detect abrupt changes of motion, called bounces. High-order polynomials are then fitted to smooth trajectory segments between bounces. The output is a continuous trajectory function that assigns location for every real-valued time stamp from zero to the number of frames. The proposed algorithm was evaluated on a newly created dataset of videos from a high-speed camera using a novel Trajectory-IoU metric that generalizes the traditional Intersection over Union and measures the accuracy of the intra-frame trajectory. The proposed method outperforms the baselines both in recall and trajectory accuracy. Additionally, we show that from the trajectory function precise physical calculations are possible, such as radius, gravity, and sub-frame object velocity. Velocity estimation is compared to the high-speed camera measurements and radars. Results show high performance of the proposed method in terms of Trajectory-IoU, recall, and velocity estimation.

An improved image blind deblurring based on dark channel prior

2021 ◽  
Vol 17 (1) ◽  
pp. 40-46
Author(s):  
Man-wei Wang ◽  
Fu-zhen Zhu ◽  
Yu-yang Bai
Keyword(s):  
Dark Channel Prior ◽  
Blind Deblurring ◽  
Dark Channel

scholarly journals A Social Media Mining and Ensemble Learning Model: Application to Luxury and Fast Fashion Brands

Information ◽  
2021 ◽  
Vol 12 (4) ◽  
pp. 149
Author(s):  
Yulin Chen
Keyword(s):  
Public Participation ◽  
Brand Positioning ◽  
Image Model ◽  
Web Crawler ◽  
Fast Fashion ◽  
Social Media Mining ◽  
Fashion Brand ◽  
Community Information ◽  
Brand Information ◽  
Media Mining

This research proposes a framework for the fashion brand community to explore public participation behaviors triggered by brand information and to understand the importance of key image cues and brand positioning. In addition, it reviews different participation responses (likes, comments, and shares) to build systematic image and theme modules that detail planning requirements for community information. The sample includes luxury fashion brands (Chanel, Hermès, and Louis Vuitton) and fast fashion brands (Adidas, Nike, and Zara). Using a web crawler, a total of 21,670 posts made from 2011 to 2019 are obtained. A fashion brand image model is constructed to determine key image cues in posts by each brand. Drawing on the findings of the ensemble analysis, this research divides cues used by the six major fashion brands into two modules, image cue module and image and theme cue module, to understand participation responses in the form of likes, comments, and shares. The results of the systematic image and theme module serve as a critical reference for admins exploring the characteristics of public participation for each brand and the main factors motivating public participation.

Computer Investigation of a Latent-Image Model*

1965 ◽  
Vol 55 (4) ◽  
pp. 439 ◽  
Author(s):  
B. E. Bayer ◽  
J. F. Hamilton
Keyword(s):  
Image Model ◽  
Latent Image ◽  
Computer Investigation

Automatic verification method of progressive image model matching information based on machine learning

2021 ◽  
pp. 1-10
Author(s):  
Jie Yuan ◽  
Yuan Ji ◽  
Zhou Zhu ◽  
Liya Huang ◽  
Junfeng Qian ◽  
...  
Keyword(s):  
Machine Learning ◽  
Learning Algorithm ◽  
Design Method ◽  
Large Error ◽  
Model Matching ◽  
Target Image ◽  
Image Model ◽  
Verification Method ◽  
Low Performance

In order to solve the problems of large error and low performance of traditional progressive image model matching information checking methods, an automatic progressive image model matching information checking method based on machine learning is proposed. The generation method of progressive image is analyzed, and the target image sample is obtained. On this basis, machine learning algorithm is used to segment progressive image samples. In each image segmentation part, crawler technology is used to automatically collect progressive image model matching information, and under the constraint of image model matching information checking standard, automatic checking of progressive image model matching information is realized from geometric structure, image content and other aspects. Experimental results show that the verification error of the design method is reduced by 0.687 Mb, and the quality of progressive image is improved.

Sign in / Sign up

Export Citation Format

Share Document