Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 6944627
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 27, 20262026-05-27T13:19:53+00:00 2026-05-27T13:19:53+00:00

I have a table about inverse gamma correction these are the values coresponding from

  • 0

I have a table about inverse gamma correction these are the values coresponding from 0 to 256 down there. I need a way to calculate the inverse of this function -> something like 0, 2, 6, 9, …

I would appreciate it, if someone could tell me a freeware tool that could do that or an algorithm I could write in C.

0,
0,
1,
1,
1,
1,
2,
2,
2,
3,
3,
3,
3,
4,
4,
4,
5,
5,
5,
6,
6,
6,
6,
7,
7,
7,
8,
8,
8,
9,
9,
9,
10,
10,
10,
11,
11,
11,
12,
12,
12,
13,
13,
14,
14,
14,
15,
15,
15,
16,
16,
16,
17,
17,
18,
18,
18,
19,
19,
20,
20,
20,
21,
21,
22,
22,
22,
23,
23,
24,
24,
25,
25,
25,
26,
26,
27,
27,
28,
28,
29,
29,
30,
30,
31,
31,
31,
32,
32,
33,
33,
34,
34,
35,
35,
36,
37,
37,
38,
38,
39,
39,
40,
40,
41,
41,
42,
43,
43,
44,
44,
45,
45,
46,
47,
47,
48,
48,
49,
50,
50,
51,
52,
52,
53,
54,
54,
55,
56,
56,
57,
58,
58,
59,
60,
61,
61,
62,
63,
64,
64,
65,
66,
67,
67,
68,
69,
70,
71,
71,
72,
73,
74,
75,
76,
77,
77,
78,
79,
80,
81,
82,
83,
84,
85,
86,
87,
88,
89,
90,
91,
92,
93,
94,
95,
96,
97,
98,
99,
101,
102,
103,
104,
105,
106,
108,
109,
110,
111,
113,
114,
115,
116,
118,
119,
121,
122,
123,
125,
126,
128,
129,
131,
132,
134,
135,
137,
138,
140,
142,
143,
145,
147,
148,
150,
152,
154,
156,
157,
159,
161,
163,
165,
167,
169,
171,
173,
175,
178,
180,
182,
184,
187,
189,
191,
194,
196,
199,
201,
204,
207,
209,
212,
215,
218,
221,
224,
227,
230,
233,
236,
239,
243,
246,
249,
253,

  • 1 1 Answer
  • 1 View
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-27T13:19:54+00:00Added an answer on May 27, 2026 at 1:19 pm

    You are asking how to invert a lookup table for a nondecreasing function.
    This isn’t pretty (or even tested), but it might work in C:

    const int N=256;
    extern int nondecreasing_sequence[N];
    int invert_nondecreasing_sequence(int* sequence, int* inverse)
    {
      int x=0, y=*sequence++, inverse_length=1;
      for (*inverse++=y; ++x<N; sequence++)
      {
        if (y < *sequence)
        {
          *inverse++ = y = *sequence;
          inverse_length++;
        }
      }
      return inverse_length;
    }
    

    Or, in Perl (shown: on windows; on linux, you would interchange ‘ and “):

    perl -e "@a=map{split/,\s*/}@ARGV;@b=(0,grep{$a[$_]>$a[$_-1]}1..$#a);print join(', ',@b).chr(10)" "0, 0, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 5, 5, 5, ..."
    

    This question, as formulated (no real question about Gamma Correction) probably belongs in another forum.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I have a table of about a million rows and I need to update
I have a table with about 150 rows in it. These are the data
I have table with about 100+ fields. There are a number of date fields
I have a table about 10 million rows. We just imported it from another
I have a table with about 1000 cities. Sometimes, I need to search by
I have a table with about 5,000 rows which I build dynamically with jQyuery.
i have a table with about 200,000 records. i want to add a field
I have a fairly simple sync problem. I have a table with about 10
Okay, here's the situation: We have a table of about 50 columns (created by
I have a table that has about 1/2 million records in it. Each month

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.