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.

 
AAPL
$97.67
Apple Inc.
+0.64
MSFT
$44.50
Microsoft Corpora
+0.10
GOOG
$589.02
Google Inc.
-4.33

MacTech Search:
Community Search:

Software Updates via MacUpdate

TinkerTool 5.3 - Expanded preference set...
TinkerTool is an application that gives you access to additional preference settings Apple has built into Mac OS X. This allows to activate hidden features in the operating system and in some of the... Read more
Audio Hijack Pro 2.11.0 - Record and enh...
Audio Hijack Pro drastically changes the way you use audio on your computer, giving you the freedom to listen to audio when you want and how you want. Record and enhance any audio with Audio Hijack... Read more
Intermission 1.1.1 - Pause and rewind li...
Intermission allows you to pause and rewind live audio from any application on your Mac. Intermission will buffer up to 3 hours of audio, allowing users to skip through any assortment of audio... Read more
Autopano Giga 3.6 - Stitch multiple imag...
Autopano Giga allows you to stitch 2, 20, or 2,000 images. Version 3.0 integrates impressive new features that will definitely make you adopt Autopano Pro or Autopano Giga: Choose between 9... Read more
Airfoil 4.8.7 - Send audio from any app...
Airfoil allows you to send any audio to AirPort Express units, Apple TVs, and even other Macs and PCs, all in sync! It's your audio - everywhere. With Airfoil you can take audio from any... Read more
Microsoft Remote Desktop 8.0.8 - Connect...
With Microsoft Remote Desktop, you can connect to a remote PC and your work resources from almost anywhere. Experience the power of Windows with RemoteFX in a Remote Desktop client designed to help... Read more
xACT 2.30 - Audio compression toolkit. (...
xACT stands for X Aaudio Compression Toolkit, an application that encodes and decodes FLAC, SHN, Monkey’s Audio, TTA, Wavpack, and Apple Lossless files. It also can encode these formats to MP3, AAC... Read more
Firefox 31.0 - Fast, safe Web browser. (...
Firefox for Mac offers a fast, safe Web browsing experience. Browse quickly, securely, and effortlessly. With its industry-leading features, Firefox is the choice of Web development professionals... Read more
Little Snitch 3.3.3 - Alerts you to outg...
Little Snitch gives you control over your private outgoing data. Track background activityAs soon as your computer connects to the Internet, applications often have permission to send any... Read more
Thunderbird 31.0 - Email client from Moz...
As of July 2012, Thunderbird has transitioned to a new governance model, with new features being developed by the broader free software and open source community, and security fixes and improvements... Read more

Latest Forum Discussions

See All

Reddme for iPhone - The Reddit Client (...
Reddme for iPhone - The Reddit Client 1.0 Device: iOS iPhone Category: News Price: $.99, Version: 1.0 (iTunes) Description: Reddme for iPhone is an iOS 7-optimized Reddit client that offers a refreshing new way to experience Reddit... | Read more »
Jacob Jones and the Bigfoot Mystery : Ep...
Jacob Jones and the Bigfoot Mystery : Episode 2 1.0 Device: iOS Universal Category: Games Price: $1.99, Version: 1.0 (iTunes) Description: Jacob Jones is back in Episode 2 of one of Apples 'Best of 2013' games and an App Store... | Read more »
New Trailer For Outcast Odyssey, A New K...
New Trailer For Outcast Odyssey, A New Kind of Card Battler Posted by Jennifer Allen on July 25th, 2014 [ permalink ] Out this Fall is a new kind of card battle game: Outcast Odyssey. | Read more »
Garfield: Survival of the Fattest Coming...
Garfield: Survival of the Fattest Coming to iOS this Fall Posted by Jennifer Allen on July 25th, 2014 [ permalink ] Who loves lasagna? Me. Also everyone’s favorite grumpy fat cat, Garfield. | Read more »
Happy Flock Review
Happy Flock Review By Andrew Fisher on July 25th, 2014 Our Rating: :: HERD IT ALL BEFOREUniversal App - Designed for iPhone and iPad Underneath the gloss of Happy Flock’s visuals is a game of very little substance. It’s cute, but... | Read more »
Square Register Updates Adds Offline Pay...
Square Register Updates Adds Offline Payments Posted by Ellis Spice on July 25th, 2014 [ permalink ] Universal App - Designed for iPhone and iPad | Read more »
Looking For Group – Hearthstone’s Curse...
For the first time since its release (which has thankfully been a much shorter window for iPad players than their PC counterparts), Blizzard’s wildly successful Hearthstone: Heroes of Warcraft CCG is sporting some brand new content: the single... | Read more »
Poptile Review
Poptile Review By Jennifer Allen on July 25th, 2014 Our Rating: :: SIMPLY FUNUniversal App - Designed for iPhone and iPad Simple yet a little bit glorious, Poptile is a satisfying entertaining puzzle game with oodles of the ‘one... | Read more »
Modern Combat 5: Blackout Review
Modern Combat 5: Blackout Review By Brittany Vincent on July 25th, 2014 Our Rating: :: LESS QQ, MORE PEW PEWUniversal App - Designed for iPhone and iPad The fifth entry into the blockbuster Modern Combat series is what mobile... | Read more »
Watch and Share Mobile Gameplay Videos W...
Watch and Share Mobile Gameplay Videos With Kamcord Posted by Jennifer Allen on July 25th, 2014 [ permalink ] iPhone App - Designed for the iPhone, compatible with the iPad | Read more »

Price Scanner via MacPrices.net

iMacs on sale for $150 off MSRP, $250 off for...
Best Buy has iMacs on sale for up to $160 off MSRP for a limited time. Choose free home shipping or free instant local store pickup (if available). Prices are valid for online orders only, in-store... Read more
Mac minis on sale for $100 off MSRP, starting...
Best Buy has Mac minis on sale for $100 off MSRP. Choose free shipping or free instant local store pickup. Prices are for online orders only, in-store prices may vary: 2.5GHz Mac mini: $499.99 2.3GHz... Read more
Global Tablet Market Grows 11% in Q2/14 Notwi...
Worldwide tablet sales grew 11.0 percent year over year in the second quarter of 2014, with shipments reaching 49.3 million units according to preliminary data from the International Data Corporation... Read more
New iPhone 6 Models to Have Staggered Release...
Digitimes’ Cage Chao and Steve Shen report that according to unnamed sources in Apple’s upstream iPhone supply chain, the new 5.5-inch iPhone will be released several months later than the new 4.7-... Read more
New iOS App Helps People Feel Good About thei...
Mobile shoppers looking for big savings at their favorite stores can turn to the Goodshop app, a new iOS app with the latest coupons and deals at more than 5,000 online stores. In addition to being a... Read more
Save on 5th generation refurbished iPod touch...
The Apple Store has Apple Certified Refurbished 5th generation iPod touches available starting at $149. Apple’s one-year warranty is included with each model, and shipping is free. Many, but not all... Read more
What Should Apple’s Next MacBook Priority Be;...
Stabley Times’ Phil Moore says that after expanding its iMac lineup with a new low end model, Apple’s next Mac hardware decision will be how it wants to approach expanding its MacBook lineup as well... Read more
ArtRage For iPhone Painting App Free During C...
ArtRage for iPhone is currently being offered for free (regularly $1.99) during Comic-Con San Diego #SDCC, July 24-27, in celebration of the upcoming ArtRage 4.5 and other 64-bit versions of the... Read more
With The Apple/IBM Alliance, Is The iPad Now...
Almost since the iPad was rolled out in 2010, and especially after Apple made a 128 GB storage configuration available in 2012, there’s been debate over whether the iPad is a serious tool for... Read more
MacBook Airs on sale starting at $799, free s...
B&H Photo has the new 2014 MacBook Airs on sale for up to $100 off MSRP for a limited time. Shipping is free, and B&H charges NY sales tax only. They also include free copies of Parallels... Read more

Jobs Board

*Apple* Solutions Consultant (ASC) - Apple (...
**Job Summary** The ASC is an Apple employee who serves as an Apple brand ambassador and influencer in a Reseller's store. The ASC's role is to grow Apple Read more
*Apple* Solutions Consultant (ASC) - Apple (...
**Job Summary** The ASC is an Apple employee who serves as an Apple brand ambassador and influencer in a Reseller's store. The ASC's role is to grow Apple Read more
*Apple* Solutions Consultant (ASC) - Apple (...
**Job Summary** The ASC is an Apple employee who serves as an Apple brand ambassador and influencer in a Reseller's store. The ASC's role is to grow Apple Read more
Sr Software Lead Engineer, *Apple* Online S...
Sr Software Lead Engineer, Apple Online Store Publishing Systems Keywords: Company: Apple Job Code: E3PCAK8MgYYkw Location (City or ZIP): Santa Clara Status: Full Read more
*Apple* Solutions Consultant (ASC) - Apple (...
**Job Summary** The ASC is an Apple employee who serves as an Apple brand ambassador and influencer in a Reseller's store. The ASC's role is to grow Apple Read more
All contents are Copyright 1984-2011 by Xplain Corporation. All rights reserved. Theme designed by Icreon.