A Novel Algorithm to Detect a QPSK Signal with the Minimum Number of Samples

2015 ◽  
pp. 11-20
Author(s):  
Mohammed Saleh ◽  
Hilmi Sanusi ◽  
Adamu I. Abubakar ◽  
Haruna Chiroma ◽  
Edi Sutoyo ◽  
...  
Keyword(s):  
Minimum Number ◽  
Novel Algorithm

Uniform Star Catalogue using GWKM Clustering for Application in Star Sensors

2019 ◽  
Vol 72 (04) ◽  
pp. 948-964 ◽  
Author(s):  
Farshad Somayehee ◽  
Amir Ali Nikkhah ◽  
Jafar Roshanian
Keyword(s):  
Scattered Data ◽  
Field Of View ◽  
Identification Algorithm ◽  
Star Sensor ◽  
Clustering Method ◽  
Double Stars ◽  
Star Catalogue ◽  
Data Density ◽  
Minimum Number ◽  
Novel Algorithm

In this paper, a novel algorithm of weighted k-means clustering with geodesic criteria is presented to generate a uniform database for a star sensor. For this purpose, selecting the appropriate star catalogue and desirable minimum magnitude and eliminating double stars are among the steps of the uniformity process. Further, Delaunay triangulation and determining the scattered data density by using a Voronoi diagram were used to solve the problems of the proposed clustering method. Thus, by running a Monte Carlo simulation to count the number of stars observed in different fields of view, it was found that the uniformity leads to a significant reduction of the probability of observing a large number of stars in all fields of view. In contrast, the uniformity slightly increased the field of view needed to observe the minimum number of required stars for an identification algorithm.

scholarly journals DEVELOPMENT OF NOVEL ALGORITHM FOR HAAR TRANSFORM USING PAIRED TRANSFORM: IMPLEMENTATION ON TMS DSP PROCESSORS.

2020 ◽  
Vol 9 (6) ◽  
pp. 16-30
Keyword(s):  
Image Processing ◽  
Fast Algorithm ◽  
Mathematical Structure ◽  
The Novel ◽  
Haar Transform ◽  
Minimum Number ◽  
Hartley Transforms ◽  
Dsp Processors ◽  
Paired Transform ◽  
Novel Algorithm

Paired transform splits the mathematical structure of many discrete unitary transforms, including the Fourier, Hadamard, Cosine and Hartley transforms, into the minimum number of short transforms. The discrete Haar transform that is very useful in many signal and image processing applications can be also calculated by the fast paired transform. The Haar transform can be considered as the particular case of the paired transforms, namely the 2-paired transform. In this research a Novel Fast algorithm for Haar transform is developed using paired transform: Paired Fast Haar Transform (Paired FHT). For illustration purposes relation between the Haar and paired transforms are described using the examples for 16, 8, 4 – point transforms are analyzed in detail. Finally the novel Haar transform: Paired Fast Haar transform is implemented using Code Compose Studio for TMS DSP processor Starter Kit (TMS DSK) TMS 320 C 6713 DSP processor for understanding the possible sampling rates.

Information capacity and bandwidth limitations in the SEM

1989 ◽  
Vol 47 ◽  
pp. 84-85
Author(s):  
D. C. Joy ◽  
R. D. Bunn
Keyword(s):  
Signal To Noise Ratio ◽  
Critical Dimension ◽  
Information Capacity ◽  
Acquisition Time ◽  
Signal To Noise ◽  
Sem Image ◽  
Probe Size ◽  
Minimum Number ◽  
Noise Ratio ◽  
Signal Channel

The information available from an SEM image is limited both by the inherent signal to noise ratio that characterizes the image and as a result of the transformations that it may undergo as it is passed through the amplifying circuits of the instrument. In applications such as Critical Dimension Metrology it is necessary to be able to quantify these limitations in order to be able to assess the likely precision of any measurement made with the microscope.The information capacity of an SEM signal, defined as the minimum number of bits needed to encode the output signal, depends on the signal to noise ratio of the image - which in turn depends on the probe size and source brightness and acquisition time per pixel - and on the efficiency of the specimen in producing the signal that is being observed. A detailed analysis of the secondary electron case shows that the information capacity C (bits/pixel) of the SEM signal channel could be written as :

Applying Generalizability Theory to Optimize Analysis of Spontaneous Teacher Talk in Elementary Classrooms

2020 ◽  
Vol 63 (6) ◽  
pp. 1947-1957
Author(s):  
Alexandra Hollo ◽  
Johanna L. Staubitz ◽  
Jason C. Chow
Keyword(s):  
Special Education Teachers ◽  
Generalizability Theory ◽  
Child Outcomes ◽  
Elementary Classrooms ◽  
Teacher Talk ◽  
Group Instruction ◽  
Data Set ◽  
School Year ◽  
Minimum Number ◽  
Representative Samples

