TweetFollow Us on Twitter

May 96 Challenge
Volume Number:12
Issue Number:5
Column Tag:Programmer’s Challenge

Programmer’s Challenge

By Bob Boonstra, Westford, Massachusetts

Note: Source code files accompanying article are located on MacTech CD-ROM or source code disks.

Edge Detector

This month’s Challenge is to write a small image-processing application that scans a color image and identifies the boundaries of possible objects in that image. Applications for such a program might include image enhancement, special effects, or pattern recognition, although those applications would use a more sophisticated approach for detecting edges than we will be implementing for this Challenge.

The prototype for the code you should write is:

typedef enum {
 redOnly=1, greenOnly, redAndGreen, blueOnly,
 redAndBlue, greenAndBlue, redGreenAndBlue
} EdgeType;

void EdgeDetect(
 PixMapHandle pMapH, /* find edges in this PixMap */
 BitMap *bMap,   /* store edges in this BitMap */
 unsigned short threshold,/* color separations >= dist create an edge */
 EdgeType eType  /* which color components to look at */
);

Each pixel in the PixMap should be compared to the eight (or fewer) adjacent pixels differing in position by up to one row or column. If the pixel color is sufficiently different (as defined below) from any of the adjacent pixels, then the bit in the BitMap corresponding to that pixel should be set to 1. Otherwise, the BitMap bit should be set to 0. Obviously, pixels located in the first and last row and column will have fewer than eight adjacent pixels.

Whether two pixels differ by enough to constitute an edge is determined by comparing their rgb values. The distance between two pixels is the root-mean-square difference between the color components of their rgb values, considering only those components specified in the input EdgeType. For example, if the EdgeType is greenOnly, then the distance between two pixels is the absolute value of the difference in the green components of their colors. If the EdgeType is redGreenAndBlue, then the distance is the square root of the sum of the squares of the differences of the red components, the green components, and the blue components.

As a specific example, suppose we have two pixels with (red, green, blue) values of (0x1000, 0x2000, 0x4000) and (0x2000, 0x5000, 0xB000). The distance between these two pixels is:

 redOnly: 0x1000
 redAndGreen:    0x3298=sqrt(0x01000000+0x09000000)
 redGreenAndBlue:0x7AE5=sqrt(0x01000000+0x09000000+0x31000000)

Two pixels define an edge if their distance is greater than or equal to the threshold parameter. The threshold parameter is deliberately declared to be an unsigned short, even though pixels can differ by a greater amount. Since the definition of distance is symmetric, the bits corresponding to both edge pixels would be set in the BitMap.

The BitMap will be allocated and initialized for you by the calling routine. The storage pointed to by the BitMap baseAddr will also be allocated and initialized to zero. The bounds rectangles will be the same for the BitMap and the PixMap. Your code needs to deal with pixelSize values of 8, 16, or 32, with each case being equally weighted in the scoring. For PixMaps with indexed pixels, you will obviously need to look at the color table to find the rgb value corresponding to a given index. In the 16-bit case, you should follow the rules for converting a 5-bit color component into an 8-bit RGBColor component value (i.e., replicating the 3 most significant bits and appending them to constitute the least significant bits of the 8-bit component).

This will be a native PowerPC Challenge, scored using the latest Metrowerks C compiler. (No C++ or Pascal this month.)

Entries Due Ten Days Earlier

Although two issues may seem like a long time to wait for the results of the Challenge, it has always been a challenge (no pun intended) to complete the scoring of results in time for publication two issues later. We have been searching for a way to allow a little more time for evaluating the entries and writing the column without introducing any additional delay between publication of the problem and publication of the solution. The Challenge mailing list has allowed us to deliver the Challenge to readers on a predictable schedule wherever they live, regardless of variations in mailing dates. We are going to use the mailing list to advance the due date for Challenge solutions, without reducing the amount of time available for solving the Challenge. Starting with this month’s contest, Challenge entries will be due earlier, on the 1st of the month printed on the front cover. We will mail the problem to the mailing list on the 12th of the preceding month, also about ten days earlier than before.

If you are not already a member of the Challenge mailing list, you can join the ~300 subscribers from 25 countries already on the list by sending email to macjordomo@listmail.xplain.com with the line “sub challenge-A YourName” in the body.

Two Months Ago Winner

The response to the Words the Reverse Challenge was overwhelming. I don’t know if it was due to allowing C++ and Pascal entries, or to the relative simplicity of the problem, but I received a record 45 entries to this Challenge. The Challenge was to write code that would reverse the order of words in a block of input text while preserving intervening white space and special characters, and adjusting capitalization of the reversed words to match that of corresponding input words. It is appropriate that the first Challenge admitting Pascal solutions was won by a well-known proponent of Pascal (see MacTech Magazine 12.4 [April 1996] 70, and p.20 of this issue). Congratulations to Peter Lewis (Perth, Australia), author of Anarchie, NetPresenz, ObiWan, and other shareware products, for submitting the fastest entry to the Words The Reverse Challenge.

The test cases included a number of short, untimed strings designed to verify correctness. To my surprise, more than one-third of the entries failed these tests (or crashed outright). People had problems with strings that contained a single word, with strings that began with punctuation, with words of a single letter, and with the middle word in strings that contained an odd number of words. Remember, correctness is the first requirement for your solution.

For the timing tests, I ran a set of cases averaging around 40,000 words per case, totaling upwards of 500,000 words and 3 million characters for all cases. I eliminated from the input any “words” that started with a digit, because the problem statement was silent on how to deal with capitalization in that case. A number of people, including the winner, chose to treat words starting with digits as capitalization-neutral, so that the word being exchanged with the digit-word retained its original capitalization. This was a very reasonable approach (and I wish I had included it in the problem statement), but since the problem was silent, the fairest thing to do was to eliminate this condition from the test data.

The experiment allowing multiple languages and compilers went reasonably well. Most people, as requested, either provided a project/make file to link their solution with C code, or specifically indicated which compiler they wanted me to use. For those C entries that did not indicate a preference, I used the Metrowerks C compiler. A few people submitted solutions for environments that either did not generate native PowerPC code (e.g., non-SPM THINK C) or did not link with C code (e.g., THINK Pascal). For those entries, I mapped them to the closest possible environment (SPM C and Metrowerks Pascal, in these two cases).

Here are the times, compiler selection, code size, and data size for the correct solutions. Numbers in parentheses are the cumulative point total for all previous Challenges, not including this one.

Nametimecompilercodedata
Peter N Lewis (10)525MW Pascal89642
Ludovic Nicolle (4)602MW C12408
Kevin M. Cutts (50)607MW C65620
Gary Beith (20)626MW C20888
Ernst Munter (132)630MW C680560
Robert Marsa650MW C55259
Eric Lengyel (40)669MW C368140
John Nevard (17)670MW C56420
Wolfgang Thaller (4)681MW C61620
Randy Boring687MW C10432024
Bill Karsh (80)695MW C11288
Kirill Medvinsky703MW C++54012
Mark Bassam Salem705MW C++59232
Tom Saxton (10)710MW C360422
Karl Anderson716MW C604536
Lars Farm762MW C++90470
David McLeod842MW C5001315
Erik Sea884MW C760532
Robert Leslie/Geoff Hulten938MW C436268
Björn Davidsson (4)1122MW C++102020
Tom Stone1180SPM C75216
Gustav Larsson (87)1270MW C784536
Ryan Gronlie1294MW C44420
Michael White1397MW C1924130
Rishi Khan1447MW C9608
Richard Fattic1576MW C9088
Stefan C. Sinclair1668SPM MrC124840
David Newport2420SPM C78416
Ken Slezak (10)2468SPM C80816

To help understand why the single correct Pascal entry was faster than all of the C entries, I hand-translated the winning Pascal code into C, compiled it with several C compilers, and compared the results. I turned on all speed optimizations in each case, and optimized for the 604 processor when the compiler supported that option. Since conventional wisdom is that C is more efficient than Pascal, I expected to find that the winning algorithm would be faster in C than it was in Pascal. In fact, the results for two of the C compilers were essentially the same as the Pascal results, and one was measurably worse (for reasons that I did not have time to investigate). Here are the results of my test:

Environment / Languageexecution timecode size
Metrowerks / Pascal525896
Metrowerks / C533868
SPM / Symantec C536712
SPM / MrC6111992

Top 20 Contestants of All Time

Here are the Top Contestants for the Programmer’s Challenges to date, including everyone who has accumulated more than 20 points. The numbers below include points awarded for this month’s entrants.