Purpose Although sampling teachers' child-directed speech in school settings is needed to understand the influence of linguistic input on child outcomes, empirical guidance for measurement procedures needed to obtain representative samples is lacking. To optimize resources needed to transcribe, code, and analyze classroom samples, this exploratory study assessed the minimum number and duration of samples needed for a reliable analysis of conventional and researcher-developed measures of teacher talk in elementary classrooms. Method This study applied fully crossed, Person (teacher) × Session (samples obtained on 3 separate occasions) generalizability studies to analyze an extant data set of three 10-min language samples provided by 28 general and special education teachers recorded during large-group instruction across the school year. Subsequently, a series of decision studies estimated of the number and duration of sessions needed to obtain the criterion g coefficient ( g > .70). Results The most stable variables were total number of words and mazes, requiring only a single 10-min sample, two 6-min samples, or three 3-min samples to reach criterion. No measured variables related to content or complexity were adequately stable regardless of number and duration of samples. Conclusions Generalizability studies confirmed that a large proportion of variance was attributable to individuals rather than the sampling occasion when analyzing the amount and fluency of spontaneous teacher talk. In general, conventionally reported outcomes were more stable than researcher-developed codes, which suggests some categories of teacher talk are more context dependent than others and thus require more intensive data collection to measure reliably.

RGB Frequency Based Image Steganography

2020 ◽  
pp. 549-553
Author(s):  
Himanshu Kumar ◽  
Nitesh Kumar
Keyword(s):  
Image Steganography ◽  
Minimum Number

In this paper, we introduced a new RGB technique for image steganography. In this technique we introduced the idea of storing a different number of bits per channel (R, G or B) of a pixel based on the frequency of color values of pixel. The higher color frequency retains the maximum number of bits and lower color frequency stores the minimum number of bits.

On Number of Planes of Rearrangeably Nonblocking Optical Banyan Networks with Link Failures

2008 ◽  
Vol 1 (1) ◽  
pp. 43-54
Author(s):  
Basra Sultana ◽  
Mamun-ur-Rashid Khandker
Keyword(s):  
Optical Switching ◽  
Blocking Probability ◽  
Link Failure ◽  
Link Failures ◽  
Small Depth ◽  
Internal Link ◽  
Banyan Network ◽  
Minimum Number ◽  
Switch Design ◽  
Banyan Networks

Vertically stacked optical banyan (VSOB) networks are attractive for serving as optical switching systems due to the desirable properties (such as the small depth and self-routing capability) of banyan network structures. Although banyan-type networks result in severe blocking and crosstalk, both these problems can be minimized by using sufficient number of banyan planes in the VSOB network structure. The number of banyan planes is minimum for rearrangeably nonblocking and maximum for strictly nonblocking structure. Both results are available for VSOB networks when there exist no internal link-failures. Since the issue of link-failure is unavoidable, we intend to find the minimum number of planes required to make a VSOB network nonblocking when some links are broken or failed in the structure. This paper presents the approximate number of planes required to make a VSOB networks rearrangeably nonblocking allowing link-failures. We also show an interesting behavior of the  blocking  probability of a faulty VSOB networks that the blocking probability may not  always  increase monotonously with  the  increase  of  link-failures; blocking probability  decreases  for  certain range of  link-failures, and then increases again. We believe that such fluctuating behavior of blocking probability with the increase of link failure probability deserves special attention in switch design.  Keywords: Banyan networks; Blocking probability; Switching networks; Vertical stacking; Link-failures. © 2009 JSR Publications. ISSN: 2070-0237(Print); 2070-0245 (Online). All rights reserved. DOI: 10.3329/jsr.v1i1.1070

Developing an Inkjet Printer I: RGB Image to CMY Ink Amounts - Image Processing and Color Management

2020 ◽  
Vol 2020 (15) ◽  
pp. 350-1-350-10
Author(s):  
Yin Wang ◽  
Baekdu Choi ◽  
Davi He ◽  
Zillion Lin ◽  
George Chiu ◽  
...  
Keyword(s):  
Image Processing ◽  
Low Cost ◽  
Experimental Results ◽  
Color Management ◽  
Finger Nail ◽  
Inkjet Printer ◽  
Rgb Image ◽  
Novel Algorithm

In this paper, we will introduce a novel low-cost, small size, portable nail printer. The usage of this system is to print any desired pattern on a finger nail in just a few minutes. The detailed pre-processing procedures will be described in this paper. These include image processing to find the correct printing zone, and color management to match the patterns’ color. In each phase, a novel algorithm will be introduced to refine the result. The paper will state the mathematical principles behind each phase, and show the experimental results, which illustrate the algorithms’ capabilities to handle the task.

Sign in / Sign up

Export Citation Format

Share Document