RankNamePoints
1.[Name deleted]176
2.Munter, Ernst134
3.Gregg, Xan92
4.Larsson, Gustav87
5.Karsh, Bill80
6.Stenger, Allen65
7.Cutts, Kevin57
8.Riha, Stepan51
9.Goebel, James49
10.Nepsund, Ronald47
11.Mallett, Jeff44
12.Kasparian, Raffi42
13.Vineyard, Jeremy42
14.Lengyel, Eric40
15.Darrah, Dave31
16.Brown, Jorg30
17.Lewis, Peter30
18.Landry, Larry29
19.Beith, Gary24
20.Elwertowski, Tom24
21.Lee, Johnny22
22.Noll, Robert22

There are three ways to earn points: (1) scoring in the top 5 of any Challenge, (2) being the first person to find a bug in a published winning solution, or (3) being the first person to suggest a Challenge that I use. The points you can win are:

points to win table:

1st place20 points5th place2 points
2nd place10 pointsfinding bug2 points
3rd place7 pointssuggesting Challenge2 points
4th place4 points

Peter’s solution is relatively straightforward, and he hints in the preamble that he might have done better if he had spent more time on it. One tip that you might glean from Peter’s code is the way he allocates dynamic memory. First, he deals with small problems with memory allocated on the stack. Second, he uses NewHandle rather than NewPtr to allocate dynamic memory. NewHandle is faster than NewPtr, because NewPtr may move relocatable blocks around before doing the allocation to avoid fragmenting the heap. Peter also locks the handle before using it, which is always safe, but is not necessary unless your code does something that moves memory. Whether locking is necessary in this case depends on whether you believe the documentation that says BlockMove doesn’t move memory. Here is Peter’s winning solution:

Challenge.p

Peter N Lewis, peter@stairways.com.au

unit Challenge;

interface

 uses
 Types;
 
 type
 CharsArray = packed array[0..0] of byte;
 CharsArrayPtr = ^CharsArray;
 
 procedure ReverseTheWords( 
    text: CharsArrayPtr; 
    numCharsIn: longint );

implementation

 uses
 Memory;

{
    This is not really optimal, I felt compelled to send in a Pascal solution since I was
    one of the people who complained about the language bias.  I didn’t have time to 
    do this challenge justice.
    
    Method:
    *     Allocate a block of memory equal in size to numCharsIn (if numCharsIn < 2048, 
    we short circuit this to use a block of memory on the stack).
    *     Initialize a 0..255 array to determine whether a character is  an alphanum (I 
    could just use the ANSI ctype.p file, but without a macro call, there is a pretty 
    big hit).
    *     reverse the words from the source to our new buffer.  We move in from both
    ends,  copying non-alphanums, and then swapping words and fixing the case.
    *     BlockMoveData the buffer back to the source buffer.
    *     Release the memory if we allocated any.
}

 procedure ReverseTheWords( 
      text: CharsArrayPtr; 
      numCharsIn: longint );
 const
 stack_space_size = 2048;
 var
 space: packed array[0..stack_space_size] of byte;
 buffer: CharsArrayPtr;
 memory: Handle;
 leftin, leftout, rightin, rightout, leftedge, 
 rightedge: longint;
 i: longint;
 leftchar, rightchar: integer;
 alphanum_set:array[0..255] of Boolean;
 begin
    { allocate memory if needed }
 if numCharsIn < stack_space_size then begin
 memory := nil;
 buffer := @space;
 end else begin
 memory := NewHandle( numCharsIn );
 if memory = nil then begin
 DebugStr( 'Memory allocation failed!' );
 exit( ReverseTheWords );
 end;
 HLock(memory);
 buffer := CharsArrayPtr( memory^ );
 end;
 
    { init - I wish I could do this at compile time - Turbo Pascal can }
 for i := 0 to 255 do alphanum_set[i] := false;
 for i := 48 to 57 do alphanum_set[i] := true; { 0..9 }
 for i := 65 to 90 do alphanum_set[i] := true; { A..Z }
 for i := 97 to 122 do alphanum_set[i] := true; { a..z }

    { reverse }
 leftin := 0;
 leftout := leftin;
 rightin := numCharsIn - 1;
 rightout := rightin;
 while leftin <= rightin do begin
 while not alphanum_set[text^[leftin]] & (leftin <= rightin) 
                                                do begin
 buffer^[leftout] := text^[leftin];
 Inc(leftout);
 Inc(leftin);
 end;
 while not alphanum_set[text^[rightin]] & (leftin < rightin) 
                                                do begin
 buffer^[rightout] := text^[rightin];
 Dec(rightout);
 Dec(rightin);
 end;
 leftedge := leftin;
 rightedge := rightin;
 while alphanum_set[text^[leftin]] & (leftin <= rightin) 
                                                do begin
 Inc(leftin);
 end;
 if leftin > rightin then begin { central word, just copy, ignore case }
 for i := leftedge to leftin - 1 do begin
 buffer^[leftout] := text^[i];
 Inc(leftout);
 end;
 end else begin
 while alphanum_set[text^[rightin]] do begin 
    { there is a sentinel now, we dont need to check leftin < rightin }
 Dec(rightin);
 end;
 leftchar := text^[leftedge];
 rightchar := text^[rightin+1];
 if ( leftchar > 57 ) & ( rightchar > 57 ) then begin 
    { both letters }
 if leftchar > 90 then begin
 if rightchar <= 90 then begin
 rightchar := rightchar + $20;
 leftchar := leftchar - $20;
 end;
 end else begin
 if rightchar > 90 then begin
 rightchar := rightchar - $20;
 leftchar := leftchar + $20;
 end;
 end;
 end;
 buffer^[leftout] := rightchar;
 Inc(leftout);
 for i := rightin+2 to rightedge do begin
 buffer^[leftout] := text^[i];
 Inc(leftout);
 end;
 for i := leftin-1 downto leftedge+1 do begin
 buffer^[rightout] := text^[i];
 Dec(rightout);
 end;
 buffer^[rightout] := leftchar;
 Dec(rightout);
 end;
 end;
 
    { copy buffer }
 BlockMoveData( buffer, text, numCharsIn );
 
    { free memory if required }
 if memory <> nil then begin
 DisposeHandle( memory );
 end;
 end;
 
end.

 

Community Search:
MacTech Search:

Software Updates via MacUpdate

Is there cross-platform play in slither....
So you've sunken plenty of hours into crawling around in slither.io on your iPhone or iPad. You've got your stories of tragedy and triumph, the times you coiled four snakes at one time balanced out by the others when you had a length of more than... | Read more »
Rodeo Stampede guide to running a better...
In Rodeo Stampede, honing your skills so you can jump from animal to animal and outrun the herd as long as possible is only half the fun. Once you've tamed a few animals, you can bring them home with you. [Read more] | Read more »
VoxSyn (Music)
VoxSyn 1.0 Device: iOS Universal Category: Music Price: $6.99, Version: 1.0 (iTunes) Description: VoxSyn turns your voice into the most flexible vocal sound generator ever. Instantly following even subtle modulations of pitch and... | Read more »
Catch Battleplans on Google Play from Ju...
Real-time strategy title Battleplans is due for release on Google Play on June 30th, following its release for iOS systems last month. With its simple interface and pretty graphics, the crowd-pleaser brings a formerly overlooked genre out for the... | Read more »
iDoyle: The interactive Adventures of Sh...
iDoyle: The interactive Adventures of Sherlock Holmes - A Scandal in Bohemia 1.0 Device: iOS Universal Category: Books Price: $1.99, Version: 1.0 (iTunes) Description: Special Release Price $1.99 (Normally $3.99) | Read more »
Five popular free apps to help you slim...
Thanks to retail and advertising, we're used to thinking one season ahead. Here we are just a week into the summer and we're conditioned to start thinking about the fall. [Read more] | Read more »
How to ride longer and tame more animals...
It's hard to accurately describe Rodeo Stampede to people who haven't seen it yet. It's like if someone took Crossy Roadand Disco Zoo and put them in a blender, yet with a unique game mechanic that's still simple and fun for anyone. [Read more] | Read more »
Teeny Titans - A Teen Titans Go! Figure...
Teeny Titans - A Teen Titans Go! Figure Battling Game 1.0.0 Device: iOS Universal Category: Games Price: $3.99, Version: 1.0.0 (iTunes) Description: Teeny Titans, GO! Join Robin for a figure battling RPG of epic proportions! TEENY... | Read more »
NinjAwesome: Tips and tricks to be a mor...
Sorry about that headline, but I'm going to go ahead and assume that GameResort would not have named its game NinjAwesome without expecting some of that. It is, in fact, pretty awesome the way it combines an endless runner and old school arcade... | Read more »
Into Mirror (Games)
Into Mirror 1.0 Device: iOS Universal Category: Games Price: $1.99, Version: 1.0 (iTunes) Description: "Is all that we see or seem, but a dream within a dream?"- Edgar Allan Poe New game by Lemon Jam Studio, the team behind Pursuit... | Read more »

Price Scanner via MacPrices.net

15-inch Retina MacBook Pros on sale for $200-...
B&H Photo has 15″ Retina MacBook Pros on sale for up to $210 off MSRP. Shipping is free, and B&H charges NY tax only: - 15″ 2.2GHz Retina MacBook Pro: $1799.99 $200 off MSRP - 15″ 2.5GHz... Read more
Mac minis on sale for up to $100 off MSRP
B&H Photo has Mac minis on sale for up to $100 off MSRP including free shipping plus NY sales tax only: - 1.4GHz Mac mini: $449 $50 off MSRP - 2.6GHz Mac mini: $649 $50 off MSRP - 2.8GHz Mac mini... Read more
Clearance 2015 13-inch MacBook Airs available...
B&H Photo has clearance 2015 13″ MacBook Airs available for $300 off original MSRP. Shipping is free, and B&H charges NY sales tax only: - 13″ 1.6GHz/4GB/128GB MacBook Air (MJVE2LL/A): $799.... Read more
Apple refurbished Mac minis available for up...
Apple has Certified Refurbished Mac minis available starting at $419. Apple’s one-year warranty is included with each mini, and shipping is free: - 1.4GHz Mac mini: $419 $80 off MSRP - 2.6GHz Mac... Read more
ABBYY TextGrabber: 1,000,000 Installs in 5 Da...
ABBYY, an international OCR technologies provider, has announced that their image-to-text application TextGrabber, got installed 1,000,000 times in just five days while being featured by the App... Read more
New SkinIt Waterproof Case For iPhone 6
With its impact and waterproof design, the Skinit Waterproof case provides security and protection to guarantee your phone will get you through even the most demanding outdoor conditions. The impact-... Read more
iMacs on sale for up to $150 off MSRP
B&H Photo has 21″ and 27″ iMacs on sale for up to $150 off MSRP including free shipping plus NY sales tax only: - 27″ 3.3GHz iMac 5K: $2181.11 $118 off MSRP - 27″ 3.2GHz/1TB Fusion iMac 5K: $1949... Read more
12-inch 1.1GHz Retina MacBooks on sale for $5...
B&H Photo has 2016 12″ 1.1GHz/256GB Retina MacBooks on sale for up to $50 off MSRP. Shipping is free, and B&H charges NY tax only: - 12″ 1.1GHz Space Gray Retina MacBook: $1249 $50 off MSRP... Read more
WWDC Announcements Revisited Still Underwhelm...
I was disappointed that no new MacBook hardware was announced at this year’s all-software World Wide Developer’s Conference. Not even a hint about what’s in the development pipeline. Of course, we... Read more
Twelve South Compass 2 iPad Stand Now Availab...
Twelve South has updated its most popular iPad stand, Compass 2, with the introduction of two new colors — Gold and Rose Gold. These new color options n perfectly complement the new Rose Gold iPad... Read more

Jobs Board

*Apple* iPhone 6s and New Products Tester Ne...
…we therefore look forward to put out products to quality test for durability. Apple leads the digital music revolution with its iPods and iTunes online store, Read more
Music Marketing Lead, iTunes & *Apple*...
…Music Marketing Lead is responsible for developing robust marketing campaigns and programs for Apple Music and iTunes across the whole of Apple ecosystem. This Read more
*Apple* Valley Medical Clinic is Hiring - AP...
Apple Valley Medical Clinic is Hiring! Apple Valley Medical Clinic is an independently owned practice operating a Family Medicine Clinic, a 24/7 Urgent Care, Read more
*Apple* New Products Testers Needed - Apple...
…we therefore look forward to put out products to quality test for durability. Apple leads the digital music revolution with its iPods and iTunes online store, Read more
*Apple* Solutions Consultant - APPLE (United...
Job Summary As an Apple Solutions Consultant, you'll be the link between our future customers and our products. You'll showcase your entrepreneurial spirit as you Read more
All contents are Copyright 1984-2011 by Xplain Corporation. All rights reserved. Theme designed by Icreon.